Application of the LBET class models to describe the structure of microporous activated carbons on the basis of argon and benzene adsorption isotherms

The reported research is concerned with the properties of the new LBET class models designed to describe the heterogeneous adsorption on microporous carbonaceous materials. In particular, the new adsorption models were applied to a computer analysis of the microporous structure of two active carbons on the basis of argon and benzene adsorption isotherms. This paper provides for more thorough information on the properties of the proposed models and identification technique presented in the earlier papers.     

Preparation and characterization of porous polymeric microspheres obtained from multifunctional methacrylate monomers

Synthesis and properties of the new difunctional methacrylate monomer 2‐hydroxy‐3‐methacryloyloxypropoxybenzene are presented. This monomer was applied for the synthesis of porous microspheres. It was copolymerized with trimethylolpropane trimethacrylate in the presence of two pairs of pore‐forming diluents dodecane and toluene, and n‐decanol and toluene. Influence of diluents composition on their porous structures was studied. Thermal resistance and tendency to swell in different organic diluents for a chosen sample were also determined. © 2008 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 46: 6165–6174, 2008     

On wheel–rail contact problem with material properties varying with depth

Numerous laboratory experiments indicate that the use of a layer or a coating material attached to the conventional steel body reduce the magnitude of contact stress. Therefore in this paper we solve numerically the wheel–rail contact problem with friction and wear assuming the existence of a small elastic layer on the rail surface. Material properties of this layer are changing with its depth. The friction between the bodies is governed by Coulomb law. In contact zone Archard's law of wear is assumed. We take special features of this rolling contact problem and use so-called quasistatic approach to solve this contact problem. Finite element method is used as a discretization method. The numerical results including the distribution of normal stress along the contact boundary are provided and discussed. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Small cliques in random graphs

For d ≥ 1, a d-clique in a graph G is a complete d-vertex subgraph not contained in any larger complete subgraph of G. We investigate the limit distribution of the number of d-cliques in the binomial random graph G(n, p), p = p(n), n→∞.     

Decomposition methods in stochastic programming

Stochastic programming problems have very large dimension and characteristic structures which are tractable by decomposition. We review basic ideas of cutting plane methods, augmented Lagrangian and splitting methods, and stochastic decomposition methods for convex polyhedral multi-stage stochastic programming problems.     

A Representation of a Point Symmetric 2-Structure by a Quasi-Domain

In a symmetric 2-structure ${\Sigma =(P,\mathfrak{G}_1,\mathfrak{G}_2,\mathfrak{K})}$ we fix a chain ${E \in \mathfrak{K}}$ and define on E two binary operations “+” and “·”. Then (E,+) is a K-loop and for ${E^* := E {\setminus}\{o\}}$ , (E ^*,·) is a Bol loop. If ${\Sigma}$ is even point symmetric then (E,+ ,·) is a quasidomain and one has the set ${Aff(E,+,\cdot) := \{a^+\circ b^\bullet | a \in E, b \in E^*\}}$ of affine permutations. From Aff(E, +, ·) one can reproduce via a “chain derivation” the point symmetric 2-structure ${\Sigma}$ .     

Symmetric 2-Structures,a Classification

We classify symmetric 2-structures ${(P, \mathfrak{G}_1, \mathfrak{G}_2, \mathfrak{K})}$ , i.e. chain structures which correspond to sharply 2-transitive permutation sets (E, Σ) satisfying the condition: “ ${(*) \, \, \forall \sigma, \tau \in \Sigma : \sigma \circ \tau^{-1} \circ \sigma \in \Sigma}$ ”. To every chain ${K \in \mathfrak{K}}$ one can associate a reflection ${\widetilde{K}}$ in K. Then (*) is equivalent to “ ${(**) \, \, \forall K \in \mathfrak{K} : \widetilde{K}(\mathfrak{K}) = \mathfrak{K}}$ ” and one can define an orthogonality “ ${\perp}$ ” for chains ${K, L \in \mathfrak{K}}$ by “ ${K \perp L \Leftrightarrow K \neq L \wedge \widetilde{K}(L) = L}$ ”. The classification is based on the cardinality of the set of chains which are orthogonal to a chain K and passing through a point p of K. For one of these classes (called point symmetric 2-structures) we proof that in each point there is a reflection and that the set of point reflections forms a regular involutory permutation set.