High temperature physical adsorption of gases on solids: a comparison of two-dimensional and three-dimensional treatments

Two theories of fluid adsorption are discussed and compared. One starts from the assumption of the existance of a strictly two-dimensional adsorbed phase on the adsorbent surface. The statistical mechanics of this model is solved in the Percus-Yevick approximation for both two dimensional and bulk phases. According to the second, three-dimensional treatment, the thermodynamic functions of adsorption are defined as surface excess functions, relative to the Gibbs dividing surface. Explicit results are given for hard spheres and a Lennard-Jones 6-12 gas in contact with a wall interacting via the Lennard-Jones 3-9 potential. The dependence of excess quantities upon the choice of the Gibbs dividing surface is also discussed.     

Determination of Formation Regions of Titanium Phosphates; Determination of the Crystal Structure ofβ-Titanium Phosphate, Ti(PO4)(H2PO4), from Neutron Powder Data

The formation region of the various types of layered titanium hydrogen phosphate hydrates was investigated. The materials were prepared by hydrothermal methods, treating amorphous titanium phosphate with phosphoric acid (8 to 16M) in the temperature range 175 to 250°C. The materials obtained were:α-Ti(HPO₄)₂·H₂O,γ-Ti(PO₄)(H₂PO₄)·2H₂O, and its anhydrous formβ-Ti(PO₄)(H₂PO₄). The structure ofβ-Ti(PO₄)(H₂PO₄) has been determined by Rietveld powder refinement of high resolution neutron diffraction data. The structure is refined in the monoclinic space groupP2₁/n(No. 14). The unit cell parameters are:a=18.9503(4) Å,b=6.3127(1) Å,c=5.1391(1) Å,β=105.366(2)°;Z=4. The final agreement factors were:R_p=2.9% andR_wp=3.8%. The structure ofβ-Ti(PO₄)(H₂PO₄) is built from TiO₆octahedra linked together by tertiary phosphate (PO₄) and dihydrogen phosphate ((OH)₂PO₂) tetrahedra. The layers are held together by hydrogen bonds.     

Matroid bases with cardinality constraints on the intersection

Mathematical Programming - Given two matroids $$\mathcal {M}_{1} = (E, \mathcal {B}_{1})$$ and $$\mathcal {M}_{2} = (E, \mathcal {B}_{2})$$ on a common ground set E with base sets $$\mathcal...     

Adaptive efficient estimation for generalized semi-Markov big data models

Annals of the Institute of Statistical Mathematics - In this paper we study generalized semi-Markov high dimension regression models in continuous time, observed at fixed discrete time moments. The...     

Asymmetric Information in a Capital Accumulation Differential Game with Spillover and Learning Effects

Journal of Optimization Theory and Applications - This paper considers a capital accumulation game where the installation costs of investments are lowered by the firm’s own capital stock...     

?*-extensions of tori, higher chow groups and applications to incidence equivalence relations for algebraic cycles

LetX be a smooth projective variety over an algebraically closed fieldk. We repeat Bloch's construction of aG _m -biextension (torseur)E over CH _hom ^p (X)×CH _hom ^q (X) forp+q=dim(X)+1. First we show that in characteristic zeroE comes via pullback from the Poincaré biextension over the corresponding product of intermediate Jacobians which has been conjectured by Bloch and Murre. Then the relations betweenE and various equivalence relations for algebraic cycles are studied. In particular we reprove Murre's theorem stating that Griffiths' conjecture holds for codimension 2 cycles, i.e. every 2-codimensional cycle which is algebraically and incidence equivalent to zero has torsion Abel-Jacobi invariant.     

On stable geometries

Within the concept of projective lattice geometry we are considering the class of stable geometries which have also been introduced in [14]. The investigation of their basic properties will result in fundamental structure theorems which especially give a lattice-geometric characterization of free left modules of rank 6 over proper right Bezout rings of stable rank 2. This yields a proper generalization of previous results of ours.     

A new heuristic algorithm solving the linear ordering problem

The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized.