“Optimization of aircraft maintenance/support infrastructure using genetic algorithms—level of repair analysis”

Level of repair analysis (LORA) is an approach used during the design stage of complex equipment for analysis of the cost effectiveness of competing maintenance strategies. LORA is carried as a part of the life cycle cost and cost of ownership analysis and plays a significant role in minimizing the life cycle cost and cost of ownership of the capital equipment. Since many purchasing decisions of complex equipment are based on cost of ownership, it has become essential to carry out LORA to compete in the market. In this paper, we develop a mathematical model for LORA and propose a solution methodology based on genetic algorithms. The concept is illustrated using a hypothetical aircraft engine.     

Velocity Quantization Approach of the One-Dimensional Dissipative Harmonic Oscillator

Given a constant of motion for the one-dimensional harmonic oscillator with linear dissipation in the velocity, the problem to get the Hamiltonian for this system is pointed out, and the quantization up to second order in the perturbation approach is used to determine the modification on the eigenvalues when dissipation is taken into consideration. This quantization is realized using the constant of motion instead of the Hamiltonian. PACS: 03.20.+i, 03.30.+p, 03.65.−w,03.65.Ca     

Diophantine Undecidability of Function Fields of Characteristic Greater than 2, Finitely Generated over Fields Algebraic over a Finite Field

Let F be a function field of characteristic p > 2, finitely generated over a field C algebraic over a finite field C _p and such that it has an extension of degree p. Then Hilbert's Tenth Problem is not decidable over F.     

时滞差分系统基于两种度量的稳定性分析

本文建立了一些关于时滞差分系统（h0,h）稳定性（一致稳定性，渐近稳定性，一致渐近稳定性）的判定准则。在所得到的定理中，去除了△V为常负的限制，特别地，△V甚至可以恒为正，从而大大改进了已有结果，并更加便于应用。     

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure

In a secret sharing scheme, some participants can lie about the value of their shares when reconstructing the secret in order to obtain some illicit benefit. We present in this paper two methods to modify any linear secret sharing scheme in order to obtain schemes that are unconditionally secure against that kind of attack. The schemes obtained by the first method are robust, that is, cheaters are detected with high probability even if they know the value of the secret. The second method provides secure schemes, in which cheaters that do not know the secret are detected with high probability. When applied to ideal linear secret sharing schemes, our methods provide robust and secure schemes whose relation between the probability of cheating and the information rate is almost optimal. Besides, those methods make it possible to construct robust and secure schemes for any access structure.     

Cooperative games of choosing partners and forming coalitions in the marketplace

Two games of interacting between a coalition of players in a marketplace and the residual players acting there are discussed, along with two approaches to fair imputation of gains of coalitions in cooperative games that are based on the concepts of the Shapley vector and core of a cooperative game. In the first game, which is an antagonistic one, the residual players try to minimize the coalition's gain, whereas in the second game, which is a noncooperative one, they try to maximize their own gain as a coalition. A meaningful interpretation of possible relations between gains and Nash equilibrium strategies in both games considered as those played between a coalition of firms and its surrounding in a particular marketplace in the framework of two classes of n-person games is presented. A particular class of games of choosing partners and forming coalitions in which models of firms operating in the marketplace are those with linear constraints and utility functions being sums of linear and bilinear functions of two corresponding vector arguments is analyzed, and a set of maximin problems on polyhedral sets of connected strategies which the problem of choosing a coalition for a particular firm is reducible to are formulated based on the firm models of the considered kind.     

用多焦点全息透镜实现多重谱分数傅里叶变换

提出用多焦点全息透镜实现多重谱分数傅里叶变换.利用全息方法通过一次曝光制作出多焦点的全息透镜,分析了用此全息元件实现这种变换的条件,并在实验上实现了多重谱分数傅里叶变换. 实验结果表明这种变换方法简便可行,可广泛应用于多通道光学信息处理系统及多目标图像识别系统中.     

A posteriori error estimators for the Stokes equations

Summary We present two a posteriori error estimators for the mini-element discretization of the Stokes equations. One is based on a suitable evaluation of the residual of the finite element solution. The other one is based on the solution of suitable local Stokes problems involving the residual of the finite element solution. Both estimators are globally upper and locally lower bounds for the error of the finite element discretization. Numerical examples show their efficiency both in estimating the error and in controlling an automatic, self-adaptive mesh-refinement process. The methods presented here can easily be generalized to the Navier-Stokes equations and to other discretization schemes.This work was accomplished at the Universität Heidelberg with the support of the Deutsche Forschungsgemeinschaft     

混合稀土储氢合金中氧和氮的测定

研究了混合稀土储氢合金中氧和氮的测定方法。针对稀土金属高温易挥发、分解的特点，选择适宜的加热温度，使用镍浴，选择高温座坩埚进行试验：选择出了合适的助熔剂的预处理方法。方法已用于实际样品。对含氧0．43％、含氮0.018％的试样，分析精密度为氧4．3％，氮5.9％，加标回收率氧为93％～104％，氮为92％～110％。     

Solutions in Sobolev spaces of vector refinement equations with a general dilation matrix

In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space W_p^k(ℝ^s) (1≤p≤∞) to a vector refinement equation with a general dilation matrix. The criterion is constructive and can be implemented. Rate of convergence of vector cascade algorithms in a Sobolev space W_p^k(ℝ^s) will be investigated. When the dilation matrix is isotropic, a characterization will be given for the L_p (1≤p≤∞) critical smoothness exponent of a refinable function vector without the assumption of stability on the refinable function vector. As a consequence, we show that if a compactly supported function vector φ∈L_p(ℝ^s) (φ∈C(ℝ^s) when p=∞) satisfies a refinement equation with a finitely supported matrix mask, then all the components of φ must belong to a Lipschitz space Lip(ν,L_p(ℝ^s)) for some ν>0. This paper generalizes the results in R.Q. Jia, K.S. Lau and D.X. Zhou (J. Fourier Anal. Appl. 7 (2001) 143–167) in the univariate setting to the multivariate setting. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 42C20, 41A25, 39B12. Research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant G121210654.