Search results for "SIM"
showing 10 items of 10139 documents
A novel secure aggregation scheme for wireless sensor networks using stateful public key cryptography
2015
International audience; Wireless sensor networks (WSNs) are nowadays considered as an important part of the Internet of Things (IoT). In these networks, data aggregation plays an essential role in energy preservation. However, WSNs are usually deployed in hostile and unattended environments (e.g. military applications) in which the confidentiality and integrity security services are widely desired. Recently, homomorphic encryptions have been applied to conceal sensitive information during aggregation such that algebraic operations are done directly on ciphertexts without decryption. The main benefit is that they offer the end-to-end data confidentiality and they do not require expensive com…
Efficient analysis of cubic junction of rectangular waveguides using admittance-matrix representation
2000
In the paper an efficient and accurate method, based on the multimode-admittance-matrix representation and the theory of cavities, is proposed for the analysis of a six-port ‘cubic’ junction composed of the orthogonal intersection of three rectangular waveguides. Very simple closed-form analytical expressions are explicitly detailed for all matrix elements of this basic key building block. More general waveguide multiport junctions, composed of a central cubic junction with arbitrarily shaped waveguide access ports, are also studied using a segmentation procedure. To validate the theory, numerical results are first discussed for a standard rectangular waveguide six-port cross junction. Fina…
Assessment of the Current for a Non-Linear Power Inductor Including Temperature in DC-DC Converters
2023
A method for estimating the current flowing through a non-linear power inductor operating in a DC/DC converter is proposed. The knowledge of such current, that cannot be calculated in closed form as for the linear inductor, is crucial for the design of the converter. The proposed method is based on a third-order polynomial model of the inductor, already developed by the authors; it is exploited to solve the differential equation of the inductor and to implement a flux model in a circuit simulator. The method allows the estimation of the current up to saturation, intended as the point at which the differential inductance is reduced to half of its maximum value. The current profile depends al…
A saturated strategy robustly ensures stability of the cooperative equilibrium for Prisoner's dilemma
2016
We study diffusion of cooperation in a two-population game in continuous time. At each instant, the game involves two random individuals, one from each population. The game has the structure of a Prisoner's dilemma where each player can choose either to cooperate (c) or to defect (d), and is reframed within the field of approachability in two-player repeated game with vector payoffs. We turn the game into a dynamical system, which is positive, and propose a saturated strategy that ensures local asymptotic stability of the equilibrium (c, c) for any possible choice of the payoff matrix. We show that there exists a rectangle, in the space of payoffs, which is positively invariant for the syst…
On coincidence of feedback and global Stackelberg equilibria in a class of differential games
2021
This paper shows for a class of differential games that the global Stackelberg equilibrium (GSE) coincides with the feedback Stackelberg equilibrium (FSE), although the GSE assumes that the leader/regulator an- nounces at the initial time the regulatory instrument rule she will follow for the rest of the game, while in the FSE, the regulator at any time chooses the optimal level of the regulatory instrument rate. This coincidence is based on the fact that the FSE is calculated using dynamic programming what implies that although the regulator chooses the regulatory instrument rate level that maximizes social welfare, the first-order condition for the maximization of the right-hand side of t…
Worst Case Analysis of Non-local Games
2013
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. The players win if the answers a i satisfy a condition that may depend on the inputs x i .
Advantage of Quantum Strategies in Random Symmetric XOR Games
2013
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players.
Domain-Knowledge Optimized Simulated Annealing for Network-on-Chip Application Mapping
2013
Network-on-Chip architectures are scalable on-chip interconnection networks. They replace the inefficient shared buses and are suitable for multicore and manycore systems. This paper presents an Optimized Simulated Annealing (OSA) algorithm for the Network-on-Chip application mapping problem. With OSA, the cores are implicitly and dynamically clustered using knowledge about communication demands. We show that OSA is a more feasible Simulated Annealing approach to NoC application mapping by comparing it with a general Simulated Annealing algorithm and a Branch and Bound algorithm, too. Using real applications we show that OSA is significantly faster than a general Simulated Annealing, withou…
Upport vector machines for nonlinear kernel ARMA system identification.
2006
Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…
Calibrating a Motion Model Based on Reinforcement Learning for Pedestrian Simulation
2012
In this paper, the calibration of a framework based in Multi-agent Reinforcement Learning (RL) for generating motion simulations of pedestrian groups is presented. The framework sets a group of autonomous embodied agents that learn to control individually its instant velocity vector in scenarios with collisions and friction forces. The result of the process is a different learned motion controller for each agent. The calibration of both, the physical properties involved in the motion of our embodied agents and the corresponding dynamics, is an important issue for a realistic simulation. The physics engine used has been calibrated with values taken from real pedestrian dynamics. Two experime…