ωB-splines

A new kind of spline with variable frequencies, called ωB-spline, is presented. It not only unifies B-splines, trigonometric and hyperbolic polynomial B-splines, but also produces more new types of splines, ωB-spline bases are defined in the space spanned by {coso） t, sino）t, ], t, ..., t^n, ...} with the sequence of frequencies m where n is an arbitrary nonnegative integer, ωB-splines persist all desirable properties of B-splines. Furthermore, they have some special properties advantageous for modeling free form curves and surfaces.     

AHT Bézier Curves and NUAHT B-Spline Curves

In this paper, we present two new unified mathematics models of conics and polynomial curves, called algebraic hyperbolic trigonometric （ AHT） Bezier curves and non-uniform algebraic hyperbolic trigonometric （ NUAHT） B-spline curves of order n, which are generated over the space span{sin t, cos t, sinh t, cosh t, 1, t,..., t^n-5}, n 7〉 5. The two kinds of curves share most of the properties as those of the Bezier curves and B-spline curves in polynomial space. In particular, they can represent exactly some remarkable transcendental curves such as the helix, the cycloid and the catenary. The subdivision formulae of these new kinds of curves are also given. The generations of the tensor product surfaces are straightforward. Using the new mathematics models, we present the control mesh representations of two classes of minimal surfaces.     

Constrained curve drawing using trigonometric splines having shape parameters

The problem of drawing a smooth obstacle avoiding curve has attracted the attention of many people working in the area of CAD/CAM and its applications. In the present paper we propose a method of constrained curve drawing using certain C¹-quadratic trigonometric splines having shape parameters, which have been recently introduced in [Han X. Quadratic trigonometric polynomial curves with a shape parameter. Computer Aided Geometric Design 2002;19:503–12]. Besides this, we have also presented a simpler approach for studying the approximation properties of the trigonometric spline curves.     

Wavelength Assignment for Realizing Parallel FFT on Regular Optical Networks

Routing and wavelength assignment (RWA) is a central issue to increase efficiency and reduce cost in Wavelength Division Multiplexing (WDM) optical networks. In this paper, we address the problem of wavelength assignment for realizing parallel FFT on a class of regular optical WDM networks. We propose two methods for sequential mapping and shift-reversal mapping of FFT communication pattern to the optical WDM networks concerned. By sequential mapping, the numbers of wavelengths required to realize parallel FFT with 2ⁿ nodes on WDM linear arrays, rings, 2-D meshes and 2-D tori are 2^{n − 1}, 2^{n − 1}, 2^{max (k,n − k) − 1} and 2^{max (k,n − k) − 1} respectively. By shift-reversal mapping, the numbers of wavelengths required are max (3× 2^{n − 3},2), 2^{n − 2}, max (3× 2^{max (k,n − k) − 3},2) and 2^{max (k,n − k) − 2}. These results show that shift-reversal mapping outperforms sequential mapping. Our results have a clear significance for applications because FFT represents a common computation pattern shared by a large class of scientific and engineering problems and WDM optical networks as a promising technology in networking has an increasing popularity.     

C3连续的单位四元数插值样条曲线

目的 构造一类C³连续的单位四元数插值样条曲线,证明它的插值性和连续性,并把它应用于刚体关键帧动画设计中。方法 利用R³空间中插值样条曲线的5次多项式调配函数的累和形式构造了S³空间中单位四元数插值样条曲线,它不仅能精确通过一系列给定的方向,而且能生成C³连续的朝向曲线。结果 与Nielson的单位四元数均匀B样条插值曲线的迭代构造方法相比,所提方法避免了为获取四元数B样条曲线控制顶点对非线性方程组迭代求解的过程,提高了运算效率;与单位四元数代数三角混合插值样条曲线的构造方法（Su方法）相比,所提方法只用到多项式基,运算速度更快。本例中创建关键帧动画所需的时间与Nielson方法和Su方法相比平均下降了73%和33%。而且,相比前两种方法,所提方法产生的四元数曲线连续性更高,由C²连续提高到C³连续,这意味着动画中刚体的朝向变化更加自然。结论 仿真结果表明,本文方法对刚体关键帧动画设计是有效的,对实时性和流畅性要求高的动画设计场合尤为适用。     

Curve Interpolation with Arbitrary End Derivatives

An algorithm for interpolating data points with end derivative constraints is presented. The interpolating curve passes through the given points and at the same time assumes the derivatives specified. For degree p interpolation, up to p−1 derivatives may be specified, resulting in C ^p−1 continuous curve interpolants. The method is useful to piece individual curve segments together or to create closed curves with various degrees of smoothness.     

