Delay compensated control of the Stefan problem and robustness to delay mismatch

This paper presents a control design for the one‐phase Stefan problem under actuator delay via a backstepping method. The Stefan problem represents a liquid‐solid phase change phenomenon which describes the time evolution of a material's temperature profile and the interface position. The actuator delay is modeled by a first‐order hyperbolic partial differential equation (PDE), resulting in a cascaded transport‐diffusion PDE system defined on a time‐varying spatial domain described by an ordinary differential equation (ODE). Two nonlinear backstepping transformations are utilized for the control design. The setpoint restriction is given to guarantee a physical constraint on the proposed controller for the melting process. This constraint ensures the exponential convergence of the moving interface to a setpoint and the exponential stability of the temperature equilibrium profile and the delayed controller in the norm. Furthermore, robustness analysis with respect to the delay mismatch between the plant and the controller is studied, which provides analogous results to the exact compensation by restricting the control gain.     

优化军工科研项目管理的具体策略

我国的军工科研所成立于上世纪，它以军工项目的科研、预研为主，为我国的国防军工提供研发产品。伴随着我国经济实力的增强和科技军事力量的增长，军工科研院所也转变了原有的工业专属性质，走上了军民两用、寓军于民的道路，并在时代的进步中成为了我国先进装备制造业的重要科研力量和科技创新支柱。凸现军事工业“高、精、尖”的特点，以项目管理的优化为具体策略进行军工科研开发工作。     

The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

Collapse load of composite laminates: Lower bound evaluation by stress field analytical approximation

The paper proposes a limit analysis approach to define the ultimate load capacity of orthotropic composite laminates under biaxial loading and plane stress conditions. A lower bound to the collapse load multiplier is computed by solving a maximization nonlinear problem, according to the static theorem of limit analysis. To set up the optimization problem a stress field distribution is hypothesized at lamina level, moreover inter-lamina stresses are also considered. The effectiveness and validity of the proposed approach is shown by comparing the obtained numerical predictions both with available experimental data and with other numerical results carried out by means of a different numerical lower bound approach.     

开关磁阻直线电机的设计及其推力优化

设计了一种开关磁阻直线电机,使用JMAG软件对其进行了仿真和优化。进行了推力公式的推导,研究了导通顺序和初始位置对电机推力的影响,并分析了三种典型情况的磁力线分布。对电机的定子和动子的齿部和轭部高度、宽度及铁耗进行仿真优化,得出了最优参数。将有取向硅钢应用于该电机,研究了推力与轧制角的关系,并与使用普通硅钢的开关磁阻直线电机进行了对比,推力有一定提升。提出在动子齿部开切向槽的方案,结果表明,开切向槽对推力的影响较小,并能显著减小推力波动。     

Cost-minimization analysis of a working vacation queue with N-policy and server breakdowns

This paper investigates the N-policy M/M/1 queueing system with working vacation and server breakdowns. As soon as the system becomes empty, the server begins a working vacation. The server works at a lower service rate rather than completely stopping service during a vacation period. The server may break down with different breakdown rates during the idle, working vacation, and normal busy periods. It is assumed that service times, vacation times, and repair times are all exponentially distributed. We analyze this queueing model as a quasi-birth–death process. Furthermore, the equilibrium condition of the system is derived for the steady state. Using the matrix-geometric method, we find the matrix-form expressions for the stationary probability distribution of the number of customers in the system and system performance measures. The expected cost function per unit time is constructed to determine the optimal values of the system decision variables, including the threshold N and mean service rates. We employ the particle swarm optimization algorithm to solve the optimization problem. Finally, numerical results are provided, and an application example is given to demonstrate the applicability of the queueing model.     

Bearing Failure Optimization of Composite Double-Lap Bolted Joints Based on a Three-Step Strategy Marked By Feasible Region Reduction and Model Decoupling

To minimize the mass and increase the bearing failure load of composite doublelap bolted joints, a three-step optimization strategy including feasible region reduction, optimization model decoupling and optimization was presented. In feasible region reduction, the dimensions of the feasible design region were reduced by selecting dominant design variables from numerous multilevel parameters by sensitivity analyses, and the feasible regions of variables were reduced by influence mechanism analyses. In model decoupling, the optimization model with a large number of variables was divided into various sub-models with fewer variables by variance analysis. In the third step, the optimization sub-models were solved one by one using a genetic algorithm, and the modified characteristic curve method was adopted as the failure prediction method. Based on the proposed optimization method, optimization of a double-lap single-bolt joint was performed using the ANSYS^® code. The results show that the bearing failure load increased by 13.5% and that the mass decreased by 8.7% compared with those of the initial design of the joint, which validated the effectiveness of the three-step optimization strategy.     

An engineering method for complex structural optimization involving both size and topology design variables

This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization.