Search results for "Crypt"
showing 10 items of 1111 documents
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
Serial In-network Processing for Large Stationary Wireless Sensor Networks
2017
International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…
IMPACT OF TIMETABLE SYNCHRONIZATION ON HUB CONNECTIVITY OF EUROPEAN CARRIERS
2016
This paper evaluates the net impact of timetable synchronization on the connectivity of the key European carriers at their main hubs. We measure hub connectivity using a weighted connectivity score (WCS) that takes into account the number and the trip time related quality of flight connections. Based on WCS, we compare hub performance resulting from the existing schedule against a random expectati on calculated from multiple randomized schedule simulations. In each simulated schedule scenario we randomly vary the flight departure and arrival times within the operation hours at a hub and at outbound stations keeping all other flight parameters from the real schedule unchanged.We observe that…
Adaptive control of a class of strict-feedback time-varying nonlinear systems with unknown control coefficients
2018
Abstract In this paper, robust adaptive control of a class of strict-feedback nonlinear systems with unknown control directions is investigated. A novel Nussbaum-type function is developed and a key theorem is drawn which involves quantifying the addition of multiple Nussbaum functions with different control directions in a single inequality. Global stability of the closed-loop system and asymptotic stabilization of system output are proved. A simulation example is given to illustrate the effectiveness of the proposed control scheme.
Combining hashing and enciphering algorithms for epidemiological analysis of gathered data.
2008
Summary Objectives: Compiling individual records coming from different sources is necessary for multi-center studies. Legal aspects can be satisfied by implementing anonymization procedures. When using these procedures with a different key for each study it becomes almost impossible to link records from separate data collections. Methods: The originality of the method relies on the way the combination of hashing and enciphering techniques is performed: like in asymmetric encryption, two keys are used but the private key depends on the patient’s identity. Results: The combination of hashing and enciphering techniques provides a great improvement in the overall security of the proposed scheme…
A modified observer-based prediction approach for industrial applications
2013
The prediction of key variables has great significance to monitor the running status of industrial systems. In this paper, a novel data-driven design of variable predictor is proposed. The basic idea is the realization of prediction observer, which is modified from the observer-based fault diagnose method. Different from the standard data-driven approaches, the proposed scheme is adopted for the dynamic systems due to the superior tracking ability of output observer. Additionally, by introducing an extra design freedom and the estimation of measured value, it can also be used for the case that the key variable is not on-line measurable. Finally, the proposed prediction scheme is applied to …
Multi-beam cooperative frequency reuse for coordinated multi-point transmission
2010
Coordinated multi-point (CoMP) joint transmission is considered in the 3rd generation partnership project (3GPP) long term evolution (LTE)-advanced as a key technique to mitigate inter-cell interference and improve the cell-edge performance. To effectively apply CoMP joint transmission, efficient frequency reuse schemes need to be designed to support resource management cooperation among coordinated cells. However, most of the existing frequency reuse schemes are not suitable for CoMP systems due to not considering multi-point joint transmission scenarios in their frequency reuse rules. In addition, the restrictions of frequency resources in those schemes result in a high blocking probabili…
Using knowledge of human-generated code to bias the search in program synthesis with grammatical evolution
2021
Recent studies show that program synthesis with GE produces code that has different structure compared to human-generated code, e.g., loops and conditions are hardly used. In this article, we extract knowledge from human-generated code to guide evolutionary search. We use a large code-corpus that was mined from the open software repository service GitHub and measure software metrics and properties describing the code-base. We use this knowledge to guide the search by incorporating a new selection scheme. Our new selection scheme favors programs that are structurally similar to the programs in the GitHub code-base. We find noticeable evidence that software metrics can help in guiding evoluti…
Secure and efficient data storage in unattended wireless sensor networks
2009
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/NTMS.2009.5384753 Providing forward and backward secrecy is still a big challenge in Unattended Wireless Sensor Networks (UWSNs), though some storage schemes have been proposed. Additionally, high storage requirement needs efficient storage techniques. In this paper, we propose a novel homomorphic…
Elliptic Curve-Based Secure Multidimensional Aggregation for Smart Grid Communications
2017
In smart grid, data aggregation is considered as an essential paradigm in assessing information about current energy usage. To achieve the privacy-preserving goal, several homomorphic-based solutions have been proposed. However, these solutions either consider one-dimensional information or use costly pairing computation in order to ensure source authentication. In fact, smart grid data are likely to be multidimensional (e.g., time, purpose, and so on) for more accurate control. In addition, the aggregation node in smart grid needs to verify data that come from several smart meters in a residential area; hence, the verification must be cost-efficient. In this paper, we propose a scheme that…