Results 1  10
of
133
M.P.: Topological Relations from Metric Refinements
 ACM SIGSPATIAL 2009
, 2009
"... Naive Geography’s premise “Topology matters, metric refines” calls for metric properties that provide opportunities for finergrained distinctions than the purely qualitative topological relations. This paper defines a comprehensive set of eleven metric refinements that apply to the eight coarse top ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Naive Geography’s premise “Topology matters, metric refines” calls for metric properties that provide opportunities for finergrained distinctions than the purely qualitative topological relations. This paper defines a comprehensive set of eleven metric refinements that apply to the eight coarse
Refinement Types for Logical Frameworks
 Informal Proceedings of the Workshop on Types for Proofs and Programs
, 1993
"... We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes and intersection types. This refinement preserves desirable features of LF, such as decidability of typechecking, and at the same time considerably simplifies the representations of many deductive s ..."
Abstract

Cited by 41 (8 self)
 Add to MetaCart
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes and intersection types. This refinement preserves desirable features of LF, such as decidability of typechecking, and at the same time considerably simplifies the representations of many deductive
Exploiting Parallelism in Interactive Theorem Provers
 Proceedings of TPHOLs, volume 1479 of LNCS
, 1998
"... . This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multiprocessor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a co ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multiprocessor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a
Refinement of Z Machines
, 1998
"... s and compressed postscript files are available via http://svrc.it.uq.edu.au Refinement of Z Machines Karl Lermer Abstract. This paper presents a systematic specification and refinement framework for reactive systems. The specification model is given in standard Z notation. It makes explicit the ..."
Abstract
 Add to MetaCart
, refinement, reactive system 1 Introduction A wellknown coarse classification [AL88,MP92] of software systems yields two classes of programs. One class consists of programs that can be specified by input/output relations. Manna and Pnueli [MP92] call these programs transformational programs. The other class
Combinatorial Commutative Algebra
, 2004
"... The last decade has seen a number of exciting developments at the intersection of commutative algebra with combinatorics. New methods have evolved out of an influx of ideas from such diverse areas as polyhedral geometry, theoretical physics, representation theory, homological algebra, symplectic geo ..."
Abstract

Cited by 125 (5 self)
 Add to MetaCart
concerns combinatorially defined ideals and their quotients, with a focus on numerical invariants and resolutions, especially under gradings more refined than the standard integer grading. This project started at the COCOA summer school in Torino, Italy, in June 1999. The eight lectures on monomial ideals
Mp in block quasiincoherent dictionaries
 Signal Processing Institute, EPFL
, 2003
"... Given a redundant dictionary, we consider the followingsubset decomposition, and we call blocks the subsets of atoms,. The block coherence is defined as the maximum coherence between any two atoms, taken from different blocks. Definition 1: The block coherence, given a block decomposition, is / 6 + ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
+87 2 (1) is the95:<; atom from the block (. Definition 2: A dictionary is then said block incoherent if there exists a decomposition such that the block coherence = is small. The block coherence considers similarities between atoms from two different block. In order to refine the analysis
Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers
 Comput. Methods Appl. Mech. Engrg
, 1993
"... A procedure to support parallel refinement and redistribution of two dimensional unstructured finite element meshes on distributed memory computers is presented. The procedure uses the mesh topological entity hierarchy as the underlying data structures to easily support the required adjacency inform ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
A procedure to support parallel refinement and redistribution of two dimensional unstructured finite element meshes on distributed memory computers is presented. The procedure uses the mesh topological entity hierarchy as the underlying data structures to easily support the required adjacency
Amino Acid Balancing in the Context of MP and RUP Requirements
"... The protein requirements of lactating dairy cows continue to be refined. In NRC (1971, 1978), dietary requirements were expressed as CP and metabolic requirements as digestible protein. In NRC (1989), dietary requirements were ..."
Abstract
 Add to MetaCart
The protein requirements of lactating dairy cows continue to be refined. In NRC (1971, 1978), dietary requirements were expressed as CP and metabolic requirements as digestible protein. In NRC (1989), dietary requirements were
OpenMP Parallelism for . . . GridAdaptive Magnetohydrodynamic Simulations
, 2002
"... First results on the parallelism achieved by both automated and manually controlled OpenMP programming are reported for 2D and 3D magnetohydrodynamic computations. The simulations exploit adaptive mesh refinement, capable of capturing ow features like shocks and other sharp discontinuities accurat ..."
Abstract
 Add to MetaCart
First results on the parallelism achieved by both automated and manually controlled OpenMP programming are reported for 2D and 3D magnetohydrodynamic computations. The simulations exploit adaptive mesh refinement, capable of capturing ow features like shocks and other sharp discontinuities
Complete formal specification of the OpenMP memory model
 International Journal of Parallel Programming
, 2007
"... Abstract. OpenMP [1] is an important API for shared memory programming, combining shared memory’s potential for performance with a simple programming interface. Unfortunately, OpenMP lacks a critical tool for demonstrating whether programs are correct: a formal memory model. Instead, the current off ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. We conclude with several examples that may indicate areas of the OpenMP memory model that need further refinement however it is specified. Our goal is to motivate the OpenMP community to adopt those refinements eventually, ideally through a formal model, in later OpenMP specifications. 1
Results 1  10
of
133