基于无衍射光的表面粗糙度三角测量及其灰色评定方法

 激光三角法是表面形貌非接触测量中的一种常用方法,在几何测量领域应用广泛。传统的激光三角法采用高斯光束作为指示光源,在机械扫描机构的配合下,通过对被测表面逐点扫描完成表面形貌的测量。采用新型的无衍射光替代传统激光光源,解决了普通高斯光束存在的“焦深”问题,简化了机械结构。并采用基于灰色系统理论的灰色滤波进行表面形貌的分离与评定,克服了原有方法对测量数据样本量和统计特性的依赖,并通过实验表明该系统能够准确地完成表面形貌的三维测量,所提出的灰色评定方法能够比较有效地进行表面形貌的分离与评定。     

Spectra of finite linear and unitary groups

The spectrum of a finite group is the set of its element orders. An arithmetic criterion determining whether a given natural number belongs to a spectrum of a given group is furnished for all finite special, projective general, and projective special linear and unitary groups. Supported by RFBR (grant Nos. 08-01-00322 and 06-01-39001) and by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (project NSh-344.2008.1). __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 157–173, March–April, 2008.     

Estimation of a parameter of Morgenstern type bivariate exponential distribution by ranked set sampling

Ranked set sampling is applicable whenever ranking of a set of sampling units can be done easily by a judgement method or based on the measurement of an auxiliary variable on the units selected. In this work, we consider ranked set sampling, in which ranking of units are done based on measurements made on an easily and exactly measurable auxiliary variable X which is correlated with the study variable Y. We then estimate the mean of the study variate Y by the BLUE based on the measurements made on the units of the ranked set sampling regarding the study variable Y, when (X ,Y) follows a Morgenstern type bivariate exponential distribution. We then consider unbalanced multistage ranked set sampling and estimate the mean of the study variate Y by the BLUE based on the observations made on the units of multistage ranked set sample regarding the study variable Y. Efficiency comparison is also made on all estimators considered in this work.     

Manifold of nondegenerate affinor fields

We consider the quotient set of the set of nondegenerate affinor fields with respect to the action of the group of nowhere vanishing functions. This set is endowed with a structure of infinite-dimensional Lie group. On this Lie group, we construct an object of linear connection with respect to which all left-invariant vector fields are covariantly constant (the Cartan connection).     

A new general algorithmic method in reaction syntheses using linear algebra

We discuss here a new general linear algebraic method (both model and algorithm) for describing and generating (among others) minimal reactions and also minimal mechanisms in stoichiometry, or dimensionless groups in physics as well. (Further applications in process network syntheses will be discussed in .) With some minor modifications of the input this method can be extended for several related questions: for generating direct and overall reactions, direct (steady state) mechanisms, for finding the possible resulting (overall) reactions among all possible mechanisms, etc.Computational results in section 4 show the speed of our algorithm.We give also mathematical background and results in sections 3, 5 and 6. However, we do not restrict ourselves to mathematics only, we also talk on the language of chemistry, too.The theoretical results in sections 3.2, 3.3, 5 and the computational examples in section 4 are completely new, further theoretical results will appear in and in .     

Robust H∞ filtering for discrete-time impulsive systems with uncertainty

This paper investigates robust filter design for linear discrete-time impulsive systems with uncertainty under H∞ performance. First, an impulsive linear filter and a robust H∞ filtering problem are introduced for a discrete-time impulsive systems. Then,a sufficient condition of asymptotical stability and H∞ performance for the filtering error systems are provided by the discrete-time Lyapunov function method. The filter gains can be obtained by solving a set of linear matrix inequalities (LMIs). Finally, a numerical example is presented to show effectiveness of the obtained result.     

Finite element simulations of fully non‐linear interaction between vertical cylinders and steep waves. Part 2: numerical results and validation

In Ma, Wu, Eatock Taylor [Finite element simulation of fully non‐linear interaction between vertical cylinders and steep waves. Part 1: methodology and numerical procedure. International Journal for Numerical Methods in Fluids 2001], designated Part 1 hereafter, we have developed the methodology and solution procedure for simulating the three‐dimensional interaction between fixed bodies and steep waves based on a finite element method (FEM). This paper provides extensive numerical results and validation. The effectiveness of the radiation condition is investigated by comparing the results from short and long tanks; the accuracy of the computed data is confirmed through comparison with analytical solutions. The adopted mathematical model is also validated by comparing the obtained numerical results with experimental data. Various test cases, including non‐linear bichromatic and irregular waves and the interactions between waves and one or two cylinders, are analysed. Copyright © 2001 John Wiley & Sons, Ltd.     

Minimal cutwidth linear arrangements of abelian Cayley graphs

We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.     

Optimal production scheduling for the dairy industry

The increasing variety of products offered by the food industry has helped the industry to respond to market trends, but at the same time has resulted in a more complex production process, which requires flexibility and an efficient coordination of existing resources. Especially in industrial yogurt production, there is a wide variety of products that differ in features like fat content, the whey used to produce the mixture, the flavor, the size of the container or the language on the label. The great diversification and the special features that characterize yogurt production lines (satisfaction of multiple due dates, variable processing times, sequence-dependent setup times and costs and monitoring of inventory levels), render generic scheduling methodologies impractical for real-world applications. In this work we present a customized Mixed Integer Linear Programming (MILP) model for optimizing yogurt packaging lines that consist of multiple parallel machines. The model is characterized by parsimony in the utilization of binary variables and necessitates the use of only a small pre-determined number of time periods. The efficiency of the proposed model is illustrated through its application to the yogurt production plant of a leading dairy product manufacturing company in Greece.     

Higher rank numerical ranges and low rank perturbations of quantum channels

For a positive integer k, the rank-k numerical range Λk(A) of an operator A acting on a Hilbert space H of dimension at least k is the set of scalars λ such that PAP=λP for some rank k orthogonal projection P. In this paper, a close connection between low rank perturbation of an operator A and Λk(A) is established. In particular, for 1?r<k it is shown that Λk(A)⊆Λk−r(A+F) for any operator F with rank(F)?r. In quantum computing, this result implies that a quantum channel with a k-dimensional error correcting code under a perturbation of rank at most r will still have a (k−r)-dimensional error correcting code. Moreover, it is shown that if A is normal or if the dimension of A is finite, then Λk(A) can be obtained as the intersection of Λk−r(A+F) for a collection of rank r operators F. Examples are given to show that the result fails if A is a general operator. The closure and the interior of the convex set Λk(A) are completely determined. Analogous results are obtained for Λ_∞(A) defined as the set of scalars λ such that PAP=λP for an infinite rank orthogonal projection P. It is shown that Λ_∞(A) is the intersection of all Λk(A) for k=1,2,…. If A−μI is not compact for all μ∈C, then the closure and the interior of Λ_∞(A) coincide with those of the essential numerical range of A. The situation for the special case when A−μI is compact for some μ∈C is also studied.