Maximum <Emphasis Type="Italic">k</Emphasis>-Splittable <Emphasis Type="Italic">s</Emphasis>,<Emphasis Type="Italic">t</Emphasis>-Flows

Given a graph with a source and a sink node, the NP-hard maximum k-splittable s,t-flow (M k SF) problem is to find a flow of maximum value from s to t with a flow decomposition using at most k paths. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k-splittable flow requires two interdepending decisions. One has to decide on k paths (routing) and on the flow values for the paths (packing). We give efficient algorithms for computing exact and approximate solutions by decoupling the two decisions into a first packing step and a second routing step. Usually the routing is considered before the packing. Our main contributions are as follows: (i) We show that for constant k a polynomial number of packing alternatives containing at least one packing used by an optimal M k SF solution can be constructed in polynomial time. If k is part of the input, we obtain a slightly weaker result. In this case we can guarantee that, for any fixed ε>0, the computed set of alternatives contains a packing used by a (1−ε)-approximate solution. The latter result is based on the observation that (1−ε)-approximate flows only require constantly many different flow values. We believe that this observation is of interest in its own right. (ii) Based on (i), we prove that, for constant k, the M k SF problem can be solved in polynomial time on graphs of bounded treewidth. If k is part of the input, this problem is still NP-hard and we present a polynomial time approximation scheme for it.     

Self-intersection elimination in metamorphosis of two-dimensional curves

H :[0, 1]× ³→ ³, where H(t, r) for t=0 and t=1 are two given planar curves C ₁(r) and C ₂(r). The first t parameter defines the time of fixing the intermediate metamorphosis curve. The locus of H(t, r) coincides with the ruled surface between C ₁(r) and C ₂(r), but each isoparametric curve of H(t, r) is self-intersection free. The second algorithm suits morphing operations of planar curves. First, it constructs the best correspondence of the relative parameterizations of the initial and final curves. Then it eliminates the remaining self-intersections and flips back the domains that self-intersect.     

Steiner systems <Emphasis Type="Italic">S</Emphasis>(<Emphasis Type="Italic">v,k, k</Emphasis> − 1): Components and rank

For an arbitrary Steiner system S(v, k, t), we introduce the concept of a component as a subset of a system which can be transformed (changed by another subset) without losing the property for the resulting system to be a Steiner system S(v, k, t). Thus, a component allows one to build new Steiner systems with the same parameters as an initial system. For an arbitrary Steiner system S(v, k, k − 1), we provide two recursive construction methods for infinite families of components (for both a fixed and growing k). Examples of such components are considered for Steiner triple systems S(v, 3, 2) and Steiner quadruple systems S(v, 4, 3). For such systems and for a special type of so-called normal components, we find a necessary and sufficient condition for the 2-rank of a system (i.e., its rank over \mathbbF₂\mathbb{F}_2) to grow under switching of a component. It is proved that for k ≥ 5 arbitrary Steiner systems S(v, k, k − 1) and S(v, k, k − 2) have maximum possible 2-ranks.     

Exponential Stability of Slowly Time-Varying Nonlinear Systems

Let be a time-varying vector field depending on t containing a regular and a slow time scale (α large). Assume there exist a k (τ)≥1 and a γ(τ) such that ∥x _τ(t, t ₀, x ₀)∥≤k(τ) e ^{−γ(τ)(t−t0)}∥x ₀∥, with x _τ(t, t ₀, x ₀) the solution of the parametrized system with initial state x ₀ at t ₀. We show that for α sufficiently large is exponentially stable when “on average”γ(τ) is positive. The use of this result is illustrated by means of two examples. First, we extend the circle criterion. Second, exponential stability for a pendulum with a nonlinear slowly time-varying friction attaining positive and negative values is discussed. Date received: January 22, 2000. Date revised: April 14, 2001.     

Perspective silhouette of a general swept volume

We present an efficient and robust algorithm for computing the perspective silhouette of the boundary of a general swept volume. We also construct the topology of connected components of the silhouette. At each instant t, a three-dimensional object moving along a trajectory touches the envelope surface of its swept volume along a characteristic curve K^t. The same instance of the moving object has a silhouette curve L^t on its own boundary. The intersection K^t∩L^t contributes to the silhouette of the general swept volume. We reformulate this problem as a system of two polynomial equations in three variables. The connected components of the resulting silhouette curves are constructed by detecting the instances where the two curves K^t and L^t intersect each other tangentially on the surface of the moving object. We also consider a general case where the eye position changes while moving along a predefined path. The problem is reformulated as a system of two polynomial equations in four variables, where the zero-set is a two-manifold. By analyzing the topology of the zero-set, we achieve an efficient algorithm for generating a continuous animation of perspective silhouettes of a general swept volume.     

