A Drift-Diffusion Model of Interval Timing in the Peak Procedure

Drift-diffusion models (DDMs) are a popular framework for explaining response times in decision-making tasks. Recently, the DDM architecture has been used to model interval timing. The Time-adaptive DDM (TDDM) is a physiologically plausible mechanism that adapts in real-time to different time intervals while preserving timescale invariance. One key open question is how the TDDM could deal with situations where reward is omitted, as in the peak procedure—a benchmark in the timing literature. When reward is omitted, there is a consistent pattern of correlations between the times at which animals start and stop responding. Here we develop a formulation of the TDDM’s stationary properties that allows for the derivation of such correlations analytically. Using this simplified formulation we show that a TDDM with two thresholds–one to mark the start of responding and another the stop–can reproduce the same pattern of correlations observed in the data, as long as the start threshold is allowed to be noisy. We confirm this by running simulations with the standard TDDM formulation and show that the simplified formulation approximates well the full model under steady-state conditions. Moreover, we show that this simplified version of the TDDM is formally equivalent to Scalar Expectancy Theory (SET) under stationary behaviours, the most prominent theory of interval timing. This equivalence establishes the TDDM as a more complete drift-diffusion based theory with SET as a special case under steady-state conditions

Security by Spatial Reference:Using Relative Positioning to Authenticate Devices for Spontaneous Interaction

Spontaneous interaction is a desirable characteristic associated with mobile and ubiquitous computing. The aim is to enable users to connect their personal devices with devices encountered in their environment in order to take advantage of interaction opportunities in accordance with their situation. However, it is difficult to secure spontaneous interaction as this requires authentication of the encountered device, in the absence of any prior knowledge of the device. In this paper we present a method for establishing and securing spontaneous interactions on the basis of emphspatial references that capture the spatial relationship of the involved devices. Spatial references are obtained by accurate sensing of relative device positions, presented to the user for initiation of interactions, and used in a peer authentication protocol that exploits a novel mechanism for message transfer over ultrasound to ensures spatial authenticity of the sender

Unconditionally verifiable blind computation

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed a universal and unconditionally secure BQC scheme where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. In this paper we extend that protocol with new functionality allowing blind computational basis measurements, which we use to construct a new verifiable BQC protocol based on a new class of resource states. We rigorously prove that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter. The new resource state allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead. This is a significant improvement on the original scheme, which required that all computations to be performed must first be put into a nearest neighbour form, incurring linear overhead in the number of qubits. Such an improvement has important consequences for efficiency and fault-tolerance thresholds.Comment: 46 pages, 10 figures. Additional protocol added which allows arbitrary circuits to be verified with polynomial securit

Complexity transitions in global algorithms for sparse linear systems over finite fields

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify phase transitions in the structure of the solution space and to connect them to changes in performance of a global algorithm, namely Gaussian elimination. Crossing phase boundaries produces a dramatic increase in memory and CPU requirements necessary to the algorithms. In turn, this causes the saturation of the upper bounds for the running time. We illustrate the results on the specific problem of integer factorization, which is of central interest for deciphering messages encrypted with the RSA cryptosystem.Comment: 23 pages, 8 figure

Allelopathy And Weed Competition

Currently, only two herbicides, Londax® (bensulfuron) and Taipan® (benzofenap) are available for the effective control of all four major broadleaf weeds infesting NSW rice paddocks. Prolonged and widespread use of these two herbicides in the rice growing regions increases the threat of herbicide resistance. The low likelihood of new herbicides in the foreseeable future increases the impact of herbicide resistance on the Australian rice industry. Allelopathy, chemical interactions between plants, is an alternative control option. Weeds could be controlled by using crops which have been developed to exert their own weed control by releasing chemicals into the soil. These naturally occurring compounds could play a valuable role in an integrated weed management system, potentially reducing the amount of synthetic herbicides required for weed control. In rice, the potential use of allelopathy in weed control has been explored by several researchers worldwide. Funding for work on allelopathic potential was provided by the Rice CRC as they recognised that the Australian weed community is very different and many of the weeds infesting rice paddocks are typically Australian problems not likely to be tackled by international research groups. Twenty-seven rice cultivars were examined in the laboratory for their allelopathic potential against several currently important and potentially important rice weeds in Australia, namely barnyard grass (Echinochloa crus-galli), dirty dora (Cyperus difformis), lance-leaved water plantain (Alisma lanceolatum), starfruit (Damasonium minus), arrowhead (Sagittaria montevidensis) and S. graminea. Weed root growth inhibition ranged from 0.3 % to 93.6 % of the control depending on the cultivar and the weed species being tested. One weed was actually stimulated by Langi. Several rice varieties significantly inhibited root growth of more than one weed. A field trial using starfruit as the test species was conducted to see if those cultivars which inhibited starfruit in the laboratory experiment also inhibited starfruit in the field and to determine whether allelopathy was an important factor in the resulting field performance. Twenty-four cultivars were used in a field trial based at the Yanco Agricultural Institute. Starfruit dry matter was measured as an indicator of weed inhibition. It was found that there was a correlation between laboratory and field results, and that allelopathy was an important contributor to field performance of a rice variety

The invertibility of the XOR of rotations of a binary word

We prove the following result regarding operations on a binary word whose length is a power of two: computing the exclusive-or of a number of rotated versions of the word is an invertible (one-to-one) operation if and only if the number of versions combined is odd. (This result is not new; there is at least one earlier proof, due to Thomsen [Cryptographic hash functions, PhD thesis, Technical University of Denmark, 28 November 2008]. Our proof may be new.

Quantum asymmetric cryptography with symmetric keys

Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use symmetric keys in such a scheme, which is quite different from that in conventional public-key cryptography. The security of our scheme is analyzed and some features are discussed. Furthermore, the state-estimation attack to a prior QPKC scheme is demonstrated.Comment: 8 pages, 1 figure, Revtex

Data Mining Approaches to Diffuse Large B–Cell Lymphoma Gene Expression Data Interpretation

This paper presents a comprehensive study of gene expression patterns originating from a diffuse large B–cell lymphoma (DLBCL) database. It focuses on the implementation of feature selection and classification techniques. Thus, it firstly tackles the identification of relevant genes for the prediction of DLBCL types. It also allows the determination of key biomarkers to differentiate two subtypes of DLBCL samples: Activated B–Like and Germinal Centre B–Like DLBCL. Decision trees provide knowledge–based models to predict types and subtypes of DLBCL. This research suggests that the data may be insufficient to accurately predict DLBCL types or even detect functionally relevant genes. However, these methods represent reliable and understandable tools to start thinking about possible interesting non–linear interdependencies

Public Evidence from Secret Ballots

Elections seem simple---aren't they just counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results are correct; and the secrecy of the ballot must be ensured. And they have practical constraints: time is of the essence, and voting systems need to be affordable and maintainable, and usable by voters, election officials, and pollworkers. It is thus not surprising that voting is a rich research area spanning theory, applied cryptography, practical systems analysis, usable security, and statistics. Election integrity involves two key concepts: convincing evidence that outcomes are correct and privacy, which amounts to convincing assurance that there is no evidence about how any given person voted. These are obviously in tension. We examine how current systems walk this tightrope.Comment: To appear in E-Vote-Id '1