@article{2006,
  abstract     = {The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as computational evidence obtained by 1.9 teraHertz-years of computing, and we discuss some of the phenomena we observed in our data. },
  author       = {Hein, Nicolas and Hillar, Christopher and Martin Del Campo Sanchez, Abraham and Sottile, Frank and Teitler, Zach},
  journal      = {Experimental Mathematics},
  number       = {3},
  pages        = {261 -- 269},
  publisher    = {Taylor & Francis},
  title        = {{The monotone secant conjecture in the real Schubert calculus}},
  doi          = {10.1080/10586458.2014.980044},
  volume       = {24},
  year         = {2015},
}

@article{2008,
  abstract     = {The paper describes a generalized iterative proportional fitting procedure that can be used for maximum likelihood estimation in a special class of the general log-linear model. The models in this class, called relational, apply to multivariate discrete sample spaces that do not necessarily have a Cartesian product structure and may not contain an overall effect. When applied to the cell probabilities, the models without the overall effect are curved exponential families and the values of the sufficient statistics are reproduced by the MLE only up to a constant of proportionality. The paper shows that Iterative Proportional Fitting, Generalized Iterative Scaling, and Improved Iterative Scaling fail to work for such models. The algorithm proposed here is based on iterated Bregman projections. As a by-product, estimates of the multiplicative parameters are also obtained. An implementation of the algorithm is available as an R-package.},
  author       = {Klimova, Anna and Rudas, Tamás},
  journal      = {Scandinavian Journal of Statistics},
  number       = {3},
  pages        = {832 -- 847},
  publisher    = {Wiley},
  title        = {{Iterative scaling in curved exponential families}},
  doi          = {10.1111/sjos.12139},
  volume       = {42},
  year         = {2015},
}

@article{2014,
  abstract     = {The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association.},
  author       = {Klimova, Anna and Uhler, Caroline and Rudas, Tamás},
  journal      = {Computational Statistics & Data Analysis},
  number       = {7},
  pages        = {57 -- 72},
  publisher    = {Elsevier},
  title        = {{Faithfulness and learning hypergraphs from discrete distributions}},
  doi          = {10.1016/j.csda.2015.01.017},
  volume       = {87},
  year         = {2015},
}

@article{2025,
  abstract     = {Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular trafficking. Among them, the Rab, Arf, and Rho families function in successive steps of vesicle transport, in forming vesicles from donor membranes, directing vesicle trafficking toward target membranes and docking vesicles onto target membranes. These proteins act as molecular switches that are controlled by a cycle of GTP binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs) and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs in the regulation of the endocytic pathway using fluorescently labeled yeast mating pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells show defective α-factor binding to the cell surface. Interestingly, Ste2p, the α-factor receptor, was mis-localized from the plasma membrane to the vacuole in glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent function, as well as the GAP activity, of Glo3p is important for both α-factor binding and Ste2p localization at the cell surface. Additionally, we found that deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi compartments and causes a defect in transport from the TGN to the plasma membrane. Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN transport pathway, but not in the early endosome-to-TGN transport pathway. These findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell surface proteins.},
  author       = {Kawada, Daiki and Kobayashi, Hiromu and Tomita, Tsuyoshi and Nakata, Eisuke and Nagano, Makoto and Siekhaus, Daria E and Toshima, Junko and Toshimaa, Jiro},
  journal      = {Biochimica et Biophysica Acta - Molecular Cell Research},
  number       = {1},
  pages        = {144 -- 156},
  publisher    = {Elsevier},
  title        = {{The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins}},
  doi          = {10.1016/j.bbamcr.2014.10.009},
  volume       = {1853},
  year         = {2015},
}

@article{2030,
  abstract     = {A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial and azimuthal directions, and high-order finite differences in the radial direction. Time is advanced by a second-order, semi-implicit projection scheme, which requires the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders very small slip velocities. Nonlinear terms are evaluated with the pseudospectral method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node communications and MPI overhead that become relevant at high processor-core counts, and helps to contain the memory footprint. A strong scaling study shows that the hybrid code maintains scalability up to more than 20,000 processor cores and thus allows to perform simulations at higher resolutions than previously feasible. In particular, it opens up the possibility to simulate turbulent Taylor-Couette flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence in Keplerian flows in experimentally relevant regimes.},
  author       = {Shi, Liang and Rampp, Markus and Hof, Björn and Avila, Marc},
  journal      = {Computers and Fluids},
  number       = {1},
  pages        = {1 -- 11},
  publisher    = {Elsevier},
  title        = {{A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow}},
  doi          = {10.1016/j.compfluid.2014.09.021},
  volume       = {106},
  year         = {2015},
}

