Dynamic Binding Communication Mechanism

Shastri & Ajjanagadde have proposed a biologically plausible connectionist rule-based reasoning system (hereafter referred to as a knowledge base, or KB), that represents a dynamic binding as the simultaneous, or in-phase, activity of the appropriate nodes [9]. This paper makes the first attempt at designing a biologically plausible connectionist interface mechanism between 2 distinct phase-based KB, as the next step toward providing a computational account of common-sense reasoning. The Dynamic Binding Communication Mechanism (DBCM) extracts a dynamic binding from a source KB and incorporates the binding into a destination KB so that it is consistent with the knowledge already represented in the latter. DBCM consists of several distinct, special-purpose modules. The Binding Memory (BM) is made up of several identical banks of nodes. Each time a temporally-encoded dynamic binding is extracted from the source KB, it is transferred into one of the banks, where the binding is converted to a spatially-encoded representation. The Phase Database (PD) monitors the target KB and produces a phased output that is out of phase with all other nodes in the target KB. The Phase Allocator (PA) synthesizes information from the Phase Database and from the target KB to determine the phase in which to introduce the new dynamic binding into the target KB. In turn, the PA extracts a single binding from one of the banks in the BM and introduces it into the target KB. The interface also utilizes 2 searchlight mechanisms: the first governs which bank in the BM receives bindings; the second mediates between the active banks (those which are currently representing bindings), and the Phase Allocator

Spatial search and the Dirac equation

We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension d=2. This improves upon the performance of our previous quantum walk search algorithm (which has a critical dimension of d=4), and matches the performance of a corresponding discrete-time quantum walk algorithm. The improvement uses a lattice version of the Dirac Hamiltonian, and thus requires the introduction of spin (or coin) degrees of freedom.Comment: 5 pages, 1 figur

