Pub Date : 2022-05-01DOI: 10.1109/icss55994.2022.00025
Chaoqun Ji, Tuo Li, Xiaofeng Zou
With the rapid development of computer technology, logical circuits play an important role in many fields. Semiconductor transistors, as the basic logic circuit unit of modern computer hardware structure, also encounter more and more technical limitations in the highly integrated field such as computer chips. In order to continue Moore's Law effectively, higher requirements need to be put forward for the basic logic unit. The emergence of memristor opens up a new way to explore advanced computing architecture. This paper presents a MRL- based logic circuit in which input and output logic is provided by high and low voltage. Logic gate circuit elements such as XOR, NAND, NOR are implemented in conjunction with CMOS inverters. Through the construction of basic ratio logic gate, the adder and multiplier is simplified, and the result of signal simulation using LTspice software is completely correct. Finally, a multifunctional logic module is innovatively designed.
{"title":"Multifunctional Module Design Based on Hybrid CMOS-Memristor Logic Circuit","authors":"Chaoqun Ji, Tuo Li, Xiaofeng Zou","doi":"10.1109/icss55994.2022.00025","DOIUrl":"https://doi.org/10.1109/icss55994.2022.00025","url":null,"abstract":"With the rapid development of computer technology, logical circuits play an important role in many fields. Semiconductor transistors, as the basic logic circuit unit of modern computer hardware structure, also encounter more and more technical limitations in the highly integrated field such as computer chips. In order to continue Moore's Law effectively, higher requirements need to be put forward for the basic logic unit. The emergence of memristor opens up a new way to explore advanced computing architecture. This paper presents a MRL- based logic circuit in which input and output logic is provided by high and low voltage. Logic gate circuit elements such as XOR, NAND, NOR are implemented in conjunction with CMOS inverters. Through the construction of basic ratio logic gate, the adder and multiplier is simplified, and the result of signal simulation using LTspice software is completely correct. Finally, a multifunctional logic module is innovatively designed.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124362787","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00017
Xin Ma, Shulin Sun, Zehua Liu, Lijun Sun
With the improvement of the computing power and storage capacity of vehicular equipment, as well as the growing privacy concerns over sharing sensitive raw data, federated learning can be a promising solution for realizing distributed vehicular crowdsourcing services. The global learning model can be used as crowdsourcing tasks and assigned to vehicles that utilize their local training models. In such a distributed scenario, it is essential to ensure the completion of high-quality training tasks and the security of sensitive data. We propose a vehicular crowdsourcing blockchain to achieve secure reputation management of vehicles in a distributed manner, providing a safe and trusted solution for vehicle crowdsourcing services. We design a worker selection scheme, which combines the reputation of workers with the amount of data as an indicator of worker reliability. We further propose an effective incentive machine to enable more workers with high reputations to participate in crowdsourcing tasks and to contribute higher quality local data. Simulation results show that the worker selection scheme improves the matching rate by 10% and significantly improves the total utility. The proposed scheme is deployed on the IBM Hyperledger Fabric platform to observe its real-world running time and overall performance.
{"title":"A Worker Selection Scheme for Vehicle Crowdsourcing Blockchain","authors":"Xin Ma, Shulin Sun, Zehua Liu, Lijun Sun","doi":"10.1109/ICSS55994.2022.00017","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00017","url":null,"abstract":"With the improvement of the computing power and storage capacity of vehicular equipment, as well as the growing privacy concerns over sharing sensitive raw data, federated learning can be a promising solution for realizing distributed vehicular crowdsourcing services. The global learning model can be used as crowdsourcing tasks and assigned to vehicles that utilize their local training models. In such a distributed scenario, it is essential to ensure the completion of high-quality training tasks and the security of sensitive data. We propose a vehicular crowdsourcing blockchain to achieve secure reputation management of vehicles in a distributed manner, providing a safe and trusted solution for vehicle crowdsourcing services. We design a worker selection scheme, which combines the reputation of workers with the amount of data as an indicator of worker reliability. We further propose an effective incentive machine to enable more workers with high reputations to participate in crowdsourcing tasks and to contribute higher quality local data. Simulation results show that the worker selection scheme improves the matching rate by 10% and significantly improves the total utility. The proposed scheme is deployed on the IBM Hyperledger Fabric platform to observe its real-world running time and overall performance.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129085389","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00028
Xiaonan Shi, Qin Li, Dan Wang, Lu Lu
Facing the integrated enhancement of network and computing requirements from emerging high-computing-demand service such as XR and metaverse, Mobile Computing Force Network (MCFN) is proposed to satisfy this kind of service. MCFN is the network which achieves computing and mobile network convergence based on the perception, control, and management over computing resources. MCFN could have the global knowledge of network topology and service endpoint, which could provide the best network and service path to satisfy end-to-end requirements. The main objectives of this paper are introducing use cases, requirements of MCFN, and potential influence on 5G-Advanced and 6G network architecture as well as the key technologies to realize MCFN.
{"title":"Mobile Computing Force Network (MCFN): Computing and Network Convergence Supporting Integrated Communication Service","authors":"Xiaonan Shi, Qin Li, Dan Wang, Lu Lu","doi":"10.1109/ICSS55994.2022.00028","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00028","url":null,"abstract":"Facing the integrated enhancement of network and computing requirements from emerging high-computing-demand service such as XR and metaverse, Mobile Computing Force Network (MCFN) is proposed to satisfy this kind of service. MCFN is the network which achieves computing and mobile network convergence based on the perception, control, and management over computing resources. MCFN could have the global knowledge of network topology and service endpoint, which could provide the best network and service path to satisfy end-to-end requirements. The main objectives of this paper are introducing use cases, requirements of MCFN, and potential influence on 5G-Advanced and 6G network architecture as well as the key technologies to realize MCFN.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134003533","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00011
Zi Ye, Xuefeng Piao, F. Meng, Bo Cao, Dianhui Chu
Intelligent recognition of express delivery address information is an important means to improve the efficiency of express list filling. At present, the confusion in user input and the inconsistent expression brings challenges to intelligent address information recognition. In addition, the recognition accuracy of the existing solutions has low identification and limited by the data format. To address the problems, this paper proposes a non-standardized Chinese express delivery address identification model based on enhanced representation, which has been improved from two aspects: entity extraction and memory network. The improved entity extraction model based on word embedding can mine the context information in the text in both positive and negative directions and consider the correlation between characters, thus outputting a more accurate prediction sequence. In order to solve the problem of information overload in existing models, a convolutional block memory network based on BERT was designed. The results of the experimental comparative analysis showed that the improved method effectively improved the identification accuracy of non-standardized Chinese express delivery address information, thus proving the effectiveness and availability of the method.
{"title":"A Non-standardized Chinese Express Delivery Address Identification Model Based on Enhanced Representation","authors":"Zi Ye, Xuefeng Piao, F. Meng, Bo Cao, Dianhui Chu","doi":"10.1109/ICSS55994.2022.00011","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00011","url":null,"abstract":"Intelligent recognition of express delivery address information is an important means to improve the efficiency of express list filling. At present, the confusion in user input and the inconsistent expression brings challenges to intelligent address information recognition. In addition, the recognition accuracy of the existing solutions has low identification and limited by the data format. To address the problems, this paper proposes a non-standardized Chinese express delivery address identification model based on enhanced representation, which has been improved from two aspects: entity extraction and memory network. The improved entity extraction model based on word embedding can mine the context information in the text in both positive and negative directions and consider the correlation between characters, thus outputting a more accurate prediction sequence. In order to solve the problem of information overload in existing models, a convolutional block memory network based on BERT was designed. The results of the experimental comparative analysis showed that the improved method effectively improved the identification accuracy of non-standardized Chinese express delivery address information, thus proving the effectiveness and availability of the method.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644128","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 : 2022-05-01DOI: 10.1109/icss55994.2022.00045
Boqin Hu, Chen Fu
In the unreleased stage of the game, how to correctly set the game difficulty is an important task to user’s feeling. Whether the difficulty of the game can be accurately measured will directly affect whether the difficulty setting is reasonable. As a commonly used stochastic simulation algorithm, Monte Carlo tree Search(MCTS) has been widely used in the field of game simulation. However, the traditional MCTS does not consider the specific situation of the game during the simulation, resulting in a low simulation success rate.In this paper, an improved MCTS is proposed to address above problems, and the UCB formula used for node selection is improved. The distance factor is included in the consideration of the process of Monte Carlo tree select node in the maze game. After compared the simulation success rate with the unimproved UCB, and tested the influence of the number of obstacles and the distance of path-finding on the performance of the algorithm, it is proved that in the case of less and shorter path-finding distance, the simulation success rate is greatly improved compared to the previous algorithm.
{"title":"Game difficulty prediction algorithm based on improved Monte Carlo tree","authors":"Boqin Hu, Chen Fu","doi":"10.1109/icss55994.2022.00045","DOIUrl":"https://doi.org/10.1109/icss55994.2022.00045","url":null,"abstract":"In the unreleased stage of the game, how to correctly set the game difficulty is an important task to user’s feeling. Whether the difficulty of the game can be accurately measured will directly affect whether the difficulty setting is reasonable. As a commonly used stochastic simulation algorithm, Monte Carlo tree Search(MCTS) has been widely used in the field of game simulation. However, the traditional MCTS does not consider the specific situation of the game during the simulation, resulting in a low simulation success rate.In this paper, an improved MCTS is proposed to address above problems, and the UCB formula used for node selection is improved. The distance factor is included in the consideration of the process of Monte Carlo tree select node in the maze game. After compared the simulation success rate with the unimproved UCB, and tested the influence of the number of obstacles and the distance of path-finding on the performance of the algorithm, it is proved that in the case of less and shorter path-finding distance, the simulation success rate is greatly improved compared to the previous algorithm.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114429207","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00047
Zhenxiang Zhao, Chao Ma, Haochen Yuan, Zhongjie Wang
Privacy preservation is drawing growing concern. Due to personal data of massive users is centralizedly owned/managed by service providers at present, it is very easy to lead to privacy disclosure and personal data abuse, therefore many countries and regions put forward privacy protection laws and regulations and researchers also propose some de-centralized personal data management systems. Nevertheless, the implementation of decentralized data management model means a radical change in current service development and service model. For service providers, it is too difficult and costly to realize these personal data management systems, and there are also no additional economic benefits. These personal data management systems are too ideal to popularize from a business model perspective, so the development of decentralized models proceeds slowly. In response to this situation, we propose a new personal data management service which realizes the transition stage between reality and ideal where users’ data can exist both in users’ personal data cloud and service providers. To address the challenges of data collection and data semantic uniformity caused by personal data cloud at this transition stage, we propose a personal data management architecture based on SoLiD (Social Linked Data) and DTP (Data Transfer Project). The proposed architecture could transfer users’ data from service providers to personal data cloud and fuse heterogeneous data through data fusion technology so as to provide users with the ability to manage their own data and a unified view of data. The feasibility and efficiency of the proposed service are practically proved through conducting a case study.
隐私保护正引起越来越多的关注。由于目前大量用户的个人数据由服务提供商集中拥有/管理，很容易导致隐私泄露和个人数据滥用，因此许多国家和地区提出了隐私保护法律法规，研究人员也提出了一些分散的个人数据管理系统。然而，分散式数据管理模型的实现意味着当前服务开发和服务模型的彻底改变。对于服务提供商来说，实现这些个人数据管理系统难度太大，成本太高，也没有额外的经济效益。从商业模式的角度来看，这些个人数据管理系统过于理想而无法普及，因此分散模式的发展缓慢。针对这种情况，我们提出了一种新的个人数据管理服务，实现了用户数据既存在于用户个人数据云中，也存在于服务提供商中，从现实到理想的过渡阶段。为了解决个人数据云在这个过渡阶段带来的数据收集和数据语义统一性的挑战，我们提出了一种基于SoLiD (Social Linked data)和DTP (data Transfer Project)的个人数据管理架构。提出的架构可以将用户数据从服务提供商转移到个人数据云，并通过数据融合技术融合异构数据，为用户提供管理自己数据的能力和统一的数据视图。通过案例分析，实际证明了该服务的可行性和有效性。
{"title":"A DTP and SoLiD based Service for Multi-Source Semantically-Heterogeneous Personal Data Management","authors":"Zhenxiang Zhao, Chao Ma, Haochen Yuan, Zhongjie Wang","doi":"10.1109/ICSS55994.2022.00047","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00047","url":null,"abstract":"Privacy preservation is drawing growing concern. Due to personal data of massive users is centralizedly owned/managed by service providers at present, it is very easy to lead to privacy disclosure and personal data abuse, therefore many countries and regions put forward privacy protection laws and regulations and researchers also propose some de-centralized personal data management systems. Nevertheless, the implementation of decentralized data management model means a radical change in current service development and service model. For service providers, it is too difficult and costly to realize these personal data management systems, and there are also no additional economic benefits. These personal data management systems are too ideal to popularize from a business model perspective, so the development of decentralized models proceeds slowly. In response to this situation, we propose a new personal data management service which realizes the transition stage between reality and ideal where users’ data can exist both in users’ personal data cloud and service providers. To address the challenges of data collection and data semantic uniformity caused by personal data cloud at this transition stage, we propose a personal data management architecture based on SoLiD (Social Linked Data) and DTP (Data Transfer Project). The proposed architecture could transfer users’ data from service providers to personal data cloud and fuse heterogeneous data through data fusion technology so as to provide users with the ability to manage their own data and a unified view of data. The feasibility and efficiency of the proposed service are practically proved through conducting a case study.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121487010","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00054
Kean Ren
With the increase in clients’ concerns about their privacy, federated learning, as a new model of machine learning process, was proposed to help people complete learning tasks on the basis of privacy protection. But the large-scale application of federated learning depends on the extensive participation of individual clients. This motivates the incentive mechanism design to increase clients’ willingness to participate. However, the incentive mechanism should take into account non-IID issues and privacy protection of clients’ sensitive information of data distribution. These two aspects are not well studied jointly in the existing incentive mechanism design. In this paper, we propose a differentially private auction for federated learning with non-IID data. It can not only protect clients’ private information of data distribution with differential privacy but also incentivize clients with suitable data distribution to deal with non-IID issues. Finally, we prove that the designed mechanism meets the design objective through detailed theoretical analysis.
{"title":"Differentially Private Auction for Federated Learning with Non-IID Data","authors":"Kean Ren","doi":"10.1109/ICSS55994.2022.00054","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00054","url":null,"abstract":"With the increase in clients’ concerns about their privacy, federated learning, as a new model of machine learning process, was proposed to help people complete learning tasks on the basis of privacy protection. But the large-scale application of federated learning depends on the extensive participation of individual clients. This motivates the incentive mechanism design to increase clients’ willingness to participate. However, the incentive mechanism should take into account non-IID issues and privacy protection of clients’ sensitive information of data distribution. These two aspects are not well studied jointly in the existing incentive mechanism design. In this paper, we propose a differentially private auction for federated learning with non-IID data. It can not only protect clients’ private information of data distribution with differential privacy but also incentivize clients with suitable data distribution to deal with non-IID issues. Finally, we prove that the designed mechanism meets the design objective through detailed theoretical analysis.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128361286","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}
Business process monitoring aims at identifying how well running processes are performing with respect to performance measures and objectives. The existing business process monitoring techniques focus on collecting and analyzing information on the way business processes themselves are executed. They neglect the evaluation of task-roles which play a key role in the performance of the whole business process execution. Different from the traditional perspective, this paper focuses on monitoring the behavior of task-roles and evaluating their performance with respect to timeliness. Specifically, this paper proposes to promote the performance of task-roles by time reminder via business process monitoring, which is implemented by semantic extension of BPMN elements. Further, we extend the information of process execution event log data, with which the performance of task-roles can be evaluated by analyzing the extended event log data. An empirical study of the proposed approach with real-world business processes reveals the effectiveness with respect to performance evaluation of task-roles.
{"title":"Task-role Performance Evaluation via Business Process Monitoring with BPMN Extension","authors":"Hangyu Cheng, Guosheng Kang, Jianxun Liu, Yiping Wen, Buqing Cao, Bowen Liang","doi":"10.1109/ICSS55994.2022.00035","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00035","url":null,"abstract":"Business process monitoring aims at identifying how well running processes are performing with respect to performance measures and objectives. The existing business process monitoring techniques focus on collecting and analyzing information on the way business processes themselves are executed. They neglect the evaluation of task-roles which play a key role in the performance of the whole business process execution. Different from the traditional perspective, this paper focuses on monitoring the behavior of task-roles and evaluating their performance with respect to timeliness. Specifically, this paper proposes to promote the performance of task-roles by time reminder via business process monitoring, which is implemented by semantic extension of BPMN elements. Further, we extend the information of process execution event log data, with which the performance of task-roles can be evaluated by analyzing the extended event log data. An empirical study of the proposed approach with real-world business processes reveals the effectiveness with respect to performance evaluation of task-roles.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129569752","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00031
Yongqiang Dong, Chenchen Guan, Yunli Chen, Kun Gao, Lu Lu, Yuexia Fu
To improve the users satisfaction requesting services in Computing Force Network(CFN), the issues and challenges of existing service scheduling mechanisms are examined firstly in this paper. Then in view of users' specific preference and expectation for services, a service optimization scheduling algorithm based on Bkd-tree is proposed, taking service response time, service scheduling cost, availability, and successability into consideration. The method covers a search algorithm and a reconstructing strategy. To improve the efficiency of selecting the service instances that satisfy user expectation, a pruning strategy is used to narrow search space. To support dynamic updates of the service instances, a reconstructing strategy is proposed. The experimental results show that the improved service scheduling algorithm can schedule service instances with the best overall performance while maintaining higher efficiency.
{"title":"Optimization of Service Scheduling in Computing Force Network","authors":"Yongqiang Dong, Chenchen Guan, Yunli Chen, Kun Gao, Lu Lu, Yuexia Fu","doi":"10.1109/ICSS55994.2022.00031","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00031","url":null,"abstract":"To improve the users satisfaction requesting services in Computing Force Network(CFN), the issues and challenges of existing service scheduling mechanisms are examined firstly in this paper. Then in view of users' specific preference and expectation for services, a service optimization scheduling algorithm based on Bkd-tree is proposed, taking service response time, service scheduling cost, availability, and successability into consideration. The method covers a search algorithm and a reconstructing strategy. To improve the efficiency of selecting the service instances that satisfy user expectation, a pruning strategy is used to narrow search space. To support dynamic updates of the service instances, a reconstructing strategy is proposed. The experimental results show that the improved service scheduling algorithm can schedule service instances with the best overall performance while maintaining higher efficiency.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"42 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310734","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 : 2022-05-01DOI: 10.1109/ICSS55994.2022.00016
J. Su, Jiyi Liu, Yuhong Nan, Yin Li
As a computer program running on top of blockchain, smart contract not only proliferates the diversity of applications but also brings a myriad of security issues that lead to huge financial losses. As a result, security evaluation of smart contracts, such as vulnerability identification and attack detection, has received extensive attention in recent years. Given that various types of approaches have been proposed for smart contract security analysis, a systematization of knowledge for this domain is needed. To this end, in this paper, we systematically review the related literature in recent years and describe the mainstream approaches to the security evaluation of smart contracts. Specifically, we classify state-of-the-art analysis techniques for smart contract analysis into two categories, namely, code-based approaches and transaction-based approaches. Further, we elaborate on the key techniques adopted by these works respectively. We highlight and summarize the key challenges in future research for smart contract security analysis. Our research provides a more in-depth understanding of the state-of-the-art works for securing smart contracts, which may shed light on future research in this area.
{"title":"Security Evaluation of Smart Contracts based on Code and Transaction - A Survey","authors":"J. Su, Jiyi Liu, Yuhong Nan, Yin Li","doi":"10.1109/ICSS55994.2022.00016","DOIUrl":"https://doi.org/10.1109/ICSS55994.2022.00016","url":null,"abstract":"As a computer program running on top of blockchain, smart contract not only proliferates the diversity of applications but also brings a myriad of security issues that lead to huge financial losses. As a result, security evaluation of smart contracts, such as vulnerability identification and attack detection, has received extensive attention in recent years. Given that various types of approaches have been proposed for smart contract security analysis, a systematization of knowledge for this domain is needed. To this end, in this paper, we systematically review the related literature in recent years and describe the mainstream approaches to the security evaluation of smart contracts. Specifically, we classify state-of-the-art analysis techniques for smart contract analysis into two categories, namely, code-based approaches and transaction-based approaches. Further, we elaborate on the key techniques adopted by these works respectively. We highlight and summarize the key challenges in future research for smart contract security analysis. Our research provides a more in-depth understanding of the state-of-the-art works for securing smart contracts, which may shed light on future research in this area.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132113821","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
扫码关注我们
求助内容：
应助结果提醒方式：