@article{2852,
  abstract     = {A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length.},
  author       = {Fischlin, Marc and Lehmann, Anja and Pietrzak, Krzysztof Z},
  journal      = {Journal of Cryptology},
  number       = {3},
  pages        = {397 -- 428},
  publisher    = {Springer},
  title        = {{Robust multi-property combiners for hash functions}},
  doi          = {10.1007/s00145-013-9148-7},
  volume       = {27},
  year         = {2014},
}

@inproceedings{2905,
  abstract     = {Persistent homology is a recent grandchild of homology that has found use in
science and engineering as well as in mathematics. This paper surveys the method as well
as the applications, neglecting completeness in favor of highlighting ideas and directions.},
  author       = {Edelsbrunner, Herbert and Morozovy, Dmitriy},
  location     = {Kraków, Poland},
  pages        = {31 -- 50},
  publisher    = {European Mathematical Society Publishing House},
  title        = {{Persistent homology: Theory and practice}},
  doi          = {10.4171/120-1/3},
  year         = {2014},
}

@article{3263,
  abstract     = {Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution.},
  author       = {Tkacik, Gasper and Ghosh, Anandamohan and Schneidman, Elad and Segev, Ronen},
  journal      = {PLoS One},
  number       = {1},
  publisher    = {Public Library of Science},
  title        = {{Adaptation to changes in higher-order stimulus statistics in the salamander retina}},
  doi          = {10.1371/journal.pone.0085841},
  volume       = {9},
  year         = {2014},
}

@inbook{10817,
  abstract     = {The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption.},
  author       = {Günther, David and Reininghaus, Jan and Seidel, Hans-Peter and Weinkauf, Tino},
  booktitle    = {Topological Methods in Data Analysis and Visualization III.},
  editor       = {Bremer, Peer-Timo and Hotz, Ingrid and Pascucci, Valerio and Peikert, Ronald},
  isbn         = {9783319040981},
  issn         = {2197-666X},
  pages        = {135--150},
  publisher    = {Springer Nature},
  title        = {{Notes on the simplification of the Morse-Smale complex}},
  doi          = {10.1007/978-3-319-04099-8_9},
  year         = {2014},
}

@inproceedings{10884,
  abstract     = {We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL  ∗ \X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL  ∗ \X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \X, provided processes cannot choose the directions for sending or receiving the token.
We unify and substantially extend these results by systematically exploring fragments of indexed CTL  ∗ \X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.},
  author       = {Aminof, Benjamin and Jacobs, Swen and Khalimov, Ayrat and Rubin, Sasha},
  booktitle    = {Verification, Model Checking, and Abstract Interpretation},
  isbn         = {9783642540127},
  issn         = {1611-3349},
  location     = {San Diego, CA, United States},
  pages        = {262--281},
  publisher    = {Springer Nature},
  title        = {{Parameterized model checking of token-passing systems}},
  doi          = {10.1007/978-3-642-54013-4_15},
  volume       = {8318},
  year         = {2014},
}

@inproceedings{10885,
  abstract     = {Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.
In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.
We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.},
  author       = {Chatterjee, Krishnendu and Doyen, Laurent and Filiot, Emmanuel and Raskin, Jean-François},
  booktitle    = {VMCAI 2014: Verification, Model Checking, and Abstract Interpretation},
  isbn         = {9783642540127},
  issn         = {1611-3349},
  location     = {San Diego, CA, United States},
  pages        = {78--97},
  publisher    = {Springer Nature},
  title        = {{Doomsday equilibria for omega-regular games}},
  doi          = {10.1007/978-3-642-54013-4_5},
  volume       = {8318},
  year         = {2014},
}

@inproceedings{10886,
  abstract     = {We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set.},
  author       = {Zobel, Valentin and Reininghaus, Jan and Hotz, Ingrid},
  booktitle    = {Topological Methods in Data Analysis and Visualization III },
  isbn         = {9783319040981},
  issn         = {2197-666X},
  pages        = {249--262},
  publisher    = {Springer},
  title        = {{Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature}},
  doi          = {10.1007/978-3-319-04099-8_16},
  year         = {2014},
}

