电视节目制作领域中的非线性编辑系统

非线性编辑系统是以计算机为操作平台的电视节目后期编辑制作设备,随着计算机技术的飞速发展,非线性编辑系统已广泛应用于电视节目的制作.介绍了非线性编辑系统的组成及其在电视节目制作中的主要功能.     

最坏情况电路分析(WCCA)

阐述了当前可靠性工程中热门的分析技术，为裕度设计与健壮设计提供依据。为了便于操作，给出了分析程序与方法，特别举出分析示例。文中所提出简便检查方法，有独到之处。     

线形脑啡肽(N-Tyr1-Gly2-Gly3-Phe4-Leu5)的NMR溶液构象研究

本文在Bruker AM-400 NMR谱仪上,在不同温度下研究了线形脑啡肽(N-Tyr¹-Gly²-Gly³-Phe⁴-Leu⁵)在DMSO中的NMR溶液构象。由NMR测试结果,得到了NH化学位移温度梯度系数、扭转角φ、χ'约束和¹H-¹H NOE距离约束,用目标函数法计算了脑啡肽的溶液构象,分析了优势边链构象。研究结果指明了多肽骨架的柔变性且处于构象平衡中。     

直接施加本质边界条件的FE／EFG耦合算法及其数值实现

提出一种可以直接施加本质边界条件的有限元与无网格Galerkin（FE／EFG）耦合算法。将问题域分成FE和EFG两种类型的子域,采用转换矩阵耦舍两子域的交界面;通过另一转换矩阵将无网格区域本质边界上的名义位移转换成真实位移,从而可在其上直接施加本质边界条件;采用二次转换实现两种转换矩阵之间的协调。提出全域统一采用单元...     

The discrete-dipole-approximation code ADDA: Capabilities and known limitations

The open-source code ADDA is described, which implements the discrete dipole approximation (DDA), a method to simulate light scattering by finite 3D objects of arbitrary shape and composition. Besides standard sequential execution, ADDA can run on a multiprocessor distributed-memory system, parallelizing a single DDA calculation. Hence the size parameter of the scatterer is in principle limited only by total available memory and computational speed. ADDA is written in C99 and is highly portable. It provides full control over the scattering geometry (particle morphology and orientation, and incident beam) and allows one to calculate a wide variety of integral and angle-resolved scattering quantities (cross sections, the Mueller matrix, etc.). Moreover, ADDA incorporates a range of state-of-the-art DDA improvements, aimed at increasing the accuracy and computational speed of the method. We discuss both physical and computational aspects of the DDA simulations and provide a practical introduction into performing such simulations with the ADDA code. We also present several simulation results, in particular, for a sphere with size parameter 320 (100-wavelength diameter) and refractive index 1.05.     

互补约束规划问题的一个广义梯度投影算法

本文研究了一类均衡约束最优化问题.利用广义梯度投影法,结合罚函数思想,得到了一个初始点可以任意的广义梯度投影算法.在较弱的条件下,证明了算法的全局收敛性.     

Combining the regularization strategy and the SQP to solve MPCC — A MATLAB implementation

Mathematical Program with Complementarity Constraints (MPCC) plays a very important role in many fields such as engineering design, economic equilibrium, multilevel games, and mathematical programming theory itself. In theory its constraints fail to satisfy a standard constraint qualification such as the linear independence constraint qualification (LICQ) or the Mangasarian-Fromovitz constraint qualification (MFCQ) at any feasible point. As a result, the developed nonlinear programming theory may not be applied to MPCC class directly. Nowadays, a natural and popular approach is trying to find some suitable approximations of an MPCC so that it can be solved by solving a sequence of nonlinear programs.This work aims to solve the MPCC using nonlinear programming techniques, namely the SQP and the regularization scheme. Some algorithms with two iterative processes, the inner and the external, were developed. A set of AMPL problems from MacMPEC database (Leyffer, 2000) [8] were tested. The comparative analysis regarding performance of algorithms was carried out.     

混合整数二次规划问题的全局最优性条件

本文给出了混合整数二次规划问题的全局最优性条件,包括全局最优充分性条件和全局最优必要性条件.我们还给出了一个数值实例用以说明如何利用本文所给出的全局最优性条件来判定一个给定点是否是全局最优解.