This 4-Volume-Set, CCIS 0251 - CCIS 0254, constitutes the refereed proceedings of the international Conference on Informatics engineering and Information Science, ICIEIS 2011, held in Kuala Lumpur, Malaysia, in Novemb...
ISBN:
(数字)9783642254536
ISBN:
(纸本)9783642254529
This 4-Volume-Set, CCIS 0251 - CCIS 0254, constitutes the refereed proceedings of the international Conference on Informatics engineering and Information Science, ICIEIS 2011, held in Kuala Lumpur, Malaysia, in November 2011. The 210 revised full papers presented together with invited papers in the 4 volumes were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on e-learning, information security, softwareengineering, image processing, algorithms, artificial intelligence and soft computing, e-commerce, data mining, neural networks, social networks, grid computing, biometric technologies, networks, distributed and parallel computing, wireless networks, information and data management, web applications and softwaresystems, multimedia, ad hoc networks, mobile computing, as well as miscellaneous topics in digital information and communications.
In this paper, we consider a cooperative transmission scheme to ensure data confidentiality from passive eavesdropping in a distributed detection scenario. A wireless sensor Network (WSN) consisting a set of sensors o...
详细信息
In this paper, we consider a cooperative transmission scheme to ensure data confidentiality from passive eavesdropping in a distributed detection scenario. A wireless sensor Network (WSN) consisting a set of sensors observes an unknown target and reports sensing data to an ally fusion center (AFC). Meanwhile, an enemy fusion center (EFC) located in a vicinity of the AFC tries to eavesdrop on the reporting data in wireless environment. To prevent such an attack, we propose reporting rules for selected sensors to minimize not only the total error probability at the AFC but also information leakage to the EFC. While a set of sensors transmits sensing data to the AFC, the proposed scheme also activates another set of sensors aiming at inducing interference and making the EFC confused. Our results show that information-theoretic perfect secrecy can be achieved by taking advantage of random behavior of wireless parallel access channels.
The Web of Things research activities consist essentially in developing concepts, tools and systems for creating and operating global networks of devices associated with embedded resources - RFID tags, sensors, actuat...
详细信息
The Web of Things research activities consist essentially in developing concepts, tools and systems for creating and operating global networks of devices associated with embedded resources - RFID tags, sensors, actuators and even complex computing facilities, which are accessed by services. In that context, one of the most accepted standardization technique in order to seamlessly integrate this potentially huge set of heterogeneous services consists in RESTifying them. This operation is rather straightforward for "quickly computed" services such as Flickr photo service, Google Maps or Twitter. But what about cleanly integrating delayed, possibly decomposable services, such as a parcel delivery service computing first the partitions of parcels to various tours and then, for each tour, the optimal routing respecting additional constraints? We claim that this question represents an important challenge if one desires to enrich the potentialities of the web of things. In order to best contribute to its solution, this paper first tackles the problematic of RESTifying decomposable delayed services in a generic way. Secondly, it proposes a general architecture and validates it with a case study including a prototypical implementation.
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. In most cases, however, a form of connectivity can be established over time and space. This par...
详细信息
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. In most cases, however, a form of connectivity can be established over time and space. This particularity leads to consider the relevance of a given route not only in terms of hops (topological length), but also in terms of time (temporal length). The problem of measuring temporal distances between individuals in a social network was recently addressed, based on a posteriori analysis of interaction traces. This paper focuses on the distributed version of this problem, asking whether every node in a network can know precisely and in real time how out-of-date it is with respect to every other. Answering affirmatively is simple when contacts between the nodes are punctual, using the temporal adaptation of vector clocks provided in (Kossinets et al., 2008). It becomes more difficult when contacts have a duration and can overlap in time with each other. We demonstrate that the problem remains solvable with arbitrarily long contacts and non-instantaneous (though invariant and known) propagation delays on edges. This is done constructively by extending the temporal adaptation of vector clocks to non-punctual causality. The second part of the paper discusses how the knowledge of temporal lags could be used as a building block to solve more concrete problems, such as the construction of foremost broadcast trees or network backbones in periodically-varying DTNs.
This paper presents a highly efficient AC power transfer in supply-capacitor-less distributed bio-implant. A transfer system is designed using silicon-on-sapphire (SOS) technology CMOS transistors to transfer data and...
详细信息
This paper presents a highly efficient AC power transfer in supply-capacitor-less distributed bio-implant. A transfer system is designed using silicon-on-sapphire (SOS) technology CMOS transistors to transfer data and power from a surface implant to a chip-scale implant using only two wires. The proposed design achieves a high voltage conversion ratio and power transfer efficiency by reducing the conduction path voltage drop and controlling the rectifier transistors to minimize reverse current flow. For a 3 V, 1 MHz input signal and a load of 10 mA, the design obtains a power efficiency of 91% and a voltage conversion ratio of 0.95. All performance simulations are done on cadence software customized by the Peregrine Semiconductor Corporation to implement SOS technology.
In this paper, inner products using a new number system called the Folding Residue Number System (FRNS) and distributed Arithmetic (DA) principles is proposed. The advantage of this new number system is that it allows...
详细信息
In this paper, inner products using a new number system called the Folding Residue Number System (FRNS) and distributed Arithmetic (DA) principles is proposed. The advantage of this new number system is that it allows digital filters to be implemented directly from the analog signal by decomposing and folding it in several parallel channels. Folding Residues extracted together with the folding information obtained from the folding circuits are processed using DA principles in implementing the filtering algorithm. The FRNS has the same complexity of computation as that of the Residue Number System (RNS) but intermediate steps such as conversion of the analog signal into its binary equivalents and subsequently into residues required in RNS are eliminated. Moreover, smaller word length of the folding residues coupled with DA results in faster implementation of the filtering algorithms.
Recent years have witnessed an increasing demand for super data clusters. The super data clusters have reached the petabyte-scale that can consist of thousands or tens of thousands storage nodes at a single site. For ...
详细信息
Recent years have witnessed an increasing demand for super data clusters. The super data clusters have reached the petabyte-scale that can consist of thousands or tens of thousands storage nodes at a single site. For this architecture, reliability is becoming a great concern. In order to achieve a high reliability, data recovery and node reconstruction is a must. Although extensive research works have investigated how to sustain high performance and high reliability in case of node failures at large scale, a reverse lookup problem, namely finding the objects list for the failed node remains open. This is especially true for storage systems with high requirement of data integrity and availability, such as scientific research data clusters and etc. Existing solutions are either time consuming or expensive. Meanwhile, replication based block placement can be used to realize fast reverse lookup. However, they are designed for centralized, small-scale storage architectures. In this paper, we propose a fast and efficient reverse lookup scheme named Group-based Shifted Declustering (G-SD) layout that is able to locate the whole content of the failed node. G-SD extends our previous shifted declustering layout and applies to large-scale file systems. Our mathematical proofs and real-life experiments show that G-SD is a scalable reverse lookup scheme that is up to one order of magnitude faster than existing schemes.
This 4-Volume-Set, CCIS 0251 - CCIS 0254, constitutes the refereed proceedings of the international Conference on Informatics engineering and Information Science, ICIEIS 2011, held in Kuala Lumpur, Malaysia, in Novemb...
ISBN:
(数字)9783642254628
ISBN:
(纸本)9783642254611
This 4-Volume-Set, CCIS 0251 - CCIS 0254, constitutes the refereed proceedings of the international Conference on Informatics engineering and Information Science, ICIEIS 2011, held in Kuala Lumpur, Malaysia, in November 2011. The 210 revised full papers presented together with invited papers in the 4 volumes were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on e-learning, information security, softwareengineering, image processing, algorithms, artificial intelligence and soft computing, e-commerce, data mining, neural networks, social networks, grid computing, biometric technologies, networks, distributed and parallel computing, wireless networks, information and data management, web applications and softwaresystems, multimedia, ad hoc networks, mobile computing, as well as miscellaneous topics in digital information and communications.
AUTOSAR is a component-based modeling language and development framework for automotive embedded systems. Component-to-ECU mapping is conventionally done manually and empirically. As the number of components and ECUs ...
详细信息
AUTOSAR is a component-based modeling language and development framework for automotive embedded systems. Component-to-ECU mapping is conventionally done manually and empirically. As the number of components and ECUs in vehicles systems grows rapidly, it becomes infeasible to find optimal solutions by hand. We address some design issues involved in mapping an AUTOSAR model to a distributed hardware platform with multiple ECUs connected by a bus, each ECU running a real-time operating system. We present algorithms for extracting connectivity between ports of atomic software components from an AUTOSAR model and for calculating blocking times of all tasks of a taskset scheduled by PCP. We then address optimization issues in mapping AUTOSAR components (SWCs) to distributed multithreaded implementations. We formulate and solve two optimization problems: map SWCs to ECUs with the objective of minimizing the bus load; for a given SWC-to-ECU mapping, map runnable entities on each ECU to OS tasks and assign data consistency mechanism to each shared data item to minimize memory size requirement on each ECU while guaranteeing schedulability of tasksets on all ECUs.
As recognition grows within industry for the advantages that can be gained through the exploitation of large-scale dynamic systems, a need emerges for dependable performance. Future systems are being developed with a ...
详细信息
As recognition grows within industry for the advantages that can be gained through the exploitation of large-scale dynamic systems, a need emerges for dependable performance. Future systems are being developed with a requirement to support mission critical and safety critical applications. These levels of criticality require predictable performance and as such have traditionally not been associated with adaptive systems. The software architecture proposed for such systems takes its properties from the service-oriented computing paradigm and the communication model follows a publish/subscribe approach. While adaptive, such architectures do not, however, typically support real-time levels of performance. There is scope, however, for dependability within such architectures through the use of Quality of Service (QoS) methods. QoS is used in systems where the distribution of resources cannot be decided at design time. In this paper a QoS based framework is proposed for providing adaptive and dependable behaviour for future large-scale dynamic systems through the flexible allocation of resources. Simulation results are presented to demonstrate the benefits of the QoS framework and the tradeoffs that occur between negotiation algorithms of varying complexities.
暂无评论