In 1918 Prüfer showed a one-to-one correspondence between labeled trees on n nodes and sequences of (n 2) node labels, obtained by iteratively deleting the leaf with the smallest label in the current tree and appending the label of the adjacent node to the code. In 1953 Neville proposed two additional methods for encoding a labeled tree of order n into a sequence of (n 2) labels. Recently, yet ...

Explicit velocity- and position-Verlet-like algorithms of the second order are proposed to integrate the equations of motion in many-body systems. The algorithms are derived on the basis of an extended decomposition scheme at the presence of a free parameter. The nonzero value for this parameter is obtained by reducing the influence of truncated terms to a minimum. As a result, the proposed alg...

This paper presents a comparison between two feature selection methods, the Importance Score (IS) which is based on a greedy-like search and a genetic algorithm-based (GA) method, in order to better understand their strengths and limitations and their area of application. The results of our experiments show a very strong relation between the nature of the data and the behavior of both systems. ...

A confluent Vandermonde-like matrix P(a0, a, an) is a generalisation of the confluent Vandermonde matrix in which the monomials are replaced by arbitrary polynomials. For the case where the polynomials satisfy a three-term recurrence relation algorithms for solving the systems Px b and Pra f in O(n2) operations are derived. Forward and backward error analyses that provide bounds for the relativ...

Automatic data alignment and computation domain partitioning techniques have been widely investigated to reduce communication overheads in distributed memory systems. This paper considers how these two techniques can be combined and applied to BLAS-like algorithms. Current data alignment techniques focus on individual data entries and cannot be directly used for cases when blocks of entries sho...

For many years there was a very common misbelief that having embedded mechanisms in hardware, constitute the optimal solution not only in the usage and the performance for the encryption algorithms, but for their security as well. The idea that lead to this common belief was that by this way an attacker could not tamper the encryption algorithms, specially regarding the asymmetric ones. M. Youn...

The optimal allocation of a chain-like task system on the chain-like network computers was rst presented by Bokhari with time complexity O(m 3 n))1], where m and n denote the number of modules and the number of processors respectively. Sheu and Chiang improved it and gave an O(minfm; ngm 2) algorithmm2]. Hsu had further developed a two phase approach with the worst case time complexity of O(m+(...

On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2,−7,−11,−19}. Thus a binary gcd like algorithm is presented for a unique factorization domain which is not Euclidean (case d = −19). Together with the earlier known binary gcd like algorithms for the ring of integers in Q( √−1) and Q(√−3...

Article history: Received 6 July 2012 Accepted 5 March 2013 Available online xxxx Submitted by V. Mehrmann AMS classification: 94A20 94A12 62H12