نتایج جستجو برای: explicit practical finite analytic methods epfa

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

2001
Ted Ruffman Wendy Garnham Dan Connolly

Three-year-olds sometimes look to the correct location but give an incorrect verbal answer in a false belief task. We examined whether correct eye gaze among 3to 5-yearold children indexed unconscious knowledge or low confidence conscious knowledge. Children “bet” counters on where they thought a story character would go. If children were conscious of the knowledge conveyed by their eye gaze th...

2002
Jürgen Hausen

We provide a Hilbert-Mumford Criterion for the action of a reductive group G on a Q-factorial algebraic variety X, partially proving a conjecture stated by A. BiaÃlynicki-Birula. The result allows to construct G-invariant open subsets of X admitting a good quotient by G from certain open subsets admitting a good quotient by a maximal torus T of G. As an application, we indicate an explicit meth...

2013
Yannick Versley

Current approaches to recognizing discourse relations rely on a combination of shallow, surfacebased features (e.g., bigrams, word pairs), and rather specialized hand-crafted features. As a way to avoid both the shallowness of word-based representations and the lack of coverage of specialized linguistic features, we use a graph-based representation of discourse segments, which allows for a more...

Journal: :Comput. Graph. Forum 2003
Loïc Barthe Neil A. Dodgson Malcolm A. Sabin Brian Wyvill Véronique Gaildrat

Current methods for building models using implicit volume techniques present problems defining accurate and controllable blend shapes between implicit primitives. We present new methods to extend the freedom and controllability of implicit volume modeling. The main idea is to use a free-form curve to define the profile of the blend region between implicit primitives. The use of a free-form impl...

1998
Andrew W. P. Guy Mark Tigges

This paper discuss practical issues and implementation details on improving e ciency of ray intersection calculations of implicit surfaces using interval analysis. We examine two methods of improving the basic method described in [8]: a new technique for calculating intervals along a ray; and a method for spatial pruning based on the work in [7]. Comparisons are drawn between the di erent techn...

Journal: :Int. J. Computational Intelligence Systems 2014
Aida Jarraya Philippe Leray Afif Masmoudi

The Bayesian estimation of the conditional Gaussian parameter needs to define several a priori parameters. The proposed approach is free from this definition of priors. We use the Implicit estimation method for learning from observations without a prior knowledge. We illustrate the interest of such an estimation method by giving first the Bayesian Expectation A Posteriori estimator for conditio...

Journal: :Multiscale Modeling & Simulation 2005
Muruhan Rathinam Linda R. Petzold Yang Cao Daniel T. Gillespie

We develop a theory of local errors for the explicit and implicit tau-leaping methods for simulating stochastic chemical systems, and we prove that these methods are first-order consistent. Our theory provides local error formulae that could serve as the basis for future stepsize control techniques. We prove that, for the special case of systems with linear propensity functions, both tau-leapin...

Journal: :Symmetry 2017
Yalan Zhang Xiaojuan Ban Xiaokun Wang Xing Liu

In this paper, a symmetry particle method, the smoothed particle hydrodynamics (SPHs) method, is extended to deal with non-Newtonian fluids. First, the viscous liquid is modeled by a non-Newtonian fluid flow and the variable viscosity under shear stress is determined by the Carreau-Yasuda model. Then a pressure correction method is proposed, by correcting density error with individual stiffness...

2017
Victor Palamodov

An explicit method is described for reconstruction of the complex refractive index by the method of contrast transfer function

2004
Tanja Lange Marc Stevens

In most algorithms involving elliptic and hyperelliptic curves, the costliest part consists in computing multiples of ideal classes. This paper investigates how to compute faster doubling over fields of characteristic two. We derive explicit doubling formulae making strong use of the defining equation of the curve. We analyze how many field operations are needed depending on the curve making cl...

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

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