首页 > 最新文献

Int. J. Networked Distributed Comput.最新文献

英文 中文
Adaptive Parameter Tuning for Constructing Storage Tiers in an Autonomous Distributed Storage System 自主分布式存储系统中构建存储层的自适应参数调优
Pub Date : 2022-11-24 DOI: 10.1007/s44227-022-00004-3
Atsushi Nunome, Hiroaki Hirata
{"title":"Adaptive Parameter Tuning for Constructing Storage Tiers in an Autonomous Distributed Storage System","authors":"Atsushi Nunome, Hiroaki Hirata","doi":"10.1007/s44227-022-00004-3","DOIUrl":"https://doi.org/10.1007/s44227-022-00004-3","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626128","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}
引用次数: 1
Application of 2‑gram and 3‑gram to Obtain Factor Scores of Statements Posted at Q&A Sites 应用2克和3克获得在问答网站上发布的报表的因子分数
Pub Date : 2022-11-18 DOI: 10.1007/s44227-022-00005-2
Yuya Yokoyama, T. Hochin, Hiroki Nomiya
{"title":"Application of 2‑gram and 3‑gram to Obtain Factor Scores of Statements Posted at Q&A Sites","authors":"Yuya Yokoyama, T. Hochin, Hiroki Nomiya","doi":"10.1007/s44227-022-00005-2","DOIUrl":"https://doi.org/10.1007/s44227-022-00005-2","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125543849","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}
引用次数: 2
Bountychain: Toward Decentralizing a Bug Bounty Program with Blockchain and IPFS Bountychain:用区块链和IPFS去中心化Bug赏金计划
Pub Date : 2021-06-01 DOI: 10.2991/IJNDC.K.210527.001
Alex A. J. Hoffman, Phillipe Austria, Chol Hyun Park, Yoohwan Kim
The first Bug Bounty Program (BBP) was launched in 1995 by Netscape [2]. The company created the program to discover pre-release software defects in Netscape Navigator, which gave rise to a new paradigm of security research. Other companies and organizations were slow to adopt a similar program at first; however, adoption began to increase in 2002. Organizations either formed their own BBP or joined existing programs from thirdparty providers. Today, BBPs provide a platform for people of all skill-levels to ethically find, report, and get paid for discovering security vulnerabilities.
第一个漏洞赏金计划(BBP)是由网景公司于1995年推出的。该公司创建了这个项目,目的是发现网景航海家发布前的软件缺陷,这引发了安全研究的新范式。起初,其他公司和组织采用类似计划的速度很慢;然而,2002年采用率开始上升。组织要么形成自己的BBP,要么加入来自第三方提供商的现有项目。今天,bbp为所有技能水平的人员提供了一个平台,使他们能够合乎道德地发现、报告安全漏洞,并从中获得报酬。
{"title":"Bountychain: Toward Decentralizing a Bug Bounty Program with Blockchain and IPFS","authors":"Alex A. J. Hoffman, Phillipe Austria, Chol Hyun Park, Yoohwan Kim","doi":"10.2991/IJNDC.K.210527.001","DOIUrl":"https://doi.org/10.2991/IJNDC.K.210527.001","url":null,"abstract":"The first Bug Bounty Program (BBP) was launched in 1995 by Netscape [2]. The company created the program to discover pre-release software defects in Netscape Navigator, which gave rise to a new paradigm of security research. Other companies and organizations were slow to adopt a similar program at first; however, adoption began to increase in 2002. Organizations either formed their own BBP or joined existing programs from thirdparty providers. Today, BBPs provide a platform for people of all skill-levels to ethically find, report, and get paid for discovering security vulnerabilities.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115496533","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}
引用次数: 4
Secure Communications by Tit-for-Tat Strategy in Vehicular Networks 车辆网络中针锋相对策略的安全通信
Pub Date : 2020-10-01 DOI: 10.2991/ijndc.k.200925.001
Fatima Zohra Mostefa, Zoulikha Mekkakia Maaza, Claude Duvallet
The Intelligent Transport System (ITS) is an important component with a new form of mobile ad hoc network, Vehicular ad hoc Networks (VANET) generate a high interest from governments, universities and private sectors. The communications transiting by a vehicle network and the information on vehicles and their drivers have to be protected and secured in order to guarantee the correct functioning of a ITS. The sensitivity of data conveyed by a VANET network reveals a high need of security. Indeed, the importance of security in this context is crucial given the critical consequences of a violation, misbehavior or an attack. Furthermore, in a very dynamic environment characterized by a nearly instant arrivals and departures of vehicles, the deployment of a security solution has to face constraints and specific configurations. Game theory is a modern branch of intelligent optimization it has been widely applied to model the behavior in a variety of applications.
智能交通系统(ITS)是一种新型移动自组织网络的重要组成部分,车辆自组织网络(VANET)引起了政府、大学和私营部门的高度兴趣。为了保证ITS的正常运行,必须对车辆网络传输的通信以及车辆及其驾驶员的信息进行保护和保护。VANET网络传输数据的敏感性表明其对安全性的要求很高。事实上,鉴于违规、不当行为或攻击的严重后果,安全在这方面的重要性是至关重要的。此外,在车辆几乎瞬间到达和离开的动态环境中,安全解决方案的部署必须面对约束和特定配置。博弈论是智能优化的一个现代分支,它被广泛应用于各种应用中对行为进行建模。
{"title":"Secure Communications by Tit-for-Tat Strategy in Vehicular Networks","authors":"Fatima Zohra Mostefa, Zoulikha Mekkakia Maaza, Claude Duvallet","doi":"10.2991/ijndc.k.200925.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200925.001","url":null,"abstract":"The Intelligent Transport System (ITS) is an important component with a new form of mobile ad hoc network, Vehicular ad hoc Networks (VANET) generate a high interest from governments, universities and private sectors. The communications transiting by a vehicle network and the information on vehicles and their drivers have to be protected and secured in order to guarantee the correct functioning of a ITS. The sensitivity of data conveyed by a VANET network reveals a high need of security. Indeed, the importance of security in this context is crucial given the critical consequences of a violation, misbehavior or an attack. Furthermore, in a very dynamic environment characterized by a nearly instant arrivals and departures of vehicles, the deployment of a security solution has to face constraints and specific configurations. Game theory is a modern branch of intelligent optimization it has been widely applied to model the behavior in a variety of applications.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116555728","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}
引用次数: 2
Vehicle Platooning Systems: Review, Classification and Validation Strategies 车辆队列系统:回顾、分类和验证策略
Pub Date : 2020-09-01 DOI: 10.2991/ijndc.k.200829.001
Faten Fakhfakh, M. Tounsi, M. Mosbah
The increase in vehicle numbers has resulted in the growth of traffic jams in cities and highways, thereby raising various issues on fuel consumption, environmental pollution, and traffic safety [1]. Platooning is an Intelligent Transport System (ITS) [2] application which has emerged as a promising solution for the traffic management in highways. The main idea of vehicle platooning suggests that a set of vehicles travel together while maintaining a small distance between each other. This can lead to an increase in traffic capacity and then an improved traffic management and a reduced travel time. Moreover, the comfort and the safety of passengers are enhanced since the scenarios of extreme acceleration or deceleration are eliminated and the platoon vehicles are considered as a single unit. Furthermore, the emission performance and the fuel economy are significantly improved. A vehicle platoon (also called “convoy”) can be seen as a group of vehicles that travel in close coordination through a headway control mechanism. These vehicles maintain a short spacing between them and a relative velocity. The vehicle in the front position, called leader, represents the trajectory and velocity reference. It controls all the following vehicles in the platoon. Each vehicle of the platoon receives orders from the leader that may be communicated either directly or by the preceding vehicle.
车辆数量的增加导致城市和高速公路的交通拥堵加剧,从而引发了燃油消耗、环境污染和交通安全等各种问题[1]。队列驾驶是智能交通系统(ITS)[2]的一种应用,已成为高速公路交通管理的一种有前途的解决方案。车辆队列的主要思想是一组车辆一起行驶,同时保持彼此之间的小距离。这可以导致交通容量的增加,然后改善交通管理和减少旅行时间。此外,由于消除了极端加速或减速的情况,并且将排车视为单个单元,因此提高了乘客的舒适性和安全性。此外,排放性能和燃油经济性也得到了显著改善。车辆排(也称为“车队”)可以看作是一组车辆通过车头距控制机制密切协调行驶。这些飞行器之间保持着很短的距离和相对速度。车辆在前面的位置,称为领导,代表轨道和速度参考。它控制排中所有以下车辆。车队的每辆车都接受来自领队的命令,这些命令可以直接传达,也可以由前一辆车传达。
{"title":"Vehicle Platooning Systems: Review, Classification and Validation Strategies","authors":"Faten Fakhfakh, M. Tounsi, M. Mosbah","doi":"10.2991/ijndc.k.200829.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200829.001","url":null,"abstract":"The increase in vehicle numbers has resulted in the growth of traffic jams in cities and highways, thereby raising various issues on fuel consumption, environmental pollution, and traffic safety [1]. Platooning is an Intelligent Transport System (ITS) [2] application which has emerged as a promising solution for the traffic management in highways. The main idea of vehicle platooning suggests that a set of vehicles travel together while maintaining a small distance between each other. This can lead to an increase in traffic capacity and then an improved traffic management and a reduced travel time. Moreover, the comfort and the safety of passengers are enhanced since the scenarios of extreme acceleration or deceleration are eliminated and the platoon vehicles are considered as a single unit. Furthermore, the emission performance and the fuel economy are significantly improved. A vehicle platoon (also called “convoy”) can be seen as a group of vehicles that travel in close coordination through a headway control mechanism. These vehicles maintain a short spacing between them and a relative velocity. The vehicle in the front position, called leader, represents the trajectory and velocity reference. It controls all the following vehicles in the platoon. Each vehicle of the platoon receives orders from the leader that may be communicated either directly or by the preceding vehicle.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121830763","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}
引用次数: 11
Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model 基于解析模型的改进轮循调度算法
Pub Date : 2020-08-01 DOI: 10.2991/ijndc.k.200804.001
Al Fiad, Zoulikha Mekkakia Maaza, Hayat Bendoukha
Nowadays, operating systems have become more complex and more efficient due to the multitasking functionality, which allows several processes to run simultaneously. The Operating System (OS) chooses a task from the Ready Queue (RQ) and allocates it to a processor, this process is known as scheduling. When several processes are in the RQ, the OS plays an important role in choosing the correct order of execution of the processes for achieving better Average Turnaround Time (ATAT) and Average Waiting Time (AWT). Task scheduling algorithms can also be applied in the cloud-computing environment; it is one of the most important activities in this environment.
如今,由于多任务功能(允许多个进程同时运行),操作系统变得更加复杂和高效。操作系统(OS)从就绪队列(RQ)中选择一个任务并将其分配给处理器,这个过程称为调度。当多个进程处于RQ中时,操作系统在选择正确的进程执行顺序以实现更好的平均周转时间(ATAT)和平均等待时间(AWT)方面起着重要作用。任务调度算法也可以应用于云计算环境;这是在这种环境中最重要的活动之一。
{"title":"Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model","authors":"Al Fiad, Zoulikha Mekkakia Maaza, Hayat Bendoukha","doi":"10.2991/ijndc.k.200804.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200804.001","url":null,"abstract":"Nowadays, operating systems have become more complex and more efficient due to the multitasking functionality, which allows several processes to run simultaneously. The Operating System (OS) chooses a task from the Ready Queue (RQ) and allocates it to a processor, this process is known as scheduling. When several processes are in the RQ, the OS plays an important role in choosing the correct order of execution of the processes for achieving better Average Turnaround Time (ATAT) and Average Waiting Time (AWT). Task scheduling algorithms can also be applied in the cloud-computing environment; it is one of the most important activities in this environment.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526480","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}
引用次数: 14
Enhancing Case-based Reasoning Approach using Incremental Learning Model for Automatic Adaptation of Classifiers in Mobile Phishing Detection 基于案例推理方法的增量学习模型在移动网络钓鱼检测中自动适应分类器
Pub Date : 2020-05-01 DOI: 10.2991/ijndc.k.200515.001
San Kyaw Zaw, S. Vasupongayya
Nowadays, millions of mobile phone users over the world are put at risk by phishing while more than 3.8 billion smartphones are estimated to be used in 2020 [1]. As a consequence, the security of these devices becomes a top priority. Moreover, mobile devices become the primary means of communication and information access [2]. Thus, in our prior work [3], some analyses on the literatures of phishing detection are performed and identified the important features for the mobile phishing detection. Then, the adaptive mobile phishing detection model is proposed in another prior work [4] by using a Case-based Reasoning (CBR) approach. In our previous work [4], the experiments were conducted to demonstrate the design decision of our proposed model and to verify the performance in handling the concept drift. However, the main challenge faced by the CBR approach is learning a new case in order to adapt the system to a new phishing pattern. The mismatching input features with the existing cases in the case-base was lacking in our prior work [4]. In this work, the incremental learning model for the adaptation to the new examples to the case-base is proposed.
如今,全球数以百万计的手机用户面临网络钓鱼的风险,而据估计,2020年将有超过38亿部智能手机被使用[1]。因此,这些设备的安全性成为重中之重。此外,移动设备已成为人们沟通和获取信息的主要手段[2]。因此,在我们之前的工作[3]中,我们对网络钓鱼检测的文献进行了一些分析,并确定了移动网络钓鱼检测的重要特征。然后,先前的另一项工作[4]采用基于案例推理(Case-based Reasoning, CBR)的方法提出了自适应移动网络钓鱼检测模型。在我们之前的工作[4]中,我们进行了实验来证明我们提出的模型的设计决策,并验证了处理概念漂移的性能。然而,CBR方法面临的主要挑战是学习新的案例,以便使系统适应新的网络钓鱼模式。我们之前的工作[4]缺少与案例库中已有案例不匹配的输入特征。在这项工作中,提出了一种增量学习模型,用于适应新的案例库。
{"title":"Enhancing Case-based Reasoning Approach using Incremental Learning Model for Automatic Adaptation of Classifiers in Mobile Phishing Detection","authors":"San Kyaw Zaw, S. Vasupongayya","doi":"10.2991/ijndc.k.200515.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.001","url":null,"abstract":"Nowadays, millions of mobile phone users over the world are put at risk by phishing while more than 3.8 billion smartphones are estimated to be used in 2020 [1]. As a consequence, the security of these devices becomes a top priority. Moreover, mobile devices become the primary means of communication and information access [2]. Thus, in our prior work [3], some analyses on the literatures of phishing detection are performed and identified the important features for the mobile phishing detection. Then, the adaptive mobile phishing detection model is proposed in another prior work [4] by using a Case-based Reasoning (CBR) approach. In our previous work [4], the experiments were conducted to demonstrate the design decision of our proposed model and to verify the performance in handling the concept drift. However, the main challenge faced by the CBR approach is learning a new case in order to adapt the system to a new phishing pattern. The mismatching input features with the existing cases in the case-base was lacking in our prior work [4]. In this work, the incremental learning model for the adaptation to the new examples to the case-base is proposed.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132412124","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}
引用次数: 0
On Learning Associative Relationship Memory among Knowledge Concepts 论知识概念间联想记忆的学习
Pub Date : 2020-05-01 DOI: 10.2991/ijndc.k.200515.005
Zhenping Xie, Kun Wang, Yuan Liu
Knowledge graph is firstly put forward by Google in 2012 [1], which uses graph structure to represent knowledge information on conceptual items. In knowledge graph, each graph node denotes a knowledge concept, and edges equipped with labels represent semantic relations among knowledge nodes. Knowledge graph is a very useful tool to represent and store the information in natural language text, and has been widely and successively applied to natural translation [2], question-answer system [3], and natural language understanding [4].
知识图谱(Knowledge graph)最早由Google于2012年提出[1],它采用图形结构来表示概念性项目的知识信息。在知识图中,每个图节点表示一个知识概念,带有标签的边表示知识节点之间的语义关系。知识图是表示和存储自然语言文本中信息的一种非常有用的工具,在自然翻译[2]、问答系统[3]、自然语言理解[4]等领域得到了广泛而先后的应用。
{"title":"On Learning Associative Relationship Memory among Knowledge Concepts","authors":"Zhenping Xie, Kun Wang, Yuan Liu","doi":"10.2991/ijndc.k.200515.005","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.005","url":null,"abstract":"Knowledge graph is firstly put forward by Google in 2012 [1], which uses graph structure to represent knowledge information on conceptual items. In knowledge graph, each graph node denotes a knowledge concept, and edges equipped with labels represent semantic relations among knowledge nodes. Knowledge graph is a very useful tool to represent and store the information in natural language text, and has been widely and successively applied to natural translation [2], question-answer system [3], and natural language understanding [4].","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097586","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}
引用次数: 3
Performance Analysis of Blockchain-based Access Control Model for Personal Health Record System with Architectural Modelling and Simulation 基于区块链的个人健康记录系统访问控制模型性能分析及体系结构建模与仿真
Pub Date : 2020-05-01 DOI: 10.2991/ijndc.k.200515.002
T. Thwin, S. Vasupongayya
The privacy and trust of Personal Health Record (PHR) system [1,2] are improved by applying the blockchain technology, in our prior works [3]. The issues that affect the use of blockchain in the PHR development were introduced and addressed with an existing private blockchain and cryptographic mechanisms in our prior work [4]. However, the usability evaluation is still lacking in our previous work [4]. Only the achievement of the privacy and the security as well as the effectiveness of the proposed blockchainbased PHR system was shown. Since, the performance is a concern for the use of blockchain for the PHR development, the usability of the proposed blockchain-based PHR system must be addressed. For that reason, the performance analysis is conducted in this work.
个人健康记录(Personal Health Record, PHR)系统[1,2]通过应用区块链技术提高了隐私性和信任度,在我们之前的工作[3]中。在我们之前的工作[4]中介绍了影响PHR开发中使用区块链的问题,并使用现有的私有区块链和加密机制解决了这些问题。然而,可用性评估在我们之前的工作中仍然缺乏。本文仅展示了所提出的基于区块链的PHR系统在隐私和安全方面的成就以及有效性。由于性能是使用区块链进行PHR开发的一个问题,因此必须解决拟议的基于区块链的PHR系统的可用性。因此,在本工作中进行性能分析。
{"title":"Performance Analysis of Blockchain-based Access Control Model for Personal Health Record System with Architectural Modelling and Simulation","authors":"T. Thwin, S. Vasupongayya","doi":"10.2991/ijndc.k.200515.002","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.002","url":null,"abstract":"The privacy and trust of Personal Health Record (PHR) system [1,2] are improved by applying the blockchain technology, in our prior works [3]. The issues that affect the use of blockchain in the PHR development were introduced and addressed with an existing private blockchain and cryptographic mechanisms in our prior work [4]. However, the usability evaluation is still lacking in our previous work [4]. Only the achievement of the privacy and the security as well as the effectiveness of the proposed blockchainbased PHR system was shown. Since, the performance is a concern for the use of blockchain for the PHR development, the usability of the proposed blockchain-based PHR system must be addressed. For that reason, the performance analysis is conducted in this work.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"44 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961782","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}
引用次数: 5
Research on Intelligent Question and Answering Based on a Pet Knowledge Map 基于宠物知识图谱的智能问答研究
Pub Date : 2020-05-01 DOI: 10.2991/ijndc.k.200515.004
Yuan Liu, Wen Zhang, Qi Yuan, Jie Zhang
question: What are the symptoms of nm getting nd? In the above example, the pet’s proper nouns, such as golden retriever, which are involved in the natural language question of the user, will be converted into the golden retriever’s part of speech nm after the entity similarity calculation, and the shift is transformed into the distemper word nf instead. The advantage of this is that it can reduce the selection workload of the naive Bayesian classifier feature. Additionally, because there is no special dataset in the pet field, the workload of building the dataset can be reduced, and the required training set can be reduced in size. The specific conversion is shown in Table 8. 3.8. Text Classification Based on Multiple Naive Bayes This article requires multiple classifications of pet text datasets. At present, there are many machine learning and deep learning Y. Liu et al. / International Journal of Networked and Distributed Computing 8(3) 162–170 169 Table 8 | Rule conversion table Conversion rule User problem Abstract problem Pet breed name — nm Golden retriever price Price of nm Pet disease name — nd What are the symptoms of golden retrievers? What is the symptom of nm? Pet food — nf Can golden retriever eat grapes? Can nm eat nf? algorithms that can perform multi-classification of texts. Multiple naive Bayes have stable classification efficiency and good performance for small-scale data and multi-classification. Because there are very few corpora in the pet field, the size of the corpus built in this paper is also very small, so this paper adopts a naive Bayesian text classifier based on polynomials. Based on the knowledge of pet knowledge maps, a total of 24 categories are constructed according to the pet breed, pet disease and pet food attributes. The user’s natural language question will match one of the 24 categories after multidirectional naive Bayes classification as the classification results. 3.9. Matching Word Sequence Diagram Through the classification result of the text quantifier based on multiple naive Bayes, the labels of the categories corresponding to the natural language problem of the user, such as weight, price, and main symptoms, are obtained, which are labels corresponding to the user problem and correspond to natural language questions. Then, the determined intention tag maps the corresponding question template, matching the word order graph in the template. The natural language question basically describes the relationship between the subject and the object, while the graph model can describe the relationship between the node and the node through the edge. The word map is a directed graph, the subject points to the object, and the predicate is used as an edge. In directed graphs, subjects and objects are entities, and predicates are relationships between entities, including attribute relationships. For example, what are the symptoms of a golden retriever with canine distemper? The conversion into a word sequence diagram
问题:得了糖尿病的症状是什么?在上面的例子中,涉及到用户自然语言问题的宠物专有名词,如金毛寻回犬,经过实体相似度计算后,会被转换成金毛寻回犬的词性nm,而平移后会被转换成犬瘟词nf。这样做的好处是可以减少朴素贝叶斯分类器特征的选择工作量。此外,由于宠物领域没有特殊的数据集,可以减少构建数据集的工作量,并且可以减少所需的训练集的大小。具体的转换如表8所示。3.8. 基于多重朴素贝叶斯的文本分类本文需要对宠物文本数据集进行多重分类。目前有很多机器学习和深度学习Y. Liu et al. / International Journal of Networked and Distributed Computing 8(3) 162-170 169表8 |规则转换表转换规则用户问题抽象问题宠物品种名称- nm金毛猎犬价格nm宠物疾病名称-和金毛猎犬的症状是什么?nm的症状是什么?宠物食品——金毛猎犬能吃葡萄吗?我能吃nf吗?可以对文本进行多重分类的算法。对于小规模数据和多分类,多重朴素贝叶斯具有稳定的分类效率和良好的分类性能。由于pet领域的语料库非常少,因此本文构建的语料库规模也很小,因此本文采用基于多项式的朴素贝叶斯文本分类器。基于宠物知识图谱的知识,根据宠物品种、宠物疾病和宠物食品属性共构建了24个类别。用户的自然语言问题将匹配多向朴素贝叶斯分类后的24个类别中的一个作为分类结果。3.9. 通过基于多个朴素贝叶斯的文本量词分类结果,得到用户自然语言问题对应的类别标签,如权重、价格、主要症状等,即为用户问题对应的标签,对应于自然语言问题。然后,确定的意图标签映射到相应的问题模板上,匹配模板中的词序图。自然语言问题基本上描述了主体与客体之间的关系,而图模型可以通过边缘来描述节点与节点之间的关系。单词映射是一个有向图,主题指向对象,谓词用作边缘。在有向图中,主题和对象是实体,谓词是实体之间的关系,包括属性关系。例如,金毛猎犬患犬瘟热的症状是什么?到字序列图的转换如图6所示。本文为三大类共24类问题构建了一个模板。问题模板示例如表9所示。3.10. 宠物知识图谱存储在图形数据库OrientDB中。本文将单词地图转换为OrientDB的SQL查询语句,将答案存储在存储知识地图的图形数据库OrientDB中,并将问题的答案返回给用户。基于宠物知识地图的自动问答系统支持宠物的来源、价格、智商、疾病概述、症状、预防等问题,可以回答三个问题。图6 |一个词地图示例。表9 |问题模板示例问题类型问题模板价格Nm价格Nm患病主要症状可食用Nm可食用图7 |一只金毛猎犬的价格主要问题。如图7所示,答案是宠物品种属性的问题,例如金毛猎犬的价格。
{"title":"Research on Intelligent Question and Answering Based on a Pet Knowledge Map","authors":"Yuan Liu, Wen Zhang, Qi Yuan, Jie Zhang","doi":"10.2991/ijndc.k.200515.004","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.004","url":null,"abstract":"question: What are the symptoms of nm getting nd? In the above example, the pet’s proper nouns, such as golden retriever, which are involved in the natural language question of the user, will be converted into the golden retriever’s part of speech nm after the entity similarity calculation, and the shift is transformed into the distemper word nf instead. The advantage of this is that it can reduce the selection workload of the naive Bayesian classifier feature. Additionally, because there is no special dataset in the pet field, the workload of building the dataset can be reduced, and the required training set can be reduced in size. The specific conversion is shown in Table 8. 3.8. Text Classification Based on Multiple Naive Bayes This article requires multiple classifications of pet text datasets. At present, there are many machine learning and deep learning Y. Liu et al. / International Journal of Networked and Distributed Computing 8(3) 162–170 169 Table 8 | Rule conversion table Conversion rule User problem Abstract problem Pet breed name — nm Golden retriever price Price of nm Pet disease name — nd What are the symptoms of golden retrievers? What is the symptom of nm? Pet food — nf Can golden retriever eat grapes? Can nm eat nf? algorithms that can perform multi-classification of texts. Multiple naive Bayes have stable classification efficiency and good performance for small-scale data and multi-classification. Because there are very few corpora in the pet field, the size of the corpus built in this paper is also very small, so this paper adopts a naive Bayesian text classifier based on polynomials. Based on the knowledge of pet knowledge maps, a total of 24 categories are constructed according to the pet breed, pet disease and pet food attributes. The user’s natural language question will match one of the 24 categories after multidirectional naive Bayes classification as the classification results. 3.9. Matching Word Sequence Diagram Through the classification result of the text quantifier based on multiple naive Bayes, the labels of the categories corresponding to the natural language problem of the user, such as weight, price, and main symptoms, are obtained, which are labels corresponding to the user problem and correspond to natural language questions. Then, the determined intention tag maps the corresponding question template, matching the word order graph in the template. The natural language question basically describes the relationship between the subject and the object, while the graph model can describe the relationship between the node and the node through the edge. The word map is a directed graph, the subject points to the object, and the predicate is used as an edge. In directed graphs, subjects and objects are entities, and predicates are relationships between entities, including attribute relationships. For example, what are the symptoms of a golden retriever with canine distemper? The conversion into a word sequence diagram","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134304981","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}
引用次数: 0
期刊
Int. J. Networked Distributed Comput.
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1