1991 年安徽特大洪灾对城市规划科学性的检验

以合肥、芜湖、蚌埠、马鞍山等市及三河、撮镇等集镇为例说明总体规划和防洪专业规划的制定与洪涝灾害的受灾程度密切相关，指出城市规划中考虑防灾的必要性和措施。     

对合肥市郊县绿化造林的一点看法

对合肥市郊县的绿化造林现状作了分析，提出了切实可行的措施。     

Cashing in on Caching: An Architecture for Time-Bounded Knowledge-Based Problem Solving

Knowledge-based computing, in general, suffers from an inherent open-endedness that precludes its application in time-bounded domains where an answer must be computed within a stipulated time limit. We examine a two-way improvement of the shortcomings: a knowledge representation scheme that provides easy access to relevant knowledge and thereby reduces search time, and a reasoning scheme that is algorithmic in nature and thus makes computational requirements meaningfully estimable.In this work, we offer a cache-based architecture that is capable of both storing knowledge in different formats (e.g. rules, cases), and invoking an appropriate reasoning scheme to fit the available computing time. The cache helps in retrieving the most relevant pieces of knowledge (not only exact matches) required for solving a given problem. This cache relies on a reasoning tactic, knowledge interpolation, that can generate a solution from two near-matches in an algorithmic way, to generate time-bounded solutions. We illustrate the design of such a cache for solving resource allocation problems in the domain of shortwave radio transmission and evaluate its performance in observing imposed temporal bounds.     

理性遗传算法及其在运动规划中的应用

为提高理性遗传算法遗传信忠的完备性、算法全局收敛性以及算法的整体结构，给出了一个更一般化的理性算子和算法结构，证明了算法的全局收敛性．理论分析和在运动规划问题中的应用结果验证了理性遗传算法的有效性．     

微粒群优化算法在相关新产品组合投入的应用

引入新产品最佳投入期和相关收益的概念，在产品生命周期量化描述前提下，提出一个非线性半无限规划的相关新产品组合投入模型，并用微粒群优化算法(PS0)求解，仿真实例表明，微粒群优化算法在求解组合优化问题时简便且易于实现，具有很强的实用性。     

Optimal Ordered Problem Solver

We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, including those programs that organize and manage and adapt and reuse earlier acquired knowledge. The Optimal Ordered Problem Solver (OOPS) draws inspiration from Levin's Universal Search designed for single problems and universal Turing machines. It spends part of the total search time for a new problem on testing programs that exploit previous solution-computing programs in computable ways. If the new problem can be solved faster by copy-editing/invoking previous code than by solving the new problem from scratch, then OOPS will find this out. If not, then at least the previous solutions will not cause much harm. We introduce an efficient, recursive, backtracking-based way of implementing OOPS on realistic computers with limited storage. Experiments illustrate how OOPS can greatly profit from metalearning or metasearching, that is, searching for faster search procedures.     

A contribution to the development of strategic control and planning instruments: An acquisition case study

The present paper is part of the efforts made by the authors in recent years to develop strategic control and planning instruments in corporations using OR‐techniques like system dynamics, control theory, and group multicriteria decision aid. A more general framework called ‘adaptive control methodology’ (ACM) combines all these techniques. It has been presented in several papers. The objective of the present analysis is to calibrate this instrument and to tune it to the corporate needs by analysing real‐world applications. More specifically, several case studies have been investigated in large multinational organisations in the food sector. An acquisition case has been used for the calibration purpose. It is analysed in the paper from the ACM perspective to provide additional material for revisiting and improving the methodology.     

Fabrication process of open surfaces by robotic fibre placement

Composite materials are being used extensively in many industrial sectors. They offer excellent material properties compared to other structural materials available. However, the traditional fabrication process using manual hand lay-up is time consuming and labour intensive. Therefore, robotic fibre placement has been introduced to overcome these drawbacks. This approach may greatly reduce cycle time and manufacturing costs. This paper describes the overall strategy for the establishment of a flexible robotic fibre placement technique. The fabrication process planning of this new technique is presented. Three different types of fibre placement for open surfaces are discussed. These include simulation-based fibre path generation, fibre steering, and sensory-based contour following methodologies. The system architecture for the process control is also presented.     

怒江水电基地的电力市场研究

怒江中下游干流河段落差集中 ,水量大 ,淹没损失小 ,交通方便 ,施工条件好 ,地质条件良好。规划装机容量2 13 2 0MW ,是我国重要的水电基地之一。到 2 0 2 0年 ,澜沧江中下游、金沙江中下游以及广西水电、四川水电、贵州水电基本得到大规模的开发 ;怒江将可能成为南方电网 ,乃至华中电网电力电量平衡的必不可少的电源。怒江水电基地是南方电网长远能源平衡的战略基地 ,“西电东送”的后续基地。怒江供电区域市场空间较大 ,送到受电地区的落地电价也具备一定的竞争力     

Structured Latent Curve Models for the Study of Change in Multivariate Repeated Measures.

This article considers a structured latent curve model for multiple repeated measures. In a structured latent curve model, a smooth nonlinear function characterizes the mean response. A first-order Taylor polynomial taken with regard to the mean function defines elements of a restricted factor matrix that may include parameters that enter nonlinearly. Similar to factor scores, random coefficients are combined with the factor matrix to produce individual latent curves that need not follow the same form as the mean curve. Here the associations between change characteristics in multiple repeated measures are studied. A factor analysis model for covariates is included as a means of relating latent covariates to the factors characterizing change in different repeated measures. An example is provided. (PsycINFO Database Record (c) 2010 APA, all rights reserved)