@unpublished{8128,
  abstract     = {The stimulus selectivity of synaptic currents in cortical neurons often shows a co-tuning of excitation and inhibition, but the mechanisms that underlie the emergence and plasticity of this co-tuning are not fully understood. Using a computational model, we show that an interaction of excitatory and inhibitory synaptic plasticity reproduces both the developmental and – when combined with a disinhibitory gate – the adult plasticity of excitatory and inhibitory receptive fields in auditory cortex. The co-tuning arises from inhibitory plasticity that balances excitation and inhibition, while excitatory stimulus selectivity can result from two different mechanisms. Inhibitory inputs with a broad stimulus tuning introduce a sliding threshold as in Bienenstock-Cooper-Munro rules, introducing an excitatory stimulus selectivity at the cost of a broader inhibitory receptive field. Alternatively, input asymmetries can be amplified by synaptic competition. The latter leaves any receptive field plasticity transient, a prediction we verify in recordings in auditory cortex.},
  author       = {Clopath, Claudia and Vogels, Tim P and Froemke, Robert C. and Sprekeler, Henning},
  booktitle    = {bioRxiv},
  pages        = {43},
  publisher    = {Cold Spring Harbor Laboratory},
  title        = {{Receptive field formation by interacting excitatory and inhibitory synaptic plasticity}},
  year         = {2016},
}

@article{8241,
  abstract     = {Background: Anticancer vaccines could represent a valuable complementary strategy to established therapies, especially in settings of early stage and minimal residual disease. HER-2 is an important target for immunotherapy and addressed by the monoclonal antibody trastuzumab. We have previously generated HER-2 mimotope peptides from phage display libraries. The synthesized peptides were coupled to carriers and applied for epitope-specific induction of trastuzumab-like IgG. For simplification and to avoid methodological limitations of synthesis and coupling chemistry, we herewith present a novel and optimized approach by using adeno-associated viruses (AAV) as effective and high-density mimotope-display system, which can be directly used for vaccination. Methods: An AAV capsid display library was constructed by genetically incorporating random peptides in a plasmid encoding the wild-type AAV2 capsid protein. AAV clones, expressing peptides specifically reactive to trastuzumab, were employed to immunize BALB/c mice. Antibody titers against human HER-2 were determined, and the isotype composition and functional properties of these were tested. Finally, prophylactically immunized mice were challenged with human HER-2 transfected mouse D2F2/E2 cells. Results: HER-2 mimotope AAV-vaccines induced antibodies specific to human HER-2. Two clones were selected for immunization of mice, which were subsequently grafted D2F2/E2 cells. Both mimotope AAV clones delayed the growth of tumors significantly, as compared to controls. Conclusion: In this study, a novel mimotope AAV-based platform was created allowing the isolation of mimotopes, which can be directly used as anticancer vaccines. The example of trastuzumab AAV-mimotopes demonstrates that this vaccine strategy could help to establish active immunotherapy for breast-cancer patients.},
  author       = {Singer, Josef and Manzano-Szalai, Krisztina and Fazekas, Judit and Thell, Kathrin and Bentley-Lukschal, Anna and Stremnitzer, Caroline and Roth-Walter, Franziska and Weghofer, Margit and Ritter, Mirko and Pino Tossi, Kerstin and Hörer, Markus and Michaelis, Uwe and Jensen-Jarolim, Erika},
  issn         = {2162-402X},
  journal      = {OncoImmunology},
  number       = {7},
  publisher    = {Taylor & Francis},
  title        = {{Proof of concept study with an HER-2 mimotope anticancer vaccine deduced from a novel AAV-mimotope library platform}},
  doi          = {10.1080/2162402x.2016.1171446},
  volume       = {5},
  year         = {2016},
}

