Pub Date : 2018-05-01DOI: 10.4018/978-1-5225-6023-4.CH015
Shafquat Hussain, Ginige Athula
Chatbots or conversational agents are computer programs, which interact with users using natural language through artificial intelligence in a way that the user thinks he is having dialogue with a human. One of the main limit of a chatbot technology is associated to the construction of its local knowledge base. A conventional chatbot knowledge base is typically hand constructed, which is a very time-consuming process and may take years to train a chatbot in a particular field of expertise. This work presented in this paper extends the knowledge base of a conventional chatbot beyond its local knowledge base to external knowledge source Wikipedia. This has been achieved by using Media Wiki API to retrieve information from Wikipedia when the chatbot's local knowledge base does not contain the answer to user query. To make the conversation with chatbot more meaningful with regards to the user's previous chat sessions, a user specific session ability has been added to the chatbot architecture. An open source AIML web based chatbot has been modified and programmed for the use in health informatics domain. The chatbot has been named VDMS - Virtual Diabetes Management System. It is intended to be used by the general community and diabetic patients for diabetes education and management.
聊天机器人或会话代理是计算机程序，它们通过人工智能使用自然语言与用户进行交互，使用户认为他正在与人类进行对话。聊天机器人技术的一个主要限制是其局部知识库的构建。传统的聊天机器人知识库通常是手工构建的，这是一个非常耗时的过程，在特定的专业领域训练聊天机器人可能需要数年时间。本文提出的工作将传统聊天机器人的知识库从其本地知识库扩展到外部知识来源维基百科。这是通过使用Media Wiki API在聊天机器人的本地知识库不包含用户查询的答案时从Wikipedia检索信息来实现的。为了使与聊天机器人的对话相对于用户以前的聊天会话更有意义，聊天机器人架构中添加了特定于用户的会话能力。一个开源的基于AIML网络的聊天机器人已被修改和编程用于卫生信息学领域。这个聊天机器人被命名为VDMS——虚拟糖尿病管理系统。旨在供广大社区和糖尿病患者进行糖尿病教育和管理。
{"title":"Extending a Conventional Chatbot Knowledge Base to External Knowledge Source and Introducing User Based Sessions for Diabetes Education","authors":"Shafquat Hussain, Ginige Athula","doi":"10.4018/978-1-5225-6023-4.CH015","DOIUrl":"https://doi.org/10.4018/978-1-5225-6023-4.CH015","url":null,"abstract":"Chatbots or conversational agents are computer programs, which interact with users using natural language through artificial intelligence in a way that the user thinks he is having dialogue with a human. One of the main limit of a chatbot technology is associated to the construction of its local knowledge base. A conventional chatbot knowledge base is typically hand constructed, which is a very time-consuming process and may take years to train a chatbot in a particular field of expertise. This work presented in this paper extends the knowledge base of a conventional chatbot beyond its local knowledge base to external knowledge source Wikipedia. This has been achieved by using Media Wiki API to retrieve information from Wikipedia when the chatbot's local knowledge base does not contain the answer to user query. To make the conversation with chatbot more meaningful with regards to the user's previous chat sessions, a user specific session ability has been added to the chatbot architecture. An open source AIML web based chatbot has been modified and programmed for the use in health informatics domain. The chatbot has been named VDMS - Virtual Diabetes Management System. It is intended to be used by the general community and diabetic patients for diabetes education and management.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130946488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00110
G. Aloi, G. Fortino, Raffaele Gravina, P. Pace, Giuseppe Caliciuri
Edge computing paradigm has attracted many interests in the last few years as a valid alternative to the standard Cloud-based approaches to reduce the huge amount of data coming from IoT devices toward the Internet. In this direction, the paper proposes BodyEdge, a novel architecture well suited for medical applications in the context of the emerging healthcare industry. The advantages of the designed software platform have been evaluated in terms of reduced bandwidth and processing time through a real testbed on different hardware platforms. The conducted study also discovered the network conditions (data load and processing delay) in which BodyEdge is a valid and inexpensive solution for healthcare application scenarios.
{"title":"Edge Computing-Enabled Body Area Networks","authors":"G. Aloi, G. Fortino, Raffaele Gravina, P. Pace, Giuseppe Caliciuri","doi":"10.1109/WAINA.2018.00110","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00110","url":null,"abstract":"Edge computing paradigm has attracted many interests in the last few years as a valid alternative to the standard Cloud-based approaches to reduce the huge amount of data coming from IoT devices toward the Internet. In this direction, the paper proposes BodyEdge, a novel architecture well suited for medical applications in the context of the emerging healthcare industry. The advantages of the designed software platform have been evaluated in terms of reduced bandwidth and processing time through a real testbed on different hardware platforms. The conducted study also discovered the network conditions (data load and processing delay) in which BodyEdge is a valid and inexpensive solution for healthcare application scenarios.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126492438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00146
Gianluca Fimiani
Healthcare is traditionally a data-intensive domain, where physicians needs complete and updated anamnesis of their patients to take the best medical decisions. Dematerialization of the medical documents and the consequent health information systems to share electronic health records among healthcare providers are paving the way to an effective solution to this issue. However, they are also paving the way of non-negligible privacy issues that are limiting the full application of these technologies. Encryption is a valuable means to resolve such issues, however the current schemes are not able to cope with all the needs and challenges that the cloud-based sharing of electronic health records imposes. In this work we have investigated the use of a novel scheme where encryption is combined with biometric authentication, and defines a preliminary solution.
{"title":"Supporting Privacy in a Cloud-Based Health Information System by Means of Fuzzy Conditional Identity-Based Proxy Re-encryption (FCI-PRE)","authors":"Gianluca Fimiani","doi":"10.1109/WAINA.2018.00146","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00146","url":null,"abstract":"Healthcare is traditionally a data-intensive domain, where physicians needs complete and updated anamnesis of their patients to take the best medical decisions. Dematerialization of the medical documents and the consequent health information systems to share electronic health records among healthcare providers are paving the way to an effective solution to this issue. However, they are also paving the way of non-negligible privacy issues that are limiting the full application of these technologies. Encryption is a valuable means to resolve such issues, however the current schemes are not able to cope with all the needs and challenges that the cloud-based sharing of electronic health records imposes. In this work we have investigated the use of a novel scheme where encryption is combined with biometric authentication, and defines a preliminary solution.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"42 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114136003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00058
Hana Mejdi, O. Kallel, S. Hasnaoui
The specification and description language is widely used at the design stage to describe the behavior of reactive and distributed systems. The language is intended for the specification of complex, eventdriven, real time and interactive applications. This paper represents a method for validation of a specification and description language diagrams. The method consists of translating the diagram into coloured Petri nets. It is composed of three main stages: explaining the rules, applying them and finally verifying and discussing the results.
{"title":"Rules to Transform Specific Description Language Diagram Into Coloured Petri Nets","authors":"Hana Mejdi, O. Kallel, S. Hasnaoui","doi":"10.1109/WAINA.2018.00058","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00058","url":null,"abstract":"The specification and description language is widely used at the design stage to describe the behavior of reactive and distributed systems. The language is intended for the specification of complex, eventdriven, real time and interactive applications. This paper represents a method for validation of a specification and description language diagrams. The method consists of translating the diagram into coloured Petri nets. It is composed of three main stages: explaining the rules, applying them and finally verifying and discussing the results.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128036866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00140
E. Ogawa, Shigenari Nakamura, T. Enokido, M. Takizawa
In wireless ad-hoc networks, messages have to be energy-efficiently exchanged among neighboring nodes. In our previous studies, the reactive type EAO (Energy-Aware One-to-one routing) and LEU (Low-Energy Unicast Ad-hoc routing) protocols are proposed to unicast messages to the destination node. In the EAO protocol, the total electric energy of nodes and delay time from a source node to a destination node can be reduced compared with the ESU and AODV protocols. However, a source-to-destination route may not be found if the communication range of each node is shorter. In this paper, we newly proposed an IEAO (Improved Energy-Aware One-to-one routing) protocol to overcome the difficulties of the EAO protocol. Here, after a shortest route is found to the destination node, a more energy-efficient prior node is found in nearest neighbor of each node starting from the destination node. In this paper, a neighbor node which has an uncovered neighbor node is selected as a prior node for each node to make a route. In the evaluation, we show the number of nodes in a source-to-destination route can be reduced and a route can be found even in shorter communication range in the IEAO protocol compared with the LEU and EAO protocols.
{"title":"Unicast Routing Protocols to Reduce Electric Energy Consumption in Wireless Ad-Hoc Networks","authors":"E. Ogawa, Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.1109/WAINA.2018.00140","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00140","url":null,"abstract":"In wireless ad-hoc networks, messages have to be energy-efficiently exchanged among neighboring nodes. In our previous studies, the reactive type EAO (Energy-Aware One-to-one routing) and LEU (Low-Energy Unicast Ad-hoc routing) protocols are proposed to unicast messages to the destination node. In the EAO protocol, the total electric energy of nodes and delay time from a source node to a destination node can be reduced compared with the ESU and AODV protocols. However, a source-to-destination route may not be found if the communication range of each node is shorter. In this paper, we newly proposed an IEAO (Improved Energy-Aware One-to-one routing) protocol to overcome the difficulties of the EAO protocol. Here, after a shortest route is found to the destination node, a more energy-efficient prior node is found in nearest neighbor of each node starting from the destination node. In this paper, a neighbor node which has an uncovered neighbor node is selected as a prior node for each node to make a route. In the evaluation, we show the number of nodes in a source-to-destination route can be reduced and a route can be found even in shorter communication range in the IEAO protocol compared with the LEU and EAO protocols.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114286805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00118
Cesare Bandirali, Stefano Lodi, G. Moro, A. Pagliarani, Claudio Sartori
In the age of Big Data, scalable algorithm implementations as well as powerful computational resources are required. For data mining and data analytics the support of big data platforms is becoming increasingly important, since they provide algorithm implementations with all the resources needed for their execution. However, choosing the best platform might depend on several constraints, including but not limited to computational resources, storage resources, target tasks, service costs. Sometimes it may be necessary to switch from one platform to another depending on the constraints. As a consequence, it is desirable to reuse as much algorithm code as possible, so as to simplify the setup in new target platforms. Unfortunately each big data platform has its own peculiarity, especially to deal with parallelism. This impacts on algorithm implementation, which generally needs to be modified before being executed. This work introduces functional parallel primitives to define the parallelizable parts of algorithms in a uniform way, independent of the target platform. Primitives are then transformed by a compiler into skeletons, which are finally deployed on vendor-dependent frameworks. The procedure proposed aids not only in terms of code reuse but also in terms of parallelization, because programmer's expertise is not demanded. Indeed, it is the compiler that entirely manages and optimizes algorithm parallelization. The experiments performed show that the transformation process does not negatively affect algorithm performance.
{"title":"Parallel Primitives for Vendor-Agnostic Implementation of Big Data Mining Algorithms","authors":"Cesare Bandirali, Stefano Lodi, G. Moro, A. Pagliarani, Claudio Sartori","doi":"10.1109/WAINA.2018.00118","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00118","url":null,"abstract":"In the age of Big Data, scalable algorithm implementations as well as powerful computational resources are required. For data mining and data analytics the support of big data platforms is becoming increasingly important, since they provide algorithm implementations with all the resources needed for their execution. However, choosing the best platform might depend on several constraints, including but not limited to computational resources, storage resources, target tasks, service costs. Sometimes it may be necessary to switch from one platform to another depending on the constraints. As a consequence, it is desirable to reuse as much algorithm code as possible, so as to simplify the setup in new target platforms. Unfortunately each big data platform has its own peculiarity, especially to deal with parallelism. This impacts on algorithm implementation, which generally needs to be modified before being executed. This work introduces functional parallel primitives to define the parallelizable parts of algorithms in a uniform way, independent of the target platform. Primitives are then transformed by a compiler into skeletons, which are finally deployed on vendor-dependent frameworks. The procedure proposed aids not only in terms of code reuse but also in terms of parallelization, because programmer's expertise is not demanded. Indeed, it is the compiler that entirely manages and optimizes algorithm parallelization. The experiments performed show that the transformation process does not negatively affect algorithm performance.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115901281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00064
Pooyan Habibi, Soroush Baharlooei, M. Farhoudi, Sepehr Kazemian, S. Khorsandi
Cloud Computing provides a distributed Internet based platform for data and application hosting such as Internet of Things (IoT), cloud applications and social applications. Despite increased use of cloud computing, there are serious issues due to inherent problems such as lukewarm reliability, lowgranularity location-awareness, and global view of the network and also dependency on the communication infrastructure for mobility support. Fog computing is a network based computing paradigm that allows essential parts of the computing processes to be moved to a point near the user, and hence emulating a locally provided service improving users quality of experience (QoE) in many dimensions such as response time and availability. The duty of fog networks is to connect each component of the fog architecture seamlessly. However, managing such a complex network, maintaining connectivity and providing on-demand services, particularly in large-scale applications of the Internet of Things (IoT), is so convoluted. Therefore, a new architecture is needed to deal with predicting and maintaining the connectivity graph of network, design distributed SDN system that meet the harsh requirement of fog computing, implement and manage VNFCs through the network, and orchestrate these components together. Hence, an integrated end-to-end SDN/NFV reference architecture by means of orchestration of integrated Cloud, Fog, and network resources has been proposed.
{"title":"Virtualized SDN-Based End-to-End Reference Architecture for Fog Networking","authors":"Pooyan Habibi, Soroush Baharlooei, M. Farhoudi, Sepehr Kazemian, S. Khorsandi","doi":"10.1109/WAINA.2018.00064","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00064","url":null,"abstract":"Cloud Computing provides a distributed Internet based platform for data and application hosting such as Internet of Things (IoT), cloud applications and social applications. Despite increased use of cloud computing, there are serious issues due to inherent problems such as lukewarm reliability, lowgranularity location-awareness, and global view of the network and also dependency on the communication infrastructure for mobility support. Fog computing is a network based computing paradigm that allows essential parts of the computing processes to be moved to a point near the user, and hence emulating a locally provided service improving users quality of experience (QoE) in many dimensions such as response time and availability. The duty of fog networks is to connect each component of the fog architecture seamlessly. However, managing such a complex network, maintaining connectivity and providing on-demand services, particularly in large-scale applications of the Internet of Things (IoT), is so convoluted. Therefore, a new architecture is needed to deal with predicting and maintaining the connectivity graph of network, design distributed SDN system that meet the harsh requirement of fog computing, implement and manage VNFCs through the network, and orchestrate these components together. Hence, an integrated end-to-end SDN/NFV reference architecture by means of orchestration of integrated Cloud, Fog, and network resources has been proposed.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126055350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00102
R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa
Various types and huge number of devices like sensors and actuators are interconnected with clouds of servers in IoT (Internet of Things). Here, a large volume of data including multimedia data like image created by sensors are transmitted to servers in clouds through networks. Processes in servers decide on actions and send the actions to actuators under time constraints like realtime one. However, huge volume of data are transmitted in networks and servers are heavily loaded. An intermediate layer named fog layer is introduced between clouds and devices in IoT to overcome the difficulties. Processing to be done and data to be stored in servers are distributed to fog nodes while centralized on servers in clouds in traditional cloud computing systems. In this paper, we newly propose a linear IoT model to deploy processes and data to devices, fog nodes, and servers in IoT so that the total electric energy consumption of nodes can be reduced. We show the total electric energy of the IoT model is smaller than the cloud model in the evaluation.
{"title":"An Energy-Efficient Model of Fog and Device Nodes in IoT","authors":"R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.1109/WAINA.2018.00102","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00102","url":null,"abstract":"Various types and huge number of devices like sensors and actuators are interconnected with clouds of servers in IoT (Internet of Things). Here, a large volume of data including multimedia data like image created by sensors are transmitted to servers in clouds through networks. Processes in servers decide on actions and send the actions to actuators under time constraints like realtime one. However, huge volume of data are transmitted in networks and servers are heavily loaded. An intermediate layer named fog layer is introduced between clouds and devices in IoT to overcome the difficulties. Processing to be done and data to be stored in servers are distributed to fog nodes while centralized on servers in clouds in traditional cloud computing systems. In this paper, we newly propose a linear IoT model to deploy processes and data to devices, fog nodes, and servers in IoT so that the total electric energy consumption of nodes can be reduced. We show the total electric energy of the IoT model is smaller than the cloud model in the evaluation.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130043317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00067
K. Uchida, L. Barolli
This paper deals with ray tracing in a closed space such as tunnel or underground by using the numerical method based on Dijkstra algorithm (DA). The essence of the method is to modify the DA based proximity matrix in terms of three procedures, that is, path selection, path linearization and line of sight (LOS) check. This method has successively been applied to ray tracing in an open space such as a random rough surface. When we treat a closed space, however, more detailed discussions are required than in the case of an open space, because we must take account of the effects of floor, ceiling and side walls at the same time. In this paper we propose procedures for LOS check to solve this difficult situation. Numerical examples are shown for the traced rays and cost distributions in sinusoidal and cross type tunnels.
{"title":"Dijkstra Algorithm Based Ray Tracing: A Case Study for Tunnel Structures","authors":"K. Uchida, L. Barolli","doi":"10.1109/WAINA.2018.00067","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00067","url":null,"abstract":"This paper deals with ray tracing in a closed space such as tunnel or underground by using the numerical method based on Dijkstra algorithm (DA). The essence of the method is to modify the DA based proximity matrix in terms of three procedures, that is, path selection, path linearization and line of sight (LOS) check. This method has successively been applied to ray tracing in an open space such as a random rough surface. When we treat a closed space, however, more detailed discussions are required than in the case of an open space, because we must take account of the effects of floor, ceiling and side walls at the same time. In this paper we propose procedures for LOS check to solve this difficult situation. Numerical examples are shown for the traced rays and cost distributions in sinusoidal and cross type tunnels.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126583253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00136
Shuo Zhang, S. Wolthusen
Although people use critical, redundant and ordinary categories to concisely distinguish the importance of edges in maintaining controllability of networks in linear time-invariant (LTI) model, a specific network analysis is still uncertain to confirm edges of each category for further edge protection. Given a large, sparse, Erdős-Rényi random digraph with a precomputed maximum matching in LTI model as an input network, we address the problem of efficiently classifying its all edges into those categories. By the minimal input theorem, classifying an edge into one of those categories is modeled into analysing the number of maximum matchings having it, while it is solved by finding maximally-matchable edges via a bipartite graph mapped by the input network. In the worst case, entire edge classification is executed in linear time except for precomputing a maximum matching of the input network.
{"title":"Security-Aware Network Analysis for Network Controllability","authors":"Shuo Zhang, S. Wolthusen","doi":"10.1109/WAINA.2018.00136","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00136","url":null,"abstract":"Although people use critical, redundant and ordinary categories to concisely distinguish the importance of edges in maintaining controllability of networks in linear time-invariant (LTI) model, a specific network analysis is still uncertain to confirm edges of each category for further edge protection. Given a large, sparse, Erdős-Rényi random digraph with a precomputed maximum matching in LTI model as an input network, we address the problem of efficiently classifying its all edges into those categories. By the minimal input theorem, classifying an edge into one of those categories is modeled into analysing the number of maximum matchings having it, while it is solved by finding maximally-matchable edges via a bipartite graph mapped by the input network. In the worst case, entire edge classification is executed in linear time except for precomputing a maximum matching of the input network.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122221041","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
扫码关注我们
求助内容：
应助结果提醒方式：