光学薄膜在现代汽车工业中的应用

本文论述应用光学薄膜技术对汽车窗口玻璃和塑料的若干性能进行改进的技术发展水平，这些性能包括塑料表面的硬化，红外区的反射，紫外区的吸收，偏振化作用，双折射，憎水性以及光学角度选择性等，评论等离子体处理和物理蒸汽淀积薄膜工艺近来应用的一些例子。对于物理蒸汽淀积薄膜所提供的异常功能连同实际使用中它们的耐久性作了特殊的强调。     

不等式约束优化问题的一个势函数

基于Carroll(1961)建立的罚函数，本文给出了不等式约束优化问题的一个势函数，并且讨论了该函数的性质．最后证明了在此基础上建立的对偶算法具有Q-线性收敛性．     

物理实验课程考核、评估体系初探

对物理实验课程考核、评估方法进行了探讨，提出了物理实验课程考核、评估体系及实施细则．重点介绍了体系中的核心部分——正规的物理实验课程考试．     

Systems of generalized quasivariational inclusions problems with applications to variational analysis and optimization problems

In this paper, we study an existence theorem of systems of generalized quasivariational inclusions problem. By this result, we establish the existence theorems of solutions of systems of generalized equations, systems of generalized vector quasiequilibrium problem, collective variational fixed point, systems of generalized quasiloose saddle point, systems of minimax theorem, mathematical program with systems of variational inclusions constraints, mathematical program with systems of equilibrium constraints and systems of bilevel problem and semi-infinite problem with systems of equilibrium problem constraints. This research was supported by the National Science Council of the Republic of China.     

����Լ���������������MinimaxԤ��

本文研究了独立随机变量之和的绝对矩的几个性质, 其中包括$\ep|X+Y|-\ep|X-Y|$的表达式, 这里$X$和$Y$是相互独立的随机变量.     

Linear least squares problems with data over incomplete grids

The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points, there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data. We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality constraints. Numerical examples are given to show the effectiveness of the technique presented. AMS subject classification (2000)  65D05, 65D07, 65D10, 65F05, 65F20     

一种新的磷化铟复合沟道高电子迁移率晶体管小信号物理模型

针对磷化铟(InP)复合沟道高电子迁移率晶体管(HEMT)的特点，对常规单沟道HEMT的小信号物理模型进行了修正，提出了一种新的用于复合沟道HEMT的小信号物理模型，用商用器件模拟软件ISE(integrated systems engineering)对其进行了仿真验证，对比了实测和仿真的I-V特性及转移特性曲线，重点研究了在InGaAs/InP双层沟道中考虑量子效应后的电场和电流密度随着不同栅电压的变化趋势，研究结果表明，由于在沟道中存在量子效应，在栅下靠源端低电场区域，电流主要分布在InGaAs沟道 关键词： 高电子迁移率晶体管 复合沟道 物理模型 磷化铟     

大学物理实验教学的认识与体会

本文结合工作实际介绍了大学物理实验教学的认识与体会。     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.