Dynamical mechanism of atrial fibrillation: a topological approach

While spiral wave breakup has been implicated in the emergence of atrial fibrillation, its role in maintaining this complex type of cardiac arrhythmia is less clear. We used the Karma model of cardiac excitation to investigate the dynamical mechanisms that sustain atrial fibrillation once it has been established. The results of our numerical study show that spatiotemporally chaotic dynamics in this regime can be described as a dynamical equilibrium between topologically distinct types of transitions that increase or decrease the number of wavelets, in general agreement with the multiple wavelets hypothesis. Surprisingly, we found that the process of continuous excitation waves breaking up into discontinuous pieces plays no role whatsoever in maintaining spatiotemporal complexity. Instead this complexity is maintained as a dynamical balance between wave coalescence -- a unique, previously unidentified, topological process that increases the number of wavelets -- and wave collapse -- a different topological process that decreases their number.Comment: 15 pages, 14 figure

Modulation of en-route charges to redistribute traffic in the European airspace

Peak-load pricing (PLP), a two-tariffs charging scheme commonly used in public transport and utilities, is tested on the European Air Traffic Management (ATM) system as a means for reducing capacity-demand imbalances. In particular, a centralised approach to PLP (CPLP) where a Central Planner (CP) sets en-route charges on the network is presented. CPLP consists of two phases: in the first, congested airspace sectors and their peak and off-peak hours are identified; in the second, CP assesses and sets en-route charges in order to reduce overall shift on the network. Such charges should guarantee that Air Navigation Service Providers (ANSPs) are able to recover their operational costs while inducing the Airspace Users (AUs) to route their flights in a way that respects airspace capacity. The interaction between CP and AUs is modelled as a Stackelberg game and formulated by means of bilevel linear programming. Two heuristic approaches, based on Coordinate-wise Descent and Genetic Algorithms are implemented to solve the CPLP model on a data set obtained from historical data for an entire day of traffic on European airspace. Results show that significant improvements in traffic distribution in terms of shift and sector load can be achieved through this simple en-route charges modulation scheme

mspire: mass spectrometry proteomics in Ruby

Summary: Mass spectrometry-based proteomics stands to gain from additional analysis of its data, but its large, complex datasets make demands on speed and memory usage requiring special consideration from scripting languages. The software library ‘mspire’—developed in the Ruby programming language—offers quick and memory-efficient readers for standard xml proteomics formats, converters for intermediate file types in typical proteomics spectral-identification work flows (including the Bioworks .srf format), and modules for the calculation of peptide false identification rates

Efficiency of spinal anesthesia versus general anesthesia for lumbar spinal surgery: a retrospective analysis of 544 patients.

BACKGROUND: Previous studies have shown varying results in selected outcomes when directly comparing spinal anesthesia to general in lumbar surgery. Some studies have shown reduced surgical time, postoperative pain, time in the postanesthesia care unit (PACU), incidence of urinary retention, postoperative nausea, and more favorable cost-effectiveness with spinal anesthesia. Despite these results, the current literature has also shown contradictory results in between-group comparisons. MATERIALS AND METHODS: A retrospective analysis was performed by querying the electronic medical record database for surgeries performed by a single surgeon between 2007 and 2011 using procedural codes 63030 for diskectomy and 63047 for laminectomy: 544 lumbar laminectomy and diskectomy surgeries were identified, with 183 undergoing general anesthesia and 361 undergoing spinal anesthesia (SA). Linear and multivariate regression analyses were performed to identify differences in blood loss, operative time, time from entering the operating room (OR) until incision, time from bandage placement to exiting the OR, total anesthesia time, PACU time, and total hospital stay. Secondary outcomes of interest included incidence of postoperative spinal hematoma and death, incidence of paraparesis, plegia, post-dural puncture headache, and paresthesia, among the SA patients. RESULTS: SA was associated with significantly lower operative time, blood loss, total anesthesia time, time from entering the OR until incision, time from bandage placement until exiting the OR, and total duration of hospital stay, but a longer stay in the PACU. The SA group experienced one spinal hematoma, which was evacuated without any long-term neurological deficits, and neither group experienced a death. The SA group had no episodes of paraparesis or plegia, post-dural puncture headaches, or episodes of persistent postoperative paresthesia or weakness. CONCLUSION: SA is effective for use in patients undergoing elective lumbar laminectomy and/or diskectomy spinal surgery, and was shown to be the more expedient anesthetic choice in the perioperative setting

