@article{5992,
  abstract     = {Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.},
  author       = {Dolati, Setareh and Kage, Frieda and Mueller, Jan and Müsken, Mathias and Kirchner, Marieluise and Dittmar, Gunnar and Sixt, Michael K and Rottner, Klemens and Falcke, Martin},
  issn         = {1939-4586},
  journal      = {Molecular Biology of the Cell},
  number       = {22},
  pages        = {2674--2686},
  publisher    = {American Society for Cell Biology},
  title        = {{On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility}},
  doi          = {10.1091/mbc.e18-02-0082},
  volume       = {29},
  year         = {2018},
}

@unpublished{8547,
  abstract     = {The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.},
  author       = {Llorca, Alfredo and Ciceri, Gabriele and Beattie, Robert J and Wong, Fong K. and Diana, Giovanni and Serafeimidou, Eleni and Fernández-Otero, Marian and Streicher, Carmen and Arnold, Sebastian J. and Meyer, Martin and Hippenmeyer, Simon and Maravall, Miguel and Marín, Oscar},
  booktitle    = {bioRxiv},
  title        = {{Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture}},
  doi          = {10.1101/494088},
  year         = {2018},
}

@article{10286,
  abstract     = {In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.},
  author       = {Allini, Elie Noumon and Skórski, Maciej and Petura, Oto and Bernard, Florent and Laban, Marek and Fischer, Viktor},
  issn         = {2569-2925},
  journal      = {IACR Transactions on Cryptographic Hardware and Embedded Systems},
  number       = {3},
  pages        = {214--242},
  publisher    = {International Association for Cryptologic Research},
  title        = {{Evaluation and monitoring of free running oscillators serving as source of randomness}},
  doi          = {10.13154/tches.v2018.i3.214-242},
  volume       = {2018},
  year         = {2018},
}

@article{5995,
  abstract     = {Motivation
Computational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.

Results
Here we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here.},
  author       = {Usmanova, Dinara R and Bogatyreva, Natalya S and Ariño Bernad, Joan and Eremina, Aleksandra A and Gorshkova, Anastasiya A and Kanevskiy, German M and Lonishin, Lyubov R and Meister, Alexander V and Yakupova, Alisa G and Kondrashov, Fyodor and Ivankov, Dmitry},
  issn         = {1367-4811},
  journal      = {Bioinformatics},
  number       = {21},
  pages        = {3653--3658},
  publisher    = {Oxford University Press},
  title        = {{Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation}},
  doi          = {10.1093/bioinformatics/bty340},
  volume       = {34},
  year         = {2018},
}

@article{404,
  abstract     = {We construct martingale solutions to stochastic thin-film equations by introducing a (spatial) semidiscretization and establishing convergence. The discrete scheme allows for variants of the energy and entropy estimates in the continuous setting as long as the discrete energy does not exceed certain threshold values depending on the spatial grid size $h$. Using a stopping time argument to prolongate high-energy paths constant in time, arbitrary moments of coupled energy/entropy functionals can be controlled. Having established Hölder regularity of approximate solutions, the convergence proof is then based on compactness arguments---in particular on Jakubowski's generalization of Skorokhod's theorem---weak convergence methods, and recent tools on martingale convergence.

},
  author       = {Fischer, Julian L and Grün, Günther},
  journal      = {SIAM Journal on Mathematical Analysis},
  number       = {1},
  pages        = {411 -- 455},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Existence of positive solutions to stochastic thin-film equations}},
  doi          = {10.1137/16M1098796},
  volume       = {50},
  year         = {2018},
}

@article{181,
  abstract     = {We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2.},
  author       = {Erdös, László and Krüger, Torben H and Renfrew, David T},
  journal      = {SIAM Journal on Mathematical Analysis},
  number       = {3},
  pages        = {3271 -- 3290},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Power law decay for systems of randomly coupled differential equations}},
  doi          = {10.1137/17M1143125},
  volume       = {50},
  year         = {2018},
}

@article{312,
  abstract     = {Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.},
  author       = {Edelsbrunner, Herbert and Iglesias Ham, Mabel},
  issn         = {0895-4801},
  journal      = {SIAM J Discrete Math},
  number       = {1},
  pages        = {750 -- 782},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{On the optimality of the FCC lattice for soft sphere packing}},
  doi          = {10.1137/16M1097201},
  volume       = {32},
  year         = {2018},
}

@article{22,
  abstract     = {Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems.},
  author       = {Botello, Gabriel and Sedlmeir, Florian and Rueda Sanchez, Alfredo R and Abdalmalak, Kerlos and Brown, Elliott and Leuchs, Gerd and Preu, Sascha and Segovia Vargas, Daniel and Strekalov, Dmitry and Munoz, Luis and Schwefel, Harald},
  issn         = {2334-2536},
  journal      = {Optica},
  number       = {10},
  pages        = {1210--1219},
  publisher    = {Optica Publishing Group},
  title        = {{Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters}},
  doi          = {10.1364/OPTICA.5.001210},
  volume       = {5},
  year         = {2018},
}

