10,547 research outputs found

    Parity Problem With A Cellular Automaton Solution

    Get PDF
    The parity of a bit string of length NN is a global quantity that can be efficiently compute using a global counter in O(N){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=1r=1 binary, uniform, parallel and deterministic cellular automata applied in succession for a total of O(N2){O} (N^2) time.Comment: Revtex, 4 pages, final version accepted by Phys.Rev.

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

    Get PDF
    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>3n > 3 dimensional Biham-Middleton-Levine model as well.Comment: Minor clarifications, 1 figure adde

    Modulo Three Problem With A Cellular Automaton Solution

    Full text link
    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

    Applying Web analysis in Web page filtering

    Get PDF
    A machine-based learning approach that combines web content analysis and web structure analysis was proposed. The approach addressed the issue of filtering out irrelevant documents from a set of relevant documents collected from the web. It was found that the proposed approach is useful for vertical search engine development and other web applications. The results show that the approach can be used for web page filtering by effectively applying web content and link analysis.published_or_final_versio

    Two-Body Cabibbo-Suppressed Charmed Meson Decays

    Get PDF
    Singly-Cabibbo-suppressed decays of charmed particles governed by the quark subprocesses csusˉc \to s u \bar s and cdudˉc \to d u \bar d are analyzed using a flavor-topology approach, based on a previous analysis of the Cabibbo-favored decays governed by csudˉc \to s u \bar d. Decays to PPPP and PVPV, where PP is a pseudoscalar meson and VV is a vector meson, are considered. We include processes in which η\eta and η\eta ' are produced.Comment: 18 pages, latex, 2 figures, to be submitted to Phys. Rev.
    corecore