Online Bi-Objective Scheduling for IaaS Clouds Ensuring Quality of Service

This paper focuses on a bi-objective experimental evaluation of online scheduling in the Infrastructure as a Service model of Cloud computing regarding income and power consumption objectives. In this model, customers have the choice between different service levels. Each service level is associated with a price per unit of job execution time, and a slack factor that determines the maximal time span to deliver the requested amount of computing resources. The system, via the scheduling algorithms, is responsible to guarantee the corresponding quality of service for all accepted jobs. Since we do not consider any optimistic scheduling approach, a job cannot be accepted if its service guarantee will not be observed assuming that all accepted jobs receive the requested resources. In this article, we analyze several scheduling algorithms with different cloud configurations and workloads, considering the maximization of the provider income and minimization of the total power consumption of a schedule. We distinguish algorithms depending on the type and amount of information they require: knowledge free, energy-aware, and speed-aware. First, to provide effective guidance in choosing a good strategy, we present a joint analysis of two conflicting goals based on the degradation in performance. The study addresses the behavior of each strategy under each metric. We assess the performance of different scheduling algorithms by determining a set of non-dominated solutions that approximate the Pareto optimal set. We use a set coverage metric to compare the scheduling algorithms in terms of Pareto dominance. We claim that a rather simple scheduling approach can provide the best energy and income trade-offs. This scheduling algorithm performs well in different scenarios with a variety of workloads and cloud configurations.     

A magnetically driven reciprocating probe for tokamak scrape-off layer measurements

A new in situ reciprocating probe system has been developed to provide scrape-off layer measurements in the Tore Supra tokamak. The probe motion is provided by the rotation of an energized coil in the tokamak magnetic field. Simple analytic approximations to the exact numerical model were used to identify the important parameters that govern the dynamics of the system, and optimize the coil geometry, the electrical circuit, and the stiffness of the retaining spring. The linear speed of the probe is directly proportional to the current induced by the coil's rotation; its integral gives the coil position, providing a means to implement real-time feedback control of the probe motion. Two probes were recently mounted on a movable outboard antenna protection limiter in Tore Supra and provided automatic measurements during the 2011 experimental campaign.     

Multicamera people tracking with a probabilistic occupancy map

Given two to four synchronized video streams taken at eye level and from different angles, we show that we can effectively combine a generative model with dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions and lighting changes. In addition, we also derive metrically accurate trajectories for each one of them.Our contribution is twofold. First, we demonstrate that our generative model can effectively handle occlusions in each time frame independently, even when the only data available comes from the output of a simple background subtraction algorithm and when the number of individuals is unknown a priori. Second, we show that multi-person tracking can be reliably achieved by processing individual trajectories separately over long sequences, provided that a reasonable heuristic is used to rank these individuals and avoid confusing them with one another.     

Multi-behavior agent model for planning in supply chains: An application to the lumber industry

Recent economic and international threats to western industries have encouraged companies to increase their performance in all ways possible. Many look to deal quickly with disturbances, reduce inventory, and exchange information promptly throughout the supply chain. In other words they want to become more agile. To reach this objective it is critical for planning systems to present planning strategies adapted to the different contexts, to attain better performances. Due to consolidation, the development of integrated supply chains and the use of inter-organizational information systems have increased business interdependencies and in turn the need for increased collaboration to deal with disturbance in a synchronized way. Thus, agility and synchronization in supply chains are critical to maintain overall performance. In order to develop tools to increase the agility of the supply chain and to promote the collaborative management of such disturbances, agent-based technology takes advantage of the ability of agents to make autonomous decisions in a distributed network through the use of advanced collaboration mechanisms. Moreover, because of the highly instable and dynamic environment of today's supply chains, planning agents must handle multiple problem solving approaches. This paper proposes a Multi-behavior planning agent model using different planning strategies when decisions are supported by a distributed planning system. The implementation of this solution is realized through the FOR@C experimental agent-based platform, dedicated to supply chain planning for the lumber industry.     

VPSPACE and a Transfer Theorem over the Reals

We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial space. Our main theorem is that if (uniform, constant-free) VPSPACE families can be evaluated efficiently then the class \sf PAR_{\mathbb R}\sf {PAR}_{\mathbb {R}} of decision problems that can be solved in parallel polynomial time over the real numbers collapses to \sfP_{\mathbb R}\sf{P}_{\mathbb {R}}. As a result, one must first be able to show that there are VPSPACE families which are hard to evaluate in order to separate \sfP_{\mathbb R}\sf{P}_{\mathbb {R}} from \sfNP_{\mathbb R}\sf{NP}_{\mathbb {R}}, or even from \sfPAR_{\mathbb R}\sf{PAR}_{\mathbb {R}}.     

Using I2P (Invisible Internet Protocol) Encrypted Virtual Tunnels for a Secure and Anonymous Communication in VANets: I2P Vehicular Protocol (IVP)

Wireless Personal Communications - The Invisible Internet Project (I2P) as a secure protocol uses robust mechanisms and strong algorithms to reinforce the security and the anonymity of the...     

Joint Estimation of Location and Scatter in Complex Elliptically Symmetric Distributions

The joint estimation of the location vector and the shape matrix of a set of independent and identically Complex Elliptically Symmetric (CES) distributed observations is investigated from both the theoretical and computational viewpoints. This joint estimation problem is framed in the original context of semiparametric models allowing us to handle the (generally unknown) density generator as an infinite-dimensional nuisance parameter. In the first part of the paper, a computationally efficient and memory saving implementation of the robust and semiparmaetric efficient R-estimator for shape matrices is derived. Building upon this result, in the second part, a joint estimator, relying on the Tyler’s M-estimator of location and on the R-estimator of shape matrix, is proposed and its Mean Squared Error (MSE) performance compared with the Semiparametric Cramér-Rao Bound (SCRB).

     

Polite Combination of Algebraic Datatypes

Journal of Automated Reasoning - Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its...     

Estimation of nonlinear systems via a Chebyshev approximation approach

This paper proposes to decompose the nonlinear dynamic of a chaotic system with Chebyshev polynomials to improve performances of its estimator. More widely than synchronization of chaotic systems, this algorithm is compared to other nonlinear stochastic estimator such as Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF). Chebyshev polynomials orthogonality properties is used to fit a polynomial to a nonlinear function. This polynomial is then used in an Exact Polynomial Kalman Filter (ExPKF) to run real time state estimation. The ExPKF offers mean square error optimality because it can estimate exact statistics of transformed variables through the polynomial function. Analytical expressions of those statistics are derived so as to lower ExPKF algorithm computation complexity and allow real time applications. Simulations under the Additive White Gaussian Noise (AWGN) hypothesis, show relevant performances of this algorithm compared to classical nonlinear estimators.