@techreport{5686,
  abstract     = {In the working paper I describe in detail the approach for Open Access definitions which was presented in the Workshop "Open Access Monitoring - Approaches and Perspectives" in Vienna. It defines five criteria on which are the definitions build. Each criteria can be out of 4 classes. The minimum classes for the criteria which are used in a Open Access definition can be presented as the Classification of Open Access Tuples e.g. Open Access (Berlin Declaration) (1,1,1,1,3) this methods allows much easier to distinguish between different Open Access definitions. This is needed if the Open Access Universe should be measured in studies or monitoring approaches and the results should become more comparable.     },
  author       = {Danowski, Patrick},
  pages        = {5},
  publisher    = {Zenodo},
  title        = {{An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors}},
  doi          = {10.5281/zenodo.1244154},
  year         = {2018},
}

@article{58,
  abstract     = {Inside a two-dimensional region (``cake&quot;&quot;), there are m nonoverlapping tiles of a certain kind (``toppings&quot;&quot;). We want to expand the toppings while keeping them nonoverlapping, and possibly add some blank pieces of the same ``certain kind,&quot;&quot; such that the entire cake is covered. How many blanks must we add? We study this question in several cases: (1) The cake and toppings are general polygons. (2) The cake and toppings are convex figures. (3) The cake and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear polygon and the toppings are axis-parallel rectangles. In all four cases, we provide tight bounds on the number of blanks.},
  author       = {Akopyan, Arseniy and Segal Halevi, Erel},
  journal      = {SIAM Journal on Discrete Mathematics},
  number       = {3},
  pages        = {2242 -- 2257},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Counting blanks in polygonal arrangements}},
  doi          = {10.1137/16M110407X},
  volume       = {32},
  year         = {2018},
}

@article{427,
  abstract     = {We investigate the quantum interference induced shifts between energetically close states in highly charged ions, with the energy structure being observed by laser spectroscopy. In this work, we focus on hyperfine states of lithiumlike heavy-Z isotopes and quantify how much quantum interference changes the observed transition frequencies. The process of photon excitation and subsequent photon decay for the transition 2s→2p→2s is implemented with fully relativistic and full-multipole frameworks, which are relevant for such relativistic atomic systems. We consider the isotopes Pb79+207 and Bi80+209 due to experimental interest, as well as other examples of isotopes with lower Z, namely Pr56+141 and Ho64+165. We conclude that quantum interference can induce shifts up to 11% of the linewidth in the measurable resonances of the considered isotopes, if interference between resonances is neglected. The inclusion of relativity decreases the cross section by 35%, mainly due to the complete retardation form of the electric dipole multipole. However, the contribution of the next higher multipoles (e.g., magnetic quadrupole) to the cross section is negligible. This makes the contribution of relativity and higher-order multipoles to the quantum interference induced shifts a minor effect, even for heavy-Z elements.},
  author       = {Amaro, Pedro and Loureiro, Ulisses and Safari, Laleh and Fratini, Filippo and Indelicato, Paul and Stöhlker, Thomas and Santos, José},
  journal      = {Physical Review A},
  number       = {2},
  publisher    = {American Physical Society},
  title        = {{Quantum interference in laser spectroscopy of highly charged lithiumlike ions}},
  doi          = {10.1103/PhysRevA.97.022510},
  volume       = {97},
  year         = {2018},
}

@article{307,
  abstract     = {Spontaneous emission spectra of two initially excited closely spaced identical atoms are very sensitive to the strength and the direction of the applied magnetic field. We consider the relevant schemes that ensure the determination of the mutual spatial orientation of the atoms and the distance between them by entirely optical means. A corresponding theoretical description is given accounting for the dipole-dipole interaction between the two atoms in the presence of a magnetic field and for polarizations of the quantum field interacting with magnetic sublevels of the two-atom system. },
  author       = {Redchenko, Elena and Makarov, Alexander and Yudson, Vladimir},
  journal      = {Physical Review A},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Nanoscopy of pairs of atoms by fluorescence in a magnetic field}},
  doi          = {10.1103/PhysRevA.97.043812},
  volume       = {97},
  year         = {2018},
}

@inproceedings{34,
  abstract     = {Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies.},
  author       = {Chatterjee, Krishnendu and Chemlík, Martin and Topcu, Ufuk},
  booktitle    = {28th International Conference on Automated Planning and Scheduling},
  location     = {Delft, Netherlands},
  pages        = {47 -- 55},
  publisher    = {AAAI Press},
  title        = {{Sensor synthesis for POMDPs with reachability objectives}},
  doi          = {10.1609/icaps.v28i1.13875},
  volume       = {2018},
  year         = {2018},
}