Extending cubic uniform B-splines by unified trigonometric and hyperbolic basis

In this paper, the trigonometric basis {sin t, cos t, t, 1} and the hyperbolic basis {sinh t, cosh t, t, 1} are unified by a shape parameter C (0 ≤ C < ∝). It yields the Functional B-splines (FB-splines) and its corresponding Subdivision B-splines (SB-splines). As well, a geometric proof of curvature continuity for SB-splines is provided. FB-splines and SB-splines inherited nearly all properties of B-splines, including the C² continuity, and can represent elliptic and hyperbolic arcs exactly. They are adjustable, and each control point b_i can have its unique shape parameter C_i. As C_i increases from 0 to ∝, the corresponding breakpoint of b_i on the curve is moved to the location of b_i, and the curvature of this breakpoint is increased from 0 to ∝ too. For a set of control points and their shape parameters, SB-spline and FB-spline have the same position, tangent, and curvature on each breakpoint. If two adjacent control points in the set have identical parameters, their SB-spline and FB-spline segments overlap. However, in general cases, FB-splines have no simple subdivision equation, and SB-splines have no common evaluation function. Furthermore, FB-splines and SB-splines can generate shape adjustable surfaces. They can represent the quadric surfaces precisely for engineering applications. However, the exact proof of C² continuity for the general SB-spline surfaces has not been obtained yet.     

Tensor and border rank of certain classes of matrices and the fast evaluation of determinant inverse matrix and eigenvalues

The tensor rankA of the linear spaceA generated by the set of linearly independent matricesA ₁, A₂, …, A_p, is the least integert for wich there existt diadsu ^(r) v ^(r)τ, τ=1,2,...,t, such that . IfA=n+k,k≪n then some computational problems concerning matricesA∈A can be solyed fast. For example the parallel inversion of almost any nonsingular matrixA∈A costs 3 logn+0(log² k) steps with max(n ²+p (n+k), k² n+nk) processors, the evaluation of the determinant ofA can be performed by a parallel algorithm in logp+logn+0 (log² k) parallel steps and by a sequential algorithm inn(1+k ²)+p (n+k)+0 (k ³) multiplications. Analogous results hold to accomplish one step of bisection method, Newton's iterations method and shifted inverse power method applied toA−λB in order to compute the (generalized) eigenvalues provided thatA, B∈A. The same results hold if tensor rank is replaced by border rank. Applications to the case of banded Toeplitz matrices are shown. Dedicated to Professor S. Faedo on his 70th birthday Part of the results of this paper has been presented at the Oberwolfach Conference on Komplexitatstheorie, November 1983     

The Inf-Sup Condition for the Mapped Q k ?P k?1 disc Element in Arbitrary Space Dimensions

 One of the most popular pairs of finite elements for solving mixed formulations of the Stokes and Navier–Stokes problem is the Q _k −P _k−1 ^disc element. Two possible versions of the discontinuous pressure space can be considered: one can either use an unmapped version of the P _k−1 ^disc space consisting of piecewise polynomial functions of degree at most k−1 on each cell or define a mapped version where the pressure space is defined as the image of a polynomial space on a reference cell. Since the reference transformation is in general not affine but multilinear, the two variants are not equal on arbitrary meshes. It is well-known, that the inf-sup condition is satisfied for the first variant. In the present paper we show that the latter approach satisfies the inf-sup condition as well for k≥2 in any space dimension. Received January 31, 2001; revised May 2, 2002 Published online: July 26, 2002     

两种带形状参数的三角曲线

定义了带形状参数的三次三角多项式曲线和三次三角样条曲线。前者具有 与二次Bézier 曲线类似的端点性质,但逼近性比二次Bézier 曲线更好,且在拼接时能达到 更高阶的连续性。而后者与二次B 样条曲线类似,其每一段由相继的三个控制顶点生成。 对于等距节点,在一般情况下曲线C2 连续,在特殊条件下可达C3 连续。     

Controllable Locality in C2 Interpolating Curves by B2-splines / S-splines

This paper presents a systematic scheme for controlling the local behaviour of C² interpolating curves, based on the cubic B2-splines and the quartic S-splines. Both splines have an additional control point obtained by knot- insertion or degree-elevation in each span of the conventional uniform cubic interpolating B-splines. The shape designer can choose the desired range of locality for each span and get the corresponding additional control point as a barycentric combination of interpolation points within the range, without solving any variational problem and simultaneous equations. The scheme is consistent over the entire curve subject to some typical end conditions. The class of the curves derived includes the conventional cubic interpolating B-splines. Examples demonstrate the behaviour of the new interpolating curves and the capability of the scheme.     

