Jésica de Armas, Pere Tuset, Tengfei Chang, F. Adelantado, T. Watteyne, Xavier Vilajosana
Industrial low-power wireless mesh standards, such as IEEE802.15.4-TSCH, WirelessHART and ISA100.10a, offer wire-like end-to-end reliability and a decade of battery lifetime. These technologies have become de-facto standards, used in the most demanding applications such as industrial process monitoring. In this paper, we explore what it takes to go from industrial process monitoring to industrial process control. The difference is that, in the latter case, the network needs to provide low and predicable latency, and deterministic operation. We explore the overall usefulness of packet replication, in which a source node sends multiple copies of a packet on disjoint multihop paths. We show, through extensive simulation, that packet replication allows for a reduction of end-to-end latency by 40%. In addition, packet replication significantly improves the network reliability through path diversity. This work is directly in line with standardization activities at the IETF 6TiSCH and DetNet working groups, to which it is being contributed.
{"title":"Determinism through Path Diversity: Why Packet Replication Makes Sense","authors":"Jésica de Armas, Pere Tuset, Tengfei Chang, F. Adelantado, T. Watteyne, Xavier Vilajosana","doi":"10.1109/INCoS.2016.105","DOIUrl":"https://doi.org/10.1109/INCoS.2016.105","url":null,"abstract":"Industrial low-power wireless mesh standards, such as IEEE802.15.4-TSCH, WirelessHART and ISA100.10a, offer wire-like end-to-end reliability and a decade of battery lifetime. These technologies have become de-facto standards, used in the most demanding applications such as industrial process monitoring. In this paper, we explore what it takes to go from industrial process monitoring to industrial process control. The difference is that, in the latter case, the network needs to provide low and predicable latency, and deterministic operation. We explore the overall usefulness of packet replication, in which a source node sends multiple copies of a packet on disjoint multihop paths. We show, through extensive simulation, that packet replication allows for a reduction of end-to-end latency by 40%. In addition, packet replication significantly improves the network reliability through path diversity. This work is directly in line with standardization activities at the IETF 6TiSCH and DetNet working groups, to which it is being contributed.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131021273","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}
The problem that damage effectiveness evaluation on the time sensitive group targets for trajectory correction rocket carrying with terminal-sensitive projectiles is discussed in this passage. Firstly, considering the condition that one trajectory correction rocket carrying with terminal sensitive projectiles striking single target, we introduced its damage probability model. Secondly, on the basis of the above research, the model with point to point is expounded to the model with group to group. Thirdly, based on the condition that close monitored targets and emergent targets, we introduce the probability of targets being present, and the damage effectiveness evaluation is further introduced based on the probability. Finally, the numerical simulation shows the effectiveness of the method, and the residence time of time sensitive targets correlated with damage effectiveness evaluation are further analyzed.
{"title":"Damage Effectiveness Evaluation on the Time Sensitive Group Targets for Trajectory Correction Missile Carrying with Terminal-Sensitive Projectiles","authors":"Jie Li, Hong Zhang","doi":"10.1109/INCoS.2016.57","DOIUrl":"https://doi.org/10.1109/INCoS.2016.57","url":null,"abstract":"The problem that damage effectiveness evaluation on the time sensitive group targets for trajectory correction rocket carrying with terminal-sensitive projectiles is discussed in this passage. Firstly, considering the condition that one trajectory correction rocket carrying with terminal sensitive projectiles striking single target, we introduced its damage probability model. Secondly, on the basis of the above research, the model with point to point is expounded to the model with group to group. Thirdly, based on the condition that close monitored targets and emergent targets, we introduce the probability of targets being present, and the damage effectiveness evaluation is further introduced based on the probability. Finally, the numerical simulation shows the effectiveness of the method, and the residence time of time sensitive targets correlated with damage effectiveness evaluation are further analyzed.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125800477","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}
High reliability is required in networks, and it is important to build robust networks that are tolerant to network failures. In content delivery services in particular, service interruptions due to disconnection of communication paths between the server and nodes that receive the service must be avoided. Content delivery services use a master server that contains the original content and multiple edge-servers (mirror servers) that hold copies of the content so that communication paths exist between the master server and the edge-servers even in the event of a failure. In addition to the guarantee of network connectivity, large increases in path lengths when changing from the paths used during normal operation to alternative paths in the event of a failure must be avoided from the viewpoint of suppressing degradation of the communication quality and the possibility of congestion. However, building such high-reliability networks involves huge costs. Therefore, it is considered necessary to devise a network design that can realize continuity of communication between the master server and the edge-servers by suppressing sudden increases in path length, even if a failure occurs. In this paper, we formulate a network design problem and show that it is NP-hard. We also design a polynomial-time approximation algorithm for the case where the number of failed links is constant, and we evaluated its performance in various actual network topologies.
{"title":"Network Design Method Based on Link Protection Taking Account of the Connectivity and Distance Between Sites","authors":"Tsuyoshi Yamasaki, M. Anan, H. Miwa","doi":"10.1109/INCoS.2016.74","DOIUrl":"https://doi.org/10.1109/INCoS.2016.74","url":null,"abstract":"High reliability is required in networks, and it is important to build robust networks that are tolerant to network failures. In content delivery services in particular, service interruptions due to disconnection of communication paths between the server and nodes that receive the service must be avoided. Content delivery services use a master server that contains the original content and multiple edge-servers (mirror servers) that hold copies of the content so that communication paths exist between the master server and the edge-servers even in the event of a failure. In addition to the guarantee of network connectivity, large increases in path lengths when changing from the paths used during normal operation to alternative paths in the event of a failure must be avoided from the viewpoint of suppressing degradation of the communication quality and the possibility of congestion. However, building such high-reliability networks involves huge costs. Therefore, it is considered necessary to devise a network design that can realize continuity of communication between the master server and the edge-servers by suppressing sudden increases in path length, even if a failure occurs. In this paper, we formulate a network design problem and show that it is NP-hard. We also design a polynomial-time approximation algorithm for the case where the number of failed links is constant, and we evaluated its performance in various actual network topologies.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778094","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}
At present, the issue of intrusion detection must be a hot point to all over the computer security area. In this paper, two novel intrusion detection techniques have been proposed. First, unlike the current existent detection methods, this paper combines the theories of both intuitionistic fuzzy sets (IFS) and artificial neural networks (ANN) together, which lead to much fewer iteration numbers, higher detection rates and sufficient stability. Experimental results show that the first method proposed in this paper is promising and has obvious superiorities over other current typical ones. Then we address another novel technique based on non-subsampled Shearlet transform (NSST) domain artificial neural networks (ANN) to solve those problems, including employing multi-scale geometry analysis (MGA) of NSST and the train characteristics of ANN together. Experimental results indicate that, compared with other existing conventional intrusion detection tools, the second proposed method is superior to other current popular ones in both aspects of iteration numbers and convergence rates. Therefore, the anomaly detection process is performed through processing the signals representing the metrics. Experimental results indicate that the third proposed technique is effective and promising.
{"title":"Intrusion Detection Techniques Based on Improved Intuitionistic Fuzzy Neural Networks","authors":"Yang Lei, Jia Liu, Hongyan Yin","doi":"10.1109/INCoS.2016.54","DOIUrl":"https://doi.org/10.1109/INCoS.2016.54","url":null,"abstract":"At present, the issue of intrusion detection must be a hot point to all over the computer security area. In this paper, two novel intrusion detection techniques have been proposed. First, unlike the current existent detection methods, this paper combines the theories of both intuitionistic fuzzy sets (IFS) and artificial neural networks (ANN) together, which lead to much fewer iteration numbers, higher detection rates and sufficient stability. Experimental results show that the first method proposed in this paper is promising and has obvious superiorities over other current typical ones. Then we address another novel technique based on non-subsampled Shearlet transform (NSST) domain artificial neural networks (ANN) to solve those problems, including employing multi-scale geometry analysis (MGA) of NSST and the train characteristics of ANN together. Experimental results indicate that, compared with other existing conventional intrusion detection tools, the second proposed method is superior to other current popular ones in both aspects of iteration numbers and convergence rates. Therefore, the anomaly detection process is performed through processing the signals representing the metrics. Experimental results indicate that the third proposed technique is effective and promising.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115054200","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}
The need for a safe and economically efficient traffic represents a challenge for creating traffic management systems. This paper deals with merging three basic concepts, namely cloud-based technologies, agent-based approaches and fuzzy cognitive maps to solve the localisation and path planing for several vehicles of different types in the form of independent agents, which communicate with a supervisory system located on the cloud. The proposed system was directly tested on a playground and obtained results were analysed using several selected criteria. Finally, some further possibilities of potential utilization and future research are mentioned.
{"title":"Agent-Based Cloud Computing Systems for Traffic Management","authors":"J. Vaščák, Jakub Hvizdo, Michal Puheim","doi":"10.1109/INCoS.2016.80","DOIUrl":"https://doi.org/10.1109/INCoS.2016.80","url":null,"abstract":"The need for a safe and economically efficient traffic represents a challenge for creating traffic management systems. This paper deals with merging three basic concepts, namely cloud-based technologies, agent-based approaches and fuzzy cognitive maps to solve the localisation and path planing for several vehicles of different types in the form of independent agents, which communicate with a supervisory system located on the cloud. The proposed system was directly tested on a playground and obtained results were analysed using several selected criteria. Finally, some further possibilities of potential utilization and future research are mentioned.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115562066","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}
Michal Pluhacek, R. Šenkeřík, Adam Viktorin, I. Zelinka
In this paper we discuss the possibility of generating complex networks by multi-swarm Particle Swarm Optimization algorithm. A methodology is proposed and visualizations of created networks are presented. Also we discuss the future possibility of employing advanced complex network analysis to improve the performance of the multi-swarm PSO.
{"title":"Creating Complex Networks Using Multi-swarm PSO","authors":"Michal Pluhacek, R. Šenkeřík, Adam Viktorin, I. Zelinka","doi":"10.1109/INCoS.2016.86","DOIUrl":"https://doi.org/10.1109/INCoS.2016.86","url":null,"abstract":"In this paper we discuss the possibility of generating complex networks by multi-swarm Particle Swarm Optimization algorithm. A methodology is proposed and visualizations of created networks are presented. Also we discuss the future possibility of employing advanced complex network analysis to improve the performance of the multi-swarm PSO.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129956260","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}
Morteza Saberi, Anne Karduck, O. Hussain, Elizabeth Chang
The pulse of today's business processes, competition and technology can be well observed in the increasingly available information companies are confronted with. Particularly, the importance of information leads to big data which makes it even more difficult for companies to manage their information and costumers. Contact centers (CCs) as the main touch point of organizations face the major issues in managing their costumer efficiently. This paper will focus on the role of big data in empowering the current contact centers to shift to the next generation of CCs. Based on the current literature on CCs, four gaps are identified that by addressing them can be the first step in this shift.
{"title":"Challenges in Efficient Customer Recognition in Contact Centre: State-of-the-Art Survey by Focusing on Big Data Techniques Applicability","authors":"Morteza Saberi, Anne Karduck, O. Hussain, Elizabeth Chang","doi":"10.1109/INCoS.2016.136","DOIUrl":"https://doi.org/10.1109/INCoS.2016.136","url":null,"abstract":"The pulse of today's business processes, competition and technology can be well observed in the increasingly available information companies are confronted with. Particularly, the importance of information leads to big data which makes it even more difficult for companies to manage their information and costumers. Contact centers (CCs) as the main touch point of organizations face the major issues in managing their costumer efficiently. This paper will focus on the role of big data in empowering the current contact centers to shift to the next generation of CCs. Based on the current literature on CCs, four gaps are identified that by addressing them can be the first step in this shift.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129912028","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}
A novel version of multi-class classification method based on fruit fly optimization algorithm (FOA) and relevance vector machine (RVM) is proposed. The one-against-one-against-rest (OAOAR) classification model based on the traditional one-against-one (OAO) and one-against-rest (OAR) algorithm is aimed at combining the advantages of them and translates the multi-class classification problem into multiple three-classification problems to accelerate the running speed with high classification precision. With RVM applied as the binary classifier, the optimal parameter values of RVM kernel function are determined by FOA. Theoretical analysis and computational comparisons on publicly available datasets both indicate that the proposed approach outperforms in terms of diagnosis accuracy and running time with more model sparsity and higher diagnosis efficiency.
{"title":"A Novel Multi-class Classification Approach Based on Fruit Fly Optimization Algorithm and Relevance Vector Machine","authors":"Jianshe Kang, Kun Wu, Kuo Chi, Xu An Wang","doi":"10.1109/INCoS.2016.67","DOIUrl":"https://doi.org/10.1109/INCoS.2016.67","url":null,"abstract":"A novel version of multi-class classification method based on fruit fly optimization algorithm (FOA) and relevance vector machine (RVM) is proposed. The one-against-one-against-rest (OAOAR) classification model based on the traditional one-against-one (OAO) and one-against-rest (OAR) algorithm is aimed at combining the advantages of them and translates the multi-class classification problem into multiple three-classification problems to accelerate the running speed with high classification precision. With RVM applied as the binary classifier, the optimal parameter values of RVM kernel function are determined by FOA. Theoretical analysis and computational comparisons on publicly available datasets both indicate that the proposed approach outperforms in terms of diagnosis accuracy and running time with more model sparsity and higher diagnosis efficiency.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126355292","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}
This research work presents the use of Latent Dirchlet Allocation (LDA), a generative topic modeling technique to extract latent patterns in Chinese Traditional Medical (CTM) diagnose and treatment data. It can help to capture the relationship between symptom and diseases. The purpose of the research is to acquire proficient medical knowledge by computer which can aid doctors to determine diagnosis. Our work proposed the framework which utilizes LDA to discoicvery latent patterns in the symptoms of medical cases and set up computer-aided diagnosis system in TCM.
{"title":"Using Topic Model for Intelligent Computer-Aided Diagnosis in Traditional Chinese Medicine","authors":"Jialin Ma, Yongjun Zhang","doi":"10.1109/INCoS.2016.46","DOIUrl":"https://doi.org/10.1109/INCoS.2016.46","url":null,"abstract":"This research work presents the use of Latent Dirchlet Allocation (LDA), a generative topic modeling technique to extract latent patterns in Chinese Traditional Medical (CTM) diagnose and treatment data. It can help to capture the relationship between symptom and diseases. The purpose of the research is to acquire proficient medical knowledge by computer which can aid doctors to determine diagnosis. Our work proposed the framework which utilizes LDA to discoicvery latent patterns in the symptoms of medical cases and set up computer-aided diagnosis system in TCM.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134265505","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}
Ability to explore unknown environments and ability to successfully navigate in these environments are two key abilities of any truly autonomous mobile robot. In this article, an efficient implementation of mapping and navigation using only RGBD cameras is presented. The map created by Visual SLAM techniques is converted into Octree structure, and successful A* Navigation between two points in 3D is performed. The created mapping system is able to operate in real-time even on small mobile robot and can be easily extended with new state-of-the art techniques. Proposed way of octree encoding, due to its minimum storage requirements, enables efficient distribution of map between multiple robots over the network. Presented path-planning method with its optimizations runs in sufficient time even in higher resolution maps.
{"title":"Using Octree Maps and RGBD Cameras to Perform Mapping and A* Navigation","authors":"Peter Beno, V. Pavelka, F. Duchoň, Martin Dekan","doi":"10.1109/INCoS.2016.107","DOIUrl":"https://doi.org/10.1109/INCoS.2016.107","url":null,"abstract":"Ability to explore unknown environments and ability to successfully navigate in these environments are two key abilities of any truly autonomous mobile robot. In this article, an efficient implementation of mapping and navigation using only RGBD cameras is presented. The map created by Visual SLAM techniques is converted into Octree structure, and successful A* Navigation between two points in 3D is performed. The created mapping system is able to operate in real-time even on small mobile robot and can be easily extended with new state-of-the art techniques. Proposed way of octree encoding, due to its minimum storage requirements, enables efficient distribution of map between multiple robots over the network. Presented path-planning method with its optimizations runs in sufficient time even in higher resolution maps.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131421805","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
扫码关注我们
求助内容：
应助结果提醒方式：