Statistical mechanics of neocortical interactions: large-scale EEG influences on molecular processes

Recent calculations further supports the premise that large-scale synchronous firings of neurons may affect molecular processes. The context is scalp electroencephalography (EEG) during short-term memory (STM) tasks. The mechanism considered is $\mathbf{\Pi} = \mathbf{p} + q \mathbf{A}$ (SI units) coupling, where $\mathbf{p}$ is the momenta of free $\mathrm{Ca}^{2+}$ waves $q$ the charge of $\mathrm{Ca}^{2+}$ in units of the electron charge, and $\mathbf{A}$ the magnetic vector potential of current $\mathbf{I}$ from neuronal minicolumnar firings considered as wires, giving rise to EEG. Data has processed using multiple graphs to identify sections of data to which spline-Laplacian transformations are applied, to fit the statistical mechanics of neocortical interactions (SMNI) model to EEG data, sensitive to synaptic interactions subject to modification by $\mathrm{Ca}^{2+}$ waves.Comment: Accepted for publication in Journal of Theoretical Biolog

Synaptic Plasticity Can Produce and Enhance Direction Selectivity

The discrimination of the direction of movement of sensory images is critical to the control of many animal behaviors. We propose a parsimonious model of motion processing that generates direction selective responses using short-term synaptic depression and can reproduce salient features of direction selectivity found in a population of neurons in the midbrain of the weakly electric fish Eigenmannia virescens. The model achieves direction selectivity with an elementary Reichardt motion detector: information from spatially separated receptive fields converges onto a neuron via dynamically different pathways. In the model, these differences arise from convergence of information through distinct synapses that either exhibit or do not exhibit short-term synaptic depression—short-term depression produces phase-advances relative to nondepressing synapses. Short-term depression is modeled using two state-variables, a fast process with a time constant on the order of tens to hundreds of milliseconds, and a slow process with a time constant on the order of seconds to tens of seconds. These processes correspond to naturally occurring time constants observed at synapses that exhibit short-term depression. Inclusion of the fast process is sufficient for the generation of temporal disparities that are necessary for direction selectivity in the elementary Reichardt circuit. The addition of the slow process can enhance direction selectivity over time for stimuli that are sustained for periods of seconds or more. Transient (i.e., short-duration) stimuli do not evoke the slow process and therefore do not elicit enhanced direction selectivity. The addition of a sustained global, synchronous oscillation in the gamma frequency range can, however, drive the slow process and enhance direction selectivity to transient stimuli. This enhancement effect does not, however, occur for all combinations of model parameters. The ratio of depressing and nondepressing synapses determines the effects of the addition of the global synchronous oscillation on direction selectivity. These ingredients, short-term depression, spatial convergence, and gamma-band oscillations, are ubiquitous in sensory systems and may be used in Reichardt-style circuits for the generation and enhancement of a variety of biologically relevant spatiotemporal computations

Uplink Performance of Time-Reversal MRC in Massive MIMO Systems Subject to Phase Noise

