A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive definiteness in a complementary subspace is obtained by setting the augmentation parameter. In our experiment, the combination of these two ideas leads to a new algorithm that turns out to be more robust and often improves the results obtained with other approaches.     

Modular Breath Analyzer (MBA): Introduction of a Breath Analyzer Platform Based on an Innovative and Unique,Modular eNose Concept for Breath Diagnostics and Utilization of Calibration Transfer Methods in Breath Analysis Studies

Exhaled breath analysis for early disease detection may provide a convenient method for painless and non-invasive diagnosis. In this work, a novel, compact and easy-to-use breath analyzer platform with a modular sensing chamber and direct breath sampling unit is presented. The developed analyzer system comprises a compact, low volume, temperature-controlled sensing chamber in three modules that can host any type of resistive gas sensor arrays. Furthermore, in this study three modular breath analyzers are explicitly tested for reproducibility in a real-life breath analysis experiment with several calibration transfer (CT) techniques using transfer samples from the experiment. The experiment consists of classifying breath samples from 15 subjects before and after eating a specific meal using three instruments. We investigate the possibility to transfer calibration models across instruments using transfer samples from the experiment under study, since representative samples of human breath at some conditions are difficult to simulate in a laboratory. For example, exhaled breath from subjects suffering from a disease for which the biomarkers are mostly unknown. Results show that many transfer samples of all the classes under study (in our case meal/no meal) are needed, although some CT methods present reasonably good results with only one class.     

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 .     

Numerical analysis of turbulent flow separation in a rectangular duct with a sharp 180‐degree turn by algebraic Reynolds stress model

Turbulent flow in a rectangular duct with a sharp 180‐degree turn is difficult to predict numerically because the flow behavior is influenced by several types of forces, including centrifugal force, pressure‐driven force, and shear stress generated by anisotropic turbulence. In particular, this type of flow is characterized by a large‐scale separated flow, and it is difficult to predict the reattachment point of a separated flow. Numerical analysis has been performed for a turbulent flow in a rectangular duct with a sharp 180‐degree turn using the algebraic Reynolds stress model. A boundary‐fitted coordinate system is introduced as a method for coordinate transformation to set the boundary conditions next to complicated shapes. The calculated results are compared with the experimental data, as measured by a laser‐Doppler anemometer, in order to examine the validity of the proposed numerical method and turbulent model. In addition, the possibility of improving the wall function method in the separated flow region is examined by replacing the log‐law velocity profile for a smooth wall with that for a rough wall. The analysis results indicated that the proposed algebraic Reynolds stress model can be used to reasonably predict the turbulent flow in a rectangular duct with a sharp 180‐degree turn. In particular, the calculated reattachment point of a separated flow, which is difficult to predict in a turbulent flow, agrees well with the experimental results. In addition, the calculation results suggest that the wall function method using the log‐law velocity profile for a rough wall over a separated flow region has some potential for improving the prediction accuracy. Copyright © 2007 John Wiley & Sons, Ltd.     

Local cyclic homology

Local (cyclic) homology of filtered associative algebras is defined and discussed. In the commutative case, it fits naturally in the setting of (formal) de Rham cohomology; we thus obtain a satisfactory complement to a result of Feigin and Tsygan. There is a spectral sequence from discrete (cyclic) homology of the associated graded algebra to local (cyclic) homology of the original filtered algebra; we exhibit manageable conditions on its convergence.     

Approximation of finite-section equations by piecewise constant functions

The problem is studied of reducing the amount of discrete information required for achieving a prescribed accuracy of solving Fredholm integral equations of the first kind on a half-line. The equations are solved by the finite-section method combined with piecewise constant interpolation of the kernel and the right-hand side at uniform grid points. The approximating properties of the discretization schemes are examined, and the corresponding computational costs are analyzed.     

Elementary equivalence for the lattices of subalgebras and automorphism groups of free algebras

We find an elementary equivalence criterion for the lattices of subalgebras of free algebras in regular varieties. The question is addressed of elementary equivalence for the automorphism groups of algebras of this type.     

A Robust Algorithm for Blind Total Variation Restoration

Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty. In this paper, we combine our robust algorithm for known blur operator with an alternating minimization implicit iterative scheme to deal with blind deconvolution problem, recover the image and identify the point spread function（PSF）. The only assumption needed is satisfy the practical physical sense. Numerical experiments demonstrate that this minimization algorithm is efficient and robust over a wide range of PSF and have almost the same results compared with known PSF algorithm.