可拓检测的方案生成

以可拓学理论为基础，论述了可拓检测的有关定义和概念，提出了可拓检测的方案生成方法及过程，同时探讨了检测方法的优化和评价方法。     

Non-pinched, minimum energy distillation designs

Non-pinched, minimum energy solutions are important class of distillation designs that offer the potential advantage of a better trade-off between capital investment and operating costs. In this paper, two important tasks associated with non-pinched distillation designs are studied. Thus the novel contributions of this work to the literature are

(1) A comprehensive methodology for finding non-pinched minimum energy designs.

(2) Understanding of the reasons for the existence of non-pinched distillation designs.

It is shown that the recent shortest stripping line distance approach of Lucia et al. [Lucia, A., Amale, A. and Taylor, R., 2007, Distillation pinch points and more. Comput Chem Eng, available on-line] is capable of systematically and reliably finding non-pinched, minimum energy distillation designs. In addition, we provide an understanding of the reasons behind the existence of non-pinched designs, which include trajectories that follow unstable branches of a pinch point curve in azeotropic systems, the inherent looping structure of trajectories in hydrocarbon separations, and the presence of ancillary constraints in multi-unit processes like extraction/distillation. Several distillation examples are studied and many numerical results and geometric illustrations are presented that show the shortest stripping line distance methodology is indeed a powerful and systematic tool for computing non-pinched, minimum energy designs and that support the underlying reason we provide for the existence of non-pinched designs.     

Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。     

A practical minimum distance method for syntax error handling

We present a method for recovering from syntax errors encountered during parsing. The method provides a form of minimum distance repair, has linear time complexity, and is completely automatic. A formal method is presented for evaluating the performance of error recovery methods, based on global minimum-distance error correction. The minimum-distance error recovery method achieves a theoretically best performance on 80% of Pascal programs in the weighted Ripley-Druseikis collection. Comparisons of performance with other error recovery methods are given.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

Data mining of resilience indicators

In recent years, the Asia-Pacific region has experienced several financial setbacks, including speculative attacks in 1998 and the SARS outbreak in 2003. Financial stresses of this nature are unanticipated, and not all of the dangers can be predicted by the examination of market information and macroeconomic indicators. The Early Warning System (EWS) that has been adopted by the International Monetary Fund may not be able to predict future financial crises for all possible scenarios, because shocks come in many different forms. To supplement the EWS, this paper proposes a data mining framework to measure the resilience of an economy. The resilience framework does not predict a crisis, but rather assesses the current state of health of an economy and its ability to withstand a financial shock should one occur. The framework is based on a feedback system consisting of two stages. The first stage assigns a resilience score to each economy based on a fuzzy logic scoring scheme that is built on the ambiguous reasoning of experts. The second stage uses the classification tree approach to estimate thresholds for each economic indicator, and examines the quality of the fuzzy score. The result from the second stage is then passed back to the first stage as feedback. The final result is obtained when the feedback system reaches its equilibrium state. The proposed resilience framework is applied to the external-sector and the public-sector economies of several countries to illustrate its applicability.     

基于关键节点和多播节点的多播路由算法

在视频会议等多播应用中，降低多播树网络费用非常重要。本文提出了基于关键节点和目的节点的多播路由KDDMC算法。由于在算法中优先考虑采用关键节点，实现更多链路的共享，从而降低网络费用。在随机网络上的仿真结果表明，KDDMC算法的多播树网络费用优于SPH算法。同时证明了KDDMC算法的复杂度为O(n^3)，且利用所提出的路由表算法易于分布式实现。     

An investigation of the unstable region for dense phase conveying in sliding bed flow

For fine powdered materials, capable of being conveyed in dense phase, a conveying region exists in which instability in flow and pipeline blockage can occur if the pressure gradient available is insufficient to maintain a minimum value of solids loading ratio. A reduction in material flow rate can also lead to pipeline blockage in this region. Conveying trials under-taken with cement are used to illustrate the nature of the problem.     

一个表示和运用非功能性需求的框架

本文分析了一个软件开发进程中表示和运用非功能性需求的综合框架，该框架的目的是开发一套技术以调整软件开发进程中的设计决策，从而强调了依据非功能需求，探索合理化的软件开发进程。