Detection of loops and singularities of surface intersections

Two surface patches intersecting each other generally at a set of points (singularities), form open curves or closed loops. While open curves are easily located by following the boundary curves of the two patches, closed loops and singularities pose a robustness challenge since such points or loops can easily be missed by any subdivision or marching-based intersection algorithms, especially when the intersecting patches are flat and ill-positioned. This paper presents a topological method to detect the existence of closed loops or singularities when two flat surface patches intersect each other. The algorithm is based on an oriented distance function defined between two intersecting surfaces. The distance function is evaluated in a vector field to identify the existence of singular points of the distance function since these singular points indicate possible existence of closed intersection loops. The algorithm detects the existence rather than the absence of closed loops and singularities. This algorithm requires general C² parametric surfaces.     

基于频繁闭图关联规则的AS级Internet链路预测方法

目前大多数链路预测方法都是针对丢失链路的结构性预测,缺乏针对未来时刻网络链路的时序性预测,为此提出了一种基于频繁闭图关联规则的链路预测方法。将形式化后的动态网络划分为训练集和测试集,基于Apriori思想从训练集中提取频繁闭图,并根据频繁闭图的时间间隔建立时延分布矩阵,用于表征频繁闭图之间的时序关联规则,在此基础上预测测试集中的网络结构。将该方法运用于不同时间尺度下的AS级Internet动态网络中,结果表明,该方法能够以很高的精确率预测波动型动态网络的链路。     

基于物理的能量曲面造型方法构造过渡曲面

讨论了过渡曲面的生成问题,指出了半径过渡和PDE方法构造过渡面的局限性,提出了用基于物理的能量曲面造型方法构造过渡曲面的方法,特别是用于解决管状封闭非周期性曲面和其他曲面间的过渡问题。该文详细讨论了基于物理的能量曲面造型方法构造过渡曲面的原理及求解方法,并给出了飞行器的翼身过渡和三通过渡的实例。     

Efficient Index Set Generation for Compiling HPF Array Statements on Distributed-Memory Machines

In languages such as High Performance Fortran (HPF), array statements are used to express data parallelism. In compiling array statements for distributed-memory machines, efficient enumeration of local index sets and commmunication sets is important. A method based on a virtual processor approach has been proposed for efficient index set enumeration for array statements involving arrays distributed using block-cyclic distributions. The virtual processor approach is based on viewing a block-cyclic distribution as a block (or cyclic) distribution on a set of virtual processors, which are cyclically (or block-wise) mapped to the physical processors. The key idea of the method is to first develop closed forms in terms of simple regular sections for the index sets for arrays distributed using block or cyclic distributions. These closed forms are then used with the virtual processor approach to give an efficient solution for arrays with the block-cyclic distribution. HPF supports a two-level mapping of arrays to processors. Arrays are first aligned with a template at an offset and a stride and the template is then distributed among the processors using a regular data distribution. The introduction of a nonunit stride in the alignment creates “holes” in the distributed arrays which leads to memory wastage. In this paper, using simple mathematical properties of regular sections, we extend the virtual processor approach to address the memory allocation and index set enumeration problems for array statements involving arrays mapped using the two-level mapping. We develop a methodology for translating the closed forms for block and cyclically distributed arrays mapped using a one-level mapping to closed forms for arrays mapped using the two-level mapping. Using these closed forms, the virtual processor approach is extended to handle array statements involving arrays mapped using two-level mappings. Performance results on the Cray T3D are presented to demonstrate the efficacy of the extensions and identify various trade-offs associated with the proposed method.     

Polynomial surfaces interpolating arbitrary triangulations

Triangular Bezier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bezier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we introduce a new method for visually smooth interpolation of arbitrary triangle meshes based on a regular 4-split of the domain triangles. Ensuring tangent plane continuity of the surface is not enough for producing an overall fair shape. Interpolation of irregular control-polygons, be that in 1D or in 2D, often yields unwanted undulations. Note that this undulation problem is not particular to parametric interpolation, but also occurs with interpolatory subdivision surfaces. Our new method avoids unwanted undulations by relaxing the constraint of the first derivatives at the input mesh vertices: The tangent directions of the boundary curves at the mesh vertices are now completely free. Irregular triangulations can be handled much better in the sense that unwanted undulations due to flat triangles in the mesh are now avoided.     