@article{2035,
  abstract     = {Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.
},
  author       = {Edelsbrunner, Herbert and Jablonski, Grzegorz and Mrozek, Marian},
  journal      = {Foundations of Computational Mathematics},
  number       = {5},
  pages        = {1213 -- 1244},
  publisher    = {Springer},
  title        = {{The persistent homology of a self-map}},
  doi          = {10.1007/s10208-014-9223-y},
  volume       = {15},
  year         = {2015},
}

@inproceedings{10748,
  abstract     = {The study of fluxoid states and fluxoid dynamics in mesoscopic iron-based superconducting rings is valuable for characterizing the basic properties of the superconductor, and may also provide important insight into the superconducting paring symmetry. We report the fabrications of micron-sized rings and disks from thin films of Fe(Se, Te) grown by molecular beam epitaxy. In order to study fluxoid states in rings we developed a custom-tailored version of magnetic force microscopy (MFM). This technique has a number of qualitative advantages for working with mesoscopic superconducting samples in comparison to the conventional MFM and other imaging techniques. We observed metastable fluxoid states in rings of different sizes. Thermally activated fluxoid dynamics of these states was studied and modeled. In addition, we found different regimes of interaction between Fe(Se, Te) ring and MFM tip which are explained. Possibilities of the existence of exotic vortex states and proposals for experiments to test the symmetry of the superconducting order parameter in iron based superconductors are analyzed.},
  author       = {Polshyn, Hryhoriy and Zhang, Can and Naibert, Tyler and Eckstein, James and Budakian, Raffi},
  booktitle    = {APS March Meeting 2015},
  issn         = {0003-0503},
  location     = {San Antonio, TX, United States},
  number       = {1},
  publisher    = {American Physical Society},
  title        = {{Study of Fe (Se, Te) micron-sized rings by magnetic force microscopy}},
  volume       = {60},
  year         = {2015},
}

@article{10794,
  abstract     = {Mathematical models are of fundamental importance in the understanding of complex population dynamics. For instance, they can be used to predict the population evolution starting from different initial conditions or to test how a system responds to external perturbations. For this analysis to be meaningful in real applications, however, it is of paramount importance to choose an appropriate model structure and to infer the model parameters from measured data. While many parameter inference methods are available for models based on deterministic ordinary differential equations, the same does not hold for more detailed individual-based models. Here we consider, in particular, stochastic models in which the time evolution of the species abundances is described by a continuous-time Markov chain. These models are governed by a master equation that is typically difficult to solve. Consequently, traditional inference methods that rely on iterative evaluation of parameter likelihoods are computationally intractable. The aim of this paper is to present recent advances in parameter inference for continuous-time Markov chain models, based on a moment closure approximation of the parameter likelihood, and to investigate how these results can help in understanding, and ultimately controlling, complex systems in ecology. Specifically, we illustrate through an agricultural pest case study how parameters of a stochastic individual-based model can be identified from measured data and how the resulting model can be used to solve an optimal control problem in a stochastic setting. In particular, we show how the matter of determining the optimal combination of two different pest control methods can be formulated as a chance constrained optimization problem where the control action is modeled as a state reset, leading to a hybrid system formulation.},
  author       = {Parise, Francesca and Lygeros, John and Ruess, Jakob},
  issn         = {2296-665X},
  journal      = {Frontiers in Environmental Science},
  keywords     = {General Environmental Science},
  publisher    = {Frontiers},
  title        = {{Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study}},
  doi          = {10.3389/fenvs.2015.00042},
  volume       = {3},
  year         = {2015},
}

@inproceedings{10796,
  abstract     = {We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy).},
  author       = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus},
  booktitle    = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms},
  isbn         = {978-161197374-7},
  location     = {San Diego, CA, United States},
  number       = {1},
  pages        = {1018--1029},
  publisher    = {SIAM},
  title        = {{The value 1 problem under finite-memory strategies for concurrent mean-payoff games}},
  doi          = {10.1137/1.9781611973730.69},
  volume       = {2015},
  year         = {2015},
}

