Optimal Control of Non-well-posed Heat Equations

This work is concerned with Pontryagin＇s maximum principle of optimal control problems governed by some non-well-posed semilinear heat equations. A type of approach to the non-well-posed optimal control problem is given.     

基于MATLAB的异步电动机线性化控制系统的仿真

从异步电动机在同步旋转坐标系下的状态方程出发，在一定的条件下，对其系数矩阵简化．推出异步电动机的线性化控制模型．并基于该模型得出异步电动机的线性化控制系统．以给定电机为例，对该模型的有效性、响应用MATLAB进行仿真分析．验证的结果说明上述模型具有实用价值．     

"藏汇于国"到"藏汇于民"的外汇投资渠道探讨

为了更好地落实藏汇于民,必须拓展外汇投资渠道,使藏汇于民成为可能。文章主要探讨当前可能的主要外汇投资渠道,并就在外汇投资活动中需要注意的事项给予说明。     

Using the gradients of temperature and internal parameters in Continuum ThermodynamicsIntroduction des gradients de température et de paramètres internes en Thermodynamique des Milieux Continus

In this paper, the possibility of using the gradients of the temperature and of the internal parameters as additional state variables in Continuum Thermodynamics is considered. The expressions of the two principles are discussed and Clausius–Duhem inequality is derived under an appropriate statement of the internal entropy production. Several formulations are proposed and compared to existing results in the literature. To cite this article: P. Ireman, Q.S. Nguyen, C. R. Mecanique 332 (2004).     

CID-ICP-AES检测煤中不同形态的硫

研究了CID-ICP-AES检测煤中硫酸盐和硫铁矿形态硫的方法。较现有国标方法快速、简便，常见元素不干扰，加标回收率在98．5％-103．0％之间，10次测定的RSD在0．76％-1．59％之间。     

捷变频雷达积累脉冲数的分析与研究

在捷变频条件下 ,通过对等效独立采样脉冲数和积累增益的分析和研究 ,提供有效抑制海浪杂波的方法     

自由基CH(X2Π,a4Σ-)的光谱数据从头算研究

用分子轨道从头算方法,对CH自由基的基态(X2Π)和低激发态(a4Σ-)的光谱数据进行了计算.计算结果表明,在基态CH(X2Π)时,在QCISD(T)/6-311G (3df,3pd)水平上,计算所得的键长R=0.1120981nm,偶极矩μ＝1.5891 Debye,ν＝2845.43cm-1均与实验值相吻合,在B3PW91/6-311G (3df,3pd)理论水平上,计算的基态能量为-38.496143 Hartree,误差仅为0.22%;对低激发态CH(a4Σ-),使用含时的密度泛函方法(TDDFT)和大基组6-311 G(3df,3pd)计算所得的R=0.1094nm,垂直跃迁能量为0.926eV,均与实验结果有较好的吻合.     

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A Kind of direct methods is presented for the solution of optimal control problems with state constraints.These methods are sequential quadratic programming methods.At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and Linear approximations to constraints is solved to get a search direction for a merit function.The merit function is formulated by augmenting the Lagrangian funetion with a penalty term.A line search is carried out along the search direction to determine a step length such that the merit function is decreased.The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadrade programming methods.