@inproceedings{8302,
  abstract     = {While showing great promise, Bitcoin requires users to wait tens of minutes for transactions to commit, and even then, offering only probabilistic guarantees. This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable collective signing to commit Bitcoin transactions irreversibly within seconds. ByzCoin achieves Byzantine consensus while preserving Bitcoin’s open membership by dynamically forming hash power-proportionate consensus groups that represent recently-successful block miners. ByzCoin employs communication trees to optimize transaction commitment and verification under normal operation while guaranteeing safety and liveness under Byzantine faults, up to a near-optimal tolerance of f faulty group members among 3f + 2 total. ByzCoin mitigates double spending and selfish mining attacks by producing collectively signed transaction blocks within one minute of transaction submission. Tree-structured communication further reduces this latency to less than 30 seconds. Due to these optimizations, ByzCoin achieves a throughput higher than Paypal currently handles, with a confirmation latency of 15-20 seconds.},
  author       = {Kokoris Kogias, Eleftherios and Jovanovic, Philipp and Gailly, Nicolas and Khoffi, Ismail and Gasser, Linus and Ford, Bryan},
  booktitle    = {Proceedings of the 25th USENIX Conference on Security Symposium},
  isbn         = {9781931971324},
  location     = {Austin, TX, United States},
  pages        = {279–296},
  publisher    = {USENIX Association},
  title        = {{Enhancing bitcoin security and performance with strong consistency via collective signing}},
  year         = {2016},
}

