Comparison of sequential and simultaneous design and optimization in low-temperature liquefaction and gas separation processes

A great deal of attention has been paid to design and optimization of low-temperature liquefaction and gas separation problems over the past years, due to their difficult nature. In this paper, two approaches featuring sequential and simultaneous methods for selection and arrangement of sub-ambient separation systems and their associated refrigeration cycles are compared. The effect of ignoring heat integration within the separation system and between the separation and refrigeration systems is addressed as well as fixing the sequence order of separation. The optimization is carried out using two famous stochastic search methods i.e. Genetic Algorithm (GA) and Simulated Annealing (SA). Three case studies are examined to illustrate the significant differences between optimization results. Also, the design optimality is re-checked with respect to usage of different refrigerants and the resulting structure is verified by application of a comprehensive exergy analysis.     

求解机组组合的各种智能优化算法的比较

针对电力系统机组组合问题,分析了各种智能优化算法在该问题中的应用,通过结果对各种算法进行了比较,最后得出若干结论。     

城市公交最优路径选择的数学模型及其算法

通过对城市公交路径选择问题的分析,在常用的Dijkstra最短路径算法基础上进行改进,根据乘客的不同需求给出出行总距离最短、出行总费用最少、出行总时间最短的最优路径选择模型.综合考虑距离、时间、费用等多种因素给出的出行满意度最大的最优路径模型,同时以算例验证了模型和算法的合理性和实用性.     

毕业答辩成绩统计算法研究

对现有答辩成绩统计平均算法进行了改进,提出一种基于成绩一致度的答辩成绩统计平均算法,推导了相关计算公式,本文方法在绝大多数情况下与原有的去掉最高分和最低分的平均算法得出的结果一致,在少数极端情况下克服了原有方法的不足,通过本校32名毕业生的访谈,得到了多数毕业生的认同。     

Pathfinders On-Line

Abstract

For decades, print pathfinders have complemented card catalogs and been useful reference tools. They're overlooked as components of on-line catalogs, even though they can extend the depth of the catalog. To encourage librarians to consider integrating pathfinders into on-line catalogs, the authors discuss problems in OPAC searching, describe the value and styles of pathfinders, and illustrate how to include them in a NOTIS system.     

模拟退火遗传算法的性能评价

遗传算法和模拟退火算法的结合对遗传算法的性能有很大的改进．将遗传算法与模拟退火算法相结合，提出了模拟退火遗传算法．研究结果表明，该算法能较好地克服传统遗传算法存在的不足，并在进化速度和全局寻优能力方面有较大的突破．     

用改进的遗传算法进行自主式机器人的路径规划

主要是扩充标准遗传算法中的遗传操作 ,进行自主式机器人的路径规划。由仿真结果表明 ,在进行自主式机器人的路径规划中 ,该方案优于传统的方法 ,既能获得次优的路径 ,还具有对不确定因素的鲁棒性     

最优特征子集的遗传算法求解

指出最优特征子集选择问题(OFSS)是个NP-Hard问题,寻找一个近似算法具有现实意义。遗传算法提供了一种求解复杂系统优化问题的通用框架。使用基于小生境技术的遗传算法求解OFSS问题,以获得较好收敛性、稳定性和较快的速度。     

论基于MATLAB语言的BP神经网络的改进算法

针对标准BP算法存在的缺陷，本文给出了基于MATLAB语言的BP神经网络几种改进的算法，阐述了各种BP算法的优化技术原理、优缺点，并就它们的训练速度和内存消耗情况作了比较，建议在多数BP神经网络训练时，先尝试使用Levenberg-Mqrquardt算法，其次是BFGS算法或共轭梯度法以及RPROP算法。     

Deal or no deal? Some reflections on the ‘Baker-Thompson rule,’ ‘matching,’ and ‘market design’

ABSTRACT

This article raises the issue of why the idea of a ‘deal’ has become so prevalent in the discussion of political matters and policy proposals associated with future economic developments. It does this by linking the deal with several features of market design. Principal amongst these are game theory and matching algorithms. The Barker-Thompson Rule is presented as an example of a particular type of market construction operating in a game theoretic context, while the ‘matching engine’ is explored in a variety of contexts where it is argued to have become a standardized technique indicating to a possible reshaping of the economic terrain more generally. The consequences of these developments and trends are the emergence of a ‘dealing culture’ that threatens to overwhelm other forms of decision-making and consume the policy-making environment with the immediacy of its dealing logic.