The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Mobile computing proved to be essential in today's cyber communications. However, entities in mobile computing are known of having limited energy, physical, and logical resources. This imposes various challenges that greatly affect communication quality and performance of those mobile entities, especially when applying computationally-intensive security measures that are essential for protecting the...
We study the problem of multi-party computation under approximate (ε,δ) differential privacy. We assume an interactive setting with k parties, each possessing a private bit. Each party wants to compute a function defined on all the parties' bits. Differential privacy ensures that there remains uncertainty in any party's bit even when given the transcript of interactions and all the other parties'...
In this paper, we use the witness-functions to analyze cryptographic protocols for secrecy under nonempty equational theories. The witness-functions are safe metrics used to compute security. An analysis with a witness-function consists in making sure that the security of every atomic message does not decrease during its lifecycle in the protocol. The analysis gets more difficult under nonempty equational...
Computing k-nearest-neighbor graphs constitutes a fundamental operation in a variety of data-mining applications. As a prominent example, user-based collaborative-filtering provides recommendations by identifying the items appreciated by the closest neighbors of a target user. As this kind of applications evolve, they will require KNN algorithms to operate on more and more sensitive data. This has...
Wireless communication technologies have given rise to the development of Delay Tolerant Networks, a collection of devices that route data opportunistically. These networks can be used to distribute data, such as news articles, advertisements, and media, to interested clients. To deliver content efficiently, the Social Content Distribution (SCD) schema collects social context data and request patterns...
Two principles of enduring institutions for self-organising resource allocation are congruence of the allocation method to the resources available, and participation of those affected by the allocation (the appropriators) in selecting that method. However, the principles do not say anything explicitly about the fairness of the allocation method, or the outcomes. In this paper, we complement these...
This paper investigates a new constrained relay selection scheme for two-way relaying systems where two end terminals communicate simultaneously via a relay. The introduced technique is based on the maximization of the weighted sum rate of both users. To evaluate the performance of the proposed system, the outage probability is derived in a general case (where an arbitrary channel is considered),...
We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a space of concise dimensionality, which enables greedy routing based only on local knowledge. PIE is a general routing scheme, meaning that it works...
Over the years the Internet became the primary means of communication, many companies use it as basis for their services. However, the current Internet does not guarantee Quality of Service, emerging the concept of network virtualization as the basis for the Future Internet. A common strategy used by companies is to define a Service Level Agreement (SLA) with their respective Internet Service Providers...
By disseminating data through Vehicular Ad-hoc Networks (VANETs), vehicles are able to share relevant sensor data to acquire information about accidents, traffic, and even pollution. Data relevance is measured by a utility function which considers the contextual information that vehicles currently have about their environment. To be effective, data dissemination protocols must cope with intermittent...
Both modularity and loose-coupling properties inherent to the self-adaptive systems offer the opportunity for ad-hoc service compositions, dynamic change and adaptation. To provide such a dynamic and self-adapting behavior, developers emphasize special self-management policies. ASSL (Autonomic System Specification Language) is a formal tool where such policies might be formally specified, validated...
Using reactive control algorithms and a dictionary of motion primitives, we have developed search and reconnaissance protocols for mobile robots aimed at efficiently discovering key features of an unknown potential field's topology (as opposed to its geometry). This work has in a natural way led to the creation of parsimonious reconnaissance routines that do not rely on any prior knowledge about the...
This paper presents an operational semantics for ASSL (Autonomic System Specification Language). ASSL is a promising new formal language dedicated to the development of systems exploiting the benefits of autonomic computing, a highly-regarded technique in the development of self-managing complex systems which draws inspiration from the mammalian autonomic nervous system. The formal semantics definitions...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.