Finding irreducible components of some real transcendental varieties

An algorithm is proposed for producing all components of the varieties defined by equations which involve polynomials and exponentials of polynomials, irreducible over real algebraic numbers. The running time of the algorithm is singly exponential in the number of variables and, with this number fixed, polynomial in all other parameters of the input.     

Characterizing polynomials with roots in a semialgebraic set

Let p/spl isin/R[x] be a real-valued polynomial and S/spl sube/C a set defined by polynomial inequalities g/sub k/(z,z~)/spl ges/0 for some polynomials g/sub k/ in C[z,z~]. We provide a necessary and sufficient condition on the coefficients of p for all the zeros of p to be in S.     

Linear time algorithm for finding a picture''s connected components

An algorithm that identifies the connnected components of a thresholded digitized picture is presented. The time complexity of the algorithm is linear in the number of runs of object pixels in the picture.     

Makespan minimization in preemptive two machine job shops

In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two machine job shop. We present a polynomial time approximation algorithm with worst case ratio 3/2 for this problem, and we also argue that this is the best possible result that can be derived via our line of approach.     

Determining connected components in linear time by a linear number of processors

This paper describes a rather simple algorithm for determining the connected components of a simple undirected graph with n nodes using O(n) time and n processors. It requires a shared memory SIMD model permitting simultaneous reading from the same memory location by different processors (read conflicts).     

Polynomial Approximation and Graph-Coloring

Consider a graph G=(V,E) of order n. In the minimum graph-coloring problem we try to color V with as few colors as possible so that no two adjacent vertices receive the same color. This problem is among the first ones proved to be intractable, and hence, it is very unlikely that an optimal polynomial-time algorithm could ever be devised for it. In this paper, we survey the main polynomial time approximation algorithms (the ones for which theoretical approximability bounds have been studied) for the minimum graph-coloring and we discuss their approximation performance and their complexity. Finally, we further improve the approximation ratio for graph-coloring. Received October 5, 2001; revised November 15, 2002 Published online: February 20, 2003     

Invariance properties of RAMS and linear time

An operation on integers isLTTC if it is computable in linear time on a Turing machine (using the dyadic or binary representation of integers). AnLTTC-RAM (respectivelyI-RAM) is a RAM which only uses LTTC operations (respectively operations in the setI).The address-free time complexity measure of a RAM evaluates execution times using the logarithmic cost criterion but assumes that addressing operations are performed for free.     

Retrieval of scattered information by EREW,CREW, and CRCW PRAMs

Thek-compaction problem arises whenk out ofn cells in an array are non-empty and the contents of these cells must be moved to the firstk locations in the array. Parallel algorithms fork-compaction have obvious applications in processor allocation and load balancing;k-compaction is also an important subroutine in many recently developed oped parallel algorithms. We show that any EREW PRAM that solves thek-compaction problem requires time, even if the number of processors is arbitrarily large andk=2. On the CREW PRAM, we show that everyn-processor algorithm fork-compaction problem requires (log logn) time, even ifk=2. Finally, we show thatO(logk) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.     

The complexity of computing maximal word functions

Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were first investigated in relation to data compression [21]. By the maximal word function of a languageL ^*, we mean the problem of finding, on inputx, the lexicographically largest word belonging toL that is smaller than or equal tox.In this paper we present a parallel algorithm for computing maximal word functions for languages recognized by one-way nondeterministic auxiliary pushdown automata (and hence for the class of context-free languages).This paper is a continuation of a stream of research focusing on the problem of identifying properties others than membership which are easily computable for certain classes of languages. For a survey, see [24].     

Counting distinct palindromes in a word in linear time

We design an algorithm to count the number of distinct palindromes in a word w in time O(|w|), by adapting an algorithm to detect all occurrences of maximal palindromes in a given word and using the longest previous factor array. As a direct consequence, this shows that the palindromic richness (or fullness) of a word can be checked in linear time.     

有向图连通支配集求解算法

