Carcinoma of the splenic flexure. Nosological and therapeutic contribution

Twenty-one patients undergoing colectomy for carcinoma of the splenic flexure from November 1996 throughout October 1993 were studied retrospectively. Clinical and prognostic features were compared with those of other colon cancers treated in the same period at the same Institution. No differences in symptoms at onset and stage distribution were found in the two groups. The complex removal of the cancer tissue was achieved with the resection of the major part of the transverse colon, splenic flexure, descending colon and its mesocolon. The splenic flexure cancer did not show a worse prognosis than other colon cancers.     

2-Layer Right Angle Crossing Drawings

A 2-layer drawing represents a bipartite graph where each vertex is a point on one of two parallel lines, no two vertices on the same line are adjacent, and the edges are straight-line segments. In this paper we study 2-layer drawings where any two crossing edges meet at right angle. We characterize the graphs that admit this type of drawing, provide linear-time testing and embedding algorithms, and present a polynomial-time crossing minimization technique. Also, for a given graph G and a constant k, we prove that it is $\mathcal{NP}$ -complete to decide whether G contains a subgraph of at least k edges having a 2-layer drawing with right angle crossings.     

Catalytic performance of Co3O4/CeO2 and Co3O4/CeO2–ZrO2 composite oxides for methane combustion: Influence of catalyst pretreatment temperature and oxygen concentration in the reaction mixture

The influence of catalyst pre-treatment temperature (650 and 750 °C) and oxygen concentration (λ = 8 and 1) on the light-off temperature of methane combustion has been investigated over two composite oxides, Co₃O₄/CeO₂ and Co₃O₄/CeO₂–ZrO₂ containing 30 wt.% of Co₃O₄. The catalytic materials prepared by the co-precipitation method were calcined at 650 °C for 5 h (fresh samples); a portion of them was further treated at 750 °C for 7 h, in a furnace in static air (aged samples).

Tests of methane combustion were carried out on fresh and aged catalysts at two different WHSV values (12 000 and 60 000 mL g⁻¹ h⁻¹). The catalytic performance of Co₃O₄/CeO₂ and Co₃O₄/CeO₂–ZrO₂ were compared with those of two pure Co₃O₄ oxides, a sample obtained by the precipitation method and a commercial reference. Characterization studies by X-ray diffraction (XRD), BET and temperature-programmed reduction (TPR) show that the catalytic activity is related to the dispersion of crystalline phases, Co₃O₄/CeO₂ and Co₃O₄/CeO₂–ZrO₂ as well as to their reducibility. Particular attention was paid to the thermal stability of the Co₃O₄ phase in the temperature range of 750–800 °C, in both static (in a furnace) and dynamic conditions (continuous flow). The results indicate that the thermal stability of the phase Co₃O₄ heated up to 800 °C depends on the size of the cobalt oxide crystallites (fresh or aged samples) and on the oxygen content (excess λ = 8, stoichiometric λ = 1) in the reaction mixture. A stabilizing effect due to the presence of ceria or ceria–zirconia against Co₃O₄ decomposition into CoO was observed.

Moreover, the role of ceria and ceria–zirconia is to maintain a good combustion activity of the cobalt composite oxides by dispersing the active phase Co₃O₄ and by promoting the reduction at low temperature.     

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.     

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.     

Open Source Mobile VPNs over Converged All-IP Networks

Virtual Private Networks (VPNs) are normally used for secured communications over the Internet. The VPNs have evolved significantly over the years, leading to a range of open-source and proprietary solutions. In Converged, all-IP networks terminal mobility introduces, however, new challenges that have so far been addressed only partially and via proprietary solutions. In this article we assess the level of maturity, the viability and performance achieved in mobile VPNs, based merely on open-source software. Our prototype MVPN is obtained by integrating IPv6, Mobile IPv6 and IPsec, i.e., the protocols that 3GPP envisions for all-IP, mobile and fixed networks. We perform a series of tests on a multi-access wireless network (WLAN, GPRS and UMTS), aimed at identifying the issues arising when mobility management (vertical and horizontal handover) is combined with different levels of network security. Tests led to the discovery of various results such as the flushing of routing tables in MIPv6 during handover. Our performance analysis is complemented with lessons learnt and recommendations.