13,670 research outputs found

    Designing a Self-reversing Track Layout with TrackMaster Tracks

    Get PDF
    This research project sought to find general track formations that allowed battery operated locomotives to traverse the entire train track in both directions infinitely. These formations allowed for any number of track pieces from TrackMaster Thomas and Friends sets by Fisher Price. The research looked at start position of the train and presetting of the switches as well as what is necessary to have a complete track with no dead ends. Surprisingly, there was found to be only one track formation that allowed for entire traversal of the track in both directions. This layout was termed a dog bone and consisted of two switch pieces connected at the ends with the tips of both switches connecting to themselves on the same switch. A proof that this layout is the only layout that satisfies the conditions is given

    What is a composite citation? An introduction

    Get PDF
    No abstract available

    Prospects for computational steering of evolutionary computation

    Get PDF
    Currently, evolutionary computation (EC) typically takes place in batch mode: algorithms are run autonomously, with the user providing little or no intervention or guidance. Although it is rarely possible to specify in advance, on the basis of EC theory, the optimal evolutionary algorithm for a particular problem, it seems likely that experienced EC practitioners possess considerable tacit knowledge of how evolutionary algorithms work. In situations such as this, computational steering (ongoing, informed user intervention in the execution of an otherwise autonomous computational process) has been profitably exploited to improve performance and generate insights into computational processes. In this short paper, prospects for the computational steering of evolutionary computation are assessed, and a prototype example of computational steering applied to a coevolutionary algorithm is presented

    Robust quantum data locking from phase modulation

    Get PDF
    Quantum data locking is a unique quantum phenomenon that allows a relatively short key to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the encrypted message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the shared key by a proportionate amount. This implies that a constant size key can still encrypt an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random codewords, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.Comment: A new result on the robustness of quantum data locking has been adde
    • ā€¦
    corecore