Global set stabilisation of the spacecraft attitude using finite-time control technique

In this article, we revisit the classical problem of attitude stabilisation for a rigid spacecraft with external disturbances. A global set stabilisation method using finite-time control technique is proposed. In the absence of disturbances, the states of the closed loop system will be stabilised in finite time to a set consisting of two equilibria. In the presence of disturbances, the states will be stabilised to a neighbourhood of this set. By constructing a particular Lyapunov function, it is proved that the closed-loop system satisfies global set stability. The control method in this article is based on set control idea and thus is more natural and energy-efficient. Numerical simulation results show the effectiveness of the method.     

一种新的离散系统最优闭环极点配置方法

分析了LQ逆问题解的存在条件,以便合理选择期望的闭环极点,使之成为一组最优极点．提 出了一种以离散系统LQ逆问题分析为基础的新的最优控制系统设计方法,得到了开环、闭环 特征多项式系数与加权矩阵之间的解析关系,只要给定一组期望闭环极点,即可确定与 之对应的加权矩阵Q和R,从而得到一个具有指定极点的最优控制系统．     

Global set stabilization of the spacecraft attitude control problem based on quaternion

In this paper, we develop a global set stabilization method for the attitude control problem of spacecraft system based on quaternion. The control law that uses both optimal control and finite‐time control techniques can globally stabilize the attitude of spacecraft system to a set of equilibria. First, for the kinematic subsystem, we design a virtual optimal angular velocity. To obtain the global minimum of the performance index, this optimal angular velocity is only discontinuous in initial values. It can be regarded as a combination of open loop control and closed loop control. Then for the dynamic subsystem, we design a finite‐time control law that can force the angular velocity to track the virtual optimal angular velocity. It is proved that the closed loop system satisfies global set stability in the absence of disturbances. In the presence of disturbances, the system trajectory will converge to a neighborhood of the equilibrium set. Rigorous analysis shows that by introducing finite‐time control techniques, the closed loop system possesses a better disturbance rejection property. The control method is more natural and energy‐efficient. The effectiveness of the proposed method is demonstrated by simulation results. Copyright © 2009 John Wiley & Sons, Ltd.     

Efficient mining of association rules using closed itemset lattices

Discovering association rules is one of the most important task in data mining. Many efficient algorithms have been proposed in the literature. The most noticeable are Apriori, Mannila's algorithm, Partition, Sampling and DIC, that are all based on the Apriori mining method: pruning the subset lattice (itemset lattice). In this paper we propose an efficient algorithm, called Close, based on a new mining method: pruning the closed set lattice (closed itemset lattice). This lattice, which is a sub-order of the subset lattice, is closely related to Wille's concept lattice in formal concept analysis. Experiments comparing Close to an optimized version of Apriori showed that Close is very efficient for mining dense and/or correlated data such as census style data, and performs reasonably well for market basket style data.     

Regulation in bimodal systems

This paper considers the regulation problem for bimodal systems against known disturbance and reference signals. Switching between the two plant models as well as between the disturbance and reference signals is defined according to a switching surface. The design of the proposed regulators involves three main steps. First, a set of observer‐based Q‐parameterized stabilizing controllers for the switched system is constructed. The stability and the input/output properties for the resulting closed‐loop switched system with the Q‐parameterized controllers are analysed. Second, regulation conditions for each of the two subsystems in the resulting bimodal switched closed‐loop system are presented. In the third step, regulation conditions for the switched closed‐loop system are developed using two approaches. In the first approach, sufficient regulation conditions are derived based on the closed‐loop system's input–output properties. In the second approach, the forced switched closed‐loop system is transformed into an unforced impulsive switched system using an appropriate coordinate transformation. Hence, the regulation problem for the switched closed‐loop system is transformed into a stability analysis problem for the origin of an impulsive switched system. A regulator synthesis method based on solving some linear matrix inequalities is proposed. Finally, a numerical example is presented to illustrate the effectiveness of the proposed method. Copyright © 2007 John Wiley & Sons, Ltd.     