定义了有向图指定源点连通支配集问题。借助参数算法中的技术设计了针对该问题的规约规则,通过规约规则的实施来降低原问题的规模;随后又设计了近似算法在规约后的有向图中求出一个较小的连通支配集;最后结合规约规则带来的一些良好特性设计了优化规则,通过优化变换的实施进一步缩减由近似算法求得的连通支配集。不同模型随机图上的模拟实验表明这些规则和算法是有效的。     

SpiNNaker: Fault tolerance in a power- and area- constrained large-scale neuromimetic architecture

SpiNNaker is a biologically-inspired massively-parallel computer designed to model up to a billion spiking neurons in real-time. A full-fledged implementation of a SpiNNaker system will comprise more than 10⁵ integrated circuits (half of which are SDRAMs and half multi-core systems-on-chip). Given this scale, it is unavoidable that some components fail and, in consequence, fault-tolerance is a foundation of the system design. Although the target application can tolerate a certain, low level of failures, important efforts have been devoted to incorporate different techniques for fault tolerance. This paper is devoted to discussing how hardware and software mechanisms collaborate to make SpiNNaker operate properly even in the very likely scenario of component failures and how it can tolerate system-degradation levels well above those expected.     

Fast evaluation of vector splines in three dimensions

Vector spline techniques have been developed as general-purpose methods for vector field reconstruction. However, such vector splines involve high computational complexity, which precludes applications of this technique to many problems using large data sets. In this paper, we develop a fast multipole method for the rapid evaluation of the vector spline in three dimensions. The algorithm depends on a tree-data structure and two hierarchical approximations: an upward multipole expansion approximation and a downward local Taylor series approximation. In comparison with the CPU time of direct calculation, which increases at a quadratic rate with the number of points, the presented fast algorithm achieves a higher speed in evaluation at a linear rate. The theoretical error bounds are derived to ensure that the fast method works well with a specific accuracy. Numerical simulations are performed in order to demonstrate the speed and the accuracy of the proposed fast method.     

A linear kernel for a planar connected dominating set

We provide polynomial time data reduction rules for Connected Dominating Set on planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem. To obtain the desired kernel we introduce a method that we call reduce or refine. Our kernelization algorithm analyzes the input graph and either finds an appropriate reduction rule that can be applied, or zooms in on a region of the graph which is more amenable to reduction. We find this method of independent interest and believe that it will be useful for obtaining linear kernels for other problems on planar graphs.     

Impulsive vaccination of SEIR epidemic model with time delay and nonlinear incidence rate

In this paper, an SEIR epidemic disease model with time delay and nonlinear incidence rate is studied, and the dynamical behavior of the model under pulse vaccination is analyzed. Using the discrete dynamical system determined by the stroboscopic map, we show that there exists an infection-free periodic solution. Further, we show that the infection-free periodic solution is globally attractive when the period of impulsive effect is less than some critical value. Using a new modelling method, we obtain a sufficient condition for the permanence of the epidemic model with pulse vaccination. We show that time delay, pulse vaccination can bring different effects on the dynamic behavior of the model by numerical analysis. Our results also show the time delay is “profitless”. The main feature of this paper is to introduce time delay and impulse into the SEIR epidemic model and to give pulse vaccination strategies.     

Splat representation of parametric surfaces

Point and splat-based representations have become a suitable technique both for modeling and rendering complex 3D shapes. Converting other kinds of models as parametric surfaces to splat-based representations will allow to mix surface and splat-based models and to take advantage of the existing point-based rendering methods. In this work, we present an approach to convert a parametric surface into a splat-based representation. It works in parametric space, performs an adaptive sampling based on the surface curvature and a given error tolerance and uses power Voronoi diagrams. The goal is to approximate the surface with an optimized set of elliptical splats.     

Load Balancing in Distributed Parallel Systems for Telecommunications

Communication networks pose difficult problems for the soft limit real-time control of calls and services. For such highly parallel distributed systems the system observation limits are rigorously treated. As a consequence a parallel processing node model and the load parameters and balancing potential are analysed by the use of a suitable simulation model. Based upon the simulation results, new load balancing algorithms are developed for the respective problem class. Received: December 23, 1998