Catalytic Combustion of Model Carbon Particles (CPs) over Pt/β-SiC Catalyst

Platinum catalyst supported on a medium surface area -SiC was successfully used for the catalytic combustion of model carbon particles and compared to a catalyst supported on a low surface area -SiC. The -SiC-based catalyst showed no deactivation as a function of cycling tests while a strong deactivation was observed on the -SiC-based catalyst. This deactivation was attributed to the progressive encapsulation of the platinum particles by a layer of silica which built up during the combustion cycle. These results render possible the use of Pt/-SiC catalyst as a diesel carbon particle catalytic filter with continuous regeneration.     

Terrain Modelling from Feature Primitives

We introduce a compact hierarchical procedural model that combines feature‐based primitives to describe complex terrains with varying level of detail. Our model is inspired by skeletal implicit surfaces and defines the terrain elevation function by using a construction tree. Leaves represent terrain features and they are generic parametrized skeletal primitives, such as mountains, ridges, valleys, rivers, lakes or roads. Inner nodes combine the leaves and subtrees by carving, blending or warping operators. The elevation of the terrain at a given point is evaluated by traversing the tree and by combining the contributions of the primitives. The definition of the tree leaves and operators guarantees that the resulting elevation function is Lipschitz, which speeds up the sphere tracing used to render the terrain. Our model is compact and allows for the creation of large terrains with a high level o detail using a reduced set of primitives. We show the creation of different kinds of landscapes and demonstrate that our model allows to efficiently control the shape and distribution of landform features.     

Modular Composition Modulo Triangular Sets and Applications

We generalize Kedlaya and Umans’ modular composition algorithm to the multivariate case. As a main application, we give fast algorithms for many operations involving triangular sets (over a finite field), such as modular multiplication, inversion, or change of order. For the first time, we are able to exhibit running times for these operations that are almost linear, without any overhead exponential in the number of variables. As a further application, we show that, from the complexity viewpoint, Charlap, Coley, and Robbins’ approach to elliptic curve point counting can be competitive with the better known approach due to Elkies.     

On the necessity of explicit cross-layer data formats in near-data processing systems

Distributed and Parallel Databases - Massive data transfers in modern data-intensive systems resulting from low data-locality and data-to-code system design hurt their performance and scalability....     

Flow modeling of linear and nonlinear fluids in two scale fibrous fabrics

The fundamental macroscopic material property needed to quantify the flow in a fibrous medium viewed as a porous medium is the permeability. Composite processing models require the permeability as input data to predict flow patterns and pressure fields. As permeability reflects both the magnitude and anisotropy of the fluid/fiber resistance, efficient numerical techniques are needed to solve linear and nonlinear homogenization problems online during the flow simulation. In a previous work the expressions of macroscopic permeability were derived in a double-scale porosity medium for both Newtonian and rheo-thinning resins. In the linear case only a microscopic calculation on a representative volume is required, implying as many microscopic calculations as representative microscopic volumes exist in the whole fibrous structure. In the non-linear case, and even when the porous microstructure can be described by a unique representative volume, microscopic calculation must be carried out many times because the microscale resin viscosity depends on the macroscopic velocity, which in turn depends on the permeability that results from a microscopic calculation. Thus, a nonlinear multi-scale problem results. In this paper an original and efficient offline-online procedure is proposed for the efficient solution of nonlinear flow problems in porous media.     

Vademecum‐based GFEM (V‐GFEM): optimal enrichment for transient problems

This paper proposes a generalized finite element method based on the use of parametric solutions as enrichment functions. These parametric solutions are precomputed off‐line and stored in memory in the form of a computational vademecum so that they can be used on‐line with negligible cost. This renders a more efficient computational method than traditional finite element methods at performing simulations of processes. One key issue of the proposed method is the efficient computation of the parametric enrichments. These are computed and efficiently stored in memory by employing proper generalized decompositions. Although the presented method can be broadly applied, it is particularly well suited in manufacturing processes involving localized physics that depend on many parameters, such as welding. After introducing the vademecum‐generalized finite element method formulation, we present some numerical examples related to the simulation of thermal models encountered in welding processes. Copyright © 2016 John Wiley & Sons, Ltd.     

Multi-contact vertical ladder climbing with an HRP-2 humanoid

We describe the research and the integration methods we developed to make the HRP-2 humanoid robot climb vertical industrial-norm ladders. We use our multi-contact planner and multi-objective closed-loop control formulated as a QP (quadratic program). First, a set of contacts to climb the ladder is planned off-line (automatically or by the user). These contacts are provided as an input for a finite state machine. The latter builds supplementary tasks that account for geometric uncertainties and specific grasps procedures to be added to the QP controller. The latter provides instant desired states in terms of joint accelerations and contact forces to be tracked by the embedded low-level motor controllers. Our trials revealed that hardware changes are necessary, and parts of software must be made more robust. Yet, we confirmed that HRP-2 has the kinematic and power capabilities to climb real industrial ladders, such as those found in nuclear power plants and large scale manufacturing factories (e.g. aircraft, shipyard) and construction sites.     

Computing monodromy via continuation methods on random Riemann surfaces

We consider a Riemann surface X defined by a polynomial f(x,y) of degree d, whose coefficients are chosen randomly. Hence, we can suppose that X is smooth, that the discriminant δ(x) of f has d(d−1) simple roots, Δ, and that δ(0)≠0, i.e. the corresponding fiber has d distinct points {y₁,…,y_d}. When we lift a loop 0∈γ⊂C−Δ by a continuation method, we get d paths in X connecting {y₁,…,y_d}, hence defining a permutation of that set. This is called monodromy.Here we present experimentations in Maple to get statistics on the distribution of transpositions corresponding to loops around each point of Δ. Multiplying families of “neighbor” transpositions, we construct permutations and the subgroups of the symmetric group they generate. This allows us to establish and study experimentally two conjectures on the distribution of these transpositions and on transitivity of the generated subgroups.Assuming that these two conjectures are true, we develop tools allowing fast probabilistic algorithms for absolute multivariate polynomial factorization, under the hypothesis that the factors behave like random polynomials whose coefficients follow uniform distributions.     

Good reduction of Puiseux series and applications

We have designed a new symbolic-numeric strategy for computing efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well-chosen prime number p are used to obtain the exact information needed to guide floating point computations. In this paper, we detail the symbolic part of our algorithm. First of all, we study modular reduction of Puiseux series and give a good reduction criterion for ensuring that the information required by the numerical part is preserved. To establish our results, we introduce a simple modification of classical Newton polygons, that we call “generic Newton polygons”, which turns out to be very convenient. Finally, we estimate the size of good primes obtained with deterministic and probabilistic strategies. Some of these results were announced without proof at ISSAC’08.