After more than a decade of research in Model-Driven engineering(MDE), the state-of-the-art and the state-of-the-practice in MDEhas significantly progressed. Therefore, during this workshop we raised the question of h...
详细信息
ISBN:
(纸本)9783642016479
After more than a decade of research in Model-Driven engineering(MDE), the state-of-the-art and the state-of-the-practice in MDEhas significantly progressed. Therefore, during this workshop we raised the question of how to proceed next, and we identified a number of future challenges in the field of MDE. The objective of the workshop was to provide a forum for discussing the future of MDE research and practice. Seven presenters shared their vision on the future challenges in the field of MDE. Four breakout groups discussed scalability, consistency and co-evolution, formal foundations, and industrial adoption, respectively. These themes were identified as major categories of challenges by the *** report summarises the different presentations, the MDE challenges identified by the workshop participants, and the discussions of the breakout groups.
Group Decision Making (GDM) refers to the selection of an alternative from a set of feasible alternatives that better satisfies some criteria according to a group of individuals (experts). There exist several differen...
详细信息
Group Decision Making (GDM) refers to the selection of an alternative from a set of feasible alternatives that better satisfies some criteria according to a group of individuals (experts). There exist several different models to simulate GDM processes, but many of those models do not usually take into account some dynamical aspects of real decision processes. For example, those models normally do not allow the experts set to change during the process (adding or removing experts), the alternatives to change (incorporating or discarding alternatives) or even to change the criteria. In this work we present a new model which allows to undertake GDM situations in which a large number of individuals (for example an on-line community) has to choose among different alternatives. To be able to obtain a good solution of consensus, the group of experts will be firstly simplified into a smaller group (using a simple clustering technique and a kind of trust network) which can then discuss about best solution to be selected.
Collaborative localization and discrimination of acoustic sources is an important problem for monitoring urban environments. Acoustic source localization typically is performed using either signal-based approaches tha...
详细信息
ISBN:
(纸本)9780982443804
Collaborative localization and discrimination of acoustic sources is an important problem for monitoring urban environments. Acoustic source localization typically is performed using either signal-based approaches that rely on transmission of raw acoustic data and are not suitable for resource-constrained wireless sensor networks or feature-based methods that result in degraded accuracy, especially for multiple targets. In this paper, we present a feature-based localization and discrimination approach for multiple acoustic sources using wireless sensor networks that fuses beamform and power spectral density data from each sensor. Our approach utilizes a graphical model for estimating the position of the sources as well as their fundamental and dominant harmonic frequencies. We present simulation and experimental results that show improvement in the localization accuracy and target discrimination. Our experimental results are obtained using motes equipped with microphone arrays and an onboard FPGA for computing the beamform and the power spectral density.
Requirements are critical to system validation as they guide all subsequent stages of systems development. Inadequately specified requirements generate systems that require major revisions or cause system failure enti...
详细信息
In this paper, we consider the detection problem with intermittent observations, due to the unreliable shared communication link between local sensors and the fusion center. Detection performance is analyzed using Ney...
详细信息
In this paper, we consider the detection problem with intermittent observations, due to the unreliable shared communication link between local sensors and the fusion center. Detection performance is analyzed using Neyman-Pearson criterion of maximizing the probability of detection, for a given probability of false alarm. The detector performance is compared, with and without intermittent observations, and a formal approach is presented to restore the original detector performance.
The ability to recover from failures and maintain an acceptable level of service degradation despite failures is a crucial aspect in the design of multi-hop wireless networks. This paper investigates routing restorati...
详细信息
The ability to recover from failures and maintain an acceptable level of service degradation despite failures is a crucial aspect in the design of multi-hop wireless networks. This paper investigates routing restoration solutions in the event of node failures. In particular, we consider three strategies, namely global restoration, end-to-end restoration and local restoration, which can support a range of tradeoffs between the restoration latency and network throughput after restoration. To quantitatively evaluate the impact of node failures during and after routing restoration, we define two performance degradation indices, transient disruption index (TDI) and throughput degradation index (THI). We formulate the optimal routing restoration schemes under these three strategies as linear programming problems and implement their solutions in the ns-2 simulator. Extensive performance evaluations are performed to study the impact of node failures in multi-hop wireless network under these three routing restoration strategies. To the best of our knowledge, this is the first work that quantitatively compares the optimal route restoration strategies in multi-hop wireless networks in terms of performance degradation during and after restoration.
In this article, we survey the history of studies of computational creativity, following the development of the International Conference on Computational Creativity pom its beginnings, a decade ago, in two parallel wo...
详细信息
Radio Frequency IDentification (RFID) is a technology of automatic object identification. Retailers and manufacturers have created compelling business cases for deploying RFID in their supply chains. Yet, the uniquely...
详细信息
ISBN:
(纸本)9781605581668
Radio Frequency IDentification (RFID) is a technology of automatic object identification. Retailers and manufacturers have created compelling business cases for deploying RFID in their supply chains. Yet, the uniquely identifiable objects pose a privacy threat to individuals. In this paper, we study the privacy threats caused by publishing RFID data. Even if the explicit identifying information, such as name and social security number, has been removed from the published RFID data, an adversary may identify a target victim's record or infer her sensitive value by matching a priori known visited locations and timestamps. RFID data by default is high-dimensional and sparse, so applying traditional K-anonymity to RFID data suffers from the curse of high dimensionality, and would result in poor data usefulness. We define a new privacy model, develop an anonymization algorithm to accommodate special challenges on RFID data, and evaluate its performance in terms of data quality, efficiency, and scalability. To the best of our knowledge, this is the first work on anonymizing high-dimensional RFID data. Copyright 2009 ACM.
Metaschedulers can distribute parts of a bag-of-tasks (BoT) application among various resource providers in order to speed up its execution. When providers cannot disclose private information such as their load and co...
详细信息
Metaschedulers can distribute parts of a bag-of-tasks (BoT) application among various resource providers in order to speed up its execution. When providers cannot disclose private information such as their load and computing power, which are usually heterogeneous, the metascheduler needs to make blind scheduling decisions. We propose three policies for composing resource offers to schedule deadline-constrained BoT applications. Offers act as a mechanism in which resource providers expose their interest in executing an entire BoT or only part of it without revealing their load and total computing power. We also evaluate the amount of information resource providers need to expose to the metascheduler and its impact on the scheduling. Our main findings are: (i) offer-based scheduling produces less delay for jobs that cannot meet deadlines in comparison to scheduling based on load availability (i.e. free time slots); thus it is possible to keep providers' load private when scheduling multi-site BoTs; and (ii) if providers publish their total computing power they can have more local jobs meeting deadlines.
暂无评论