Pub Date : 2015-02-26DOI: 10.1109/RIVF.2015.7049884
Hieu Pham Quang, N. Ly
RGB-D cameras offer both color and depth images of the surrounding environment, making them an attractive option for robot sensor. In this work, we present an RGB-D SLAM system using the Microsoft Kinect. The proposed system is a full 6DoF (Degrees of Freedom) SLAM system which can estimate camera trajectory and reconstruct a 3D model of the environment in real-time. Unlike traditional filtering-based approaches, our system optimizes the entire trajectory by the use of graph optimization. We achieve better accuracy than a previous system by employing key-frame matching instead of frame-to-frame matching. We evaluate our system on a published dataset. The results demonstrate that our system can handle unrestricted camera movements in indoor settings.
{"title":"Some improvements in the RGB-D SLAM system","authors":"Hieu Pham Quang, N. Ly","doi":"10.1109/RIVF.2015.7049884","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049884","url":null,"abstract":"RGB-D cameras offer both color and depth images of the surrounding environment, making them an attractive option for robot sensor. In this work, we present an RGB-D SLAM system using the Microsoft Kinect. The proposed system is a full 6DoF (Degrees of Freedom) SLAM system which can estimate camera trajectory and reconstruct a 3D model of the environment in real-time. Unlike traditional filtering-based approaches, our system optimizes the entire trajectory by the use of graph optimization. We achieve better accuracy than a previous system by employing key-frame matching instead of frame-to-frame matching. We evaluate our system on a published dataset. The results demonstrate that our system can handle unrestricted camera movements in indoor settings.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121254087","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049873
Pegah Alizadeh, Y. Chevaleyre, Jean-Daniel Zucker
Consider a decision support system (DSS) designed to find optimal strategies in stochastic environments, on behalf of a user. To perform this computation, the DSS will need a precise model of the environment. Of course, when the environment can be modeled as a Markov decision process (MDP) with numerical rewards (or numerical penalties), the DSS can compute the optimal strategy in polynomial time. But in many real-world cases, rewards are unknown. To compensate this missing information, the DSS may query the user for its preferences among some alternative policies. Based on the user's answers, the DSS can step-by-step compute the user's preferred policy. In this work, we describe a computational method based on minimax regret to find optimal policy when rewards are unknown. Then we present types of queries on feasible set of rewards by using preference elicitation approaches. When user answers these queries based on her preferences, we will have more information about rewards which will result in more desirable policies.
{"title":"Approximate regret based elicitation in Markov decision process","authors":"Pegah Alizadeh, Y. Chevaleyre, Jean-Daniel Zucker","doi":"10.1109/RIVF.2015.7049873","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049873","url":null,"abstract":"Consider a decision support system (DSS) designed to find optimal strategies in stochastic environments, on behalf of a user. To perform this computation, the DSS will need a precise model of the environment. Of course, when the environment can be modeled as a Markov decision process (MDP) with numerical rewards (or numerical penalties), the DSS can compute the optimal strategy in polynomial time. But in many real-world cases, rewards are unknown. To compensate this missing information, the DSS may query the user for its preferences among some alternative policies. Based on the user's answers, the DSS can step-by-step compute the user's preferred policy. In this work, we describe a computational method based on minimax regret to find optimal policy when rewards are unknown. Then we present types of queries on feasible set of rewards by using preference elicitation approaches. When user answers these queries based on her preferences, we will have more information about rewards which will result in more desirable policies.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"753 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122977802","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049869
Quoc Bao Nguyen, T. Vu, C. Luong
In this paper, a method based on deep learning is applied to improve acoustic model for English Automatic Speech Recognition (ASR) system using two main approaches of deep neural network (Hybrid and bottleneck feature). Deep neural networks systems are able to achieve significant improvements over a number of last year system. The experiments are carried out on the dataset containing speeches on Technology, Entertainment, and Design (TED) Talks. The results show that applying Deep neural network decrease the relative error rate by 33% compared to the MFCC baseline system.
{"title":"Improving acoustic model for English ASR System using deep neural network","authors":"Quoc Bao Nguyen, T. Vu, C. Luong","doi":"10.1109/RIVF.2015.7049869","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049869","url":null,"abstract":"In this paper, a method based on deep learning is applied to improve acoustic model for English Automatic Speech Recognition (ASR) system using two main approaches of deep neural network (Hybrid and bottleneck feature). Deep neural networks systems are able to achieve significant improvements over a number of last year system. The experiments are carried out on the dataset containing speeches on Technology, Entertainment, and Design (TED) Talks. The results show that applying Deep neural network decrease the relative error rate by 33% compared to the MFCC baseline system.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124126432","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049895
T. Huynh, Anh-Vu Dinh-Duc, C. Tran, T. Le
In this paper, we propose a Balanced PSOGSA algorithm by combining the ability for social thinking in Particle Swarm Optimization with the local search capability of Gravitational Search Algorithm for reducing the probability of trapping in local optimum and prolonging time period before the death of the first node in wireless sensor network. Besides, we also improve the objective function to shorten the convergence time of the algorithm. The simulation results show that our proposed protocol has lower energy consumption and longer lifetime compared to other protocols.
{"title":"Balance Particle Swarm Optimization and gravitational search algorithm for energy efficient in heterogeneous wireless sensor networks","authors":"T. Huynh, Anh-Vu Dinh-Duc, C. Tran, T. Le","doi":"10.1109/RIVF.2015.7049895","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049895","url":null,"abstract":"In this paper, we propose a Balanced PSOGSA algorithm by combining the ability for social thinking in Particle Swarm Optimization with the local search capability of Gravitational Search Algorithm for reducing the probability of trapping in local optimum and prolonging time period before the death of the first node in wireless sensor network. Besides, we also improve the objective function to shorten the convergence time of the algorithm. The simulation results show that our proposed protocol has lower energy consumption and longer lifetime compared to other protocols.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131947237","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049881
Thi Duyen Ngo, T. D. Bui
Conversational agents are receiving significant attention from multi-agent and human computer interaction research societies. Many techniques have been developed to enable these agents to behave in a human-like manner. In order to do so, they are simulated with similar communicative channels as humans. Moreover, they are also simulated with emotion and personality. In this work, we focus on issue of expressing emotions for embodied-agents. We present a three dimensional face with ability to speak emotional Vietnamese speech and naturally express emotions while talking. Our face can represent lip movements during emotionally pronouncing Vietnamese words, and at the same time it can show emotional facial expressions while speaking. The face's architecture consists of three parts: Vietnamese Emotional Speech Synthesis module, Emotions to Facial Expressions module, and Combination module which creates lip movements when pronouncing Vietnamese emotional speech and combines these movements with emotional facial expressions. We have tested the face in the football supporter domain in order to confirm its naturalness. The face is simulated as the face of a football supporter agent which experiences emotions and expresses emotional expressions in his voice as well as on his face.
{"title":"A Vietnamese 3D taking face for embodied conversational agents","authors":"Thi Duyen Ngo, T. D. Bui","doi":"10.1109/RIVF.2015.7049881","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049881","url":null,"abstract":"Conversational agents are receiving significant attention from multi-agent and human computer interaction research societies. Many techniques have been developed to enable these agents to behave in a human-like manner. In order to do so, they are simulated with similar communicative channels as humans. Moreover, they are also simulated with emotion and personality. In this work, we focus on issue of expressing emotions for embodied-agents. We present a three dimensional face with ability to speak emotional Vietnamese speech and naturally express emotions while talking. Our face can represent lip movements during emotionally pronouncing Vietnamese words, and at the same time it can show emotional facial expressions while speaking. The face's architecture consists of three parts: Vietnamese Emotional Speech Synthesis module, Emotions to Facial Expressions module, and Combination module which creates lip movements when pronouncing Vietnamese emotional speech and combines these movements with emotional facial expressions. We have tested the face in the football supporter domain in order to confirm its naturalness. The face is simulated as the face of a football supporter agent which experiences emotions and expresses emotional expressions in his voice as well as on his face.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121705843","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049877
T. K. Huynh, K. V. Huynh, T. Le-Tien, Sy C. Nguyen
The paper presents a survey on Image Forgery Detection (IFD) techniques applied for both Copy-Move and spliced images. The survey attempts to cover involved algorithms over past ten years, classify them in groups having the similar methods to solve problems. For the Copy-Move images, the classification depends on differences in processing input images with or without transformation before extracting the image features. For the spliced images, groups of detection techniques based on image features or camera features are summarized. Achievements, limitations and future works from these techniques are also mentioned in this title as orientations and references for the coming researches as well.
{"title":"A survey on Image Forgery Detection techniques","authors":"T. K. Huynh, K. V. Huynh, T. Le-Tien, Sy C. Nguyen","doi":"10.1109/RIVF.2015.7049877","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049877","url":null,"abstract":"The paper presents a survey on Image Forgery Detection (IFD) techniques applied for both Copy-Move and spliced images. The survey attempts to cover involved algorithms over past ten years, classify them in groups having the similar methods to solve problems. For the Copy-Move images, the classification depends on differences in processing input images with or without transformation before extracting the image features. For the spliced images, groups of detection techniques based on image features or camera features are summarized. Achievements, limitations and future works from these techniques are also mentioned in this title as orientations and references for the coming researches as well.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125094012","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049875
Minh-Duc Le, Minh H. Nhat Nguyen, C. Baril, V. Gascon, T. Dinh
This paper studies meta-heuristic methods in solving an appointment-scheduling problem in a hospital in Canada. Our paper proposes a two-step algorithm: The first step creates an initial solution with a Greedy Algorithm considering many strategies. The second step consists in choosing the best strategy and improving it with Tabu Search. Our algorithm performed well for the appointment-scheduling problem. The data used was collected from a hematology-oncology department in a hospital. It includes information about patients, nurses, treatments and fixed appointments. Patients must be assigned to nurses with specific treatment seats. We focus on 3 main objectives: maximize the number of patients scheduled over a planning horizon, minimize overtime and provide a more balanced workload between nurses. Our algorithm succeeds in scheduling more patients over a planning horizon without overtime and with a better balanced workload between nurses.
{"title":"Heuristics to solve appointment scheduling in chemotherapy","authors":"Minh-Duc Le, Minh H. Nhat Nguyen, C. Baril, V. Gascon, T. Dinh","doi":"10.1109/RIVF.2015.7049875","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049875","url":null,"abstract":"This paper studies meta-heuristic methods in solving an appointment-scheduling problem in a hospital in Canada. Our paper proposes a two-step algorithm: The first step creates an initial solution with a Greedy Algorithm considering many strategies. The second step consists in choosing the best strategy and improving it with Tabu Search. Our algorithm performed well for the appointment-scheduling problem. The data used was collected from a hematology-oncology department in a hospital. It includes information about patients, nurses, treatments and fixed appointments. Patients must be assigned to nurses with specific treatment seats. We focus on 3 main objectives: maximize the number of patients scheduled over a planning horizon, minimize overtime and provide a more balanced workload between nurses. Our algorithm succeeds in scheduling more patients over a planning horizon without overtime and with a better balanced workload between nurses.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127317754","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049892
H. Le, Hung Phuoc Truong, Hoang Thien Van, T. Le
Kerberos is a well-known network authentication protocol that allows nodes to communicate over a non-secure network connection. After Kerberos is used to prove the identity of objects in client-server model, it will encrypt all of their communications in following steps to assure privacy and data integrity. In this paper, we modify the initial authentication exchange in Kerberos 5 by using biometric data and asymmetric cryptography. This proposed method creates a new preauthentication protocol in order to make Kerberos 5 more secure. Due to the proposed method, the limitation of password-based authentication in Kerberos 5 is solved. It is too difficult for a user to repudiate having accessed to the application. Moreover, the mechanism of user authentication is more convenient. This method is a strong authentication scheme that is against several attacks.
{"title":"A new pre-authentication protocol in Kerberos 5: biometric authentication","authors":"H. Le, Hung Phuoc Truong, Hoang Thien Van, T. Le","doi":"10.1109/RIVF.2015.7049892","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049892","url":null,"abstract":"Kerberos is a well-known network authentication protocol that allows nodes to communicate over a non-secure network connection. After Kerberos is used to prove the identity of objects in client-server model, it will encrypt all of their communications in following steps to assure privacy and data integrity. In this paper, we modify the initial authentication exchange in Kerberos 5 by using biometric data and asymmetric cryptography. This proposed method creates a new preauthentication protocol in order to make Kerberos 5 more secure. Due to the proposed method, the limitation of password-based authentication in Kerberos 5 is solved. It is too difficult for a user to repudiate having accessed to the application. Moreover, the mechanism of user authentication is more convenient. This method is a strong authentication scheme that is against several attacks.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127831785","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049890
Truong-Thang Nguyen, Manh-Dong Tran
Software cost can be reduced if more software defects are detected earlier in the development phase. Motivated by the Extended Static Checking (ESC) technique, many programming errors have been discovered by ESC tools. In a typical ESC procedure, the source code of a program written in a high-level programming language, e.g. Java [1] or C#, Spec# [2], is translated into some logical imperative-style language, resp. Guarded Commands [1] or BoogiePL [2]. At the same time, associated annotated specifications which state constraints of the program are also translated into the same logical language. This two-fold translation phase induces code-interleaving phenomenon of annotated specification and program. The subsequent phases in ESC relies on the interleaving codes while there is a possibility that logical imperative codes translated from annotated specification may change behavior of the original program. This paper proposes a formal analysis approach of possible interaction between specification and program codes. It does not only show the range of specification categories which are safe in this ESC procedure, but also presents cases for potential ESC unsoundness.
{"title":"Interaction analysis of annotated specification and program codes in Extended Static Checking","authors":"Truong-Thang Nguyen, Manh-Dong Tran","doi":"10.1109/RIVF.2015.7049890","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049890","url":null,"abstract":"Software cost can be reduced if more software defects are detected earlier in the development phase. Motivated by the Extended Static Checking (ESC) technique, many programming errors have been discovered by ESC tools. In a typical ESC procedure, the source code of a program written in a high-level programming language, e.g. Java [1] or C#, Spec# [2], is translated into some logical imperative-style language, resp. Guarded Commands [1] or BoogiePL [2]. At the same time, associated annotated specifications which state constraints of the program are also translated into the same logical language. This two-fold translation phase induces code-interleaving phenomenon of annotated specification and program. The subsequent phases in ESC relies on the interleaving codes while there is a possibility that logical imperative codes translated from annotated specification may change behavior of the original program. This paper proposes a formal analysis approach of possible interaction between specification and program codes. It does not only show the range of specification categories which are safe in this ESC procedure, but also presents cases for potential ESC unsoundness.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594073","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049899
J. Montavont, Cosmin Cobarzan, Thomas Noël
Low-power and Lossy Wireless Networks (LLN) is a crucial enabling technology for a broad range of applications that will touch everybody's life and be driving forces for new businesses. Example of the rapidly emerging application domains are the Internet of Things, Smart Cities and Smart Homes. Recently, there is strong effort to provide LLN with IP connectivity. Supporting IP provides interoperability with existing IP devices and infrastructure together with the access to a large panel of tools for diagnostic, management and commissioning. However, enabling such solutions on LLN requires to optimize the IP communication stack. Among the features introduced by IP, the stateless address autoconfiguration is of particular importance as the success of IP is largely because of its ability to connect together networks of different sizes and types. In this article, we propose a complete evaluation of the stateless address autoconfiguration in LLN. Our theoretical analysis is based on neighbor discovery optimizations especially designed for LLN.
{"title":"Theoretical analysis of IPv6 stateless address autoconfiguration in Low-power and Lossy Wireless Networks","authors":"J. Montavont, Cosmin Cobarzan, Thomas Noël","doi":"10.1109/RIVF.2015.7049899","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049899","url":null,"abstract":"Low-power and Lossy Wireless Networks (LLN) is a crucial enabling technology for a broad range of applications that will touch everybody's life and be driving forces for new businesses. Example of the rapidly emerging application domains are the Internet of Things, Smart Cities and Smart Homes. Recently, there is strong effort to provide LLN with IP connectivity. Supporting IP provides interoperability with existing IP devices and infrastructure together with the access to a large panel of tools for diagnostic, management and commissioning. However, enabling such solutions on LLN requires to optimize the IP communication stack. Among the features introduced by IP, the stateless address autoconfiguration is of particular importance as the success of IP is largely because of its ability to connect together networks of different sizes and types. In this article, we propose a complete evaluation of the stateless address autoconfiguration in LLN. Our theoretical analysis is based on neighbor discovery optimizations especially designed for LLN.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128312247","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
扫码关注我们
求助内容：
应助结果提醒方式：