Quadtree-based genetic algorithm and its applications to computer vision

Many computer vision problems can be formulated as optimization problems. Presented in this paper is a new framework based on the quadtree-based genetic algorithm that can be applied to solve many of these problems. The proposed algorithm incorporates the quadtree structure into the conventional genetic algorithm. The solutions of image-related problems are encoded through encoding the corresponding quadtrees, and therefore, the 2D locality within a solution can be preserved. Examples addressed using the proposed framework include image segmentation, stereo vision, and motion estimation. In all cases, encouraging results are obtained.     

福建移动长途传输网网络的优化及发展演变

介绍了光传送网的发展演变，提出了福建移动传送网的网络优化思路，以及福建移动传送网的智能化演进策略。     

黄药合成工艺的生产实践

本文介绍了永平铜矿强力公司黄药合成的工艺概况 ,并论述了在生产实践中对提高产品质量所采取的主要措施     

Efficient Spreadsheet Algorithm for First-Order Reliability Method

A new spreadsheet-cell-object-oriented algorithm for the first-order reliability method is proposed and illustrated for cases with correlated nonnormals and explicit and implicit performance functions. The new approach differs from the writers earlier algorithm by obviating the need for computations of equivalent normal means and equivalent normal standard deviations. It obtains the solution faster and is more efficient, robust, and succinct. Other advantages include ease of initialization prior to constrained optimization, ease of randomization of initial values for checking robustness, and fewer required optimization constraints during spreadsheet-automated search for the design point. Two cases with implicit performance functions, namely an asymmetrically loaded beam on Winkler medium and a strut with complex supports are analyzed using the new approach and discussed. Comparisons are also made between the proposed approach and that based on Rosenblatt transformation.     

Facility layout problems: A survey

Layout problems are found in several types of manufacturing systems. Typically, layout problems are related to the location of facilities (e.g., machines, departments) in a plant. They are known to greatly impact the system performance. Most of these problems are NP hard. Numerous research works related to facility layout have been published. A few literature reviews exist, but they are not recent or are restricted to certain specific aspects of these problems. The literature analysis given here is recent and not restricted to specific considerations about layout design.

We suggest a general framework to analyze the literature and present existing works using such criteria as: the manufacturing system features, static/dynamic considerations, continual/discrete representation, problem formulation, and resolution approach. Several research directions are pointed out and discussed in our conclusion.     

Multiphysics modeling and optimization of mechatronic multibody systems

Modeling mechatronic multibody systems requires the same type of methodology as for designing and prototyping mechatronic devices: a unified and integrated engineering approach. Various formulations are currently proposed to deal with multiphysics modeling, e.g., graph theories, equational approaches, co-simulation techniques. Recent works have pointed out their relative advantages and drawbacks, depending on the application to deal with: model size, model complexity, degree of coupling, frequency range, etc. This paper is the result of a close collaboration between three laboratories, and aims at showing that for “non-academic” mechatronic applications (i.e., issuing from real industrial issues), multibody dynamics formulations can be generalized to mechatronic systems, for the model generation as well as for the numerical analysis phases. Model portability being also an important aspect of the work, they must be easily interfaced with control design and optimization programs. A global “demonstrator”, based on an industrial case, is discussed: multiphysics modeling and mathematical optimization are carried out to illustrate the consistency and the efficiency of the proposed approaches.     

Numerical solution for shape optimization of an impactor penetrating into a semi-infinite target

The shape of the impactor with the maximum depth of penetration (DOP) for a given impact velocity is found using a numerical procedure for solving a corresponding non-classical variational problem. It is shown that the optimum shape in a general case is close to a blunt cone. The variation of the optimal shape of the impactor and the dependence of the DOP vs. the initial (impact) velocity and friction coefficient is studied. The analysis is performed also for optimal conical impactors.     

Nonlinear model predictive control with polytopic invariant sets

Ellipsoidal invariant sets have been widely used as target sets in model predictive control (MPC). These sets can be computed by constructing appropriate linear difference inclusions together with additional constraints to ensure that the ellipsoid lies within a given inclusion polytope. The choice of inclusion polytope has a significant effect on the size of the target ellipsoid, but the optimal inclusion polytope cannot in general be computed systematically. This paper shows that use of polytopic invariant sets overcomes this difficulty, allowing larger stabilizable sets without loss of performance. In the interests of online efficiency, consideration is focused on interpolation-based MPC.     

煤气吹扫时惰性气体抑爆用量的优选

运用惰性气体消防抑爆理论，采用数学积分法计算出吹扫煤气设施时抑爆所需最少惰性气体需要量．     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996