Spatial search by quantum walk

Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order sqrt(N) for d>2, and in time of order sqrt(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous time quantum walk on a graph. The case of the complete graph gives the continuous time search algorithm of Farhi and Gutmann, and other previously known results can be used to show that sqrt(N) speedup can also be achieved on the hypercube. We show that full sqrt(N) speedup can be achieved on a d-dimensional periodic lattice for d>4. In d=4, the quantum walk search algorithm takes time of order sqrt(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup.Comment: v2: 12 pages, 4 figures; published version, with improved arguments for the cases where the algorithm fail

Capacity of optical reading, Part 1: Reading boundless error-free bits using a single photon

We show that nature imposes no fundamental upper limit to the number of information bits per expended photon that can, in principle, be read reliably when classical data is encoded in a medium that can only passively modulate the amplitude and phase of the probe light. We show that with a coherent-state (laser) source, an on-off (amplitude-modulation) pixel encoding, and shot-noise-limited direct detection (an overly-optimistic model for commercial CD/DVD drives), the highest photon information efficiency achievable in principle is about 0.5 bit per transmitted photon. We then show that a coherent-state probe can read unlimited bits per photon when the receiver is allowed to make joint (inseparable) measurements on the reflected light from a large block of phase-modulated memory pixels. Finally, we show an example of a spatially-entangled non-classical light probe and a receiver design---constructable using a single-photon source, beam splitters, and single-photon detectors---that can in principle read any number of error-free bits of information. The probe is a single photon prepared in a uniform coherent superposition of multiple orthogonal spatial modes, i.e., a W-state. The code, target, and joint-detection receiver complexity required by a coherent-state transmitter to achieve comparable photon efficiency performance is shown to be much higher in comparison to that required by the W-state transceiver.Comment: 11 pages, 12 figures, v3 includes a new plot characterizing the photon efficiency vs. encoding efficiency tradeoff for optical reading. The main technical body of the paper remains unaltere

Comparison of Evaluations for Heart Transplant Before Durable Left Ventricular Assist Device and Subsequent Receipt of Transplant at Transplant vs Nontransplant Centers

IMPORTANCE: In 2020, the Centers for Medicare & Medicaid Services revised its national coverage determination, removing the requirement to obtain review from a Medicare-approved heart transplant center to implant a durable left ventricular assist device (LVAD) for bridge-to-transplant (BTT) intent at an LVAD-only center. The association between center-level transplant availability and access to heart transplant, the gold-standard therapy for advanced heart failure (HF), is unknown. OBJECTIVE: To investigate the association of center transplant availability with LVAD implant strategies and subsequent heart transplant following LVAD implant before the Centers for Medicare & Medicaid Services policy change. DESIGN, SETTING, AND PARTICIPANTS: A retrospective cohort study of the Society of Thoracic Surgeons Intermacs multicenter US registry database was conducted from April 1, 2012, to June 30, 2020. The population included patients with HF receiving a primary durable LVAD. EXPOSURES: LVAD center transplant availability (LVAD/transplant vs LVAD only). MAIN OUTCOMES AND MEASURES: The primary outcomes were implant strategy as BTT and subsequent transplant by 2 years. Covariates that might affect listing strategy and outcomes were included (eg, patient demographic characteristics, comorbidities) in multivariable models. Parameters for BTT listing were estimated using logistic regression with center-level random effects and for receipt of a transplant using a Cox proportional hazards regression model with death as a competing event. RESULTS: The sample included 22 221 LVAD recipients with a median age of 59.0 (IQR, 50.0-67.0) years, of whom 17 420 (78.4%) were male and 3156 (14.2%) received implants at LVAD-only centers. Receiving an LVAD at an LVAD/transplant center was associated with a 79% increased adjusted odds of BTT LVAD designation (odds ratio, 1.79; 95% CI, 1.35-2.38; P \u3c .001). The 2-year transplant rate following LVAD implant was 25.6% at LVAD/transplant centers and 11.9% at LVAD-only centers. There was an associated 33% increased rate of transplant at LVAD/transplant centers compared with LVAD-only centers (adjusted hazard ratio, 1.33; 95% CI, 1.17-1.51) with a similar hazard for death at 2 years (adjusted hazard ratio, 0.99; 95% CI, 0.90-1.08). CONCLUSIONS AND RELEVANCE: Receiving an LVAD at an LVAD-transplant center was associated with increased odds of BTT intent at implant and subsequent transplant receipt for patients at 2 years. The findings of this study suggest that Centers for Medicare & Medicaid Services policy change may have the unintended consequence of further increasing inequities in access to transplant among patients at LVAD-only centers

Integrated genomics and proteomics define huntingtin CAG length-dependent networks in mice.

To gain insight into how mutant huntingtin (mHtt) CAG repeat length modifies Huntington's disease (HD) pathogenesis, we profiled mRNA in over 600 brain and peripheral tissue samples from HD knock-in mice with increasing CAG repeat lengths. We found repeat length-dependent transcriptional signatures to be prominent in the striatum, less so in cortex, and minimal in the liver. Coexpression network analyses revealed 13 striatal and 5 cortical modules that correlated highly with CAG length and age, and that were preserved in HD models and sometimes in patients. Top striatal modules implicated mHtt CAG length and age in graded impairment in the expression of identity genes for striatal medium spiny neurons and in dysregulation of cyclic AMP signaling, cell death and protocadherin genes. We used proteomics to confirm 790 genes and 5 striatal modules with CAG length-dependent dysregulation at the protein level, and validated 22 striatal module genes as modifiers of mHtt toxicities in vivo

Effects of eight neuropsychiatric copy number variants on human brain structure

Many copy number variants (CNVs) confer risk for the same range of neurodevelopmental symptoms and psychiatric conditions including autism and schizophrenia. Yet, to date neuroimaging studies have typically been carried out one mutation at a time, showing that CNVs have large effects on brain anatomy. Here, we aimed to characterize and quantify the distinct brain morphometry effects and latent dimensions across 8 neuropsychiatric CNVs. We analyzed T1-weighted MRI data from clinically and non-clinically ascertained CNV carriers (deletion/duplication) at the 1q21.1 (n = 39/28), 16p11.2 (n = 87/78), 22q11.2 (n = 75/30), and 15q11.2 (n = 72/76) loci as well as 1296 non-carriers (controls). Case-control contrasts of all examined genomic loci demonstrated effects on brain anatomy, with deletions and duplications showing mirror effects at the global and regional levels. Although CNVs mainly showed distinct brain patterns, principal component analysis (PCA) loaded subsets of CNVs on two latent brain dimensions, which explained 32 and 29% of the variance of the 8 Cohen’s d maps. The cingulate gyrus, insula, supplementary motor cortex, and cerebellum were identified by PCA and multi-view pattern learning as top regions contributing to latent dimension shared across subsets of CNVs. The large proportion of distinct CNV effects on brain morphology may explain the small neuroimaging effect sizes reported in polygenic psychiatric conditions. Nevertheless, latent gene brain morphology dimensions will help subgroup the rapidly expanding landscape of neuropsychiatric variants and dissect the heterogeneity of idiopathic conditions

Dynamic Fact Communication Mechanism: A Connectionist Interface

Shastri and Ajjanagadde have proposed a biologically plausible connectionist rule-based reasoning system (hereafter referred to as a knowledge base, or K B ) , that represents a dynamic binding as the simultaneous, or in-phase, activity of the appropriate units [Shastri &amp; Ajjanagadde 199'" "Hie work presented in this paper continues this effort at proviang a computational account of rapid, common-sense reasoning. The Dynamic Fact Communication Mechanism (DFCM) is a biologically plausible connectionist interface mechanism that extracts a temporally-encoded fact (i.e. a collection of dynamically-encoded bindings) from a source K B and incorporates the fact into a destination K B in a manner consistent with the knowledge already represented in the latter. By continually interpreting source K B activity in terms of target K B activity, D F C M is able to transfer facts between distinct KBs on the same time scale needed to perform a single rule application within a single KB. Thus, D F C M allows the benefits of decomposing a phase-based reasoning system into multiple KBs, each wi3» its own distinct phase structure, while rendering the inter-module communications costs negligible. A simple modification to D F C M allows the unit of transfer to be groups of facts. Finally, the number of units that compose DFCM is linear in the size of the K B