有关力学谱和内耗工作的综合与回顾

本文广泛地收集了有关内耗，力学谱，超声衰减方面的专著及会议文集。反映了20世纪在此领域的英文，俄文出版的书籍。也列出了历次国际会议及前苏联，乌克兰，中国的国内会议。文中包括了点缺陷，电，声子，位错，晶界，电畴等诸方面在内的内耗与力学谱工作。     

(2+1)维广义Nizhnik-Novikov-Veselov系统的新严格解和复合波激发

利用拓展的Riccati方程映射法与变量分离法，得到了(2+1)维广义Nizhnik-Novikov-Veselov(GNNV)系统新的含有两个任意函数的相当广义的变量分离严格解.根据其中的周期波解，找到了该系统的复合波，即在周期波背景下的孤立波，并简要讨论了其演化行为. 关键词： GNNV系统 拓展Riccati映射 周期波解 孤立波     

非对称三态叠加多模泛函叠加态光场的高次压缩——广义电场分量的不等幂次和压缩效应研究

多模真空态|{0j}〉q与两个空间强度分布特征不同的多模复共轭泛函相干态|{f(j a)*(x,y,z)}〉q和|{f(j b)*(x,y,z)}〉q的线性叠加组成的三态叠加多模泛函叠加态光场|ψ(f3)〉q,利用多模压缩态理论,研究了态|ψ(f3)〉q中广义电场分量的不等幂次高次和(H)压缩特性.结果表明:在一定的条件下,态|ψ(f3)〉q的广义电场分量可呈现出周期性变化的任意奇数次和任意偶数次的不等幂次高次H压缩效应;光场的经典振幅和经典初始相位的任意非对称空间分布特征对其压缩程度和压缩深度等压缩特性将产生直接的影响.     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.     

One-Parameter Fixed-Point Theory and Gradient Flows of Closed 1-Forms

We use the one-parameter fixed-point theory of Geoghegan and Nicas to get information about the closed orbit structure of transverse gradient flows of closed 1-forms on a closed manifold M. We define a noncommutative zeta function in an object related to the first Hochschild homology group of the Novikov ring associated to the 1-form and relate it to the torsion of a natural chain homotopy equivalence between the Novikov complex and a completed simplicial chain complex of the universal cover of M.     

Absorption Complex between Porphyrin and Phenothiazine in Reverse Micelles

Porphyrin derivatives attract much more interest in photodynamic therapy (PDT). Their importance as therapeutic drugs and targeting agents has been widely recognized1, and many of the efforts have been put towards crafting new porphyrin-based molecular entities to achieve enhanced tumor localization, better tissue penetration and increased singlet oxygen quantum yield2. The states of porphyrins in tissue models such as micelles, lipid bilayers are extensively investigated focusing more or l…     

基于模糊神经网络的自适应PID控制器

提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。     

Explicit formula of holomorphic automorphism group on complex homogeneous bounded domains

We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G.