@article{1616,
  abstract     = {The hippocampus plays a key role in learning and memory. Previous studies suggested that the main types of principal neurons, dentate gyrus granule cells (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal neurons. It has been assumed but never shown that such different activity may be caused by differential synaptic excitation. To test this hypothesis, we performed high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo. In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine the underlying mechanisms, we quantitatively assessed the frequency of spontaneous excitatory synaptic input, the passive membrane properties, and the active membrane characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3 and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition. Thus, differential synaptic excitation is not responsible for differences in firing. Moreover, the three types of hippocampal neurons markedly differed in their passive properties. While GCs showed the most negative membrane potential, CA3 pyramidal neurons had the highest input resistance and the slowest membrane time constant. The three types of neurons also differed in the active membrane characteristics. GCs showed the highest action potential threshold, but displayed the largest gain of the input-output curves. In conclusion, our results reveal that differential firing of the three main types of hippocampal principal neurons in vivo is not primarily caused by differences in the characteristics of the synaptic input, but by the distinct properties of synaptic integration and input-output transformation.},
  author       = {Kowalski, Janina and Gan, Jian and Jonas, Peter M and Pernia-Andrade, Alejandro},
  issn         = {1098-1063},
  journal      = {Hippocampus},
  number       = {5},
  pages        = {668 -- 682},
  publisher    = {Wiley},
  title        = {{Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats}},
  doi          = {10.1002/hipo.22550},
  volume       = {26},
  year         = {2016},
}

@article{1617,
  abstract     = {We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N=md cubes. We prove that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d, where the upper bound with an unspecified constant Cd was proven earlier by Beck. Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality and a suitably taylored Bernstein inequality; we have reasons to believe that the upper bound has the sharp scaling in N. Additional heuristics suggest that jittered sampling should be able to improve known bounds on the inverse of the star-discrepancy in the regime N≳dd. We also prove a partition principle showing that every partition of [0,1]d combined with a jittered sampling construction gives rise to a set whose expected squared L2-discrepancy is smaller than that of purely random points.},
  author       = {Pausinger, Florian and Steinerberger, Stefan},
  journal      = {Journal of Complexity},
  pages        = {199 -- 216},
  publisher    = {Academic Press},
  title        = {{On the discrepancy of jittered sampling}},
  doi          = {10.1016/j.jco.2015.11.003},
  volume       = {33},
  year         = {2016},
}

@article{1620,
  abstract     = {We consider the Bardeen–Cooper–Schrieffer free energy functional for particles interacting via a two-body potential on a microscopic scale and in the presence of weak external fields varying on a macroscopic scale. We study the influence of the external fields on the critical temperature. We show that in the limit where the ratio between the microscopic and macroscopic scale tends to zero, the next to leading order of the critical temperature is determined by the lowest eigenvalue of the linearization of the Ginzburg–Landau equation.},
  author       = {Frank, Rupert and Hainzl, Christian and Seiringer, Robert and Solovej, Jan},
  journal      = {Communications in Mathematical Physics},
  number       = {1},
  pages        = {189 -- 216},
  publisher    = {Springer},
  title        = {{The external field dependence of the BCS critical temperature}},
  doi          = {10.1007/s00220-015-2526-2},
  volume       = {342},
  year         = {2016},
}

@article{1622,
  abstract     = {We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities for many-body quantum systems with fractional kinetic operators and homogeneous interaction potentials, where no anti-symmetry on the wave functions is assumed. These many-body inequalities imply interesting one-body interpolation inequalities, and we show that the corresponding one- and many-body inequalities are actually equivalent in certain cases.},
  author       = {Lundholm, Douglas and Nam, Phan and Portmann, Fabian},
  journal      = {Archive for Rational Mechanics and Analysis},
  number       = {3},
  pages        = {1343 -- 1382},
  publisher    = {Springer},
  title        = {{Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems}},
  doi          = {10.1007/s00205-015-0923-5},
  volume       = {219},
  year         = {2016},
}

@article{1631,
  abstract     = {Ancestral processes are fundamental to modern population genetics and spatial structure has been the subject of intense interest for many years. Despite this interest, almost nothing is known about the distribution of the locations of pedigree or genetic ancestors. Using both spatially continuous and stepping-stone models, we show that the distribution of pedigree ancestors approaches a travelling wave, for which we develop two alternative approximations. The speed and width of the wave are sensitive to the local details of the model. After a short time, genetic ancestors spread far more slowly than pedigree ancestors, ultimately diffusing out with radius ## rather than spreading at constant speed. In contrast to the wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the local details of the models.},
  author       = {Kelleher, Jerome and Etheridge, Alison and Véber, Amandine and Barton, Nicholas H},
  journal      = {Theoretical Population Biology},
  pages        = {1 -- 12},
  publisher    = {Academic Press},
  title        = {{Spread of pedigree versus genetic ancestry in spatially distributed populations}},
  doi          = {10.1016/j.tpb.2015.10.008},
  volume       = {108},
  year         = {2016},
}

@article{1641,
  abstract     = {The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant growth and development including embryo and root patterning, lateral organ formation and growth responses to environmental stimuli. Auxin is directionally transported from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)] and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations are aligned with the direction of the auxin flow. Auxin itself regulates its own transport by modulation of the expression and subcellular localization of the auxin transporters. Increased auxin levels promote the transcription of PIN2 and AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged auxin exposure increases the turnover of PIN proteins and their degradation in the vacuole. In this study, we applied a forward genetic approach, to identify molecular components playing a role in the auxin-mediated degradation. We generated EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations and designed a screen for mutants with persistently strong fluorescent signals of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin 2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and established a role for auxin-mediated degradation in plant development.},
  author       = {Zemová, Radka and Zwiewka, Marta and Bielach, Agnieszka and Robert, Hélène and Friml, Jirí},
  journal      = {Journal of Plant Growth Regulation},
  number       = {2},
  pages        = {465 -- 476},
  publisher    = {Springer},
  title        = {{A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana}},
  doi          = {10.1007/s00344-015-9553-2},
  volume       = {35},
  year         = {2016},
}

@inproceedings{1653,
  abstract     = {A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs (ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x) using a public hashing-key hk. Furthermore, there is a way to set up the hash key hk to make it statistically binding on some arbitrary hidden position i, meaning that: (1) the digest y completely determines the i’th bit (or symbol) of x so that all pre-images of y have the same value in the i’th position, (2) it is computationally infeasible to distinguish the position i on which hk is statistically binding from any other position i’. Lastly, the hash should have a local opening property analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should be possible to create a short proof π that certifies the value of the i’th bit (or symbol) of x without having to provide the entire input x. A similar primitive called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC ’15) further supports dynamic updates of the hashed value. These tools, which are interesting in their own right, also serve as one of the main technical components in several recent works building advanced applications from indistinguishability obfuscation (iO).

The prior constructions of SSB hashing and positional accumulators required fully homomorphic encryption (FHE) and iO respectively. In this work, we give new constructions of these tools based on well studied number-theoretic assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction from lossy/injective functions.},
  author       = {Okamoto, Tatsuaki and Pietrzak, Krzysztof Z and Waters, Brent and Wichs, Daniel},
  location     = {Auckland, New Zealand},
  pages        = {121 -- 145},
  publisher    = {Springer},
  title        = {{New realizations of somewhere statistically binding hashing and positional accumulators}},
  doi          = {10.1007/978-3-662-48797-6_6},
  volume       = {9452},
  year         = {2016},
}

