نتایج جستجو برای: spaced grid points ie

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

2005
BRIAN D. ANDERSON

This paper studies the generation of stable tmnsfer functions for which the real or imaginary part takes prescribed values at discrete uniformly spaced points on the unit circle. Formulas bounding the error between a parIicular interpolating function and any function consistent with the data are presented, which have the desirable property that the error goes to zero exponentially fast with the...

Journal: :Computer Physics Communications 2004
Michael Gutnic Matthieu Haefele I. Paun Eric Sonnendrücker

We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained through a multiresolution analysis which enables to keep or remove grid points from the simulation depending on the size of their associated coefficients in a multiresolution expansion. The adaptive algorithm consists in th...

2005
Julio E. Castrillón-Candás Chandrajit Bajaj Vinay Siddavanahalli

In this paper we introduce a grid free irregularly sampled Fourier approach for accurately predicting rigid body protein-protein docking sites. Of the many docking approaches, grid based Fast Fourier Transform (FFT) approaches have been shown to produce by far the fastest, correlation profiles of complex protein-protein interactions over the six dimensional search space. However, these uniform ...

Journal: :Stat 2022

Computing an ensemble of random fields using conditional simulation is ideal method for retrieving accurate estimates a field conditioned on available data and quantifying the uncertainty these realizations. Methods generating realizations, however, are computationally demanding, especially when numerous observed large domains. In this article, new, approximate approach applied that builds circ...

2004
Bin Fu Wei Wang

The protein folding problem in the HP-model is NP-hard in both 2D and 3D [4, 6]. The problem is to put a sequence, consisting of two characters H and P, on a d-dimensional grid to have the maximal number of HH contacts. We design a 2 1− 1 d log n) time algorithm for ddimensional protein folding in the HP-model. In particular, our algorithm has O(2 √ n log ) and O(2 2 3 log ) computational time ...

1998
M. Juntunen

The inverse problem formulation of the depth dose curve estimation is applied to sparse non-equally spaced measurement grid and the subsequent solution as well as the selection of measurement depths are discussed. The performance of the proposed estimation method is evaluated with real 6 MeV and 18 MeV photon data. These studies show that the proposed method allows the estimation of the depth d...

2012
Thomas J. Wills Caswell Barry Francesca Cacucci

Understanding the development of the neural circuits subserving specific cognitive functions such as navigation remains a central problem in neuroscience. Here, we characterize the development of grid cells in the medial entorhinal cortex, which, by nature of their regularly spaced firing fields, are thought to provide a distance metric to the hippocampal neural representation of space. Grid ce...

Journal: :Trends in cognitive sciences 2006
Kathryn J Jeffery Neil Burgess

A network of brain areas collectively represent location, but the underlying nature of this "cognitive map" has remained elusive. A recent study reports that the activity patterns of some entorhinal cortical neurons form a remarkably regular array of evenly spaced peaks across the surface of the environment. These "grid cells" might be the basis of a metric used for calculating position, and th...

1991
Guoxiang Gu Pramod P. Khargonekar

In this paper, the problem of \system identi cation in H 1 " is investigated in the case when the given frequency response data is not necessarily on a uniformly spaced grid of frequencies. A large class of robustly convergent identi cation algorithms are derived. A particular algorithm is further examined and explicit worst case error bounds (in the H 1 norm) are derived for both discrete-time...

2007
Patrick C Hew

This paper investigates a highly specialized example of character segmentation. The letters are at a particular font and size, arranged in a well-spaced 26 26 grid, and with each letter appearing once in each row and column. In such a case, we expect well-deened spikes in the projection prooles, and a naive technique for nding such spikes is presented. The overall objective is to see just how \...

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

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