Kinetics and mechanism of the formation of poly[(1,1,3,3-tetramethyldisiloxanyl)ethylene] and poly(methyldecylsiloxane) by hydrosilylation

The kinetics of the formation of poly(carbosiloxane), as well as of alkyl-substituted poly(siloxane), by Karstedt's catalyst catalyzed hydrosilylation were investigated. Linear poly(carbosiloxane), poly[(1,1,3,3-tetramethyldisiloxanyl)ethylene], (PTMDSE), was obtained by hydrosilylation of 1,3-divinyltetramethyldisiloxane (DVTMDS) and 1,1,3,3-tetramethyldisiloxane (TMDS), while alkyl-substituted poly(siloxane), poly(methyldecylsiloxane), (PMDS), was synthesized by hydrosilylation of poly(methylhydrosiloxane) (PMHS) and 1-decene. To investigate the kinetics of PTMDSE formation, two series of experiments were performed at reaction temperatures ranging from 25 to 56 °C and with catalyst concentrations ranging from 7.0 × 10⁻⁶ to 3.1 × 10⁻⁵ mol Pt/mol CHCH₂. A series of experiments was performed at reaction temperatures ranging from 28 to 48 °C, with catalyst concentrations of 7.0 ×10⁻⁶ mol of Pt per mol of CHCH₂, when kinetics of PMDS formation was investigated. All reactions were carried out in bulk, with equimolar amounts of the reacting Si H and CHCH₂ groups. The course of the reactions was monitored by following the disappearance of the Si H bands using quantitative infrared spectroscopy. The results obtained showed typical first order kinetics for the PTMDSE formation, consistent with the proposed reaction mechanism. In the case of PMDS an induction period occurred at lower reaction temperatures, but disappeared at 44 °C and the rate of Si H conversion also started to follow the first-order kinetics. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 2246–2258, 2007     

A rigid graph for every set

A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002     

Solution of the hyperbolic mild‐slope equation using the finite volume method

A finite volume solver for the 2D depth‐integrated harmonic hyperbolic formulation of the mild‐slope equation for wave propagation is presented and discussed. The solver is implemented on unstructured triangular meshes and the solution methodology is based upon a Godunov‐type second‐order finite volume scheme, whereby the numerical fluxes are computed using Roe's flux function. The eigensystem of the mild‐slope equations is derived and used for the construction of Roe's matrix. A formulation that updates the unknown variables in time implicitly is presented, which produces a more accurate and reliable scheme than hitherto available. Boundary conditions for different types of boundaries are also derived. The agreement of the computed results with analytical results for a range of wave propagation/transformation problems is very good, and the model is found to be virtually paraxiality‐free. Copyright © 2003 John Wiley & Sons, Ltd.     

A Ramsey‐type result for the hypercube

We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Q_n with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Q_n contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

A generalized Adadorov theory for anisotropic thin-walled beams

This paper presents a generalized Adadorov theory for anisotropic thin—walled beams. The theory takes account of the shear strain of the middle surface, which exerts a significant influence on the anisotropic thin-walled beams. A new approach is established to solve the governing equations, which have the same form for both open and closed section beams. The numerical examples show that the effects of the shear strain cannot be neglected for this class of beams.This work was part of research project supported by the National Natural Science Foundation of China     

A simple four-node quadrilateral finite element for plates

A simple and accurate four-node quadrilateral finite element based on the Mindlin plate theory and Kirchhoff constraints is presented for general thin plate bending applications. The derivation of the element stiffness properties is straightforward, starting with a specified eight-node interpolation; usual discrete Kirchhoff (DK) constraints are employed to constrain out the four midside nodes of the element. The present resulting DK element passes patch tests with elements of arbitrary and even highly distorted mesh types. Numerical studies of the element convergence behaviours are undertaken for various plate bending problems so far investigated. It is indicated from comparative examples that fairly good convergence characteristics have been achieved.