Generalized divided differences,with applications to generalized B-splines

Within the theory of spline functions, there has always been great interest in the study of B-splines, i.e. splines with a finite support. In addition to the classical polynomial case, there also exist various approaches to the definition of B-splines from other function classes, such as trigonometric or hyperbolic ones (cf. section 0). In the present paper we define B-splines from a rather general function space, with covers almost all existing approaches as special cases. The only condition that the spaces under consideration must satisfy is that of being translation invariant, a fundamental property which will be defined in the paper. Our definition of generalized B-splines is based on generalized divided differences, which go back to Popoviciu [14] and were further investigated by Mühlbach [10, 11]. In the first section of the paper, we therefore study these operators and prove new results, such as a contour integral representation and a multistep-formula; the latter expresses—in closed form—a generalized divided difference of order m+j using those of order m, for arbitrary j ∈ ℕ. This makes it possible to compute generalized divided differences recursively, even if the underlying function space is spanned by anon-complete Chebyshev system.     

A Cubic Kernel for Feedback Vertex Set and Loop Cutset

The Feedback Vertex Set problem on unweighted, undirected graphs is considered. Improving upon a result by Burrage et al. (Proceedings 2nd International Workshop on Parameterized and Exact Computation, pp. 192–202, 2006), we show that this problem has a kernel with O(k ³) vertices, i.e., there is a polynomial time algorithm, that given a graph G and an integer k, finds a graph G′ with O(k ³) vertices and integer k′≤k, such that G has a feedback vertex set of size at most k, if and only if G′ has a feedback vertex set of size at most k′. Moreover, the algorithm can be made constructive: if the reduced instance G′ has a feedback vertex set of size k′, then we can easily transform a minimum size feedback vertex set of G′ into a minimum size feedback vertex set of G. This kernelization algorithm can be used as the first step of an FPT algorithm for Feedback Vertex Set, but also as a preprocessing heuristic for Feedback Vertex Set.     

A New Local Control Spline with Shape Parameters for CAD/CAM

Anew local control spline based on shape parameterw with G^3 continuity,called BLC-spline,is pro* posed.Not only is BLC-spline very smoot,but also the spline curve‘s characteristic polygon has only three control vertices,and the characteristic polyhedron has only nine control vertices.The behavior of Iocal control of BLC-spline is better than that of the other splines such as cubic Bezier,B and Beta-spline.The three shape parameters β0，β1and β2 of BLC-spline,which are independent of the control vertices,may be altered to change the shape of the curve or surface.It is shown that BLC-spline may be used to construcet a space are spline for DNC machining directly.That is a powerful tool for the design and manufacture of curves and surfaces in integrated CAD/CAM systems.     

On the computability power and the robustness of set agreement-oriented failure detector classes

Solving agreement problems deterministically, such as consensus and k-set agreement, in asynchronous distributed systems prone to an unbounded number of process failures has been shown to be impossible. To circumvent this impossibility, unreliable failure detectors for the crash failure model have been widely studied. These are oracles that provide information on failures. The exact nature of such information is defined by a set of abstract properties that a particular class of failure detectors satisfy. The weakest class of such failure detectors that allow to solve consensus is Ω. This paper considers failure detector classes from the literature that solve k-set agreement in the crash failure model, and studies their relative power. It shows that the family of failure detector classes (1 ≤ x ≤ n), and (0 ≤ y ≤ n), can be “added” to provide a failure detector of the class Ω ^z (1 ≤ z ≤ n, a generalization of Ω). It also characterizes the power of such an “addition”, namely, , can construct Ω ^z iff y + z > t, and can construct Ω ^z iff x + z > t + 1, where t is the maximum number of processes that can crash in a run. As an example, the paper shows that, while allows solving 2-set agreement (but not consensus) and allows solving t-set agreement (but not (t − 1)-set agreement), a system with failure detectors of both classes can solve consensus for any value of t. More generally, the paper studies the failure detector classes , and Ω ^z , and shows which reductions among these classes are possible and which are not. The paper also presents a message-passing Ω ^k -based k-set agreement protocol and shows that Ω ^k is not enough to solve (k − 1)-set agreement. In that sense, it can be seen as a step toward the characterization of the weakest failure detector class that allows solving the k-set agreement problem. An extended abstract of this paper has appeared in the proceedings of PODC 2006 [20]. This work has been supported partially by a grant from LAFMI (Franco-Mexican Lab in Computer Science), the European Network of Excellence ReSIST and PAPIIT-UNAM.