Semi-supervised prediction of protein interaction sentences exploiting semantically encoded metrics

Protein-protein interaction (PPI) identification is an integral component of many biomedical research and database curation tools. Automation of this task through classification is one of the key goals of text mining (TM). However, labelled PPI corpora required to train classifiers are generally small. In order to overcome this sparsity in the training data, we propose a novel method of integrating corpora that do not contain relevance judgements. Our approach uses a semantic language model to gather word similarity from a large unlabelled corpus. This additional information is integrated into the sentence classification process using kernel transformations and has a re-weighting effect on the training features that leads to an 8% improvement in F-score over the baseline results. Furthermore, we discover that some words which are generally considered indicative of interactions are actually neutralised by this process

Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network

We investigate a model protein interaction network whose links represent interactions between individual proteins. This network evolves by the functional duplication of proteins, supplemented by random link addition to account for mutations. When link addition is dominant, an infinite-order percolation transition arises as a function of the addition rate. In the opposite limit of high duplication rate, the network exhibits giant structural fluctuations in different realizations. For biologically-relevant growth rates, the node degree distribution has an algebraic tail with a peculiar rate dependence for the associated exponent.Comment: 4 pages, 2 figures, 2 column revtex format, to be submitted to PRL 1; reference added and minor rewording of the first paragraph; Title change and major reorganization (but no result changes) in response to referee comments; to be published in PR

Identification of noise sources using a time domain beamforming on pneumatic, gas and electric nail guns

In the construction industry, many workers are exposed daily to harmful levels of impulsive noise from nail guns. Therefore, a better knowledge of the noise generated by these tools is required in order to propose noise reduction solutions. The objective of this work is to propose an approach for source identification using a microphone array together with a source identification algorithm based on recent development in the generalized cross-correlation technique. In addition to the pneumatic nail gun, for which sources have been partially identified in the literature, the proposed approach is applied to two other types of nail guns, an electric and a gas powered one. First, the standardized acoustic power spectrum of these three nail guns is measured for global comparison purposes and result in a ranking of the three nail guns. Second, the generalized cross-correlation technique applied to nail gun noise source identification is presented. Third, acoustic maps for successive small time segments are presented, providing a fine identification of noise sources for the three nail guns and an explanation of the observed sound power level ranking. © 2019 Institute of Noise Control Engineering

Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms

We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou's network. We improve upon the value 4/3 by means of Coordination Mechanisms. We increase the latency functions of the edges in the network, i.e., if $\ell_e(x)$ is the latency function of an edge $e$, we replace it by $\hat{\ell}_e(x)$ with $\ell_e(x) \le \hat{\ell}_e(x)$ for all $x$. Then an adversary fixes a demand rate as input. The engineered Price of Anarchy of the mechanism is defined as the worst-case ratio of the Nash social cost in the modified network over the optimal social cost in the original network. Formally, if \CM(r) denotes the cost of the worst Nash flow in the modified network for rate $r$ and \Copt(r) denotes the cost of the optimal flow in the original network for the same rate then [\ePoA = \max_{r \ge 0} \frac{\CM(r)}{\Copt(r)}.] We first exhibit a simple coordination mechanism that achieves for any network of parallel links an engineered Price of Anarchy strictly less than 4/3. For the case of two parallel links our basic mechanism gives 5/4 = 1.25. Then, for the case of two parallel links, we describe an optimal mechanism; its engineered Price of Anarchy lies between 1.191 and 1.192.Comment: 17 pages, 2 figures, preliminary version appeared at ESA 201

SATURN D6.5 - Final Report

The objective of the SATURN (Strategic Allocation of Traffic Using Redistribution in the Network) project is to make novel and credible use of market-based demand-management mechanisms to redistribute air traffic in the European airspace. This reduces congestion and saves the airspace users operational costs. The project is motivated by frequent demand and capacity imbalances in the European airspace network, which are forecast to continue in the near future. The present and foreseen ways of dealing with such imbalances mainly concern strategic and tactical capacity-side interventions, such as resectorisation and opening of more sectors to deal with excess demand. These are followed by tactical demand management measures, if needed. As a result, not only do substantial costs arise, but airspace users are also typically left with no choice but to comply with imposed air traffic flow management measures. The project shows how economic signals could be given to airspace users and air navigation service providers (ANSPs) to improve capacity-demand balancing, airspace design and usage, and what the benefits would be of a centralised planner compared with those of decentralised maximisation of self interests (by the ANSPs and/or airspace users)