Informatsionno-Upravliaiushchie Sistemy最新文献

{"title":"Hardware and software complex for remote monitoring and control of a pregnant woman's health state","authors":"I. Korneeva, Kristina Kramar, Evgeniya Semenova, A. Sergeev, Z. Yuldashev","doi":"10.31799/1684-8853-2021-6-21-30","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-6-21-30","url":null,"abstract":"Introduction: The problem of remote monitoring of people's health has become especially urgent nowadays due to the rapid spread of dangerous infectious and viral diseases, such as COVID-19. This period was especially difficult for pregnant women. According to Rosstat statistics, in 2020, maternal mortality in Russia increased by 24.4% compared to 2019 and reached 11.2 per 100,000 newborns. This is the worst level since 2013. In the current conditions, there is a necessity for developing remote monitoring systems which allow you to check the health status of a pregnant woman remotely using tools outside a medical institution. Purpose: To develop the structure and validate the choice of elements for a hardware and software complex which would perform remote monitoring outside a medical institution and assess the condition of pregnant women during their active life. Results: An automated questionnaire for pregnant women has been developed in accordance with the methodological recommendations of the Ministry of Health of the Russian Federation, providing a quantitative assessment of the current state of a pregnant woman in order to study the dynamics of her health. Based on the results of instrumental studies, according to 30 factors of patient's body functioning and the questionnaire data, a set of diagnostically significant indicators was developed. For each of them, a range of values was specified (norm, alarm, pathology). We have developed an experimental sample of the hardware and software complex and tested its functioning, particularly the modes of taking biomedical data by urine tests. The algorithms for processing and analysis of biomedical data have been experimentally studied in order to confirm the validity of the proposed solutions. Practical relevance: The results of the studies allow us to affirmatively answer the question about the possibility of remote monitoring outside a medical institution and assessing the health state of a pregnant woman in order to predict pregnancy complications, as well as to validate the choice of measuring channels for recording a complex of biomedical signals and data, and the choice of algorithms for information processing and analysis.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46998099","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}

{"title":"Analysis of the probability of connectivity of a telecommunications network based on the reduction of several non-connectivity events to a union of independent events","authors":"A. Batenkov, K. Batenkov, A. Fokin","doi":"10.31799/1684-8853-2021-6-53-63","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-6-53-63","url":null,"abstract":"Introduction: For large and structurally complex telecommunication networks, calculating the connectivity probability turns out to be a very cumbersome and time-consuming process due to the huge number of elements in the resulting expression. The most expedient way out of this situation is a method based on the representation of a network connectivity event in the form of sums of products of incompatible events. However, this method also requires performing additional operations on sets in some cases. Purpose: To eliminate the main disadvantages of the method using multi-variable inversion. Results: It is shown that the connectivity event of a graph should be interpreted as a union of connectivity events of all its subgraphs, which leads to the validity of the expression for the connectivity event of the network in the form of a union of connectivity events of typical subgraphs (path, backbone, and in general, a multi-pole tree) of the original random graph. An iterative procedure is proposed for bringing a given number of connectivity events to the union of independent events by sequentially adding subgraph disjoint events. The possibility of eliminating repetitive routine procedures inherent in methods using multi-variable inversion is proved by considering not the union of connectivity events (incoherence) degenerating into the sum of incompatible products, but the intersection of opposite events, which also leads to a similar sum. However, to obtain this sum, there is no need to perform a multi-variable inversion for each of the terms over all those previously analyzed. Practical relevance: The obtained analytical relations can be applied in the analysis of reliability, survivability or stability of complex telecommunications networks.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42359133","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}

{"title":"Methodology and information-measuring system for personalized synthesis of lower limb prostheses","authors":"Ludmila Smirnova, G. Ponomarenko, V. Suslyaev","doi":"10.31799/1684-8853-2021-6-64-74","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-6-64-74","url":null,"abstract":"Introduction: One of the methods for managing the quality of prosthetics is optimizing the composition of a modular prosthesis components. Mistakes in choosing models for functional modules of a prosthesis lead to a limited realization of the patient's potential capabilities, or to the choice of expensive highly functional models whose potential cannot be fully realized with the given body system disabilities. One of the most effective ways to solve this problem is to use the computer technology capabilities. Purpose: Substantiation of the methodology for the development of an innovative computer technology for personalized synthesis of a lower-limb prosthesis, including the development of the structure of an information-measuring system for its implementation. Methods: Analysis, synthesis, analogy; expert survey; analytic hierarchy process (Saaty method). The conceptual language of the International Classification of Functioning, Disability and Health was used to describe the factors influencing the requirements for the characteristics of prosthetic modules. Results: In order to choose models for prosthetic modules, we should use an extended system of factors, including both the basic factors associated with the purpose of the products and indicated in the catalogs, and additional factors: impairment indicators of the body functions and structures, the capacity and performance of the patient's activity and participation, the presence of barriers and facilitators environmental factors in which the prosthesis is planned to be used. Taking this system of factors into account, a structural diagram of an information-measuring system for examining a prosthetic patient has been developed. To select the components for the prosthesis, we have substantiated the necessity of creating a global electronic catalog, combining structured information on the models of prosthetic modules supplied by various manufacturers. A matrix representation form is proposed for the knowledge base, reflecting the rules for choosing models according to the correspondence of their characteristics to the estimates of the factors. The methodology of computerized selection of models from the electronic catalog has been substantiated. Practical relevance: The results of the work are a step towards the creation of a technology for a computerized multicriteria choice of components for a modular prosthesis, taking into account the personal needs and functional capabilities of the patient. The use of this technology will improve the patient's rehabilitation level and the quality of his or her life.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69413374","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}

{"title":"Influence of noise and sampling rate on the discrete image representation error","authors":"A. Timofeev, A. Sultanov","doi":"10.31799/1684-8853-2021-5-33-39","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-5-33-39","url":null,"abstract":"Introduction: Digital registration of images is accompanied not only by an error caused by finite spatial resolution of the photo matrix, but also by the effect of noise whose contribution to the total error decreases with an increase in the aperture of the photosensors in the matrix. Thus, changing the sampling rate has the opposite effect on the sampling error and on the error caused by the noise. Purpose: Finding the optimal image sampling rate which would provide the minimum sampling error in the presence of noise.  Results: We have studied how an image discrete representation error depends on the sampling frequency and noise level. The image sampling process in the presence of noise was simulated in the MATLAB environment. The dependencies of the root-mean-square deviation of the sampling error caused by spectrum truncation (decrease in the passband of the low-pass filter) and the noise component of the error on the sampling frequency were plotted. A theorem is formulated on the upper bound of the sampling theorem: when sampling a function of finite duration in the presence of noise, there is a finite minimum value of the sampling error which is determined by the shape of the spectrum of the function and the noise level. Practical relevance: It is advisable to use the research results when choosing a photomatrix by the number of pixels for recording images in the presence of noise, as well as when choosing a low-pass filter passband for primary processing of a digital image.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43995566","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}

{"title":"Combined total variation of first and fractional orders for Poisson noise removal in digital images","authors":"C. Pham, Thi Thu Tran, Minh-Trien Pham, T. Nguyen","doi":"10.31799/1684-8853-2021-5-10-19","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-5-10-19","url":null,"abstract":"Introduction: Many methods have been proposed to handle the image restoration problem with Poisson noise. A popular approach to Poissonian image reconstruction is the one based on Total Variation. This method can provide significantly sharp edges and visually fine images, but it results in piecewise-constant regions in the resulting images. Purpose: Developing an adaptive total variation-based model for the reconstruction of images contaminated by Poisson noise, and an algorithm for solving the optimization problem. Results: We proposed an effective way to restore images degraded by Poisson noise. Using the Bayesian framework, we proposed an adaptive model based on a combination of first-order total variation and fractional order total variation. The first-order total variation model is efficient for suppressing the noise and preserving the keen edges simultaneously. However, the first-order total variation method usually causes artifact problems in the obtained results. To avoid this drawback, we can use high-order total variation models, one of which is the fractional-order total variation-based model for image restoration. In the fractional-order total variation model, the derivatives have an order greater than or equal to one. It leads to the convenience of computation with a compact discrete form. However, methods based on the fractional-order total variation may cause image blurring. Thus, the proposed model incorporates the advantages of two total variation regularization models, having a significant effect on the edge-preserving image restoration. In order to solve the considered optimization problem, the Split Bregman method is used. Experimental results are provided, demonstrating the effectiveness of the proposed method.  Practical relevance: The proposed method allows you to restore Poissonian images preserving their edges. The presented numerical simulation demonstrates the competitive performance of the model proposed for image reconstruction. Discussion: From the experimental results, we can see that the proposed algorithm is effective in suppressing noise and preserving the image edges. However, the weighted parameters in the proposed model were not automatically selected at each iteration of the proposed algorithm. This requires additional research.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48620648","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}

{"title":"Methodological approaches and algorithms for recognizing and counting animals in aerial photographs","authors":"V. Mikhailov, Vladislav Sobolevskii, L. Kolpaschikov, Nikolay V. Soloviev, Georgiy Yakushev","doi":"10.31799/1684-8853-2021-5-20-32","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-5-20-32","url":null,"abstract":"Introduction: The complexity of recognition and counting of objects in a photographic image is directly related to variability of related factors: physical difference of objects from the same class, presence of images similar to objects to be recognized, non-uniform background, change of shooting conditions and position of the objects when the photo was taken. Most challenging are the problems of identifying people in crowds, animals in natural environment, cars from surveillance cameras, objects of construction and infrastructure on aerial photo images, etc. These problems have their own specific factor space, but the methodological approaches to their solution are similar. Purpose: The development of methodologies and software implementations solving the problem of recognition and counting of objects with high variability, on the example of reindeer recognition in the natural environment.  Methods: Two approaches are investigated: feature-based recognition based on binary pixel classification and reference-based recognition using convolutional neural networks. Results: Methodologies and programs have been developed for pixel-by-pixel recognition with subsequent binarization, image clustering and cluster counting and image recognition using the convolutional neural network of Mask R-CNN architecture. The network is first trained to recognize animals as a class from the array of MS COCO dataset images and then trained on the array of aerial photographs of reindeer herds. Analysis of the results shows that feature-based methods with pixel-by-pixel recognition give good results on relatively simple images (recognition error 10–15%). The presence of artifacts on the image that are close to the characteristics of the reindeer images leads to a significant increase in the error. The convolutional neural network showed higher accuracy, which on the test sample was 82%, with no false positives. Practical relevance: А software prototype has been created for the recognition system based on convolutional neural networks with a web interface, and the program itself has been put into limited operation.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41912230","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}

{"title":"Matrix vitrages and regular Hadamard matrices","authors":"A. Vostrikov","doi":"10.31799/1684-8853-2021-5-2-9","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-5-2-9","url":null,"abstract":"Introduction: The Kronecker product of Hadamard matrices when a matrix of order n replaces each element in another matrix of order m, inheriting the sign of the replaced element, is a basis for obtaining orthogonal matrices of order nm. The matrix insertion operation when not only signs but also structural elements (ornamental patterns of matrix portraits) are inherited provides a more general result called a \"vitrage\".  Vitrages based on typical quasi-orthogonal Mersenne (M), Seidel (S) or Euler (E) matrices, in addition to inheriting the sign and pattern, inherit the value of elements other than unity (in amplitude) in a different way, causing the need to revise and systematize the accumulated experience. Purpose: To describe new algorithms for generalized product of matrices, highlighting the constructions that produce regular high-order Hadamard matrices. Results: We have proposed an algorithm for obtaining matrix vitrages by inserting Mersenne matrices into Seidel matrices, which makes it possible to expand the additive chains of matrices of the form M-E-M-E-… and S-E-M-E-…, obtained by doubling the orders and adding an edge. The operation of forming a matrix vitrage allows you to obtain matrices of high orders, keeping the ornamental pattern as an important invariant of the structure. We have shown that the formation of a matrix vitrage inherits the logic of the Scarpi product, but is cannot be reduced to it, since a nonzero distance in order between the multiplicands M and S simplifies the final regular matrix ornamental pattern due to the absence of cyclic displacements. The alternation of M and S matrices allows you to extend the multiplicative chains up to the known gaps in the S matrices. This sheds a new light on the theory of a regular Hadamard matrix as a product of Mersenne and Seidel matrices. Practical relevance: Orthogonal sequences with floating levels and efficient algorithms for finding regular Hadamard matrices with certain useful properties are of direct practical importance for the problems of noise-proof coding, compression and masking of video data.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44761839","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}

{"title":"Adapting Neural Turing Machines for linguistic assessments aggregation in neural-symbolic decision support systems","authors":"A. Demidovskij, E. Babkin","doi":"10.31799/1684-8853-2021-5-40-50","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-5-40-50","url":null,"abstract":"Introduction: The construction of integrated neurosymbolic systems is an urgent and challenging task. Building neurosymbolic decision support systems requires new approaches to represent knowledge about a problem situation and to express symbolic reasoning at the subsymbolic level.  Purpose: Development of neural network architectures and methods for effective distributed knowledge representation and subsymbolic reasoning in decision support systems in terms of algorithms for aggregation of fuzzy expert evaluations to select alternative solutions. Methods: Representation of fuzzy and uncertain estimators in a distributed form using tensor representations; construction of a trainable neural network architecture for subsymbolic aggregation of linguistic estimators. Results: The study proposes two new methods of representation of linguistic assessments in a distributed form. The first approach is based on the possibility of converting an arbitrary linguistic assessment into a numerical representation and consists in converting this numerical representation into a distributed one by converting the number itself into a bit string and further forming a matrix storing the distributed representation of the whole expression for aggregating the assessments. The second approach to translating linguistic assessments to a distributed representation is based on representing the linguistic assessment as a tree and coding this tree using the method of tensor representations, thus avoiding the step of translating the linguistic assessment into a numerical form and ensuring the transition between symbolic and subsymbolic representations of linguistic assessments without any loss of information. The structural elements of the linguistic assessment are treated as fillers with their respective positional roles. A new subsymbolic method of aggregation of linguistic assessments is proposed, which consists in creating a trainable neural network module in the form of a Neural Turing Machine. Practical relevance: The results of the study demonstrate how a symbolic algorithm for aggregation of linguistic evaluations can be implemented by connectionist (or subsymbolic) mechanisms, which is an essential requirement for building distributed neurosymbolic decision support systems.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43378180","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}

{"title":"Planning polyphase behavior of autonomous intelligent mobile systems in uncertain environments","authors":"V. Melekhin, M. Khachumov","doi":"10.31799/1684-8853-2021-4-28-36","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-4-28-36","url":null,"abstract":"Introduction: We discuss the modern ways of developing intelligent problem solvers, focusing on their shortcomings in terms of the efficiency of their application for planning purposeful behavior of autonomous mobile intelligent systems in a priori undescribed conditions of a problem environment. Purpose: Developing a model of knowledge representation and processing which would provide the ways to organize purposeful activity of autonomous intelligent mobile systems in uncertain environment. Methods: Synthesis of frame-like behavior scenarios in the form of polyvariable conditionally dependent predicates whose structure includes complex variables as well as related variables of types “object”, “event” and “relationship”; synthesis of heuristic rules for knowledge representation in the process of purposeful behavior planning. In order to represent complex variables in polyvariable conditionally dependent predicates, fuzzy semantic networks are used which can represent knowledge of variously purposed intelligent systems without regard to particular knowledge domains, being adaptable to a priori undescribed operational conditions. Results: We have proposed a structure of various polyvariable conditionally dependent predicates. On their base, an autonomous intelligent mobile system can organize various activities in a priori undescribed and unstable problem environments. Specially developed knowledge processing tools allow such a system to automatically plan its purposeful behavior in a space of subtasks during the fulfilment of tasks formulated for it. Practical relevance: The obtained results can be efficiently used in building intelligent problem solvers for autonomous intelligent mobile systems of various purpose, capable of performing complex tasks in a priori undescribed operational conditions.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47327732","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}

{"title":"Indexing algorithm based on storing additional distances in metric space for multi-vantage-point tree","authors":"Igor Akeksandrov, Vladimir Fomin","doi":"10.31799/1684-8853-2021-4-18-27","DOIUrl":"https://doi.org/10.31799/1684-8853-2021-4-18-27","url":null,"abstract":"Introduction: The similarity search paradigm is used in various computational tasks, such as classification, data mining, pattern recognition, etc. Currently, the technology of tree-like metric access methods occupies a significant place among search algorithms. The classical problem of reducing the time of similarity search in metric space is relevant for modern systems when processing big complex data. Due to multidimensional nature of the search algorithm effectiveness problem, local research in this direction is in demand, constantly bringing useful results. Purpose: To reduce the computational complexity of tree search algorithms in problems involving metric proximity. Results: We developed a search algorithm for a multi-vantage-point tree, based on the priority node-processing queue. We mathematically formalized the problems of additional calculations and ways to solve them. To improve the performance of similarity search, we have proposed procedures for forming a priority queue of processing nodes and reducing the number of intersections of same level nodes. Structural changes in the multi-vantage-point tree and the use of minimum distances between vantage points and node subtrees provide better search efficiency. More accurate determination of the distance from the search object to the nodes and the fact that the search area intersects with a tree node allows you to reduce the amount of calculations. Practical relevance: The resulting search algorithms need less time to process information due to an insignificant increase in memory requirements. Reducing the information processing time expands the application boundaries of tree metric indexing methods in search problems involving large data sets.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48927948","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}