Topology optimization of trusses using genetic algorithm,force method and graph theory

In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd.     

CDMA系统的网络优化

CDMA技术已经成为下一代移动通信的主流技术，CDMA网络的建设也初具规模。移动网络的优化则是实际运营过程中的一个重要环节。文中试图反映CDMA网络优化的一般原理，阐述了CDMA网络优化时需要考虑的几个主要问题，介绍了优化时需要调整的一些关键参数。     

高速贴片机优化软件的设计与开发

SMT生产线要达到最大的产量,必须要考虑生产线的效率。贴片机是SMT生产线中的关键设备,因此提高贴片机的生产效率具有十分重要的意义。本文以松下贴片机为例,介绍了贴片机程序优化软件的设计与开发中的思想、方法和经验,希望对从事CAM软件研究的工程人员有一定帮助。     

宝浪油田宝北区块低渗透油藏层系优化研究

针对宝浪油田宝北区块低孔低渗油藏地质特征以及油层层数多、分布井段长、部分零散层动用难度大等问题 ,研究了宝北区有效厚度、油层层数、单井产能及单井控制地质储量等层系划分与组合的技术经济界限 ,并在此基础上进行了宝北区层系划分与组合优化论证 ,最终优选出宝北区开发层系     

炼油厂成品油罐区调度优化问题研究

研究了以集合论为基础的调度优化模型。给出了该离散型优化问题的求解算法。根据优化结果，在G2实时智能平台上开发了包含监视子系统和调度子系统的调度支持系统。在中国石化股份有限公司长岭分公司的试用结果表明，该调度系统可以提高炼油厂的生产效率，从而提高炼油厂的经济效益。     

换热器设计中适宜流体用量的确定

利用换热器的操作线来分析讨论流体用量对传热过程的操作费用和设备费用的影响，找出了换热器设计和选型中适宜流体用量的优化确定方法，简便，快捷，具有一定的适用性。     

亚麻织物无醛免烫整理工艺研究

采用多元羧酸聚合型无醛免烫整理剂处理亚麻织物，确立了整理剂、催化剂、添加剂用量等最佳工艺条件，整理后亚麻织物的免烫性能得到了明显的改善。     

On the determination of optimal transition profile of a stepped bar in tension or in torsion by BEM

The objective is to have uniformly distributed tangential stresses on the transition profile of a stepped bar subjected to tensile and torsional loading using an axisymmetric boundary element formulation. The transition curve is represented by the Langragian interpolation polynomial with progressive degrees to avoid shape distortion during the optimization procedure. The calculated result is compared with that obtained by fluid dynamics given in the literature. It is seen that the transition curve obtained in this paper is reasonable.     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez