7,691 research outputs found
Real Estate Research in Asia - Past, Present and the Future
teh The growth in real estate research in Asia has been very significant over the past decade. Figure 1 shows the trend of the research papers on Asian real estate markets published in 17 real estate academic journals. A list of the journals surveyed is shown in Table 1. This number represents only a fraction of all the studies on the Asian real estate markets since books, research monographs, research reports, conference papers, and journal papers published in languages other than English are not included. Figure 2 shows the breakdown by markets.Asia, Real Estate
Inverse Avalanches On Abelian Sandpiles
A simple and computationally efficient way of finding inverse avalanches for
Abelian sandpiles, called the inverse particle addition operator, is presented.
In addition, the method is shown to be optimal in the sense that it requires
the minimum amount of computation among methods of the same kind. The method is
also conceptually nice because avalanche and inverse avalanche are placed in
the same footing.Comment: 5 pages with no figure IASSNS-HEP-94/7
An Adaptive Entanglement Distillation Scheme Using Quantum Low Density Parity Check Codes
Quantum low density parity check (QLDPC) codes are useful primitives for
quantum information processing because they can be encoded and decoded
efficiently. Besides, the error correcting capability of a few QLDPC codes
exceeds the quantum Gilbert-Varshamov bound. Here, we report a numerical
performance analysis of an adaptive entanglement distillation scheme using
QLDPC codes. In particular, we find that the expected yield of our adaptive
distillation scheme to combat depolarization errors exceed that of Leung and
Shor whenever the error probability is less than about 0.07 or greater than
about 0.28. This finding illustrates the effectiveness of using QLDPC codes in
entanglement distillation.Comment: 12 pages, 6 figure
How To Attain Maximum Profit In Minority Game?
What is the physical origin of player cooperation in minority game? And how
to obtain maximum global wealth in minority game? We answer the above questions
by studying a variant of minority game from which players choose among
alternatives according to strategies picked from a restricted set of strategy
space. Our numerical experiment concludes that player cooperation is the result
of a suitable size of sampling in the available strategy space. Hence, the
overall performance of the game can be improved by suitably adjusting the
strategy space size.Comment: 4 pages in revtex 4 styl
Minority Game With Peer Pressure
To study the interplay between global market choice and local peer pressure,
we construct a minority-game-like econophysical model. In this so-called
networked minority game model, every selfish player uses both the historical
minority choice of the population and the historical choice of one's neighbors
in an unbiased manner to make decision. Results of numerical simulation show
that the level of cooperation in the networked minority game differs remarkably
from the original minority game as well as the prediction of the
crowd-anticrowd theory. We argue that the deviation from the crowd-anticrowd
theory is due to the negligence of the effect of a four point correlation
function in the effective Hamiltonian of the system.Comment: 10 pages, 3 figures in revtex 4.
One Dimensional ary Density Classification Using Two Cellular Automaton Rules
Suppose each site on a one-dimensional chain with periodic boundary condition
may take on any one of the states , can you find out the most
frequently occurring state using cellular automaton? Here, we prove that while
the above density classification task cannot be resolved by a single cellular
automaton, this task can be performed efficiently by applying two cellular
automaton rules in succession.Comment: Revtex, 4 pages, uses amsfont
Modulo Three Problem With A Cellular Automaton Solution
An important global property of a bit string is the number of ones in it. It
has been found that the parity (odd or even) of this number can be found by a
sequence of deterministic, translational invariant cellular automata with
parallel update in succession for a total of O(N^2) time. In this paper, we
discover a way to check if this number is divisible by three using the same
kind of cellular automata in O(N^3) time. We also speculate that the method
described here could be generalized to check if it is divisible by four and
other positive integers.Comment: 10 pages in revtex 4.0, using amsfont
- …