@article{1662,
  abstract     = {We introduce a modification of the classic notion of intrinsic volume using persistence moments of height functions. Evaluating the modified first intrinsic volume on digital approximations of a compact body with smoothly embedded boundary in Rn, we prove convergence to the first intrinsic volume of the body as the resolution of the approximation improves. We have weaker results for the other modified intrinsic volumes, proving they converge to the corresponding intrinsic volumes of the n-dimensional unit ball.},
  author       = {Edelsbrunner, Herbert and Pausinger, Florian},
  journal      = {Advances in Mathematics},
  pages        = {674 -- 703},
  publisher    = {Academic Press},
  title        = {{Approximation and convergence of the intrinsic volume}},
  doi          = {10.1016/j.aim.2015.10.004},
  volume       = {287},
  year         = {2016},
}

@article{1705,
  abstract     = {Hybrid systems represent an important and powerful formalism for modeling real-world applications such as embedded systems. A verification tool like SpaceEx is based on the exploration of a symbolic search space (the region space). As a verification tool, it is typically optimized towards proving the absence of errors. In some settings, e.g., when the verification tool is employed in a feedback-directed design cycle, one would like to have the option to call a version that is optimized towards finding an error trajectory in the region space. A recent approach in this direction is based on guided search. Guided search relies on a cost function that indicates which states are promising to be explored, and preferably explores more promising states first. In this paper, we propose an abstraction-based cost function based on coarse-grained space abstractions for guiding the reachability analysis. For this purpose, a suitable abstraction technique that exploits the flexible granularity of modern reachability analysis algorithms is introduced. The new cost function is an effective extension of pattern database approaches that have been successfully applied in other areas. The approach has been implemented in the SpaceEx model checker. The evaluation shows its practical potential.},
  author       = {Bogomolov, Sergiy and Donzé, Alexandre and Frehse, Goran and Grosu, Radu and Johnson, Taylor and Ladan, Hamed and Podelski, Andreas and Wehrle, Martin},
  journal      = {International Journal on Software Tools for Technology Transfer},
  number       = {4},
  pages        = {449 -- 467},
  publisher    = {Springer},
  title        = {{Guided search for hybrid systems based on coarse-grained space abstractions}},
  doi          = {10.1007/s10009-015-0393-y},
  volume       = {18},
  year         = {2016},
}

@article{173,
  abstract     = {We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.},
  author       = {Browning, Timothy D and Booker, Andrew},
  journal      = {Discrete Analysis},
  pages        = {1 -- 18},
  title        = {{Square-free values of reducible polynomials}},
  doi          = {10.19086/da.732},
  volume       = {8},
  year         = {2016},
}

@article{1794,
  abstract     = {We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights.},
  author       = {Kolmogorov, Vladimir and Takhanov, Rustem},
  journal      = {Algorithmica},
  number       = {1},
  pages        = {17 -- 46},
  publisher    = {Springer},
  title        = {{Inference algorithms for pattern-based CRFs on sequence data}},
  doi          = {10.1007/s00453-015-0017-7},
  volume       = {76},
  year         = {2016},
}

@article{1833,
  abstract     = {Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. },
  author       = {Klimova, Anna and Rudas, Tamás},
  journal      = {Journal of Multivariate Analysis},
  pages        = {440 -- 452},
  publisher    = {Elsevier},
  title        = {{On the closure of relational models}},
  doi          = {10.1016/j.jmva.2015.10.005},
  volume       = {143},
  year         = {2016},
}

