Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Theory and Algorithms

Precis: A Design-Time Precision Analysis Tool, Mark L. Chang, Scott Hauck Jul 2012

Precis: A Design-Time Precision Analysis Tool, Mark L. Chang, Scott Hauck

Mark L. Chang

Currently, few tools exist to aid the FPGA developer in translating an algorithm designed for a general-purpose-processor into one that is precision-optimized for FPGAs. This task requires extensive knowledge of both the algorithm and the target hardware. We present a design-time tool, Precis, which assists the developer in analyzing the precision requirements of algorithms specified in MATLAB. Through the combined use of simulation, user input, and program analysis, we demonstrate a methodology for precision analysis that can aid the developer in focusing their manual precision optimization efforts.


Low-Cost Stereo Vision On An Fpga, Chris A. Murphy, Daniel Lindquist, Ann Marie Rynning, Thomas Cecil, Sarah Leavitt, Mark L. Chang Jul 2012

Low-Cost Stereo Vision On An Fpga, Chris A. Murphy, Daniel Lindquist, Ann Marie Rynning, Thomas Cecil, Sarah Leavitt, Mark L. Chang

Mark L. Chang

We present a low-cost stereo vision implementation suitable for use in autonomous vehicle applications and designed with agricultural applications in mind. This implementation utilizes the Census transform algorithm to calculate depth maps from a stereo pair of automotive-grade CMOS cameras. The final prototype utilizes commodity hardware, including a Xilinx Spartan-3 FPGA, to process 320times240 pixel images at greater than 150 frames per second and deliver them via a USB 2.0 interface.


Interactionless Calendar-Based Training For 802.11 Localization, Mark Chang, Andrew J. Barry, Noah L. Tye Jul 2012

Interactionless Calendar-Based Training For 802.11 Localization, Mark Chang, Andrew J. Barry, Noah L. Tye

Mark L. Chang

This paper presents our work in solving one of the weakest links in 802.11-based indoor-localization: the training of ground-truth received signal strength data. While crowdsourcing this information has been demonstrated to be a viable alternative to the time consuming and accuracy-limited process of manual training, one of the chief drawbacks is the rate at which a system can be trained. We demonstrate an approach that utilizes users' calendar and appointment information to perform interactionless training of an 802.11-based indoor localization system. Our system automatically determines if a user attended a calendar event, resulting in accuracy comparable to our previously published …


Efficient Mining Of Recurrent Rules From A Sequence Database, David Lo, Siau-Cheng Khoo, Chao Liu Nov 2011

Efficient Mining Of Recurrent Rules From A Sequence Database, David Lo, Siau-Cheng Khoo, Chao Liu

David LO

We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventually a series of consequent events occurs". Recurrent rules are intuitive and characterize behaviors in many domains. An example is in the domain of software specifications, in which the rules capture a family of program properties beneficial to program verification and bug detection. Recurrent rules generalize existing work on sequential and episode rules by considering repeated occurrences of premise and consequent events within a sequence and across multiple sequences, and by removing the "window" …


A Review Of Procedures To Evolve Quantum Algorithms, Adrian Gepp, Phil Stocks Jul 2010

A Review Of Procedures To Evolve Quantum Algorithms, Adrian Gepp, Phil Stocks

Adrian Gepp

There exist quantum algorithms that are more efficient than their classical counterparts; such algorithms were invented by Shor in 1994 and then Grover in 1996. A lack of invention since Grover’s algorithm has been commonly attributed to the non-intuitive nature of quantum algorithms to the classically trained person. Thus, the idea of using computers to automatically generate quantum algorithms based on an evolutionary model emerged. A limitation of this approach is that quantum computers do not yet exist and quantum simulation on a classical machine has an exponential order overhead. Nevertheless, early research into evolving quantum algorithms has shown promise. …


Business Failure Prediction Using Survival Analysis, Kuldeep Kumar, Adrian Gepp Jul 2010

Business Failure Prediction Using Survival Analysis, Kuldeep Kumar, Adrian Gepp

Adrian Gepp

Accurate business failure prediction models would be extremely valuable to many industry sectors, particularly in financial investment and lending. Recently, there has been a significant increase in interest in business failure prediction, from both industry and academia. Statistical business failure prediction models attempt to predict the failure or success of a business. Discriminant and logit analyses have been the most popular approaches, but there are also a large number of alternative techniques available. In this paper, a comparatively new technique known as survival analysis has been used for business failure prediction. Overall, the results suggest that survival analysis techniques provide …