Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
64 X 64 Bit Multiplier Using Pass Logic, Shibi Thankachan
64 X 64 Bit Multiplier Using Pass Logic, Shibi Thankachan
Computer Science Theses
ABSTRACT Due to the rapid progress in the field of VLSI, improvements in speed, power and area are quite evident. Research and development in this field are motivated by growing markets of portable mobile devices such as personal multimedia players, cellular phones, digital camcorders and digital cameras. Among the recently popular logic families, pass transistor logic is promising for low power applications as compared to conventional static CMOS because of lower transistor count. This thesis proposes four novel designs for Booth encoder and selector logic using pass logic principles. These new designs are implemented and used to build a 64 …
Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen
Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen
Research Collection School Of Computing and Information Systems
We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge lengths are positive real numbers, which …
An Improved Distance Heuristic Function For Directed Software Model Checking, Eric G. Mercer, Neha Rungta
An Improved Distance Heuristic Function For Directed Software Model Checking, Eric G. Mercer, Neha Rungta
Faculty Publications
State exploration in directed software model checking is guided using a heuristic function to move states near errors to the front of the search queue. Distance heuristic functions rank states based on the number of transitions needed to move the current program state into an error location. Lack of calling context information causes the heuristic function to underestimate the true distance to the error; however, inlining functions at call sites in the control flow graph to capture calling context leads to an exponential growth in the computation. This paper presents a new algorithm that implicitly inlines functions at call sites …
Two Energy Efficient Algorithms For Tracking Objects In A Sensor Network, Arvind Rapaka, Sanjay Kumar Madria
Two Energy Efficient Algorithms For Tracking Objects In A Sensor Network, Arvind Rapaka, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
We propose two energy efficient algorithms for locating a target object moving in an area covered by a wireless ad hoc network. The first algorithm developed conserve energy by efficiently identifying sensor nodes, as Home Nodes, and use only local messages between neighboring nodes to follow the trail of the object. Since we avoid the long-range transmission and maximize the localization, the algorithms reduce the communication cost. The dynamic nature of the second algorithm exploits the predefined parameters such as the object velocity. Our algorithm represents query shipping against the conventional data shipping as a means to reduce the amount …
The Pseudosquares Prime Sieve, Jonathan P. Sorenson
The Pseudosquares Prime Sieve, Jonathan P. Sorenson
Scholarship and Professional Work - LAS
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
Scholarship and Professional Work - LAS
In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).