We consider the problem of classifying the vulnerabilities present in interface devices that are used in the interaction of people and components of the transport infrastructure of the Smart City. A conceptual model of the terminological base of the subject area is introduced, on the basis of which a unified classification of vulnerabilities is synthesized. A formal record of vulnerability classes is given, as well as their examples.
{"title":"Generalized Classification of Vulnerabilities of Interfaces to the Transport Infrastructure of the Smart City","authors":"K. Izrailov","doi":"10.17587/IT.27.330-336","DOIUrl":"https://doi.org/10.17587/IT.27.330-336","url":null,"abstract":"We consider the problem of classifying the vulnerabilities present in interface devices that are used in the interaction of people and components of the transport infrastructure of the Smart City. A conceptual model of the terminological base of the subject area is introduced, on the basis of which a unified classification of vulnerabilities is synthesized. A formal record of vulnerability classes is given, as well as their examples.","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77833833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Saksonov, Moscow Russian Federation Informatics
A method of depersonalization of large amounts of personal data is proposed. The method preserves the structure and semantics of data, allows you to increase the security of depersonalized data and process personal data without prior depersonalization. A mathematical model of the method is developed. Estimates of security depersonalized data are obtained.
{"title":"Method of Depersonalization of Personal Data","authors":"E. Saksonov, Moscow Russian Federation Informatics","doi":"10.17587/IT.27.314-321","DOIUrl":"https://doi.org/10.17587/IT.27.314-321","url":null,"abstract":"A method of depersonalization of large amounts of personal data is proposed. The method preserves the structure and semantics of data, allows you to increase the security of depersonalized data and process personal data without prior depersonalization. A mathematical model of the method is developed. Estimates of security depersonalized data are obtained.","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76101957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The article is devoted to the description of intelligent information retrieval system development according to industry standards based on the Stanford CoreNLP tool. The description of the subject area, design, and main stages of system development are presented: development of extracting information module from industrial standards, implementation of a web service using the Flask framework, and a client web application on React JS. The use of the developed system by engineers and software developers will make it possible to effectively manage the definition base of industrial standards, understand them correctly and observe them in accordance with the chosen field of knowledge.
{"title":"System Development for Intelligent Search in Industrial Standards","authors":"E. Gosteva, V. Lanin","doi":"10.17587/IT.27.322-330","DOIUrl":"https://doi.org/10.17587/IT.27.322-330","url":null,"abstract":"The article is devoted to the description of intelligent information retrieval system development according to industry standards based on the Stanford CoreNLP tool. The description of the subject area, design, and main stages of system development are presented: development of extracting information module from industrial standards, implementation of a web service using the Flask framework, and a client web application on React JS. The use of the developed system by engineers and software developers will make it possible to effectively manage the definition base of industrial standards, understand them correctly and observe them in accordance with the chosen field of knowledge.","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88260674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A formal apparatus for modeling the structure of the technological process of mechanical processing based on the algebra of design and technological elements is presented. Design and technological element (manufacturing feature) is considered as a set of geometric processing area and the tool trajectory applied to it, set by a set of technological parameters. Algebra includes an addition operation (adding an element to the process structure) and a multiplication operation (merging elements). The set of processing elements forms an associative and generally noncommutative algebraic group. The possibility of using algebra for analysis and synthesis of technological process structures is shown
{"title":"Algebra of Technological Process","authors":"A. V. Shchekin","doi":"10.17587/IT.27.283-290","DOIUrl":"https://doi.org/10.17587/IT.27.283-290","url":null,"abstract":"A formal apparatus for modeling the structure of the technological process of mechanical processing based on the algebra of design and technological elements is presented. Design and technological element (manufacturing feature) is considered as a set of geometric processing area and the tool trajectory applied to it, set by a set of technological parameters. Algebra includes an addition operation (adding an element to the process structure) and a multiplication operation (merging elements). The set of processing elements forms an associative and generally noncommutative algebraic group. The possibility of using algebra for analysis and synthesis of technological process structures is shown","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84363678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Fahmi, A. G. Davidchuk, E. Kostikova, Inland Shipping
The article considers the relevance of the development of lossless image compression and transmission algorithms and their application for creating transport video surveillance systems. A brief overview of lossless transport image compression methods is provided. We propose a method for compressing transport plots based on the pyramid-recursive method of splitting the source image into polygons of various shapes and sizes. We consider two new algorithms for implementing the proposed method that are fundamentally different from each other: with a transition to the spectral region and without a transition to the spectral region of the original signal to ensure lossless compression. The results of testing various well-known lossless compression algorithms are analyzed: series length, Huffman, and arithmetic encoding, and compared with the proposed algorithms. It is shown that the proposed algorithms are more efficient in terms of compression ratio (2—3 times) compared to the known ones, while the computational complexity increases approximately by more than 3-4 times.
{"title":"New Lossless Compression Algorithms for Transport Images","authors":"S. Fahmi, A. G. Davidchuk, E. Kostikova, Inland Shipping","doi":"10.17587/IT.27.299-305","DOIUrl":"https://doi.org/10.17587/IT.27.299-305","url":null,"abstract":"The article considers the relevance of the development of lossless image compression and transmission algorithms and their application for creating transport video surveillance systems. A brief overview of lossless transport image compression methods is provided. We propose a method for compressing transport plots based on the pyramid-recursive method of splitting the source image into polygons of various shapes and sizes. We consider two new algorithms for implementing the proposed method that are fundamentally different from each other: with a transition to the spectral region and without a transition to the spectral region of the original signal to ensure lossless compression. The results of testing various well-known lossless compression algorithms are analyzed: series length, Huffman, and arithmetic encoding, and compared with the proposed algorithms. It is shown that the proposed algorithms are more efficient in terms of compression ratio (2—3 times) compared to the known ones, while the computational complexity increases approximately by more than 3-4 times.","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89143516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The article describes a new way of concurrent error-detection (CED) systems organization using the Boolean complement method, which involves the use of pre-compression of signals from the diagnostic object using encoders of classical sum codes (Berger codes). Control of compressed signals is carried out using the constant-weight "1-out-of-4" code. In comparison with the known methods of the CED systems organization, it is possible to implement a self-checking digital device using one such circuit, and this significantly reduces the structural redundancy. The article suggests using the encoders of modified Berger codes with improved error detection characteristics as a compression scheme.
{"title":"The Concurrent Error-Detection Systems Organization Based on the Boolean Complement Method with the Preliminary Transformation of Operating Functions into Check Vectors of Berger Codes","authors":"D. Efanov, V. Saposhnikov, V. Saposhnikov","doi":"10.17587/IT.27.306-313","DOIUrl":"https://doi.org/10.17587/IT.27.306-313","url":null,"abstract":"The article describes a new way of concurrent error-detection (CED) systems organization using the Boolean complement method, which involves the use of pre-compression of signals from the diagnostic object using encoders of classical sum codes (Berger codes). Control of compressed signals is carried out using the constant-weight \"1-out-of-4\" code. In comparison with the known methods of the CED systems organization, it is possible to implement a self-checking digital device using one such circuit, and this significantly reduces the structural redundancy. The article suggests using the encoders of modified Berger codes with improved error detection characteristics as a compression scheme.","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86309443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The article discusses various queuing systems (QS) formed by four laws of probability distributions: exponential, hyperexponential, Erlang and hyper-Erlang of the second order. These four laws form sixteen different QS. In contrast to the classical theory, this article considers QS with distribution laws shifted to the right from the zero point. Such QS are of type G/G/1 with arbitrary laws of the distribution of intervals between the requirements of the input flow and the service time. As you know, for such systems it is impossible to obtain solutions for the main characteristic of QS the average waiting time in the general case. Therefore, studies of such systems are important for special cases of distribution laws. The article provides an overview of the author's results for the average waiting time in a queue in a closed form for systems with input distributions shifted to the right from the zero point. To solve this problem, the spectral decomposition method for solving the Lindley integral equation was used. In the course of solving the problem, spectral decompositions of the solution of the Lindley integral equation for eight systems were obtained and with their help calculation formulas were derived for the average waiting time in the queue. It is shown that in systems with delay, the average waiting time is shorter than in conventional systems. The obtained calculation formulas for the average waiting time expand and complement the well-known incomplete formula of the queuing theory for the average waiting time for G/G/1 systems. The proposed approach allows us to calculate the average value and moments of higher orders of waiting time for these systems in mathematical packages for a wide range of changes in traffic parameters. Given the fact that the variation in packet delay (jitter) in the telecommunications standard is defined as the spread of waiting time around its average value, the jitter can be determined through the variance of the waiting time.
{"title":"Queuing Systems with a Time Lag","authors":"V. Tarasov, S. Informatics","doi":"10.17587/IT.27.291-298","DOIUrl":"https://doi.org/10.17587/IT.27.291-298","url":null,"abstract":"The article discusses various queuing systems (QS) formed by four laws of probability distributions: exponential, hyperexponential, Erlang and hyper-Erlang of the second order. These four laws form sixteen different QS. In contrast to the classical theory, this article considers QS with distribution laws shifted to the right from the zero point. Such QS are of type G/G/1 with arbitrary laws of the distribution of intervals between the requirements of the input flow and the service time. As you know, for such systems it is impossible to obtain solutions for the main characteristic of QS the average waiting time in the general case. Therefore, studies of such systems are important for special cases of distribution laws. The article provides an overview of the author's results for the average waiting time in a queue in a closed form for systems with input distributions shifted to the right from the zero point. To solve this problem, the spectral decomposition method for solving the Lindley integral equation was used. In the course of solving the problem, spectral decompositions of the solution of the Lindley integral equation for eight systems were obtained and with their help calculation formulas were derived for the average waiting time in the queue. It is shown that in systems with delay, the average waiting time is shorter than in conventional systems. The obtained calculation formulas for the average waiting time expand and complement the well-known incomplete formula of the queuing theory for the average waiting time for G/G/1 systems. The proposed approach allows us to calculate the average value and moments of higher orders of waiting time for these systems in mathematical packages for a wide range of changes in traffic parameters. Given the fact that the variation in packet delay (jitter) in the telecommunications standard is defined as the spread of waiting time around its average value, the jitter can be determined through the variance of the waiting time.","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83686457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
El domingo 29 de noviembre del 2020, en el Foro Shakespeare, a las 19:30 horas, se estreno la obra La Alacena. Documental miniatura sobre Maria Izquierdo, escrita por Tanya Huntington, cuya produccion fue realizada por Fortuna, Colectivo de Creacion. Dicha obra cuenta con la direccion de Aurora Gomez Meza y las actuaciones de Abigail Espindola y Marysol Cordourier, quien fue responsable del proyecto escenico apoyado por la Beca Creadores Escenicos del Fondo Nacional para la Cultura y las Artes 2019. Este estreno se suma a las actividades de reapertura en los espacios teatrales de la Ciudad de Mexico y, debido a las nuevas regularizaciones sanitarias, tuvo un cupo presencial limitado y la opcion de acceso al espectaculo via streaming, gracias a lo cual nos fue posible la “asistencia” a publico en distintas partes del pais. Recibido: 01 de diciembre de 2020 Aceptado: 09 de febrero de 2021
2020年11月29日，周日，19:30，戏剧《la Alacena》在莎士比亚论坛首映。关于玛丽亚·伊兹基耶尔多的微型纪录片，由坦尼娅·亨廷顿编剧，由Fortuna collective de Creacion制作。该作品由Aurora Gomez Meza指导，Abigail Espindola和Marysol Cordourier表演，他们负责由2019年国家文化和艺术基金风景创作者奖学金支持的风景项目。重新开展的此项首映活动在墨西哥城和戏剧空间,由于新的卫生波动,现场有配额限制并且选择进入艺人通过流媒体,因此我们无法“援助”被观众在不同地区的国家。收到日期:2020年12月01日接受日期:2021年2月09日
{"title":"La alacena. Documental miniatura sobre María Izquierdo","authors":"Alicia Petrilli Vargas","doi":"10.25009/IT.V12I19.2660","DOIUrl":"https://doi.org/10.25009/IT.V12I19.2660","url":null,"abstract":"El domingo 29 de noviembre del 2020, en el Foro Shakespeare, a las 19:30 horas, se estreno la obra La Alacena. Documental miniatura sobre Maria Izquierdo, escrita por Tanya Huntington, cuya produccion fue realizada por Fortuna, Colectivo de Creacion. Dicha obra cuenta con la direccion de Aurora Gomez Meza y las actuaciones de Abigail Espindola y Marysol Cordourier, quien fue responsable del proyecto escenico apoyado por la Beca Creadores Escenicos del Fondo Nacional para la Cultura y las Artes 2019. Este estreno se suma a las actividades de reapertura en los espacios teatrales de la Ciudad de Mexico y, debido a las nuevas regularizaciones sanitarias, tuvo un cupo presencial limitado y la opcion de acceso al espectaculo via streaming, gracias a lo cual nos fue posible la “asistencia” a publico en distintas partes del pais. Recibido: 01 de diciembre de 2020 Aceptado: 09 de febrero de 2021","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76355295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
El ano 2020 sera recordado por una serie de acontecimientos desafortunados, como la ola de muerte por la transmision a nivel mundial de COVID–19, que habia causado mas de 180 mil fallecimientos tan solo en Mexico hacia febrero de 2021; en este pais, los decesos de reconocidos artistas han sido dolorosos. Han muerto, por causa de esta enfermedad, Cecilia Romo, Oscar Chavez, Raymundo Capetillo, Pilar Pellicer, Rogerio Baruch y, por otras causas, Jose Luis Ibanez, Hector Suarez, Hector Ortega, Monica Miguel, Aaron Hernan, Jaime Humberto Hermosillo, Manuel Felguerez y, desafortunadamente, un largo etcetera. Recibido: 17 de noviembre de 2020 Aceptado: 01 de marzo de 2021
2020年将因一系列不幸事件而被铭记，例如2019冠状病毒病(COVID - 19)在全球传播造成的死亡浪潮，到2021年2月，仅在墨西哥就造成18万多人死亡;在这个国家，著名艺术家的去世是痛苦的。他们死于这种疾病，有Cecilia Romo, Oscar Chavez, Raymundo Capetillo, Pilar Pellicer, Rogerio Baruch，还有Jose Luis Ibanez, Hector Suarez, Hector Ortega, Monica Miguel, Aaron Hernan, Jaime Humberto Hermosillo, Manuel Felguerez，不幸的是，还有很多其他原因。收到日期:2020年11月17日接受日期:2021年3月1日
{"title":"Mónica Kubli, Félida Medina y Marcela Zorrilla. Tres escenógrafas mexicanas, su legado","authors":"Patricia Ruíz Rivera","doi":"10.25009/IT.V12I19.2665","DOIUrl":"https://doi.org/10.25009/IT.V12I19.2665","url":null,"abstract":"El ano 2020 sera recordado por una serie de acontecimientos desafortunados, como la ola de muerte por la transmision a nivel mundial de COVID–19, que habia causado mas de 180 mil fallecimientos tan solo en Mexico hacia febrero de 2021; en este pais, los decesos de reconocidos artistas han sido dolorosos. Han muerto, por causa de esta enfermedad, Cecilia Romo, Oscar Chavez, Raymundo Capetillo, Pilar Pellicer, Rogerio Baruch y, por otras causas, Jose Luis Ibanez, Hector Suarez, Hector Ortega, Monica Miguel, Aaron Hernan, Jaime Humberto Hermosillo, Manuel Felguerez y, desafortunadamente, un largo etcetera. Recibido: 17 de noviembre de 2020 Aceptado: 01 de marzo de 2021","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89500381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fratini Serafide, Roberto. Escrituras del silencio. Figuras, secretos, conspiraciones y diseminaciones de una dramaturgia de la danza. Ciudad de Mexico: Paso de Gato, 2018, pp. 592. ISBN: 978-607-8584-26-0 En un silencio extendido a 568 paginas de escritura, Roberto Fratini Serafide, a traves de la editorial Paso de Gato, con el apoyo del Fondo Nacional para la Cultura y las Artes, en colaboracion con la Universidad de Guadalajara y el Centro Nacional de Investigacion, Documentacion e Informacion Teatral Rodolfo Usigli (citru), nos ofrece una compilacion de textos que piden ser leidos con una racion adecuada de paciencia. Paciencia, entendida en los mismos terminos propuestos por el autor, como una aceptacion de “las formas de cosas y eventos capaces de invalidar todo formato previo de la experiencia” (413), y como un repudio hacia la “tentacion de entender de inmediato cosas cuyo sentido no sera restituido mas que a traves de latitudes incalculables de tiempo y de vida interior” (ibidem). Recibido: 02 de diciembre de 2020 Aceptado: 09 de febrero de 2021
{"title":"Escrituras del silencio. Figuras, secretos, conspiraciones y diseminaciones de una dramaturgia de la danza, de Roberto Fratini","authors":"Paulina María López Vega","doi":"10.25009/IT.V12I19.2663","DOIUrl":"https://doi.org/10.25009/IT.V12I19.2663","url":null,"abstract":"Fratini Serafide, Roberto. Escrituras del silencio. Figuras, secretos, conspiraciones y diseminaciones de una dramaturgia de la danza. Ciudad de Mexico: Paso de Gato, 2018, pp. 592. ISBN: 978-607-8584-26-0 En un silencio extendido a 568 paginas de escritura, Roberto Fratini Serafide, a traves de la editorial Paso de Gato, con el apoyo del Fondo Nacional para la Cultura y las Artes, en colaboracion con la Universidad de Guadalajara y el Centro Nacional de Investigacion, Documentacion e Informacion Teatral Rodolfo Usigli (citru), nos ofrece una compilacion de textos que piden ser leidos con una racion adecuada de paciencia. Paciencia, entendida en los mismos terminos propuestos por el autor, como una aceptacion de “las formas de cosas y eventos capaces de invalidar todo formato previo de la experiencia” (413), y como un repudio hacia la “tentacion de entender de inmediato cosas cuyo sentido no sera restituido mas que a traves de latitudes incalculables de tiempo y de vida interior” (ibidem). Recibido: 02 de diciembre de 2020 Aceptado: 09 de febrero de 2021","PeriodicalId":43953,"journal":{"name":"IT-Information Technology","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72838007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：