Stimulus Discrimination in Cerebellar Purkinje Neurons

Cerebellar Purkinje neurons fire spontaneously in the absence of synaptic input. Overlaid on this intrinsic activity, excitatory input from parallel fibres can add simple spikes to the output train, whereas inhibitory input from interneurons can introduce pauses. These and other influences lead to an irregular spike train output in Purkinje neurons in vitro and in vivo, supplying a variable inhibitory drive to deep cerebellar nuclear neurons. From a computational perspective, this variability raises some questions, as individual spikes induced by excitatory inputs are indistinguishable from intrinsic firing activity. Although bursts of high-frequency excitatory input could be discriminated unambiguously from background activity, granule neurons are known to fire in vivo over a wide range of frequencies. This would mean that much of the sensory information relayed through the cerebellar cortex would be lost within the random variation in background activity. We speculated that alternative mechanisms for signal discrimination may exist, and sought to identify characteristic motifs within the sequence of spikes that followed stimulation events. We found that under certain conditions, parallel fibre stimulation could reliably add a “couplet” of spikes with an unusually short interspike interval to the output train. Therefore, despite representing a small fraction of the total number of spikes, these signals can be reliably discriminated from background firing on a moment-to-moment basis, and could result in a differential downstream response

Sectionality or Why Section Determines Grades: an Exploration of Engineering Core Course Section Grades using a Hierarchical Linear Model and the Multiple-Institution Database for Investigating Engineering Longitudinal Development

Grades, how they are earned, and the institutional impetuses that drive them, are an issue of central importance in the engineering discipline. (1-4) How grades are earned, how different institutions address grades and grade inequities, how instructional practices and policies affect grades, and other grading notions have been studied widely in engineering education. (5-8) The effect of faculty on student grades, while studied, (9) has not been probed as extensively within engineering education using a hierarchical linear model (HLM).One of the great, open questions in engineering education is whether or not the section makes a difference in a student’s grade. In other words, the effect of sectionality on grades to a large extent is unknown. Sectionality combines instructor effects, effects related to time-of-day of instruction, effects related to any tendency for students to coordinate their enrollment, and other effects. Experience and anecdotal evidence suggest that sectionality affects grades, but large-scale empirical studies of this phenomenon do not exist. Due to the inherent structured nature between course sections and students, standard linear regression models do not offer a robust solution to probing longitudinal systems containing multilevel variables. Hierarchical Linear Models (HLMs) provide a robust solution to studying nested or hierarchical systems when compared with standard regression techniques. We constructed a simple HLM to probe inter-section and intra-section variability in grades within the Multiple Institution Database for Investigating Engineering Longitudinal Development (MIDFIELD) by the calculation of intraclass correlation coefficient (ICCs). (10, 11) We then examined grades from three sets of courses endemic to the first year engineering experience: the first chemistry course; the first calculus course; and the first physics course. Our preliminary results indicate that the choice of a HLM to analyze our longitudinal database is correct due to strong variability in grades explained by the high intraclass correlation coefficient (ICC) for most of our MIDFIELD institutions across all three course types analyzed

Ferroelectric enhancement of superconductivity in compressively strained SrTiO3_3 films

SrTiO$_3$ is an incipient ferroelectric on the verge of a polar instability, which is avoided at low temperatures by quantum fluctuations. Within this unusual quantum paraelectric phase, superconductivity persists despite extremely dilute carrier densities. Ferroelectric fluctuations have been suspected to play a role in the origin of superconductivity by contributing to electron pairing. To investigate this possibility, we used optical second harmonic generation to measure the doping and temperature dependence of the ferroelectric order parameter in compressively strained SrTiO$_3$ thin films. At low temperatures, we uncover a spontaneous out-of-plane ferroelectric polarization with an onset that correlates perfectly with normal-state electrical resistivity anomalies. These anomalies have previously been associated with an enhancement of the superconducting critical temperature in doped SrTiO$_3$ films, directly linking the ferroelectric and superconducting phases. We develop a long-range mean-field Ising model of the ferroelectric phase transition to interpret the data and extract the relevant energy scales in the system. Our results support a long-suspected connection between ferroelectricity and superconductivity in SrTiO$_3$, but call into question the role played by ferroelectric fluctuations

WHENCE

From WHENCE it came is a brand devoted to the reuse of electronic waste. Technology, which typically drives families their separate ways, now brings them back together.Ope

On the Power and Limitations of Branch and Cut

