Results 1 - 10 of 1,631

Run-time Resolution of Uncertainty

by Kristopher Welsh, Pete Sawyer, Nelly Bencomo
"... Abstract—Requirements awareness should help optimize requirements satisfaction when factors that were uncertain at design time are resolved at runtime. We use the notion of claims to model assumptions that cannot be verified with confidence at design time. By monitoring claims at runtime, their vera ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract—Requirements awareness should help optimize requirements satisfaction when factors that were uncertain at design time are resolved at runtime. We use the notion of claims to model assumptions that cannot be verified with confidence at design time. By monitoring claims at runtime

Towards Requirements Aware Systems: Run-time Resolution of Design-time Assumptions

by Kristopher Welsh, Pete Sawyer, Nelly Bencomo
"... Abstract—In earlier work we proposed the idea of requirements-aware systems that could introspect about the extent to which their goals were being satisfied at runtime. When combined with requirements monitoring and self adaptive capabilities, requirements awareness should help optimize goal satisfa ..."
Abstract - Cited by 15 (6 self) - Add to MetaCart
satisfaction even in the presence of changing run-time context. In this paper we describe initial progress towards the realization of requirements aware systems with REAssuRE. REAssuRE focuses on explicit representation of assumptions made at design time. When such assumptions are shown not to hold, REAssu

Risks for the long run: A potential resolution of asset pricing puzzles

by Ravi Bansal, Amir Yaron - JOURNAL OF FINANCE , 1994
"... We model consumption and dividend growth rates as containing (i) a small long-run predictable component and (ii) fluctuating economic uncertainty (consumption volatility). These dynamics, for which we provide empirical support, in conjunction with Epstein and Zin’s (1989) preferences, can explain ke ..."
Abstract - Cited by 761 (63 self) - Add to MetaCart
We model consumption and dividend growth rates as containing (i) a small long-run predictable component and (ii) fluctuating economic uncertainty (consumption volatility). These dynamics, for which we provide empirical support, in conjunction with Epstein and Zin’s (1989) preferences, can explain

W4: Real-time surveillance of people and their activities

by Ismail Haritaoglu, David Harwood, Larry S. Davis - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2000
"... w4 is a real time visual surveillance system for detecting and tracking multiple people and monitoring their activities in an outdoor environment. It operates on monocular gray-scale video imagery, or on video imagery from an infrared camera. W4 employs a combination of shape analysis and tracking t ..."
Abstract - Cited by 709 (9 self) - Add to MetaCart
bags, or removing an object. It runs at 25 Hz for 320x240 resolution images on a 400 Mhz dual-Pentium II PC.

Fake Run-Time Selection of Template Arguments in C++

by Daniel Langr, Jerry P. Draayer
"... C++ does not support run-time resolution of template type arguments. To circumvent this restriction, we can instantiate a template for all possible combinations of type arguments at compile time and then select the proper instance at run time by evaluation of some provided conditions. However, for t ..."
Abstract - Add to MetaCart
C++ does not support run-time resolution of template type arguments. To circumvent this restriction, we can instantiate a template for all possible combinations of type arguments at compile time and then select the proper instance at run time by evaluation of some provided conditions. However

Image-based visual hulls

by Wojciech Matusik, Chris Buehler, Ramesh Raskar, Steven J. Gortler, Leonard McMillan - IN PROCEEDINGS OF ACM SIGGRAPH 2000 , 2000
"... In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry and incremental computation to achieve a constant rendering cost per rendered pixel. It does not suffer from the computati ..."
Abstract - Cited by 339 (15 self) - Add to MetaCart
the computation complexity, limited resolution, or quantization artifacts of previous volumetric approaches. We demonstrate the use of this algorithm in a real-time virtualized reality application running off a small number of video streams.

Run-time type computations in the Warren Abstract Machine

by Christoph Beierle, Gregor Meyer - The Journal of Logic Programming , 1994
"... The type concept of the logic programming language PROTOS-L sup-ports sorts, subsort relationships and parametric polymorphism. Due to the order-sortedness types are also present at run time, replacing parts of the deduction process required in an unsorted version by efficient type computations. Tog ..."
Abstract - Cited by 12 (8 self) - Add to MetaCart
The type concept of the logic programming language PROTOS-L sup-ports sorts, subsort relationships and parametric polymorphism. Due to the order-sortedness types are also present at run time, replacing parts of the deduction process required in an unsorted version by efficient type computations

Short Proofs are Narrow - Resolution made Simple

by Eli Ben-sasson, Avi Wigderson - Journal of the ACM , 2000
"... The width of a Resolution proof is de ned to be the maximal number of literals in any clause of the proof. In this paper we relate proof width to proof length (=size), in both general Resolution, and its tree-like variant. The following consequences of these relations reveal width as a crucial " ..."
Abstract - Cited by 205 (14 self) - Add to MetaCart
from natural expansion property of clauses of the input tautology. In the other direction, the width-size relations naturally suggest a simple dynamic programming procedure for automated theorem proving - one which simply searches for small width proofs. This relation guarantees that the running time

A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem

by Sebastien Roy, Ingemar Cox , 1998
"... This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum-flow problem. Once solved, the minimum-cut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis provi ..."
Abstract - Cited by 258 (4 self) - Add to MetaCart
as well as better handling of depth discontinuities. While the worst case running time is O(n 2 d 2 log(nd)), the observed average running time is O(n 1:2 d 1:3 ) for an image size of n pixels and depth resolution d. 1 Introduction It is well known that depth related displacements in stereo

Machines

by Edward Stanley Piekos, Edward Stanley Piekos , 1999
"... Numerical simulations of gas-lubricated journal bearings for microfabricated machines are performed with specialized tools. To maximize flexibility, an orbit method formulation is chosen for the primary tool. Its pseudospectral fluid equation solver enables run-time resolution adjustment while maint ..."
Abstract - Add to MetaCart
Numerical simulations of gas-lubricated journal bearings for microfabricated machines are performed with specialized tools. To maximize flexibility, an orbit method formulation is chosen for the primary tool. Its pseudospectral fluid equation solver enables run-time resolution adjustment while
Results 1 - 10 of 1,631