521 research outputs found

    How Many Cooks Spoil the Soup?

    Get PDF
    In this work, we study the following basic question: "How much parallelism does a distributed task permit?" Our definition of parallelism (or symmetry) here is not in terms of speed, but in terms of identical roles that processes have at the same time in the execution. We initiate this study in population protocols, a very simple model that not only allows for a straightforward definition of what a role is, but also encloses the challenge of isolating the properties that are due to the protocol from those that are due to the adversary scheduler, who controls the interactions between the processes. We (i) give a partial characterization of the set of predicates on input assignments that can be stably computed with maximum symmetry, i.e., Θ(Nmin)\Theta(N_{min}), where NminN_{min} is the minimum multiplicity of a state in the initial configuration, and (ii) we turn our attention to the remaining predicates and prove a strong impossibility result for the parity predicate: the inherent symmetry of any protocol that stably computes it is upper bounded by a constant that depends on the size of the protocol.Comment: 19 page

    Cellular Automata Applications in Shortest Path Problem

    Full text link
    Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

    On the Exploitation of a High-throughput SHA-256 FPGA Design for HMAC

    Get PDF
    High-throughput and area-efficient designs of hash functions and corresponding mechanisms for Message Authentication Codes (MACs) are in high demand due to new security protocols that have arisen and call for security services in every transmitted data packet. For instance, IPv6 incorporates the IPSec protocol for secure data transmission. However, the IPSec's performance bottleneck is the HMAC mechanism which is responsible for authenticating the transmitted data. HMAC's performance bottleneck in its turn is the underlying hash function. In this article a high-throughput and small-size SHA-256 hash function FPGA design and the corresponding HMAC FPGA design is presented. Advanced optimization techniques have been deployed leading to a SHA-256 hashing core which performs more than 30% better, compared to the next better design. This improvement is achieved both in terms of throughput as well as in terms of throughput/area cost factor. It is the first reported SHA-256 hashing core that exceeds 11Gbps (after place and route in Xilinx Virtex 6 board)

    Real-Time Wildfire Monitoring Using Scientific Database and Linked Data Technologies

    Get PDF
    We present a real-time wildfire monitoring service that exploits satellite images and linked geospatial data to detect hotspots and monitor the evolution of fire fronts. The service makes heavy use of scientific database technologies (array databases, SciQL, data vaults) and linked data technologies (ontologies, linked geospatial data, stSPARQL) and is implemented on top of MonetDB and Strabon. The service is now operational at the National Observatory of Athens and has been used during the previous summer by emergency managers monitoring wildfires in Greece

    Observation of Hadronic W Decays in t-tbar Events with the Collider Detector at Fermilab

    Full text link
    We observe hadronic W decays in t-tbar -> W (-> l nu) + >= 4 jet events using a 109 pb-1 data sample of p-pbar collisions at sqrt{s} = 1.8 TeV collected with the Collider Detector at Fermilab (CDF). A peak in the dijet invariant mass distribution is obtained that is consistent with W decay and inconsistent with the background prediction by 3.3 standard deviations. From this peak we measure the W mass to be 77.2 +- 4.6 (stat+syst) GeV/c^2. This result demonstrates the presence of two W bosons in t-tbar candidates in the W (-> l nu) + >= 4 jet channel.Comment: 20 pages, 4 figures, submitted to PR

    Measurement of the lepton charge asymmetry in W-boson decays produced in p-pbar collisions

    Full text link
    We describe a measurement of the charge asymmetry of leptons from W boson decays in the rapidity range 0 enu, munu events from 110+/-7 pb^{-1}of data collected by the CDF detector during 1992-95. The asymmetry data constrain the ratio of d and u quark momentum distributions in the proton over the x range of 0.006 to 0.34 at Q2 \approx M_W^2. The asymmetry predictions that use parton distribution functions obtained from previously published CDF data in the central rapidity region (0.0<|y_l|<1.1) do not agree with the new data in the large rapidity region (|y_l|>1.1).Comment: 13 pages, 3 tables, 1 figur

    Inclusive jet cross section in pˉp{\bar p p} collisions at s=1.8\sqrt{s}=1.8 TeV

    Full text link
    The inclusive jet differential cross section has been measured for jet transverse energies, ETE_T, from 15 to 440 GeV, in the pseudorapidity region 0.1η\leq | \eta| \leq 0.7. The results are based on 19.5 pb1^{-1} of data collected by the CDF collaboration at the Fermilab Tevatron collider. The data are compared with QCD predictions for various sets of parton distribution functions. The cross section for jets with ET>200E_T>200 GeV is significantly higher than current predictions based on O(αs3\alpha_s^3) perturbative QCD calculations. Various possible explanations for the high-ETE_T excess are discussed.Comment: 8 pages with 2 eps uu-encoded figures Submitted to Physical Review Letter

    Measurement of the Associated γ+μ±\gamma + \mu^\pm Production Cross Section in ppˉp \bar p Collisions at s=1.8\sqrt{s} = 1.8 TeV

    Full text link
    We present the first measurement of associated direct photon + muon production in hadronic collisions, from a sample of 1.8 TeV ppˉp \bar p collisions recorded with the Collider Detector at Fermilab. Quantum chromodynamics (QCD) predicts that these events are primarily from the Compton scattering process cgcγcg \to c\gamma, with the final state charm quark producing a muon. Hence this measurement is sensitive to the charm quark content of the proton. The measured cross section of 29±9pb129\pm 9 pb^{-1} is compared to a leading-order QCD parton shower model as well as a next-to-leading-order QCD calculation.Comment: 12 pages, 4 figures Added more detailed description of muon background estimat

    Search for charged Higgs decays of the top quark using hadronic tau decays

    Full text link
    We present the result of a search for charged Higgs decays of the top quark, produced in ppˉp\bar{p} collisions at s=\surd s = 1.8 TeV. When the charged Higgs is heavy and decays to a tau lepton, which subsequently decays hadronically, the resulting events have a unique signature: large missing transverse energy and the low-charged-multiplicity tau. Data collected in the period 1992-1993 at the Collider Detector at Fermilab, corresponding to 18.7±\pm0.7~pb1^{-1}, exclude new regions of combined top quark and charged Higgs mass, in extensions to the standard model with two Higgs doublets.Comment: uuencoded, gzipped tar file of LaTeX and 6 Postscript figures; 11 pp; submitted to Phys. Rev.

    Measurement of the top quark mass and top-antitop production cross section from dilepton events at the Collider Detector at Fermilab

    Full text link
    We present an analysis of dilepton events originating from top-antitop production in proton-antiproton collisions at sqrt{s}=1.8 TeV at the Fermilab Tevatron Collider. The sample corresponds to an integrated luminosity of 109+-7 pb^{-1}. We observe 9 candidate events, with an estimated background of 2.4+-0.5 events. We determine the mass of the top quark to be M_top = 161+-17(stat.)+-10(syst.) GeV/c^2. In addition we measure a top-antitop production cross section of 8.2+4.4-3.4 pb (where M_top = 175 GeV/c^2 has been assumed for the acceptance estimate).Comment: 6 pages of text, 3 figure
    corecore