A new metaheuristic for optimization: Optics inspired optimization (OIO)

Due to the law of reflection, a concave reflecting surface/mirror causes the incident light rays to converge and a convex surface/mirror causes the light rays to reflect away so that they all appear to be diverging. These converging and diverging behaviors cause that the curved mirrors show different image types depending on the distance between the object and the mirror. We model such optical phenomena metaphorically into the searching process of numerical optimization by a new algorithm called optics inspired optimization (OIO). OIO treats the surface of the numerical function to be optimized as a reflecting surface in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each individual is assumed to be an artificial object (or light point) that its artificially glittered ray is reflected back by the function surface, given that the surface is convex or concave, and the artificial image is formed (a candidate solution is generated within the search domain) based on the mirror equations adopted from physics of optics. Besides OIO, we introduce different variants of it, called ROIO (Rotation based OIO), and COIO (Convex combination based OIO) algorithms and conduct an extensive computational effort to find out the merit of the new algorithms. Our comparisons on benchmark test functions and a real world engineering design application (i.e., optimization of a centrifuge pump) demonstrate that the new algorithms are efficient and compete better than or similar to most of state of the art optimization algorithms with the advantage of accepting few input parameters.     

Note on covering monotone orthogonal polygons with star-shaped polygons

In 1986, Keil provided an O(n²) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space.     

Effect of extrusion wheel angular velocity on continuous extrusion forming process of copper concave bus bar

The continuous extrusion forming process for producing large section copper concave bus bar under different extrusion wheel angular velocities was studied by three-dimensional finite element technology based on software DEFORM-3D. The rigid-viscoplastic constitutive equation was employed in the model. The numerical simulation results show that the deformation body flow velocity in the die orifice increases gradually with the increase of the extrusion wheel angular velocity. But slippage between the rod and extrusion wheel occurs when the extrusion wheel angular velocity is high. The effective stress near the die orifice enhances gradually with increasing extrusion wheel angular velocity. High stress is concentrated in adjacent regions of the flash gap. The effective strain gradient is greater near the abutment than that near the die orifice. The effective strain of the product increases gradually with increasing extrusion wheel angular velocity. In the deformation process, the deformation body temperature increases remarkably due to friction and deformation. So the cooling is necessary in the region of the die and tools.     

带环形内侧凹塑件注射模设计

根据带环形内侧凹塑件的结构特点 ,讨论了成型时塑件可采取的脱模方式 ,分析了采用顺序脱模机构时型芯的分割方法及型芯的运动过程 ,探讨了不同结构的塑件在脱模时采用的抽芯机构 ,设计出2种模具结构并指出设计时的注意事项。     

大变形零件温挤压凹模型孔设计技巧

对大变形程度、圆坯正挤压出两种变截面挤压方式进行了工艺和质量对比，在凹模型孔形式上采用了双锥角模口导流方式，第一次提出了在挤压初始阶段，利用双锥角形成大的材料初始流速和流动惯性来克服流动前期变形抗力峰值以达到模口材料周边匀速流动目的的理论。     

消除304不锈钢板坯纵向凹陷微裂纹的研究

针对太钢生产的304不锈钢板坯存在纵向凹陷微裂纹缺陷的问题，在分析其产生机理和原因的基础上，采取增加结晶器锥度，降低保护渣粘度和减弱结晶器冷却强度的工艺，取得了显著效果。     

接地板级进模设计与制造

介绍了接地板多工位级进模的结构特点和设计要点,分析了模具设计中的技术问题,得出了排样设计和解决内凹弯曲件的卸料问题的方法,对同类零件的模具设计有一定的借鉴作用.     

薄透镜成象快速调节技术

本文结合象差理论,分析了薄透镜成象的几个先路图,介绍了相应的快速调节技术．     

凹印机恒张力控制系统的研究

张力控制技术广泛应用于卷绕类自动化控制系统中,以凹印机为研究对象,详细论述了凹印机系统的张力控制原理;并设计了一套以GE公司的90系列可编程逻辑控制器为控制器,采用工控机监控系统实时状态的张力控制系统;选用西门子公司的WinCC作为系统的组态软件,并采用OPC作为软件接口标准实现GE和西门子两家不同公司产品的数据交换;该方案不仅适合本系统,而且对于这一类放卷、收卷结构的张力控制系统均有一定的参考价值;生产运行表明,该系统运行稳定,控制精度满足要求。     

Finding a minimal cover for binary images: An optimal parallel algorithm

Given a black-and-white image, represented by an array of n × n binary-valued pixels, we wish to cover the black pixels with aminimal set of (possibly overlapping) maximal squares. It was recently shown that obtaining aminimum square cover for a polygonal binary image with holes is NP-hard. We derive an optimal parallel algorithm for theminimal square cover problem, which for any desired computation timeT in [logn,n] runs on an EREW-PRAM with (n/T) processors. The cornerstone of our algorithm is a novel data structure, the cover graph, which compactly represents the covering relationships between the maximal squares of the image. The size of the cover graph is linear in the number of pixels. This algorithm has applications to problems in VLSI mask generation, incremental update of raster displays, and image compression.The research reported here forms part of the author's doctoral dissertion, submitted to Cornell University in May 1989. This work was partially supported by NSF Grant DC1-86-02256, IBM Agreement 12060043, and ONR Contract N00014-83-K-0640. A preliminary version of this paper was presented at the 26th Annual Allerton Conference on Communications, Control, and Computing, Monticello, IL, September 28–30, 1988.