Estimating the altitude of aerosol plumes over the ocean from reflectance ratio measurements in the O2 A-band

A methodology is proposed to infer the altitude of aerosol plumes over the ocean from reflectance ratio measurements in the O₂ absorption A-band (759 to 770 nm). The reflectance ratio is defined as the ratio of the reflectance in a first spectral band, strongly attenuated by O₂ absorption, and the reflectance in a second spectral band, minimally attenuated. For a given surface reflectance, simple relations are established between the reflectance ratio and the altitude of an aerosol layer, as a function of atmospheric conditions and the geometry of observation. The expected accuracy for various aerosol loadings and models is first quantified using an accurate, high spectral resolution, radiative transfer model that fully accounts for interactions between scattering and absorption. The method is developed for POLDER and MERIS, satellite sensors with adequate spectral characteristics. The simulations show that the method is only accurate over dark surfaces when aerosol optical thickness at 765 nm is relatively large (> 0.3). In this case, the expected accuracy is on the order of ± 0.5 km or ± 0.2 km for POLDER or MERIS respectively. More accurate estimates are obtained with MERIS, since in this case the spectral reflectance ratio is more sensitive to aerosol altitude. However, a precise spectral calibration is needed for MERIS. The methodology is applied to MERIS and POLDER imagery acquired over marine surfaces. The estimated aerosol altitude is compared with in situ lidar profiles of backscattering coefficient measured during the AOPEX-2004 experiment for MERIS, or obtained with the space-borne lidar CALIOP for POLDER. The retrieved altitudes agree with lidar measurements in a manner consistent with theory. These comparisons demonstrate the potential of the differential absorption methodology for obtaining information on aerosol altitude over dark surfaces.     

Platform‐independent profiling in a virtual execution environment

Virtual execution environments, such as the Java virtual machine, promote platform‐independent software development. However, when it comes to analyzing algorithm complexity and performance bottlenecks, available tools focus on platform‐specific metrics, such as the CPU time consumption on a particular system. Other drawbacks of many prevailing profiling tools are high overhead, significant measurement perturbation, as well as reduced portability of profiling tools, which are often implemented in platform‐dependent native code. This article presents a novel profiling approach, which is entirely based on program transformation techniques, in order to build a profiling data structure that provides calling‐context‐sensitive program execution statistics. We explore the use of platform‐independent profiling metrics in order to make the instrumentation entirely portable and to generate reproducible profiles. We implemented these ideas within a Java‐based profiling tool called JP. A significant novelty is that this tool achieves complete bytecode coverage by statically instrumenting the core runtime libraries and dynamically instrumenting the rest of the code. JP provides a small and flexible API to write customized profiling agents in pure Java, which are periodically activated to process the collected profiling information. Performance measurements point out that, despite the presence of dynamic instrumentation, JP causes significantly less overhead than a prevailing tool for the profiling of Java code. Copyright © 2008 John Wiley & Sons, Ltd.     

Proofs of randomized algorithms in Coq

Randomized algorithms are widely used for finding efficiently approximated solutions to complex problems, for instance primality testing and for obtaining good average behavior. Proving properties of such algorithms requires subtle reasoning both on algorithmic and probabilistic aspects of programs. Thus, providing tools for the mechanization of reasoning is an important issue. This paper presents a new method for proving properties of randomized algorithms in a proof assistant based on higher-order logic. It is based on the monadic interpretation of randomized programs as probabilistic distributions (Giry, Ramsey and Pfeffer). It does not require the definition of an operational semantics for the language nor the development of a complex formalization of measure theory. Instead it uses functional and algebraic properties of unit interval. Using this model, we show the validity of general rules for estimating the probability for a randomized algorithm to satisfy specified properties. This approach addresses only discrete distributions and gives rules for analyzing general recursive functions.We apply this theory to the formal proof of a program implementing a Bernoulli distribution from a coin flip and to the (partial) termination of several programs. All the theories and results presented in this paper have been fully formalized and proved in the Coq proof assistant.     

Parallel Lattice Boltzmann Method with Blocked Partitioning

This paper presents and discusses a blocked parallel implementation of bi- and three-dimensional versions of the Lattice Boltzmann Method. This method is used to represent and simulate fluid flows following a mesoscopic approach. Most traditional parallel implementations use simple data distribution strategies to parallelize the operations on the regular fluid data set. However, it is well known that block partitioning is usually better. Such a parallel implementation is discussed and its communication cost is established. Fluid flows simulations crossing a cavity have also been used as a real-world case study to evaluate our implementation. The presented results with our blocked implementation achieve a performance up to 31% better than non-blocked versions, for some data distributions. Thus, this work shows that blocked, parallel implementations can be efficiently used to reduce the parallel execution time of the method.     

Polymorphic bytecode instrumentation

