一种微型空调器的优化设计

介绍了一种微型空调器的研制背景及设计方案 ,采用仿真优化的设计手段对空调器的制冷、制热系统进行了优化设计 ,实践证明其设计是成功的。同时说明了该型空调器所具有的特点及应用场合     

步进扫描时间分辨光谱及其在太阳电池光电导上的应用

建立傅里叶变换步进扫描时间分辨光电导光谱，并研究太阳电池中与转换效率密切相关的少数载流子寿命.实验选取三种典型的硅太阳电池(单晶硅样品1、多晶硅样品2和多晶硅样品3 )，发现其瞬态光电导的上升和衰退曲线可以分别用两个简单的指数函数描述.由于有复合中心的参与，复合过程中少数载流子的寿命比产生过程中的寿命短.为验证实验结果的可靠性，采用了提取样品少数载流子的体寿命和计算其有效扩散长度两种方法.通过与太阳电池暗伏安特性和负载特性研究相结合，进一步分析和讨论了少数载流子寿命与短路电流、开路电压和转换效率的关系.同时探讨了步进扫描时间分辨光谱实验的其他用途. 关键词： 步进扫描 时间分辨 硅太阳电池 瞬态光电导     

有源光放大器链路中交叉相位调制的不稳定性

利用两种方法研究了有源放大器波分复用系统光纤链路中交叉 相位调制的不稳定性．首先利用非线性薛定谔耦合方程，在小幅度扰动下，研究了正常色散 和反常色散光纤中的交叉相位调制不稳定性. 由于相位噪声涨落，利用分裂步长傅里叶 变换法与Monte-Carlo法，模拟了有源放大器链路中反常色散和正常色散情况下的调制不稳定性. 两种方法得到的结论基本一致. 关键词： 调制不稳定性 交叉相位调制 斯托克斯带 反斯托克斯 带     

Direct Observation of Non-covalent Complexes for Phosphorylated Flavonoid-protein Interaction by ESI

Diethyl flavon-7-yl phosphate was synthesized by modified Atheron-Todd reaction. The result of ESI shows that the phosphated flavonoids possess stronger binding affinities toward proteins such as myoglobin, insulin and lysozyme and are easier to form the non-covalent complexes with them.     

Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

A note on the necessary conditions for the algebraic Riccati equation

We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.     

The Classification and Realization of Complete Lie Algebras with Commutative Nilpotent Radicals

in this paper, the classification and realization of complete Lie algebras withcommutative nilpotent radicals are given. From this, some results on the radicals of thesecomplete Lie algebras are obtained.