Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

高精度CCD尺寸自动检测系统的光学系统设计

介绍测量精度为±０．００３ｍｍ的ＣＣＤ尺寸检测系统的光学系统设计特点及远心物镜设计原理，并给出了测试结果。     

The Cross-Entropy Method for Continuous Multi-Extremal Optimization

In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear constraints.      

On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program

In this paper an algorithm is developed to generate all nondominated extreme points and edges of the set of objective values of a multiple objective linear program. The approach uses simplex tableaux but avoids generating unnecessary extreme points or bases of extreme points. The procedure is based on, and improves, an algorithm Dauer and Liu developed for this problem. Essential to this approach is the work of Gal and Kruse on the neighborhood problem of determining all extreme points of a convex polytope that are adjacent to a given (degenerate) extreme point of the set. The algorithm will incorporate Gal's degeneracy graph approach to the neighborhood problem with Dauer's objective space analysis of multiple objective linear programs.     

Unveiling Latent Structure of Venture Capital Syndication Networks

Venture capital (VC) is a form of private equity financing provided by VC institutions to startups with high growth potential due to innovative technology or novel business models but also high risks. To against uncertainties and benefit from mutual complementarity and sharing resources and information, making joint-investments with other VC institutions on the same startup are pervasive, which forms an ever-growing complex syndication network. Attaining objective classifications of VC institutions and revealing the latent structure of joint-investment behaviors between them can deepen our understanding of the VC industry and boost the healthy development of the market and economy. In this work, we devise an iterative Loubar method based on the Lorenz curve to make objective classification of VC institutions automatically, which does not require setting arbitrary thresholds and the number of categories. We further reveal distinct investment behaviors across categories, where the top-ranked group enters more industries and investment stages with a better performance. Through network embedding of joint investment relations, we unveil the existence of possible territories of top-ranked VC institutions, and the hidden structure of relations between VC institutions.     

微球动态涂敷状态实时监测光学系统的设计

 介绍了一种可用于实时监测直径0.2～1.0 mm激光核聚变靶球涂敷状态的光学系统的设计,系统采用环形LED照明系统以适合特殊的照明要求,用Petzval型物镜使500 mm处的微球清晰成像于CCD像面上,CCD输出的图像电信号经图像采集卡转换成数字信号,最后该数字信号由计算机进行处理,实现了系统对靶球膜层涂敷作业的自动监控,大大提高了涂敷效率。所设计的系统轴上点最大弥散斑直径为12.6 mm,轴外最大弥散斑直径为15.8 mm,整个视场的像质比较均匀,分辨率较高,对于波长522 nm的光线,场曲和畸变分别小于15 mm和0.012%,像质优良。     

带对准光路的激光细胞穿孔显微物镜设计

针对近红外光谱可对活体组织进行无损伤穿孔,并解决在穿孔中需要重新对焦的问题,通过Zemax软件对7片式前置光阑显微物镜结构在0.48～1.48mm波长范围内进行了宽光谱消色差的优化设计。设计实现了像距为无限远的多光谱共焦成像,其放大倍率为40,数值孔径0.5,最大焦面漂移量仅为27mm,可见光波段在空间频率为350 lp/mm时,0.7视场的MTF＞0.5,具有较高的分辨力。并且在波长1480 nm处,MTF值接近衍射极限,具有较高的能量,满足细胞穿孔的要求。文中还给出了实验结果,并预测其应用前景。     

一种基于人脸区域的图像质量客观评价算法

提出了一种基于人脸区域的图像质量客观评价模型算法,该算法将整个图像区域划分为感兴趣区域(人脸区域)和不感兴趣区域,对这两个区域内的图像损伤,在计算中分别赋予不的权重,以体现人眼的感知兴趣.实验证明通过该模型算法得到的客观评价结果与人眼的主观感觉具有更好的一致性.     

平板折叠桌的设计模型

根据折叠桌的运动特征,选取折叠桌的四分之一为研究对象,建立任意角度下桌脚点的运动变化模型。考虑到产品稳固性、加工便利性和节约用材三方面对加工参数的影响,对折叠桌进行受力分析,得到多目标组合优化模型,用以确定出折叠桌的最优设计参数。针对用户提出的桌面形状要求,建立桌脚曲线的参数方程。作为模型推广,以椭圆状折叠桌为例,运用Matlab画出了桌脚边缘线在折叠过程中的动态变化示意图。同时,又深入研究Robert van Embricqs的滑动折叠桌,建立了新的桌脚曲线参数方程。最后,运用Matlab对多种形状折叠桌进行仿真,编写多目标优化算法,得出了最优加工参数,并进行了算法描述。     

高维多目标优化中基于稀疏特征选择的目标降维方法

目标降维算法通过去除冗余的目标达到简化问题规模的目的,为求解高维多目标优化问题提供了一种新的思路和方法.近似解集的几何结构特征和Pareto占优关系从不同侧面反映了多目标优化问题的内在结构特性,而现有算法仅利用其中一种特征分析目标之间的关系,具有较大局限性.本文提出基于稀疏特征选择的目标降维方法,该方法利用近似解集的几何结构特征构建稀疏回归模型,求解高维目标空间映射为低维目标子空间的稀疏投影矩阵,依据此矩阵度量目标的重要性,并利用Pareto占优关系改变程度选择满足误差阈值的目标子集,实现目标降维.通过与其他已有目标降维算法比较,实验结果表明本文提出的降维算法具有较高的准确性,并且受近似解集质量的影响较小.