We propose the Skeleton to Quad-dominant polygonal Mesh algorithm (SQM), which converts skeletal structures to meshes composed entirely of polar and annular regions. Both types of regions have a regular structure where all faces are quads except for a single ring of triangles at the center of each polar region. The algorithm produces high quality meshes which contain irregular vertices only at ...

The bound on component failures and their spatial distribution govern the fault tolerance of any candidate error-detecting algorithm. For distributed memory mul-tiprocessors, the speciic algorithm and the topology of the processor intercon-nection network deene these bounds. This paper introduces the maximal fault index, derived from the system topology and local communication patterns, to demo...

In this paper, we develop the theory of so-called nonstandard Gaussian quadrature formulae based on operator values for a general family of linear operators, acting of the space of algebraic polynomials, such that the degrees of polynomials are preserved. Also, we propose a stable numerical algorithm for constructing such quadrature formulae. In particular, for some special classes of linear op...

4 A graph is said to be d-distinguishable if there exists a d-labeling of its vertices which is 5 only preserved by the identity map. The distinguishing number of a graph G is the smallest 6 number d for which G is d-distinguishable. We show that the distinguishing number of trees 7 and forests can be computed in linear time, improving the previously known O(n log n) time 8 algorithm. 9

— In this paper, we study composition and décomposition of Pétri nets via a common set of places or transitions. We prove that some properties are preserved by these techniques\ and some other ones can be obtained by the composition of the covering graphs. We propose some algorithms to décompose a net according to the properties that must be verified. We present an algorithm to compose minimal ...

Privacy preserving multi-party machine learning approaches enable multiple parties to train a machine learning model from aggregate data while ensuring the privacy of their individual datasets is preserved. In this paper, we propose a privacy preserving multi-party machine learning approach based on homomorphic encryption where the machine learning algorithm of choice is deep neural networks. W...

A color quantization method is proposed. The method hierarchically uses a bisection tool that preserves certain color-distribution features. The preserved features are average color, variance in each color dimension, and average color radius. An algorithm is given that includes the histogram simpli"cation procedure, color palette generation, and pixel mapping. Experiments show that the proposed...

This paper presents a type system for the calculus of Mobile Resources (MR) proposed by Godskesen et al. The type system is able to prevent undesirable bordercrossing behaviour such as Trojan horses. This is achieved by combining the notion of group with a notion of security policy. Well-typed processes satisfy a safety property which is preserved under reduction. An algorithm is presented whic...

Class hierarchy composition aims at constructing software systems by composing a set of class hierarchies into an executable system. Current composition algorithms cannot provide semantic guarantees. We present a composition algorithm, together with an interference criterion and its correctness proof, which guarantees that behavior of the original hierarchies is preserved for interference-free ...

We introduce a novel content-independent filter to protect privacy sensitive Regions Of Interest (ROI) in video surveillance sequences. An abstracted version of the original image is rendered such as the general appearance of shapes and colors is preserved, while obfuscating fine details carrying personal visual information. We use shapes and colors-aware, temporally coherent segmentation algor...