@article{7739,
  abstract     = {Currently, there is much debate on the genetic architecture of quantitative traits in wild populations. Is trait variation influenced by many genes of small effect or by a few genes of major effect? Where is additive genetic variation located in the genome? Do the same loci cause similar phenotypic variation in different populations? Great tits (Parus major) have been studied extensively in long‐term studies across Europe and consequently are considered an ecological ‘model organism’. Recently, genomic resources have been developed for the great tit, including a custom SNP chip and genetic linkage map. In this study, we used a suite of approaches to investigate the genetic architecture of eight quantitative traits in two long‐term study populations of great tits—one in the Netherlands and the other in the United Kingdom. Overall, we found little evidence for the presence of genes of large effects in either population. Instead, traits appeared to be influenced by many genes of small effect, with conservative estimates of the number of contributing loci ranging from 31 to 310. Despite concordance between population‐specific heritabilities, we found no evidence for the presence of loci having similar effects in both populations. While population‐specific genetic architectures are possible, an undetected shared architecture cannot be rejected because of limited power to map loci of small and moderate effects. This study is one of few examples of genetic architecture analysis in replicated wild populations and highlights some of the challenges and limitations researchers will face when attempting similar molecular quantitative genetic studies in free‐living populations.},
  author       = {Santure, Anna W. and Poissant, Jocelyn and De Cauwer, Isabelle and van Oers, Kees and Robinson, Matthew Richard and Quinn, John L. and Groenen, Martien A. M. and Visser, Marcel E. and Sheldon, Ben C. and Slate, Jon},
  issn         = {0962-1083},
  journal      = {Molecular Ecology},
  pages        = {6148--6162},
  publisher    = {Wiley},
  title        = {{Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations}},
  doi          = {10.1111/mec.13452},
  volume       = {24},
  year         = {2015},
}

@article{7741,
  abstract     = {Phenotypes expressed in a social context are not only a function of the individual, but can also be shaped by the phenotypes of social partners. These social effects may play a major role in the evolution of cooperative breeding if social partners differ in the quality of care they provide and if individual carers adjust their effort in relation to that of other carers. When applying social effects models to wild study systems, it is also important to explore sources of individual plasticity that could masquerade as social effects. We studied offspring provisioning rates of parents and helpers in a wild population of long-tailed tits Aegithalos caudatus using a quantitative genetic framework to identify these social effects and partition them into genetic, permanent environment and current environment components. Controlling for other effects, individuals were consistent in their provisioning effort at a given nest, but adjusted their effort based on who was in their social group, indicating the presence of social effects. However, these social effects differed between years and social contexts, indicating a current environment effect, rather than indicating a genetic or permanent environment effect. While this study reveals the importance of examining environmental and genetic sources of social effects, the framework we present is entirely general, enabling a greater understanding of potentially important social effects within any ecological population.},
  author       = {Adams, Mark James and Robinson, Matthew Richard and Mannarelli, Maria-Elena and Hatchwell, Ben J.},
  issn         = {0962-8452},
  journal      = {Proceedings of the Royal Society B: Biological Sciences},
  number       = {1810},
  publisher    = {The Royal Society},
  title        = {{Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird}},
  doi          = {10.1098/rspb.2015.0689},
  volume       = {282},
  year         = {2015},
}

@article{7742,
  abstract     = {Across-nation differences in the mean values for complex traits are common1,2,3,4,5,6,7,8, but the reasons for these differences are unknown. Here we find that many independent loci contribute to population genetic differences in height and body mass index (BMI) in 9,416 individuals across 14 European countries. Using discovery data on over 250,000 individuals and unbiased effect size estimates from 17,500 sibling pairs, we estimate that 24% (95% credible interval (CI) = 9%, 41%) and 8% (95% CI = 4%, 16%) of the captured additive genetic variance for height and BMI, respectively, reflect population genetic differences. Population genetic divergence differed significantly from that in a null model (height, P < 3.94 × 10−8; BMI, P < 5.95 × 10−4), and we find an among-population genetic correlation for tall and slender individuals (r = −0.80, 95% CI = −0.95, −0.60), consistent with correlated selection for both phenotypes. Observed differences in height among populations reflected the predicted genetic means (r = 0.51; P < 0.001), but environmental differences across Europe masked genetic differentiation for BMI (P < 0.58).},
  author       = {Robinson, Matthew Richard and Hemani, Gibran and Medina-Gomez, Carolina and Mezzavilla, Massimo and Esko, Tonu and Shakhbazov, Konstantin and Powell, Joseph E and Vinkhuyzen, Anna and Berndt, Sonja I and Gustafsson, Stefan and Justice, Anne E and Kahali, Bratati and Locke, Adam E and Pers, Tune H and Vedantam, Sailaja and Wood, Andrew R and van Rheenen, Wouter and Andreassen, Ole A and Gasparini, Paolo and Metspalu, Andres and Berg, Leonard H van den and Veldink, Jan H and Rivadeneira, Fernando and Werge, Thomas M and Abecasis, Goncalo R and Boomsma, Dorret I and Chasman, Daniel I and de Geus, Eco J C and Frayling, Timothy M and Hirschhorn, Joel N and Hottenga, Jouke Jan and Ingelsson, Erik and Loos, Ruth J F and Magnusson, Patrik K E and Martin, Nicholas G and Montgomery, Grant W and North, Kari E and Pedersen, Nancy L and Spector, Timothy D and Speliotes, Elizabeth K and Goddard, Michael E and Yang, Jian and Visscher, Peter M},
  issn         = {1061-4036},
  journal      = {Nature Genetics},
  number       = {11},
  pages        = {1357--1362},
  publisher    = {Springer Nature},
  title        = {{Population genetic differentiation of height and body mass index across Europe}},
  doi          = {10.1038/ng.3401},
  volume       = {47},
  year         = {2015},
}

