RTM mould design and construction for a DN 50 PN 16 flansch

The objective of this project consists of designing and constructing a RTM mould for a loose flange of glass fibre reinforced plastic (GRP). The design phase has the mission to realise a quality and simple design of the RTM mould, with the objective to obtain an easy and economic phase of construction and the more possible great characteristics of the loose flange. In fact this RTM mould will be a mould prototype, which will be developed in the future to obtain an RTM mould able to support a loose flange production. Therefore when more steps are developed in this project, then the future objective will be near

Adaptive model selection using empirical complexities

Given $n$ independent replicates of a jointly distributed pair $(X,Y)\in {\cal R}^d \times {\cal R}$, we wish to select from a fixed sequence of model classes ${\cal F}_1, {\cal F}_2, \ldots$ a deterministic prediction rule $f: {\cal R}^d \to {\cal R}$ whose risk is small. We investigate the possibility of empirically assessingthe {\em complexity} of each model class, that is, the actual difficulty of the estimation problem within each class. The estimated complexities are in turn used to define an adaptive model selection procedure, which is based on complexity penalized empirical risk.The available data are divided into two parts. The first is used to form an empirical cover of each model class, and the second is used to select a candidate rule from each cover based on empirical risk. The covering radii are determined empirically to optimize a tight upper bound on the estimation error. An estimate is chosen from the list of candidates in order to minimize the sum of class complexity and empirical risk. A distinguishing feature of the approach is that the complexity of each model class is assessed empirically, based on the size of its empirical cover.Finite sample performance bounds are established for the estimates, and these bounds are applied to several non-parametric estimation problems. The estimates are shown to achieve a favorable tradeoff between approximation and estimation error, and to perform as well as if the distribution-dependent complexities of the model classes were known beforehand. In addition, it is shown that the estimate can be consistent,and even possess near optimal rates of convergence, when each model class has an infinite VC or pseudo dimension.For regression estimation with squared loss we modify our estimate to achieve a faster rate of convergence.

Hysteresis and avalanches in the random anisotropy Ising model

ches. The critical point is characterized by a set of critical exponents, which are consistent with the universal values proposed from the study of other simpler models.

Hysteresis and avalanches in the T=0 random field ising model with 2-spin flip dynamics

We study the nonequilibrium behavior of the three-dimensional Gaussian random-field Ising model at T=0 in the presence of a uniform external field using a two-spin-flip dynamics. The deterministic, history-dependent evolution of the system is compared with the one obtained with the standard one-spin-flip dynamics used in previous studies of the model. The change in the dynamics yields a significant suppression of coercivity, but the distribution of avalanches (in number and size) stays remarkably similar, except for the largest ones that are responsible for the jump in the saturation magnetization curve at low disorder in the thermodynamic limit. By performing a finite-size scaling study, we find strong evidence that the change in the dynamics does not modify the universality class of the disorder-induced phase transition.

Self construction, cognitive conflicts and polarization in bulimia nervosa

This study explores the cognitive structures, understood as construct systems, of patients suffering from bulimia nervosa (BN). Previous studies investigated the construct systems of disordered eaters suggesting that they had a higher distance between their construction of the self and the «ideal self», and also more rigidity. In addition to these aspects, this study explored the presence of implicative dilemmas (ID). Thirty two women who met criteria for BN and were treated in a specialized center were compared to a non clinical group composed by 32 women matched by age. All participants were assessed using Repertory Grid Technique (RGT). In BN patients it was more common (71.9%) to find IDs than in controls (18.8%). They also showed higher polarization and higher self-ideal discrepancies (even more for those with a long history of BN). The measures provided by the RGT can be useful for the assessment of self-construction and cognitive conflicts in BN patients and to appreciate their role in this disorder. In addition, this technique could be helpful for clinicians to explore the patient"s constructs system, and specially to identify IDs that could be maintaining the symptoms or hindering change in order to focus on them to facilitate improvement.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.