Pub Date : 2021-01-01DOI: 10.1504/ijwgs.2021.10040914
Ajay Kumar, Kumar Abhishek, K. Shah, S. Namasudra, Seifedine Kadry
{"title":"A novel elliptic curve cryptography-based system for smart grid communication","authors":"Ajay Kumar, Kumar Abhishek, K. Shah, S. Namasudra, Seifedine Kadry","doi":"10.1504/ijwgs.2021.10040914","DOIUrl":"https://doi.org/10.1504/ijwgs.2021.10040914","url":null,"abstract":"","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"34 1","pages":"321-342"},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80280710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/IJWGS.2021.10036714
L. Mostarda, Kemal Ihsan Kilic, O. Gemikonakli
{"title":"Voronoi Tesselation-based load-balanced multi-objective priority-based heuristic optimisation for multi-cell region coverage with UAVs","authors":"L. Mostarda, Kemal Ihsan Kilic, O. Gemikonakli","doi":"10.1504/IJWGS.2021.10036714","DOIUrl":"https://doi.org/10.1504/IJWGS.2021.10036714","url":null,"abstract":"","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"419 1","pages":"152-178"},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73092009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/IJWGS.2021.10036712
Ying Liu, Tao Ye, Z. Zeng, Yingbin Zhang, Guoshi Wang, Ning Chen, Cunli Mao, Xiaohui Yuan
Real measurements of power grids are usually limited for research and modelling of extreme events such as the impact of typhoons due to confidentiality concerns. To overcome the dearth of valuable, trustworthy data, this paper proposes an adaptive learning method based on the generative adversarial network. To obtain informative examples, the falsely classified examples together with examples that are correctly classified with low confidence are used to train a GAN for producing synthetic examples to reinforce the learning. The new power grid examples are selected according to the likelihood of the true data distribution. An evaluation was conducted with data acquired by the China Southern Power Grid in Hainan. Most significantly, the performance of detecting the occurrence of a power grid fault under the impact of typhoons is greatly improved. It was demonstrated that the proposed method improved the performance of predicting power grid fault in extreme events by 8.9%. Using the modulated GAN network, the synthetic data closely follows the distribution of the real data as indicated by large p-values. Our method takes minutes to complete training a model, which enables an efficient response to disasters with modern computing facilities such as edge computing. Generative adversarial network-enabled learning scheme 139
{"title":"Generative adversarial network-enabled learning scheme for power grid vulnerability analysis","authors":"Ying Liu, Tao Ye, Z. Zeng, Yingbin Zhang, Guoshi Wang, Ning Chen, Cunli Mao, Xiaohui Yuan","doi":"10.1504/IJWGS.2021.10036712","DOIUrl":"https://doi.org/10.1504/IJWGS.2021.10036712","url":null,"abstract":"Real measurements of power grids are usually limited for research and modelling of extreme events such as the impact of typhoons due to confidentiality concerns. To overcome the dearth of valuable, trustworthy data, this paper proposes an adaptive learning method based on the generative adversarial network. To obtain informative examples, the falsely classified examples together with examples that are correctly classified with low confidence are used to train a GAN for producing synthetic examples to reinforce the learning. The new power grid examples are selected according to the likelihood of the true data distribution. An evaluation was conducted with data acquired by the China Southern Power Grid in Hainan. Most significantly, the performance of detecting the occurrence of a power grid fault under the impact of typhoons is greatly improved. It was demonstrated that the proposed method improved the performance of predicting power grid fault in extreme events by 8.9%. Using the modulated GAN network, the synthetic data closely follows the distribution of the real data as indicated by large p-values. Our method takes minutes to complete training a model, which enables an efficient response to disasters with modern computing facilities such as edge computing. Generative adversarial network-enabled learning scheme 139","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"2 1","pages":"138-151"},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81141409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-16DOI: 10.1504/ijwgs.2020.10032930
Chang-ai Sun, An Fu, Yiqiang Liu, Qing Wen, Zuoyi Wang, Peng Wu, T. Chen
Metamorphic testing (MT) is an innovative approach to alleviating the oracle problem in software testing, which uses metamorphic relations of the program under test, instead of the test oracles, to verify its outputs. To alleviate the oracle problem of testing web services, we had previously proposed an MT framework for web services. In this paper, we further improve the efficiency and automation of this framework by leveraging metamorphic relations to iteratively generate test cases. We present a fixed-size iterative MT algorithm and implement it in the MT framework. We conduct three case studies to evaluate the fault detection effectiveness and efficiency of the proposed approach. Experimental results suggest that, compared with the conventional MT, iterative MT can achieve a comparable fault detection effectiveness, but with significantly fewer resources. Observations and limitations are summarised to provide new insights into the application of iterative MT.
{"title":"An iterative metamorphic testing technique for web services and case studies","authors":"Chang-ai Sun, An Fu, Yiqiang Liu, Qing Wen, Zuoyi Wang, Peng Wu, T. Chen","doi":"10.1504/ijwgs.2020.10032930","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10032930","url":null,"abstract":"Metamorphic testing (MT) is an innovative approach to alleviating the oracle problem in software testing, which uses metamorphic relations of the program under test, instead of the test oracles, to verify its outputs. To alleviate the oracle problem of testing web services, we had previously proposed an MT framework for web services. In this paper, we further improve the efficiency and automation of this framework by leveraging metamorphic relations to iteratively generate test cases. We present a fixed-size iterative MT algorithm and implement it in the MT framework. We conduct three case studies to evaluate the fault detection effectiveness and efficiency of the proposed approach. Experimental results suggest that, compared with the conventional MT, iterative MT can achieve a comparable fault detection effectiveness, but with significantly fewer resources. Observations and limitations are summarised to provide new insights into the application of iterative MT.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"8 1","pages":"364-392"},"PeriodicalIF":1.0,"publicationDate":"2020-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84275035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Besides its classical three service models (IaaS, PaaS, and SaaS), container as a service (CaaS) has gained significant acceptance. It offers without the difficulty of high-performance challenges of traditional hypervisors deployable applications. As the adoption of containers is increasingly wide spreading, the use of tools to manage them across the infrastructure becomes a vital necessity. In this paper, we propose a conceptualisation of a domain ontology for the container description called CDO. CDO presents, in a detailed and equal manner, the functional and non-functional capabilities of containers, Dockers and container orchestration systems. In addition, we provide a framework that aims at simplifying the container management not only for the users but also for the cloud providers. In fact, this framework serves to populate CDO, help the users to deploy their application on a container orchestration system, and enhance interoperability between the cloud providers by providing migration service for deploying applications among different host platforms. Finally, the CDO effectiveness is demonstrated relying on a real case study on the deployment of a micro-service application over a containerised environment under a set of functional and non-functional requirements.
{"title":"Container description ontology for CaaS","authors":"Khouloud Boukadi, Molka Rekik, Jorge Bernal Bernabé, Jaime Lloret","doi":"10.1504/ijwgs.2020.10032929","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10032929","url":null,"abstract":"Besides its classical three service models (IaaS, PaaS, and SaaS), container as a service (CaaS) has gained significant acceptance. It offers without the difficulty of high-performance challenges of traditional hypervisors deployable applications. As the adoption of containers is increasingly wide spreading, the use of tools to manage them across the infrastructure becomes a vital necessity. In this paper, we propose a conceptualisation of a domain ontology for the container description called CDO. CDO presents, in a detailed and equal manner, the functional and non-functional capabilities of containers, Dockers and container orchestration systems. In addition, we provide a framework that aims at simplifying the container management not only for the users but also for the cloud providers. In fact, this framework serves to populate CDO, help the users to deploy their application on a container orchestration system, and enhance interoperability between the cloud providers by providing migration service for deploying applications among different host platforms. Finally, the CDO effectiveness is demonstrated relying on a real case study on the deployment of a micro-service application over a containerised environment under a set of functional and non-functional requirements.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"1 1","pages":"341-363"},"PeriodicalIF":1.0,"publicationDate":"2020-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80067940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-16DOI: 10.1504/ijwgs.2020.10032931
Mohamed Gharbi, Haithem Mezni
Recently, cloud computing has been combined with big data processing leading to a new model of services called big services. This model addresses the customers' complex requirements by reusing and aggregating existing services from various domains and delivery models, and from multiple cloud availability zones. Existing web/cloud service composition approaches are not adequate for the big service context due to many reasons, including the large volume of data, the cross-domain and cross-cloud interoperability issues, etc. Considering the aforementioned facts, we provide a solution to the big service composition issue, by taking advantage of relational concept analysis (RCA), as a clustering method, and composite particle swarm optimisation (CPSO), as an optimisation technique. RCA is used to model the big service environment, whereas CPSO helps continuously optimising the quality of big service composition. The implementation and experimental studies on our approach have proven its feasibility and efficiency.
{"title":"Towards big services composition","authors":"Mohamed Gharbi, Haithem Mezni","doi":"10.1504/ijwgs.2020.10032931","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10032931","url":null,"abstract":"Recently, cloud computing has been combined with big data processing leading to a new model of services called big services. This model addresses the customers' complex requirements by reusing and aggregating existing services from various domains and delivery models, and from multiple cloud availability zones. Existing web/cloud service composition approaches are not adequate for the big service context due to many reasons, including the large volume of data, the cross-domain and cross-cloud interoperability issues, etc. Considering the aforementioned facts, we provide a solution to the big service composition issue, by taking advantage of relational concept analysis (RCA), as a clustering method, and composite particle swarm optimisation (CPSO), as an optimisation technique. RCA is used to model the big service environment, whereas CPSO helps continuously optimising the quality of big service composition. The implementation and experimental studies on our approach have proven its feasibility and efficiency.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"21 1","pages":"393-421"},"PeriodicalIF":1.0,"publicationDate":"2020-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75085448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-16DOI: 10.1504/ijwgs.2020.10032934
Jing Li, Ming Zhu, Miao Yu, Yuhong Yan, Li-zhen Cui
To perform an arbitrary service composition task in a graph database, and to support plug-in semantic matching of services, we present a novel service composition approach in a graph database named pre-joined service network. Firstly, the proposed approach constructs and stores a composition network with all services and compositions in a graph database. Then, it fetches a satisfying solution by converting the user's request into queries in the graph database. To illustrate the process of searching for a solution, a simple but meaningful example is provided. Furthermore, we test the performance of the proposed approach with a challenge dataset. Experiment results show that the proposed approach can always find a valid solution and lead to higher user satisfaction when compared with the pre-joined semantic indexing graph approach.
{"title":"Service composition based on pre-joined service network in graph database","authors":"Jing Li, Ming Zhu, Miao Yu, Yuhong Yan, Li-zhen Cui","doi":"10.1504/ijwgs.2020.10032934","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10032934","url":null,"abstract":"To perform an arbitrary service composition task in a graph database, and to support plug-in semantic matching of services, we present a novel service composition approach in a graph database named pre-joined service network. Firstly, the proposed approach constructs and stores a composition network with all services and compositions in a graph database. Then, it fetches a satisfying solution by converting the user's request into queries in the graph database. To illustrate the process of searching for a solution, a simple but meaningful example is provided. Furthermore, we test the performance of the proposed approach with a challenge dataset. Experiment results show that the proposed approach can always find a valid solution and lead to higher user satisfaction when compared with the pre-joined semantic indexing graph approach.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"26 1","pages":"422-440"},"PeriodicalIF":1.0,"publicationDate":"2020-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85050592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-27DOI: 10.1504/ijwgs.2020.10031649
Kunhao Tang, Wei Jiang, Ruonan Cui, Youlong Wu
Grid computing is a new computing mode in recent years, which focuses on parallel infrastructure and its comprehensive application ability to network computers and distributed processors. Grid computing has been fully applied in the field of modern information technology and computer. Task scheduling is the core of grid computing. The quality of task scheduling algorithm directly affects the response time of the whole computing system. For heterogeneous tasks on heterogeneous platforms, this paper proposes a task scheduling algorithm with memory function, and introduces the distributed particle swarm optimisation algorithm into this algorithm, which realises the combination of resource processing tasks in grid computing and the behaviour characteristics of intelligent groups, so as to better realise the dynamic and scalable scheduling of heterogeneous tasks on heterogeneous platforms to adapt to grid environment sex. Finally, the grid simulation software GridSim is used to simulate the algorithm proposed in this paper. At the same time, it is compared with the state stochastic scheduling algorithm. Experimental results show that the proposed algorithm has obvious advantages in scheduling quality in grid environment.
{"title":"A memory-based task scheduling algorithm for grid computing based on heterogeneous platform and homogeneous tasks","authors":"Kunhao Tang, Wei Jiang, Ruonan Cui, Youlong Wu","doi":"10.1504/ijwgs.2020.10031649","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10031649","url":null,"abstract":"Grid computing is a new computing mode in recent years, which focuses on parallel infrastructure and its comprehensive application ability to network computers and distributed processors. Grid computing has been fully applied in the field of modern information technology and computer. Task scheduling is the core of grid computing. The quality of task scheduling algorithm directly affects the response time of the whole computing system. For heterogeneous tasks on heterogeneous platforms, this paper proposes a task scheduling algorithm with memory function, and introduces the distributed particle swarm optimisation algorithm into this algorithm, which realises the combination of resource processing tasks in grid computing and the behaviour characteristics of intelligent groups, so as to better realise the dynamic and scalable scheduling of heterogeneous tasks on heterogeneous platforms to adapt to grid environment sex. Finally, the grid simulation software GridSim is used to simulate the algorithm proposed in this paper. At the same time, it is compared with the state stochastic scheduling algorithm. Experimental results show that the proposed algorithm has obvious advantages in scheduling quality in grid environment.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"19 1","pages":"287-304"},"PeriodicalIF":1.0,"publicationDate":"2020-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75515297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-23DOI: 10.1504/ijwgs.2020.10030151
Qian Chen, Zhiwei Ni, Yanchun Wang, Zhangjun Wu, Xuejun Li
The widely used service-based systems (SBSs) are composed of individual services and delivered to multiple tenants. When runtime anomalies occurred, the violation rate of service level agreement (SLA) can increase remarkably. Therefore, service monitoring is crucial for meeting the tenant's quality of service (QoS) requirements. However, monitoring each service constantly wastes resources. In this paper, we propose a monitoring strategy based on multiple SLA parameters for multi-tenant SBSs (MMTS). The criticality of a service is evaluated to the importance of each service in a SBS based on QoS and tenants, tenants are ranked by multiple SLA parameters. Afterwards, monitoring benefit, resource cost, and system overload are weighed to formulate a cost-effective monitoring strategy. Finally, MMTS is evaluated with comprehensive experiments under multiple QoS dimensions and the results have shown that MMTS can outperform other six algorithms in the SLA violation rate and the cost-effectiveness of service monitoring.
{"title":"Formulating monitoring strategy based on multiple SLA parameters for multi-tenant service-based systems","authors":"Qian Chen, Zhiwei Ni, Yanchun Wang, Zhangjun Wu, Xuejun Li","doi":"10.1504/ijwgs.2020.10030151","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10030151","url":null,"abstract":"The widely used service-based systems (SBSs) are composed of individual services and delivered to multiple tenants. When runtime anomalies occurred, the violation rate of service level agreement (SLA) can increase remarkably. Therefore, service monitoring is crucial for meeting the tenant's quality of service (QoS) requirements. However, monitoring each service constantly wastes resources. In this paper, we propose a monitoring strategy based on multiple SLA parameters for multi-tenant SBSs (MMTS). The criticality of a service is evaluated to the importance of each service in a SBS based on QoS and tenants, tenants are ranked by multiple SLA parameters. Afterwards, monitoring benefit, resource cost, and system overload are weighed to formulate a cost-effective monitoring strategy. Finally, MMTS is evaluated with comprehensive experiments under multiple QoS dimensions and the results have shown that MMTS can outperform other six algorithms in the SLA violation rate and the cost-effectiveness of service monitoring.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"91 1","pages":"200-221"},"PeriodicalIF":1.0,"publicationDate":"2020-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80478645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-23DOI: 10.1504/ijwgs.2020.10030145
Jiawei Lu, Jinglin Li, Wei Liu, Qibo Sun, Ao Zhou
Mobile applications' requirements for compute capability grow up daily. Providing mobile service in remote cloud is one of the solutions to this issue. However, due to the long geographical distance of clouds, it is difficult to ensure the claimed performance of real-time service. As a result, mobile edge computing has become the main solution to solve this problem. The present researches are concerned with cloudlet placement, and computation offloading, while the problem about how to deploy services on cloudlets based on the user's geographical distribution is overlooked. We address this issue in our paper. With the consideration of minimising the number of services and guaranteeing access delay constraint at the same time, this problem is formulated into an optimisation problem. For the NP-hardness of the problem, an efficient heuristic algorithm is proposed to resolve it. The simulation experiment at the end of this paper evaluates the performance of this algorithm. Experiment results demonstrate that the proposed heuristic algorithm is effective.
{"title":"Efficient service deployment in mobile edge computing environment","authors":"Jiawei Lu, Jinglin Li, Wei Liu, Qibo Sun, Ao Zhou","doi":"10.1504/ijwgs.2020.10030145","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10030145","url":null,"abstract":"Mobile applications' requirements for compute capability grow up daily. Providing mobile service in remote cloud is one of the solutions to this issue. However, due to the long geographical distance of clouds, it is difficult to ensure the claimed performance of real-time service. As a result, mobile edge computing has become the main solution to solve this problem. The present researches are concerned with cloudlet placement, and computation offloading, while the problem about how to deploy services on cloudlets based on the user's geographical distribution is overlooked. We address this issue in our paper. With the consideration of minimising the number of services and guaranteeing access delay constraint at the same time, this problem is formulated into an optimisation problem. For the NP-hardness of the problem, an efficient heuristic algorithm is proposed to resolve it. The simulation experiment at the end of this paper evaluates the performance of this algorithm. Experiment results demonstrate that the proposed heuristic algorithm is effective.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"13 1","pages":"126-146"},"PeriodicalIF":1.0,"publicationDate":"2020-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75210622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：