拓扑优化变密度法的灰度单元分层双重惩罚方法

在连续体结构拓扑优化中,应用敏度过滤法可有效地去除数值不稳定问题,但易出现优化结构边界灰度扩散现象.为了获得边界清晰的拓扑结果,提出一种变密度法的灰度单元分层双重惩罚方法.该方法通过调节不含敏度过滤的SIMP优化算法中的惩罚因子,对过滤后单元敏度进行修正,加速中间密度单元向0或1的离散状态逼近.为了加快这个过程,将该方法与分层网格细分策略相结合,优化从一个粗的有限元网格开始,利用单元密度等效映射方法将粗网格求解优化问题的结果映射为同一问题具有更细网格的初始输入,通过减少优化过程中的计算消耗,在取得具有清晰边界拓扑结构的同时提升优化过程的收敛速率.采用不同方法求解MBB梁,对最终优化结构中所含的中间密度单元数量和优化所需时间消耗进行对比;利用不同网格划分下的悬臂梁算例验证该方法的网格依赖性.结果表明,结合分层双重惩罚的SIMP算法在保留原始求解稳定性的同时,能获得具有清晰边界的拓扑构型,并提升收敛速率.     

结合单元渐进删除的变密度拓扑优化方法EI北大核心CSCD

在面向连续体拓扑优化问题的固体各向同性惩罚微结构模型中,由于密度或灵敏度过滤的存在,优化结果中会出现灰度单元,影响结构的清晰度.针对此问题,运用渐进结构优化法的思想提出了一种结合单元渐进删除的变密度法.在SIMP法的基础上加入单元渐进删除的过程,单元删除阈值由平均单元相对密度及缩减系数确定,引入包括2个可调控参数的Sigmoid函数表达缩减系数,从而逐渐删除优化过程中产生的灰度单元.在讨论参数取值变化对缩减系数影响的基础上,以MBB梁为例确定参数取值的范围.将结合单元渐进删除的变密度法应用于MBB梁和悬臂梁柔度优化的算例,实验结果表明,该方法可与灵敏度过滤、密度过滤以及Heaviside投影相结合,具有较好的通用性,并能够有效地抑制SIMP法的灰度单元,显著地提升了优化效率.     

基于结构拓扑优化方法的发动机支架轻量化设计

为实现某发动机支架轻量化设计,在支架总成整体结构有限元分析的基础上,运用等效刚度原则建立支架局部有限元模型,得到不同工况下的支架位移分布结果.基于TOSCA软件,通过提取结构分析结果对支架结构拓扑优化模型进行敏度分析并形成优化模型列式.优化求解后,在每轮循环迭代中将新的单元密度值重新赋予结构模型,直至满足预先给定的收敛判定条件;设置过滤半径和各类制造加工约束,消除结构拓扑优化中的数值不稳定性问题,改善优化结果的可加工性.对优化前后的计算结果进行对比分析.     

灰度投影结合Fisher准则的对象分割

视频对象分割是基于内容的视频编码和视频检索中的的对象跟踪方法,提出了一种可以从复杂场景中分割出MPEG-4的视频对象新方法.首先采用灰度投影匹配进行全局运动估计和补偿,用以消除背景变化的影响;然后由二次差分抽取中间帧解决遮挡问题,通过Fisher评价函数结合数学形态学填充得到运动对象分割掩膜,同时消除残余噪声以及平滑边缘.实验结果表明,该方法在一定范围内较好地解决了遮挡问题,并能够高效快速地得到比较精确的视频对象.     

基础简谐激励下的结构动响应拓扑优化

针对关于结构动响应拓扑优化问题的研究较少、有限元分析软件的拓扑优化模块无法实现的问题,采用变密度法研究连续体结构在基础简谐激励下的动响应拓扑优化.将基础简谐激励下的响应控制问题归结为结构在体积约束下目标点响应幅值最小化的优化模型;推导有阻尼结构在基础简谐激励下目标点响应幅值的灵敏度公式;采用变密度法求解该优化问题.采用多项式惩罚模型解决带惩罚的各向同性固体微结构（Solid Isotropic Microstructure with Penalization,SIMP）模型带来的附属效应现象;采用灰度过滤方法改善经典变密度法在优化过程中灰度单元收敛过慢的问题,从而减少变密度法优化的迭代步数并且使优化结果更清晰.以平面悬臂板模型为例,验证该优化方法对目标点响应幅值的优化以及灰度过滤函数对优化迭代的改善.     

