Calorimetric study of methane interaction with supported Pd catalysts

As supported palladium oxide catalysts present the best performances in methane combustion in lean conditions, microcalorimetric studies of the interaction between methane and palladium oxide or metallic palladium supported on Al₂O₃, ZrO₂ and BN have been performed at 673 K. At this temperature methane reduced the palladium oxide, and the heat of reduction of palladium oxide was shown to depend on the dispersion and on the support. The lowest heats of reduction corresponded to the highest rates of methane combustion. Moreover methane reforming occurred on metallic palladium, producing hydrogen, and again methane decomposition was shown to depend on the support. This revised version was published online in July 2006 with corrections to the Cover Date.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

Construction of best Bregman approximations in reflexive Banach spaces

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.     

Convergent Algorithm Based on Progressive Regularization for Solving Pseudomonotone Variational Inequalities

In this paper, we extend the Moreau-Yosida regularization of monotone variational inequalities to the case of weakly monotone and pseudomonotone operators. With these properties, the regularized operator satisfies the pseudo-Dunn property with respect to any solution of the variational inequality problem. As a consequence, the regularized version of the auxiliary problem algorithm converges. In this case, when the operator involved in the variational inequality problem is Lipschitz continuous (a property stronger than weak monotonicity) and pseudomonotone, we prove the convergence of the progressive regularization introduced in Refs. 1, 2.     

Predicting vibration signals of automobile engine using chaos theory

Condition monitoring and life prediction of the vehicle engine is an important and urgent problem during the vehicle development process. The vibration signals that are closely associated with the engine running condition and its development trend are complex and nonlinear. The chaos theory is used to treat the nonlinear dynamical system recently. A novel chaos method in conjunction with SVD (singular value decomposition)denoising skill are used to predict the vibration time series. Two types of time series and their prediction errors are provided to illustrate the practical utility of the method.     

非线性应变波耦合组的吸引子的正则性

本文研究了非线性应变波方程与Schr(?)dinger方程耦合系统Cauchy问题吸引 子的正则性.获得了该系统在空间Eo中存在整体吸引子Ao,并且Ao与E1中的强吸 引子A1相等.     

HILBERTIAN INVARIANCE PRINCIPLE FOR EMPIRICAL PROCESS ASSOCIATED WITH A MARKOV PROCESS

The authors establish the Hilbertian invariance principle for the empirical process of a stationary Markov process, by extending the forward-backward martingale decomposition of Lyons-Meyer-Zheng to the Hilbert space valued additive functionals associated with general non-reversible Markov processes.     

Stress Tensor Fluctuations and Passive Quantum Gravity

The quantum fluctuations of the stress tensor of a quantum field are discussed, as are the resulting space-time metric fluctuations. Passive quantum gravity is an approximation in which gravity is not directly quantized, but fluctuations of the space-time geometry are driven by stress tensor fluctuations. We discuss a decomposition of the stress tensor correlation function into three parts, and consider the physical implications of each part. The operational significance of metric fluctuations and the possible limits of validity of semiclassical gravity are discussed.     

Variable resolution triangulations

A comprehensive study of multiresolution decompositions of planar domains into triangles is given. A general model is introduced, called a Multi-Triangulation (MT), which is based on a collection of fragments of triangulations arranged into a directed acyclic graph. Different decompositions of a domain can be obtained by combining different fragments of the model. Theoretical results on the expressive power of the MT are given. An efficient algorithm is proposed that can extract a triangulation from the MT, whose level of detail is variable over the domain according to a given threshold function. The algorithm works in linear time, and the extracted representation has minimum size among all possible triangulations that can be built from triangles in the MT, and that satisfy the given level of detail. Major applications of these results are in real-time rendering of complex surfaces, such as topographic surfaces in flight simulation.