2 resultados para Batch Proof, Verification of Re-encryption, Verification of Decryption, Mix Network
em Duke University
Contributions of Dorsal/Ventral Hippocampus and Dorsolateral/Dorsomedial Striatum to Interval Timing
Resumo:
Humans and animals have remarkable capabilities in keeping time and using time as a guide to orient their learning and decision making. Psychophysical models of timing and time perception have been proposed for decades and have received behavioral, anatomical and pharmacological data support. However, despite numerous studies that aimed at delineating the neural underpinnings of interval timing, a complete picture of the neurobiological network of timing in the seconds-to-minutes range remains elusive. Based on classical interval timing protocols and proposing a Timing, Immersive Memory and Emotional Regulation (TIMER) test battery, the author investigates the contributions of the dorsal and ventral hippocampus as well as the dorsolateral and the dorsomedial striatum to interval timing by comparing timing performances in mice after they received cytotoxic lesions in the corresponding brain regions. On the other hand, a timing-based theoretical framework for the emergence of conscious experience that is closely related to the function of the claustrum is proposed so as to serve both biological guidance and the research and evolution of “strong” artificial intelligence. Finally, a new “Double Saturation Model of Interval Timing” that integrates the direct- and indirect- pathways of striatum is proposed to explain the set of empirical findings.
Resumo:
While molecular and cellular processes are often modeled as stochastic processes, such as Brownian motion, chemical reaction networks and gene regulatory networks, there are few attempts to program a molecular-scale process to physically implement stochastic processes. DNA has been used as a substrate for programming molecular interactions, but its applications are restricted to deterministic functions and unfavorable properties such as slow processing, thermal annealing, aqueous solvents and difficult readout limit them to proof-of-concept purposes. To date, whether there exists a molecular process that can be programmed to implement stochastic processes for practical applications remains unknown.
In this dissertation, a fully specified Resonance Energy Transfer (RET) network between chromophores is accurately fabricated via DNA self-assembly, and the exciton dynamics in the RET network physically implement a stochastic process, specifically a continuous-time Markov chain (CTMC), which has a direct mapping to the physical geometry of the chromophore network. Excited by a light source, a RET network generates random samples in the temporal domain in the form of fluorescence photons which can be detected by a photon detector. The intrinsic sampling distribution of a RET network is derived as a phase-type distribution configured by its CTMC model. The conclusion is that the exciton dynamics in a RET network implement a general and important class of stochastic processes that can be directly and accurately programmed and used for practical applications of photonics and optoelectronics. Different approaches to using RET networks exist with vast potential applications. As an entropy source that can directly generate samples from virtually arbitrary distributions, RET networks can benefit applications that rely on generating random samples such as 1) fluorescent taggants and 2) stochastic computing.
By using RET networks between chromophores to implement fluorescent taggants with temporally coded signatures, the taggant design is not constrained by resolvable dyes and has a significantly larger coding capacity than spectrally or lifetime coded fluorescent taggants. Meanwhile, the taggant detection process becomes highly efficient, and the Maximum Likelihood Estimation (MLE) based taggant identification guarantees high accuracy even with only a few hundred detected photons.
Meanwhile, RET-based sampling units (RSU) can be constructed to accelerate probabilistic algorithms for wide applications in machine learning and data analytics. Because probabilistic algorithms often rely on iteratively sampling from parameterized distributions, they can be inefficient in practice on the deterministic hardware traditional computers use, especially for high-dimensional and complex problems. As an efficient universal sampling unit, the proposed RSU can be integrated into a processor / GPU as specialized functional units or organized as a discrete accelerator to bring substantial speedups and power savings.