Hermite interpolation with simple planar PH curves by speed reparametrization

We introduce a new method of solving C¹ Hermite interpolation problems, which makes it possible to use a wider range of PH curves with potentially better shapes. By characterizing PH curves by roots of their hodographs in the complex representation, we introduce PH curves of type K(t−c)²ⁿ⁺¹+d. Next, we introduce a speed reparametrization. Finally, we show that, for C¹ Hermite data, we can use PH curves of type K(t−c)²ⁿ⁺¹+d or strongly regular PH quintics satisfying the G¹ reduction of C¹ data, and use these curves to solve the original C¹ Hermite interpolation problem.     

A new algebra of Toeplitz-plus-Hankel matrices and applications

We introduce a new simultaneously diagonalizable real algebra of symmetrical centrosymmetrical matrices having a Toeplitz-plus-Hankel structure. We give the corresponding orthonormal basis of eigenvectors which are alternately symmetrical and skewsymmetrical vectors. An application is the construction of a symmetrical Toeplitz-plus-centrosymmetrical Hankel matrix of equal row sums having a prescribed real spectrum. This matrix can be used as the starting matrix for symmetrical centrosymmetrical isospectral flows. In particular, for the isospectral flow corresponding to the construction of a regular Toeplitz matrix having prescribed eigenvalues. Moreover, if A is a noise representation of an unknown matrix in of rank k then we give a procedure to approximate A by a matrix in of rank k.     

Reconstruction of convergent smooth B-spline surfaces

Recently, there have been improvements on reconstruction of smooth B-spline surfaces of arbitrary topological type, but the most important problem of smoothly stitching B-spline surface patches (the continuity problem of B-spline surface patches) in surface reconstruction has not been solved in an effective way. Therefore, the motivation of this paper is to study how to better improve and control the continuity between adjacent B-spline surfaces.

In this paper, we present a local scheme of constructing convergent G¹ smooth bicubic B-spline surface patches with single interior knots over a given arbitrary quad partition of a polygonal model. Unlike previous work which only produces (non-controllable) toleranced G¹ smooth B-spline surfaces, our algorithm generates convergent G¹ smooth B-spline surfaces, which means the continuity of the B-spline surfaces tends to G¹ smoothness as the number of control points increases. The most important feature of our algorithm is, in the meaning of convergent approximation order, the ability to control the continuity of B-spline surfaces within the given tolerance and capture the geometric details presented by the given data points.     

A minimal representation of Markov arrival processes and a moments matching method

The paper investigates the problem of minimal representation of Markov arrival processes of order n (MAP(n)). The minimal representation of MAPs is crucial for developing effective fitting methods. It seems that all existing MAP fitting methods are based on the , representation which is known to be redundant. We present the minimal number of parameters to define a MAP(n) and provide a numerical moments-matching method based on a minimal representation.

The discussion starts with a characterization of phase type (PH) distributions and then the analysis of MAPs follows a similar pattern. This characterization contains essential results on the identity of stationary behaviour of MAPs and on the number of parameters required to describe the stationary behaviour.

The proposed moments matching method is also applicable for PH distributions. In this case it is a unique method that fits a general PH distribution of order n based on 2n−1 parameters.     

Hamiltonian-connected graphs

For a simple graph G, let . In this paper, we prove that if NCD(G)≥|V(G)|, then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended.     

On quadratic two-parameter families of spheres and their envelopes

In the present paper we investigate rational two-parameter families of spheres and their envelope surfaces in Euclidean . The four dimensional cyclographic model of the set of spheres in is an appropriate framework to show that a quadratic triangular Bézier patch in corresponds to a two-parameter family of spheres with rational envelope surface. The construction shows also that the envelope has rational offsets. Further we outline how to generalize the construction to obtain a much larger class of surfaces with similar properties.     

A parallel method for large sparse generalized eigenvalue problems using a GridRPC system

In this paper we present a master–worker type parallel method for finding several eigenvalues and eigenvectors of a generalized eigenvalue problem , where A and B are large sparse matrices. A moment-based method that finds all of the eigenvalues that lie inside a given domain is used. In this method, a small matrix pencil that has only the desired eigenvalues is derived by solving large sparse systems of linear equations constructed from A and B. Since these equations can be solved independently, we solve them on remote servers in parallel. This approach is suitable for master–worker programming models. We have implemented and tested the proposed method in a grid environment using a grid RPC (remote procedure call) system called OmniRPC. The performance of the method on PC clusters that were used over a wide-area network was evaluated.     