@article{1881,
  abstract     = {We consider random matrices of the form H=W+λV, λ∈ℝ+, where W is a real symmetric or complex Hermitian Wigner matrix of size N and V is a real bounded diagonal random matrix of size N with i.i.d.\ entries that are independent of W. We assume subexponential decay for the matrix entries of W and we choose λ∼1, so that the eigenvalues of W and λV are typically of the same order. Further, we assume that the density of the entries of V is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is λ+∈ℝ+ such that the largest eigenvalues of H are in the limit of large N determined by the order statistics of V for λ>λ+. In particular, the largest eigenvalue of H has a Weibull distribution in the limit N→∞ if λ>λ+. Moreover, for N sufficiently large, we show that the eigenvectors associated to the largest eigenvalues are partially localized for λ>λ+, while they are completely delocalized for λ<λ+. Similar results hold for the lowest eigenvalues. },
  author       = {Lee, Jioon and Schnelli, Kevin},
  journal      = {Probability Theory and Related Fields},
  number       = {1-2},
  pages        = {165 -- 241},
  publisher    = {Springer},
  title        = {{Extremal eigenvalues and eigenvectors of deformed Wigner matrices}},
  doi          = {10.1007/s00440-014-0610-8},
  volume       = {164},
  year         = {2016},
}

@article{6732,
  abstract     = {Consider the transmission of a polar code of block length N and rate R over a binary memoryless symmetric channel W and let P e be the block error probability under successive cancellation decoding. In this paper, we develop new bounds that characterize the relationship of the parameters R, N, P e , and the quality of the channel W quantified by its capacity I(W) and its Bhattacharyya parameter Z(W). In previous work, two main regimes were studied. In the error exponent regime, the channel W and the rate R <; I(W) are fixed, and it was proved that the error probability Pe scales roughly as 2 -√N . In the scaling exponent approach, the channel W and the error probability Pe are fixed and it was proved that the gap to capacity I(W) - R scales as N -1/μ . Here, μ is called scaling exponent and this scaling exponent depends on the channel W. A heuristic computation for the binary erasure channel (BEC) gives μ = 3.627 and it was shown that, for any channel W, 3.579 ≤ μ ≤ 5.702. Our contributions are as follows. First, we provide the tighter upper bound μ <;≤ 4.714 valid for any W. With the same technique, we obtain the upper bound μ ≤ 3.639 for the case of the BEC; this upper bound approaches very closely the heuristically derived value for the scaling exponent of the erasure channel. Second, we develop a trade-off between the gap to capacity I(W)- R and the error probability Pe as the functions of the block length N. In other words, we neither fix the gap to capacity (error exponent regime) nor the error probability (scaling exponent regime), but we do consider a moderate deviations regime in which we study how fast both quantities, as the functions of the block length N, simultaneously go to 0. Third, we prove that polar codes are not affected by error floors. To do so, we fix a polar code of block length N and rate R. Then, we vary the channel W and study the impact of this variation on the error probability. We show that the error probability Pe scales as the Bhattacharyya parameter Z(W) raised to a power that scales roughly like VN. This agrees with the scaling in the error exponent regime.},
  author       = {Mondelli, Marco and Hassani, S. Hamed and Urbanke, Rudiger L.},
  issn         = {1557-9654},
  journal      = {IEEE Transactions on Information Theory},
  number       = {12},
  pages        = {6698--6712},
  publisher    = {IEEE},
  title        = {{Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors}},
  doi          = {10.1109/tit.2016.2616117},
  volume       = {62},
  year         = {2016},
}

