In this paper first we prove four fundamental theorems of the alternative, called scaling dualities, characterizing exact and approximate solvability of four significant conic problems in finite dimensional spaces, defined as: homogeneous programming (HP), scaling problem (SP), homogeneous scaling problem (HSP), and algebraic scaling problem (ASP). Let φ be a homogeneous function of degree p > ...

Traditionally Online Handwriting Recognition (OHR) implementations use general-purpose processor architectures. The pre-processing step of OHR comprises regular array-based tasks such as normalisation, feature extraction and segmentation. Standard processor architectures cannot however efficiently support the varied arithmetic operations required by pre-processing. These tasks would seem ideall...

Vehicle counts and truck percentages are important input variables in both noise pollution and air quality models, but the acquisition of these variables through fixed-point methods can be expensive, labor-intensive, and provide incomplete spatial sampling. The increasing availability and decreasing cost of high spatial resolution imagery provides an opportunity to improve the descriptive abili...

Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line and on-line guessing and can distinguish between them. We add our guessing rules as state transitions to protocol models that are input to model checking tools. With our proof-of-concept implementation we have automatically det...

This paper describes the development on RASSP Benchmark 1 and 2 of the synthetic aperture radar (SAR) image processor using the RASSP design environment. The overall process flow developed by Lockheed Martin’s Advanced Technology Laboratories, as applied on the SAR processor, is illustrated. Results from using executable specifications; parametric cost estimating tools and VHDL-based performanc...

ions and first-class procedures We've seen two ways to express the square-root computation as an instance of a more general method, once as a fixed-point search and once using Newton's method. Since Newton's method was itself expressed as a fixed-point process, we actually saw two ways to compute square roots as fixed points. Each method begins with a function and finds a fixed point of some tr...

Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line and on-line guessing and can distinguish between them. We add our guessing rules as state transitions to protocol models that are input to model checking tools. With our proof-of-concept implementation we have automatically det...

s of Student Presentations Student Presentations I, Monday, 07/12, 15-16 h, IKP Lecture Hall Vaclav Nemcik MU Brno, Czech Republic Anaphora Resolution for Czech One of the challenges in natural language understanding is to determine what entities are referred to in the discourse and how they relate to each other. This is a very complex task. But, as the first step, it is useful to determine co-...

The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the identified Grand Challenges is Non-Classical Computation, which examines many of the fundamental assumptions of Computer Science, and asks what would result if they were systematically broken. In this discussion paper, we ex...

s_______________________________ In order of Presentation Session A – 15 minute talks An Interactive Microarray CallGraph Visualization Michael Shah | Computer Science Engineering | Ph.D. Student In this paper we present an interactive call graph visualization tool for viewing large programs. Our space-filling grid based visualization shows a program at the function granularity. The grid view p...