@inproceedings{776,
  abstract     = {High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by &quot;spraying&quot; themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(plog3p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log3p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. Furthermore, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.},
  author       = {Alistarh, Dan-Adrian and Kopinsky, Justin and Li, Jerry and Shavit, Nir},
  booktitle    = {Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
  isbn         = {9781450332057},
  location     = {San Francisco, CA, United States},
  pages        = {11 -- 20},
  publisher    = {ACM},
  title        = {{The SprayList: A scalable relaxed priority queue}},
  doi          = {10.1145/2688500.2688523},
  year         = {2015},
}

@article{7765,
  abstract     = {We introduce a principle unique to disordered solids wherein the contribution of any bond to one global perturbation is uncorrelated with its contribution to another. Coupled with sufficient variability in the contributions of different bonds, this “independent bond-level response” paves the way for the design of real materials with unusual and exquisitely tuned properties. To illustrate this, we choose two global perturbations: compression and shear. By applying a bond removal procedure that is both simple and experimentally relevant to remove a very small fraction of bonds, we can drive disordered spring networks to both the incompressible and completely auxetic limits of mechanical behavior.},
  author       = {Goodrich, Carl Peter and Liu, Andrea J. and Nagel, Sidney R.},
  issn         = {0031-9007},
  journal      = {Physical Review Letters},
  number       = {22},
  publisher    = {American Physical Society},
  title        = {{The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior}},
  doi          = {10.1103/physrevlett.114.225501},
  volume       = {114},
  year         = {2015},
}

@article{7766,
  abstract     = {We study the vibrational properties near a free surface of disordered spring networks derived from jammed sphere packings. In bulk systems, without surfaces, it is well understood that such systems have a plateau in the density of vibrational modes extending down to a frequency scale ω*. This frequency is controlled by ΔZ = 〈Z〉 − 2d, the difference between the average coordination of the spheres and twice the spatial dimension, d, of the system, which vanishes at the jamming transition. In the presence of a free surface we find that there is a density of disordered vibrational modes associated with the surface that extends far below ω*. The total number of these low-frequency surface modes is controlled by ΔZ, and the profile of their decay into the bulk has two characteristic length scales, which diverge as ΔZ−1/2 and ΔZ−1 as the jamming transition is approached.},
  author       = {Sussman, Daniel M. and Goodrich, Carl Peter and Liu, Andrea J. and Nagel, Sidney R.},
  issn         = {1744-683X},
  journal      = {Soft Matter},
  number       = {14},
  pages        = {2745--2751},
  publisher    = {Royal Society of Chemistry},
  title        = {{Disordered surface vibrations in jammed sphere packings}},
  doi          = {10.1039/c4sm02905d},
  volume       = {11},
  year         = {2015},
}

@article{7767,
  abstract     = {We present a model of soft active particles that leads to a rich array of collective behavior found also in dense biological swarms of bacteria and other unicellular organisms. Our model uses only local interactions, such as Vicsek-type nearest-neighbor alignment, short-range repulsion, and a local boundary term. Changing the relative strength of these interactions leads to migrating swarms, rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble motion, alternating between migration and either rotating or jammed states. Interestingly, although a migrating swarm moves slower than an individual particle, the diffusion constant can be up to three orders of magnitude larger, suggesting that collective motion can be highly advantageous, for example, when searching for food.},
  author       = {van Drongelen, Ruben and Pal, Anshuman and Goodrich, Carl Peter and Idema, Timon},
  issn         = {1539-3755},
  journal      = {Physical Review E},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Collective dynamics of soft active particles}},
  doi          = {10.1103/physreve.91.032706},
  volume       = {91},
  year         = {2015},
}