On Geodesic Curvature Flow with Level Set Formulation Over Triangulated Surfaces

The geodesic curvature flow is an important concept in Riemannian geometry. The flow with level set formulation has many applications in image processing, computer vision, material sciences, etc. The existing discretizations on triangulated surfaces are based on either finite volume method or finite element method with piecewise linear function space, which are suitable for vertex-based two-phase problems. The contour (zero level set) in existing methods passes through triangles of the mesh. However, in some graphic applications, such as mesh segmentation (to divide a whole mesh into several sub-meshes without ambiguous triangular stripes), the cutting contour is needed to be along the edges of the mesh. Moreover, multi-phase segmentation by a single level set function is a difficult problem for a long time. In this paper, we try to tackle these two problems. We propose a new discretization which has simpler formulation and more sparse coefficient matrix. We prove the existence and uniqueness, regularization behavior and maximum–minimum principle of our discrete flow. Therein the maximum–minimum principal has not been presented before. Lots of experiments show that, the limit of the flow would be a piecewise constant solution with ’discontinuity set’ to be the closed geodesics of the surface. We therefore propose a constrained discrete geodesic curvature flow, which is also analyzed theoretically. The linear system of the constrained flow can be equivalently reformulated into a much smaller one (especially in the narrow band algorithm), which dramatically reduces the computation cost. Combined with a narrow band algorithm, the constrained flow with topologically correct initializations (easy to be got by simple existing methods or manual inputs) yields a multi-phase segmentation method by a single level set function. We test our two flows in closed curve evolution and multi-region segmentation applications. The numerical experiments are given to demonstrate the effectiveness.     

Dependable control of uncertain linear systems based on set-theoretic methods

This article concerns the feedback control of discrete-time systems subject to disturbances and uncertainties in both model parameters and signal measurements. The uncertainties are assumed to be unknown but bounded and thus characterised by closed intervals or sets. The main result is a new approach to design a feedback controller keeping the system state in a target set. First, a method is proposed that computes minimal enclosures of the set of reachable states, which are consistent with the uncertain input and output measurements and the system dynamics. Then, a control method to keep the current state set in the target set is developed, which extends control techniques based on invariant polyhedra. The method is illustrated by a mobile robot experiment.     

Surface reconstruction using bivariate simplex splines on Delaunay configurations

Recently, a new bivariate simplex spline scheme based on Delaunay configuration has been introduced into the geometric computing community, and it defines a complete spline space that retains many attractive theoretic and computational properties. In this paper, we develop a novel shape modeling framework to reconstruct a closed surface of arbitrary topology based on this new spline scheme. Our framework takes a triangulated set of points, and by solving a linear least-square problem and iteratively refining parameter domains with newly added knots, we can finally obtain a continuous spline surface satisfying the requirement of a user-specified error tolerance. Unlike existing surface reconstruction methods based on triangular B-splines (or DMS splines), in which auxiliary knots must be explicitly added in advance to form a knot sequence for construction of each basis function, our new algorithm completely avoids this less-intuitive and labor-intensive knot generating procedure. We demonstrate the efficacy and effectiveness of our algorithm on real-world, scattered datasets for shape representation and computing.     

挖掘闭合多维序列模式的可行方法

为了对闭合多维序列模式进行挖掘,研究了多维序列模式的基本性质,进而提出了挖掘闭合多雏序列模式的新方法.该方法集成了闭合序列模式挖掘方法和闭合项目集模式挖掘方法,通过证明该方法的正确性,指出闭合多维序列模式集合不大于多维序列模式集合,并且能够覆盖所有多维序列模式的结果集.最后分析了该方法所具备的两个明显优点,表明了在闭合多维序列模式挖掘中的可行性.     

Smooth surface approximation to serial cross-sections

