Improving virus protection with an efficient secure architecture with memory encryption, integrity and information leakage protection

Malicious software and other attacks are a major concern in the computing ecosystem and there is a need to go beyond the answers based on untrusted software. Trusted and secure computing can add a new hardware dimension to software protection. Several secure computing hardware architectures using memory encryption and memory integrity checkers have been proposed during the past few years to provide applications with a tamper resistant environment. Some solutions, such as HIDE, have also been proposed to solve the problem of information leakage on the address bus. We propose the CRYPTOPAGE architecture which implements memory encryption, memory integrity protection checking and information leakage protection together with a low performance penalty (3% slowdown on average) by combining the Counter Mode of operation, local authentication values and MERKLE trees. It has also several other security features such as attestation, secure storage for applications and program identification. We present some applications of the CRYPTOPAGE architecture in the computer virology field as a proof of concept of improving security in presence of viruses compared to software only solutions.     

Testing Planning Domains (without Model Checkers)

We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason in detail on "Unique First Cause" (UFC) coverage for test suites. We characterise flight rules using patterns, encoded using LTL, and we provide UFC coverage for them. We then present a translation of LTL formulae into planning goals, and illustrate our approach on a case study.     

Interactive global and local deformations for virtual clay

Making virtual modeling as easy and intuitive as real-clay manipulation is still an unsolved problem. This paper takes a step in this direction: in addition to offering standard features such as addition and removal of material, it uses a new real-time plasticity model to let the user apply local and global deformations such as those made in real clay by pressing with a finger or bending a sculpture with one hand. Although not completely physically accurate, the model exhibits several important features of real clay, namely plasticity, mass conservation, and surface tension effects. These features make the model intuitive, since the user obtains the shapes he expects, as demonstrated by our results.     

Expectation-maximization algorithms for inference in Dirichlet processes mixture

Mixture models are ubiquitous in applied science. In many real-world applications, the number of mixture components needs to be estimated from the data. A popular approach consists of using information criteria to perform model selection. Another approach which has become very popular over the past few years consists of using Dirichlet processes mixture (DPM) models. Both approaches are computationally intensive. The use of information criteria requires computing the maximum likelihood parameter estimates for each candidate model whereas DPM are usually trained using Markov chain Monte Carlo (MCMC) or variational Bayes (VB) methods. We propose here original batch and recursive expectation-maximization algorithms to estimate the parameters of DPM. The performance of our algorithms is demonstrated on several applications including image segmentation and image classification tasks. Our algorithms are computationally much more efficient than MCMC and VB and outperform VB on an example.     

Multi-angle remote sensing of forest light use efficiency by observing PRI variation with canopy shadow fraction

We show that observed co-variations at sub-hourly time scales between the photochemical reflectance index (PRI) and canopy light use efficiency (LUE) over a Douglas-fir forest result directly from sub-hourly leaf reflectance changes in a 531 nm spectral window roughly 50 nm wide. We conclude then, that over a forest stand we are observing the direct effects of photosynthetic down-regulation on leaf-level reflectance at 531 nm. Key to our conclusion is our ability to simultaneously measure the LUE and reflectance of the Douglas-fir stand as a function of shadow fraction from the “hot spot” to the "dark spot"dark spot” and a new finding herein, based on radiative transfer theory, that the magnitude of a normalized reflectance difference index (NDRI) such as PRI can vary with shadow fraction only in case the reflectance of the shaded and sunlit leaves differ in at least one of the NDRI bands.Our spectrometer measurements over a nearly 6 month period show that at a forest stand scale, only two NDRIs (both containing a band near 570 nm) vary with shadow fraction and are correlated with LUE; an NDRI with a band centered at 531 nm roughly 50 nm wide, and another near 705 nm. Therefore, we are able to conclude that only these two bands' reflectance differ between the sunlit and the shaded elements of the canopy. Their reflectance changes on time scales of a few minutes or less. Our observations also show that the reflectance changes at 531 nm are more highly correlated with variations in canopy light use efficiency when only sunlit canopy elements are viewed (the hot spot), than when only shaded elements (the dark spot) are viewed. Taken together then, these results demonstrate that the observed sub-hourly changes in foliage reflectance at 531 nm and 705 nm can only result from corresponding variations in photosynthetic rates.The importance of our results are as follows: (1) We show that variations in PRI with LUE are a direct result of rapid changes in foliage reflectance at 531 nm resulting from photosynthetic down-regulation, and can be observed at forest scales. (2) Our findings also suggest a new sensor and methodology for the direct retrieval from space of changes in forest LUE by measuring PRI as a function of shadow fraction using a multi-angle spectrometer simultaneously retrieving both shadow fraction and PRI.     

Loop Shifting for Loop Compaction

The idea of decomposed software pipelining is to decouple the software pipelining problem into a cyclic scheduling problem without resource constraints and an acyclic scheduling problem with resource constraints. In terms of loop transformation and code motion, the technique can be formulated as a combination of loop shifting and loop compaction. Loop shifting amounts to moving statements between iterations thereby changing some loop independent dependences into loop carried dependences and vice versa. Then, loop compaction schedules the body of the loop considering only loop independent dependences, but taking into account the details of the target architecture. In this paper, we show how loop shifting can be optimized so as to minimize both the length of the critical path and the number of dependences for loop compaction. The first problem is well-known and can be solved by an algorithm due to Leiserson and Saxe. We show that the second optimization (and the combination with the first one) is also polynomially solvable with a fast graph algorithm, variant of minimum-cost flow algorithms. Finally, we analyze the improvements obtained on loop compaction by experiments on random graphs.