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的增加按指数律增加.     

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.     

骑马岭水电站砂石加工系统规划设计

介绍了骑马岭水电站砂石加工系统的料源规划、系统规划设计、系统工艺流程及环保措施。该加工系统采用的典型的二段破碎工艺，对中小型水电站混凝土骨料生产系统的设计具有一定的参考价值。同时，该加工系统在废水处理水回收利用及细砂与石粉回收、防尘、降低噪声，以及固体废弃物处置等方面，均采取了相应的环保措施，以减少其对施工人员和周围环境的影响。     

小城镇公共中心的规划与建设

从回首往昔、再看今朝和关注明天三个层面,分析小城镇公共中心的规划与建设中出现的一些问题,并结合工作多年的实际,提出自己对小城镇中心建设的一些想法。     

以株洲市为例探析城市私房区的改造

首先分析了城市私房区带来的问题和改造的必然性,然后讨论了国内外私房区改造的经验和启示,最后提出了城市私房区改造的基本思路。     

浅议朱提商业街规划设计中的文化传承

以朱提文化商业街为例，从地域文化分析、规划设计原则、人文环境设计、建筑造型四方面探讨了设计中的文化传承问题，以展示现代商业街街区的文脉，体现城市的文化。     

Planning collision-free trajectories in time-varying environments: a two-level hierarchy

We propose a two-level hierarchy for planning collision-free trajectories in time varying environments. Global geometric algorithms for trajectory planning are used in conjunction with a local avoidance strategy. Simulations have been developed for a mobile robot in the plane among stationary and moving obstacles. Essentially, the robot has a global geometric planner that provides a coarse global trajectory (the path and velocity along it), which may be locally modified by the low-level local avoidance module if local sensors detect any obstacles in the vicinity of the robot. This hierarchy makes effective use of the complementary aspects of the global trajectory planning approaches and the local obstacle avoidance approaches.     

A parametric interpolator with confined chord errors, acceleration and deceleration for NC machining

Parametric interpolation has many advantages over linear interpolation in machining curves. Real time parametric interpolation research so far has addressed achieving a uniform feed rate, confined chord errors and jerk limited trajectory planning. However, simultaneous consideration of confined chord errors that respect the acceleration and deceleration capabilities of the machine has not been attempted. In this paper, the offline detection of feed rate sensitive corners is proposed. The velocity profile in these zones is planned so that chord errors are satisfied while simultaneously accommodating the machine's acceleration and deceleration limits. Outside the zone of the feed rate sensitive corners, the feed rate is planned using the Taylor approximation. Simulation results indicate that the offline detection of feed rate sensitive corners improves parametric interpolation. For real time interpolation, the parametric curve information can be augmented with the detected feed rate sensitive corners that are stored in 2×2 matrices.