The reconstruction of the surface model of an object from 2D cross-sections plays an important role in many applications. In this paper, we present a method for surface approximation to a given set of 2D contours. The resulting surface is represented by a bicubic closed B-spline surface with C² continuity. The method performs the skinning of intermediate contour curves represented by cubic B-spline curves on a common knot vector, each of which is fitted to its contour points within a given accuracy. In order to acquire more compact representation for the surface, the method includes an algorithm for reducing the number of knots in the common knot vector. The proposed method provides a smooth and accurate surface model, yet realizes efficient data reduction. Some experimental results are given using synthetic and MRI data.     

Performance of multiclass BCMP model for computer system based on fuzzy set theory

The purpose of this paper is to combine the ability of fuzzy set to represent more realistic situations with the well-established traditional queueing system model problem. We are forced to employ subjective probabilities when there is no information about a model or some parameters of a model are vague. The information and data are very fuzzy, because they are frequently very little, 'and may be sometimes obtained from experts subjectively. We apply fuzzy set theory to the closed multiclass model with the fuzzy queues. thus, we represent the characteristic and performance of the closed multiclass model based on the proposed fuzzy set theory.     

A Closed-Form Formula for the RBF-Based Approximation of the Laplace–Beltrami Operator

In this paper we present a method that uses radial basis functions to approximate the Laplace–Beltrami operator that allows to solve numerically diffusion (and reaction–diffusion) equations on smooth, closed surfaces embedded in \(\mathbb {R}^3\). The novelty of the method is in a closed-form formula for the Laplace–Beltrami operator derived in the paper, which involve the normal vector and the curvature at a set of points on the surface of interest. An advantage of the proposed method is that it does not rely on the explicit knowledge of the surface, which can be simply defined by a set of scattered nodes. In that case, the surface is represented by a level set function from which we can compute the needed normal vectors and the curvature. The formula for the Laplace–Beltrami operator is exact for radial basis functions and it also depends on the first and second derivatives of these functions at the scattered nodes that define the surface. We analyze the converge of the method and we present numerical simulations that show its performance. We include an application that arises in cardiology.     

Visualization of Seifert surfaces

The genus of a knot or link can be defined via Seifert surfaces. A Seifert surface of a knot or link is an oriented surface whose boundary coincides with that knot or link. Schematic images of these surfaces are shown in every text book on knot theory, but from these it is hard to understand their shape and structure. In this paper, the visualization of such surfaces is discussed. A method is presented to produce different styles of surface for knots and links, starting from the so-called braid representation. Application of Seifert's algorithm leads to depictions that show the structure of the knot and the surface, while successive relaxation via a physically based model gives shapes that are natural and resemble the familiar representations of knots. Also, we present how to generate closed oriented surfaces in which the knot is embedded, such that the knot subdivides the surface into two parts. These closed surfaces provide a direct visualization of the genus of a knot. All methods have been integrated in a freely available tool, called SeifertView, which can be used for educational and presentation purposes.     

Direct Segmentation of Algebraic Models for Reverse Engineering

In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate consecutive steps as surface fitting. In this paper we present a segmentation method with subsequent classification of simple algebraic surfaces. Our method is direct in the sense that it operates directly on the point set in contrast to other approaches that are based on a triangulation of the data set. The segmentation process involves a fast algorithm for k-nearest neighbors search and an estimation of first and second order surface properties. The first order segmentation, that is based on normal vectors, provides an initial subdivision of the surface and detects sharp edges as well as flat or highly curved areas. One of the main features of our method is to proceed by alternating the steps of segmentation and normal vector estimation. The second order segmentation subdivides the surface according to principal curvatures and provides a sufficient foundation for the classification of simple algebraic surfaces. If the boundary of the original object contains such surfaces the segmentation is optimized based on the result of a surface fitting procedure.     

一种快速的符号距离函数的生成方法

针对图像处理中常规水平集方法,设计了一种基于同心圆扩散的符号距离函数的生成算法.新的设计方法克服了通常构造距离函数计算量大的不足.首先通过对水平集曲线形状的分析,给出了曲线内外点的判断方法,这种方法只需要经过图像的一次扫描即可给出内外点的判断;其次,利用同心圆扩散方法,寻找曲线上的最近点,并查找距离表,给出任一点到曲线的距离;最后,给出了所设计方法的计算步骤和算例,并与其它方法进行了比较,结果表明,新的方法计算稳定、速度快.