Lamination Design Optimization for Continuous Fiber Reinforced Composites of Variable Thicknesses北大核心CSCD

由于具备高的比强度、比刚度,利用连续纤维增强复合材料代替传统金属材料以实现结构轻量化正受到设计者们的广泛关注。然而,结构的复杂性给复合材料的铺层设计与优化带来了很大的挑战。针对航空用复合材料铺层设计约束多的问题,通过逐步构建设计变量准确表达结构的铺层信息。基于经典遗传算法框架,结合各设计变量特点,定义了铺层优化算法中的遗传算子,通过引入“修复”策略保证了每一代解都能满足设计约束,分布在可行域区间内。最后利用精英保留策略提高了算法的局部寻优能力,可以降低复杂复合材料结构铺层设计的计算成本。通过解决经典benchmark问题并与已有优化结果的比较,验证了前述铺层优化算法的全局、局部寻优能力,为工程实际中的复合材料铺层设计优化提供了理论支撑。     

6元素集合上T0拓扑总数的计算

文中证明了有限预序集与有限偏序集的一些性质,并基于有限集上的拓扑和其上预序的一一对应关系,利用这些性质通过对极小元和极大元个数进行分类讨论,以一种有别于计算机算法而又容易理解的计算方法得出6元素集合上的T₀拓扑总数为130023.     

汽车制造商分时租赁模式采用及产品线策略研究

考虑自有平台和第三方平台两种分时租赁方式,将汽车质量划分为性能质量和环境质量,构建销售模式、纯分时租赁模式和混合模式下的产品线策略模型,研究制造商产品线策略与商业模式之间的相互作用。研究发现,同品牌产品间竞争和合并效应是分时租赁模式影响产品线策略的两个关键因素。同品牌产品间竞争的加剧和合并效应的增大都会激励企业选择性能更好的车型而忽略其环境表现。分时租赁模式能同时改进利润与产品环境表现,但存在条件:当消费者价格敏感性较低时,使用成本高且合并效应小是实现同时改进的条件;当消费者价格敏感较高时,使用成本低且合并效应小则是同时改进的条件。     

A-P-S组合策略的多重绩效及其“褪色”效应分析

为了降低城市交通拥堵及空气污染程度,本文在现有研究的基础上引入罚款政策,利用系统动力学方法原理构建了机动车污染物减排管控模型。通过仿真和比较分析来探索空气污染收费(Air pollution charging fee,简称APCF)、罚款(penalty)和补贴(subsidy)政策(简称A-P-S策略)的作用效果。研究结果表明:一方面,组合策略具有多重绩效,不但能够降低污染损失(经济-环境效益)、死亡人口的生命价值(社会-经济效益)、交通拥堵程度(社会效益)和机动车污染物总量(环境效益),而且能大大改善环境生态承载力(环境效益)和机动车非法出行增长量(社会安全绩效);另一方面,政策在实施过程中也会遇到一定的局限性,如初期的滞后性,后期的“褪色”效应和“反弹”效应,因此,从长期来看,需要及时调整组合方案。最后,根据仿真结果提出了相应的政策建议,进而为城市交通和环保等相关部门提供决策参考。     

基于主被动合作博弈的医患关系研究

针对我国医患关系日趋紧张,医患矛盾逐渐凸显这一问题,在对中国近五年医患事件进行分析的基础上,分别从信任程度、信息不对称程度、诊疗代价等多个视角出发,利用演化博弈理论和复制动态方程,构建了医患双方合作策略选择演化博弈模型,探究了影响医患关系演化的相关因素。研究表明:从长期来看,医患关系博弈系统存在两种演化路径:主动合作和被动合作;增大医患双方的信任程度,减小医患双方的信息不对称程度,降低医患双方合作成本,增大以政府为主导的仲裁机构对医患双方的奖励和惩罚都将会促使医患双方由被动合作转向主动合作。     

Finding normal solutions in piecewise linear programming

Letf: ⁿ (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min _x ¦x¦²/2+t f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)} _t 0, minimizingf over an ellipsoid, and choosing penalty parameters inL ₁QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206.     

Parameter choice by discrepancy principles for ill-posed problems leading to optimal convergence rates

Schock (Ref. 1) considered a general a posteriori parameter choice strategy for the Tikhonov regularization of the ill-posed operator equationTx=y which provides nearly the optimal rate of convergence if the minimal-norm least-squares solution belongs to the range of the operator (T ^* T) ^v , o<v1. Recently, Nair (Ref. 2) improved the result of Schock and also provided the optimal rate ifv=1. In this note, we further improve the result and show in particular that the optimal rate can be achieved for 1/2v1.The final version of this work was written while M. T. Nair was a Visiting Fellow at the Centre for Mathematics and Its Applications, Australian National University, Canberra, Australia. The work of S. George was supported by a Senior Research Fellowship from CSIR, India.     

Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.     

An exact algorithm for the maximum stable set problem

We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to real-life problems show that the algorithm is competitive with the fastest algorithms known so far.This work has been supported by Agenzia Spaziale Italiana.