The two-equal-disjoint path cover problem of Matching Composition Network

Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u,v) and (w,x) of G, there exist two disjoint paths P and Q satisfied that (1) P (Q, respectively) joins u and v (w and x, respectively), (2) |P|=|Q|, and (3) V(PQ)=V(G). The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching. In this paper, we consider the globally two-equal-disjoint path cover property of MCN. Applying our result, the Crossed cube CQ_n, the Twisted cube TQ_n, and the Möbius cube MQ_n can all be proven to be globally two-equal-disjoint path coverable for n5.     

Fibonacci mean and golden section mean

In this paper we show that there is a mapping D:M→DM on means such that if M is a Fibonacci mean so is DM, that if M is the harmonic mean, then DM is the arithmetic mean, and if M is a Fibonacci mean, then lim_n→∞DⁿM is the golden section mean.     

LTL over integer periodicity constraints

Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL^mod, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although the underlying constraint language is a fragment of Presburger arithmetic shown to admit a PSPACE-complete satisfiability problem, we establish that PLTL^mod model-checking and satisfiability problems remain in PSPACE as plain LTL (full Presburger LTL is known to be highly undecidable). This is particularly interesting for dealing with periodicity constraints since the language of PLTL^mod has a language more concise than existing languages and the temporalization of our first-order language of periodicity constraints has the same worst case complexity as the underlying constraint language. Finally, we show examples of introduction the quantification in the logical language that provide to PLTL^mod, EXPSPACE-complete problems. As another application, we establish that the equivalence problem for extended single-string automata, known to express the equality of time granularities, is PSPACE-complete by designing a reduction from QBF and by using our results for PLTL^mod.     

Weierstrass-type approximation theorems with Pythagorean hodograph curves

We prove the Weierstrass-type approximation theorem that states every C¹ curve in the 2-dimensional or 3-dimensional Euclidean space or in the 3-dimensional Minkowski space can be uniformly approximated by Pythagorean hodograph curves in the corresponding space. This abundance of PH curves is another theoretical confirmation of the usefulness and the versatility of the PH curves. We also address some algorithmic aspects of proposed PH approximation schemes and their convergence rates.     

Multi-degree reduction of triangular Bézier surfaces with boundary constraints

Given a triangular Bézier surface of degree n, the problem of multi-degree reduction by a triangular Bézier surface of degree m with boundary constraints is investigated. This paper considers the continuity of triangular Bézier surfaces at the three corners, so that the boundary curves preserve endpoints continuity of any order . The l₂- and L₂-norm combined with the constrained least-squares method are used to get the matrix representations for the control points of the degree reduced surfaces. Both methods can be applied to piecewise continuous triangular patches or to only a triangular patch with the combination of surface subdivision. And the resulting piecewise approximating patches are globally C⁰ continuous. Finally, error estimation is given and numerical examples demonstrate the effectiveness of our methods.     

Fast algorithms for finding disjoint subsequences with extremal densities

We derive fast algorithms for the following problem: given a set of n points on the real line and two parameters s and p, find s disjoint intervals of maximum total length that contain at most p of the given points. Our main contribution consists of algorithms whose time bounds improve upon a straightforward dynamic programming algorithm, in the relevant case that input size n is much bigger than parameters s and p. These results are achieved by selecting a few candidate intervals that are provably sufficient for building an optimal solution via dynamic programming. As a byproduct of this idea we improve an algorithm for a similar subsequence problem of Chen et al. [Disjoint segments with maximum density, in: International Workshop on Bioinformatics Research and Applications IWBRA 2005, (within ICCS 2005), Lecture Notes in Computer Science, vol. 3515, Springer, Berlin, pp. 845–850]. The problems are motivated by the search for significant patterns in biological data. Finally, we propose several heuristics that further reduce the time complexity in typical instances. One of them leads to an apparently open subsequence sum problem of independent interest.     

A novel lossless data compression scheme based on the error correcting Hamming codes

