When A Business Abandons A Data Mine: A Case Study

This case study examines the corporate expectations, conduct, and reactions surrounding a data-mining effort. Faced with the pressures of a still-restructuring business environment, even the executives who had initiated the effort failed to probe its value. They abandoned their commitment to prospecting and then the whole of the mining effort, despite its payback and promise. This article analyzes the project's failures and successes, offering guidelines that could make a difference in similar situations. If data mining is allowed to lose its strategic business focus, its potentialities will not be acknowledged.     

机器人抓取运动目标的轨迹规划方法

本文讨论了机器人在抓取运动目标前的接近轨迹规划问题，给出了一种新的在平面上抓取目标的方案。这种方案适用于机器人接近作直线运动或轨迹已知的平面曲线运动的目标的轨迹规划。本文还研究了当目标沿直线以不同速度运动时机器人手爪要抓取它而必须达到的最小末端速度，最后给出了一些仿真结果。     

From A Medial Surface To A Mesh

Medial surfaces are well‐known and interesting surface skeletons. As such, they can describe the topology and the geometry of a 3D closed object. The link between an object and its medial surface is also intuitively understood by people. We want to exploit such skeletons to use them in applications like shape creation and shape deformation. For this purpose, we need to define medial surfaces as Shape Representation Models (SRMs). One of the very first task of a SRM is to offer a visualization of the shape it describes. However, achieving this with a medial surface remains a challenging problem. In this paper, we propose a method to build a mesh that approximates an object only described by a medial surface. To do so, we use a volumetric approach based on the construction of an octree. Then, we mesh the boundary of that octree to get a coarse approximation of the object. Finally, we refine this mesh using an original migration algorithm. Quantitative and qualitative studies, on objects coming from digital modeling and laser scans, shows the efficiency of our method in providing high quality surfaces with a reasonable computational complexity.     

一种新的删除红黑树的结点的算法

提出一种新的删除红黑树的结点的算法,其主要思想是先自上而下处理某些子树再删除结点,不涉及自下而上的后退。证明新算法是正确的。设n是红黑树的内部结点的个数。执行新算法时进行O（1）次旋转。新算法的时间复杂性是O（log2n）。实验结果表明新算法的平均执行时间比Tarjan的算法和Guibas-Sedgewick算法的短。新算法的空间复杂性是O（1）。     

A FOUNDATION FOR A THEORY OF POSSIBILITY

A possibility function for a variable A over a set X is defined as a mapping from subsets of X to the unit interval, indicating the possibility that a realization of A is in that subset of X. We discuss the types of possibility functions derived from various types of informational structure about A. We discuss ordinal, fuzzy, and cardinal information.     

圆与多边形重叠区域的判定算法

本文提出了一种实用的圆与多边形重叠区域的判定算法，它集判断与确定功能于一体。该算法将多边形的边视为有向线段，通过引入多边形顶点的入边，出边交点的概念，研究了圆与多边形重叠区域的确定问题，并给出了作出其重叠区域的定理。     

使用遗传算法的迷宫学习

本文试用遗传计算及决策制定方法来实现机器人有认识迷宫意向的能力，这里“意向”是指遵循对迷宫特有的路径规则所出的决定，令机器人在两个相对的迷宫中行走学习，一个迷宫路径是基于同样的意向，另一个则基于不同的意向，研究结果确认了已达成的意向学习。     

A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock

A synchronizer with a phase counter (sometimes called asynchronous phase clock) is an asynchronous distributed algorithm, where each node maintains a local "pulse counter" that simulates the global clock in a synchronous network. In this paper, we present a time-optimal self-stabilizing scheme for such a synchronizer, assuming unbounded counters. We give a simple rule by which each node can compute its pulse number as a function of its neighbors' pulse numbers. We also show that some of the popular correction functions for phase clock synchronization are not self-stabilizing in asynchronous networks. Using our rule, the counters stabilize in time bounded by the diameter of the network, without invoking global operations. We argue that the use of unbounded counters can be justified by the availability of memory for counters that are large enough to be practically unbounded and by the existence of reset protocols that can be used to restart the counters in some rare cases where faults will make this necessary.     

A domain-oriented CIM shell: A new perspective

This paper proposes a domain-oriented layer above a relational data base management system (DBMS) software in the creation of a computer integrated manufacturing (CIM) shell. The shell consists of two parts: an intelligent database design environment (IDDE) which will aid the design and implementation of an integrated database system; the deductive capability which will aid the subsequent implementation of decision support systems. The application domain is represented by the discrete engineering manufacturing industry.     

基于C∞基函数的自然邻点插值（NNI）方法在科学计算可视化上的应用基于C∞基函数的自然邻点插值(NNI)方法在科学计算可视化上的应用

插值方法及插值基函数的选择是可视化技术的一个关键问题。该文首先根据平面域上分布的数据点集,将平面域剖分为Voronoicells进而得到相应的Delaunay三角化网格。然后基于Voronoicells的几何性质,应用自然邻点插值(NNI)方法,介绍了一种具有无穷次连续可微的C∞插值基函数及其数学性质。将基于C