Abstract A problem of solving a continuous noncooperative game is considered, where the player’s pure strategies are sinusoidal functions of time. In order to reduce issues of practical computability, certainty, and realizability, a method of solving the game approximately is presented. The method is based on mapping the product of the functional spaces into a hyperparallelepiped of the players’ phase lags. The hyperparallelepiped is then substituted with a hypercubic grid due to a uniform sampling. Thus, the initial game is mapped into a finite one, in which the players’ payoff matrices are hypercubic. The approximation is an iterative procedure. The number of intervals along the player’s phase lag is gradually increased, and the respective finite games are solved until an acceptable solution of the finite game becomes sufficiently close to the same-type solutions at the preceding iterations. The sufficient closeness implies that the player’s strategies at the succeeding iterations should be not farther from each other than at the preceding iterations. In a more feasible form, it implies that the respective distance polylines are required to be decreasing on average once they are smoothed with respective polynomials of degree 2, where the parabolas must be having positive coefficients at the squared variable.
{"title":"Acceptable-and-attractive Approximate Solution of a Continuous Non-Cooperative Game on a Product of Sinusoidal Strategy Functional Spaces","authors":"V. Romanuke","doi":"10.2478/fcds-2021-0012","DOIUrl":"https://doi.org/10.2478/fcds-2021-0012","url":null,"abstract":"Abstract A problem of solving a continuous noncooperative game is considered, where the player’s pure strategies are sinusoidal functions of time. In order to reduce issues of practical computability, certainty, and realizability, a method of solving the game approximately is presented. The method is based on mapping the product of the functional spaces into a hyperparallelepiped of the players’ phase lags. The hyperparallelepiped is then substituted with a hypercubic grid due to a uniform sampling. Thus, the initial game is mapped into a finite one, in which the players’ payoff matrices are hypercubic. The approximation is an iterative procedure. The number of intervals along the player’s phase lag is gradually increased, and the respective finite games are solved until an acceptable solution of the finite game becomes sufficiently close to the same-type solutions at the preceding iterations. The sufficient closeness implies that the player’s strategies at the succeeding iterations should be not farther from each other than at the preceding iterations. In a more feasible form, it implies that the respective distance polylines are required to be decreasing on average once they are smoothed with respective polynomials of degree 2, where the parabolas must be having positive coefficients at the squared variable.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"173 - 197"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42895319","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}
Abstract The Depth of Inheritance Tree (DIT) metric, along with other ones, is used for estimating some quality indicators of software systems, including open-source applications (apps). In cases involving multiple inheritances, at a class level, the DIT metric is the maximum length from the node to the root of the tree. At an application (app) level, this metric defines the corresponding average length per class. It is known, at a class level, a DIT value between 2 and 5 is good. At an app level, similar recommended values for the DIT metric are not known. To find the recommended values for the DIT mean of an app we have proposed to use the confidence and prediction intervals. A DIT mean value of an app from the confidence interval is good since this interval indicates how reliable the estimate is for the DIT mean values of all apps used for estimating the interval. A DIT mean value higher than an upper bound of prediction interval may indicate that some classes have a large number of the inheritance levels from the object hierarchy top. What constitutes greater app design complexity as more classes are involved. We have estimated the confidence and prediction intervals of the DIT mean using normalizing transformations for the data sample from 101 open-source apps developed in Java hosted on GitHub for the 0.05 significance level.
继承树深度(Depth of Inheritance Tree, DIT)度量与其他度量一起，用于评估软件系统(包括开源应用程序)的一些质量指标。在涉及多个继承的情况下，在类级别上，DIT度量是从节点到树的根的最大长度。在应用程序级别，这个指标定义了每个类相应的平均长度。众所周知，在类级别上，DIT值在2到5之间是好的。在应用程序级别，不知道DIT度量的类似推荐值。为了找到应用程序的DIT平均值的推荐值，我们建议使用置信区间和预测区间。来自置信区间的应用程序的DIT平均值是好的，因为这个区间表明用于估计区间的所有应用程序的DIT平均值的估计有多可靠。如果DIT平均值高于预测区间的上限，则可能表明某些类具有大量来自对象层次结构顶部的继承级别。当涉及到更多的类时，是什么构成了更大的应用设计复杂性。我们对101个开源应用程序的数据样本使用归一化转换，估计了DIT平均值的置信度和预测区间，这些应用程序是用Java开发的，托管在GitHub上，显著性水平为0.05。
{"title":"A Statistical Evaluation of The Depth of Inheritance Tree Metric for Open-Source Applications Developed in Java","authors":"S. Prykhodko, N. Prykhodko, T. Smykodub","doi":"10.2478/fcds-2021-0011","DOIUrl":"https://doi.org/10.2478/fcds-2021-0011","url":null,"abstract":"Abstract The Depth of Inheritance Tree (DIT) metric, along with other ones, is used for estimating some quality indicators of software systems, including open-source applications (apps). In cases involving multiple inheritances, at a class level, the DIT metric is the maximum length from the node to the root of the tree. At an application (app) level, this metric defines the corresponding average length per class. It is known, at a class level, a DIT value between 2 and 5 is good. At an app level, similar recommended values for the DIT metric are not known. To find the recommended values for the DIT mean of an app we have proposed to use the confidence and prediction intervals. A DIT mean value of an app from the confidence interval is good since this interval indicates how reliable the estimate is for the DIT mean values of all apps used for estimating the interval. A DIT mean value higher than an upper bound of prediction interval may indicate that some classes have a large number of the inheritance levels from the object hierarchy top. What constitutes greater app design complexity as more classes are involved. We have estimated the confidence and prediction intervals of the DIT mean using normalizing transformations for the data sample from 101 open-source apps developed in Java hosted on GitHub for the 0.05 significance level.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"159 - 172"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45628978","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}
Abstract We consider a multicriteria decision analysis (MCDA) problem where importance of criteria, and evaluations of alternatives with respect to the criteria, are expressed on a qualitative ordinal scale. Using the extreme-point principle of Data Envelopment Analysis (DEA), we develop a two-parameter method for obtaining overall ratings of the alternatives when preferences and evaluations are made on an ordinal scale. We assume no parametric setup other than the two parameters that reflect minimum intensities of discriminating among rank positions: one parameter for the alternatives’ ranking and one for the criteria ranking. These parameters are bounded by the ordinal input data, and they imply a universal tie among the alternatives when both parameters are selected to be zero. We describe the model, discuss its theoretical underpinning, and demonstrate its application.
{"title":"Applying Data Envelopment Analysis Principle in Ordinal Multi Criteria Decision Analysis","authors":"M. Kress","doi":"10.2478/fcds-2021-0010","DOIUrl":"https://doi.org/10.2478/fcds-2021-0010","url":null,"abstract":"Abstract We consider a multicriteria decision analysis (MCDA) problem where importance of criteria, and evaluations of alternatives with respect to the criteria, are expressed on a qualitative ordinal scale. Using the extreme-point principle of Data Envelopment Analysis (DEA), we develop a two-parameter method for obtaining overall ratings of the alternatives when preferences and evaluations are made on an ordinal scale. We assume no parametric setup other than the two parameters that reflect minimum intensities of discriminating among rank positions: one parameter for the alternatives’ ranking and one for the criteria ranking. These parameters are bounded by the ordinal input data, and they imply a universal tie among the alternatives when both parameters are selected to be zero. We describe the model, discuss its theoretical underpinning, and demonstrate its application.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"147 - 157"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45519781","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}
Abstract The paper presents technical application of TeX high-level, descriptive markup language for processing geological dataset from soil laboratory. Geotechnical measurements included equivalent soil cohesion, absolute and absolute deformation index, soil compressibility coefficient by time of immersion depth, exposure time to compressive strength to samples and physical and mechanical properties (humidity, density). Dataset was received from laboratory based experimental tests of the physical and mechanical properties of soils. Data were converted to csv table and processed by LaTeX. Methodology is based on LaTeX packages: {tikz}, {tikz-3dplot}, {tikzpicture}, {pgfplot}, {filecontetns}, {spy} for 3D plotting showing correlation in variables and descriptive statistical analysis based on the data array processing. Results demonstrated LaTeX scripts and graphics: 2D and 3D scatterplots, ternaries, bar charts, boxplots, zooming techniques detailing fragment of the plot, flowchart. Research novelty consists in technical approach of TeX language application for geo- logical data processing and graphical visualization. Engineering graphics by TeX was demonstrated with screenshots of the codes used for plotting.
{"title":"Using TeX Markup Language for 3D and 2D Geological Plotting","authors":"V. Lemenkov, Polina Lemenkova","doi":"10.2478/fcds-2021-0004","DOIUrl":"https://doi.org/10.2478/fcds-2021-0004","url":null,"abstract":"Abstract The paper presents technical application of TeX high-level, descriptive markup language for processing geological dataset from soil laboratory. Geotechnical measurements included equivalent soil cohesion, absolute and absolute deformation index, soil compressibility coefficient by time of immersion depth, exposure time to compressive strength to samples and physical and mechanical properties (humidity, density). Dataset was received from laboratory based experimental tests of the physical and mechanical properties of soils. Data were converted to csv table and processed by LaTeX. Methodology is based on LaTeX packages: {tikz}, {tikz-3dplot}, {tikzpicture}, {pgfplot}, {filecontetns}, {spy} for 3D plotting showing correlation in variables and descriptive statistical analysis based on the data array processing. Results demonstrated LaTeX scripts and graphics: 2D and 3D scatterplots, ternaries, bar charts, boxplots, zooming techniques detailing fragment of the plot, flowchart. Research novelty consists in technical approach of TeX language application for geo- logical data processing and graphical visualization. Engineering graphics by TeX was demonstrated with screenshots of the codes used for plotting.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"43 - 69"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41936449","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}
Abstract This paper addresses Acoustic Emission (AE) from Computer Numerical Control (CNC) machining operations. Experimental measurements are performed on the CNC lathe sensors to provide the power consumption data. To this end, a hybrid methodology based on the integration of an Artificial Neural Network (ANN) and a Shuffled Frog-Leaping Algorithm (SFLA) is applied to the data resulting from these measurements for data fusion from the sensors which is called SFLA-ANN. The initial weights of ANN are selected using SFLA. The goal is to assess the potency of the signal periodic component among these sensors. The efficiency of the proposed SFLA-ANN method is analyzed compared to hybrid methodologies of Simulated Annealing (SA) algorithm and ANN (SA-ANN) and Genetic Algorithm (GA) and ANN (GA-ANN).
{"title":"An Integration of Neural Network and Shuffled Frog-Leaping Algorithm for CNC Machining Monitoring","authors":"A. Goli, E. B. Tirkolaee, G. Weber","doi":"10.2478/fcds-2021-0003","DOIUrl":"https://doi.org/10.2478/fcds-2021-0003","url":null,"abstract":"Abstract This paper addresses Acoustic Emission (AE) from Computer Numerical Control (CNC) machining operations. Experimental measurements are performed on the CNC lathe sensors to provide the power consumption data. To this end, a hybrid methodology based on the integration of an Artificial Neural Network (ANN) and a Shuffled Frog-Leaping Algorithm (SFLA) is applied to the data resulting from these measurements for data fusion from the sensors which is called SFLA-ANN. The initial weights of ANN are selected using SFLA. The goal is to assess the potency of the signal periodic component among these sensors. The efficiency of the proposed SFLA-ANN method is analyzed compared to hybrid methodologies of Simulated Annealing (SA) algorithm and ANN (SA-ANN) and Genetic Algorithm (GA) and ANN (GA-ANN).","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"27 - 42"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42629362","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}
Abstract In this paper, we propose an algorithm which is based on many things: the notions well-known of the simplex network method, Ford Fulkerson’s algorithm and our new idea, which is << the gain cycles >>, applied on a bi-objective minimum cost flow problem. This algorithm permits us to have a good order of many criteria in a rapid and an efficient way; because this classification permits us to structure the optimal area, in which we can choose the best action among the others which exist in the objective space. From this one, we distinguish, that the resolution of this problem comes to find an under set of good actions, among which the decider can select an action of best compromise, or make a decision, in the case where reference indications of the deciders may change. A didactic example is done to illustrate our algorithm.
{"title":"An Algorithm for Choosing, Ordering a New Criteria of a Bi-Objective Flow Problem","authors":"Salima Nait Belkacem","doi":"10.2478/fcds-2021-0002","DOIUrl":"https://doi.org/10.2478/fcds-2021-0002","url":null,"abstract":"Abstract In this paper, we propose an algorithm which is based on many things: the notions well-known of the simplex network method, Ford Fulkerson’s algorithm and our new idea, which is << the gain cycles >>, applied on a bi-objective minimum cost flow problem. This algorithm permits us to have a good order of many criteria in a rapid and an efficient way; because this classification permits us to structure the optimal area, in which we can choose the best action among the others which exist in the objective space. From this one, we distinguish, that the resolution of this problem comes to find an under set of good actions, among which the decider can select an action of best compromise, or make a decision, in the case where reference indications of the deciders may change. A didactic example is done to illustrate our algorithm.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"11 - 26"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46478078","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}
Abstract The curves of constant width are special curves used in engineering, architecture and technology. In the literature, these curves are considered according to different roofs in different spaces and some integral characterizations of these curves are obtained. However, in order to examine the geometric properties of curves of constant width, more than characterization is required. In this study, firstly differential equations characterizing quaternionic space curves of constant width are obtained. Then, the approximate solutions of the differential equations obtained are calculated by the Morgan-Voyce polynomial approach.The geometric properties of this curve type are examined with the help of these solutions.
{"title":"Morgan-Voyce Polynomial Approach for Quaternionic Space Curves of Constant Width","authors":"Tuba Ağirman Aydin, R. Ayazoğlu, H. Kocayiğit","doi":"10.2478/fcds-2021-0005","DOIUrl":"https://doi.org/10.2478/fcds-2021-0005","url":null,"abstract":"Abstract The curves of constant width are special curves used in engineering, architecture and technology. In the literature, these curves are considered according to different roofs in different spaces and some integral characterizations of these curves are obtained. However, in order to examine the geometric properties of curves of constant width, more than characterization is required. In this study, firstly differential equations characterizing quaternionic space curves of constant width are obtained. Then, the approximate solutions of the differential equations obtained are calculated by the Morgan-Voyce polynomial approach.The geometric properties of this curve type are examined with the help of these solutions.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"71 - 83"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45537129","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}
Abstract This special issue of the Foundations of Computing and Decision Sciences, titled ”Numerical Techniques Meet with OR”, is devoted to the numerical techniques and their applications in real-world phenomena. The special issue and its editorial present numerical algorithms as they meet with different research topics such as, e.g., from operational research, supply chain management, geometrical structures and Covid-19 effects on financial applications. Besides, the special issue covers instructional information about numerical techniques which are useful for OR research problems and real-world applications on such issues.
{"title":"Editorial – Preface to the Special Issue on Numerical Techniques Meet with OR","authors":"Burcu Gürbüz, G. Weber","doi":"10.2478/fcds-2021-0001","DOIUrl":"https://doi.org/10.2478/fcds-2021-0001","url":null,"abstract":"Abstract This special issue of the Foundations of Computing and Decision Sciences, titled ”Numerical Techniques Meet with OR”, is devoted to the numerical techniques and their applications in real-world phenomena. The special issue and its editorial present numerical algorithms as they meet with different research topics such as, e.g., from operational research, supply chain management, geometrical structures and Covid-19 effects on financial applications. Besides, the special issue covers instructional information about numerical techniques which are useful for OR research problems and real-world applications on such issues.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"3 - 10"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43927737","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}
Esmehan Uçar, Sümeyra Uçar, F. Evirgen, N. Özdemir
Abstract Smoking is the most lethal social poisoning event. The World Health Organization defines smoking as the most important preventable cause of disease. Around 4.9 million people worldwide die from smoking every year. In order to analysis this matter, we aim to investigate an e-cigarette smoking model with Atangana-Baleanu fractional derivative. We obtain the existence conditions of the solution for this fractional model utilizing fixed-point theory. After giving existence conditions, the uniqueness of the solution is proved. Finally, to show the effect of the Atangana-Baleanu fractional derivative on the model, we give some numerical results supported by illustrative graphics.
{"title":"Investigation of E-Cigarette Smoking Model with Mittag-Leffler Kernel","authors":"Esmehan Uçar, Sümeyra Uçar, F. Evirgen, N. Özdemir","doi":"10.2478/fcds-2021-0007","DOIUrl":"https://doi.org/10.2478/fcds-2021-0007","url":null,"abstract":"Abstract Smoking is the most lethal social poisoning event. The World Health Organization defines smoking as the most important preventable cause of disease. Around 4.9 million people worldwide die from smoking every year. In order to analysis this matter, we aim to investigate an e-cigarette smoking model with Atangana-Baleanu fractional derivative. We obtain the existence conditions of the solution for this fractional model utilizing fixed-point theory. After giving existence conditions, the uniqueness of the solution is proved. Finally, to show the effect of the Atangana-Baleanu fractional derivative on the model, we give some numerical results supported by illustrative graphics.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"97 - 109"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46710422","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}
Abstract In this paper effects of COVID–19 pandemic on stock market network are analyzed by an application of operational research with a mathematical approach. For this purpose two minimum spanning trees for each time period namely before and during COVID–19 pandemic are constructed. Dynamic time warping algorithm is used to measure the similarity between each time series of the investigated stock markets. Then, clusters of investigated stock markets are constructed. Numerical values of the topology evaluation for each cluster and time period is computed.
{"title":"Understanding the Impact of COVID–19 on Global Financial Network Using Graph Based Algorithm: Minimum Spanning Tree Approach","authors":"Veysel Fuat Hatipoğlu","doi":"10.2478/fcds-2021-0008","DOIUrl":"https://doi.org/10.2478/fcds-2021-0008","url":null,"abstract":"Abstract In this paper effects of COVID–19 pandemic on stock market network are analyzed by an application of operational research with a mathematical approach. For this purpose two minimum spanning trees for each time period namely before and during COVID–19 pandemic are constructed. Dynamic time warping algorithm is used to measure the similarity between each time series of the investigated stock markets. Then, clusters of investigated stock markets are constructed. Numerical values of the topology evaluation for each cluster and time period is computed.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"111 - 123"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48375851","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
扫码关注我们
求助内容：
应助结果提醒方式：