@inproceedings{6733,
  abstract     = {The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties of RM codes, apart from their symmetry. Indeed, the main technical result consists in showing that any sequence of linear codes, with doubly-transitive permutation groups, achieves capacity on the memoryless erasure channel under bit-MAP decoding. Thus, a natural question is what happens under block-MAP decoding. In [1], [2], by exploiting further symmetries of the code, the bit-MAP threshold was shown to be sharp enough so that the block erasure probability also converges to 0. However, this technique relies heavily on the fact that the transmission is over an erasure channel. We present an alternative approach to strengthen results regarding the bit-MAP threshold to block-MAP thresholds. This approach is based on a careful analysis of the weight distribution of RM codes. In particular, the flavor of the main result is the following: assume that the bit-MAP error probability decays as N -δ , for some δ > 0. Then, the block-MAP error probability also converges to 0. This technique applies to transmission over any binary memoryless symmetric channel. Thus, it can be thought of as a first step in extending the proof that RM codes are capacity-achieving to the general case.},
  author       = {Kudekar, Shrinivas and Kumar, Santhosh and Mondelli, Marco and Pfister, Henry D. and Urbankez, Rudiger},
  booktitle    = {2016 IEEE International Symposium on Information Theory },
  location     = {Barcelona, Spain},
  pages        = {1755--1759},
  publisher    = {IEEE},
  title        = {{Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels}},
  doi          = {10.1109/isit.2016.7541600},
  year         = {2016},
}

@article{7068,
  abstract     = {Electrons in materials with linear dispersion behave as massless Weyl- or Dirac-quasiparticles, and continue to intrigue due to their close resemblance to elusive ultra-relativistic particles as well as their potential for future electronics. Yet the experimental signatures of Weyl-fermions are often subtle and indirect, in particular if they coexist with conventional, massive quasiparticles. Here we show a pronounced anomaly in the magnetic torque of the Weyl semimetal NbAs upon entering the quantum limit state in high magnetic fields. The torque changes sign in the quantum limit, signalling a reversal of the magnetic anisotropy that can be directly attributed to the topological nature of the Weyl electrons. Our results establish that anomalous quantum limit torque measurements provide a direct experimental method to identify and distinguish Weyl and Dirac systems.},
  author       = {Moll, Philip J. W. and Potter, Andrew C. and Nair, Nityan L. and Ramshaw, B. J. and Modic, Kimberly A and Riggs, Scott and Zeng, Bin and Ghimire, Nirmal J. and Bauer, Eric D. and Kealhofer, Robert and Ronning, Filip and Analytis, James G.},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{Magnetic torque anomaly in the quantum limit of Weyl semimetals}},
  doi          = {10.1038/ncomms12492},
  volume       = {7},
  year         = {2016},
}

@article{7279,
  abstract     = {Kinetics of electrochemical reactions are several orders of magnitude slower in solids than in liquids as a result of the much lower ion diffusivity. Yet, the solid state maximizes the density of redox species, which is at least two orders of magnitude lower in liquids because of solubility limitations. With regard to electrochemical energy storage devices, this leads to high-energy batteries with limited power and high-power supercapacitors with a well-known energy deficiency. For such devices the ideal system should endow the liquid state with a density of redox species close to the solid state. Here we report an approach based on biredox ionic liquids to achieve bulk-like redox density at liquid-like fast kinetics. The cation and anion of these biredox ionic liquids bear moieties that undergo very fast reversible redox reactions. As a first demonstration of their potential for high-capacity/high-rate charge storage, we used them in redox supercapacitors. These ionic liquids are able to decouple charge storage from an ion-accessible electrode surface, by storing significant charge in the pores of the electrodes, to minimize self-discharge and leakage current as a result of retaining the redox species in the pores, and to raise working voltage due to their wide electrochemical window.},
  author       = {Mourad, Eléonore and Coustan, Laura and Lannelongue, Pierre and Zigah, Dodzi and Mehdi, Ahmad and Vioux, André and Freunberger, Stefan Alexander and Favier, Frédéric and Fontaine, Olivier},
  issn         = {1476-1122},
  journal      = {Nature Materials},
  number       = {4},
  pages        = {446--453},
  publisher    = {Springer Nature},
  title        = {{Biredox ionic liquids with solid-like redox density in the liquid state for high-energy supercapacitors}},
  doi          = {10.1038/nmat4808},
  volume       = {16},
  year         = {2016},
}