1,007 research outputs found
Universality in percolation of arbitrary Uncorrelated Nested Subgraphs
The study of percolation in so-called {\em nested subgraphs} implies a
generalization of the concept of percolation since the results are not linked
to specific graph process. Here the behavior of such graphs at criticallity is
studied for the case where the nesting operation is performed in an
uncorrelated way. Specifically, I provide an analyitic derivation for the
percolation inequality showing that the cluster size distribution under a
generalized process of uncorrelated nesting at criticality follows a power law
with universal exponent . The relevance of the result comes from
the wide variety of processes responsible for the emergence of the giant
component that fall within the category of nesting operations, whose outcome is
a family of nested subgraphs.Comment: 5 pages, no figures. Mistakes found in early manuscript have been
remove
Unes quantes demostracions de quĂmica espectaculars i Ăştils
A l'article es presenten experiències prĂ ctiques de quĂmica que he utilitzat a les meves classes com a professor de
secundĂ ria d'alumnes suĂŻssos de disset i divuit anys. Les reaccions i la manera de presentar-les a l'alumnat exposades
en aquest treball m'han demostrat que sĂłn Ăştils per a l'aprenentatge de la quĂmica i que motiven els alumnes.
Aquests havien de fer les reaccions, anotar les seves observacions i fer cĂ lculs de determinades quantitats. A l'article
es mostren també les respostes esperades de l'alumnat.Some spectacular and useful demonstrations of chemistry. In this article, practical chemistry experiences which I implemented in my upper-secondary classes in Switzerland
are presented. The chemical reactions described in this work and the way of presenting them to students, have
shown to be useful and help to motivate students to learn chemistry. Pupils had to make the reactions, take notes of
their observations and calculate some quantities. In this paper the studentsÂ’ expected answers are presented
Real-time software for mobile robot simulation and experimentation in cooperative environments
Trabajo presentado al 1st SIMPAR celebrado en Venecia del 3 al 6 de noviembre de 2008.This paper presents the software being developed at IRI (Institut de Robotica i Informatica Industrial) for mobile robot autonomous navigation in the context of the European project URUS (Ubiquitous Robots in Urban Settings). In order that a deployed sensor network and robots operating in the environment cooperate in terms of information sharing, main requirements are real-time performance and the integration of information coming from remote machines not onboard the robot. Moreover, the project involves a group of eleven industrial and academic partners, therefore software integration issues are critical. The proposed software framework is based on the YARP middleware and has been tested in real and simulated experiments.This work was supported by projects: 'Ubiquitous networking robotics in urban settings' (E-00938), 'CONSOLIDER-INGENIO 2010 Multimodal interaction in pattern recognition and computer vision' (V-00069), 'Robotica ubicua para entornos urbanos' (J-01225). Partially supported by Consolider Ingenio 2010, project CSD2007-00018,
CICYT project DPI2007-61452, and IST-045062 of the European Community Union.Peer Reviewe
Emergence of Zipf's Law in the Evolution of Communication
Zipf's law seems to be ubiquitous in human languages and appears to be a
universal property of complex communicating systems. Following the early
proposal made by Zipf concerning the presence of a tension between the efforts
of speaker and hearer in a communication system, we introduce evolution by
means of a variational approach to the problem based on Kullback's Minimum
Discrimination of Information Principle. Therefore, using a formalism fully
embedded in the framework of information theory, we demonstrate that Zipf's law
is the only expected outcome of an evolving, communicative system under a
rigorous definition of the communicative tension described by Zipf.Comment: 7 pages, 2 figure
Density and reproductive characteristics of female brown bears in the Cantabrian Mountains, NW Spain
Here we present annual nearest-neighbour distances (as a proxy of density) between females with cubs-of-the-year (hereafter FCOY) and reproductive characteristics of brown bears Ursus arctos in the Cantabrian Mountains (NW Spain), from 1989 to 2017. FCOY nearest-neighbour distances and reproduction parameters of 19 focal females followed over several consecutive years (from 2004 to 2017) were obtained from bears inhabiting the western sector of the Cantabrian Mountains, where most of the bear population resides. In contrast, general reproductive characteristics were studied in the whole Cantabrian Mountains (western and eastern sectors together) on a sample of 362 litter sizes and 695 cubs. Mean nearest-neighbour distance between FCOY was 2559 ± 1222 m (range = 1305–4757 m). Mean litter size was significantly larger in the west (1.8 ± 0.2 cubs) than in the east (1.3 ± 0.6 cubs). Mean litter size for the whole of the Cantabrian Mountains was 1.6 ± 0.3 cubs. Litter sizes of one, two and three cubs represented 33.4, 56.1 and 10.5% of observed family groups, respectively. Interannual variations in litter size were not significant for both the western and the eastern areas. Mean cub mortality was 0.2 ± 0.5 cubs and did not vary among years. Cub mortality per litter size was 3.9% for one cub, 69.2% for two cubs and 26.9% for three cubs. Mean reproductive rate of the 19 focal females was 1.5 ± 0.6 cubs (n = 58 litters). Litter size of focal FCOY did not differ from the litter size obtained from systematic observations in the whole Cantabrian Mountains. During this period, cub mortality occurred in 24.1% of the 58 litters. Females usually bred every second year (average litter interval = 2.2 years). The estimated reproductive rate for the bear population was 0.7 young born/year/reproductive adult female
Switcher-random-walks: a cognitive-inspired mechanism for network exploration
Semantic memory is the subsystem of human memory that stores knowledge of
concepts or meanings, as opposed to life specific experiences. The organization
of concepts within semantic memory can be understood as a semantic network,
where the concepts (nodes) are associated (linked) to others depending on
perceptions, similarities, etc. Lexical access is the complementary part of
this system and allows the retrieval of such organized knowledge. While
conceptual information is stored under certain underlying organization (and
thus gives rise to a specific topology), it is crucial to have an accurate
access to any of the information units, e.g. the concepts, for efficiently
retrieving semantic information for real-time needings. An example of an
information retrieval process occurs in verbal fluency tasks, and it is known
to involve two different mechanisms: -clustering-, or generating words within a
subcategory, and, when a subcategory is exhausted, -switching- to a new
subcategory. We extended this approach to random-walking on a network
(clustering) in combination to jumping (switching) to any node with certain
probability and derived its analytical expression based on Markov chains.
Results show that this dual mechanism contributes to optimize the exploration
of different network models in terms of the mean first passage time.
Additionally, this cognitive inspired dual mechanism opens a new framework to
better understand and evaluate exploration, propagation and transport phenomena
in other complex systems where switching-like phenomena are feasible.Comment: 9 pages, 3 figures. Accepted in "International Journal of
Bifurcations and Chaos": Special issue on "Modelling and Computation on
Complex Networks
- …