Bytecode instrumentation is a widely used technique to implement aspect weaving and dynamic analyses in virtual machines such as the Java virtual machine. Aspect weavers and other instrumentations are usually developed independently and combining them often requires significant engineering effort, if at all possible. In this article, we present polymorphic bytecode instrumentation(PBI), a simple but effective technique that allows dynamic dispatch amongst several, possibly independent instrumentations. PBI enables complete bytecode coverage, that is, any method with a bytecode representation can be instrumented. We illustrate further benefits of PBI with three case studies. First, we describe how PBI can be used to implement a comprehensive profiler of inter‐procedural and intra‐procedural control flow. Second, we provide an implementation of execution levels for AspectJ, which avoids infinite regression and unwanted interference between aspects. Third, we present a framework for adaptive dynamic analysis, where the analysis to be performed can be changed at runtime by the user. We assess the overhead introduced by PBI and provide thorough performance evaluations of PBI in all three case studies. We show that pure Java profilers like JP2 can, thanks to PBI, produce accurate execution profiles by covering all code, including the core Java libraries. We then demonstrate that PBI‐based execution levels are much faster than control flow pointcuts to avoid interference between aspects and that their efficient integration in a practical aspect language is possible. Finally, we report that PBI enables adaptive dynamic analysis tools that are more reactive to user inputs than existing tools that rely on dynamic aspect‐oriented programming with runtime weaving. These experiments position PBI as a widely applicable and practical approach for combining bytecode instrumentations. © 2015 The Authors. Software: Practice and Experience Published by John Wiley & Sons Ltd.     

Development of a 3D HUD using a tunable bandpass filter for wavelength multiplexing

A 3D stereoscopic head‐up display using a tunable bandpass filter to perform left and right image spectral separation is presented. Using a single filter reduces the size and the cost of the head‐up display optical engine and enables each spectral band to be accurately tuned. Experiments performed on the first prototype demonstrate the ability to continuously tune the bandpass frequency on 30‐nm range while keeping a 20‐nm bandwidth. Such a system avoids the use of a bulky and costly rotating wheel and enables the use of holographic optical elements known to be wavelength selective.     

Road‐Centered Map‐Aided Localization for Driverless Cars Using Single‐Frequency GNSS Receivers

Accurate localization with high availability is a key requirement for autonomous vehicles. It remains a major challenge when using automotive sensors such as single‐frequency Global Navigation Satellite System (GNSS) receivers, a lane detection camera, and proprioceptive sensors. This paper describes a method that enables the estimation of stand‐alone single‐frequency GNSS errors by integrating the measurements from a forward‐looking camera matched with lane markings stored in a digital map. It includes a parameter identification method for a shaping model, which is evaluated using experimental data. An algebraic observability study is then conducted to prove that the proposed state vector is fully observable in a road‐oriented frame. This observability property is the basis to develop a road‐centered Extended Kalman filter (EKF) that can maintain the observability of every component of the state vector on any road, whatever its orientation. To accomplish this, the filter needs to handle road changes, which it does using bijective transformations. The filter was implemented and tested intensely on an experimental vehicle for driverless valet parking services. Field results have shown that the performance of the estimation process is better than solutions based on EKF implemented in a fixed working frame. The proposed filter guarantees that the drift along the road direction remains bounded. This is very important when the vehicle navigates autonomously. Furthermore, the road‐centered modeling improves the accuracy, consistency, and robustness of the localization solver.     

Dynamic Control of Walking Cycle with Initiation Process for Humanoid Robot

This paper focuses on numerical method to solve the dynamic equilibrium of a humanoid robot during the walking cycle with the gait initiation process. It is based on a multi-chain strategy and a dynamic control/command architecture previously developed by Gorce. The strategy is based on correction of the trunk center of mass acceleration and force distribution of the forces exerced by the limbs on the trunk. This latter is performed by mean of a Linear Programming (LP) method. We study the gait initiation process when a subject, initially in quiet erect stance posture, performs a walking cycle. In this paper, we propose to adjust the method for the multiphases (from double support to single support) and multicriteria features of the studied movement. This is done by adapting some specific constraints and criteria in order to ensure the global stability of the humanoid robot along the task execution. For that, we use a Real-Time Criteria and Constraints Adaptation method. Simulation results are presented to demonstrate criteria and constraints influences on the dynamic stability.     

Dialogue in context, towards a referential approach in collective learning

In this article, we present research in the making of a collective work environment within the framework of a distance education course. We base our theoretical and methodological standpoints on examples of dialogical discourses recorded within the framework of this CSCL system called Symba. In fact, the results of previous research lead us to rethink our vision of the study of collaborative moments between participants in a computer-supported human learning environment that proposes several communication tools. Redefining the methodological process aiming at finding and understanding these rich learning moments is also necessary. We intend to describe “socio-technical” instances during which these collaboration phases appear. More generally speaking, our aim is to draw up both new theoretical and methodological perspectives that would be reusable in CSCL environments; in view of the nature of these two perspectives, and the diversity of the domain knowledge (sociology, cognitivism, linguistics, philosophy, statistics, etc.) brought to bear in the study of the environment in question, our approach constitutes a trans-disciplinary reassessment of the uses of the communication tools—and the study thereof—proposed.

Misfit versus latency

In this paper we present a framework that combines some ideas of the behavioral modeling approach and the prediction error modeling approach. It is shown that the proposed model selection procedure can be rephrased as an optimization problem that only depends on the model parameters. Experiments illustrate the potential of the so-called misfit versus latency framework.