Multi-user multiple-input multiple-output (MU-MIMO) cellular systems with an excess of base station (BS) antennas (Massive MIMO) offer unprecedented multiplexing gains and radiated energy efficiency. Oscillator phase noise is introduced in the transmitter and receiver radio frequency chains and severely degrades the performance of communication systems. We study the effect of oscillator phase noise in frequency-selective Massive MIMO systems with imperfect channel state information (CSI). In particular, we consider two distinct operation modes, namely when the phase noise processes at the $M$ BS antennas are identical (synchronous operation) and when they are independent (non-synchronous operation). We analyze a linear and low-complexity time-reversal maximum-ratio combining (TR-MRC) reception strategy. For both operation modes we derive a lower bound on the sum-capacity and we compare their performance. Based on the derived achievable sum-rates, we show that with the proposed receive processing an $O(\sqrt{M})$ array gain is achievable. Due to the phase noise drift the estimated effective channel becomes progressively outdated. Therefore, phase noise effectively limits the length of the interval used for data transmission and the number of scheduled users. The derived achievable rates provide insights into the optimum choice of the data interval length and the number of scheduled users.Comment: 13 pages, 6 figures, 2 tables, IEEE Transactions on Wireless Communications (accepted

EXTEND-L : an input language for extensible register transfer compilation

This report discusses the model and input language for EXTEND, a synthesis system that permits extensible register transfer synthesis. EXTEND-L fills the need for a language that bridges the gap between existing behavioral input descriptions, which are too abstract, and structural schematics, which cannot capture the high-level behavior. The report first discusses previous work in behavioral synthesis and summarizes the deficiencies of these behavioral specifications. The report then describes the proposed langauge in detail, and concludes with a few examples that show its utility

On Synchronous and Asynchronous Monitor Instrumentation for Actor-based systems

We study the impact of synchronous and asynchronous monitoring instrumentation on runtime overheads in the context of a runtime verification framework for actor-based systems. We show that, in such a context, asynchronous monitoring incurs substantially lower overhead costs. We also show how, for certain properties that require synchronous monitoring, a hybrid approach can be used that ensures timely violation detections for the important events while, at the same time, incurring lower overhead costs that are closer to those of an asynchronous instrumentation.Comment: In Proceedings FOCLASA 2014, arXiv:1502.0315

Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks

This article is on message-passing systems where communication is (a) synchronous and (b) based on the "broadcast/receive" pair of communication operations. "Synchronous" means that time is discrete and appears as a sequence of time slots (or rounds) such that each message is received in the very same round in which it is sent. "Broadcast/receive" means that during a round a process can either broadcast a message to its neighbors or receive a message from one of them. In such a communication model, no two neighbors of the same process, nor a process and any of its neighbors, must be allowed to broadcast during the same time slot (thereby preventing message collisions in the first case, and message conflicts in the second case). From a graph theory point of view, the allocation of slots to processes is know as the distance-2 coloring problem: a color must be associated with each process (defining the time slots in which it will be allowed to broadcast) in such a way that any two processes at distance at most 2 obtain different colors, while the total number of colors is "as small as possible". The paper presents a parallel message-passing distance-2 coloring algorithm suited to trees, whose roots are dynamically defined. This algorithm, which is itself collision-free and conflict-free, uses $\Delta + 1$ colors where $\Delta$ is the maximal degree of the graph (hence the algorithm is color-optimal). It does not require all processes to have different initial identities, and its time complexity is $O(d \Delta)$, where d is the depth of the tree. As far as we know, this is the first distributed distance-2 coloring algorithm designed for the broadcast/receive round-based communication model, which owns all the previous properties.Comment: 19 pages including one appendix. One Figur

A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave) when composed in parallel. The algebra of rely/guarantee concurrency then becomes an instantiation of the more abstract algebra. Many of the core properties needed for rely/guarantee reasoning can be shown to hold in the abstract algebra where their proofs are simpler and hence allow a higher degree of automation. The algebra has been encoded in Isabelle/HOL to provide a basis for tool support for program verification. In rely/guarantee concurrency, programs are specified to guarantee certain behaviours until assumptions about the behaviour of their environment are violated. When assumptions are violated, program behaviour is unconstrained (aborting), and guarantees need no longer hold. To support these guarantees a second synchronous operator, weak conjunction, was introduced: both processes in a weak conjunction must agree to take each atomic step, unless one aborts in which case the whole aborts. In developing the laws for parallel and weak conjunction we found many properties were shared by the operators and that the proofs of many laws were essentially the same. This insight led to the idea of generalising synchronisation to an abstract operator with only the axioms that are shared by the parallel and weak conjunction operator, so that those two operators can be viewed as instantiations of the abstract synchronisation operator. The main differences between parallel and weak conjunction are how they combine individual atomic steps; that is left open in the axioms for the abstract operator.Comment: Extended version of a Formal Methods 2016 paper, "An algebra of synchronous atomic steps

The Paths to Choreography Extraction

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification (e.g., Multiparty Session Types) and synthesis of correct-by-construction software (Choreographic Programming). They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most existing software does not come with choreographies yet, which prevents their application. To attack this problem, we propose a novel methodology (called choreography extraction) that, given a set of programs or protocol specifications, automatically constructs a choreography that describes their behavior. The key to our extraction is identifying a set of paths in a graph that represents the symbolic execution of the programs of interest. Our method improves on previous work in several directions: we can now deal with programs that are equipped with a state and internal computation capabilities; time complexity is dramatically better; we capture programs that are correct but not necessarily synchronizable, i.e., they work because they exploit asynchronous communication

Asymptotics of Asynchronicity

In this article we focus on estimating the quadratic covariation of continuous semimartingales from discrete observations that take place at asynchronous observation times. The Hayashi-Yoshida estimator serves as synchronized realized covolatility for that we give our own distinct illustration based on an iterative synchronization algorithm. We consider high-frequency asymptotics and prove a feasible stable central limit theorem. The characteristics of non-synchronous observation schemes affecting the asymptotic variance are captured by a notion of asymptotic covariations of times. These are precisely illuminated and explicitly deduced for the important case of independent time-homogeneous Poisson sampling.Comment: technical report, 36 page

On Asynchrony and Choreographies

Choreographic Programming is a paradigm for the development of concurrent software, where deadlocks are prevented syntactically. However, choreography languages are typically synchronous, whereas many real-world systems have asynchronous communications. Previous attempts at enriching choreographies with asynchrony rely on ad-hoc constructions, whose adequacy is only argued informally. In this work, we formalise the properties that an asynchronous semantics for choreographies should have: messages can be sent without the intended receiver being ready, and all sent messages are eventually received. We explore how out-of-order execution, used in choreographies for modelling concurrency, can be exploited to endow choreographies with an asynchronous semantics. Our approach satisfies the properties we identified. We show how our development yields a pleasant correspondence with FIFO-based asynchronous messaging, modelled in a process calculus, and discuss how it can be adopted in more complex choreography models.Comment: In Proceedings ICE 2017, arXiv:1711.1070