2,508 research outputs found
Interactions of satellite-speed helium atoms with satellite surfaces. 3: Drag coefficients from spatial and energy distributions of reflected helium atoms
Spatial and energy distributions of helium atoms scattered from an anodized 1235-0 aluminum surface as well as the tangential and normal momentum accommodation coefficients calculated from these distributions are reported. A procedure for calculating drag coefficients from measured values of spatial and energy distributions is given. The drag coefficient calculated for a 6061 T-6 aluminum sphere is included
Information-Based Physics: An Observer-Centric Foundation
It is generally believed that physical laws, reflecting an inherent order in
the universe, are ordained by nature. However, in modern physics the observer
plays a central role raising questions about how an observer-centric physics
can result in laws apparently worthy of a universal nature-centric physics.
Over the last decade, we have found that the consistent apt quantification of
algebraic and order-theoretic structures results in calculi that possess
constraint equations taking the form of what are often considered to be
physical laws. I review recent derivations of the formal relations among
relevant variables central to special relativity, probability theory and
quantum mechanics in this context by considering a problem where two observers
form consistent descriptions of and make optimal inferences about a free
particle that simply influences them. I show that this approach to describing
such a particle based only on available information leads to the mathematics of
relativistic quantum mechanics as well as a description of a free particle that
reproduces many of the basic properties of a fermion. The result is an approach
to foundational physics where laws derive from both consistent descriptions and
optimal information-based inferences made by embedded observers.Comment: To be published in Contemporary Physics. The manuscript consists of
43 pages and 9 Figure
Binary Decision Diagrams: from Tree Compaction to Sampling
Any Boolean function corresponds with a complete full binary decision tree.
This tree can in turn be represented in a maximally compact form as a direct
acyclic graph where common subtrees are factored and shared, keeping only one
copy of each unique subtree. This yields the celebrated and widely used
structure called reduced ordered binary decision diagram (ROBDD). We propose to
revisit the classical compaction process to give a new way of enumerating
ROBDDs of a given size without considering fully expanded trees and the
compaction step. Our method also provides an unranking procedure for the set of
ROBDDs. As a by-product we get a random uniform and exhaustive sampler for
ROBDDs for a given number of variables and size
Boolean networks with reliable dynamics
We investigated the properties of Boolean networks that follow a given
reliable trajectory in state space. A reliable trajectory is defined as a
sequence of states which is independent of the order in which the nodes are
updated. We explored numerically the topology, the update functions, and the
state space structure of these networks, which we constructed using a minimum
number of links and the simplest update functions. We found that the clustering
coefficient is larger than in random networks, and that the probability
distribution of three-node motifs is similar to that found in gene regulation
networks. Among the update functions, only a subset of all possible functions
occur, and they can be classified according to their probability. More
homogeneous functions occur more often, leading to a dominance of canalyzing
functions. Finally, we studied the entire state space of the networks. We
observed that with increasing systems size, fixed points become more dominant,
moving the networks close to the frozen phase.Comment: 11 Pages, 15 figure
Knuthian Drawings of Series-Parallel Flowcharts
Inspired by a classic paper by Knuth, we revisit the problem of drawing
flowcharts of loop-free algorithms, that is, degree-three series-parallel
digraphs. Our drawing algorithms show that it is possible to produce Knuthian
drawings of degree-three series-parallel digraphs with good aspect ratios and
small numbers of edge bends.Comment: Full versio
Subventricular zone stem cells are heterogeneous with respect to their embryonic origins and neurogenic fates in the adult olfactory bulb
Wedetermined the embryonic origins of adult forebrain subventricular zone (SVZ) stem cells by Cre-lox fate mapping in transgenic mice. We found that all parts of the telencephalic neuroepithelium, including the medial ganglionic eminence and lateral ganglionic eminence (LGE) and the cerebral cortex, contribute multipotent, self-renewing stem cells to the adult SVZ. Descendants of the embryonic LGE and cortex settle in ventral and dorsal aspects of the dorsolateral SVZ, respectively. Both populations contribute new (5-bromo-2(')-deoxyuridine- labeled) tyrosine hydroxylase- and calretinin-positive interneurons to the adult olfactory bulb. However, calbindin-positive interneurons in the olfactory glomeruli were generated exclusively by LGE- derived stem cells. Thus, different SVZ stem cells have different embryonic origins, colonize different parts of the SVZ, and generate different neuronal progeny, suggesting that some aspects of embryonic patterning are preserved in the adult SVZ. This could have important implications for the design of endogenous stem cell-based therapies in the future
Greater Forearm Blood Flow is Associated With Higher Physical Activity in Older Individuals
Please refer to the pdf version of the abstract located adjacent to the title
Gossip on Weighted Networks
We investigate how suitable a weighted network is for gossip spreading. The
proposed model is based on the gossip spreading model introduced by Lind et.al.
on unweighted networks. Weight represents "friendship." Potential spreader
prefers not to spread if the victim of gossip is a "close friend". Gossip
spreading is related to the triangles and cascades of triangles. It gives more
insight about the structure of a network.
We analyze gossip spreading on real weighted networks of human interactions.
6 co-occurrence and 7 social pattern networks are investigated. Gossip
propagation is found to be a good parameter to distinguish co-occurrence and
social pattern networks. As a comparison some miscellaneous networks and
computer generated networks based on ER, BA, WS models are also investigated.
They are found to be quite different than the human interaction networks.Comment: 8 pages, 4 figures, 1 tabl
Map equation for link community
Community structure exists in many real-world networks and has been reported
being related to several functional properties of the networks. The
conventional approach was partitioning nodes into communities, while some
recent studies start partitioning links instead of nodes to find overlapping
communities of nodes efficiently. We extended the map equation method, which
was originally developed for node communities, to find link communities in
networks. This method is tested on various kinds of networks and compared with
the metadata of the networks, and the results show that our method can identify
the overlapping role of nodes effectively. The advantage of this method is that
the node community scheme and link community scheme can be compared
quantitatively by measuring the unknown information left in the networks
besides the community structure. It can be used to decide quantitatively
whether or not the link community scheme should be used instead of the node
community scheme. Furthermore, this method can be easily extended to the
directed and weighted networks since it is based on the random walk.Comment: 9 pages,5 figure
Self-avoiding walks crossing a square
We study a restricted class of self-avoiding walks (SAW) which start at the
origin (0, 0), end at , and are entirely contained in the square on the square lattice . The number of distinct
walks is known to grow as . We estimate as well as obtaining strict upper and lower bounds,
We give exact results for the number of SAW of
length for and asymptotic results for .
We also consider the model in which a weight or {\em fugacity} is
associated with each step of the walk. This gives rise to a canonical model of
a phase transition. For the average length of a SAW grows as ,
while for it grows as
. Here is the growth constant of unconstrained SAW in . For we provide numerical evidence, but no proof, that the
average walk length grows as .
We also consider Hamiltonian walks under the same restriction. They are known
to grow as on the same lattice. We give
precise estimates for as well as upper and lower bounds, and prove that
Comment: 27 pages, 9 figures. Paper updated and reorganised following
refereein
- âŠ