Kinetics of phenol hydrogenation over supported palladium catalyst

Kinetics of vapor phase hydrogenation of phenol to cyclohexanone over Pd/MgO system has been studied in a flow microreactor under normal atmospheric pressure. The reaction rate is found to be negative order with respect to the partial pressure of phenol and has increased from −0.5 to 0.5 with increasing temperature (473 to 563 K). The apparent activation energy (E_a) of the process is found to be close to 65 kJ per mol. On the basis of kinetic results a surface mechanism is proposed.     

Stationary turbulent closure via the Hopf functional equation

Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

Convergence rates for Markov chain order estimates using EDC criterion

The Efficient Determination Criterion (EDC) generalizes the AIC and BIC criteria and provides a class of consistent estimators for the order of a Markov chain with finite state space. In this note, we derive rates of convergence for the EDC estimates. *Partially supported by CNPq, CAPES/PROCAD, FAPDF/PRONEX, FINATEC and FUNPE/UnB. **Partially supported by CAPES.     

Mg,Si和S同位素链的壳反常

采用考虑轴向形变的相对论平均场理论,以双中子、双质子分离能隙δ_2n/δ_2p作为壳封闭的特征,分析了Mg,Si和S同位素链的壳封闭和壳反常,发现Mg同位素链在N=12,16处,Si同位素链在N=14,S同位素链在N?=16处出现明显的壳封闭结构,Si同位素链在N=28处壳层结构并没有消失.Mg,Si和S同位素链在N=20处壳效应并不太明显.     

On the properties of solutions to the Goursat-Darboux problem with boundary and distributed controls

We consider a control system described by the Goursat-Darboux equation. The system is controlled by distributed and boundary controls. The controls are subject to the constraints given as multivalued mappings with closed, possibly nonconvex, values depending on the phase variable. Alongside the initial constraints, we consider the convexified constraints and the constraints whose values are the extreme points of the convexified constraints. We study the questions of existence of solutions and establish connections between the solutions under various constraints.     

Analysis of atomic arrangement in magnetic Fe–Pt nanoparticles

The order parameter S of Fe–Pt nanoparticles is estimated from X-ray diffraction (XRD) patterns. The total intensity of a diffraction peak is obtained by Rietveld analysis as well as simply integrating the intensity. The Rietveld analysis is found to provide a plausible value of S even for a sample showing an XRD pattern with broad and overlapped peaks. Another order parameter Q, which is obtained from Mössbauer spectra, is introduced, and it is confirmed that Q is equivalent to the probability of Fe atoms being in the L1₀-type atomic arrangement. The coercivity of Fe–Pt nanoparticles is directly proportional to Q, while it vanishes at S=0.4, indicating that the magnetic property of Fe–Pt nanoparticles has a closer relationship to Q than S.