Ⅰ类超晶格势阱中能级分布及电子跃迁规律研究

在研究大量实验曲线的基础上,指出势阱所有能级均有一定的宽度,电子或空穴在各能级中出现的概率符合正态分布,从理论上分析了I类超晶格和双势垒单势阱的发光光谱与吸收光谱·解释了GaAs/Ga1-xAlxAs多量子阱和超晶格吸收光谱吸收边及量子阱变窄时各吸收峰的“蓝移现象”及GaAs/Ga1-xAlxAs双势垒单量子阱样品的电流—电压特性曲线及电导—电压特性曲线的特征和出现的“负阻效应”·     

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.     

表面活性剂对均相沉淀法制备单晶Ce2O(CO3)2￠H2O微粉形貌及 形成机理的影响

在尿素及硝酸铈的混合溶液中分别加入表面活性剂CTAB、 PEG19000、OP-10,利用均相沉淀法合成了不同形貌的CeO2超细前驱体Ce2O(COa)2·H2O,采用X射线衍射及透射电子显微镜等测试手段,对产品的物相和形貌进行了表征．实验结果表明,所得产品均为斜方晶系的单晶Ce2O(CO3)2·H2O,且表面活性剂的加入使晶体的晶化程度明显提高;添加不同的表面活性剂得到不同形貌尺寸的产物: 阳离子型表面活性剂CTAB对Ce2O(CO3)2·H2O晶体的形貌影响不大,所得产物尺寸变小,且分散性得到一定的改善;非离子型表面活性剂对所得产物的形貌影响显著．加入PEG19000和OP-10分别得到了形状排列有序的、尺寸较均匀的、较规则无团聚的微米棒及具有紧密结合中心的发散状的花样微粒．不同形貌前驱体的形成与晶粒形成生长机理的改变有关．     

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

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

Synthesis and Properties of a Heteronuclear Ag（Ⅰ）/Ni（Ⅱ） Complex

Introduction Itiswell knownthatcyanogroupsincyanometa latessuchas[Ag(CN)2]-unitscanbeusedasbridg ingligandsandapolymericstructurecanbeformed throughsilver silver(argentophilic)interactions.This propertyhasbeenexploredintheconstructionofmany oligomericandp…     

Polarization inscription in ferroelectric (111) PZT and (100) SBT films

Ferroelectric thin films form an equilibrium domain structure compatible with their respective crystallographic symmetry. In tetragonal (111) PZT, 90° domains prevail; in (pseudo-tetragonal) (100) SBT both 90° and 180° domains are present. The size of 90° domains has been measured for e.g., PZT as slabs of 15 nm width. Domain size is a result of stress minimization in the film during the paraelectric (PE) → ferroelectric (FE) transition. A precise and regular domain pattern for (111) PZT and (100) SBT films has been investigated in detail by TMSFM. Single domains can be addressed mechanically with the tip of an AFM. Such single domain switching corresponds to a data storage density of 200 Gbit/inch². Applications of ferroelectric and high- paraelectric materials for e.g., non-volatile data storage replacing DRAM devices or as sensors in infrared cameras are increasingly becoming popular.     

A multi-target approach for isolated word recognition using artificial neural network

I.TntroductionStatisticalandneuralnetworkmcthodsforpatternclassiflcationusesignificantlydifTerentapproachesintrainingaclassificr.Inthestatistica1approach,thcformationofaclassifier1arge1ydependsonthestatisticsofthetrainingpatternsand,insomecases,theassumptionsaboutthedistributionofthepopulation.Theneuralnetworkmethodisnon-parametricandcanbeadaptivcinthetrainingprocessl'l.Becauseofitssimplicityandflexibility,theneuralnetworkhasbecnincreasing1yusedforpatternclassiflcation.Itisnowwe11knownthatan…     

带有边集限制的最均匀支撑树问题

本在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型．中首先解决最均匀支撑树问题，并给出求无向网络中最均匀支撑树的多项式时间算法；然后，给出了求无向网络中带有边集限制的最小树多项式时间算法；最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题．