@inproceedings{35,
  abstract     = {We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.},
  author       = {Chatterjee, Krishnendu and Dvorák, Wolfgang and Henzinger, Monika H and Svozil, Alexander},
  booktitle    = {28th International Conference on Automated Planning and Scheduling},
  location     = {Delft, Netherlands},
  publisher    = {AAAI Press},
  title        = {{Algorithms and conditional lower bounds for planning problems}},
  year         = {2018},
}

@article{12,
  abstract     = {Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects.},
  author       = {Nakashima, Kazutaka and Auzinger, Thomas and Iarussi, Emmanuel and Zhang, Ran and Igarashi, Takeo and Bickel, Bernd},
  journal      = {ACM Transactions on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds}},
  doi          = {10.1145/3197517.3201341},
  volume       = {37},
  year         = {2018},
}

@article{4,
  abstract     = {We present a data-driven technique to instantly predict how fluid flows around various three-dimensional objects. Such simulation is useful for computational fabrication and engineering, but is usually computationally expensive since it requires solving the Navier-Stokes equation for many time steps. To accelerate the process, we propose a machine learning framework which predicts aerodynamic forces and velocity and pressure fields given a threedimensional shape input. Handling detailed free-form three-dimensional shapes in a data-driven framework is challenging because machine learning approaches usually require a consistent parametrization of input and output. We present a novel PolyCube maps-based parametrization that can be computed for three-dimensional shapes at interactive rates. This allows us to efficiently learn the nonlinear response of the flow using a Gaussian process regression. We demonstrate the effectiveness of our approach for the interactive design and optimization of a car body.},
  author       = {Umetani, Nobuyuki and Bickel, Bernd},
  journal      = {ACM Transactions on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{Learning three-dimensional flow for interactive aerodynamic design}},
  doi          = {10.1145/3197517.3201325},
  volume       = {37},
  year         = {2018},
}

@article{13,
  abstract     = {We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery.},
  author       = {Alderighi, Thomas and Malomo, Luigi and Giorgi, Daniela and Pietroni, Nico and Bickel, Bernd and Cignoni, Paolo},
  journal      = {ACM Transactions on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{Metamolds: Computational design of silicone molds}},
  doi          = {10.1145/3197517.3201381},
  volume       = {37},
  year         = {2018},
}

@inproceedings{6589,
  abstract     = {Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics.},
  author       = {Alistarh, Dan-Adrian and Hoefler, Torsten and Johansson, Mikael and Konstantinov, Nikola H and Khirirat, Sarit and Renggli, Cedric},
  booktitle    = {32nd Conference on Neural Information Processing Systems},
  issn         = {1049-5258},
  location     = {Montreal, Canada},
  pages        = {5973--5983},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{The convergence of sparsified gradient methods}},
  year         = {2018},
}

@article{22206,
  abstract     = {Cools, Draisma, Payne, and Robeva proved that generic metric graphs that are "paths of loops" are Brill-Noether general. We show that Brill-Noether generality does not hold for "trees of loops": the only trees of loops that are Brill-Noether general are paths of loops. We study various notions of generality and examine which of these graphs satisfy them.},
  author       = {Kailasa, Sameer and Kuperberg, Vivian Zieve and Wawrykow, Nicholas},
  issn         = {1077-8926},
  journal      = {The Electronic Journal of Combinatorics},
  keywords     = {Chip-firing, Metric graphs, Brill-Noether generality},
  number       = {1},
  publisher    = {The Electronic Journal of Combinatorics},
  title        = {{Chip-firing on trees of loops}},
  doi          = {10.37236/7244},
  volume       = {25},
  year         = {2018},
}

@article{22210,
  abstract     = {We disclose a method for the synthesis of chiral colloids from spontaneously formed hollow sugar-surfactant microtubes with internally confined mobile colloidal spheres. Key feature of our approach is the grafting of colloid surfaces with photoresponsive coumarin moieties, which allow for UV-induced, covalent clicking of colloids into permanent chains, with morphologies set by the colloid-to-tube diameter ratio. Subsequent dissolution of tube confinement yields aqueous suspensions that comprise bulk quantities of a variety of linear chains, including single helical chains of polystyrene colloids. These colloidal equivalents of chiral (DNA) molecules are intended for microscopic study of chiral dynamics on a single-particle level.},
  author       = {Ouhajji, Samia and van Ravensteijn, Bas G. P. and Fernández-Rico, Carla and Lacina, Kanvaly S. and Philipse, Albert P. and Petukhov, Andrei V.},
  issn         = {1936-086X},
  journal      = {ACS Nano},
  number       = {12},
  pages        = {12089--12095},
  publisher    = {American Chemical Society},
  title        = {{Wet-chemical synthesis of chiral colloids}},
  doi          = {10.1021/acsnano.8b05065},
  volume       = {12},
  year         = {2018},
}