@inproceedings{10892,
  abstract     = {In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.
Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.},
  author       = {Biedl, Therese and Huber, Stefan and Palfrader, Peter},
  booktitle    = {25th International Symposium, ISAAC 2014},
  isbn         = {9783319130743},
  issn         = {1611-3349},
  location     = {Jeonju, Korea},
  pages        = {117--127},
  publisher    = {Springer Nature},
  title        = {{Planar matchings for weighted straight skeletons}},
  doi          = {10.1007/978-3-319-13075-0_10},
  volume       = {8889},
  year         = {2014},
}

@inbook{10893,
  abstract     = {Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data.},
  author       = {Kasten, Jens and Reininghaus, Jan and Reich, Wieland and Scheuermann, Gerik},
  booktitle    = {Topological Methods in Data Analysis and Visualization III },
  editor       = {Bremer, Peer-Timo and Hotz, Ingrid and Pascucci, Valerio and Peikert, Ronald},
  isbn         = {9783319040981},
  issn         = {2197-666X},
  pages        = {55--69},
  publisher    = {Springer},
  title        = {{Toward the extraction of saddle periodic orbits}},
  doi          = {10.1007/978-3-319-04099-8_4},
  volume       = {1},
  year         = {2014},
}

@inproceedings{10894,
  abstract     = {PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations.},
  author       = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan and Wagner, Hubert},
  booktitle    = {ICMS 2014: International Congress on Mathematical Software},
  isbn         = {9783662441985},
  issn         = {1611-3349},
  location     = {Seoul, South Korea},
  pages        = {137--143},
  publisher    = {Springer Berlin Heidelberg},
  title        = {{PHAT – Persistent Homology Algorithms Toolbox}},
  doi          = {10.1007/978-3-662-44199-2_24},
  volume       = {8592},
  year         = {2014},
}

@article{11080,
  abstract     = {The spindle assembly checkpoint prevents separation of sister chromatids until each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report that the nuclear pore complex scaffolds spindle assembly checkpoint signaling in interphase, providing a store of inhibitory signals that limits the speed of the subsequent mitosis.},
  author       = {Buchwalter, Abigail and HETZER, Martin W},
  issn         = {0092-8674},
  journal      = {Cell},
  keywords     = {General Biochemistry, Genetics and Molecular Biology},
  number       = {5},
  pages        = {868--869},
  publisher    = {Elsevier},
  title        = {{Nuclear pores set the speed limit for mitosis}},
  doi          = {10.1016/j.cell.2014.02.004},
  volume       = {156},
  year         = {2014},
}

@article{11081,
  abstract     = {In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope (NE). In metazoans, the NE breaks down in mitosis and it has been assumed that the physical barrier separating nucleoplasm and cytoplasm remains intact during the rest of the cell cycle and cell differentiation. However, recent studies suggest that nonmitotic NE remodeling plays a critical role in development, virus infection, laminopathies, and cancer. Although the mechanisms underlying these NE restructuring events are currently being defined, one common theme is activation of protein kinase C family members in the interphase nucleus to disrupt the nuclear lamina, demonstrating the importance of the lamina in maintaining nuclear integrity.},
  author       = {Hatch, Emily and HETZER, Martin W},
  issn         = {1540-8140},
  journal      = {Journal of Cell Biology},
  keywords     = {Cell Biology},
  number       = {2},
  pages        = {133--141},
  publisher    = {Rockefeller University Press},
  title        = {{Breaching the nuclear envelope in development and disease}},
  doi          = {10.1083/jcb.201402003},
  volume       = {205},
  year         = {2014},
}

@article{11082,
  abstract     = {The nuclear pore complex (NPC) plays a critical role in gene expression by mediating import of transcription regulators into the nucleus and export of RNA transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating transport, a subset of nucleoporins (Nups) engage in transcriptional activation and elongation at genomic loci that are not associated with NPCs. The underlying mechanism and regulation of Nup mobility on and off nuclear pores remain unclear. Here we show that Nup50 is a mobile Nup with a pronounced presence both at the NPC and in the nucleoplasm that can move between these different localizations. Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active transcription by RNA polymerase II and requires the N-terminal half of the protein, which contains importin α– and Nup153-binding domains. However, Nup50 dynamics are independent of importin α, Nup153, and Nup98, even though the latter two proteins also exhibit transcription-dependent mobility. Of interest, depletion of Nup50 from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation into myotubes. Taken together, our results suggest a transport-independent role for Nup50 in chromatin biology that occurs away from the NPC.},
  author       = {Buchwalter, Abigail L. and Liang, Yun and HETZER, Martin W},
  issn         = {1059-1524},
  journal      = {Molecular Biology of the Cell},
  keywords     = {Cell Biology, Molecular Biology},
  number       = {16},
  pages        = {2472--2484},
  publisher    = {American Society for Cell Biology},
  title        = {{Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics}},
  doi          = {10.1091/mbc.e14-04-0865},
  volume       = {25},
  year         = {2014},
}

