Modelling topology optimization problems as linear mixed 0–1 programs

This paper deals with topology optimization of discretized continuum structures. It is shown that a large class of non‐linear 0–1 topology optimization problems, including stress‐ and displacement‐constrained minimum weight problems, can equivalently be modelled as linear mixed 0–1 programs. The modelling approach is applied to some test problems which are solved to global optimality. Copyright © 2003 John Wiley & Sons, Ltd.     

A multi-objective programming model for scheduling emergency medicine residents

Scheduling emergency medicine residents (EMRs) is a complex task, which considers a large number of rules (often conflicting) related to various aspects such as limits on the number of consecutive work hours, number of day and night shifts that should be worked by each resident, resident staffing requirements according to seniority levels for the day and night shifts, restrictions on the number of consecutive day and night shifts assigned, vacation periods, weekend off requests, and fair distribution of responsibilities among the residents. Emergency rooms (ERs) are stressful workplaces, and in addition shift work is well-known to be more demanding than regular daytime work. For this reason, preparing schedules that suit the working rules for EMRs is especially important for reducing the negative impact on shift workers physiologically, psychologically, and socially. In this paper, we present a goal programming (GP) model that accommodates both hard and soft constraints for a monthly planning horizon. The hard constraints should be adhered to strictly, whereas the soft constraints can be violated when necessary. The relative importance values of the soft constraints have been computed by the analytical hierarchy process (AHP), which are used as coefficients of the deviations from the soft constraints in the objective function. The model has been tested in the ER of a major local university hospital. The main conclusions of the study are that problems of realistic size can be solved quickly and the generated schedules have very high qualities compared to the manually prepared schedules, which require a lot of effort and time from the chief resident who is responsible for this duty.     

Linear interpolation in a fuzzy information space

An approach to solving a linear interpolation problem in a fuzzy information space is proposed. Two different schemes of interpolation are outlined: a heuristic one, based on the geometrical interpretation of operations, and an optimization one, based on the expansion principle. The results obtained allow performing fuzzy linear prediction. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 55–68, March–April 2006.     

空间桁架结构拓扑优化设计的线性规划方法

本文以杆件内力为设计变量,构造了多工况作用下空间桁架结构拓扑优化的线性规划模型,考虑了应力和位移约束,能够避免奇异最优拓扑和不稳定结构的产生。     

Application of Fuzzy Control into a New Kind of Sea Water Still

ＡｐｐｌｉｃａｔｉｏｎｏｆＦｕｚｚｙＣｏｎｔｒｏｌｉｎｔｏａＮｅｗＫｉｎｄｏｆＳｅａＷａｔｅｒＳｔｉｌＱｕＷｅｉｄｏｎｇＹｕＪｉｎｄｉＺｈａｎｇＨｅｆｅｉＮｏｒｔｈｗｅｓｔｅｒｎＰｏｌｙｔｅｃｈｎｉｃａｌＵｎｉｖｅｒｓｉｔｙＸｉ′ａｎ７１００７２，Ｐ...     

Egg white powder in extruded fish crackers

Four levels of egg white powder (EWP), 0, 1.5, 3.0 and 4.5%, were added to fisfc cracker formulation consisting of tapioca starch, fish paste, and water. the mixture was extruded through a single screw extruder, and the extrudate was cut, dried, heated in a microwave, and the degrees of expansion, bulk density, colour and protein content were measured.
The addition of 1.5 and 3.0% EWP had no significant effect ( P < 0.01) on diametral and longitudinal expansion, however, 4.5% EWP significantly ( P < 0.01) reduced them. Bulk density and protein content of the final product increased as the percentage of EWP increased in the formulation. the total colour difference measurement showed a significant increase ( P < 0.01) in brown colouration at 4.5% EWP.     

任意型一维FIR数字滤波器设计新方法

本文介绍了一种设计任意型（宽带、窄带、低阶、高阶、低通、高通、带通、带阻）一维FIR数字滤波器新方法．给出设计不同类型滤波器的统一方法。各种类型滤波器脉冲响应的设计公式简单、计算方便。该方法消除了Gibbs现象．不仅克服了优化设计中收敛速度、设计精度及初值选取等问题，而且减少设计高阶滤波器的时间。最后，本文给出了各种类型滤波器设计的仿真结果。     

A load dispatch method using fractional programming and semidefinite programming

This paper describes a load dispatch method which minimizes power cost—[fuel cost]/[electric output]—for a power system with thermal plants and energy storage facilities. The proposed method employs fractional programming to convert a minimization problem with fractional objective function to a series of quadratic minimization problems, and semidefinite programming to solve converted problems. The method provides the optimum time‐dependent power output/input and storage level of energy storage facilities as well as time‐dependent power output of thermal plants. The method has been applied to a power system with five thermal plants, two energy storage facilities of various performances, and five load demands. The optimum load scheme of four time mesh points is obtained for the thermal plants and energy storage facilities. The fractional programming successfully converges the optimal scheme through a few iterations. The semidefinite programming deals with a variable matrix of 164 dimensions, and 185 inequality constraints. © 2001 Scripta Technica, Electr Eng Jpn, 138(2): 49–58, 2002     

����ѡ������Ļ�ɫ���߷���

本文根据灰色系统理论中的灰色决策原理,提出了一种合理选择钻机的新方法,并通过了实例验证。结果表明,这种方法切实可行。     

Application of parallelized analogical planning to engineering design

Analogical planning provides a means of solving engineering problems where other machine learning methods fail. Unlike many machine learning paradigms, analogy does not require numerous previous examples or a rich domain theory. Instead, analogical planners adapt knowledge of solved problems in similar domains to the current problem. Unfortunately, the analogical planning task is an expensive one. While the process of forming correspondences between a known problem and a new problem is complex, the problem of selecting a base case for the analogy is virtually intractable.This paper addresses the issue of efficiently forming analogical plans. The Anagram planning system is described, which takes advantage of the massively parallel architecture of the Connection Machine to perform base selection and map formation. Anagram provides a tractable solution to analogical planning, with a complexity that is sublinear in the size of the plans.This paper describes the Anagram system and its parallel algorithms. The paper also presents theoretical analyses and empirical results of testing the system on a large database of plans from the domain of automatic programming.