{"title":"Dynamic, self-organized clusters as a means to supply and demand matching in large-scale energy systems","authors":"Selma Čaušević, M. Warnier, F. Brazier","doi":"10.1109/ICNSC.2017.8000154","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000154","url":null,"abstract":"Centralized management of power systems is becoming more challenging due to the increased introduction of distributed renewable energy resources, along with demand increase and aging infrastructures. To address these challenges, this paper proposes new mechanisms for decentralized energy management. Based on self-organization of consumers, prosumers and producers into virtual groups, called clusters, supply and demand of electricity is locally matched. Distributed multi-agent systems are used as a way to represent virtual cluster members. The mechanisms are illustrated, and static and dynamic virtual clusters are compared. Dynamic reconfiguration is achieved by varying the time periods for which clustering is performed. The proposed clustering mechanisms demonstrate that large-scale centralized energy systems can operate in a decentralized fashion when only local information is available.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122537604","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}
{"title":"Empirical analysis of collaborative filtering-based recommenders in temporally evolving systems","authors":"Xiaoyu Shi, Xin Luo, Mingsheng Shang, Xin-Yi Cai","doi":"10.1109/ICNSC.2017.8000127","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000127","url":null,"abstract":"Recommender systems benefit people's daily lives at every moment. While considerable attentions have been drawn by performance in one-step recommendation and static user-item network, recommenders' performance on temporally evolving networks remains unclear. To address this issue, this paper firstly adopts a bipartite network to describe the online commercial system. We then propose a network evolution method to simulate the mutual feedback between recommender system and its users' decisions in the evolving network with time. To investigate the long-term performance of three state-of-the-art CF-based recommenders, i.e., the user-based collaborative filtering (UCF), item-based collaborative filtering (ICF) and latent factor-based model (LFM), this online network is evolving with time driven by each tested recommender. Besides using root mean squared error (RMSE) to evaluate prediction accuracy of recommender, we also calculate the intra-similarity and popularity to study the performance of recommendation, as well as Gini coefficient to evaluate the health of online network. Experiments on two real datasets, we find that during the temporal evolving process LFM's accuracy loss is less than that of UCF and ICF, besides LFM enjoys a high accuracy in one-step recommendation. Moreover, although LFM proves to be highly accurate and stable during the temporal evolving network, ICF shows a better performance than LFM in terms of recommendation diversity, and it simultaneously benefits the health of online system. Hence, these results provide insights for the design of a next generation of recommender systems, which would tradeoffs between short- and long-term performances.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"212 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114166418","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}
{"title":"Link available time prediction based GPSR for vehicular ad hoc networks","authors":"Haojun Yang, Ming Yu, Xuming Zeng","doi":"10.1109/ICNSC.2017.8000107","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000107","url":null,"abstract":"Vehicle mobile ad-hoc networks (VANETs) are becoming the mainstream of network research in these days. Researches have been carried out from many aspects. However, due to the limitation of the characteristics of VANETs, the implementation in real-world still requires much effort to overcome the shortcomings to guarantee a reliable link and efficient data delivery. In the paper, we present an improved scheme based on the well-known position-based routing protocol greedy perimeter stateless routing (GPSR). Taking the advantages of GPSR, we preserve the core algorithm of GPSR, and then introduce the link available time (LAT) prediction into the next hop selection of GPSR, instead of simply using a greedy forwarding algorithm. LAT prediction is only decided by the measurable variables within a predefined time interval. Next, we establish a matrix based on the LAT and geographic progress to the next hop to decide which node should be the next hop for relaying. Finally, the simulation results are given to demonstrate the improvement in aspects of delay time, package delivery ratio, hop-count, etc.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129362177","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}
{"title":"Multi-dimension and multi-granularity segmentation of remote sensing image based on improved Otsu algorithm","authors":"Dongmei Huang, Jingqi Sun, Shuang Liu, Shoujue Xu, Suling Liang, Cong Li, Zhenhua Wang","doi":"10.1109/ICNSC.2017.8000172","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000172","url":null,"abstract":"An increasing number of unknown islands, an important resource for human development, is identified based on segmentation of remote sensing image. Different from traditional digital image, remote sensing image has significant characteristics, such as multi-band, multi-source, and multi-granularity. Thus, the segmentation theory based on traditional digital image is not suitable for remote sensing image. Here, the segmentation algorithm (Otsu), which is a common method for traditional digital image, was improved in two aspects: (1) Based on PCA and band fusion, the Otsu algorithm with one-dimensional image was extended to multi-dimensional ones; (2) By optimizing the threshold value, the Otsu algorithm for single feature extraction was extended to multi-granularity extraction. Taking the island segmentation from remote sensing image as an example, the improved Otsu algorithm was compared with the traditional Otsu: 1) Through using PCA algorithm, multi-band remote sensing image was reduced to effective 3–4 new bands; 2) Through different threshold settings, the objects in the remote sensing image are divided into different classes; 3) The improved Otsu algorithm reduces the computational complexity, taking the threshold value of 2 as an example, the time efficiency is improved by 42.15%.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020735","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}
Senke Ding, Peifu Xu, Weimin Wu, Yi Yang, Zichao Xing, Feihua Lu, Cheng Li
{"title":"Petri net based software testing scheduling and selecting","authors":"Senke Ding, Peifu Xu, Weimin Wu, Yi Yang, Zichao Xing, Feihua Lu, Cheng Li","doi":"10.1109/ICNSC.2017.8000086","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000086","url":null,"abstract":"Computer software system has a profound impact on human society. It increasingly highlights the importance of software testing. Reducing the cost and improving the efficiency of software testing has an important practical significance and economic value. This paper investigates on software testing workflow from the perspective of discrete event dynamic systems and presents a method to improve the efficiency of software testing by optimizing task scheduling and execution priorities. We developed a simulation program of task scheduling based on Petri net to compare the performance of each scheduling option in different situations and made the analysis of their differences.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123675648","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}
M. Culman, J. Portocarrero, C. Guerrero, C. Bayona, J. L. Torres, C. Farias
{"title":"PalmNET: An open-source wireless sensor network for oil palm plantations","authors":"M. Culman, J. Portocarrero, C. Guerrero, C. Bayona, J. L. Torres, C. Farias","doi":"10.1109/ICNSC.2017.8000190","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000190","url":null,"abstract":"In this paper, a Wireless Sensor Network (WSN) solution is proposed for soil's condition measurement to monitor oil palm plantations (PalmNET) according to agricultural meteorological practices. The PalmNET monitoring system is composed by a WSN used for in-field soil's condition measurement and a web-server interface for data visualization. PalmNET can automatically collect soil moisture data and transmit field data through a ZigBee network to a web-server. The PalmNET proof-of-concept is a WSN built upon open-source hardware and software, which includes two sensor nodes, a sink and a Gateway with a GPRS module. The WSN was deployed in Palmar de la Vizcaína Experimental Field Station having the following proof of concept objectives: (i) collect and centralize soil moisture data and (ii) post data to a web application interface. Results have revealed PalmNET as a feasible, automated and solar powered application for oil palm plantations in Colombia.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121851687","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}
{"title":"Adaptive neuro-fuzzy predictive control for design of adaptive cruise control system","authors":"Yu‐Chen Lin, H. Nguyen, Cheng-Hsien Wang","doi":"10.1109/ICNSC.2017.8000187","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000187","url":null,"abstract":"Proliferation of the number of vehicles is one of the main causes of traffic congestion, accidents, energy waste and environmental pollution. Recently, several intelligent applications are equipped in modern vehicles such as advanced driver assistance systems (ADAS), especially an adaptive cruise control (ACC) system which was successfully implemented on some luxury cars and still remains to be an interesting topic of research. An adaptive neuro-fuzzy predictive control (ANFPC) is proposed in designing of ACC system in this paper. By controlling the ACC vehicle through the throttle force or brakes, the ACC vehicle follows its predecessor and maintains the safe distance with the minimized tracking error. In the ANFPC scheme, a Takagi-Sugeno (T-S) fuzzy model is utilized to approximate the preceding vehicle model and then the predicted state sequence of the preceding vehicle is obtained. More importantly, the predictive control law is derived by a fuzzy neural networks (FNNs) approach. Simulation results demonstrate that the proposed ANFPC can achieve better performance than other methods in terms of safety, comfort and fuel consumption, simultaneously.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"22 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132845978","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}
{"title":"An unsupervised approach in learning load patterns for non-intrusive load monitoring","authors":"Saman Mostafavi, R. Cox","doi":"10.1109/ICNSC.2017.8000164","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000164","url":null,"abstract":"This paper proposes a new novel way for non-intrusive load monitoring. The technique can be applied to develop a powerful framework for low-cost power monitoring in buildings, particularly in the small commercial and residential sector. The method proposes the construction of a data base of prior knowledge about load patterns and it provides a powerful platform which has the capacity to solve one of the major challenges in power monitoring and energy management, which has been the development of robust unsupervised learning algorithms that eliminate the need for costly human involvement. To do so, a proposal is made on the basis of forming Bayesian networks for the load classification problem. The method has shown to be computationally compatible with handling a large data set. Finally, a case is studied for some major loads obtained from a bank building to demonstrate a basic test case in the real world.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130879774","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}
{"title":"A modelling & simulation based engineering approach for socio-cyber-physical systems","authors":"Thuy Nguyen","doi":"10.1109/ICNSC.2017.8000176","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000176","url":null,"abstract":"Today, most large and complex systems such as aircrafts or power grids integrate physical and human aspects with computing and networking, and therefore constitute so-called socio-cyber-physical systems (SCPS). Their engineering, from prospective and conceptual studies (to determine the scope of the system) through design and construction to operation, maintenance and upgrades, necessitates the cooperation and coordination of many teams representing different disciplines and viewpoints. In addition, such systems are subject to many constraints such as tight budget and schedule; high dependability, safety and security; need to innovate; long lifetime; changing and uncertain environments. This paper presents a modelling and simulation (M&S) based engineering approach that can address the challenges of large and complex SCPS, and more generally, of systems of SCPS (SoS). Contrary to “classical” M&S approaches relying on deterministic behavioural models that can be developed only in the final stages of the design process, the proposed approach relies on constraints models that specify envelopes of required or assumed behaviours, and that can be applied at any phase of the system lifecycle. Also, in order to manage complexity and the variety of viewpoints, the approach supports models composition, whereby models from different teams or at different phases of the process can be aggregated (top-down or bottom-up) and verified for consistency.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133492667","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}
Antonios Makris, K. Tserpes, D. Anagnostopoulos, J. Altmann
{"title":"Load balancing for minimizing the average response time of get operations in distributed key-value stores","authors":"Antonios Makris, K. Tserpes, D. Anagnostopoulos, J. Altmann","doi":"10.1109/ICNSC.2017.8000102","DOIUrl":"https://doi.org/10.1109/ICNSC.2017.8000102","url":null,"abstract":"We investigate the impact of an unevenly distributed load among nodes of a distributed key-value store on response times. We find that response times of “get” operations quickly degrade in the presence of power law distributions of load and identify the point, at which the system needs to apply a mitigation approach. The migration technique, which we propose, overcomes the long response times of consistent hashing placement techniques. Our technique is a hybrid approach that combines consistent hashing and a directory for exceptions. Our experimental results show an improvement in the average response times and an equal load among the nodes.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433061","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}