Intercomparison of retrieval codes used for the analysis of high-resolution, ground-based FTIR measurements

A rigorous and systematic intercomparison of codes used for the retrieval of trace gas profiles from high-resolution ground-based solar absorption FTIR measurements is presented for the first time. Spectra were analyzed with the two widely used independent, retrieval codes: SFIT2 and PROFFIT9. Vertical profiles of O₃, HNO₃, HDO, and N₂O were derived from the same set of typical observed spectra. Analysis of O₃ was improved by using updated line parameters. It is shown that profiles and total column amounts are in excellent agreement, when similar constraints are applied, and that the resolution kernel matrices are also consistent. Owing to the limited altitude resolution of ground-based observations, the impact of the constraints on the solution is not negligible. It is shown that the results are also compatible for independently chosen constraints. Perspectives for refined constraints are discussed. It can be concluded that the error budget introduced by the radiative transfer code and the retrieval algorithm on total columns deduced from high-resolution ground-based solar FTIR spectra is below 1%.     

Heuristic Rejection in Interval Global Optimization

Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach.     

一种改进的数字散斑相关方法用于检测人的口型变化

提出了一种基于数字散斑相关测量技术的口型变化检测技术,该技术以白光数字散斑相关测量方法为基础,根据实际应用的需要,引入重心算法并进行了改进,可以实时地检测人说话时的口型变化。通过实验表明,提出的方法是一种实用的、快速、高精度的口型变化测试方法,可为今后的唇语识别技术奠定基础。     

电子认证与授权管理标准体系研究

以国际上在标识、鉴别与授权标准方面已有的工作为基础，提出了我国电子认证与授权管理标准体系框架。     

Modeling hyperelastic behavior of rubber: A novel invariant‐based and a review of constitutive models

A constitutive phenomenological model completing the Gent‐Thomas concept is carried out to formulate laws governing the hyperelastic behavior of incompressible rubber materials. It is shown that the phenomenological Gent‐Thomas model (1958) and the constrained chain model (1992) give similar precise results at small to moderate deformation. On the other hand, comparisons of the outcome of the proposed model with that of the molecular model from the combined concepts of Flory‐Erman and Boyce‐Arruda (2000), and with those of the phenomenological models of Ogden (1982), Yeoh‐Fleming (1997), Pucci‐Saccomandi (2002) and Beda (2005) are made. Residual inconveniences raised by attractive continuum models in rubber elasticity literature have been successfully overcome. Results from both the statistical and phenomenological mechanics concepts are compared with the data of some useful classical materials (rubbers of Treloar, Rivlin‐Saunders, Pak‐Flory and Yeoh‐Fleming). The results permit one to see salient equivalence of the two theories for a more reliable prediction of stress‐stretch response for all states of any mode of deformation. A complete and exhaustive analysis of the Mooney plot that combines small and very large extension‐compression has been quite essential in assessing the validity of models. A method of identification of material parameters is presented and data of the simple tension suffice for the determination of the parameter values. It is shown that the ordinary identification procedures, such as the usual least squares, a very much used numerical method in materials investigation, can be unsuitable in some cases of hyperelastic modeling. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 1713–1732, 2007     

How to assess and report the performance of a stochastic algorithm on a benchmark problem: mean or best result on a number of runs?

Some authors claim that reporting the best result obtained by a stochastic algorithm in a number of runs is more meaningful than reporting some central statistic. In this short note, we analyze and refute the main argument brought in favor of this statement.     

Identification of micro-scale calorimetric devices II

The miniaturized calorimetric devices furnish a reduced working flat surface and permits measurements with extremely low-mass quantities. The experimental sensitivity shows relevant position dependence with x-y surface coordinates and with z-distance. The device identification is realized via a 2-D model based in Fourier general equation. Using the Marquardt method the experimental flat surface device can be identified and the fitted parameters used to simulate the behavior of the experimental system. From the model, the effects of several dissipation configurations can be evaluated. Also, via the RC-analogy, a way to 3-D experimental devices is roughly described. This revised version was published online in July 2006 with corrections to the Cover Date.     

Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.

The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.     

The effect of multiple optima on the simple GA run-time complexity

Genetic algorithms are stochastic search algorithms that have been applied to optimization problems. In this paper we analyze the run-time complexity of a genetic algorithm when we are interested in one of a set of distinguished solutions. One such case occurs when multiple optima exist. We define the worst case scenario and derive a probabilistic worst case bound on the number of iterations required to find one of these multiple solutions of interest.     

Algebraic properties of cryptosystem PGM

In the late 1970s Magliveras invented a private-key cryptographic system calledPermutation Group Mappings (PGM). PGM is based on the prolific existence of certain kinds of factorization sets, calledlogarithmic signatures, for finite permutation groups. PGM is an endomorphic system with message space ℤ_|G| for a given finite permutation groupG. In this paper we prove several algebraic properties of PGM. We show that the set of PGM transformations ℐ _G is not closed under functional composition and hence not a group. This set is 2-transitive on ℤ_|G| if the underlying groupG is not hamiltonian and not abelian. Moreover, if the order ofG is not a power of 2, then the set of transformations contains an odd permutation. An important consequence of these results is that the group generated by the set of transformations is nearly always the symmetric group ℒ_|G|. Thus, allowing multiple encryption, any permutation of the message space is attainable. This property is one of the strongest security conditions that can be offered by a private-key encryption system. S. S. Magliveras was supported in part by NSF/NSA Grant Number MDA904-82-H0001, by U.S. West Communications, and by the Center for Communication and Information Science of the University of Nebraska.