Abstract Conflict is recognized as a major barrier in socio-economic development. In conflict situations, most sectors such as health, food, shelter and education are adversely affected. The provision of education services to conflict-affected children saves them from becoming a lost generation and contributes to community building. Thus, we conducted this research to investigate the potential of a GIS (Geographic Information Systems) approach and risk assessment based multi-criteria decision making (MCDM) for the allocation of displaced dropped-out children to the most appropriate educational centres, taking into account multiple goals related to cost, distance, risk, etc. A two-stage approach was adopted, utilizing a risk assessment approach, and a location-allocation approach. The risk assessment approach was carried out using GIS and F-AHP (Fuzzy Analytic Hierarchy Process) to determine the risk value of each candidate educational centre in the conflict area. In the location-allocation stage, a mathematical model was developed to allocate all demands to the chosen centres. All presented methods were computationally conducted on real case data provided by direct beneficiaries and stakeholders in the 26 sub-districts in the Idleb governorate, Syria. The computational results demonstrate that the proposed approaches ensure practical and theoretical impacts.
{"title":"A MCDM Based on Goal Programming and GIS-Based Risk Assessment for the Evaluation of Educational Locations in Conflict Areas","authors":"J. Hallak, Elifcan Göçmen Polat","doi":"10.2478/fcds-2021-0022","DOIUrl":"https://doi.org/10.2478/fcds-2021-0022","url":null,"abstract":"Abstract Conflict is recognized as a major barrier in socio-economic development. In conflict situations, most sectors such as health, food, shelter and education are adversely affected. The provision of education services to conflict-affected children saves them from becoming a lost generation and contributes to community building. Thus, we conducted this research to investigate the potential of a GIS (Geographic Information Systems) approach and risk assessment based multi-criteria decision making (MCDM) for the allocation of displaced dropped-out children to the most appropriate educational centres, taking into account multiple goals related to cost, distance, risk, etc. A two-stage approach was adopted, utilizing a risk assessment approach, and a location-allocation approach. The risk assessment approach was carried out using GIS and F-AHP (Fuzzy Analytic Hierarchy Process) to determine the risk value of each candidate educational centre in the conflict area. In the location-allocation stage, a mathematical model was developed to allocate all demands to the chosen centres. All presented methods were computationally conducted on real case data provided by direct beneficiaries and stakeholders in the 26 sub-districts in the Idleb governorate, Syria. The computational results demonstrate that the proposed approaches ensure practical and theoretical impacts.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"361 - 391"},"PeriodicalIF":1.1,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48852898","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 recommender system (RS) filters out important information from a large pool of dynamically generated information to set some important decisions in terms of some recommendations according to the user’s past behavior, preferences, and interests. A recommender system is the subclass of information filtering systems that can anticipate the needs of the user before the needs are recognized by the user in the near future. But an evaluation of the recommender system is an important factor as it involves the trust of the user in the system. Various incompatible assessment methods are used for the evaluation of recommender systems, but the proper evaluation of a recommender system needs a particular objective set by the recommender system. This paper surveys and organizes the concepts and definitions of various metrics to assess recommender systems. Also, this survey tries to find out the relationship between the assessment methods and their categorization by type.
{"title":"Assessment Methods for Evaluation of Recommender Systems: A Survey","authors":"Madhusree Kuanr, Puspanjali Mohapatra","doi":"10.2478/fcds-2021-0023","DOIUrl":"https://doi.org/10.2478/fcds-2021-0023","url":null,"abstract":"Abstract The recommender system (RS) filters out important information from a large pool of dynamically generated information to set some important decisions in terms of some recommendations according to the user’s past behavior, preferences, and interests. A recommender system is the subclass of information filtering systems that can anticipate the needs of the user before the needs are recognized by the user in the near future. But an evaluation of the recommender system is an important factor as it involves the trust of the user in the system. Various incompatible assessment methods are used for the evaluation of recommender systems, but the proper evaluation of a recommender system needs a particular objective set by the recommender system. This paper surveys and organizes the concepts and definitions of various metrics to assess recommender systems. Also, this survey tries to find out the relationship between the assessment methods and their categorization by type.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"393 - 421"},"PeriodicalIF":1.1,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42389803","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 special issue: “Numerical Techniques Meet with OR” of the Foundations of Computing and Decision Sciences consists of two parts which are of the main theme of numerical techniques and their applications in multi-disciplinary areas. The first part of this special issue was already collected in the FCDS Vol. 46, issue 1. In this second part of our special issue editorial, a description of the special issue presents numerical methods which can be used as alternative techniques for Scientific Computing and led Operational Research applications in many fields for further investigation.
{"title":"An Introduction to the Special Issue on Numerical Techniques Meet with OR - Part II","authors":"Burcu Gürbüz, G. Weber","doi":"10.2478/fcds-2021-0013","DOIUrl":"https://doi.org/10.2478/fcds-2021-0013","url":null,"abstract":"Abstract The special issue: “Numerical Techniques Meet with OR” of the Foundations of Computing and Decision Sciences consists of two parts which are of the main theme of numerical techniques and their applications in multi-disciplinary areas. The first part of this special issue was already collected in the FCDS Vol. 46, issue 1. In this second part of our special issue editorial, a description of the special issue presents numerical methods which can be used as alternative techniques for Scientific Computing and led Operational Research applications in many fields for further investigation.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"201 - 204"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46373900","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 article, we present an efficient method for solving Abel’s integral equations. This important equation is consisting of an integral equation that is modeling many problems in literature. Our proposed method is based on first taking the truncated Taylor expansions of the solution function and fractional derivatives, then substituting their matrix forms into the equation. The main character behind this technique’s approach is that it reduces such problems to solving a system of algebraic equations, thus greatly simplifying the problem. Numerical examples are used to illustrate the preciseness and effectiveness of the proposed method. Figures and tables are demonstrated to solutions impress. Also, all numerical examples are solved with the aid of Maple.
{"title":"New Numerical Approach for Solving Abel’s Integral Equations","authors":"Ayşe Anapalı Şenel, Yalçın Öztürk, Mustafa Gülsu","doi":"10.2478/fcds-2021-0017","DOIUrl":"https://doi.org/10.2478/fcds-2021-0017","url":null,"abstract":"Abstract In this article, we present an efficient method for solving Abel’s integral equations. This important equation is consisting of an integral equation that is modeling many problems in literature. Our proposed method is based on first taking the truncated Taylor expansions of the solution function and fractional derivatives, then substituting their matrix forms into the equation. The main character behind this technique’s approach is that it reduces such problems to solving a system of algebraic equations, thus greatly simplifying the problem. Numerical examples are used to illustrate the preciseness and effectiveness of the proposed method. Figures and tables are demonstrated to solutions impress. Also, all numerical examples are solved with the aid of Maple.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"255 - 271"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44024076","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 today’s society, decision making is becoming more important and complicated with increasing and complex data. Decision making by using soft set theory, herein, we firstly report the comparison of soft intervals (SI) as the generalization of interval soft sets (ISS). The results showed that SIs are more effective and more general than the ISSs, for solving decision making problems due to allowing the ranking of parameters. Tabular form of SIs were used to construct a mathematical algorithm to make a decision for problems that involves uncertainties. Since these kinds of problems have huge data, constructing new and effective methods solving these problems and transforming them into the machine learning methods is very important. An important advance of our presented method is being a more general method than the Decision-Making methods based on special situations of soft set theory. The presented method in this study can be used for all of them, while the others can only work in special cases. The structures obtained from the results of soft intervals were subjected to test with examples. The designed algorithm was written in recently used functional programing language C# and applied to the problems that have been published in earlier studies. This is a pioneering study, where this type of mathematical algorithm was converted into a code and applied successfully.
{"title":"A Soft Interval Based Decision Making Method and Its Computer Application","authors":"Gözde Yaylalı, N. Polat, B. Tanay","doi":"10.2478/fcds-2021-0018","DOIUrl":"https://doi.org/10.2478/fcds-2021-0018","url":null,"abstract":"Abstract In today’s society, decision making is becoming more important and complicated with increasing and complex data. Decision making by using soft set theory, herein, we firstly report the comparison of soft intervals (SI) as the generalization of interval soft sets (ISS). The results showed that SIs are more effective and more general than the ISSs, for solving decision making problems due to allowing the ranking of parameters. Tabular form of SIs were used to construct a mathematical algorithm to make a decision for problems that involves uncertainties. Since these kinds of problems have huge data, constructing new and effective methods solving these problems and transforming them into the machine learning methods is very important. An important advance of our presented method is being a more general method than the Decision-Making methods based on special situations of soft set theory. The presented method in this study can be used for all of them, while the others can only work in special cases. The structures obtained from the results of soft intervals were subjected to test with examples. The designed algorithm was written in recently used functional programing language C# and applied to the problems that have been published in earlier studies. This is a pioneering study, where this type of mathematical algorithm was converted into a code and applied successfully.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"7 9","pages":"273 - 296"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41330216","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 study, investigation of the economic growth of the Organization for Economic Cooperation and Development (OECD) countries and the countries in different income groups in the World Data Bank is conducted by using causality analyses and Generalized Estimating Equations (GEEs) which is an extension of Generalized Linear Models (GLMs). Eight different macro-economic, energy and environmental variables such as the gross domestic product (GDP) (current US$), CO2 emission (metric tons per capita), electric power consumption (kWh per capita), energy use (kg of oil equivalent per capita), imports of goods and services (% of GDP), exports of goods and services (% of GDP), foreign direct investment (FDI) and population growth rate (annual %) have been used. These countries have been categorized according to their OECD memberships and income groups. The causes of the economic growth of these countries belonging to their OECD memberships and income groups have been determined by using the Toda-Yamamoto causality test. Furthermore, various GEE models have been established for the economic growth of these countries belonging to their OECD membership and income groups in the aspect of the above variables. These various GEE models for the investigation of the economic growth of these countries have been compared to examine the contribution of the causality analyses to the statistical model establishment. As a result of this study, the highlight is found as the use of causally-related variables in the causality-based GEE models is much more appropriate than in the non-causality based GEE models for determining the economic growth profiles of these countries.
{"title":"Some Generalized Estimating Equations Models Based on Causality Tests for Investigation of The Economic Growth of The Country Groups","authors":"H. Yonar, Neslihan Iyit","doi":"10.2478/fcds-2021-0019","DOIUrl":"https://doi.org/10.2478/fcds-2021-0019","url":null,"abstract":"Abstract In this study, investigation of the economic growth of the Organization for Economic Cooperation and Development (OECD) countries and the countries in different income groups in the World Data Bank is conducted by using causality analyses and Generalized Estimating Equations (GEEs) which is an extension of Generalized Linear Models (GLMs). Eight different macro-economic, energy and environmental variables such as the gross domestic product (GDP) (current US$), CO2 emission (metric tons per capita), electric power consumption (kWh per capita), energy use (kg of oil equivalent per capita), imports of goods and services (% of GDP), exports of goods and services (% of GDP), foreign direct investment (FDI) and population growth rate (annual %) have been used. These countries have been categorized according to their OECD memberships and income groups. The causes of the economic growth of these countries belonging to their OECD memberships and income groups have been determined by using the Toda-Yamamoto causality test. Furthermore, various GEE models have been established for the economic growth of these countries belonging to their OECD membership and income groups in the aspect of the above variables. These various GEE models for the investigation of the economic growth of these countries have been compared to examine the contribution of the causality analyses to the statistical model establishment. As a result of this study, the highlight is found as the use of causally-related variables in the causality-based GEE models is much more appropriate than in the non-causality based GEE models for determining the economic growth profiles of these countries.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"297 - 315"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46708502","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 study, unit-speed the Legendre curves are studied in Sasakian 3-manifold. Firstly, differential equations characterizing the Legendre curves are obtained and the method used for the approximate solution is explained. Then, the approximate solution is found for one of the characterizations of the Legendre curve with the Legendre matrix collocation method. In addition, a sample application is made to make the method more understandable. And finally, with the help of these equations and the approximate solution, the geometric properties of this curve type are examined.
{"title":"Legendre Matrix Method for Legendre Curve in Sasakian 3-Manifold","authors":"Tuba Ağirman Aydin, M. Sezer, H. Kocayiğit","doi":"10.2478/fcds-2021-0014","DOIUrl":"https://doi.org/10.2478/fcds-2021-0014","url":null,"abstract":"Abstract In this study, unit-speed the Legendre curves are studied in Sasakian 3-manifold. Firstly, differential equations characterizing the Legendre curves are obtained and the method used for the approximate solution is explained. Then, the approximate solution is found for one of the characterizations of the Legendre curve with the Legendre matrix collocation method. In addition, a sample application is made to make the method more understandable. And finally, with the help of these equations and the approximate solution, the geometric properties of this curve type are examined.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"205 - 219"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41386365","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 A Laplace operator and harmonic curve have very important uses in various engineering science such as quantum mechanics, wave propagation, diffusion equation for heat, and fluid flow. Additionally, the differential equation characterizations of the harmonic curves play an important role in estimating the geometric properties of these curves. Hence, this paper proposes to compute some new differential equation characterizations of the harmonic curves in Euclidean 3-space by using an alternative frame named the N-Bishop frame. Firstly, we investigated some new differential equation characterizations of the space curves due to the N-Bishop frame. Secondly, we firstly introduced some new space curves which have the harmonic and harmonic 1-type vectors due to alternative frame N-Bishop frame. Finally, we compute new differential equation characterizations using the N-Bishop Darboux and normal Darboux vectors. Thus, using these differential equation characterizations we have proved in which conditions the curve indicates a helix.
{"title":"Some New Characterizations of The Harmonic and Harmonic 1-Type Curves in Euclidean 3-Space","authors":"H. K. Samanci, Sedat Ayaz, H. Kocayiğit","doi":"10.2478/fcds-2021-0016","DOIUrl":"https://doi.org/10.2478/fcds-2021-0016","url":null,"abstract":"Abstract A Laplace operator and harmonic curve have very important uses in various engineering science such as quantum mechanics, wave propagation, diffusion equation for heat, and fluid flow. Additionally, the differential equation characterizations of the harmonic curves play an important role in estimating the geometric properties of these curves. Hence, this paper proposes to compute some new differential equation characterizations of the harmonic curves in Euclidean 3-space by using an alternative frame named the N-Bishop frame. Firstly, we investigated some new differential equation characterizations of the space curves due to the N-Bishop frame. Secondly, we firstly introduced some new space curves which have the harmonic and harmonic 1-type vectors due to alternative frame N-Bishop frame. Finally, we compute new differential equation characterizations using the N-Bishop Darboux and normal Darboux vectors. Thus, using these differential equation characterizations we have proved in which conditions the curve indicates a helix.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"235 - 254"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48198956","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 work, a matrix method based on Laguerre series to solve singularly perturbed second order delay parabolic convection-diffusion and reaction-diffusion type problems involving boundary and initial conditions is introduced. The approximate solution of the problem is obtained by truncated Laguerre series. Moreover convergence analysis is introduced and stability is explained. Besides, a test case is given and the error analysis is considered by the different norms in order to show the applicability of the method.
{"title":"A Computational Technique for Solving Singularly Perturbed Delay Partial Differential Equations","authors":"Burcu Gürbüz","doi":"10.2478/fcds-2021-0015","DOIUrl":"https://doi.org/10.2478/fcds-2021-0015","url":null,"abstract":"Abstract In this work, a matrix method based on Laguerre series to solve singularly perturbed second order delay parabolic convection-diffusion and reaction-diffusion type problems involving boundary and initial conditions is introduced. The approximate solution of the problem is obtained by truncated Laguerre series. Moreover convergence analysis is introduced and stability is explained. Besides, a test case is given and the error analysis is considered by the different norms in order to show the applicability of the method.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"221 - 233"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44346559","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}
Aisha Batool, Muhammad Bilal Bashir, M. Babar, Adnan Sohail, N. Ejaz
Abstract In software, code is the only part that remains up to date, which shows how important code is. Code readability is the capability of the code that makes it readable and understandable for professionals. The readability of code has been a great concern for programmers and other technical people in development team because it can have a great influence on software maintenance. A lot of research has been done to measure the influence of program constructs on the code readability but none has placed the highly influential constructs together to predict the readability of a code snippet. In this article, we propose a novel framework using statistical modeling that extracts important features from the code that can help in estimating its readability. Besides that using multiple correlation analysis, our proposed approach can measure dependencies among di erent program constructs. In addition, a multiple regression equation is proposed to predict the code readability. We have automated the proposals in a tool that can do the aforementioned estimations on the input code. Using those tools we have conducted various experiments. The results show that the calculated estimations match with the original values that show the effectiveness of our proposed work. Finally, the results of the experiments are analyzed through statistical analysis in SPSS tool to show their significance.
{"title":"Effect or Program Constructs on Code Readability and Predicting Code Readability Using Statistical Modeling","authors":"Aisha Batool, Muhammad Bilal Bashir, M. Babar, Adnan Sohail, N. Ejaz","doi":"10.2478/fcds-2021-0009","DOIUrl":"https://doi.org/10.2478/fcds-2021-0009","url":null,"abstract":"Abstract In software, code is the only part that remains up to date, which shows how important code is. Code readability is the capability of the code that makes it readable and understandable for professionals. The readability of code has been a great concern for programmers and other technical people in development team because it can have a great influence on software maintenance. A lot of research has been done to measure the influence of program constructs on the code readability but none has placed the highly influential constructs together to predict the readability of a code snippet. In this article, we propose a novel framework using statistical modeling that extracts important features from the code that can help in estimating its readability. Besides that using multiple correlation analysis, our proposed approach can measure dependencies among di erent program constructs. In addition, a multiple regression equation is proposed to predict the code readability. We have automated the proposals in a tool that can do the aforementioned estimations on the input code. Using those tools we have conducted various experiments. The results show that the calculated estimations match with the original values that show the effectiveness of our proposed work. Finally, the results of the experiments are analyzed through statistical analysis in SPSS tool to show their significance.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"127 - 145"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47103283","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
扫码关注我们
求助内容：
应助结果提醒方式：