7,897 research outputs found
Quantum density anomaly in optically trapped ultracold gases
We show that the Bose-Hubbard Model exhibits an increase in density with
temperature at fixed pressure in the regular fluid regime and in the superfluid
phase. The anomaly at the Bose-Einstein condensate is the first density anomaly
observed in a quantum state. We propose that the mechanism underlying both the
normal phase and the superfluid phase anomalies is related to zero point
entropies and ground state phase transitions. A connection with the typical
experimental scales and setups is also addressed. This key finding opens a new
pathway for theoretical and experimental studies of water-like anomalies in the
area of ultracold quantum gases
Local heuristics and the emergence of spanning subgraphs in complex networks
We study the use of local heuristics to determine spanning subgraphs for use
in the dissemination of information in complex networks. We introduce two
different heuristics and analyze their behavior in giving rise to spanning
subgraphs that perform well in terms of allowing every node of the network to
be reached, of requiring relatively few messages and small node bandwidth for
information dissemination, and also of stretching paths with respect to the
underlying network only modestly. We contribute a detailed mathematical
analysis of one of the heuristics and provide extensive simulation results on
random graphs for both of them. These results indicate that, within certain
limits, spanning subgraphs are indeed expected to emerge that perform well in
respect to all requirements. We also discuss the spanning subgraphs' inherent
resilience to failures and adaptability to topological changes
Probabilistic heuristics for disseminating information in networks
We study the problem of disseminating a piece of information through all the
nodes of a network, given that it is known originally only to a single node. In
the absence of any structural knowledge on the network other than the nodes'
neighborhoods, this problem is traditionally solved by flooding all the
network's edges. We analyze a recently introduced probabilistic algorithm for
flooding and give an alternative probabilistic heuristic that can lead to some
cost-effective improvements, like better trade-offs between the message and
time complexities involved. We analyze the two algorithms both mathematically
and by means of simulations, always within a random-graph framework and
considering relevant node-degree distributions
Two novel evolutionary formulations of the graph coloring problem
We introduce two novel evolutionary formulations of the problem of coloring
the nodes of a graph. The first formulation is based on the relationship that
exists between a graph's chromatic number and its acyclic orientations. It
views such orientations as individuals and evolves them with the aid of
evolutionary operators that are very heavily based on the structure of the
graph and its acyclic orientations. The second formulation, unlike the first
one, does not tackle one graph at a time, but rather aims at evolving a
`program' to color all graphs belonging to a class whose members all have the
same number of nodes and other common attributes. The heuristics that result
from these formulations have been tested on some of the Second DIMACS
Implementation Challenge benchmark graphs, and have been found to be
competitive when compared to the several other heuristics that have also been
tested on those graphs.Comment: To appear in Journal of Combinatorial Optimizatio
Two-dimensional cellular automata and the analysis of correlated time series
Correlated time series are time series that, by virtue of the underlying
process to which they refer, are expected to influence each other strongly. We
introduce a novel approach to handle such time series, one that models their
interaction as a two-dimensional cellular automaton and therefore allows them
to be treated as a single entity. We apply our approach to the problems of
filling gaps and predicting values in rainfall time series. Computational
results show that the new approach compares favorably to Kalman smoothing and
filtering
Avaliação dos impactos econômicos, sociais e ambientais de tecnologias da Embrapa Pecuária Sudeste. 1. Utilização de touros da raça Canchim em cruzamento terminal com fêmeas da raça Nelore.
bitstream/CPPSE/16765/1/documentos-54.pd
Bouncing solutions in Rastall's theory with a barotropic fluid
Rastall's theory is a modification of Einstein's theory of gravity where the
covariant divergence of the stress-energy tensor is no more vanishing, but
proportional to the gradient of the Ricci scalar. The motivation of this theory
is to investigate a possible non-minimal coupling of the matter fields to
geometry which, being proportional to the curvature scalar, may represent an
effective description of quantum gravity effects. Non-conservation of the
stress-energy tensor, via Bianchi identities, implies new field equations which
have been recently used in a cosmological context, leading to some interesting
results. In this paper we adopt Rastall's theory to reproduce some features of
the effective Friedmann's equation emerging from loop quantum cosmology. We
determine a class of bouncing cosmological solutions and comment about the
possibility of employing these models as effective descriptions of the full
quantum theory.Comment: Latex file, 14 pages, 1 figure in eps format. Typos corrected, one
reference added. Published versio
- …