@article{11582,
  abstract     = {We have observed a sample of typical z ∼ 1 star-forming galaxies, selected from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared, multi-integral field unit instrument on the Very Large Telescope (VLT), in order to obtain their dynamics and metallicity gradients. The majority of our galaxies have a metallicity gradient consistent with being flat or negative (i.e. higher metallicity cores than outskirts). Intriguingly, we find a trend between metallicity gradient and specific star formation rate (sSFR), such that galaxies with a high sSFR tend to have relatively metal poor centres, a result which is strengthened when combined with data sets from the literature. This result appears to explain the discrepancies reported between different high-redshift studies and varying claims for evolution. From a galaxy evolution perspective, the trend we see would mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can be funnelled into its core, triggered either by merging or through efficient accretion. In fact, merging may play a significant role as it is the starburst galaxies at all epochs, which have the more positive metallicity gradients. Our results may help to explain the origin of the fundamental metallicity relation, in which galaxies at a fixed mass are observed to have lower metallicities at higher star formation rates, especially if the metallicity is measured in an aperture encompassing only the central regions of the galaxy. Finally, we note that this study demonstrates the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys.},
  author       = {Stott, John P. and Sobral, David and Swinbank, A. M. and Smail, Ian and Bower, Richard and Best, Philip N. and Sharples, Ray M. and Geach, James E. and Matthee, Jorryt J},
  issn         = {1365-2966},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  keywords     = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: abundances, galaxies: evolution, galaxies: kinematics and dynamics},
  number       = {3},
  pages        = {2695--2704},
  publisher    = {Oxford University Press},
  title        = {{A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS}},
  doi          = {10.1093/mnras/stu1343},
  volume       = {443},
  year         = {2014},
}

@article{11583,
  abstract     = {Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely deep surveys, probing very small areas. As a consequence, candidates are very faint, making spectroscopic confirmation practically impossible. In order to overcome such limitations, we have undertaken the CF-HiZELS survey, which is a large-area, medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα) emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric redshifts and remove a significant amount of dusty lower redshift line-emitters at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked as strong candidates, but the majority have very weak constraints on their spectral energy distributions. Using follow-up observations with SINFONI/VLT, we are able to exclude the most robust candidates as LAEs. We put a strong constraint on the Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and future surveys. Our results show that surveys for the highest redshift LAEs are susceptible of multiple contaminations and that spectroscopic follow-up is absolutely necessary.},
  author       = {Matthee, Jorryt J and Sobral, David and Swinbank, A. M. and Smail, Ian and Best, P. N. and Kim, Jae-Woo and Franx, Marijn and Milvang-Jensen, Bo and Fynbo, Johan},
  issn         = {1365-2966},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  keywords     = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: evolution, galaxies: high-redshift, cosmology: observations, dark ages, reionization, first stars},
  number       = {3},
  pages        = {2375--2387},
  publisher    = {Oxford University Press},
  title        = {{A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys}},
  doi          = {10.1093/mnras/stu392},
  volume       = {440},
  year         = {2014},
}

@article{11750,
  abstract     = {We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find a significant increase in the magnetic susceptibility in our sample when compared with the values previously reported for the polycrystalline sample. The pronounced Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole. In the intrinsic conductivity region, the susceptibility due to free carriers shows thermally activated behavior and is consistent with the data reported for single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic susceptibility in our sample comes mainly from a small amount of unreacted Fe, the contribution from the enhanced carrier density due to lattice and strain defects arising from the ball milling process is also significant. Existence of an unreacted Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300 K.},
  author       = {Pokharel, Mani and Zhao, Huaizhou and Modic, Kimberly A and Ren, Zhifeng and Opeil, Cyril},
  issn         = {1941-0069},
  journal      = {IEEE Transactions on Magnetics},
  number       = {5},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Magnetic properties of hot-pressed FeSb2}},
  doi          = {10.1109/TMAG.2013.2292607},
  volume       = {50},
  year         = {2014},
}

