层间位移约束下高层框架支撑结构的单步优化法

从虚功角度将基于层间位移约束的高层建筑规则结构多约束优化问题转化为基于顶层整体转动的单约束问题,并提出了基于虚功的单步优化法.通过算例分析了单步优化法应用情况,并将其优化结果与SAP2000有限元分析软件优化结果进行对比.结果表明:针对层间位移约束,采用单步优化法用钢量节省约10%.     

含一般模糊弹性约束的广义模糊变量线性规划

建立并讨论了一类含有一般模糊弹性约束的广义模糊变量线性规划问题.首先,简单介绍了结构元方法并对结构元加权排序中权函数表征决策者风险态度进行了深入分析.然后选取风险中性的决策者来定义序关系,应用Verdegay模糊线性规划方法将含一般模糊弹性约束的广义模糊变量线性规划转化经典的线性规划问题,简化了原问题的求解.最后通过数值算例进一步说明了该方法的有效性.     

Vibration of strings with nonlinear supports

The dynamic string motion, which displacement is unilaterally constrained by the rigid termination condition of an arbitrary geometry has been simulated and analyzed. The treble strings of a grand piano usually terminate at a capo bar, which is situated above the strings. The apex of a V-shaped section of the capo bar defines the end of the speaking length of the strings. A numerical calculation based on the traveling wave solution is proposed for modeling the nonlinearity inducing interactions between the vibrating string and the contact condition at the point of string termination. It was shown that the lossless string vibrates in two distinct vibration regimes. In the beginning the string starts to interact in a nonlinear fashion with the rigid terminator, and the resulting string motion is aperiodic. Consequently, the spectrum of the string motion depends on the amplitude of string vibrations, and its spectral structure changes continuously with the passage of time. The duration of that vibration regime depends on the geometry of the terminator. After some time of aperiodic vibration, the string vibrations settle in a periodic regime where the resulting spectrum remains constant.     

新知与旧俗：江西高校大学生性别刻板的觉察与松动

江西高校大学生婚恋观调查结果显示,男女大学生之间存在诸多共性,其相似性远高于差异性。尽管性别差异的确存在,但非常小,不如传媒所传说的那样显著。女大学生较之男大学生而言,性别观念相对更为开放与包容,更反映出对传统性别期待的挑战与突破。     

On safe tractable approximations of chance constraints

A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1 − ?. While being attractive from modeling viewpoint, chance constrained problems “as they are” are, in general, computationally intractable. In this survey paper, we overview several simulation-based and simulation-free computationally tractable approximations of chance constrained convex programs, primarily, those of chance constrained linear, conic quadratic and semidefinite programming.     

完全模糊线性规划及其近似计算

在扩充LR-模糊数定义的基础上,讨论了完全模糊约束条件的近似表示和转化定理;在新的模糊数序关系下,将完全模糊线性规划问题直接转化为分明的线性规划进行求解;与已有的结果进行了比较,并给出了算例.     

Female Faculty: Why So Few and Why Care?

Despite slow ongoing progress in increasing the representation of women in academia, women remain significantly under-represented at senior levels, in particular in the natural sciences and engineering. Not infrequently, this is downplayed by bringing forth arguments such as inherent biological differences between genders, that current policies are adequate to address the issue, or by deflecting this as being “not my problem” among other examples. In this piece we present scientific evidence that counters these claims, as well as a best-practice example, Genie, from Chalmers University of Technology, where one of the authors is currently employed. We also highlight particular challenges caused by the current COVID-19 pandemic. Finally, we conclude by proposing some possible solutions to the situation and emphasize that we need to all do our part, to ensure that the next generation of academics experience a more diverse, inclusive, and equitable working environment.     

一类多乘积优化问题求解的新方法

利用所考虑问题的结构特点,提出一种新的线性化方法.该方法利用函数的二阶导数信息,线性化过程更为直接.为改善算法收敛速度,提出一个新的区域缩减准则.理论上证明了算法的收敛性,数值算例表明算法是有效可行的.     

An effective estimation of distribution algorithm for parallel litho machine scheduling with reticle constraints

In order to improve the scheduling efficiency of photolithography, bottleneck process of wafer fabrications in the semiconductor industry, an effective estimation of distribution algorithm is pro-posed for scheduling problems of parallel litho machines with reticle constraints, where multiple reti-cles are available for each reticle type.First, the scheduling problem domain of parallel litho ma-chines is described with reticle constraints and mathematical programming formulations are put for-ward with the objective of minimizing total weighted completion time.Second, estimation of distribu-tion algorithm is developed with a decoding scheme specially designed to deal with the reticle con-straints.Third, an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally, simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.