2012 Fourth International Conference on Intelligent Networking and Collaborative Systems最新文献

{"title":"A Struggle Genetic Algorithm for Ground Stations Scheduling Problem","authors":"F. Xhafa, X. Herrero, Admir Barolli, M. Takizawa","doi":"10.1109/iNCoS.2012.125","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.125","url":null,"abstract":"The Ground Station Scheduling is one of the most important problems in the field of Satellite-Scheduling. This problem consists in planning feasible planning of communications between satellites or spacecraft (SC) and operations teams of Ground Station (GS). The information received in these communications is usually basic information such as telemetry, tracking information or tasks to perform, so usually the time required for communication is usually quite smaller than the window of visibility. Typically, the assignment of the Ground Stations to Spacecraft is a very limited and small enough to make a manual planning, defined by short periods of time. However, resource allocation of a ground station on a mission has a high cost, and automation of this process provides many benefits not only in terms of management, but in economic terms as well. The problem is known for its high complexity and is an over-constrained problem. In this paper, we present the resolution of the problem through Struggle Genetic Algorithms. Struggle GA is a version of GAs that distinguishes for its efficiency in maintaining the diversity of the population through genetic evolution. We present some computational results for the case of the multi-ground stations scheduling obtained with Struggle GA using the STK simulation toolkit.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134561184","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":"Independent Task Scheduling by Artificial Immune Systems, Differential Evolution, and Genetic Algorithms","authors":"P. Krömer, J. Platoš, V. Snás̃el","doi":"10.1109/iNCoS.2012.76","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.76","url":null,"abstract":"Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and it is also an appealing NP-complete problem. There is a number of heuristic and metaheuristic algorithms that were tailored to deal with scheduling of independent jobs. In this study we investigate the efficiency of three bio-inspired metaheuristics for finding good schedules of independent tasks.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133830509","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":"Disaster Management and Profile Modelling of IoT Objects: Conceptual Parameters for Interlinked Objects in Relation to Social Network Analysis","authors":"Asta Zelenkauskaite, N. Bessis, Stelios Sotiriadis, E. Asimakopoulou","doi":"10.1109/iNCoS.2012.26","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.26","url":null,"abstract":"In recent years, the emergence of ubiquitous and pervasive computing suggests the radical transformation of the Internet to incorporate physical objects. The transformation suggests the enabling of a new form of communication and interaction style that incorporates people, their smart devices and their physical objects through the utilization of distributed sensors spread in the environment. In this study, we propose extending Internet of Things (IoT) by modelling an IoT enabled smart environment as a whole, representing the dynamic communication and interaction among all objects (users, devices, physical objects and sensors). This is by recognizing and categorizing objects' properties in the form of a generic profile. We also reflect this in a disaster management context. That is by identifying which of the parameters of these smart objects are fixed, constant and persistent over time and which parameters are actually change over time, i.e. those characterized by their transient and dynamic nature. Thus, through the process of communication and interaction of the objects, we analyze parameters by demonstrating their static and/or dynamic properties as well as those supporting context-aware variables which are evident in disaster scenarios. To achieve these goals, we designed the persistent or temporal relationships to encompass internal information of smart-objects, along with their characteristics that actually depict their capacity to offer services to users by properties' matchmaking. The interlinked relationships represent a 'social network' providing a terrain of flexible scenarios that would lead to tailored parameters to fit user preferences. To enable communication among them in a dynamic dimension we utilized a distributed topology in which communication could occur indirectly between objects. Finally, we detailed a generic - but equally applicable for disaster management - case scenario in which we used graph theory to demonstrate how embedded intelligence to real-life objects will be able to assist the smart-resource pairing, thus improving resource discovery and harvesting process by taking into consideration user needs and preferences.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133624014","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 Comparative Study between Spatial-Temporal Orthogonal Moments for Volumes Description","authors":"Manel Boutaleb, I. Lassoued, E. Zagrouba","doi":"10.1109/iNCoS.2012.40","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.40","url":null,"abstract":"Object motion description in videos is one of the most active research topics in pattern recognition and computer vision. In this paper we study and compare Krawtchouk, Tchebytchev and Zernike spatial-temporal moments for volumes description. Indeed, reconstruction process of sequences volumes is elaborated to select the best moment descriptor for spatial-temporal volumes. Structural and temporal information of a video sequence can be captured by this moments. The first step of this method is to segment the video into volume space-time images. Then, all objects silhouettes will be extracted from these images. So this set will define the space-time form. The next step is to apply the orthogonal space-time moments on the resulting shape or just on the silhouette's defined patches around the interest detected points. This approach allows to define a descriptor for each video in the database. These descriptors will then rebuild the volumes of silhouettes with different orders to select the optimal for description process.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125227202","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":"Optimized Directional Content Distribution Using Reputation","authors":"A. Urzica, Mircea Bardac","doi":"10.1109/iNCoS.2012.100","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.100","url":null,"abstract":"Word of mouth represents, from historical times, a powerful mechanism employed within human societies for influencing the behavior of their members. Translated into the computational world, the same feedback mechanism preserves or even broadens its impact. This paper presents an intriguing perspective on using reputation systems: reputation is gained by complying with the norms and norms are modified by the agents with high reputation. The aim of the model proposed by this paper is to optimize content distribution within a system. The model achieves this goal by prioritizing the preferences of the highest reputed agents. The reputation of an agent is translated into the influence it gains in altering system norms. The computational reputation model proposed requires minimum resources being thus well suited for agents running on mobile devices. Being completely decentralized, the interaction architecture provided by the model offers a high degree of scalability.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133554927","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":"Novel Distributed Turbo Coding Scheme in Two-Hop Relay Networks","authors":"Defeng Ren, J. Ge, Xiaoye Shi","doi":"10.1109/iNCoS.2012.17","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.17","url":null,"abstract":"The distributed turbo coding (DTC) with the combined diversity and coding gain has been proven to be an effective coding strategy to approach the capacity of relay networks. In this paper, a novel DTC scheme is proposed to further improve the diversity and coding gain, which can be applied to two-hop relay networks. At the relay, this scheme first computes the log-likelihood ratios (LLRs) of bits punctured at the source. Then, the relay forwards the hard-decided bits (-1 or 1) with the reliability larger than a threshold to the destination, otherwise it forwards the analog values between-1 and 1. Moreover, by using union bound techniques, we derive the upper bound on the end-to-end bit error rate (BER) of proposed DTC scheme under the quasi-static scenario. Finally, simulation results show the performance improvement of our scheme.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132930539","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":"Neighbour Traffic-Aware Load Balancing Method in Ad Hoc Networks","authors":"R. Yamamoto, T. Miyoshi, Y. Tanaka","doi":"10.1109/iNCoS.2012.74","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.74","url":null,"abstract":"Load balancing in ad hoc networks is more challenging issue than that in wired networks because the nature of decentralized network management and terminal mobility makes it difficult to realize appropriate controls for the whole network. Although some traffic-based load balancing methods that work with rerouting mechanisms have been proposed, they are, due to the overhead for rerouting, hard to adapt the environment where the traffic or the topology changes in a short period. Furthermore, the conventional methods cannot always find appropriate routes since they only give attention to the current transmission route. This paper proposes a load balancing method based on adaptive transmission rate control using neighbouring terminals' status. The proposed method does not adopt a rerouting mechanism but introduce a rate control so that we do not have to consider the overhead for rerouting. Computer simulation showed that, depending on terminals' status, our method achieves more effective load balancing, as well as better throughput, than the conventional rerouting-based methods.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133046585","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 Overview of Gait Analysis and Step Detection in Mobile Computing Devices","authors":"M. McGuire","doi":"10.1109/iNCoS.2012.110","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.110","url":null,"abstract":"Acceleration sensors are widely deployed in consumer mobile radio terminals. This enables these terminals to provide gait analysis without requiring extra hardware. Gait analysis is useful for a variety of navigation, security, and biomedical applications. This paper provides an overview of the methods used for accelerometer-based gait analysis in mobile devices. It also shows how this analysis has been used in state-of-the-art applications. The most important problems to be solved to improve gait analysis and these applications are also identified.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404000","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":"Building Control, Monitoring, Safety and Security Using Collaborative Systems","authors":"I. Sita","doi":"10.1109/iNCoS.2012.107","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.107","url":null,"abstract":"This paper describes the use of SIEMENS S7-300 PLC's and SIEMENS SIMATIC WinCC software in creating collaborative systems for controlling and monitoring modern buildings. These systems assure also the safety and security of the buildings. The communication between PLC's and WinCC software is made using SIEMENS PROFINET technology.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133597463","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 P2P Traffic Localization Method with Additional Delay Insertion","authors":"T. Miyoshi, Y. Shinozaki, Olivier Fourmaux","doi":"10.1109/iNCoS.2012.32","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.32","url":null,"abstract":"Recently, it has been noted that the inefficiencies in peer-to-peer (P2P) overlay networks result in a large quantity of traffic among internet service providers (ISPs) or autonomous systems (ASes). To optimize cross-ISP/AS traffic, the existing approaches introduce network-aware strategies in which peers select geographically close peers as neighbors using topological information. However, each P2P application must be equipped with a locality-aware neighbor-selection procedure and/or a communication protocol to obtain the topological information from an \"oracle\" server, i.e., modifications of P2P applications are required for this scheme. In this study, we propose a novel approach for P2P traffic localization, called P2P-DISTO, featuring the insertion of an additional delay into each P2P packet based on the geographic location of its destination. Because P2P-DISTO is implemented on network routers independently of applications, it can be utilized by all P2P applications without software modifications. The experimental evaluations using existing P2P video streaming services show that our fundamental concept successfully achieves P2P traffic localization by discouraging connections with faraway peers due to the additional delay.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114592718","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}