Pub Date : 2020-10-01DOI: 10.4018/ijsppc.2020100103
N. Verma, Deepika Pathak
Data mining or knowledge discovery in the database (KDD) is an excellent process to find out valuable information from a large collection of data. Data mining has successfully been used in different fields such as medical, marketing, banking, business, weather forecasting, etc. For the banking industry, data mining, its importance, and its techniques are vital because it helps to extract useful information from a large amount of historical data which enable to make useful decisions. Data mining is very useful for banking sector for better acquiring and targeting new customers and helps to analyze customers and their transaction behaviors. In the recent era, a new technology that has achieved considerable attention, especially among banks, is internet banking. Its large scope of applications, its advantages brings an immoderate change in a common human's life. Linear regression is one of the most commonly used and applied data mining techniques. Linear regression is really a very fast and simple regression algorithm and can give the best performance if the output variable of your data is a linear grouping of your inputs. In this paper, the linear regression is applied on internet banking adoption dataset in order to compute the weights or coefficients of linear expression and provides the predicted class value. The analysis here is done with the help of WEKA tool for data mining.
{"title":"Linear Regression on Internet Banking Adoption Dataset Using WEKA","authors":"N. Verma, Deepika Pathak","doi":"10.4018/ijsppc.2020100103","DOIUrl":"https://doi.org/10.4018/ijsppc.2020100103","url":null,"abstract":"Data mining or knowledge discovery in the database (KDD) is an excellent process to find out valuable information from a large collection of data. Data mining has successfully been used in different fields such as medical, marketing, banking, business, weather forecasting, etc. For the banking industry, data mining, its importance, and its techniques are vital because it helps to extract useful information from a large amount of historical data which enable to make useful decisions. Data mining is very useful for banking sector for better acquiring and targeting new customers and helps to analyze customers and their transaction behaviors. In the recent era, a new technology that has achieved considerable attention, especially among banks, is internet banking. Its large scope of applications, its advantages brings an immoderate change in a common human's life. Linear regression is one of the most commonly used and applied data mining techniques. Linear regression is really a very fast and simple regression algorithm and can give the best performance if the output variable of your data is a linear grouping of your inputs. In this paper, the linear regression is applied on internet banking adoption dataset in order to compute the weights or coefficients of linear expression and provides the predicted class value. The analysis here is done with the help of WEKA tool for data mining.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122456137","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}
Pub Date : 2020-10-01DOI: 10.4018/ijsppc.2020100102
Monica Gahlawat
Secure identity management is one of the controversial topics in the cybersecurity landscape. The user needs to rely on third-party providers for managing their personal information, which is a big security concern. Traditional identity systems typically suffer from single points of failure, lack of interoperability, and privacy issues such as encouraging mass data collection and user tracking. Blockchain technology has the potential to support novel data ownership and governance models with built-in control and consent mechanisms, which may benefit both users and businesses by alleviating these concerns. Blockchain-based systems provide the possibility for their users to insert their data in this distributed ledger. Users can trust the blockchain as it is leveraging consensus mechanisms to validate and gather the transactions in immutable blocks. The transparent and decentralized nature of the blockchain network enables the development of a non-refutable and unbreakable record of data, which is the fundamental feature of many applications, such as identity management.
{"title":"Survey of Online Identity Management Techniques on Blockchain","authors":"Monica Gahlawat","doi":"10.4018/ijsppc.2020100102","DOIUrl":"https://doi.org/10.4018/ijsppc.2020100102","url":null,"abstract":"Secure identity management is one of the controversial topics in the cybersecurity landscape. The user needs to rely on third-party providers for managing their personal information, which is a big security concern. Traditional identity systems typically suffer from single points of failure, lack of interoperability, and privacy issues such as encouraging mass data collection and user tracking. Blockchain technology has the potential to support novel data ownership and governance models with built-in control and consent mechanisms, which may benefit both users and businesses by alleviating these concerns. Blockchain-based systems provide the possibility for their users to insert their data in this distributed ledger. Users can trust the blockchain as it is leveraging consensus mechanisms to validate and gather the transactions in immutable blocks. The transparent and decentralized nature of the blockchain network enables the development of a non-refutable and unbreakable record of data, which is the fundamental feature of many applications, such as identity management.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127768957","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}
Pub Date : 2020-10-01DOI: 10.4018/ijsppc.2020100101
K. Adhikary, S. Bhushan, Sunil Kumar, Kamlesh Dutta
The presence of either malicious vehicles or inaccessibility of network services makes vehicular ad-hoc networks (VANETs) easy targets for denial of service (DoS) attacks. The sole purpose of DoS attacks is to prevent the intended users from accessing the available resources and services. When the DoS attack is carried out by multiple vehicles distributed throughout the network, it is referred as distributed DoS (DDoS) attack. A lot of works have been done by researchers in securing the vehicular communication against the DDoS attacks. In this paper, efforts have been made to simulate the DDoS attacks in VANETs as well as to study their impact on the performance of networks. The experimental results are presented using six important metrics, which are collision, jitter, delay, packet drop, ratio-in-out, and throughput. The experimental results show that the impact of distributed DoS (DDoS) attack on networks performance is very critical and must be addressed to ensure the smooth functioning of networks.
{"title":"Evaluating the Impact of DDoS Attacks in Vehicular Ad-Hoc Networks","authors":"K. Adhikary, S. Bhushan, Sunil Kumar, Kamlesh Dutta","doi":"10.4018/ijsppc.2020100101","DOIUrl":"https://doi.org/10.4018/ijsppc.2020100101","url":null,"abstract":"The presence of either malicious vehicles or inaccessibility of network services makes vehicular ad-hoc networks (VANETs) easy targets for denial of service (DoS) attacks. The sole purpose of DoS attacks is to prevent the intended users from accessing the available resources and services. When the DoS attack is carried out by multiple vehicles distributed throughout the network, it is referred as distributed DoS (DDoS) attack. A lot of works have been done by researchers in securing the vehicular communication against the DDoS attacks. In this paper, efforts have been made to simulate the DDoS attacks in VANETs as well as to study their impact on the performance of networks. The experimental results are presented using six important metrics, which are collision, jitter, delay, packet drop, ratio-in-out, and throughput. The experimental results show that the impact of distributed DoS (DDoS) attack on networks performance is very critical and must be addressed to ensure the smooth functioning of networks.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117289371","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}
Pub Date : 2020-07-01DOI: 10.4018/ijsppc.2020070104
D. Divyabharathi, Nagaraj G. Cholli
KeyCloak is an open source identity and access management arrangement focused on present day applications and administrations. It makes it simple to protect applications and administrations with next to zero code. The identity and access management server component provides centralized user management, authentication, and single sign-on identity brokering user federation, social login, client adapters, an admin console, and an account management console for the applications. With KeyCloak, the user management and authentication functions may be integrated with an externally managed system, such as LDAP or active directory. KeyCloak provides single sign-on infrastructure for authentication and session management. In this paper, the authors present an overview of KeyCloak that gives the objectives and features of KeyCloak and comparisons between the servers. They also present protocols of KeyCloak. Finally, benefits of KeyCloak are defined.
{"title":"A Review on Identity and Access Management Server (KeyCloak)","authors":"D. Divyabharathi, Nagaraj G. Cholli","doi":"10.4018/ijsppc.2020070104","DOIUrl":"https://doi.org/10.4018/ijsppc.2020070104","url":null,"abstract":"KeyCloak is an open source identity and access management arrangement focused on present day applications and administrations. It makes it simple to protect applications and administrations with next to zero code. The identity and access management server component provides centralized user management, authentication, and single sign-on identity brokering user federation, social login, client adapters, an admin console, and an account management console for the applications. With KeyCloak, the user management and authentication functions may be integrated with an externally managed system, such as LDAP or active directory. KeyCloak provides single sign-on infrastructure for authentication and session management. In this paper, the authors present an overview of KeyCloak that gives the objectives and features of KeyCloak and comparisons between the servers. They also present protocols of KeyCloak. Finally, benefits of KeyCloak are defined.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116713","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}
Pub Date : 2020-07-01DOI: 10.4018/ijsppc.2020070101
G. Reddy, Suneetha Chittineni
The design of a data warehouse system deals with tasks such as data source administration, ETL processing, multidimensional modelling, data mart specification, and end-user tool development. In the last decade, numerous techniques have been presented to cover all the aspects of DW. However, none of these techniques stated the recent necessities of DW like visualization, temporal dimensions, record keeping, and so on. To overcome these issues, this paper proposes a UML based DW with temporal dimensions. This framework designs time-dependent DW that allows end-users to store history of variations for long term. Besides, it authorizes to visualize the business goals of organizations in the form of attribute tree via UML, which is designed after receiving user necessities and later reconciling with temporal variables. The implementation of proposed technique is detailed with university education database for quality improvement. The proposed technique is found to be useful in terms of temporal dimension, long-term record keeping, and easy to make decision goals through attribute trees.
{"title":"UML-Based Data Warehouse Design Using Temporal Dimensional Modelling","authors":"G. Reddy, Suneetha Chittineni","doi":"10.4018/ijsppc.2020070101","DOIUrl":"https://doi.org/10.4018/ijsppc.2020070101","url":null,"abstract":"The design of a data warehouse system deals with tasks such as data source administration, ETL processing, multidimensional modelling, data mart specification, and end-user tool development. In the last decade, numerous techniques have been presented to cover all the aspects of DW. However, none of these techniques stated the recent necessities of DW like visualization, temporal dimensions, record keeping, and so on. To overcome these issues, this paper proposes a UML based DW with temporal dimensions. This framework designs time-dependent DW that allows end-users to store history of variations for long term. Besides, it authorizes to visualize the business goals of organizations in the form of attribute tree via UML, which is designed after receiving user necessities and later reconciling with temporal variables. The implementation of proposed technique is detailed with university education database for quality improvement. The proposed technique is found to be useful in terms of temporal dimension, long-term record keeping, and easy to make decision goals through attribute trees.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127830127","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}
Pub Date : 2020-07-01DOI: 10.4018/ijsppc.2020070102
Meetu Kandpal, Kalyani Patel
Many of the companies started moving towards cloud computing because of its characteristics like pay as you go, easy to use, scalable, multi-tenant, secure, etc. There are many cloud providers providing cloud services over the internet. There are number of pricing policies for the user. These pricing policies can be categorised as static and dynamic pricing. This paper represents the enhancement and evaluation of the proposed dynamic resource pricing model for cloud resources based on the consumer behaviour. For model evaluation, one tail two sample t-test has been used. The results show the model will be helpful to the cloud provider for profit maximisation.
{"title":"Evaluation of the Dynamic Pricing Model in Cloud","authors":"Meetu Kandpal, Kalyani Patel","doi":"10.4018/ijsppc.2020070102","DOIUrl":"https://doi.org/10.4018/ijsppc.2020070102","url":null,"abstract":"Many of the companies started moving towards cloud computing because of its characteristics like pay as you go, easy to use, scalable, multi-tenant, secure, etc. There are many cloud providers providing cloud services over the internet. There are number of pricing policies for the user. These pricing policies can be categorised as static and dynamic pricing. This paper represents the enhancement and evaluation of the proposed dynamic resource pricing model for cloud resources based on the consumer behaviour. For model evaluation, one tail two sample t-test has been used. The results show the model will be helpful to the cloud provider for profit maximisation.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133934456","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}
Pub Date : 2020-07-01DOI: 10.4018/ijsppc.2020070103
Weifang Zhai, Juan Feng
Aiming at the stability control of the automatic control system, this paper proposes a root locus correction scheme. By establishing the mathematical model of the control object and using the root locus correction method in the classical control theory, the design of the control system is completed. The simulation experiment of the control system is carried out in the MATLAB environment, and the key points of the scheme are summarized. The simulation results show that the scheme not only successfully achieves the stability control of the system, but also meets the expected performance index, which fully proves its correctness and effectiveness.
{"title":"Research on Root Locus Correction Algorithm in Automatic Control System","authors":"Weifang Zhai, Juan Feng","doi":"10.4018/ijsppc.2020070103","DOIUrl":"https://doi.org/10.4018/ijsppc.2020070103","url":null,"abstract":"Aiming at the stability control of the automatic control system, this paper proposes a root locus correction scheme. By establishing the mathematical model of the control object and using the root locus correction method in the classical control theory, the design of the control system is completed. The simulation experiment of the control system is carried out in the MATLAB environment, and the key points of the scheme are summarized. The simulation results show that the scheme not only successfully achieves the stability control of the system, but also meets the expected performance index, which fully proves its correctness and effectiveness.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116708618","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}
Pub Date : 2020-04-01DOI: 10.4018/ijsppc.2020040103
A. Fatnassi, H. Gharsellaoui, Sadok Bouamama
Through the advent of digital information, information security has taken on a vital role. Use of the internet freely for contact has increased the attacks on users. Data protection is the present problem relating to privacy and security during storage and communication. This paper deals with a multilayered protected channel's proposal to transfer confidential data/video through a channel. The hidden video is initially encrypted using the algorithm NOLSB. The created cipher video is hidden in a larger sized video file. In addition, this video file is encrypted using the (m, k) firm technique to optimize resource efficiency and bandwidth optimization. Video shares are then sent through all the network's channels to ensure security. This approach ensures that video files could be retrieved at the end receiver even though any shares were lost over the network, without the sender needing to resend the video file.
{"title":"New Hybrid Proposed Solution for Video Steganography Based on Clustering Algorithm","authors":"A. Fatnassi, H. Gharsellaoui, Sadok Bouamama","doi":"10.4018/ijsppc.2020040103","DOIUrl":"https://doi.org/10.4018/ijsppc.2020040103","url":null,"abstract":"Through the advent of digital information, information security has taken on a vital role. Use of the internet freely for contact has increased the attacks on users. Data protection is the present problem relating to privacy and security during storage and communication. This paper deals with a multilayered protected channel's proposal to transfer confidential data/video through a channel. The hidden video is initially encrypted using the algorithm NOLSB. The created cipher video is hidden in a larger sized video file. In addition, this video file is encrypted using the (m, k) firm technique to optimize resource efficiency and bandwidth optimization. Video shares are then sent through all the network's channels to ensure security. This approach ensures that video files could be retrieved at the end receiver even though any shares were lost over the network, without the sender needing to resend the video file.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115824603","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}
Pub Date : 2020-04-01DOI: 10.4018/ijsppc.2020040101
Li Xu
TSP (traveling salesman problem) is a classical problem in combinatorial optimization. It's not totally solved; the route number and the number of cities has increased exponentially, so we couldn't find the best solution easily. This paper does a lot research of tabu search (TS) besides AA and proposes a new algorithm. Making use of TS's advantages, the new proposed algorithm's performance is meliorated. Firstly, aiming at solving AA's slow convergence, the authors increase the pheromone of the best route, decrease the pheromone of the worst route, to increase the conductive ability of the pheromone to the algorithm. Secondly, aiming at solving AA's being premature, this paper introduces TS into AS's every iteration. The TS can help the algorithm find a better solution. So, the new algorithm's convergence speed is quickened, and its performance is improved. At last, this paper applied the algorithm to the traveling salesman problem to test its performances. The simulation results show that the new algorithm could find optimum solutions more effectively in time and quantity.
{"title":"Research on Ant Colony Optimization With Tabu Search Ability","authors":"Li Xu","doi":"10.4018/ijsppc.2020040101","DOIUrl":"https://doi.org/10.4018/ijsppc.2020040101","url":null,"abstract":"TSP (traveling salesman problem) is a classical problem in combinatorial optimization. It's not totally solved; the route number and the number of cities has increased exponentially, so we couldn't find the best solution easily. This paper does a lot research of tabu search (TS) besides AA and proposes a new algorithm. Making use of TS's advantages, the new proposed algorithm's performance is meliorated. Firstly, aiming at solving AA's slow convergence, the authors increase the pheromone of the best route, decrease the pheromone of the worst route, to increase the conductive ability of the pheromone to the algorithm. Secondly, aiming at solving AA's being premature, this paper introduces TS into AS's every iteration. The TS can help the algorithm find a better solution. So, the new algorithm's convergence speed is quickened, and its performance is improved. At last, this paper applied the algorithm to the traveling salesman problem to test its performances. The simulation results show that the new algorithm could find optimum solutions more effectively in time and quantity.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129889110","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}
Pub Date : 2020-04-01DOI: 10.4018/ijsppc.2020040104
Alankrita Aggarwal, Dr. Kanwalvir Singh Dhindsa, P. K. Suri
The process of software evaluation is one of the key tasks that are addressed by the quality assurance teams so that the risks in the software suite can be identified and can be removed with prior notifications. Different types of metrics can be used in defect prediction models, and widely used metrics are source code and process metrics. A simulated environment for the entire process shall be generated for multiple scenarios and parameters so that the results and conclusion can be depicted in an effective way. The focus of research is to develop a narrative architecture and design for software risk management using soft computing and nature-inspired approach. The proposed approach titled simulated biological reaction (SBR) is expected to have the effectual results on multiple parameters with the flavor of soft computing-based optimization. The proposed approach shall be integrating the simulation of microbiological process in different substances and elements to produce a new substance.
{"title":"Design for Software Risk Management Using Soft Computing and Simulated Biological Approach","authors":"Alankrita Aggarwal, Dr. Kanwalvir Singh Dhindsa, P. K. Suri","doi":"10.4018/ijsppc.2020040104","DOIUrl":"https://doi.org/10.4018/ijsppc.2020040104","url":null,"abstract":"The process of software evaluation is one of the key tasks that are addressed by the quality assurance teams so that the risks in the software suite can be identified and can be removed with prior notifications. Different types of metrics can be used in defect prediction models, and widely used metrics are source code and process metrics. A simulated environment for the entire process shall be generated for multiple scenarios and parameters so that the results and conclusion can be depicted in an effective way. The focus of research is to develop a narrative architecture and design for software risk management using soft computing and nature-inspired approach. The proposed approach titled simulated biological reaction (SBR) is expected to have the effectual results on multiple parameters with the flavor of soft computing-based optimization. The proposed approach shall be integrating the simulation of microbiological process in different substances and elements to produce a new substance.","PeriodicalId":344690,"journal":{"name":"Int. J. Secur. Priv. Pervasive Comput.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262819","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
扫码关注我们
求助内容：
应助结果提醒方式：