基于拓扑和形貌优化的驾驶室结构设计

为实现汽车零部件的创新设计,以某工程车驾驶室的简化有限元模型为研究对象,用HyperMesh作前处理,在OptiStruct中建立多工况条件下拓扑优化与形貌优化组合的整体优化模型,通过OSSmooth工具将优化后的结果导出后在CATIA V5中显示.拓扑和形貌组合优化技术的实践表明,该方法对产品部件的综合设计具有较好的适用性,可为设计人员提供设计思路.     

基于声灵敏度的车身拓扑优化

为探讨板件结构对车内噪声的影响,建立某商务车的白车身有限元模型,分析其模态和车身声灵敏度,确定对汽车低频振动和噪声影响较大的板件;结合变密度法在整车环境下对板件进行减振降噪的拓扑优化,根据拓扑优化结果对板件进行结构修改. 优化后的车身声灵敏度曲线与原车身声灵敏度曲线相比,低频范围内的峰值都有不同程度的降低,表明结合整车动态响应的汽车板件结构拓扑优化可以有效降低车内低频振动噪声.     

基于主应力删除准则的ESO法及其应用

为促进渐进结构优化（Evolutionary Structure Optimization,ESO）法在桥梁找型方面的应用,阐述基于主应力删除准则ESO法的基本原理,研究不同M值对优化结果的影响,并建议在应用该法进行拓扑优化时取M≥10.应用基于拉应力占优删除准则的ESO法分析高跨比对缆索支承桥形式的影响,结果表明：当高跨比大于等于1/7时缆索支承桥的最优形式为斜拉桥;当高跨比低于1/7时最优形式为悬索桥.     

改进的Gray World-Retinex图像自动白平衡方法

提出了一种改进的白平衡方法,改善了Gray World-Retinex算法对色彩丰富度低、近白(灰)点数量较少的图像白平衡后仍然偏色的缺点.使用图像Cb和Cr分量的样本标准差分析图像色彩丰富度.并改进了确定图像近白(灰)点数量的方法,最终定量地给出适合采用Gray World-Retinex白平衡法的图像特征,对于样本标准差极低而且近白(灰)点很少的图像,给出一种求极大值增益的方法进行白平衡.对40幅色彩丰富度和近白(灰)点数量不同的偏色图像进行验证,并与Gray World-Retinex算法作了对比.结果表明,本文算法对于具有不同色彩丰富程度和近白(灰)点数量的偏色图像,都可以获得较理想的白平衡效果.该算法复杂度低,对图像实时处理具有很大吸引力.     

灰度图像中字符切分方法的研究

字符切分目前已经成为限制OCR技术发展的瓶颈,对于图像质量较差、中英文混排和背景色变化的文本图像,传统切分方法造成的切分错误使得文字识别率大大降低。针对这些问题,本文提出了新型文字切分方法。该方法先将灰度图像的灰度值进行分级处理,再根据分级连通域的概念把整个图像构造成树状结构,然后确定主层次级别,根据一定的规则在部分节点上进行合并、分割等进一步处理,最后得到最优的切分结果。实验结果表明,该方法能够取得比常规切分方法更好的切分效果。     

The Quasistability Criterion for a Vector Path Problem with a Majority Principle of Optimality

A multicriteria path problem of majority optimization is considered. The partial criteria are MINSUM, MINMAX, and MINMIN. Necessary and sufficient conditions are found under which "small" independent perturbations of the vector criterion parameters preserve the majority efficiency of all the solutions and do not exclude emergence of new solutions.     

一种用于模拟电路仿真的改进型迭代算法

