多目标决策问题非支配解集的一种序列逼近方法

在多目标优化中,对非支配解集的估计是一项非常重要的工作.本文给出一种序列逼近非支配解集的方法.     

Casual reasoning in planning1

Reasoning about actions necessarily involves tracking the truth of assertions about the world over time. The SIPE planning system retains the efficiency of the STRIPS assumption for this while enhancing expressive power by allowing the specification of a causl theory. Separation of knowledge about causality from knowledge about actions relieves operators of much of their representational burden and allows them to be applicable in a wide range of contexts. The implementation of causal theories is described, together with examples and evaluations of the system's expressive power and efficiency.     

ERP编码系统的研究与设计

提出了ERP编码的原则，介绍了常见的四种编码方法：顺序码、分类码、结构码和组合码．最后结合实例介绍了编码系统中各模块的设计。     

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.     

Bridging the generation gap between text planning and linguistic realization

Text planning is traditionally done as a separate process, independent of linguistic realization. However, I show in this paper that it is essential for a text planner to know the linguistic consequences of its actions. The choice of how to realize an element affects how much information is conveyed (e.g., “Floyd arrived safely in Boston” vs. “Floyd landed safely at Logan”) and what other information can be added (e.g., “Peter was deciding for an hour” vs. *“Peter made a decision for an hour”). The choice of realization also affects how the relative salience of the elements being expressed will be perceived (e.g., “The green car is in the garage” vs. “The car in the garage is green”). I have defined an intermediate level of representation for text planning, called the Text Structure. It is an abstract linguistic level that reflects germane linguistic constraints while abstracting away from syntactic detail. This representation allows the text planner to have greater control over the decisions, so that it can take advantage of the expressiveness of language to convey subtleties of meaning. More importantly, the Text Structure allows the generation process overall to be incremental, since it ensures that the text plan being composed will always be expressible in the language. La planification de textes est habituellement réalisée séparément, sans tenir compte de la réalisation linguistique. Cependant, ľauteur demontre dans cet article qu'il est essentiel à un planificateur de textes de connai̊tre les conséquences linguistiques de ses actions. Le choix de la méhode de réalisation ?un élément influe sur la quantité?informations qui est transmise (par ex.: 〈〈 Floyd est arrivé sain et sauf à Boston 〉〉 et 〈〈 Floyd a atterri sain et sauf àľaéroport Logan 〉〉) et sur quelle autre information peut ětre ajoutée. Le choix de la méthode de réalisation influe également sur la façon dont les caractères saillants des ééments qui sont exprimés seront perçus (par ex.: 〈〈 la voiture verte est dans le garage 〉〉 et 〈〈 la voiture dans le garage est verte 〉〉). L'auteur a défini un niveau intérmediaire de représentation pour la planification de textes qu'il a appelé structure de texte. Il; s'agit ?'un niveau linguistique abstrait qui refléte les contraintes linguistiques appropriées tout en s'éloignant du détail syntaxique. Cette représentation permet au planificateur de textes ?avoir un meilleur contrǒle des décisions, et done de tirer profit de la force ?expression du langage afin de tenir compte des subtiliés de sens. Plus important encore, la structure de texte permet au processus de génération ?ětre incrémentiel, car elle s'assure que le plan de texte en voie de composition soit toujours exprimable dans le langage.     

求解机械装配规划的新方法

本文提出一个求解机械装配规划的算法,其计算量～O(sN~2),其中s是零件所有可能装配方向的个数,N是工件的零件数(一般s～O(N)).而现行的求机械装配规划的算法,其计算量均随N的增加按指数律增加.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

基于熵权的料场方案模糊多属性优选研究

砂石料场方案选择中存在着许多难以精确度量的模糊性因素，常规的平衡法、系统分析法很难对此进行有效的处理。将模糊数学理论应用于砂石料场的方案选择，提出了熵权与模糊理论相结合的砂石料场方案优选方法，重点对标准化属性矩阵的产生、主客观权重结合得到综合权重及相对接近度的计算等几个方面进行了说明，并通过实例验证了该方法的可行性与实用性。     

Overcoming the luddite factor: some behavioural aspects of the field supervisor's role in construction planning

The way data is presented can seriously affect the ease with which it can be understood. The objectives and results of a survey of different types of presentation are given. Some psychological aspects of the problem are analysed.     

Detection of multiple cracks using frequency measurements

A method for detection of multiple open cracks in a slender Euler-Bernoulli beams is presented based on frequency measurements. The method is based on the approach given by Hu and Liang [J. Franklin Inst. 330 (5) (1993) 841], transverse vibration modelling through transfer matrix method and representation of a crack by rotational spring. The beam is virtually divided into a number of segments, which can be decided by the analyst, and each of them is considered to be associated with a damage parameter. The procedure gives a linear relationship explicitly between the changes in natural frequencies of the beam and the damage parameters. These parameters are determined from the knowledge of changes in the natural frequencies. After obtaining them, each is treated in turn to exactly pinpoint the crack location in the segment and determine its size. The forward, or natural frequency determination, problems are examined in the passing. The method is approximate, but it can handle segmented beams, any boundary conditions, intermediate spring or rigid supports, etc. It eliminates the need for any symbolic computation which is envisaged by Hu and Liang [J. Franklin Inst. 330 (5) (1993) 841] to obtain mode shapes of the corresponding uncracked beams. The proposed method gives a clear insight into the whole analysis. Case studies (numerical) are presented to demonstrate the method effectiveness for two simultaneous cracks of size 10% and more of section depth. The differences between the actual and predicted crack locations and sizes are less than 10% and 15% respectively. The numbers of segments into which the beam is virtually divided limits the maximum number of cracks that can be handled. The difference in the forward problem is less than 5%.