2,437 research outputs found
Regulation of Liver Tyrosine Aminotransferase by Endogenous Factors in the Mouse
The levels of mouse liver tyrosine aminotransferase (TAT) are shown to increase rapidly and transiently during and after various challenges (e.g., exposure to cold or shaking) to the homeostatic machinery of the fasted mouse. The increase of TAT is dependent on gene activity. Recent feeding and adrenalectomy are shown to inhibit the induction of TAT during the challenge of cold
Strategy updating rules and strategy distributions in dynamical multiagent systems
In the evolutionary version of the minority game, agents update their
strategies (gene-value ) in order to improve their performance. Motivated by
recent intriguing results obtained for prize-to-fine ratios which are smaller
than unity, we explore the system's dynamics with a strategy updating rule of
the form (). We find that the strategy
distribution depends strongly on the values of the prize-to-fine ratio , the
length scale , and the type of boundary condition used. We show that
these parameters determine the amplitude and frequency of the the temporal
oscillations observed in the gene space. These regular oscillations are shown
to be the main factor which determines the strategy distribution of the
population. In addition, we find that agents characterized by
(a coin-tossing strategy) have the best chances of survival at asymptotically
long times, regardless of the value of and the boundary conditions
used.Comment: 4 pages, 7 figure
Quantum Portfolios
Quantum computation holds promise for the solution of many intractable
problems. However, since many quantum algorithms are stochastic in nature they
can only find the solution of hard problems probabilistically. Thus the
efficiency of the algorithms has to be characterized both by the expected time
to completion {\it and} the associated variance. In order to minimize both the
running time and its uncertainty, we show that portfolios of quantum algorithms
analogous to those of finance can outperform single algorithms when applied to
the NP-complete problems such as 3-SAT.Comment: revision includes additional data and corrects minor typo
Characterizing the structure of small-world networks
We give exact relations which are valid for small-world networks (SWN's) with
a general `degree distribution', i.e the distribution of nearest-neighbor
connections. For the original SWN model, we illustrate how these exact
relations can be used to obtain approximations for the corresponding basic
probability distribution. In the limit of large system sizes and small
disorder, we use numerical studies to obtain a functional fit for this
distribution. Finally, we obtain the scaling properties for the mean-square
displacement of a random walker, which are determined by the scaling behavior
of the underlying SWN
Proteus: A Hierarchical Portfolio of Solvers and Transformations
In recent years, portfolio approaches to solving SAT problems and CSPs have
become increasingly common. There are also a number of different encodings for
representing CSPs as SAT instances. In this paper, we leverage advances in both
SAT and CSP solving to present a novel hierarchical portfolio-based approach to
CSP solving, which we call Proteus, that does not rely purely on CSP solvers.
Instead, it may decide that it is best to encode a CSP problem instance into
SAT, selecting an appropriate encoding and a corresponding SAT solver. Our
experimental evaluation used an instance of Proteus that involved four CSP
solvers, three SAT encodings, and six SAT solvers, evaluated on the most
challenging problem instances from the CSP solver competitions, involving
global and intensional constraints. We show that significant performance
improvements can be achieved by Proteus obtained by exploiting alternative
view-points and solvers for combinatorial problem-solving.Comment: 11th International Conference on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems. The final
publication is available at link.springer.co
Nonlinear Dynamics in Distributed Systems
We build on a previous statistical model for distributed systems and
formulate it in a way that the deterministic and stochastic processes within
the system are clearly separable. We show how internal fluctuations can be
analysed in a systematic way using Van Kanpen's expansion method for Markov
processes. We present some results for both stationary and time-dependent
states. Our approach allows the effect of fluctuations to be explored,
particularly in finite systems where such processes assume increasing
importance.Comment: Two parts: 8 pages LaTeX file and 5 (uuencoded) figures in Postscript
forma
Intermittent exploration on a scale-free network
We study an intermittent random walk on a random network of scale-free degree
distribution. The walk is a combination of simple random walks of duration
and random long-range jumps. While the time the walker needs to cover all
the nodes increases with , the corresponding time for the edges displays a
non monotonic behavior with a minimum for some nontrivial value of . This
is a heterogeneity-induced effect that is not observed in homogeneous
small-world networks. The optimal increases with the degree of
assortativity in the network. Depending on the nature of degree correlations
and the elapsed time the walker finds an over/under-estimate of the degree
distribution exponent.Comment: 12 pages, 3 figures, 1 table, published versio
Spatial prisoner's dilemma game with volunteering in Newman-Watts small-world networks
A modified spatial prisoner's dilemma game with voluntary participation in
Newman-Watts small-world networks is studied. Some reasonable ingredients are
introduced to the game evolutionary dynamics: each agent in the network is a
pure strategist and can only take one of three strategies (\emph {cooperator},
\emph {defector}, and \emph {loner}); its strategical transformation is
associated with both the number of strategical states and the magnitude of
average profits, which are adopted and acquired by its coplayers in the
previous round of play; a stochastic strategy mutation is applied when it gets
into the trouble of \emph {local commons} that the agent and its neighbors are
in the same state and get the same average payoffs. In the case of very low
temptation to defect, it is found that agents are willing to participate in the
game in typical small-world region and intensive collective oscillations arise
in more random region.Comment: 4 pages, 5 figure
Invalidity of Classes of Approximated Hall Effect Calculations
In this comment, I point out a number of approximated derivations for the
effective equation of motion, now been applied to d-wave superconductors by
Kopnin and Volovik are invalid. The major error in those approximated
derivations is the inappropriate use of the relaxation time approximation in
force-force correlation functions, or in force balance equations, or in similar
variations. This approximation is wrong and unnecessary.Comment: final version, minor changes, to appear in Phys. Rev. Let
- …