Results 1  10
of
279
Sequential data assimilation with a nonlinear quasigeostrophic model using Monte Carlo methods to forecast error statistics
 J. Geophys. Res
, 1994
"... . A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The ..."
Abstract

Cited by 800 (23 self)
 Add to MetaCart
. The unbounded error growth found in the extended Kalman filter, which is caused by an overly simplified closure in the error covariance equation, is completely eliminated. Open boundaries can be handled as long as the ocean model is well posed. Wellknown numerical instabilities associated with the error
Closure Analysis in Constraint Form
 ACM Transactions on Programming Languages and Systems
, 1995
"... Interpretation Bondorf's definition can be simplified considerably. To see why, consider the second component of CMap(E) \Theta CEnv(E). This component is updated only in Closure Analysis in Constraint Form \Delta 9 b(E 1 @ i E 2 )¯ae and read only in b(x l )¯ae. The key observation is that ..."
Abstract

Cited by 62 (5 self)
 Add to MetaCart
Interpretation Bondorf's definition can be simplified considerably. To see why, consider the second component of CMap(E) \Theta CEnv(E). This component is updated only in Closure Analysis in Constraint Form \Delta 9 b(E 1 @ i E 2 )¯ae and read only in b(x l )¯ae. The key observation
Capsules and Closures
 MFPS 2011
, 2011
"... Capsules are a clean representation of the state of a computation in higherorder programming languages with effects. Their intent is to simplify and replace the notion of closure. They naturally provide support for functional and imperative features, including recursion and mutable bindings, and en ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Capsules are a clean representation of the state of a computation in higherorder programming languages with effects. Their intent is to simplify and replace the notion of closure. They naturally provide support for functional and imperative features, including recursion and mutable bindings
FOR THE NORMAL CLOSURE
, 2002
"... Let K be a pure cubic field. Let L be the normal closure of K. A relative integral basis (RIB) for L over Q( √−3) is given. This RIB simplifies and completes the one given by Haghighi (1986). 2000 Mathematics Subject Classification: 11R16, 11R21, 11R29. ..."
Abstract
 Add to MetaCart
Let K be a pure cubic field. Let L be the normal closure of K. A relative integral basis (RIB) for L over Q( √−3) is given. This RIB simplifies and completes the one given by Haghighi (1986). 2000 Mathematics Subject Classification: 11R16, 11R21, 11R29.
A Simplifier for Propositional Formulas with Many Binary Clauses
, 2001
"... Deciding whether a propositional formula in conjunctive normal form is satisfiable (SAT) is an NPcomplete problem. The problem becomes linear when the formula contains binary clauses only. Interestingly, the reduction to SAT of a number of wellknown and important problems  such as classical AI p ..."
Abstract

Cited by 59 (2 self)
 Add to MetaCart
planning and automatic test pattern generation for circuits  yields formulas containing many binary clauses. In this paper we introduce and experiment with 2SIMPLIFY, a formula simplifier targeted at such problems. 2SIMPLIFY constructs the transitive closure of the implication graph corresponding
Closure to “Simplified Design of Hydraulically Efficient PowerLaw Channels with Freeboard”
"... factor function should be minimized. Error is certainly associated with the first and the second is time consuming and complicates the solution process further. ..."
Abstract
 Add to MetaCart
factor function should be minimized. Error is certainly associated with the first and the second is time consuming and complicates the solution process further.
Normalization via Rewrite Closures
 Rewriting Techniques and Applications, 10th International Conference, RTA99, volume 1631 of LNCS
, 1999
"... We present an abstract completionbased method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on "nonoblivious" ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We present an abstract completionbased method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on "
Subspaces with equal closure
 Constr. Approx
"... Key words and phrases. Approximation, modules over polynomials and trigonometric functions in several variables, translation invariant subspaces, Bernstein problem, Lpspaces, multidimensional moment problems, multidimensional quasianalytic classes, quasianalytic weights, harmonic analysis, Lie gr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
groups. 1 2 Abstract. We develop a method to approach the problem of describing the closure in topological vector spaces in analysis on Rn of a module over the polynomials or over the span of the exponentials with imaginary spectral parameter. The method is not restricted to a particular type of space
Bistability Through Triadic Closure
, 2011
"... We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, online social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a v ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
very general framework where, conditioned on the current state, edges appear or disappear independently at the next timestep. We show how to exploit symmetries in the microscopic, localized rules in order to obtain conjugate classes of random graphs that simplify analysis and calibration of a model
SYMMETRIC STRUCTURE FOR CLOSURE ALGEBRAS
"... ABSTRACT. The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De Morgan operator. Some general properties are derived. Particularly, the lattice of subvarieties of the subvariety of monadic and linear symmetric algebras is desc ..."
Abstract
 Add to MetaCart
ABSTRACT. The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De Morgan operator. Some general properties are derived. Particularly, the lattice of subvarieties of the subvariety of monadic and linear symmetric algebras
Results 1  10
of
279