This paper introduces a novel lossless binary data compression scheme that is based on the error correcting Hamming codes, namely the HCDC scheme. In this scheme, the binary sequence to be compressed is divided into blocks of n bits length. To utilize the Hamming codes, the block is considered as a Hamming codeword that consists of p parity bits and d data bits (n=d+p). Then each block is tested to find if it is a valid or a non-valid Hamming codeword. For a valid block, only the d data bits preceded by 1 are written to the compressed file, while for a non-valid block all n bits preceded by 0 are written to the compressed file. These additional 1 and 0 bits are used to distinguish the valid and the non-valid blocks during the decompression process. An analytical formula is derived for computing the compression ratio as a function of block size, and fraction of valid data blocks in the sequence. The performance of the HCDC scheme is analyzed, and the results obtained are presented in tables and graphs. Finally, conclusions and recommendations for future works are pointed out.     

Transition between concentric or tangent circles with a single segment of PH quintic curve

The paper describes a method to join two circles with a C-shaped and an S-shaped transition curve, composed of a Pythagorean hodograph quintic segment, preserving G² continuity. It is considered desirable to have such a curve in satellite path planning, highway or railway route designing, or non-holonomic robot path planning. As an extension of our previous work, we show that a single quintic curve can be used for blending or for a transition curve between two circles, including the previously unsolved cases of concentric and tangential circles.     

The Lambert W function and the spectrum of some multidimensional time-delay systems

In this note we find an explicit expression for the eigenvalues of a retarded time-delay system with one delay, for the special case that the system matrices are simultaneously triangularizable, which includes the case where they commute. Using matrix function definitions we define a matrix version of the Lambert W function, from which we form the expression. We prove by counter-example that some expressions in other publications on Lambert W for time-delay systems do not always hold.     

Stability for first order delay dynamic equations on time scales

In this paper, we establish some sufficient conditions for the uniform stability and the uniformly asymptotical stability of the first order delay dynamic equation

where is a time scale, p(.) is rd-continuous and positive, the delay function . Our results unify the corresponding ones for differential and difference equations. To the best of our knowledge, this is the first time to discuss the asymptotical behavior of delay dynamic equations on time scales.     

Triple positive solutions for some second-order boundary value problem on a measure chain

In this paper, we study the existence of three positive solutions for the second-order two-point boundary value problem on a measure chain,

where f:[t₁,σ(t₂)]×[0,∞)×R→[0,∞) is continuous and p:[t₁,σ(t₂)]→[0,∞) a nonnegative function that is allowed to vanish on some subintervals of [t₁,σ(t₂)] of the measure chain. The method involves applications of a new fixed-point theorem due to Bai and Ge [Z.B. Bai, W.G. Ge, Existence of three positive solutions for some second order boundary-value problems, Comput. Math. Appl. 48 (2004) 699–707]. The emphasis is put on the nonlinear term f involved with the first order delta derivative x^Δ(t).     

output feedback control design for uncertain fuzzy singularly perturbed systems: an LMI approach

This paper examines the problem of designing a robust H_∞ output feedback controller for a class of singularly perturbed systems described by a Takagi–Sugeno fuzzy model. Based on a linear matrix inequality (LMI) approach, LMI-based sufficient conditions for the uncertain singularly perturbed nonlinear systems to have an H_∞ performance are derived. To eliminate the ill-conditioning caused by the interaction of slow and fast dynamic modes, solutions to the problem are presented in terms of LMIs which are independent of the singular perturbation . The proposed approach does not involve the separation of states into slow and fast ones and it can be applied not only to standard, but also to nonstandard singularly perturbed nonlinear systems. A numerical example is provided to illustrate the design developed in this paper.     

Identifying a control function in parabolic partial differential equations from overspecified boundary data

Determination of an unknown time-dependent function in parabolic partial differential equations, plays a very important role in many branches of science and engineering. In the current investigation, the Adomian decomposition method is used for finding a control parameter p(t) in the quasilinear parabolic equation u_t=u_xx+p(t)u+, in [0,1]×(0,T] with known initial and boundary conditions and subject to an additional condition in the form of which is called the boundary integral overspecification. The main approach is to change this inverse problem to a direct problem and then solve the resulting equation using the well known Adomian decomposition method. The decomposition procedure of Adomian provides the solution in a rapidly convergent series where the series may lead to the solution in a closed form. Furthermore due to the rapid convergence of Adomian’s method, a truncation of the series solution with sufficiently large number of implemented components can be considered as an accurate approximation of the exact solution. This method provides a reliable algorithm that requires less work if compared with the traditional techniques. Some illustrative examples are presented to show the efficiency of the presented method.