模拟电路的仿真问题最终归结为对线性代数方程组的求解。利用分块化方法可以降低求解过程中Jacobi矩阵的维数,从而有效降低求解时间。如何降低求解线性方程组的迭代次数,是有效降低求解时间的另一重要问题。首先详细分析了用于求解模拟电路代数方程中Jacobi矩阵的划分问题,然后提出一种改进的隐式迭代方法。最后,通过实验分析了算法中内迭代次数Iin对总迭代次数的影响,该结论对提高整体加速比具有指导意义。     

A Modified Variational-Gradient Method for Quasilinear Equations

A modified variational-gradient method is proposed and substantiated for quasilinear operator equations in a Hilbert space.     

A Subspace Cascadic Multigrid Method for Mortar Elements

A cascadic multigrid (CMG) method for elliptic problems with strong material jumps is proposed and analyzed. Non–matching grids at interfaces between subdomains are allowed and treated by mortar elements. The arising saddle point problems are solved by a subspace confined conjugate gradient method as smoother for the CMG. Details of algorithmic realization including adaptivity are elaborated. Numerical results illustrate the efficiency of the new subspace CMG algorithm. Received December 14, 2001; revised September 2, 2002 Published online: November 18, 2002     

Analytic Controlling Reorientation of a Spacecraft Using a Combined Criterion of Optimality

We consider the problem of optimally controlling the reorientation of a spacecraft (SC) from an arbitrary initial angular state into a given final angular position. We study the case when the minimized functional joins, in the given proportion, the time spent and the integral of the squared modulus of the angular momentum on the reorientation of a SC. The problem is solved in a kinematic setting. We consider two versions of the problem of the optimal rotation of a SC, with bounded and unbounded control. Using the necessary optimality conditions in the form of the Pontryagin maximum principle and the quaternion method for solving control problems on the motion of spacecrafts, we obtain an analytical solution of the posed problem. The solution of the problem is based on the quaternionic differential equation relating the angular momentum vector of a SC with the orientation quaternion of the related coordinate system. We present formalized equations and give computational expressions for constructing the optimal control program. We state the control law as an explicit dependence of the control variables on the phase coordinates. Using the transversality condition as a necessary optimality condition, we determine the maximal value of the modulus of the angular momentum for the optimal motion. For a dynamically symmetric SC, the problem of reorientation in space is solved completely: we obtain the dependences for the optimal law of the change of the angular momentum vector as explicit time functions. We give the results of the mathematical modeling of the motion for optimal control which demonstrate the practical realizability of designed algorithm for controlling the spatial orientation of a SC.     

A Modified Quasi-Newton Method for Optimization in Simulation

Optimization in Simulation is an important problem often encountered in system behavior investigation; however, the existing methods such as response surface methodology and stochastic approximation method are inefficient. This paper presents a modification of a quasi-Newton method, in which the parameters are determined from some numerical experiments. To demonstrate the validity of the devised method, two examples resembling the M/M/1 queueing problem are solved. The closeness of the converged solutions to the optimal solutions and a comparison with two stochastic approximation methods indicate that the modified quasi-Newton method as devised in this paper is a robust and efficient method for solving optimization problems in simulation.     

舰船动力装置模拟器改进设计

受当时仿真技术条件的限制,一代舰船动力装置模拟器硬件运行可靠性差,故障率越来越高;模拟对象软件非标准化、非模块化,在线修改不便;可视化软件实时性不强;教练员控制台运行功能弱,目前已不能适应当前新的使命任务要求,影响到模拟器的正常使用.结合现代仿真技术,该文对模拟器的软、硬件系统提出了可行的改进方法,给出了改进后的舰船动力装置模拟训练系统,使模拟器整体性能有了显著提高,满足了当前使用需求.     

Simplifying Triangular Mesh Modelby Modified Distance Criterion

Model simplification is used in a variety of disciplines, such as vir'tUal reality, CAD anddynamic simulation. The method of model simplification is an important problem. This paperpresents a new method to delete vertex from mesh model for simplification, in which the modifieddistance actS as deletion criterion. In order to improve the mesh quality, the poyer uses an optimalmethod based on swapping diagonal for retriangulating the local polygon. By the method. thesimplified model can approximate original model very well. An example to illustrate the efficiencyof the method is given.