Results 1 to 10 of about 50 (50)
Neuroscience of Consciousness, 2021 Abstract Neuroscience has made remarkable advances in accounting for how the brain performs its various functions. Consciousness, too, is usually approached in functional terms: the goal is to understand how the brain represents information, accesses that information, and acts on it.
Matteo Grasso +2 more
openaire +3 more sources
2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, 2011 The goal of the Grid Observatory project (GO) is to contribute to an experimental theory of large grid systems by integrating the collection of data on the behaviour of the flagship European Grid Infrastructure (EGI) and its users, the development of models, and an ontology for the domain knowledge.
Germain-Renaud C. +8 more
openaire +4 more sources
From the grid to the smart grid, topologically [PDF]
Physica A: Statistical Mechanics and its Applications, 2016 The Smart Grid is not just about the digitalization of the Power Grid. In its more visionary acceptation, it is a model of energy management in which the users are engaged in producing energy as well as consuming it, while having information systems fully aware of the energy demand-response of the network and of dynamically varying prices.
Giuliano Andrea Pagani, Marco Aiello
openaire +4 more sources
Scintillating Grid Illusion Without the Grid [PDF]
i-Perception, 2020 The scintillating grid illusion is a phenomenon where illusory black spots are perceived on white patches located at the intersections of a grid pattern. In this study, I report that the illusory spots as observed in the illusion are perceived with a stimulus pattern without grid bars.
openaire +3 more sources
A Core Grid Ontology for the Semantic Grid [PDF]
Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06), 2006 In this paper, we propose a Core Grid Ontology (CGO) that defines fundamental Grid-specific concepts, and the relationships between them. One of the key goals is to make this Core Grid Ontology general enough and easily extensible to be used by different Grid architectures or Grid middleware, so that the CGO can provide a common basis for representing ...
Wei, X. +5 more
openaire +3 more sources
Grid Minors in Damaged Grids [PDF]
The Electronic Journal of Combinatorics, 2014 We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds are tight to within constant factors.
openaire +3 more sources
Efficient embeddings of grids into grids
Discrete Applied Mathematics, 2001 AbstractIn this paper we explore one-to-one embeddings of two-dimensional grids into their ideal two-dimensional grids. The presented results are optimal or considerably close to the optimum. For embedding grids into grids of smaller aspect ratio, we prove a new lower bound on the dilation matching a known upper bound.
Ulf-Peter Schroeder, Markus Röttger
openaire +2 more sources
Journal of Regulatory Economics, 2018 Prosumers are households that are both producers and consumers of electricity. A prosumer has a grid-connected decentralized production unit and makes two types of exchanges with the grid: energy imports when the local production is insufficient to match the local consumption and energy exports when local production exceeds it. There exists two systems
Gautier, Axel +2 more
openaire +5 more sources
Weather and Forecasting, 2009 AbstractModel output statistics (MOS) guidance forecasts have been produced at stations and provided to National Weather Service forecasters and private entities for over three decades. As the numerical weather prediction models became more accurate, MOS followed that trend.
Glahn, Bob +4 more
openaire +3 more sources
Discrete Mathematics, 1993 AbstractWe construct a set of n points (i) on the unit sphere Sd-1 (d⩾4) so that they determine o(n) distinct distances and (ii) in the plane, in general position, so that they determine o(n1 + ϵ) distinct distances for any ϵ>0. We also prove that if P is a set of n points in a disk of radius n such that the minimum distance between them is 1, and |P ...
Erdõs, Paul +3 more
openaire +2 more sources