多相催化反应的在线光谱-质谱探测系统

在研究多相催化反应中,建立和发展了一套在线高灵敏的共振增强多光子电离-飞行时间质谱检测系统。采用光纤作为传输介质,消除了激光在电离池内的吸收;自制了高输入阻抗的电荷灵敏放大器,提高了信号的稳定性;改进了飞行时间质谱仪中脉冲阀的进气方式,减少了死区,实现了质谱的快速采样。实验结果证明与传统的催化检测仪器相比,本系统具有灵敏度和采样率高,在线实时检测等特点。     

Hermite-based Appell polynomials: Properties and applications

By employing certain operational methods, the authors introduce Hermite-based Appell polynomials. Some properties of Hermite-Appell polynomials are considered, which proved to be useful for the derivation of identities involving these polynomials. The possibility of extending this technique to introduce Hermite-based Sheffer polynomials (for example, Hermite-Laguerre and Hermite-Sister Celine's polynomials) is also investigated.     

Microbiosensor based on glucose oxidase and hexokinase co-immobilised on platinum microelectrode for selective ATP detection

ATP determination is of great importance since this compound is involved in a number of vital biological processes. To monitor ATP concentration levels, we have developed a microbiosensor based on cylindrical platinum microelectrode, covered with a layer of poly-m-phenylendiamine (PPD), and layer of co-immobilised glucose oxidase and hexokinase. Conditions for biosensor measurement of ATP (pH, Mg²⁺ and substrates concentration) in vitro and microbiosensor characteristics such as sensitivity, selectivity, reproducibility, storage stability were studied and optimized. Under optimal conditions the microbiosensor can measure ATP concentrations down to a 2.5 μM detection limit with response time about 15 s. Interferences by electroactive compounds like biogenic amines and their metabolites, ascorbic acid, uric acid and l-cystein are rejected in general by the PPD layer. The microbiosensor developed is insensitive to ATP analogues (or substances with similar structure), such as ADP, AMP, GTP and UTP, too. It can be used for ATP analysis in vitro in the reactions consuming or producing macroergic triphosphate molecules to study kinetics of the process and in drug design concerning development of inhibitors specific to target kinases and others target enzymes.     

On strong and total Lagrange duality for convex optimization problems

We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature.     

On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets

In the paper, we consider a problem of convex Semi-Infinite Programming with an infinite index set in the form of a convex polyhedron. In study of this problem, we apply the approach suggested in our recent paper [Kostyukova OI, Tchemisova TV. Sufficient optimality conditions for convex Semi Infinite Programming. Optim. Methods Softw. 2010;25:279–297], and based on the notions of immobile indices and their immobility orders. The main result of the paper consists in explicit optimality conditions that do not use constraint qualifications and have the form of criterion. The comparison of the new optimality conditions with other known results is provided.     

Multi-variable Hermite matrix polynomials: Properties and applications

In this paper, the multi-variable Hermite matrix polynomials are introduced by algebraic decomposition of exponential operators. Their properties are established using operational methods. The matrix forms of the Chebyshev and truncated polynomials of two variable are also introduced, which are further used to derive certain operational representations and expansion formulae.     

Some results on regularity in vector optimization

In this paper we suggest an approach to regularity in, vector optimization which extends the one given in [9]; some necessary or sufficient regularity conditions are given for a wide class of nondifferentiable vector optimization problems which embraces the convex ones.     

A constraint qualification for convex programming

1. IntroductionLet X be the n-dimensional Euclidean space Rad. Denote the transpose of the columnvector y by yT. Suppose that R7 and nit R= are the n-dimensional vector sets with nonnegative and positive components, whose elements are denoted by y 3 0 and y > 0, respectively.Write R for the nonnegative real number set.Consider a nondiffereatiable convex programming problem:We assume that f(x), gi(x),..', g.(x) are finite reaLvalued continuous, convex functions on X, but not necessarily d…     

A parametric view on the Mangasarian–Fromovitz constraint qualification

The growth of the multipliers, when the parameter approaches such a critical parameter, is characterized by a parametric constraint qualification which is introduced here. It is equivalent to a bound on the growth of the multipliers. Received May 8, 1995 / Revised version received February 12, 1998 Published online February 25, 1999     

Identifying mode shapes and modal frequencies by operational modal analysis in the presence of harmonic excitation

Operational modal analysis techniques allow us to extract the modal properties of structures based on their response to non-measured stationary white noise, i.e., by considering only the system response to operational excitations. In this paper we outline a procedure to deduce modal parameters from operational response measurements. In particular, we discuss a novel approach to analyze operational responses due to unknown harmonic excitation in addition to noise. Structural eigenfrequencies and modal damping are computed using a modified least-squares complex exponential method. Once the poles of the system are identified, mode shapes are obtained by post-processing. The robustness and accuracy of the approach are illustrated by performing tests on a plate structure.