1,033,557 research outputs found
What grid cells convey about rat location
We characterize the relationship between the simultaneously recorded quantities of rodent grid cell firing and the position of the rat. The formalization reveals various properties of grid cell activity when considered as a neural code for representing and updating estimates of the rat's location. We show that, although the spatially periodic response of grid cells appears wasteful, the code is fully combinatorial in capacity. The resulting range for unambiguous position representation is vastly greater than the ≈1–10 m periods of individual lattices, allowing for unique high-resolution position specification over the behavioral foraging ranges of rats, with excess capacity that could be used for error correction. Next, we show that the merits of the grid cell code for position representation extend well beyond capacity and include arithmetic properties that facilitate position updating. We conclude by considering the numerous implications, for downstream readouts and experimental tests, of the properties of the grid cell code
Grid generation about complex three-dimensional aircraft configurations
The problem of obtaining three dimensional grids with sufficient resolution to resolve all the flow or other physical features of interest is addressed. The generation of a computational grid involves a series of compromises to resolve several conflicting requirements. On one hand, one would like the grid to be fine enough and not too skewed to reduce the numerical errors and to adequately resolve the pertinent physical features of the flow field about the aircraft. On the other hand, the capabilities of present or even future supercomputers are finite and the number of mesh points must be limited to a reasonable number: one which is usually much less than desired for numerical accuracy. One technique to overcome this limitation is the 'zonal' grid approach. In this method, the overall field is subdivided into smaller zones or blocks in each of which an independent grid is generated with enough grid density to resolve the flow features in that zone. The zonal boundaries or interfaces require special boundary conditions such that the conservation properties of the governing equations are observed. Much work was done in 3-D zonal approaches with nonconservative zonal interfaces. A 3-D zonal conservative interfacing method that is efficient and easy to implement was developed during the past year. During the course of the work, it became apparent that it would be much more feasible to do the conservative interfacing with cell-centered finite volume codes instead of the originally planned finite difference codes. Accordingly, the CNS code was converted to finite volume form. This new version of the code is named CNSFV. The original multi-zonal interfacing capability of the CNS code was enhanced by generalizing the procedure to allow for completely arbitrarily shaped zones with no mesh continuity between the zones. While this zoning capability works well for most flow situations, it is, however, still nonconservative. The conservative interface algorithm was also implemented but was not completely validated
Proxy dynamic delegation in grid gateway
Nowadays one of the main obstacles the research comes up against is the
difficulty in accessing the required computational resources. Grid is able to
offer the user a wide set of resources, even if they are often too hard to
exploit for non expert end user. Use simplification has today become a common
practice in the access and utilization of Cloud, Grid, and data center
resources. With the launch of L-GRID gateway, we introduced a new way to deal
with Grid portals. L-GRID is an extremely light portal developed in order to
access the EGI Grid infrastructure via Web, allowing users to submit their jobs
from whatever Web browser in a few minutes, without any knowledge about the
underlying Grid infrastructure.Comment: 6 page
Recommended from our members
2×2 monotone grid classes are finitely based
In this note, we prove that all 2×2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2×2 (generalized) grid classes having two monotone cells in the same row
Introducing risk management into the grid
Service Level Agreements (SLAs) are explicit statements about all expectations and obligations in the business partnership between customers and providers. They have been introduced in Grid computing to overcome the best effort approach, making the Grid more interesting for commercial applications. However, decisions on negotiation and system management still rely on static approaches, not reflecting the risk linked with decisions. The EC-funded project "AssessGrid" aims at introducing risk assessment and management as a novel decision paradigm into Grid computing. This paper gives a general motivation for risk management and presents the envisaged architecture of a "risk-aware" Grid middleware and Grid fabric, highlighting its functionality by means of three showcase scenarios
A Technical Report On Grid Benchmarking using ATLAS V.O
Grids include heterogeneous resources, which are based on different hardware
and software architectures or components. In correspondence with this diversity
of the infrastructure, the execution time of any single job, as well as the
total grid performance can both be affected substantially, which can be
demonstrated by measurements. Running a simple benchmarking suite can show this
heterogeneity and give us results about the differences over the grid sites.Comment: 29 pages, 35 figures, including charts and results of benchmarking
over the grid, ATLAS V.
- …