Pub Date : 2023-09-01DOI: 10.53106/160792642023092405012
Tao Du Tao Du, Weina Fu Tao Du
Aiming to address the problems of low accuracy and long time consuming of existing education quality evaluation models, a new online distance education quality evaluation model based on grey correlation algorithm is proposed. Firstly, calculate the membership of education quality data, and complete the data collection through cluster mining. Secondly, construct the evaluation index system according to the set evaluation principles. Finally, the grey correlation degree algorithm is used to mine the correlation degree relationship of education quality index data and complete the construction of the evaluation model. The comparison test results show that the evaluation accuracy of the built model is 0.98, the response time is only 0.7s, the CPU proportion is only 27%, and the satisfaction rate is more than 0.97. Therefore, the model has higher application value.
{"title":"Quality Evaluation for Online Distance Education Based on Grey Relational Degree","authors":"Tao Du Tao Du, Weina Fu Tao Du","doi":"10.53106/160792642023092405012","DOIUrl":"https://doi.org/10.53106/160792642023092405012","url":null,"abstract":"<p>Aiming to address the problems of low accuracy and long time consuming of existing education quality evaluation models, a new online distance education quality evaluation model based on grey correlation algorithm is proposed. Firstly, calculate the membership of education quality data, and complete the data collection through cluster mining. Secondly, construct the evaluation index system according to the set evaluation principles. Finally, the grey correlation degree algorithm is used to mine the correlation degree relationship of education quality index data and complete the construction of the evaluation model. The comparison test results show that the evaluation accuracy of the built model is 0.98, the response time is only 0.7s, the CPU proportion is only 27%, and the satisfaction rate is more than 0.97. Therefore, the model has higher application value.</p> <p>&nbsp;</p>","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135637974","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 : 2023-09-01DOI: 10.53106/160792642023092405010
Wen Ying Wen Ying, Mingwang Ou Wen Ying, Qichun Liang Mingwang Ou, Zhixia Yang Qichun Liang, Man Zhao Zhixia Yang
Marine target situational awareness is developing towards intelligence. The practical application of marine law enforcement, route control, fishery supervision and other fields makes marine ship track mining and anomaly analysis a hot direction of technology development. At present, most of the research focuses on the feature recognition of single target or single target signal, while the research on correlation anomaly detection based on multi target or multi target signal is relatively less. In this paper, based on the large spatio-temporal data of ocean targets such as radar and AIS track, the corresponding recognition algorithm is designed for the abnormal transport behavior. The real-time batch detection of illegal transshipment is realized, which verifies the effectiveness of the algorithm and shows good performance in practical application scenarios.
{"title":"Abnormal Detection Method of Transship Based on Marine Target Spatio-Temporal Data","authors":"Wen Ying Wen Ying, Mingwang Ou Wen Ying, Qichun Liang Mingwang Ou, Zhixia Yang Qichun Liang, Man Zhao Zhixia Yang","doi":"10.53106/160792642023092405010","DOIUrl":"https://doi.org/10.53106/160792642023092405010","url":null,"abstract":"<p>Marine target situational awareness is developing towards intelligence. The practical application of marine law enforcement, route control, fishery supervision and other fields makes marine ship track mining and anomaly analysis a hot direction of technology development. At present, most of the research focuses on the feature recognition of single target or single target signal, while the research on correlation anomaly detection based on multi target or multi target signal is relatively less. In this paper, based on the large spatio-temporal data of ocean targets such as radar and AIS track, the corresponding recognition algorithm is designed for the abnormal transport behavior. The real-time batch detection of illegal transshipment is realized, which verifies the effectiveness of the algorithm and shows good performance in practical application scenarios.</p> <p>&nbsp;</p>","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135637966","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 : 2023-09-01DOI: 10.53106/160792642023092405008
Hongyan Wan Hongyan Wan, Huan Jin Hongyan Wan, Qin Zheng Huan Jin, Weibo Li Qin Zheng, Junwei Fang Weibo Li
Ontology is a core concept model in a knowledge graph which describes knowledge in the form of a graph. With the increase in knowledge graphs, the semantic relationships between concepts become more and more complex, which increases the difficulty of reserving its semantic integrity when storing it in a database. In this paper, we propose an ontology-to-graph database mapping method, which can reserve maximum semantic integrity and reduce redundant information simultaneously with high storage efficiency and query efficiency. In detail, the mapping method uses an anonymous class storage strategy to handle indefinite long nested structures, a multivariate functional relation storage strategy for multivariate semantic analysis, and an SWRL (Semantic Web Rule Language) storage strategy for disassembling inference structures. We develop an ontology-to-graph database prototype Neo4J4Onto to implement the mapping method. Experimental results show that our method achieves the maximum semantic integrity with the lowest complexity compared to the 6 baseline methods. Besides, compared to graphDB, Neo4J4Onto has better storage and query efficiency, and the concept models retrieved by Neo4J4Onto are more complete.
{"title":"A Maximum Semantic Reservation Mapping Method Based on Ontology-to-graph Database","authors":"Hongyan Wan Hongyan Wan, Huan Jin Hongyan Wan, Qin Zheng Huan Jin, Weibo Li Qin Zheng, Junwei Fang Weibo Li","doi":"10.53106/160792642023092405008","DOIUrl":"https://doi.org/10.53106/160792642023092405008","url":null,"abstract":"Ontology is a core concept model in a knowledge graph which describes knowledge in the form of a graph. With the increase in knowledge graphs, the semantic relationships between concepts become more and more complex, which increases the difficulty of reserving its semantic integrity when storing it in a database. In this paper, we propose an ontology-to-graph database mapping method, which can reserve maximum semantic integrity and reduce redundant information simultaneously with high storage efficiency and query efficiency. In detail, the mapping method uses an anonymous class storage strategy to handle indefinite long nested structures, a multivariate functional relation storage strategy for multivariate semantic analysis, and an SWRL (Semantic Web Rule Language) storage strategy for disassembling inference structures. We develop an ontology-to-graph database prototype Neo4J4Onto to implement the mapping method. Experimental results show that our method achieves the maximum semantic integrity with the lowest complexity compared to the 6 baseline methods. Besides, compared to graphDB, Neo4J4Onto has better storage and query efficiency, and the concept models retrieved by Neo4J4Onto are more complete.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135637975","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 : 2023-09-01DOI: 10.53106/160792642023092405007
Jian Li Jian Li, Ze-Xi Wang Jian Li, Rong Li Ze-Xi Wang, Guang-Jie Han Rong Li, Jun-Hao Li Guang-Jie Han
Given the lack of research on the regularity of distribution of singular points, the singular points under different influence factors are analyzed. The location of singular points for adjacent modes group (AMG) generated by the interference modes is derived using normal modes theory in the far field of the ideal shallow waveguide. The singular points are verified by simulation, which compares the distribution of the acoustic field and singular points. Moreover, it is concluded that the number and distribution of singular points in the period of the interference structure of the field (PISF) has a relationship with order (lower order of AMG) and adjacent order (difference between two orders of AMG). The arrangement of upper-lower-two-points increases by 2 with each increase of order and is distributed at both ends of PISF. The arrangement of rhombic-four-points increases by 1 with each increase of adjacent order and increases alternately at both ends of PISF. Meanwhile, there is a periodic relationship between the depth of the source and the location of singular points.
{"title":"Singular Points Location Pattern Analysis based on Modes Interference","authors":"Jian Li Jian Li, Ze-Xi Wang Jian Li, Rong Li Ze-Xi Wang, Guang-Jie Han Rong Li, Jun-Hao Li Guang-Jie Han","doi":"10.53106/160792642023092405007","DOIUrl":"https://doi.org/10.53106/160792642023092405007","url":null,"abstract":"<p>Given the lack of research on the regularity of distribution of singular points, the singular points under different influence factors are analyzed. The location of singular points for adjacent modes group (AMG) generated by the interference modes is derived using normal modes theory in the far field of the ideal shallow waveguide. The singular points are verified by simulation, which compares the distribution of the acoustic field and singular points. Moreover, it is concluded that the number and distribution of singular points in the period of the interference structure of the field (PISF) has a relationship with order (lower order of AMG) and adjacent order (difference between two orders of AMG). The arrangement of upper-lower-two-points increases by 2 with each increase of order and is distributed at both ends of PISF. The arrangement of rhombic-four-points increases by 1 with each increase of adjacent order and increases alternately at both ends of PISF. Meanwhile, there is a periodic relationship between the depth of the source and the location of singular points.</p> <p>&nbsp;</p>","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135638100","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 : 2023-09-01DOI: 10.53106/160792642023092405004
Yang Zhou Yang Zhou, Bing Yang Yang Zhou, Dengzhi Liu Bing Yang
As a new generation of electricity system, smart grid significantly improves electricity services’ efficiency, reliability, and sustainability. The smart meters, which are the essential terminals, help establish two-way communication between users and electricity providers. While enjoying the convenience of smart meters, users face many challenges. On the one hand, malicious adversaries could attack the smart meters and thus steal the users’ privacy. On the other hand, the computational overhead of electricity data verification is high for lightweight smart meters. To address above issues, a lightweight authentication and group key management scheme is proposed. In the proposed scheme, the physical properties of the Physical Unclonable Function (PUF) are exploited to defend against external attacks from adversaries. Moreover, the Chinese Remainder Theorem (CRT) is used to broadcast the updated group keys for the legitimate smart meters in the community. In addition, the aggregated signature is utilized to reduce the overhead of the data verification. Finally, the Random Oracle Model (ROM) is used to demonstrate that the proposed scheme meets many security requirements. Performance analysis shows that the proposed scheme is more suitable for smart grid compared to previous schemes.
{"title":"Lightweight and Anonymous Group Authentication Scheme Based on PUF in the Smart Grid","authors":"Yang Zhou Yang Zhou, Bing Yang Yang Zhou, Dengzhi Liu Bing Yang","doi":"10.53106/160792642023092405004","DOIUrl":"https://doi.org/10.53106/160792642023092405004","url":null,"abstract":"<p>As a new generation of electricity system, smart grid significantly improves electricity services&rsquo; efficiency, reliability, and sustainability. The smart meters, which are the essential terminals, help establish two-way communication between users and electricity providers. While enjoying the convenience of smart meters, users face many challenges. On the one hand, malicious adversaries could attack the smart meters and thus steal the users&rsquo; privacy. On the other hand, the computational overhead of electricity data verification is high for lightweight smart meters. To address above issues, a lightweight authentication and group key management scheme is proposed. In the proposed scheme, the physical properties of the Physical Unclonable Function (PUF) are exploited to defend against external attacks from adversaries. Moreover, the Chinese Remainder Theorem (CRT) is used to broadcast the updated group keys for the legitimate smart meters in the community. In addition, the aggregated signature is utilized to reduce the overhead of the data verification. Finally, the Random Oracle Model (ROM) is used to demonstrate that the proposed scheme meets many security requirements. Performance analysis shows that the proposed scheme is more suitable for smart grid compared to previous schemes.</p> <p>&nbsp;</p>","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135637971","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-09-01DOI: 10.53106/160792642021092205009
Yao-Chiang Yang, Wei-Tsong Lee, Chih-Hsing Chen
In the home media network, Cable Modem is a useful device that most people have well-known. People expected network access as much less delayed as possible as what they can obtain. Therefore, the objective of effective bandwidth control becomes more and more important recently. In this paper, we are going to propose a methodology of Multi-downstream Service Algorithm (MDSA) to monitor the variation of input arrival rate to manage the bandwidth by Weighted Fair Queue (WFQ) based on a service workload. Applying this way, it is useful to refer to this paper of the bandwidth management method, assessing the input arrival rate that matches how the relative bandwidth is. Furthermore, the delayed time is effectively reduced accordingly.
{"title":"A Weighted Fair Queue Management on DOCSIS Multi-downstream Channels","authors":"Yao-Chiang Yang, Wei-Tsong Lee, Chih-Hsing Chen","doi":"10.53106/160792642021092205009","DOIUrl":"https://doi.org/10.53106/160792642021092205009","url":null,"abstract":"In the home media network, Cable Modem is a useful device that most people have well-known. People expected network access as much less delayed as possible as what they can obtain. Therefore, the objective of effective bandwidth control becomes more and more important recently. In this paper, we are going to propose a methodology of Multi-downstream Service Algorithm (MDSA) to monitor the variation of input arrival rate to manage the bandwidth by Weighted Fair Queue (WFQ) based on a service workload. Applying this way, it is useful to refer to this paper of the bandwidth management method, assessing the input arrival rate that matches how the relative bandwidth is. Furthermore, the delayed time is effectively reduced accordingly.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"1031-1052"},"PeriodicalIF":1.6,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46813025","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-09-01DOI: 10.53106/160792642021092205012
Zhiqiang Xie, Xiaowei Zhang, Yingchun Xia, Jing Yang, Y. Xin
No-wait Integrated Scheduling Problem (NISP) describes a real-life process of the non-standard products where the consideration is given to the great structure differences, processing parameter differences, no-wait constraint, and the need for further deep processing after assembly of jobs. To deal with the dynamic orders of non-standard products, the scheduling algorithm to be design should be a dynamic algorithm with the ability to deal with the above conditions. At first, the dynamic scheduling problem is transformed to a series of continuous static scheduling problem by adoption of window-based event-driven strategy, thus establishing constraint programming model targeted at minimal total tardiness and thereby proposing a hybrid method of Heuristic Algorithm and Constraint Programming (HA-CP) for the problem. In order to enhance the ability to response the dynamic orders of non-standard products, HA-CP adopts heuristic algorithm to generate a pre-scheduling solution at each dynamic event moment, so that jobs that fall into the window period are labelled as dispatched jobs, while the remaining jobs are labelled as jobs to be dispatched. To improve solution quality, the jobs to be dispatched are mapped into an operation-based constraint programming model, then, during the execution interval of dispatched jobs, constraint programming solver starts to solve the jobs to be dispatched and update the current solution if the solver gets a better solution within the execution interval. The above procedures are repeated until all jobs are scheduled. Finally, the results of simulation experiment show that the proposed algorithm is effective and feasible.
{"title":"A Hybrid Method of Heuristic Algorithm and Constraint Programming for No-wait Integrated Scheduling Problem","authors":"Zhiqiang Xie, Xiaowei Zhang, Yingchun Xia, Jing Yang, Y. Xin","doi":"10.53106/160792642021092205012","DOIUrl":"https://doi.org/10.53106/160792642021092205012","url":null,"abstract":"No-wait Integrated Scheduling Problem (NISP) describes a real-life process of the non-standard products where the consideration is given to the great structure differences, processing parameter differences, no-wait constraint, and the need for further deep processing after assembly of jobs. To deal with the dynamic orders of non-standard products, the scheduling algorithm to be design should be a dynamic algorithm with the ability to deal with the above conditions. At first, the dynamic scheduling problem is transformed to a series of continuous static scheduling problem by adoption of window-based event-driven strategy, thus establishing constraint programming model targeted at minimal total tardiness and thereby proposing a hybrid method of Heuristic Algorithm and Constraint Programming (HA-CP) for the problem. In order to enhance the ability to response the dynamic orders of non-standard products, HA-CP adopts heuristic algorithm to generate a pre-scheduling solution at each dynamic event moment, so that jobs that fall into the window period are labelled as dispatched jobs, while the remaining jobs are labelled as jobs to be dispatched. To improve solution quality, the jobs to be dispatched are mapped into an operation-based constraint programming model, then, during the execution interval of dispatched jobs, constraint programming solver starts to solve the jobs to be dispatched and update the current solution if the solver gets a better solution within the execution interval. The above procedures are repeated until all jobs are scheduled. Finally, the results of simulation experiment show that the proposed algorithm is effective and feasible.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"1083-1090"},"PeriodicalIF":1.6,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49266173","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}
Distance perception is the basis and necessary prerequisite of environment perception, attitude perception and obstacle avoidance for both intelligent vehicle and unmanned vehicle. Passive ranging is a critical part of machine vision measurement. Most passive ranging methods based on machine vision apply binocular technology that needs strict hardware conditions and lacks universality. Therefore, the monocular vision ranging method is one of the mainstream distance sensing methods at present. In order to improve the accuracy of monocular vision ranging, a monocular vision ranging method based on pixel area and aspect ratio is proposed. Subsequently, this method improves the stability of real-time target detection by introducing Kalman filter processing. Experimental results display that that ranging used by this method has higher accuracy. The mean relative error of the depth measurement is 5% when it is 3-10 m. After introducing Kalman filter, the stability of real-time ranging processing is improved by 25.21%. In this paper, the ROS smart car with real-time target tracking is also realized by the method based on the combination of SIFT-KCF target detection and tracking and monocular ranging.
{"title":"KFPA Monocular Ranging Algorithm Design and Application in Mobile edge Computing","authors":"Shuo Chen, Songzhu Mei, Gangyong Jia, Youhuizi Li, Weihua Zhao","doi":"10.53106/160792642021092205016","DOIUrl":"https://doi.org/10.53106/160792642021092205016","url":null,"abstract":"Distance perception is the basis and necessary prerequisite of environment perception, attitude perception and obstacle avoidance for both intelligent vehicle and unmanned vehicle. Passive ranging is a critical part of machine vision measurement. Most passive ranging methods based on machine vision apply binocular technology that needs strict hardware conditions and lacks universality. Therefore, the monocular vision ranging method is one of the mainstream distance sensing methods at present. In order to improve the accuracy of monocular vision ranging, a monocular vision ranging method based on pixel area and aspect ratio is proposed. Subsequently, this method improves the stability of real-time target detection by introducing Kalman filter processing. Experimental results display that that ranging used by this method has higher accuracy. The mean relative error of the depth measurement is 5% when it is 3-10 m. After introducing Kalman filter, the stability of real-time ranging processing is improved by 25.21%. In this paper, the ROS smart car with real-time target tracking is also realized by the method based on the combination of SIFT-KCF target detection and tracking and monocular ranging.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"1129-1140"},"PeriodicalIF":1.6,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43673585","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-09-01DOI: 10.53106/160792642021092205015
Jiaxing Wang, Si-Cheng Gao, Cong-Er Yuan, Da-peng Tan, Jing Fan
The service vendors desire to improve their service processes to retain consumers and increase profits. Most existing methods require a mass of domain knowledge to improve their service processes, which are time-consuming and error-prone. This paper proposes a method named Diff-BPI to automatically improve a service process, reducing execution cost while guaranteeing consumers’ waiting/process time. Given the existing two versions of a service process, Diff-BPI first detects their differences and all possible candidate improved service processes are constructed by connecting their same parts and combinations of different parts. After that, Diff-BPI calculates three metrics for each candidate: “quality of improvement (QoI)”, “longest execution time (LET)” and “stability of time (SoT)”, and filters the candidates with LETs higher than the given time limit and QoIs/SoTs less than the given one. Finally, Diff-BPI picks the best candidate with the lowest cost less than the costs of two existing versions. A case study shows that Diff-BPI can construct an improved service process with a lower cost than the existing two versions. The efficiency evaluation reveals that Diff-BPI can save more than 20% of the running time for improving a service process using the filter strategy when the number of differences between the two versions is more than 3.
{"title":"Service Process Improvement Based on Business Process Management","authors":"Jiaxing Wang, Si-Cheng Gao, Cong-Er Yuan, Da-peng Tan, Jing Fan","doi":"10.53106/160792642021092205015","DOIUrl":"https://doi.org/10.53106/160792642021092205015","url":null,"abstract":"The service vendors desire to improve their service processes to retain consumers and increase profits. Most existing methods require a mass of domain knowledge to improve their service processes, which are time-consuming and error-prone. This paper proposes a method named Diff-BPI to automatically improve a service process, reducing execution cost while guaranteeing consumers’ waiting/process time. Given the existing two versions of a service process, Diff-BPI first detects their differences and all possible candidate improved service processes are constructed by connecting their same parts and combinations of different parts. After that, Diff-BPI calculates three metrics for each candidate: “quality of improvement (QoI)”, “longest execution time (LET)” and “stability of time (SoT)”, and filters the candidates with LETs higher than the given time limit and QoIs/SoTs less than the given one. Finally, Diff-BPI picks the best candidate with the lowest cost less than the costs of two existing versions. A case study shows that Diff-BPI can construct an improved service process with a lower cost than the existing two versions. The efficiency evaluation reveals that Diff-BPI can save more than 20% of the running time for improving a service process using the filter strategy when the number of differences between the two versions is more than 3.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"1117-1128"},"PeriodicalIF":1.6,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43915723","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-09-01DOI: 10.53106/160792642021092205004
C. Wang, Jun Shen, Shichong Tan
The blockchain is getting increasingly popular nowadays because of its decentralization and distributed consistency. The backbone protocol of blockchain is the consensus protocol, making it execute stably. The commonly used consensus protocols in blockchain, such as Proof of Work (PoW), Proof of Stake (PoS) and Proof of Space (PoSpace), have the problem of massive waste of resources. As far as we know, the existing consensus protocols fail to deal with such an issue well. In order to make full use of these resources, we propose a new consensus protocol named Proof of Storage Age and Integrity Verification (PoSI) in this paper. We introduce the definition of storage age and combine it with pairing-free data integrity verification in the proposed protocol. Numerous analyses and implementation results demonstrate the security and high efficiency of the proposed protocol.
{"title":"PoSI: A New Consensus Protocol Based on Storage Age and Data Integrity Verification","authors":"C. Wang, Jun Shen, Shichong Tan","doi":"10.53106/160792642021092205004","DOIUrl":"https://doi.org/10.53106/160792642021092205004","url":null,"abstract":"The blockchain is getting increasingly popular nowadays because of its decentralization and distributed consistency. The backbone protocol of blockchain is the consensus protocol, making it execute stably. The commonly used consensus protocols in blockchain, such as Proof of Work (PoW), Proof of Stake (PoS) and Proof of Space (PoSpace), have the problem of massive waste of resources. As far as we know, the existing consensus protocols fail to deal with such an issue well. In order to make full use of these resources, we propose a new consensus protocol named Proof of Storage Age and Integrity Verification (PoSI) in this paper. We introduce the definition of storage age and combine it with pairing-free data integrity verification in the proposed protocol. Numerous analyses and implementation results demonstrate the security and high efficiency of the proposed protocol.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"977-987"},"PeriodicalIF":1.6,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49660535","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号