Phase Diagram Of The Biham-Middleton-Levine Traffic Model In Three Dimensions

We study numerically the behavior of the Biham-Middleton-Levine traffic model in three dimensions. Our extensive numerical simulations show that the phase diagram for this model in three dimensions is markedly different from that in one and two dimensions. In addition to the full speed moving as well as the completely jamming phases, whose respective average asymptotic car speeds $$ equal one and zero, we observe an extensive region of car densities $\rho$ with a low but non-zero average asymptotic car speed. The transition from this extensive low average asymptotic car speed region to the completely jamming region is at least second order. We argue that this low speed region is a result of the formation of a spatially-limited-extended percolating cluster. Thus, this low speed phase is present in $n > 3$ dimensional Biham-Middleton-Levine model as well.Comment: Minor clarifications, 1 figure adde

Parity Problem With A Cellular Automaton Solution

The parity of a bit string of length $N$ is a global quantity that can be efficiently compute using a global counter in ${O} (N)$ time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of $r=1$ binary, uniform, parallel and deterministic cellular automata applied in succession for a total of ${O} (N^2)$ time.Comment: Revtex, 4 pages, final version accepted by Phys.Rev.

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

Quantum Convolutional Error Correcting Codes

I report two general methods to construct quantum convolutional codes for $N$-state quantum systems. Using these general methods, I construct a quantum convolutional code of rate 1/4, which can correct one quantum error for every eight consecutive quantum registers.Comment: Minor revisions and clarifications. To appear in Phys. Rev.

Incorporating web analysis into neural networks: An example in hopfield net searching

Neural networks have been used in various applications on the World Wide Web, but most of them only rely on the available input-output examples without incorporating Web-specific knowledge, such as Web link analysis, into the network design. In this paper, we propose a new approach in which the Web is modeled as an asymmetric Hopfield Net. Each neuron in the network represents a Web page, and the connections between neurons represent the hyperlinks between Web pages. Web content analysis and Web link analysis are also incorporated into the model by adding a page content score function and a link score function into the weights of the neurons and the synapses, respectively. A simulation study was conducted to compare the proposed model with traditional Web search algorithms, namely, a breadth-first search and a best-first search using PageRank as the heuristic. The results showed that the proposed model performed more efficiently and effectively in searching for domain-specific Web pages. We believe that the model can also be useful in other Web applications such as Web page clustering and search result ranking. © 2007 IEEE.published_or_final_versio

Relation Between Quantum Speed Limits And Metrics On U(n)

Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] found a family of metrics and pseudo-metrics on $n$-dimensional unitary operators that can be interpreted as the minimum resources (given by certain tight quantum speed limit bounds) needed to transform one unitary operator to another. This result is closely related to the weighted $\ell^1$-norm on ${\mathbb R}^n$. Here we generalize this finding by showing that every weighted $\ell^p$-norm on ${\mathbb R}^n$ with 1\le p \le \limitingp induces a metric and a pseudo-metric on $n$-dimensional unitary operators with quantum information-theoretic meanings related to certain tight quantum speed limit bounds. Besides, we investigate how far the correspondence between the existence of metrics and pseudo-metrics of this type and the quantum speed limits can go.Comment: minor amendments, 6 pages, to appear in J.Phys.

Comparison of three vertical search spiders

The Web's dynamic,.unstructured nature makes locating resources difficult. Vertical search engines solve part of the problem by keeping indexes only in specific domains. They also offer more opportunity to apply domain knowledge in the spider applications that collect content for their databases. The authors used three approaches to investigate algorithms for improving the performance of vertical search engine spiders: a breadth-first graph-traversal algorithm with no heuristics to refine the search process, a best-first traversal algorithm that uses a hyperlink-analysis heuristic, and a spreading-activation algorithm based on modeling the Web as a neural network.published_or_final_versio

Finding The Sign Of A Function Value By Binary Cellular Automaton

Given a continuous function $f(x)$, suppose that the sign of $f$ only has finitely many discontinuous points in the interval $[0,1]$. We show how to use a sequence of one dimensional deterministic binary cellular automata to determine the sign of $f(\rho)$ where $\rho$ is the (number) density of 1s in an arbitrarily given bit string of finite length provided that $f$ satisfies certain technical conditions.Comment: Revtex, uses amsfonts, 10 page