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

Physical Sciences and Mathematics Commons

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

Computer Sciences

Faculty Publications

Algorithm

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

An Improved Distance Heuristic Function For Directed Software Model Checking, Eric G. Mercer, Neha Rungta Nov 2006

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 …


Edge Inference For Image Interpolation, Bryan S. Morse, Neil Toronto, Dan A. Ventura Aug 2005

Edge Inference For Image Interpolation, Bryan S. Morse, Neil Toronto, Dan A. Ventura

Faculty Publications

Image interpolation algorithms try to fit a function to a matrix of samples in a "natural-looking" way. This paper presents edge inference, an algorithm that does this by mixing neural network regression with standard image interpolation techniques. Results on gray level images are presented, and it is demonstrated that edge inference is capable of producing sharp, natural-looking results. A technique for reintroducing noise is given, and it is shown that, with noise added using a bicubic interpolant, edge inference can be regarded as a generalization of bicubic interpolation. Extension into RGB color space and additional applications of the algorithm are …


Prioritized Soft Constraint Satisfaction: A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin, Michael A. Goodrich, Charles D. Knutson Mar 2004

Prioritized Soft Constraint Satisfaction: A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin, Michael A. Goodrich, Charles D. Knutson

Faculty Publications

This paper presents Prioritized Soft Constraint Satisfaction (PSCS), a novel approach to selecting the “best” transport in dynamic wireless transport switching systems. PSCS maintains a satisfying connection to another endpoint by choosing transports based on a user-established range of preferences and priority for criteria such as speed, power, range and cost. Additionally, feedback is provided regarding tradeoffs among the criteria, thus enabling the user to adjust inputs according to the capabilities of the system. We also recommend guidelines for setting preferences and priorities.