@inproceedings{11789,
  abstract     = {We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.

We identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.

A tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal.},
  author       = {Charikar, Moses and Henzinger, Monika H and Nguyễn, Huy L.},
  booktitle    = {22nd Annual European Symposium on Algorithms},
  isbn         = {978-366244776-5},
  issn         = {0302-9743},
  location     = {Wroclaw, Poland},
  pages        = {260 -- 271},
  publisher    = {Springer Nature},
  title        = {{Online bipartite matching with decomposable weights}},
  doi          = {10.1007/978-3-662-44777-2_22},
  volume       = {8737},
  year         = {2014},
}

@inproceedings{11790,
  abstract     = {Assume a seller wants to sell a digital product in a social network where a buyer’s valuation of the item has positive network externalities from her neighbors that already have the item. The goal of the seller is to maximize his revenue. Previous work on this problem [7] studies the case where clients are offered the item in sequence and have to pay personalized prices. This is highly infeasible in large scale networks such as the Facebook graph: (1) Offering items to the clients one after the other consumes a large amount of time, and (2) price-discrimination of clients could appear unfair to them and result in negative client reaction or could conflict with legal requirements.

We study a setting dealing with these issues. Specifically, the item is offered in parallel to multiple clients at the same time and at the same price. This is called a round. We show that with O(logn) rounds, where n is the number of clients, a constant factor of the revenue with price discrimination can be achieved and that this is not possible with o(logn) rounds. Moreover we show that it is APX-hard to maximize the revenue and we give constant factor approximation algorithms for various further settings of limited price discrimination.},
  author       = {Cigler, Luděk and Dvořák, Wolfgang and Henzinger, Monika H and Starnberger, Martin},
  booktitle    = {10th International Conference of Web and Internet Economics},
  issn         = {0302-9743},
  location     = {Beijing, China},
  pages        = {44 -- 57},
  publisher    = {Springer Nature},
  title        = {{Limiting price discrimination when selling products with positive network externalities}},
  doi          = {10.1007/978-3-319-13129-0_4},
  volume       = {8877},
  year         = {2014},
}

@article{118,
  abstract     = {While the penetration of objects into granular media is well-studied, there is little understanding of how objects settle in gravities, geff, different from that of Earth - a scenario potentially relevant to the geomorphology of planets and asteroids and also to their exploration using man-made devices. By conducting experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2 g. Surprisingly, we find that the rest depth is independent of geff and also that the time required for the object to come to rest scales like geff-1/2. With discrete element modeling simulations, we reproduce the experimental results and extend the range of geff to objects as small as asteroids and as large as Jupiter. Our results shed light on the initial stage of sedimentation into dry granular media across a range of celestial bodies and also have implications for the design of man-made, extraterrestrial vehicles and structures. Key Points The settling depth in granular media is independent of gravity The settling time scales like g-1/2 Layering driven by granular sedimentation should be similar.},
  author       = {Altshuler, Ernesto and Torres, H and González_Pita, A and Sánchez, Colina G and Pérez Penichet, Carlos and Waitukaitis, Scott R and Hidalgo, Rauól},
  journal      = {Geophysical Research Letters},
  number       = {9},
  pages        = {3032 -- 3037},
  publisher    = {Wiley-Blackwell},
  title        = {{Settling into dry granular media in different gravities}},
  doi          = {10.1002/2014GL059229},
  volume       = {41},
  year         = {2014},
}

@inproceedings{11855,
  abstract     = {The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log W) time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {55th Annual Symposium on Foundations of Computer Science},
  issn         = {0272-5428},
  location     = {Philadelphia, PA, United States},
  pages        = {146--155},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Decremental single-source shortest paths on undirected graphs in near-linear total update time}},
  doi          = {10.1109/focs.2014.24},
  year         = {2014},
}