半自由声场的全息重建和预测实验研究

半自由声场环境下的声源重建和声场预测研究对声全息技术走向实际应用具有非常重要的意义.在提出基于分布源边界点法的半自由声场全息重建和预测方法的基础上，对此展开了实验研究.并将重建和预测的结果与常规方法重建和预测的结果进行了比较和讨论，说明了重建预测过程中反射声压的影响和考虑反射声压的必要性，证明了所提出方法在解决半自由声场环境下存在地面反射时的声源重建和声场预测时的有效性和准确性.还提出了采用奇异值截断滤波和Tikhonov正则化方法来削弱测量误差的影响，从而进一步优化了重建结果，提高了全息成像的可信度. 关键词： 声全息 半自由场 边界点 声辐射 反射声     

The Isoelectric Point and the Points of Zero Charge of Fe-Al-Mg Hydrotalcite-like Compounds

The relation of the isoelectric point (IEP) and the point of zero net charge (PZNC) of the hydrotalcite-like compounds was discussed. It was found that the IEP does not equal to the PZNC and the IEP is higher than the PZNC. The structural positive charges existing in the HTlc,which cause the difference between the IEP and the PZNC. The effects of the structural positive charges of the HTlc on its IEP and PZNC are the same as the specific adsorption of metal cations.     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

Carousels,Zindler curves and the floating body problem

A carousel is a dynamical system that describes the movement of an equilateral linkage in which the midpoint of each rod travels parallel to it. They are closely related to the floating body problem. We prove, using the work of Auerbach, that any figure that floats in equilibrium in every position is drawn by a carousel. Of special interest are such figures with rational perimetral density of the floating chords, which are then drawn by carousels. In particular, we prove that for some perimetral densities the only such figure is the circle, as the problem suggests.     

The Downs-Thomson Paradox: Existence, Uniqueness and Stability of User Equilibria

Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate     

Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

A Fixed Point Theorem for Multi—valued Composite Increasing Operators

Ａ　Ｆｉｘｅｄ　Ｐｏｉｎｔ　Ｔｈｅｏｒｅｍ　ｆｏｒ　Ｍｕｌｔｉ－ｖａｌｕｅｄ　Ｃｏｍｐｏｓｉｔｅ　Ｉｎｃｒｅａｓｉｎｇ　ＯｐｅｒａｔｏｒｓＬｉＦｅｎｇｙｏｕ（李凤友）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｔｉａｎｊｉｎ＇ＮｏｒｍａｌＵｎｉ...     

Monoesterification of styrene–maleic anhydride copolymers with alcohols in ethyl benzene: Catalysis and kinetics

A kinetic investigation on the monoesterification reaction of the maleic anhydride residue (MA) in styrene-maleic anhydride copolymers with aliphatic alcohols was carried out in ethyl benzene solution. By comparison to classic catalysts such as tributylamine (TBA) and pyridine, 4-dimethylaminopyridine (4DMAP) is by far the most effective catalyst for this reaction. While both general base and nucleophilic mechanisms contribute to the reaction catalyzed by TBA or pyridine, a nucleophilic mechanism prevails with 4DMAP. This reaction is reversible, and its chemical equilibrium constant decreases significantly with increasing temperature. Both kinetic and thermodynamic results showed that in the presence of 4DMAP, the forward and reverse reactions are second and first order, respectively. The existence of side reactions, reactivity of two styrene-maleic anhydride copolymers of different MA contents as well as two aliphatic alcohols of different lengths are also addressed. © 1993 John Wiley & Sons, Inc.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.