Huynh Trieu Vy, Le Quoc Hai, Nguyen Thanh Long, Trương Ngọc Châu, Le Quoc Hieu
Abstract Hiding high utility and frequent itemset is the method used to preserve sensitive knowledge from being revealed by pattern mining process. Its goal is to remove sensitive high utility and frequent itemsets from a database before sharing it for data mining purposes while minimizing the side effects. The current methods succeed in the hiding goal but they cause high side effects. This paper proposes a novel algorithm, named HSUFIBL, that applies a heuristic for finding victim item based on the constrained intersection lattice theory. This algorithm specifies exactly the condition that allows the application of utility reduction or support reduction method, the victim item, and the victim transaction for the hiding process so that the process needs the fewest data modifications and gives the lowest number of lost non-sensitive itemsets. The experimental results indicate that the HSUFIBL algorithm achieves better performance than previous works in minimizing the side effect.
{"title":"Hiding Sensitive High Utility and Frequent Itemsets Based on Constrained Intersection Lattice","authors":"Huynh Trieu Vy, Le Quoc Hai, Nguyen Thanh Long, Trương Ngọc Châu, Le Quoc Hieu","doi":"10.2478/cait-2022-0001","DOIUrl":"https://doi.org/10.2478/cait-2022-0001","url":null,"abstract":"Abstract Hiding high utility and frequent itemset is the method used to preserve sensitive knowledge from being revealed by pattern mining process. Its goal is to remove sensitive high utility and frequent itemsets from a database before sharing it for data mining purposes while minimizing the side effects. The current methods succeed in the hiding goal but they cause high side effects. This paper proposes a novel algorithm, named HSUFIBL, that applies a heuristic for finding victim item based on the constrained intersection lattice theory. This algorithm specifies exactly the condition that allows the application of utility reduction or support reduction method, the victim item, and the victim transaction for the hiding process so that the process needs the fewest data modifications and gives the lowest number of lost non-sensitive itemsets. The experimental results indicate that the HSUFIBL algorithm achieves better performance than previous works in minimizing the side effect.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"22 1","pages":"3 - 23"},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45833732","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}
Marco Aguilera-Prado, O. Salcedo, Eduardo Avendaño Fernández
Abstract This article provides the results of a citation determinants model for a set of academic engineering texts from Colombia. The model establishes the determinants of the probability that a text receives at least one citation through the relationship among previous citations, journal characteristics, the author and the text. Through a similarity matrix constructed by Latent Semantic Analysis (LSA), a similarity variable has been constructed to capture the fact that the texts have similar titles, abstracts and keywords to the most cited texts. The results show: i) joint significance of the variables selected to characterize the text; ii) direct relationship of the citation with similarity of keywords, published in an IEEE journal, research article, more than one author; and authored by at least one foreign author; and iii) inverse relationship between the probability of citation with the similarity of abstracts, published in 2016 or 2017, and published in a Colombian journal.
{"title":"Citation and Similarity in Academic Texts: Colombian Engineering Case","authors":"Marco Aguilera-Prado, O. Salcedo, Eduardo Avendaño Fernández","doi":"10.2478/cait-2022-0006","DOIUrl":"https://doi.org/10.2478/cait-2022-0006","url":null,"abstract":"Abstract This article provides the results of a citation determinants model for a set of academic engineering texts from Colombia. The model establishes the determinants of the probability that a text receives at least one citation through the relationship among previous citations, journal characteristics, the author and the text. Through a similarity matrix constructed by Latent Semantic Analysis (LSA), a similarity variable has been constructed to capture the fact that the texts have similar titles, abstracts and keywords to the most cited texts. The results show: i) joint significance of the variables selected to characterize the text; ii) direct relationship of the citation with similarity of keywords, published in an IEEE journal, research article, more than one author; and authored by at least one foreign author; and iii) inverse relationship between the probability of citation with the similarity of abstracts, published in 2016 or 2017, and published in a Colombian journal.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"22 1","pages":"95 - 103"},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48687734","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 aims at creating a new Trust Management System (TMS) for a system of nodes. Various systems already exist which only use a simple function to calculate the trust value of a node. In the age of artificial intelligence the need for learning ability in an Internet of Things (IoT) system arises. Malicious nodes are a recurring issue and there still has not been a fully effective way to detect them beforehand. In IoT systems, a malicious node is detected after a transaction has occurred with the node. To this end, this paper explores how Artificial Intelligence (AI), and specifically Linear Regression (LR), could be utilised to predict a malicious node in order to minimise the damage in the IoT ecosystem. Moreover, the paper compares Linear regression over other AI-based TMS, showing the efficiency and efficacy of the method to predict and identify a malicious node.
{"title":"Linear Regression Trust Management System for IoT Systems","authors":"Ananda Kumar Subramanian, Aritra Samanta, Sasmithaa Manickam, Abhinav Kumar, S. Shiaeles, Anish Mahendran","doi":"10.2478/cait-2021-0040","DOIUrl":"https://doi.org/10.2478/cait-2021-0040","url":null,"abstract":"Abstract This paper aims at creating a new Trust Management System (TMS) for a system of nodes. Various systems already exist which only use a simple function to calculate the trust value of a node. In the age of artificial intelligence the need for learning ability in an Internet of Things (IoT) system arises. Malicious nodes are a recurring issue and there still has not been a fully effective way to detect them beforehand. In IoT systems, a malicious node is detected after a transaction has occurred with the node. To this end, this paper explores how Artificial Intelligence (AI), and specifically Linear Regression (LR), could be utilised to predict a malicious node in order to minimise the damage in the IoT ecosystem. Moreover, the paper compares Linear regression over other AI-based TMS, showing the efficiency and efficacy of the method to predict and identify a malicious node.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"15 - 27"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46247088","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 Covid19 has significantly changed the global landscape in every aspect including economy, social life, and many others. After almost two years of living with the pandemic, new challenges are faced by the research community. It may take some time before the world can be declared as totally safe from the virus. Therefore, prediction of Covid19 confirmed cases is vital for the sake of proper prevention and precaution steps. In this study, a hybrid Barnacles Mating Optimizer with Least Square Support Vector Machines (BMO-LSSVM) is proposed for prediction of Covid19 confirmed cases. The employed data are the Covid19 cases in China which are defined in daily periodicity. The BMO was utilized to obtain optimal values of LSSVM hyper-parameters. Later, with the optimized values of the hyper-parameters, the prediction task will be executed by LSSVM. Through the experiments, the study recommends the superiority of BMO-LSSVM over the other identified hybrid algorithms.
{"title":"COVID-19 Confirmed Cases Prediction in China Based on Barnacles Mating Optimizer-Least Squares Support Vector Machines","authors":"Z. Mustaffa, M. Sulaiman","doi":"10.2478/cait-2021-0043","DOIUrl":"https://doi.org/10.2478/cait-2021-0043","url":null,"abstract":"Abstract The Covid19 has significantly changed the global landscape in every aspect including economy, social life, and many others. After almost two years of living with the pandemic, new challenges are faced by the research community. It may take some time before the world can be declared as totally safe from the virus. Therefore, prediction of Covid19 confirmed cases is vital for the sake of proper prevention and precaution steps. In this study, a hybrid Barnacles Mating Optimizer with Least Square Support Vector Machines (BMO-LSSVM) is proposed for prediction of Covid19 confirmed cases. The employed data are the Covid19 cases in China which are defined in daily periodicity. The BMO was utilized to obtain optimal values of LSSVM hyper-parameters. Later, with the optimized values of the hyper-parameters, the prediction task will be executed by LSSVM. Through the experiments, the study recommends the superiority of BMO-LSSVM over the other identified hybrid algorithms.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"62 - 76"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45097313","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}
P. Dworniczak, Lilija Atanassova, Nora A. Angelova
Abstract In 2020 L. Atanassova has been introduced the new operation Δ over intuitionistic fuzzy sets and over intuitionistic fuzzy pairs. Some of its properties have been studied in 2021 from L. Atanassova and P. Dworniczak. In 2021 L. Atanassova and P. Dworniczak generated an intuitionistic fuzzy implication by the operation Δ, and it has been introduced and some of its basic properties have been described. Here, eight modal type of intuitionistic fuzzy implications are generated by the first one and some of their properties are discussed.
{"title":"Modal Type of Weak Intuitionistic Fuzzy Implications Generated by the Operation Δ","authors":"P. Dworniczak, Lilija Atanassova, Nora A. Angelova","doi":"10.2478/cait-2021-0047","DOIUrl":"https://doi.org/10.2478/cait-2021-0047","url":null,"abstract":"Abstract In 2020 L. Atanassova has been introduced the new operation Δ over intuitionistic fuzzy sets and over intuitionistic fuzzy pairs. Some of its properties have been studied in 2021 from L. Atanassova and P. Dworniczak. In 2021 L. Atanassova and P. Dworniczak generated an intuitionistic fuzzy implication by the operation Δ, and it has been introduced and some of its basic properties have been described. Here, eight modal type of intuitionistic fuzzy implications are generated by the first one and some of their properties are discussed.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"137 - 144"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47650023","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 recent years, we are witnessing artificial intelligence being deployed on embedded platforms in our everyday life, including engineering design practice problems starting from early stage design ideas to the final decision. One of the most challenging problems is related to the design and implementation of neural networks in engineering design tasks. The successful design and practical applications of neural network models depend on their qualitative properties. Elaborating efficient stability is known to be of a high importance. Also, different stability notions are applied for differently behaving models. In addition, uncertainties are ubiquitous in neural network systems, and may result in performance degradation, hazards or system damage. Driven by practical needs and theoretical challenges, the rigorous handling of uncertainties in the neural network design stage is an essential research topic. In this research, the concept of robust practical stability is introduced for generalized discrete neural network models under uncertainties applied in engineering design. A robust practical stability analysis is offered using the Lyapunov function method. Since practical stability concept is more appropriate for engineering applications, the obtained results can be of a practical significance to numerous engineering design problems of diverse interest.
{"title":"Neural Networks in Engineering Design: Robust Practical Stability Analysis","authors":"T. Stamov","doi":"10.2478/cait-2021-0039","DOIUrl":"https://doi.org/10.2478/cait-2021-0039","url":null,"abstract":"Abstract In recent years, we are witnessing artificial intelligence being deployed on embedded platforms in our everyday life, including engineering design practice problems starting from early stage design ideas to the final decision. One of the most challenging problems is related to the design and implementation of neural networks in engineering design tasks. The successful design and practical applications of neural network models depend on their qualitative properties. Elaborating efficient stability is known to be of a high importance. Also, different stability notions are applied for differently behaving models. In addition, uncertainties are ubiquitous in neural network systems, and may result in performance degradation, hazards or system damage. Driven by practical needs and theoretical challenges, the rigorous handling of uncertainties in the neural network design stage is an essential research topic. In this research, the concept of robust practical stability is introduced for generalized discrete neural network models under uncertainties applied in engineering design. A robust practical stability analysis is offered using the Lyapunov function method. Since practical stability concept is more appropriate for engineering applications, the obtained results can be of a practical significance to numerous engineering design problems of diverse interest.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"3 - 14"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47492831","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}
Mosleh M Abualhaj, Sumaya N. Al-Khatib, Qusai Y. Shambour, A. Abu-Shareha
Abstract IP telephony have played an essential role during the COVID 19 pandemic lockdown. One of the issues that lower the service level of the IP telephony solutions is the inefficient bandwidth exploitation. This paper proposes a Smallerize/Zeroize (SmlZr) method to enhance bandwidth exploitation. The SmlZr method is explicitly designed for the P2P IP telephony calls over IPv6 networks. The essence concept of the proposed method is to use the unnecessary fields in the header to keep the voice media of the packet. Doing so leads to smallerize or zeroize the packet payload and, thus, enhance the bandwidth exploitation. The SmlZr method has outperformed the RTP method for all the comparison parameters. For instance, the SmlZr method shrinks the bandwidth by 25% compared to the RTP protocol. Bandwidth saving is helpful for P2P IP telephony calls because it alleviates the traffic load. Thus, improve the call capacity boosts the call clarity.
{"title":"An Efficient Method to Enhance IP Telephony Performance in IPV6 Networks","authors":"Mosleh M Abualhaj, Sumaya N. Al-Khatib, Qusai Y. Shambour, A. Abu-Shareha","doi":"10.2478/cait-2021-0048","DOIUrl":"https://doi.org/10.2478/cait-2021-0048","url":null,"abstract":"Abstract IP telephony have played an essential role during the COVID 19 pandemic lockdown. One of the issues that lower the service level of the IP telephony solutions is the inefficient bandwidth exploitation. This paper proposes a Smallerize/Zeroize (SmlZr) method to enhance bandwidth exploitation. The SmlZr method is explicitly designed for the P2P IP telephony calls over IPv6 networks. The essence concept of the proposed method is to use the unnecessary fields in the header to keep the voice media of the packet. Doing so leads to smallerize or zeroize the packet payload and, thus, enhance the bandwidth exploitation. The SmlZr method has outperformed the RTP method for all the comparison parameters. For instance, the SmlZr method shrinks the bandwidth by 25% compared to the RTP protocol. Bandwidth saving is helpful for P2P IP telephony calls because it alleviates the traffic load. Thus, improve the call capacity boosts the call clarity.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"145 - 157"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42480000","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 Multi-objective Solid Transportation Problem (MSTP) is known as a special class of vector-minimization (or maximization) problems and has three parameters: source, destination, and conveyance. The objectives such as transportation cost, transportation time, transportation safety level, and objectives in terms of environmental and social issues are generally in conflict with each other. In this paper, we present a fuzzy approach to bring these conflicting objectives together as high as possible. Instead of using the linear membership function, which is frequently used in the literature for ease of use, we use the hyperbolic membership function in our approach. Also, while most of the papers in the literature deal with the standard equality constrained form of MSTP, the mixed constrained form is addressed in this paper. Finally, a numerical example from the literature is used to illustrate the construction of the hyperbolic membership function and how well it represents the objective functions’ degree of satisfaction.
{"title":"A Fuzzy Approach to Multi-Objective Solid Transportation Problem with Mixed Constraints Using Hyperbolic Membership Function","authors":"Nurdan Kara, H. Kocken","doi":"10.2478/cait-2021-0049","DOIUrl":"https://doi.org/10.2478/cait-2021-0049","url":null,"abstract":"Abstract Multi-objective Solid Transportation Problem (MSTP) is known as a special class of vector-minimization (or maximization) problems and has three parameters: source, destination, and conveyance. The objectives such as transportation cost, transportation time, transportation safety level, and objectives in terms of environmental and social issues are generally in conflict with each other. In this paper, we present a fuzzy approach to bring these conflicting objectives together as high as possible. Instead of using the linear membership function, which is frequently used in the literature for ease of use, we use the hyperbolic membership function in our approach. Also, while most of the papers in the literature deal with the standard equality constrained form of MSTP, the mixed constrained form is addressed in this paper. Finally, a numerical example from the literature is used to illustrate the construction of the hyperbolic membership function and how well it represents the objective functions’ degree of satisfaction.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"158 - 167"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43651052","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 An investment policy is suggested about assets on real estate markets. Such analysis recommends investments in non-financial assets and optimization of the results from such decisions. The formalization of the investment policy is based on the portfolio theory for asset allocation. Two main criteria are applied for the decision making: return and risk. The decision support is based on Mean-Variance portfolio model. A dynamical and adaptive investment policy is derived for active portfolio management. Sliding procedure in time with definition and solution of a set of portfolio problems is applied. The decision defines the relative value of the investment to which real estates are to be allocated. The regional real estate markets of six Bulgarian towns, which identify the regions with potential for investments, are compared. The added value of the paper results in development of algorithm for a quantitative analysis of real estate markets, based on portfolio theory.
{"title":"Decision Making in Real Estate: Portfolio Approach","authors":"T. Stoilov, K. Stoilova, Miroslav Vladimirov","doi":"10.2478/cait-2021-0041","DOIUrl":"https://doi.org/10.2478/cait-2021-0041","url":null,"abstract":"Abstract An investment policy is suggested about assets on real estate markets. Such analysis recommends investments in non-financial assets and optimization of the results from such decisions. The formalization of the investment policy is based on the portfolio theory for asset allocation. Two main criteria are applied for the decision making: return and risk. The decision support is based on Mean-Variance portfolio model. A dynamical and adaptive investment policy is derived for active portfolio management. Sliding procedure in time with definition and solution of a set of portfolio problems is applied. The decision defines the relative value of the investment to which real estates are to be allocated. The regional real estate markets of six Bulgarian towns, which identify the regions with potential for investments, are compared. The added value of the paper results in development of algorithm for a quantitative analysis of real estate markets, based on portfolio theory.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"28 - 44"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48806535","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 survey presents the evolution of Short Weierstrass elliptic curves after their introduction in cryptography. Subsequently, this evolution resulted in the establishment of present elliptic curve computational standards. We discuss the chronology of attacks on Elliptic Curve Discrete Logarithm Problem (ECDLP) and investigate their countermeasures to highlight the evolved selection criteria of cryptographically safe elliptic curves. Further, two popular deterministic and random approaches for selection of Short Weierstrass elliptic curve for cryptography are evaluated from computational, security and trust perspectives and a trend in existent computational standards is demonstrated. Finally, standard and non-standard elliptic curves are analysed to add a new insight into their usability. There is no such survey conducted in past to the best of our knowledge.
{"title":"Evaluation of Computational Approaches of Short Weierstrass Elliptic Curves for Cryptography","authors":"Kunal Abhishek, E. Raj","doi":"10.2478/cait-2021-0045","DOIUrl":"https://doi.org/10.2478/cait-2021-0045","url":null,"abstract":"Abstract The survey presents the evolution of Short Weierstrass elliptic curves after their introduction in cryptography. Subsequently, this evolution resulted in the establishment of present elliptic curve computational standards. We discuss the chronology of attacks on Elliptic Curve Discrete Logarithm Problem (ECDLP) and investigate their countermeasures to highlight the evolved selection criteria of cryptographically safe elliptic curves. Further, two popular deterministic and random approaches for selection of Short Weierstrass elliptic curve for cryptography are evaluated from computational, security and trust perspectives and a trend in existent computational standards is demonstrated. Finally, standard and non-standard elliptic curves are analysed to add a new insight into their usability. There is no such survey conducted in past to the best of our knowledge.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":"21 1","pages":"105 - 118"},"PeriodicalIF":1.2,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49245453","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
扫码关注我们
求助内容：
应助结果提醒方式：