2013 Sixth International Conference on Developments in eSystems Engineering最新文献

M2M Rendezvous Redundancy for the Internet of Things 面向物联网的M2M交会冗余

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DESE.2013.17

Andrew Attwood, O. Abuelma'atti, P. Fergus

{"title":"M2M Rendezvous Redundancy for the Internet of Things","authors":"Andrew Attwood, O. Abuelma'atti, P. Fergus","doi":"10.1109/DESE.2013.17","DOIUrl":"https://doi.org/10.1109/DESE.2013.17","url":null,"abstract":"Machine to Machine communication will play an important role in enabling the Internet of Things. Devices in both home and industrial settings will cooperate to create smart spaces. Devices will communicate with each other autonomously, enabling them to make decisions to reach an optimal environmental goal. The nature of their deployment will involve these devices having to operate under extreme conditions, such as during a fire, flooding or following an explosion. Events such as these would usually cause a reduction in the number of devices that originally constituted the system. Individual device loss might be temporary or permanent. Devices might not be active at the time of failure and may be sleeping due to the low power requirements to extend device longevity. It is important that when devices wake they can obtain the information they require and if a device is destroyed that its last known state is preserved in the system. Preserving the last know state of a device also provides a useful source of information for post failure analysis as well as the continued operation of the system during the event. This paper details our rendezvous state redundancy protocol for the Internet of Things. We then validate the use of position relative topologies when creating distributed hash tables for redundancy in wireless mesh IoT sensor networks. We then provide an evaluation of the keying mechanism used to provide optimal redundancy for given failure patterns.","PeriodicalId":248716,"journal":{"name":"2013 Sixth International Conference on Developments in eSystems Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Towards Lifestyle-Oriented and Personalised E-Services for Elderly Care 迈向以生活方式为本及个人化的长者护理电子服务

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.69

H. Tawfik, Obinna Anya

引用次数: 2

ContextMorph: A Model of Context-Aware Cross-Boundary Decision Support in E-Health ContextMorph:电子医疗环境感知跨界决策支持模型

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.70

Obinna Anya, H. Tawfik, A. Nagar

引用次数: 3

EEG-based Driver Fatigue Detection 基于脑电图的驾驶员疲劳检测

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.28

Hamzah S. AlZu'bi, W. Al-Nuaimy, N. Al-Zubi

引用次数: 25

Simultaneous Perturbation Stochastic Approximation-Based Localization Algorithms for Mobile Devices 基于同步摄动随机逼近的移动设备定位算法

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.20

Mohammad Abdul Azim, Z. Aung

{"title":"Simultaneous Perturbation Stochastic Approximation-Based Localization Algorithms for Mobile Devices","authors":"Mohammad Abdul Azim, Z. Aung","doi":"10.1109/DeSE.2013.20","DOIUrl":"https://doi.org/10.1109/DeSE.2013.20","url":null,"abstract":"Localization precision remains active and open challenge in the area of wireless networks. For static network we develop model free approach of localization technique that by-passes the tedious modeling of diverse aspects to the contributing factor of localization errors, namely simultaneous perturbation stochastic approximation (SPSA) localization technique. The improved version of SPSA, simultaneous perturbation stochastic approximation by neighbor confidence (SPSA-NC) addresses error propagation of iterative localization controlled by incorporating a neighbor confidence matrix. The centralized SPSA and SPSA-NC does not scale well for the mobile environment due to the messaging requirements of repeated updates. We take distributed approaches to implement the aforementioned localization techniques for mobile devices by distributed simultaneous perturbation stochastic approximation (DSPSA) and distributed simultaneous perturbation stochastic approximation by neighbor confidence (DSPSA-NC) respectively, compare the results with the centroid (C) and weighted centroid (WC) localization techniques and show superiority of our methods.","PeriodicalId":248716,"journal":{"name":"2013 Sixth International Conference on Developments in eSystems Engineering","volume":"1 35","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132748084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Active Learning System in the Context of the Social Semantic Web 社会语义网背景下的主动学习系统

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.67

I. Szilagyi, Ana Roxin, I. Roxin

引用次数: 0

Analysis of Probabilistic Forwarding in Opportunistic Networks Using the Percolation Theory 利用渗透理论分析机会网络中的概率转发

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.18

Daniel Gutiérrez-Reina, Radu-Ioan Ciobanu, S. T. Marín, C. Dobre, F. Barrero

{"title":"Analysis of Probabilistic Forwarding in Opportunistic Networks Using the Percolation Theory","authors":"Daniel Gutiérrez-Reina, Radu-Ioan Ciobanu, S. T. Marín, C. Dobre, F. Barrero","doi":"10.1109/DeSE.2013.18","DOIUrl":"https://doi.org/10.1109/DeSE.2013.18","url":null,"abstract":"Opportunistic networks are mobile networks that rely on the store-carry-and-forward paradigm, using contacts between nodes to opportunistically transfer data. For this reason, traditional routing mechanisms are no longer suitable. To increase the success of successful message delivery, different probability-based techniques were previously studies by various authors. Here we address the question of how much of the forwarding probability of an ON has to be increased, in order for the network to achieve a given desired hit rate. We propose an approach based on percolation theory, which explains the influence of forwarding probability in a network's performance, and we try to prove that such a phenomenon is indeed present in ONs. We demonstrate, through extensive experiments, that the transition phase can be indeed observed in ONs when the forwarding probability is varied from 0 to 0.1. After the transition phase, little benefit is obtained in terms of reachability (exponential relationship) when the forwarding probability is increased. In contrast, the delivery cost increases much faster than the reachability after the transition phase. Consequently, increasing the forwarding probability only impacts on metrics like the delivery cost and latency since high reachability can be assumed in opportunistic networks.","PeriodicalId":248716,"journal":{"name":"2013 Sixth International Conference on Developments in eSystems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128594651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Agents' Monitoring Approach for Big Data 面向大数据的代理监控方法

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.42

M. Randles, D. Lamb, Andrew Attwood

{"title":"Agents' Monitoring Approach for Big Data","authors":"M. Randles, D. Lamb, Andrew Attwood","doi":"10.1109/DeSE.2013.42","DOIUrl":"https://doi.org/10.1109/DeSE.2013.42","url":null,"abstract":"Data sources are becoming more prevalent as digital devices in the form of sensor networks, capture and record vast amounts of individual and environmental data. Much of this data is to some extent redundant, as it is captured or held at many locations, or is of a low priority level, so can safely be ignored. The distributed nature of such data, however, means that it is impossible to identify redundant or useless information without full scale analysis. The velocity of data arrival, the volume of data and the heterogeneous nature (variety) of the data makes this task unfeasible for any real time analysis, which is becoming more desirable in real world situations. Thus this paper is looking to utilize a multi-agent system or federation of agents to analyse data in a distributed manner. The method of setting up such an agent team is proposed so as to engender a cohesive team ethos endowing the agent federation with the power of a single agent's goal. It is then shown that this leads to a specific network topology to emerge within the agent team. Furthermore such a topology allows an acquaintance monitoring algorithm to be applied. This is shown to actively attenuate and prioritize data by suggesting only those sensor nodes that are likely to be in possession of useful and non-redundant data, using only data local to each agent team member. The results are gained, in this first instance, by a simulation.","PeriodicalId":248716,"journal":{"name":"2013 Sixth International Conference on Developments in eSystems Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129325409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Using of Cement Kiln Dust as a Mineral Admixture to Produce Sustainable Self-Compacting Concrete 利用水泥窑粉尘作为矿物掺合料生产可持续自密实混凝土

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.60

K. Najim, Zaher Shakir Mahmood

引用次数: 3

Novel Multivariate Time Series Clustering Approach for E-Governance of Crime Data 犯罪数据电子治理的多元时间序列聚类新方法

2013 Sixth International Conference on Developments in eSystems Engineering Pub Date : 2013-12-16 DOI: 10.1109/DeSE.2013.62

B. Chandra, Manish Gupta

{"title":"Novel Multivariate Time Series Clustering Approach for E-Governance of Crime Data","authors":"B. Chandra, Manish Gupta","doi":"10.1109/DeSE.2013.62","DOIUrl":"https://doi.org/10.1109/DeSE.2013.62","url":null,"abstract":"In recent past, there is an increased interest in multivariate time series (MTS) clustering research due to its wide applications in various areas such as finance, environmental research, multimedia and crime. The traditional similarity measures like correlation, Euclidean distance etc. cannot be applied to measure the similarity among data objects of MTS since every data object of MTS is in the form of a matrix. Although, some similarity measures like dynamic time warping (DTW), and extended Frobenius norm (Eros) have been introduced in the past for finding similarity among MTS data objects, they are either computationally expensive or inefficient for carrying out clustering of MTS datasets. In this paper, an efficient similarity measure has been introduced which outperforms the existing similarity measures. This paper also introduces a two phase methodology for e-governance of crime data with multiple inputs and multiple outputs. The first phase forms homogeneous groups of objects using MTS clustering based on the proposed similarity measure and the second phase measures the performance of homogeneous groups using Malmquist data envelopment analysis (DEA) model. The proposed similarity measure for MTS and two phase methodology can be applied to wide variety of real world problems. The effectiveness of the proposed approach has been illustrated on Indian crime data. Firstly, MTS clustering using proposed similarity measure is used to cluster various police administration units (PAUs) such as states, districts and police stations based on similar crime trends. Secondly, PAUs are ranked on the basis of their effective enforcement of crime prevention measures using Data Envelopment Analysis (DEA).","PeriodicalId":248716,"journal":{"name":"2013 Sixth International Conference on Developments in eSystems Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130623525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3