@inproceedings{777,
  abstract     = {In many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges. Equivalently, we are given an input bipartite graph with two types of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items into a given number of components such that the maximum number of topics covered by a component is minimized. This is a clustering problem with various applications, e.g. partitioning of a set of information objects such as documents, images, and videos, and load balancing in the context of modern computation platforms.Inthis paper, we focus on the streaming computation model for this problem, in which items arrive online one at a time and each item must be assigned irrevocably to a component at its arrival time. Motivated by scalability requirements, we focus on the class of streaming computation algorithms with memory limited to be at most linear in the number of components. We show that a greedy assignment strategy is able to recover a hidden co-clustering of items under a natural set of recovery conditions. We also report results of an extensive empirical evaluation, which demonstrate that this greedy strategy yields superior performance when compared with alternative approaches.},
  author       = {Alistarh, Dan-Adrian and Iglesias, Jennifer and Vojnović, Milan},
  isbn         = {9781510825024},
  location     = {Montréal, Canada},
  pages        = {1900 -- 1908},
  publisher    = {Neural Information Processing Systems},
  title        = {{Streaming min-max hypergraph partitioning}},
  volume       = {2015-January},
  year         = {2015},
}

@unpublished{7779,
  abstract     = {The fact that a disordered material is not constrained in its properties in
the same way as a crystal presents significant and yet largely untapped
potential for novel material design. However, unlike their crystalline
counterparts, disordered solids are not well understood. One of the primary
obstacles is the lack of a theoretical framework for thinking about disorder
and its relation to mechanical properties. To this end, we study an idealized
system of frictionless athermal soft spheres that, when compressed, undergoes a
jamming phase transition with diverging length scales and clean power-law
signatures. This critical point is the cornerstone of a much larger "jamming
scenario" that has the potential to provide the essential theoretical
foundation necessary for a unified understanding of the mechanics of disordered
solids. We begin by showing that jammed sphere packings have a valid linear
regime despite the presence of "contact nonlinearities." We then investigate
the critical nature of the transition, focusing on diverging length scales and
finite-size effects. Next, we argue that jamming plays the same role for
disordered solids as the perfect crystal plays for crystalline solids. Not only
can it be considered an idealized starting point for understanding disordered
materials, but it can even influence systems that have a relatively high amount
of crystalline order. The behavior of solids can thus be thought of as existing
on a spectrum, with the perfect crystal and the jamming transition at opposing
ends. Finally, we introduce a new principle wherein the contribution of an
individual bond to one global property is independent of its contribution to
another. This principle allows the different global responses of a disordered
system to be manipulated independently and provides a great deal of flexibility
in designing materials with unique, textured and tunable properties.},
  author       = {Goodrich, Carl Peter},
  booktitle    = {arXiv},
  title        = {{Unearthing the anticrystal: Criticality in the linear response of  disordered solids}},
  doi          = {10.48550/arXiv.1510.08820},
  year         = {2015},
}

@inproceedings{778,
  abstract     = {Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed to complement the fast, but best-effort nature of Hardware Transactional Memory (HTM) with a slow, reliable software backup. However, the costs of providing concurrency between hardware and software transactions in HyTM are still not well understood. In this paper, we propose a general model for HyTM implementations, which captures the ability of hardware transactions to buffer memory accesses. The model allows us to formally quantify and analyze the amount of overhead (instrumentation) caused by the potential presence of software transactions.We prove that (1) it is impossible to build a strictly serializable HyTM implementation that has both uninstrumented reads and writes, even for very weak progress guarantees, and (2) the instrumentation cost incurred by a hardware transaction in any progressive opaque HyTM is linear in the size of the transaction’s data set.We further describe two implementations which exhibit optimal instrumentation costs for two different progress conditions. In sum, this paper proposes the first formal HyTM model and captures for the first time the trade-off between the degree of hardware-software TM concurrency and the amount of instrumentation overhead.},
  author       = {Alistarh, Dan-Adrian and Kopinsky, Justin and Kuznetsov, Petr and Ravi, Srivatsan and Shavit, Nir},
  pages        = {185 -- 199},
  publisher    = {Springer},
  title        = {{Inherent limitations of hybrid transactional memory}},
  doi          = {10.1007/978-3-662-48653-5_13},
  volume       = {9363},
  year         = {2015},
}

@inproceedings{779,
  abstract     = {The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU, are either prohibitively expensive or require significant programming expertise, to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated. In this paper, we take a new approach to concurrent memory reclamation: instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads. Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free.},
  author       = {Alistarh, Dan-Adrian and Matveev, Alexander and Leiserson, William and Shavit, Nir},
  pages        = {123 -- 132},
  publisher    = {ACM},
  title        = {{ThreadScan: Automatic and scalable memory reclamation}},
  doi          = {10.1145/2755573.2755600},
  volume       = {2015-June},
  year         = {2015},
}