Effect of genesis on the properties and hydrogen reducibility of NiO-ZnO mixed oxides

The physico-chemical properties and reactivity tested by hydrogen reduction have been studied for two series of NiO-ZnO mixed oxides of various composition. The solid nickel oxide or zinc oxide in interaction with the solution of nitrate of the second component were used as the precursors in each series. The differences in some physico-chemical parameters of the samples in both series were correlated with their reduction behaviour, followed both in iso- and non-isothermal regime. Moreower, the influence of various factors modifying the reactivity of mixed oxides was also investigated and the results were compared with those obtained from earlier studied analogous systems of quite different origin.This revised version was published online in November 2005 with corrections to the Cover Date.     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

六角系统的边面点面全色数

本文得到了六角系统的边面和点面金色数．     

Zeroth-order phase transitions and Zipf law quantization

From the standpoint of thermodynamic averaging of fission microprocesses, we investigate the origin of radioactive release in an NPP after an accident or after resource depletion. The genesis of the NPP release is interpreted as a new thermodynamic phenomenon, a zeroth-order phase transition. This problem setting results in a problem in probabilistic number theory. We prove the corresponding theorem leading to quantization of the Zipf law for the frequency of a zeroth-order phase transition with different values of the jump of the Gibbs thermodynamic potential. We introduce the notion of hole dimension. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 1, pp. 118–142, January, 2007.     

Testing for additivity with B-splines

Regression splines are often used for fitting nonparametric functions, and they work especially well for additivity models. In this paper, we consider two simple tests of additivity: an adaptation of Tukey's one degree of freedom test and a nonparametric version of Rao's score test. While the Tukey-type test can detect most forms of the local non-additivity at the parametric rate of O(n-1/2), the score test is consistent for all alternative at a nonparametric rate. The asymptotic distribution of these test statistics is derived under both the null and local alternative hypotheses. A simulation study is conducted to compare their finite-sample performances with some existing kernel-based tests. The score test is found to have a good overall performance.     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

抽样调查中最佳测量次数的确定

现场抽样调查中，由于测量误差的存在，使得所测变量实测值的方差增大，通过增加每个体的测量次数可以控制测量误差，但这样每个体调查费用增大。本文对测量信度Ｒ，每个体测量次数ｍ与相应所需的样本含量ｎｍ、调查费用Ｔｎ的关系进行了探讨，并介绍了如何根据Ｒ，及每个体测量费用占其总费用构成比Ｃ，确定最佳测量次数ｍ值，以达到最佳控制调查费用的目的，这对我们在大型现场调查中进行经济效益分析具有重大的理论指导意义。     

On the phase space approach to complexity

We elaborate in some detail on a new phase space approach to complexity, due to Y.-C. Zhang. We show in particular that the connection between maximal complexity and power law noise or correlations can be derived from a simple variational principle. For a 1D signal we find 1/f noise, in accordance with Zhang.     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

A note on inverses in arithmetic with fuzzy numbers

Algorithms for systematical search of inverse in arithmetic operations with fuzzy numbers are discussed. The fuzzy number derived is considered either in a discrete representation of its support or described by the parameters of the corresponding membership function formula. Both algorithms are easy to be programmed for desk calculators.