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.     

平板折叠桌的设计模型

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

折衍混合复消色差望远物镜设计的PWC方法

将衍射结构视为折射率无限大的薄透镜,研究了衍射透镜高折射率表示的折衍混合复消色差望远物镜设计的PWC方法;设计了焦距为2000mm、相对孔径为1/15的双片型折衍混合复消色差望远物镜,并与常规三片型纯折射复消色差望远物镜进行了比较,结果表明双片型折衍混合复消色差望远物镜具有更好的二级光谱校正能力,色球差更小,因此具有更好的成像质量.     

对自由落体的诺维科夫时间与牛顿绝对时间关系讨论

文章首先将史瓦西黑洞场中自由下落质点的固有时(诺维科夫坐标时)公式,由自然单位制化成了国际单位制中的形式.然后,根据牛顿第二定律和万有引力定律,推导出了自由下落质点经历的绝对时间公式,进而证明了广义相对论中自由落体经历的固有时,恰好等于牛顿力学给出的绝对时间.最后,对自由下落质点在黑洞内外经历的时间进行了特例计算.     

Pole placement controllers for linear time-delay systems with commensurate point delays

This paper investigates the exact and approximate spectrum assignment properties associated with realizable output-feedback pole-placement type controllers for single-input single-output linear time-invariant time-delay systems with commensurate point delays. The controller synthesis problem is discussed through the solvability of a set of coupled diophantine equations of polynomials. An extra complexity is incorporated to the above design to cancel extra unsuitable dynamics being generated when solving the above diophantine equations. Thus, the complete controller tracks any arbitrary prefixed (either finite or delaydependent) closed-loop spectrum. However, if the controller is simplified by deleting the above mentioned extra complexity, then the robust stability and approximated spectrum assignment are still achievable for a certain sufficiently small amount of delayed dynamics. Finally, the approximate spectrum assignment and robust stability problems are revisited under plant disturbances if the nominal controller is maintained. In the current approach, the finite spectrum assignment is only considered as a particular case to the designer‘s choice of a (delay-dependent) arbitrary spectrum assignment objective.