Search results for "Data type"
showing 10 items of 1183 documents
A new constructive method using the theory of invariants to obtain material behavior laws
2006
International audience; The aim of this paper is to present a constructive method to derive mechanical behavior laws using the Theory of Invariants and Continuum Thermodynamics. More precisely, we want to construct, in a general way, the state or dissipation potential in a polynomial form given a set of variables V and the material symmetry group S. For this purpose, we show how to obtain a set of generators for the S-invariant polynomials of V. Then, using the Grœbner basis concept, we write all the decompositions of a polynomial of a given degree.
Blenders near polynomial product maps of $\mathbb C^2$
2021
In this paper we show that if $p$ is a polynomial which bifurcates then the product map $(z,w)\mapsto(p(z),q(w))$ can be approximated by polynomial skew products possessing special dynamical objets called blenders. Moreover, these objets can be chosen to be of two types : repelling or saddle. As a consequence, such product map belongs to the closure of the interior of two different sets : the bifurcation locus of $H_d(\mathbb P^2)$ and the set of endomorphisms having an attracting set of non-empty interior. In an independent part, we use perturbations of H\'enon maps to obtain examples of attracting sets with repelling points and also of quasi-attractors which are not attracting sets.
A New Set of Quartic Trivariate Polynomial Equations for Stratified Camera Self-calibration under Zero-Skew and Constant Parameters Assumptions
2012
This paper deals with the problem of self-calibrating a moving camera with constant parameters. We propose a new set of quartic trivariate polynomial equations in the unknown coordinates of the plane at infinity derived under the no-skew assumption. Our new equations allow to further enforce the constancy of the principal point across all images while retrieving the plane at infinity. Six such polynomials, four of which are independent, are obtained for each triplet of images. The proposed equations can be solved along with the so-called modulus constraints and allow to improve the performance of existing methods.
New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
2011
[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the vehicles. In a previous paper, an ILP formulation and a partial polyhedral study were presented, and a preliminary branch-and-cut algorithm that produced some promising computational results was implemented. In this article, we present further results for this problem. We describe several new facet-inducing inequalities obtained from the WRPP, as well as some inequalities that have to be satisfied by any optimal solution. We present an enhanced branch-and-cut algorithm that t…
Empirical and theoretical study of atelostomate (Echinoidea, Echinodermata) plate architecture: using graph analysis to reveal structural constraints.
2015
AbstractDescribing patterns of connectivity among organs is essential for identifying anatomical homologies among taxa. It is also critical for revealing morphogenetic processes and the associated constraints that control the morphological diversification of clades. This is particularly relevant for studies of organisms with skeletons made of discrete elements such as arthropods, vertebrates, and echinoderms. Nonetheless, relatively few studies devoted to morphological disparity have considered connectivity patterns as a level of morphological organization or developed comparative frameworks with proper tools. Here, we analyze connectivity patterns among apical plates in Atelostomata, the m…
Design of a Battery/Ultracapacitor Energy Storage System for Electric Vehicle Applications
2018
The battery/ultracapacitors (UCs) integration is able to provide notable advantages in the power management of an electric vehicle (EV), in terms of capability of both high energy storage and readiness to deal with fast load variations. In order to manage the charge (or discharge) of the UCs from (or towards) a DC voltage bus, a proper bi-directional converter is required. In this paper, a bi-directional DC-DC converter in connection with a stack of UCs is described and some power simulation results are provided. The proposed converter is a B2R (buck-boost regulator) type. The load is represented by a 40kW peak power, kept for a time window of 3s, as required by the Worldwide harmonized Lig…
Zeros of {-1,0,1}-power series and connectedness loci for self-affine sets
2006
We consider the set W of double zeros in (0,1) for power series with coefficients in {-1,0,1}. We prove that W is disconnected, and estimate the minimum of W with high accuracy. We also show that [2^(-1/2)-e,1) is contained in W for some small, but explicit e>0 (this was only known for e=0). These results have applications in the study of infinite Bernoulli convolutions and connectedness properties of self-affine fractals.
Process specification and verification
1996
Graph grammars provide a very convenient specification tool for distributed systems of processes. This paper addresses the problem how properties of such specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.
From Requirements to Code in a Model Driven Way
2010
Though there is a lot of support for model driven development the support for complete model driven path from requirements to code is limited. The approach proposed in this paper offers such a path which is fully supported by model transformations. The starting point is semiformal requirements containing behaviour description in a controlled natural language. A chain of models is proposed including analysis, platform independent and platform specific models. A particular architecture style is chosen by means of selecting a set of appropriate design patterns for these models. It is shown how to define informally and then implement in model transformation language MOLA the required transforma…