Complex sochastic boolean systems : new properties of the intrinsic order graph

[EN]A complex stochastic Boolean system (CSBS) is a system depending on an arbitrary number n of stochastic Boolean variables. The analysis of CSBSs is mainly based on the intrinsic order: a partial order relation defined on the set f0; 1gn of binary n-tuples. The usual graphical representation for a CSBS is the intrinsic order graph: the Hasse diagram of the intrinsic order. In this paper, some new properties of the intrinsic order graph are studied. Particularly, the set and the number of its edges, the degree and neighbors of each vertex, as well as typical properties, such as the symmetry and fractal structure of this graph, are analyzed…

Intrinsic Order and Hamming Weight

[EN]The intrinsic order is a partial order relation defined on the set {0, 1} n of all binary n-tuples. This ordering enables one to automatically compare binary n-tuple probabilities without computing them, just looking at the relative positions of their 0s & 1s. In this paper, new relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. All theoretical results are rigorously proved and illustrated through the intrinsic order graph…

Wind ensamble forecasting using an adaptive mass-consistent model

[EN]Ensemble forecasting [1] is a methodology to deal with uncertainties in the numerical wind prediction. In this work we propose to apply ensemble methods to the adaptive wind forecasting model presented in [2]. The wind _eld forecasting is based on a mass-consistent model and a log-linear wind pro_le using as input data the resulting forecast wind from Harmonie [3], a Non-Hydrostatic Dynamic model. The mass-consistent model parameters are estimated by using genetic algorithms [4]. The mesh is generated using the meccano method [5] and adapted to the geometry. The main source of uncertainties in this model is the parameter estimation and the in- trinsic uncertainties of the Harmonie Model…

Advances on T-spline parameterization based on the meccano method

[EN]We have recently introduced a new strategy, based on the meccano method [1, 2], to construct a T-spline parameterization of 2D and 3D geometries for the application of iso geometric analysis [3, 4]. The proposed method only demands a boundary representation of the geometry as input data. The algorithm obtains, as a result, high quality parametric transformation between the objects and the parametric domain, i.e. the meccano. The key of the method lies in de_ning an isomorphic transformation between the parametric and physical T-mesh _nding the optimal position of the interior nodes, once the meccano boundary nodes are mapped to the boundary of the physical domain…

Tetrahedral mesh optimization combining boundary and inner node relocation and adaptive local refinement

[EN]This work introduces a new technique for tetrahedral mesh optimization. The procedure relocates boundary and inner nodes without changing the mesh topology. In order to maintain the boundary approximation while boundary nodes are moved, a local refinement of tetrahedra with faces on the solid boundary is necessary in some cases. New nodes are projected on the boundary by using a surface parameterization. In this work, the proposed method is applied to tetrahedral meshes of genus-zero solids that are generated by the meccano method. In this case, the solid boundary is automatically decomposed into six surface patches which are parameterized into the six faces of a cube with the Floater parameterization...

Adaptive Finite Element Method with a local element parametrization nested meses

[EN]This work presents a novel approach to solve a two dimensional problem by using an adaptive finite element approach. The most common strategy to deal with nested adaptivity is to generate a mesh that represents the geometry and the input parameters correctly, and to refine this mesh locally to obtain the most accurate solution. As opposed to this approach, the authors propose a technique using independent meshes : geometry, input data and the unknowns. Each particular mesh is obtained by a local nested refinement of the same coarse mesh at the parametric space…