In spite of some drawbacks, finite element methods based on nodal rather than Gaussian integration present major advantages, especially in the context elastoplastic or elastoviscoplastic problems—notably elimination locking problems due plastic viscoplastic incompressibility condition, and reduction computation storage requirements pertaining to internal variables. This paper investigates anoth...

A new fast and exact algorithm for determining the -NN classification of multichannel image data, and a new distance transform algorithm are described. Complexity analysis and empirical studies with magnetic resonance images (MRI) demonstrate the effectiveness of the new classification algorithm.

This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...

The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip p...

A q-analog of a Steiner system (briefly, q-Steiner system), denoted by S = Sq[t, k, n], is a set of k-dimensional subspaces of F n q such that each t-dimensional subspace of Fq is contained in exactly one element of S. Presently, q-Steiner systems are known only for t = 1 and in the trivial cases t = k and k = n. In this paper, the first known nontrivial q-Steiner systems with t ≥ 2 are constru...