Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 17 of 17
Full-Text Articles in Physical Sciences and Mathematics
A Novel Weighted-Graph-Based Grouping Algorithm For Metadata Prefetching, Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju Shang
A Novel Weighted-Graph-Based Grouping Algorithm For Metadata Prefetching, Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju Shang
Yifeng Zhu
Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching algorithms, either lack of emphasis on group prefetching, or bearing a high level of computational complexity, do not work well with metadata prefetching cases. Therefore, an efficient, accurate, and distributed metadata-oriented prefetching scheme is critical to leverage the overall performance in large distributed storage systems. In this paper, we present a novel weighted-graph-based prefetching technique, built on both direct and indirect successor relationship, to reap performance benefit from prefetching specifically for clustered metadata servers, an arrangement envisioned …
An Energy-Aware Multilevel Clustering Algorithm For Wireless Sensor Networks, Xinfang Yan, Jiangtao Xi, Joe F. Chicharo, Yanguang Yu
An Energy-Aware Multilevel Clustering Algorithm For Wireless Sensor Networks, Xinfang Yan, Jiangtao Xi, Joe F. Chicharo, Yanguang Yu
Dr Yanguang Yu
Clustering sensors nodes as the basic of routing is an efficient mechanism for prolonging the lifetime of wireless sensor networks. In this paper, the high-efficient multilevel clustering is abstracted as a root tree which has the performances of the minimal relay set and the maximal weight according to graph theory. A mathematical model for the clustering virtual backbone is built. Based on the model, an algorithm called energy-aware multilevel clustering (EAMC) is proposed. The EAMC can reduce the number of relays used for data transmission by minimizing the amount of the nodes in the root tree (that is cluster-head). Furthermore, …
Multi-Resolution Mean-Shift Algorithm For Vector Quantization, P L. M Bouttefroy, A Bouzerdoum, A Beghdadi, S L. Phung
Multi-Resolution Mean-Shift Algorithm For Vector Quantization, P L. M Bouttefroy, A Bouzerdoum, A Beghdadi, S L. Phung
Professor Salim Bouzerdoum
The generation of stratified codebooks, providing a subset of vectors at different scale levels, has become necessary with the emergence of embedded coder/decoder for scalable image and video formats. We propose an approach based on mean-shift, invoking the multi-resolution framework to generate codebook vectors. Applied to the entire image, mean-shift is slow because it requires each sample to converge to a mode of the distribution. The procedure can be sped up with three simple assumptions: kernel truncation, code attraction and trajectory attraction. Here we propose to apply the mean-shift algorithm to the four image subbands generated by a DWT, namely …
A Particle Swarm Optimization Algorithm Based On Orthogonal Design, Jie Yang, Abdesselam Bouzerdoum, Son Lam Phung
A Particle Swarm Optimization Algorithm Based On Orthogonal Design, Jie Yang, Abdesselam Bouzerdoum, Son Lam Phung
Professor Salim Bouzerdoum
The last decade has witnessed a great interest in using evolutionary algorithms, such as genetic algorithms, evolutionary strategies and particle swarm optimization (PSO), for multivariate optimization. This paper presents a hybrid algorithm for searching a complex domain space, by combining the PSO and orthogonal design. In the standard PSO, each particle focuses only on the error propagated back from the best particle, without “communicating” with other particles. In our approach, this limitation of the standard PSO is overcome by using a novel crossover operator based on orthogonal design. Furthermore, instead of the “generating-and-updating” model in the standard PSO, the elitism …
An Energy-Aware Multilevel Clustering Algorithm For Wireless Sensor Networks, Xinfang Yan, Jiangtao Xi, Joe F. Chicharo, Yanguang Yu
An Energy-Aware Multilevel Clustering Algorithm For Wireless Sensor Networks, Xinfang Yan, Jiangtao Xi, Joe F. Chicharo, Yanguang Yu
Professor Joe F. Chicharo
Clustering sensors nodes as the basic of routing is an efficient mechanism for prolonging the lifetime of wireless sensor networks. In this paper, the high-efficient multilevel clustering is abstracted as a root tree which has the performances of the minimal relay set and the maximal weight according to graph theory. A mathematical model for the clustering virtual backbone is built. Based on the model, an algorithm called energy-aware multilevel clustering (EAMC) is proposed. The EAMC can reduce the number of relays used for data transmission by minimizing the amount of the nodes in the root tree (that is cluster-head). Furthermore, …
A New Generic Digital Signature Algorithm, Jennifer Seberry, Vinhbuu To, Dongvu Tonien
A New Generic Digital Signature Algorithm, Jennifer Seberry, Vinhbuu To, Dongvu Tonien
Professor Jennifer Seberry
In this paper, we study two digital signature algorithms, the DSA and ECDSA, which have become NIST standard and have been widely used in almost all commercial applications. We will show that the two algorithms are actually ‘the same’ algebraically and propose a generic algorithm such that both DSA and ECDSA are instances of it. By looking at this special angle through the generic algorithm, we gain a new insight into the two algorithms DSA and ECDSA. Our new proposed digital signature algorithm is described generically using a group G and a map toNumber : G → Z. As an …
Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson
Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson
Jonathan P. Sorenson
We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.
Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson
Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson
Jonathan P. Sorenson
We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.
Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Jonathan P. Sorenson
In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.
Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Jonathan P. Sorenson
In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.
The Pseudosquares Prime Sieve, Jonathan P. Sorenson
The Pseudosquares Prime Sieve, Jonathan P. Sorenson
Jonathan P. Sorenson
We present the pseudosquares prime sieve, which finds all primes up to n.
Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson
Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson
Jonathan P. Sorenson
In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).
Necessary And Sufficient Conditions For Three And Four Variable Orthogonal Designs In Order 36, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Necessary And Sufficient Conditions For Three And Four Variable Orthogonal Designs In Order 36, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Professor Jennifer Seberry
We use a new algorithm to find new sets of sequences with entries from {0, ±a, ±b, ±c, ±d}, on the commuting variables a, b, c, d, with zero autocorrelation function. Then we use these sequences to construct a series of new three and four variable orthogonal designs in order 36. We show that the necessary conditions plus (.s1, s2, s3, s4) not equal to 12816 18 816 221313 26721 36 816 4889 12825 191313 23 424 289 9 381015 8899 14425 22 916 are sufficient for the existence of an OD(36; s1, s2 s3, s4) constructed using four circulant …
New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry
New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry
Professor Jennifer Seberry
The book, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York-Basel, 1979, by A. V. Geramita and Jennifer Seberry, has now been out of print for almost two decades. Many of the results on weighing matrices presented therein have been greatly improved. Here we review the theory, restate some results which are no longer available and expand on the existence of many new weighing matrices and orthogonal designs of order 2n where n is odd. We give a number of new constructions for orthogonal designs. Then using number theory, linear algebra and computer searches we find new weighing …
An Algorithm To Find Formulae And Values Of Minors For Hadamard Matrices: Ii, C. Koukouvinos, E. Lappas, M. Mitrouli, Jennifer Seberry
An Algorithm To Find Formulae And Values Of Minors For Hadamard Matrices: Ii, C. Koukouvinos, E. Lappas, M. Mitrouli, Jennifer Seberry
Professor Jennifer Seberry
An algorithm computing the (n — j) x (n — j ) , j = 1, 2, ... minors of Hadamard matrices of order n is presented. Its implementation is analytically described step by step for several values of n and j. For j = 7 the values of minors are computed for the first time. A formulae estimating all the values of (n — j) x (n — j) minors is predicted.
Two Number-Theoretic Problems That Illustrate The Power And Limitations Of Randomness, Andrew Shallue
Two Number-Theoretic Problems That Illustrate The Power And Limitations Of Randomness, Andrew Shallue
Andrew Shallue
This thesis contains work on two problems in algorithmic number theory. The first problem is to give an algorithm that constructs a rational point on an elliptic curve over a finite field. A fast and easy randomized algorithm has existed for some time. We prove that in the case where the finite field has characteristic 2, there is a deterministic algorithm with the same asymptotic running time as the existing randomized algorithm.
A Note On Computing Eigenvalues Of Banded Hermitian Toeplitz Matrices, William F. Trench
A Note On Computing Eigenvalues Of Banded Hermitian Toeplitz Matrices, William F. Trench
William F. Trench
No abstract provided.