Embedded System Design is becoming a field of choice for Model-Driven Engineering techniques. On the engineering side, models bring an abstraction of the code that can then be generated (and regenerated) at will. On t...
详细信息
Embedded System Design is becoming a field of choice for Model-Driven Engineering techniques. On the engineering side, models bring an abstraction of the code that can then be generated (and regenerated) at will. On the semantic side, they bring a reasoning framework to guarantee or verify properties on the generated code. We focus here on the Clock Constraint Specification Language, initially defined as a companion language of the UML Profile for MARTE. More specifically, we define a state-based representation of CCSL operators. To deal with unbounded operators, we propose to use lazy evaluation to represent intentionally infinite transition systems. We provide an algorithm to make the synchronized product of such transition systems and we study its complexity. Even though the transition systems are infinite, the result of the composition may become finite, in which case the (semi)algorithm terminates and exhaustive analysis becomes possible.
Cloud Robotics is an emerging field within robotics, currently covering various application domains and robot network paradigms. this paper provides a structured, systematic overview of the numerous definitions, conce...
详细信息
ISBN:
(纸本)9781479900626
Cloud Robotics is an emerging field within robotics, currently covering various application domains and robot network paradigms. this paper provides a structured, systematic overview of the numerous definitions, concepts and technologies linked to Cloud Robotics and cloud technologies in a broader sense. It also presents a roadmap for the near future, describing development trends and emerging application areas. Cloud Robotics may have a significant role in the future as an explicitly human-centered technology, capable of addressing the dire needs of our society.
Wireless ad-hoc networks are typically deployed in a decentralized way, without an authority that determines the location of nodes or the time they join the network. Additionally, existing nodes may fail during networ...
详细信息
Wireless ad-hoc networks are typically deployed in a decentralized way, without an authority that determines the location of nodes or the time they join the network. Additionally, existing nodes may fail during network lifetime. Consequently, the geographical span (area) of the network is irregular and unknown. However, if known, this information can be used to improve efficiency of many wireless applications; in some existing applicationsthis information is necessary for their operation in the real use cases. For this purpose, we propose a distributed algorithm that determines the geographical network area. It is the first algorithm that simultaneously discovers network border, approximates the network area with a data structure of a constant size, and disseminates this information to all network nodes. Our algorithm uses only the nodes' local information, has a constant computational complexity and is resilient to link unreliability. the algorithm is evaluated by simulation on realistic network topologies of different sizes. the simulations demonstrate that the algorithm has high accuracy in its estimation of the network area, scales well withthe number of nodes, and that it creates a low communication overhead.
Nowadays, millions of users share their complete movement trajectory online when using real-time traffic monitoring applications, pay-as-you-drive insurances, or when sharing their last road trip with friends. However...
详细信息
Nowadays, millions of users share their complete movement trajectory online when using real-time traffic monitoring applications, pay-as-you-drive insurances, or when sharing their last road trip with friends. However, many users still hesitate to use location-based applications as they are not willing to reveal, for instance, their driving behavior or the occurrence of a speeding violation. therefore, we present novel speed protection algorithms protecting users from revealing a violation of given speed limits when using location-based applications. Our algorithms support time-based and distance-based position updates. To protect positions indicating a speeding violation, we either adjust temporal information by delaying position updates or adjust their spatial information. We evaluate our algorithms by using real world traces and show that the protected movement trajectory of the user is of high quality even after removing speeding violations.
Wireless sensor networks (WSN) is a key technology extensively applied in many fields, such as transportation, health-care and environment monitoring. Despite rapid development, the exponentially increasing data emana...
详细信息
the evolution of mobile technologies allows the emerging of ubiquitous systems, able to anticipate user needs and to seamlessly adapt to context changes. these systems present the problem of dynamic adaptation in a hi...
详细信息
ISBN:
(纸本)9781467324793
the evolution of mobile technologies allows the emerging of ubiquitous systems, able to anticipate user needs and to seamlessly adapt to context changes. these systems present the problem of dynamic adaptation in a highly distributed, heterogeneous and volatile environment, since it may be difficult to collect and process context information from distributed unknown sources. In order to facilitate the development of such systems, this paper extends an existing coordination framework based on tuple spaces, aiming at the management of distributed information. Hence, a decentralized coordination framework was created, offering primitives to developers to create ubiquitous systems able to interact and cooperate in scenarios of total decentralization. this paper reports some experimental results obtained in a testbed of smartphones and tablets which demonstrate the practical feasibility of our approach and pointed out how our solution can grant context data dissemination in ad hoc and infrastructured networks.
We focus on the parallelization of two-dimensional square packing problem. In square packing problem, a list of square items need to be packed into a minimum number of unit square bins. All square items have side leng...
详细信息
We focus on the parallelization of two-dimensional square packing problem. In square packing problem, a list of square items need to be packed into a minimum number of unit square bins. All square items have side length smaller than or equal to 1 which is also the side length of each unit square bin. the total area of items that has been packed into one bin cannot exceed 1. Using the idea of harmonic, some squares can be put into the same bin without exceeding the bin limitation of side length 1. We try to concurrently pack all the corresponding squares into one bin by a parallel systerm of computation processing. A 9=4-worst case asymptotic error bound algorithm with time complexity (n) is showed. Let OPT(I) and A(I) denote, respectively, the cost of an optimal solution and the cost produced by an approximation algorithmA for an instance Iof the square packing problem. the best upper bound of on-line square packing to date is 2.1439 proved by Han et al. [23] by using complexity weighting functions. However the upper bound of our parallel algorithm is a litter worse than Han's algorithm, the analysis of our algorithm is more simple and the time complexity is improved. Han's algorithm needs O(nlogn) time, while our method only needs (n) time.
Logistic regression is a classical classification method, it has been used widely in many applications which have binary dependent variable. However, when the data sets are imbalanced, the probability of rare event is...
详细信息
Nowadays information published in the internet has become a common knack for all. As a result volume of information has become huge. To handle that huge volume information, Web researchers are introduced various types...
详细信息
Mobile IPv6 and its extensions including Proxy MIPv6 employ a centralized mobility anchor to handle mobility management of the mobile nodes. the mobility anchor is in charge of mobility routing, location management an...
详细信息
Mobile IPv6 and its extensions including Proxy MIPv6 employ a centralized mobility anchor to handle mobility management of the mobile nodes. the mobility anchor is in charge of mobility routing, location management and home address allocation functions. Having all of these functions bundled in a single network entity brings performance issues such as non optimal routing via this centralized anchor, traffic bottleneck and single point of failure. distributed mobility management is an alternative approach to overcome these issues. A network-based distributed mobility management scheme that co-locates the mobility routing function to distributed access routers with a mobility client function in different networks is presented. It provides an optimal path for both handover traffic and new traffic of the mobile nodes, and releases the burden from the centralized mobility anchor. the paper presents in detail the scheme and its principle of operation. Furthermore, it develops an analytical model to evaluate the performance of the scheme. Numerical results are presented to demonstrate better performance in terms of packet delivery cost, tunneling cost and total cost.
暂无评论