The Stabbing Planes proof system [Paul Beame et al., 2018] was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formulas - certain unsatisfiable systems of linear equations od 2 - which are canonical hard examples for many algebraic proof systems. In a recent (and surprising) result, Dadush and Tiwari [Daniel Dadush and Samarth Tiwari, 2020] showed that these short refutations of the Tseitin formulas could be translated into quasi-polynomial size and depth Cutting Planes proofs, refuting a long-standing conjecture. This translation raises several interesting questions. First, whether all Stabbing Planes proofs can be efficiently simulated by Cutting Planes. This would allow for the substantial analysis done on the Cutting Planes system to be lifted to practical mixed integer programming solvers. Second, whether the quasi-polynomial depth of these proofs is inherent to Cutting Planes. In this paper we make progress towards answering both of these questions. First, we show that any Stabbing Planes proof with bounded coefficients (SP*) can be translated into Cutting Planes. As a consequence of the known lower bounds for Cutting Planes, this establishes the first exponential lower bounds on SP*. Using this translation, we extend the result of Dadush and Tiwari to show that Cutting Planes has short refutations of any unsatisfiable system of linear equations over a finite field. Like the Cutting Planes proofs of Dadush and Tiwari, our refutations also incur a quasi-polynomial blow-up in depth, and we conjecture that this is inherent. As a step towards this conjecture, we develop a new geometric technique for proving lower bounds on the depth of Cutting Planes proofs. This allows us to establish the first lower bounds on the depth of Semantic Cutting Planes proofs of the Tseitin formulas

Probabilistic encoding of stimulus strength in astrocyte global calcium signals

Astrocyte calcium signals can range in size from subcellular microdomains to waves that spread through the whole cell (and into connected cells). The differential roles of such local or global calcium signaling are under intense investigation, but the mechanisms by which local signals evolve into global signals in astrocytes are not well understood, nor are the computational rules by which physiological stimuli are transduced into a global signal. To investigate these questions, we transiently applied receptor agonists linked to calcium signaling to primary cultures of cerebellar astrocytes. Astrocytes repetitively tested with the same stimulus responded with global signals intermittently, indicating that each stimulus had a defined probability for triggering a response. The response probability varied between agonists, increased with agonist concentration, and could be positively and negatively modulated by crosstalk with other signaling pathways. To better understand the processes determining the evolution of a global signal, we recorded subcellular calcium “puffs” throughout the whole cell during stimulation. The key requirement for puffs to trigger a global calcium wave following receptor activation appeared to be the synchronous release of calcium from three or more sites, rather than an increasing calcium load accumulating in the cytosol due to increased puff size, amplitude, or frequency. These results suggest that the concentration of transient stimuli will be encoded into a probability of generating a global calcium response, determined by the likelihood of synchronous release from multiple subcellular sites

Stabbing Planes

We introduce and develop a new semi-algebraic proof system, called Stabbing Planes that is in the style of DPLL-based modern SAT solvers. As with DPLL, there is only one rule: the current polytope can be subdivided by branching on an inequality and its "integer negation." That is, we can (nondeterministically choose) a hyperplane a x >= b with integer coefficients, which partitions the polytope into three pieces: the points in the polytope satisfying a x >= b, the points satisfying a x <= b-1, and the middle slab b-1 < a x < b. Since the middle slab contains no integer points it can be safely discarded, and the algorithm proceeds recursively on the other two branches. Each path terminates when the current polytope is empty, which is polynomial-time checkable. Among our results, we show somewhat surprisingly that Stabbing Planes can efficiently simulate Cutting Planes, and moreover, is strictly stronger than Cutting Planes under a reasonable conjecture. We prove linear lower bounds on the rank of Stabbing Planes refutations, by adapting a lifting argument in communication complexity

Photochromic molecular implementations of universal computation

Unconventional computing is an area of research in which novel materials and paradigms are utilised to implement computation. Previously we have demonstrated how registers, logic gates and logic circuits can be implemented, unconventionally, with a biocompatible molecular switch, NitroBIPS, embedded in a polymer matrix. NitroBIPS and related molecules have been shown elsewhere to be capable of modifying many biological processes in a manner that is dependent on its molecular form. Thus, one possible application of this type of unconventional computing is to embed computational processes into biological systems. Here we expand on our earlier proof-of-principle work and demonstrate that universal computation can be implemented using NitroBIPS. We have previously shown that spatially localised computational elements, including registers and logic gates, can be produced. We explain how parallel registers can be implemented, then demonstrate an application of parallel registers in the form of Turing machine tapes, and demonstrate both parallel registers and logic circuits in the form of elementary cellular automata. The Turing machines and elementary cellular automata utilise the same samples and same hardware to implement their registers, logic gates and logic circuits; and both represent examples of universal computing paradigms. This shows that homogenous photochromic computational devices can be dynamically repurposed without invasive reconfiguration. The result represents an important, necessary step towards demonstrating the general feasibility of interfacial computation embedded in biological systems or other unconventional materials and environments