Fast switching anisotropic networks obtained by in situ photopolymerization of liquid crystal molecules

Lightly cross-linked anisotropic networks with uniaxial and π/2 twisted orientations were produced by photopolymerization of monotropic mixtures containing liquid crystal mono and diacrylates. In this way the polymer backbone was immobilized and became decoupled from the motion of the mesogenic side groups. The networks showed very good reversibility and even after becoming isotropic, upon cooling, the initial orientation was recovered. In the same way, in the presence of electric fields the mesogenic groups could be reoriented in the direction of the electric field, reverting back to the initial orientation on removal of the field at a rate comparable with those observed in the monomeric state. Combining viscoelastic measurements with the dielectric behaviour of the monomeric liquid crystal and the anisotropic network, a comparison between the internal and bulk rotational viscosities was also made.     

On the linear relaxation of a one-dimensional bonded fluid model

The linear relaxation of a one-dimensional bonded fluid model is studied in the dynamical mean field approximation at the pair level. The results are compared with simulation data. Relaxation at low temperatures shows a cooperative character that can be understood in terms of a simple diffusion picture.     

Parametric linear programming techniques for the indefnite quadratic programming problem

In this paper, we discuss a multiparametric technique for findinga global minimum for an indefinite quadratic programming problembased on the spectral decomposition of the matrix of the quadraticform. Special attention is given to the case where this matrixhas only rank 1, where the multiparametric linear program turnsout to be a single-parameter linear program. An extension ofthe traditional linear parametric procedure is introduced whichin general solves this problem efficiently. However, an exampleis presented showing that this technique may take an exponentialnumber of steps.     

Optimal repair-cost limit for a consumer following expiry of a warranty

This paper develops a methodology for obtaining the optimalrepair-cost limit for the repair-replace decision that a consumerfaces on the expiry of a product warranty, where the producthas been minimally repaired on failure during the warranty.Three cases are considered; (i) an exponentially distributedtime to failure with an arbitrary repair-cost distribution,(ii) an exponentially distributed time to failure with a uniformrepair-cost distribution, and (iii) a Weibull-distributed timeto failure with a beta-distributed repair cost. Numerical optimizationsare performed for the third case, and conclusions drawn as tothe sensitivity of the optimal repair-cost limit on the parametervalues of the distributions involved.     

RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES

We show a faithful restriction theorem among infinite chains which implies a reconstructibility conjecture of Halin. This incite us to study the reconstructibility in the sense of Fraïssé and to prove it for orders of cardinality infinite or ≥ 3 and for multirelations of cardinality infinite or ≥ 7, what improves the theory obtained by G. Lopez in the finite case. For this work we had to study the infinite classes of difference which have to be a linear order of type ω, ω* or ω* + ω; this complete the theory made by G. Lopez for the finite case ([13]). We show also Ulam-reconstructibility for linear orders which have a fixed point.     

The automatic conversion of spinor equations to dyad form in MAPLE

A new package in the symbolic algebra system MAPLE is presented for the conversion of complicated spinor equations to their expansions with respect to a normalized spinor dyad. By following a simple index convention, we obtain a powerful computational tool with a straightforward and easy to use syntax. A number of examples, including nontrivial applications of the package to recent research, are provided.     

Temperature dependence of magnetization in nanocrystalline FeCoZr alloy

The temperature dependence of magnetization of a nanocrystalline Fe₆₀Co₃₀Zr₁₀ alloy annealed at various temperatures to varying crystal sizes was investigated down to 5 K in the field range up to 5 T. The fitting procedure gave T^3/2 as the leading term irrespective of the crystal size. We suggest that the increase of the coefficient by this term for smaller crystals may be connected to an increased relative volume of their surface.     

The use of sulfide cluster-derived catalysts to understand the promotional effect in hydrotreatment catalysis

Sulfide cluster-derived ensembles are promising models of the active sites in commercial hydrotreatment catalysts. A series of sulfide clusters were adsorbed intact onto high-surface-area γ-alumina, magnesium oxide and activated carbon supports, then pretreated to produce highly dispersed catalytic ensembles with sizes similar to those of their precursor clusters. The activities of the bimetallic cluster-derived catalysts were significantly higher than those of the monometallic catalysts. We took this as evidence that direct interactions between molybdenum and the promoter element cause the promotional effect observed in commercial hydrotreatment catalysts. The hydrodesulfurization and hydrodenitrogenation activities correlated with the extent of molybdenum reduction. Our results suggested that the active sites in promoted hydrotreatment catalysts are centered on molecular-scale ensembles containing molybdenum, sulfur and the promoter element.     

Neighborhood unions and the cycle cover number of a graph

For several years, the study of neighborhood unions of graphs has given rise to important structural consequences of graphs. In particular, neighborhood conditions that give rise to hamiltonian cycles have been considered in depth. In this paper we generalize these approaches to give a bound on the smallest number of cycles in G containing all the vertices of G. We show that if for all x, y ? V(G), |N(x) ∩ N(y)| ≧ 2n/5 + 1, then V(G) is coverable by at most two cycles. Several related results and extensions to t cycles are also given.