نتایج جستجو برای: successive refinement

تعداد نتایج: 68561  

2009
Corina Mitrohin Andreas Podelski Silke Wagner

The abstraction of a hybrid system by eliminating one or more of its continuous variables is in general too coarse. In this situation, dwell time refinement may be useful. The idea is to impose explicit constraints on the time that may resp. must be spent (or “dwelled”) between successive mode switches. We show how the required constraints can be inferred automatically (with acceptable cost). T...

Journal: :Computers & Geosciences 2017
Gunnar Jansen Reza Sohrabi Stephen A. Miller

Short for Hexahedra from Unique Location in (K)convex Polyhedra – HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite difference, finite volume or finite element methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive i...

2003
Christian Lange Thomas Hermann Helge J. Ritter

In this paper we present an approach to track a moving body in a sequence of camera images by model adaptation. The parameters of a stick figure model are varied by using a stochastic search algorithm. The similarity of rendered model images and camera images of the user are used as quality measure. A refinement of the algorithm is introduced by using combined stereo views and relevance maps to...

1999
John Grundy

Good software architecture design is crucial in successfully realising an OOA specification with an appropriate OOD model that meets the specification’s functional and non-functional requirements. Unfortunately most CASE tools and software architecture design notations do not adequately support software architecture modelling and analysis, nor integration with OOA & D models. We describe SoftAr...

2006
João M. Fernandes Ricardo J. Machado Paula Monteiro Helena Rodrigues

This paper presents a demonstration case on the successive application of a model-based technique to assist on the refinement of software logical architectures. The technique is essentially based on the transformation of use cases into object diagrams. The applicability of the technique is illustrated by presenting some results from a mobile application. For mobile software, the definition of t...

Journal: :Electr. Notes Theor. Comput. Sci. 2010
Francisco Heron de Carvalho Junior Rafael Dueire Lins

The # (hash) component model aims to take advantage of a component-based perspective of software for the development of high-performance computing applications targeted at parallel distributed architectures. This paper presents an approach for specifying #-components using Circus, to provide the ability of reasoning about behavioral and functional properties of #-components and their compositio...

1990
Colin Runciman Mike Firth

Development of a prototype into a final program proceeds by steps of transformational refinement, through successive versions. Every version satisfies the initial specification by construction, because every transformation step fully preserves behavioural meaning of programs. Transformations are selected to make later versions more efficient than earlier ones – meaning that computations use les...

1969
Kenneth J. Arrow Kenneth Arrow

Introduction The concept of public goods, has been developed through a process of successive refinement over a long period of tire. Yet surprisingly enough there does not seem to exist anywhere in the literature a clear general definition of this concept or the more general one of "externality." The accounts given are usually either very general and discursive, difficult of interpretation in sp...

2012
Toby Rahilly John Plaice Blanca Mancilla

We present the general mechanism by which logical content, arranged in multiple interacting containers, can be typeset into a set of visual substrates. The overall algorithm is iterative, with the successive iterations refining a multidimensional context that parameterises the behavior of the algorithm. Each iteration consists of three parts. First, each visual substrate is informed which parts...

Journal: :IEEE Trans. Information Theory 1996
Hirosuke Yamamoto

A rate-distortion problem is considered for a triangular communication system (TCS), which has one encoder f and two decoders gx and gy. The encoder f maps correlated source outputs (X”, Y”) to two codewords WX and WY, which are sent to gx and gy, respectively. The decoders gx and gy can communicate with each other via rate-constrained channels as many times as they need, and gx reproduces X-” ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید