[{"title":"Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus","status":"public","intvolume":" 522","_id":"2064","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"We examined the synaptic structure, quantity, and distribution of α-amino-3-hydroxy-5-methylisoxazole-4-propionic acid (AMPA)- and N-methyl-D-aspartate (NMDA)-type glutamate receptors (AMPARs and NMDARs, respectively) in rat cochlear nuclei by a highly sensitive freeze-fracture replica labeling technique. Four excitatory synapses formed by two distinct inputs, auditory nerve (AN) and parallel fibers (PF), on different cell types were analyzed. These excitatory synapse types included AN synapses on bushy cells (AN-BC synapses) and fusiform cells (AN-FC synapses) and PF synapses on FC (PF-FC synapses) and cartwheel cell spines (PF-CwC synapses). Immunogold labeling revealed differences in synaptic structure as well as AMPAR and NMDAR number and/or density in both AN and PF synapses, indicating a target-dependent organization. The immunogold receptor labeling also identified differences in the synaptic organization of FCs based on AN or PF connections, indicating an input-dependent organization in FCs. Among the four excitatory synapse types, the AN-BC synapses were the smallest and had the most densely packed intramembrane particles (IMPs), whereas the PF-CwC synapses were the largest and had sparsely packed IMPs. All four synapse types showed positive correlations between the IMP-cluster area and the AMPAR number, indicating a common intrasynapse-type relationship for glutamatergic synapses. Immunogold particles for AMPARs were distributed over the entire area of individual AN synapses; PF synapses often showed synaptic areas devoid of labeling. The gold-labeling for NMDARs occurred in a mosaic fashion, with less positive correlations between the IMP-cluster area and the NMDAR number. Our observations reveal target- and input-dependent features in the structure, number, and organization of AMPARs and NMDARs in AN and PF synapses.","lang":"eng"}],"issue":"18","page":"4023 - 4042","publication":"Journal of Comparative Neurology","citation":{"ama":"Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus. Journal of Comparative Neurology. 2014;522(18):4023-4042. doi:10.1002/cne.23654","apa":"Rubio, M., Fukazawa, Y., Kamasawa, N., Clarkson, C., Molnár, E., & Shigemoto, R. (2014). Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus. Journal of Comparative Neurology. Wiley-Blackwell. https://doi.org/10.1002/cne.23654","ieee":"M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, and R. Shigemoto, “Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus,” Journal of Comparative Neurology, vol. 522, no. 18. Wiley-Blackwell, pp. 4023–4042, 2014.","ista":"Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. 2014. Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus. Journal of Comparative Neurology. 522(18), 4023–4042.","short":"M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, R. Shigemoto, Journal of Comparative Neurology 522 (2014) 4023–4042.","mla":"Rubio, Maía, et al. “Target- and Input-Dependent Organization of AMPA and NMDA Receptors in Synaptic Connections of the Cochlear Nucleus.” Journal of Comparative Neurology, vol. 522, no. 18, Wiley-Blackwell, 2014, pp. 4023–42, doi:10.1002/cne.23654.","chicago":"Rubio, Maía, Yugo Fukazawa, Naomi Kamasawa, Cheryl Clarkson, Elek Molnár, and Ryuichi Shigemoto. “Target- and Input-Dependent Organization of AMPA and NMDA Receptors in Synaptic Connections of the Cochlear Nucleus.” Journal of Comparative Neurology. Wiley-Blackwell, 2014. https://doi.org/10.1002/cne.23654."},"date_published":"2014-07-29T00:00:00Z","scopus_import":1,"day":"29","publication_status":"published","publisher":"Wiley-Blackwell","department":[{"_id":"RySh"}],"acknowledgement":"National Institutes of Health (NIH) Grant Number: 1R01DC013048‐0; Biotechnology and Biological Sciences Research Council, UK Grant Number: BB/J015938/1\r\n","year":"2014","date_updated":"2021-01-12T06:55:05Z","date_created":"2018-12-11T11:55:30Z","volume":522,"author":[{"full_name":"Rubio, Maía","first_name":"Maía","last_name":"Rubio"},{"full_name":"Fukazawa, Yugo","last_name":"Fukazawa","first_name":"Yugo"},{"full_name":"Kamasawa, Naomi","last_name":"Kamasawa","first_name":"Naomi"},{"full_name":"Clarkson, Cheryl","first_name":"Cheryl","last_name":"Clarkson"},{"full_name":"Molnár, Elek","first_name":"Elek","last_name":"Molnár"},{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4974","quality_controlled":"1","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4198489/","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1002/cne.23654","month":"07"},{"article_number":"63","type":"conference","abstract":[{"text":"We propose an interactive, optimization-in-the-loop tool for designing inflatable structures. Given a target shape, the user draws a network of seams defining desired segment boundaries in 3D. Our method computes optimally-shaped flat panels for the segments, such that the inflated structure is as close as possible to the target while satisfying the desired seam positions. Our approach is underpinned by physics-based pattern optimization, accurate coarse-scale simulation using tension field theory, and a specialized constraint-optimization method. Our system is fast enough to warrant interactive exploration of different seam layouts, including internal connections, and their effects on the inflated shape. We demonstrate the resulting design process on a varied set of simulation examples, some of which we have fabricated, demonstrating excellent agreement with the design intent.","lang":"eng"}],"publist_id":"4957","issue":"4","extern":"1","_id":"2081","year":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was partly funded by the NCCR Co-Me of the Swiss NSF.","status":"public","title":"Designing inflatable structures","publication_status":"published","publisher":"ACM","intvolume":" 33","author":[{"full_name":"Skouras, Mélina","last_name":"Skouras","first_name":"Mélina"},{"first_name":"Bernhard","last_name":"Thomaszewski","full_name":"Thomaszewski, Bernhard"},{"full_name":"Kaufmann, Peter","last_name":"Kaufmann","first_name":"Peter"},{"last_name":"Garg","first_name":"Akash","full_name":"Garg, Akash"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"last_name":"Grinspun","first_name":"Eitan","full_name":"Grinspun, Eitan"},{"first_name":"Markus","last_name":"Gross","full_name":"Gross, Markus"}],"date_created":"2018-12-11T11:55:36Z","date_updated":"2021-01-12T06:55:11Z","volume":33,"oa_version":"None","day":"01","month":"07","citation":{"ieee":"M. Skouras et al., “Designing inflatable structures,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2014, vol. 33, no. 4.","apa":"Skouras, M., Thomaszewski, B., Kaufmann, P., Garg, A., Bickel, B., Grinspun, E., & Gross, M. (2014). Designing inflatable structures (Vol. 33). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM. https://doi.org/10.1145/2601097.2601166","ista":"Skouras M, Thomaszewski B, Kaufmann P, Garg A, Bickel B, Grinspun E, Gross M. 2014. Designing inflatable structures. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 33, 63.","ama":"Skouras M, Thomaszewski B, Kaufmann P, et al. Designing inflatable structures. In: Vol 33. ACM; 2014. doi:10.1145/2601097.2601166","chicago":"Skouras, Mélina, Bernhard Thomaszewski, Peter Kaufmann, Akash Garg, Bernd Bickel, Eitan Grinspun, and Markus Gross. “Designing Inflatable Structures,” Vol. 33. ACM, 2014. https://doi.org/10.1145/2601097.2601166.","short":"M. Skouras, B. Thomaszewski, P. Kaufmann, A. Garg, B. Bickel, E. Grinspun, M. Gross, in:, ACM, 2014.","mla":"Skouras, Mélina, et al. Designing Inflatable Structures. Vol. 33, no. 4, 63, ACM, 2014, doi:10.1145/2601097.2601166."},"conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"date_published":"2014-07-01T00:00:00Z","doi":"10.1145/2601097.2601166","language":[{"iso":"eng"}]},{"extern":1,"issue":"4","publist_id":"4958","abstract":[{"lang":"eng","text":"Spinning tops and yo-yos have long fascinated cultures around the world with their unexpected, graceful motions that seemingly elude gravity. We present an algorithm to generate designs for spinning objects by optimizing rotational dynamics properties. As input, the user provides a solid 3D model and a desired axis of rotation. Our approach then modifies the mass distribution such that the principal directions of the moment of inertia align with the target rotation frame. We augment the model by creating voids inside its volume, with interior fill represented by an adaptive multi-resolution vox-elization. The discrete voxel fill values are optimized using a continuous, nonlinear formulation. Further, we optimize for rotational stability by maximizing the dominant principal moment. We extend our technique to incorporate deformation and multiple materials for cases where internal voids alone are insufficient. Our method is well-suited for a variety of 3D printed models, ranging from characters to abstract shapes. We demonstrate tops and yo-yos that spin surprisingly stably despite their asymmetric appearance. "}],"type":"conference","volume":33,"date_updated":"2019-04-26T07:22:07Z","date_created":"2018-12-11T11:55:35Z","author":[{"first_name":"Moritz","last_name":"Bac̈Her","full_name":"Bac̈her, Moritz"},{"full_name":"Whiting, Emily","first_name":"Emily","last_name":"Whiting"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"full_name":"Sorkine-Hornung, Olga","first_name":"Olga","last_name":"Sorkine Hornung"}],"intvolume":" 33","publisher":"ACM","title":"Spin-It: Optimizing moment of inertia for spinnable objects","publication_status":"published","status":"public","acknowledgement":"This project was supported in part by the ERC Starting Grant iModel (StG-2012-306877). Emily Whiting is supported by the ETH Zurich / Marie Curie COFUND Postdoctoral Fellowship.","_id":"2080","year":"2014","day":"01","month":"01","date_published":"2014-01-01T00:00:00Z","doi":"10.1145/2601097.2601157","conference":{"name":"SIGGRAPH: 41st International Conference and Exhibition on Computer Graphics and Interactive Techniques"},"quality_controlled":0,"citation":{"mla":"Bac̈Her, Moritz, et al. Spin-It: Optimizing Moment of Inertia for Spinnable Objects. Vol. 33, no. 4, ACM, 2014, doi:10.1145/2601097.2601157.","short":"M. Bac̈Her, E. Whiting, B. Bickel, O. Sorkine Hornung, in:, ACM, 2014.","chicago":"Bac̈Her, Moritz, Emily Whiting, Bernd Bickel, and Olga Sorkine Hornung. “Spin-It: Optimizing Moment of Inertia for Spinnable Objects,” Vol. 33. ACM, 2014. https://doi.org/10.1145/2601097.2601157.","ama":"Bac̈Her M, Whiting E, Bickel B, Sorkine Hornung O. Spin-It: Optimizing moment of inertia for spinnable objects. In: Vol 33. ACM; 2014. doi:10.1145/2601097.2601157","ista":"Bac̈Her M, Whiting E, Bickel B, Sorkine Hornung O. 2014. Spin-It: Optimizing moment of inertia for spinnable objects. SIGGRAPH: 41st International Conference and Exhibition on Computer Graphics and Interactive Techniques vol. 33.","ieee":"M. Bac̈Her, E. Whiting, B. Bickel, and O. Sorkine Hornung, “Spin-It: Optimizing moment of inertia for spinnable objects,” presented at the SIGGRAPH: 41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, 2014, vol. 33, no. 4.","apa":"Bac̈Her, M., Whiting, E., Bickel, B., & Sorkine Hornung, O. (2014). Spin-It: Optimizing moment of inertia for spinnable objects (Vol. 33). Presented at the SIGGRAPH: 41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM. https://doi.org/10.1145/2601097.2601157"}},{"doi":"10.1145/2546276","date_published":"2014-03-01T00:00:00Z","publication":"ACM Transactions on Graphics","citation":{"ista":"Bermano A, Bradley D, Beeler T, Zund F, Nowrouzezahrai D, Baran I, Sorkine Hornung O, Pfister H, Sumner R, Bickel B, Groß M. 2014. Facial performance enhancement using dynamic shape space analysis. ACM Transactions on Graphics. 33(2).","apa":"Bermano, A., Bradley, D., Beeler, T., Zund, F., Nowrouzezahrai, D., Baran, I., … Groß, M. (2014). Facial performance enhancement using dynamic shape space analysis. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2546276","ieee":"A. Bermano et al., “Facial performance enhancement using dynamic shape space analysis,” ACM Transactions on Graphics, vol. 33, no. 2. ACM, 2014.","ama":"Bermano A, Bradley D, Beeler T, et al. Facial performance enhancement using dynamic shape space analysis. ACM Transactions on Graphics. 2014;33(2). doi:10.1145/2546276","chicago":"Bermano, Amit, Derek Bradley, Thabo Beeler, Fabio Zund, Derek Nowrouzezahrai, Ilya Baran, Olga Sorkine Hornung, et al. “Facial Performance Enhancement Using Dynamic Shape Space Analysis.” ACM Transactions on Graphics. ACM, 2014. https://doi.org/10.1145/2546276.","mla":"Bermano, Amit, et al. “Facial Performance Enhancement Using Dynamic Shape Space Analysis.” ACM Transactions on Graphics, vol. 33, no. 2, ACM, 2014, doi:10.1145/2546276.","short":"A. Bermano, D. Bradley, T. Beeler, F. Zund, D. Nowrouzezahrai, I. Baran, O. Sorkine Hornung, H. Pfister, R. Sumner, B. Bickel, M. Groß, ACM Transactions on Graphics 33 (2014)."},"quality_controlled":0,"day":"01","month":"03","author":[{"full_name":"Bermano, Amit H","last_name":"Bermano","first_name":"Amit"},{"first_name":"Derek","last_name":"Bradley","full_name":"Bradley, Derek J"},{"last_name":"Beeler","first_name":"Thabo","full_name":"Beeler, Thabo"},{"last_name":"Zund","first_name":"Fabio","full_name":"Zund, Fabio"},{"first_name":"Derek","last_name":"Nowrouzezahrai","full_name":"Nowrouzezahrai, Derek"},{"full_name":"Baran, Ilya","last_name":"Baran","first_name":"Ilya"},{"full_name":"Sorkine-Hornung, Olga","last_name":"Sorkine Hornung","first_name":"Olga"},{"last_name":"Pfister","first_name":"Hanspeter","full_name":"Pfister, Hanspeter"},{"full_name":"Sumner, Robert W","first_name":"Robert","last_name":"Sumner"},{"full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd"},{"full_name":"Groß, Markus S","last_name":"Groß","first_name":"Markus"}],"date_updated":"2021-01-12T06:55:24Z","date_created":"2018-12-11T11:55:48Z","volume":33,"_id":"2115","year":"2014","publication_status":"published","title":"Facial performance enhancement using dynamic shape space analysis","status":"public","intvolume":" 33","publisher":"ACM","abstract":[{"text":"The facial performance of an individual is inherently rich in subtle deformation and timing details. Although these subtleties make the performance realistic and compelling, they often elude both motion capture and hand animation. We present a technique for adding fine-scale details and expressiveness to low-resolution art-directed facial performances, such as those created manually using a rig, via marker-based capture, by fitting a morphable model to a video, or through Kinect reconstruction using recent faceshift technology. We employ a high-resolution facial performance capture system to acquire a representative performance of an individual in which he or she explores the full range of facial expressiveness. From the captured data, our system extracts an expressiveness model that encodes subtle spatial and temporal deformation details specific to that particular individual. Once this model has been built, these details can be transferred to low-resolution art-directed performances. We demonstrate results on various forms of input; after our enhancement, the resulting animations exhibit the same nuances and fine spatial details as the captured performance, with optional temporal enhancement to match the dynamics of the actor. Finally, we show that our technique outperforms the current state-of-the-art in example-based facial animation.","lang":"eng"}],"issue":"2","publist_id":"4919","extern":1,"type":"journal_article"},{"page":"887 - 926","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1203.5377 "}],"citation":{"short":"E. Carlen, J. Maas, Communications in Mathematical Physics 331 (2014) 887–926.","mla":"Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow for the Entropy.” Communications in Mathematical Physics, vol. 331, no. 3, Springer, 2014, pp. 887–926, doi:10.1007/s00220-014-2124-8.","chicago":"Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow for the Entropy.” Communications in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s00220-014-2124-8.","ama":"Carlen E, Maas J. An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. Communications in Mathematical Physics. 2014;331(3):887-926. doi:10.1007/s00220-014-2124-8","apa":"Carlen, E., & Maas, J. (2014). An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-014-2124-8","ieee":"E. Carlen and J. Maas, “An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy,” Communications in Mathematical Physics, vol. 331, no. 3. Springer, pp. 887–926, 2014.","ista":"Carlen E, Maas J. 2014. An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. Communications in Mathematical Physics. 331(3), 887–926."},"publication":"Communications in Mathematical Physics","language":[{"iso":"eng"}],"date_published":"2014-11-01T00:00:00Z","doi":"10.1007/s00220-014-2124-8","month":"11","day":"01","publisher":"Springer","intvolume":" 331","status":"public","title":"An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2133","year":"2014","volume":331,"oa_version":"Submitted Version","date_created":"2018-12-11T11:55:54Z","date_updated":"2021-01-12T06:55:30Z","author":[{"first_name":"Eric","last_name":"Carlen","full_name":"Carlen, Eric"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas","full_name":"Maas, Jan"}],"type":"journal_article","extern":"1","issue":"3","publist_id":"4901","abstract":[{"lang":"eng","text":"Let ℭ denote the Clifford algebra over ℝ𝑛, which is the von Neumann algebra generated by n self-adjoint operators Q j , j = 1,…,n satisfying the canonical anticommutation relations, Q i Q j + Q j Q i = 2δ ij I, and let τ denote the normalized trace on ℭ. This algebra arises in quantum mechanics as the algebra of observables generated by n fermionic degrees of freedom. Let 𝔓 denote the set of all positive operators 𝜌∈ℭ such that τ(ρ) = 1; these are the non-commutative analogs of probability densities in the non-commutative probability space (ℭ,𝜏). The fermionic Fokker–Planck equation is a quantum-mechanical analog of the classical Fokker–Planck equation with which it has much in common, such as the same optimal hypercontractivity properties. In this paper we construct a Riemannian metric on 𝔓 that we show to be a natural analog of the classical 2-Wasserstein metric, and we show that, in analogy with the classical case, the fermionic Fokker–Planck equation is gradient flow in this metric for the relative entropy with respect to the ground state. We derive a number of consequences of this, such as a sharp Talagrand inequality for this metric, and we prove a number of results pertaining to this metric. Several open problems are raised."}]},{"type":"journal_article","publist_id":"4902","issue":"5","abstract":[{"text":"We study approximations to a class of vector-valued equations of Burgers type driven by a multiplicative space-time white noise. A solution theory for this class of equations has been developed recently in Probability Theory Related Fields by Hairer and Weber. The key idea was to use the theory of controlled rough paths to give definitions of weak/mild solutions and to set up a Picard iteration argument. In this article the limiting behavior of a rather large class of (spatial) approximations to these equations is studied. These approximations are shown to converge and convergence rates are given, but the limit may depend on the particular choice of approximation. This effect is a spatial analogue to the Itô-Stratonovich correction in the theory of stochastic ordinary differential equations, where it is well known that different approximation schemes may converge to different solutions.","lang":"eng"}],"extern":1,"year":"2014","_id":"2131","acknowledgement":"JM is supported by Rubicon grant 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). MH is supported by EPSRC grant EP/D071593/1 and by the Royal Society through a Wolfson Research Merit Award. Both MH and HW are supported by the Le","publisher":"Wiley-Blackwell","intvolume":" 67","publication_status":"published","title":"Approximating Rough Stochastic PDEs","status":"public","author":[{"full_name":"Hairer, Martin M","last_name":"Hairer","first_name":"Martin"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas","full_name":"Jan Maas"},{"first_name":"Hendrik","last_name":"Weber","full_name":"Weber, Hendrik"}],"volume":67,"date_created":"2018-12-11T11:55:53Z","date_updated":"2021-01-12T06:55:30Z","month":"05","day":"01","citation":{"ama":"Hairer M, Maas J, Weber H. Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. 2014;67(5):776-870. doi:10.1002/cpa.21495","ista":"Hairer M, Maas J, Weber H. 2014. Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. 67(5), 776–870.","ieee":"M. Hairer, J. Maas, and H. Weber, “Approximating Rough Stochastic PDEs,” Communications on Pure and Applied Mathematics, vol. 67, no. 5. Wiley-Blackwell, pp. 776–870, 2014.","apa":"Hairer, M., Maas, J., & Weber, H. (2014). Approximating Rough Stochastic PDEs. Communications on Pure and Applied Mathematics. Wiley-Blackwell. https://doi.org/10.1002/cpa.21495","mla":"Hairer, Martin, et al. “Approximating Rough Stochastic PDEs.” Communications on Pure and Applied Mathematics, vol. 67, no. 5, Wiley-Blackwell, 2014, pp. 776–870, doi:10.1002/cpa.21495.","short":"M. Hairer, J. Maas, H. Weber, Communications on Pure and Applied Mathematics 67 (2014) 776–870.","chicago":"Hairer, Martin, Jan Maas, and Hendrik Weber. “Approximating Rough Stochastic PDEs.” Communications on Pure and Applied Mathematics. Wiley-Blackwell, 2014. https://doi.org/10.1002/cpa.21495."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.3094 "}],"oa":1,"publication":"Communications on Pure and Applied Mathematics","page":"776 - 870","quality_controlled":0,"doi":"10.1002/cpa.21495","date_published":"2014-05-01T00:00:00Z"},{"issue":"4","publist_id":"4903","abstract":[{"text":"We consider discrete porous medium equations of the form ∂tρt=Δϕ(ρt), where Δ is the generator of a reversible continuous time Markov chain on a finite set χ, and ϕ is an increasing function. We show that these equations arise as gradient flows of certain entropy functionals with respect to suitable non-local transportation metrics. This may be seen as a discrete analogue of the Wasserstein gradient flow structure for porous medium equations in ℝn discovered by Otto. We present a one-dimensional counterexample to geodesic convexity and discuss Gromov-Hausdorff convergence to the Wasserstein metric.","lang":"eng"}],"extern":1,"type":"journal_article","author":[{"full_name":"Erbar, Matthias","last_name":"Erbar","first_name":"Matthias"},{"full_name":"Jan Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"}],"volume":34,"date_updated":"2021-01-12T06:55:30Z","date_created":"2018-12-11T11:55:54Z","year":"2014","_id":"2132","intvolume":" 34","publisher":"Southwest Missouri State University","title":"Gradient flow structures for discrete porous medium equations","status":"public","publication_status":"published","day":"01","month":"04","date_published":"2014-04-01T00:00:00Z","doi":"10.3934/dcds.2014.34.1355 ","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1212.1129","open_access":"1"}],"citation":{"short":"M. Erbar, J. Maas, Discrete and Continuous Dynamical Systems- Series A 34 (2014) 1355–1374.","mla":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” Discrete and Continuous Dynamical Systems- Series A, vol. 34, no. 4, Southwest Missouri State University, 2014, pp. 1355–74, doi:10.3934/dcds.2014.34.1355 .","chicago":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” Discrete and Continuous Dynamical Systems- Series A. Southwest Missouri State University, 2014. https://doi.org/10.3934/dcds.2014.34.1355 .","ama":"Erbar M, Maas J. Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. 2014;34(4):1355-1374. doi:10.3934/dcds.2014.34.1355 ","apa":"Erbar, M., & Maas, J. (2014). Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. Southwest Missouri State University. https://doi.org/10.3934/dcds.2014.34.1355 ","ieee":"M. Erbar and J. Maas, “Gradient flow structures for discrete porous medium equations,” Discrete and Continuous Dynamical Systems- Series A, vol. 34, no. 4. Southwest Missouri State University, pp. 1355–1374, 2014.","ista":"Erbar M, Maas J. 2014. Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. 34(4), 1355–1374."},"publication":"Discrete and Continuous Dynamical Systems- Series A","page":"1355 - 1374","quality_controlled":0},{"extern":"1","issue":"7","publist_id":"4884","abstract":[{"lang":"eng","text":"We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein condensates with non-local interactions. The scheme relies on the use of momentum-dependent dark-states in close analogy to velocity-selective coherent population trapping. During the short-time dissipative dynamics, the system is driven into a particular finite-momentum phonon mode, which in real space corresponds to an ordered structure with non-local density-density correlations. Dissipation-induced ordering can be observed and studied in present-day experiments using cold atoms with dipole-dipole or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering does not require artificial breaking of translational symmetry by an opticallattice or harmonic trap. This opens up a perspective of direct cooling of quantum gases into strongly-interacting phases."}],"type":"journal_article","article_number":"070401","oa_version":"Submitted Version","volume":113,"date_updated":"2021-01-12T06:55:33Z","date_created":"2018-12-11T11:55:56Z","author":[{"last_name":"Otterbach","first_name":"Johannes","full_name":"Otterbach, Johannes"},{"full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"intvolume":" 113","publisher":"American Physical Society","status":"public","publication_status":"published","title":"Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates","year":"2014","_id":"2140","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.","day":"11","month":"08","language":[{"iso":"eng"}],"date_published":"2014-08-11T00:00:00Z","doi":"10.1103/PhysRevLett.113.070401","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1308.5905","open_access":"1"}],"citation":{"ama":"Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401","ieee":"J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol. 113, no. 7. American Physical Society, 2014.","apa":"Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401","ista":"Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.","short":"J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).","mla":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters, vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401.","chicago":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401."},"publication":"Physical Review Letters"},{"day":"01","month":"06","scopus_import":1,"conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","start_date":"2014-06-08","end_date":"2014-06-11"},"doi":"10.1145/2582112.2582168","date_published":"2014-06-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","main_file_link":[{"url":"http://arxiv.org/abs/1311.3681","open_access":"1"}],"citation":{"ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:355-364. doi:10.1145/2582112.2582168","apa":"Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In Proceedings of the Annual Symposium on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 355–364.","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168."},"oa":1,"quality_controlled":"1","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems"}],"page":"355 - 364","abstract":[{"text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s).","lang":"eng"}],"ec_funded":1,"publist_id":"4853","type":"conference","author":[{"orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"last_name":"Lesnick","first_name":"Michael","full_name":"Lesnick, Michael"}],"date_created":"2018-12-11T11:56:01Z","date_updated":"2021-01-12T06:55:38Z","oa_version":"Submitted Version","_id":"2153","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2014","status":"public","title":"Induced matchings of barcodes and the algebraic stability of persistence","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"ACM"},{"date_published":"2014-07-01T00:00:00Z","citation":{"ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.","apa":"Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7","ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 52(1), 1–33.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9584-7.","short":"J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.","mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:10.1007/s00454-014-9584-7."},"publication":"Discrete & Computational Geometry","page":"1 - 33","day":"01","scopus_import":1,"oa_version":"Submitted Version","_id":"2154","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 52","status":"public","title":"On Gromov's method of selecting heavily covered points","issue":"1","abstract":[{"text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd > 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd.","lang":"eng"}],"type":"journal_article","doi":"10.1007/s00454-014-9584-7","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1102.3515"}],"oa":1,"project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","month":"07","author":[{"full_name":"Matoušek, Jiří","last_name":"Matoušek","first_name":"Jiří"},{"full_name":"Wagner, Uli","first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568"}],"volume":52,"date_updated":"2021-01-12T06:55:38Z","date_created":"2018-12-11T11:56:01Z","acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","year":"2014","department":[{"_id":"UlWa"}],"publisher":"Springer","publication_status":"published","publist_id":"4852"},{"publication_status":"published","publisher":"ACM","department":[{"_id":"HeEd"}],"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","year":"2014","date_updated":"2021-01-12T06:55:39Z","date_created":"2018-12-11T11:56:02Z","author":[{"orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"full_name":"Ge, Xiaoyin","last_name":"Ge","first_name":"Xiaoyin"},{"last_name":"Wang","first_name":"Yusu","full_name":"Wang, Yusu"}],"publist_id":"4850","ec_funded":1,"quality_controlled":"1","project":[{"name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.2839"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11","start_date":"2014-06-08","location":"Kyoto, Japan"},"doi":"10.1145/2582112.2582169","month":"06","status":"public","title":"Measuring distance between Reeb graphs","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2156","oa_version":"Submitted Version","type":"conference","abstract":[{"lang":"eng","text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s)."}],"page":"464 - 473","publication":"Proceedings of the Annual Symposium on Computational Geometry","citation":{"short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73, doi:10.1145/2582112.2582169.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In Proceedings of the Annual Symposium on Computational Geometry, 464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 464–473.","apa":"Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473."},"date_published":"2014-06-01T00:00:00Z","scopus_import":1,"day":"01"},{"oa_version":"Submitted Version","status":"public","title":"The morse theory of Čech and Delaunay filtrations","_id":"2155","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s)."}],"type":"conference","date_published":"2014-06-01T00:00:00Z","page":"484 - 490","publication":"Proceedings of the Annual Symposium on Computational Geometry","citation":{"apa":"Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 484–490.","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:484-490. doi:10.1145/2582112.2582167","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167."},"day":"01","scopus_import":1,"date_updated":"2021-01-12T06:55:38Z","date_created":"2018-12-11T11:56:01Z","author":[{"full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"publication_status":"published","publisher":"ACM","department":[{"_id":"HeEd"}],"acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","year":"2014","ec_funded":1,"publist_id":"4851","language":[{"iso":"eng"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11","location":"Kyoto, Japan","start_date":"2014-06-08"},"doi":"10.1145/2582112.2582167","quality_controlled":"1","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}],"month":"06"},{"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/"}],"oa":1,"external_id":{"pmid":["24959970"]},"quality_controlled":"1","doi":"10.1016/j.ceb.2014.05.010","language":[{"iso":"eng"}],"month":"10","acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","year":"2014","pmid":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"MiSi"}],"author":[{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"first_name":"Carole","last_name":"Parent","full_name":"Parent, Carole"}],"date_created":"2018-12-11T11:56:03Z","date_updated":"2021-01-12T06:55:40Z","volume":30,"publist_id":"4848","publication":"Current Opinion in Cell Biology","citation":{"ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 2014;30(1):33-40. doi:10.1016/j.ceb.2014.05.010","ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40.","apa":"Majumdar, R., Sixt, M. K., & Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2014.05.010","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” Current Opinion in Cell Biology, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.","mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:10.1016/j.ceb.2014.05.010.","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40.","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology. Elsevier, 2014. https://doi.org/10.1016/j.ceb.2014.05.010."},"page":"33 - 40","date_published":"2014-10-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2158","status":"public","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","intvolume":" 30","oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context.","lang":"eng"}],"issue":"1"},{"status":"public","publication_status":"published","title":"Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling","intvolume":" 51","publisher":"Elsevier","_id":"2165","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2014","date_updated":"2021-01-12T06:55:43Z","date_created":"2018-12-11T11:56:05Z","oa_version":"Submitted Version","volume":51,"author":[{"full_name":"Morvant, Emilie","last_name":"Morvant","first_name":"Emilie","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"In machine learning, the domain adaptation problem arrives when the test (tar-get) and the train (source) data are generated from different distributions. A key applied issue is thus the design of algorithms able to generalize on a new distribution, for which we have no label information. We focus on learning classification models defined as a weighted majority vote over a set of real-valued functions. In this context, Germain et al. (2013) have shown that a measure of disagreement between these functions is crucial to control. The core of this measure is a theoretical bound—the C-bound (Lacasse et al., 2007)—which involves the disagreement and leads to a well performing majority vote learn-ing algorithm in usual non-adaptative supervised setting: MinCq. In this work,we propose a framework to extend MinCq to a domain adaptation scenario.This procedure takes advantage of the recent perturbed variation divergence between distributions proposed by Harel and Mannor (2012). Justified by a theoretical bound on the target risk of the vote, we provide to MinCq a tar-get sample labeled thanks to a perturbed variation-based self-labeling focused on the regions where the source and target marginals appear similar. We also study the influence of our self-labeling, from which we deduce an original process for tuning the hyperparameters. Finally, our framework called PV-MinCq shows very promising results on a rotation and translation synthetic problem."}],"ec_funded":1,"publist_id":"4819","quality_controlled":"1","page":"37-43","project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"publication":"Pattern Recognition Letters","citation":{"mla":"Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” Pattern Recognition Letters, vol. 51, Elsevier, 2014, pp. 37–43, doi:10.1016/j.patrec.2014.08.013.","short":"E. Morvant, Pattern Recognition Letters 51 (2014) 37–43.","chicago":"Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” Pattern Recognition Letters. Elsevier, 2014. https://doi.org/10.1016/j.patrec.2014.08.013.","ama":"Morvant E. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 2014;51:37-43. doi:10.1016/j.patrec.2014.08.013","ista":"Morvant E. 2014. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 51, 37–43.","ieee":"E. Morvant, “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling,” Pattern Recognition Letters, vol. 51. Elsevier, pp. 37–43, 2014.","apa":"Morvant, E. (2014). Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2014.08.013"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.0334"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.patrec.2014.08.013","date_published":"2014-10-01T00:00:00Z","month":"10","day":"01"},{"year":"2014","_id":"2164","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Epilepsy-induced motility of differentiated neurons","publication_status":"published","publisher":"Oxford University Press","intvolume":" 24","department":[{"_id":"PeJo"}],"author":[{"first_name":"Xuejun","last_name":"Chai","full_name":"Chai, Xuejun"},{"full_name":"Münzner, Gert","first_name":"Gert","last_name":"Münzner"},{"full_name":"Zhao, Shanting","last_name":"Zhao","first_name":"Shanting"},{"full_name":"Tinnes, Stefanie","first_name":"Stefanie","last_name":"Tinnes"},{"first_name":"Janina","last_name":"Kowalski","id":"3F3CA136-F248-11E8-B48F-1D18A9856A87","full_name":"Kowalski, Janina"},{"last_name":"Häussler","first_name":"Ute","full_name":"Häussler, Ute"},{"full_name":"Young, Christina","first_name":"Christina","last_name":"Young"},{"last_name":"Haas","first_name":"Carola","full_name":"Haas, Carola"},{"first_name":"Michael","last_name":"Frotscher","full_name":"Frotscher, Michael"}],"date_created":"2018-12-11T11:56:04Z","date_updated":"2021-01-12T06:55:43Z","volume":24,"oa_version":"None","type":"journal_article","abstract":[{"text":"Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe epilepsy (TLE), has been assumed to result from a migration defect during development. Indeed, recent studies reported that aberrant migration of neonatal-generated dentate granule cells (GCs) increased the risk to develop epilepsy later in life. On the contrary, in the present study, we show that fully differentiated GCs become motile following the induction of epileptiform activity, resulting in GCD. Hippocampal slice cultures from transgenic mice expressing green fluorescent protein in differentiated, but not in newly generated GCs, were incubated with the glutamate receptor agonist kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy, we observed that KA-exposed, differentiated GCs translocated their cell bodies and changed their dendritic organization. As found in human TLE, KA application was associated with decreased expression of the extracellular matrix protein Reelin, particularly in hilar interneurons. Together these findings suggest that KA-induced motility of differentiated GCs contributes to the development of GCD and establish slice cultures as a model to study neuronal changes induced by epileptiform activity. ","lang":"eng"}],"publist_id":"4820","issue":"8","publication":"Cerebral Cortex","citation":{"ama":"Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. 2014;24(8):2130-2140. doi:10.1093/cercor/bht067","ista":"Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. 24(8), 2130–2140.","ieee":"X. Chai et al., “Epilepsy-induced motility of differentiated neurons,” Cerebral Cortex, vol. 24, no. 8. Oxford University Press, pp. 2130–2140, 2014.","apa":"Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., … Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bht067","mla":"Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.” Cerebral Cortex, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40, doi:10.1093/cercor/bht067.","short":"X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young, C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.","chicago":"Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski, Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced Motility of Differentiated Neurons.” Cerebral Cortex. Oxford University Press, 2014. https://doi.org/10.1093/cercor/bht067."},"quality_controlled":"1","page":"2130 - 2140","date_published":"2014-08-01T00:00:00Z","doi":"10.1093/cercor/bht067","language":[{"iso":"eng"}],"scopus_import":1,"day":"01","month":"08"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"quality_controlled":"1","doi":"10.1016/j.tpb.2014.05.001","language":[{"iso":"eng"}],"month":"08","year":"2014","publisher":"Academic Press","department":[{"_id":"NiBa"}],"publication_status":"published","author":[{"full_name":"Kelleher, Jerome","first_name":"Jerome","last_name":"Kelleher"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"volume":95,"date_updated":"2021-01-12T06:55:44Z","date_created":"2018-12-11T11:56:06Z","publist_id":"4816","ec_funded":1,"file_date_updated":"2020-07-14T12:45:31Z","citation":{"ista":"Kelleher J, Etheridge A, Barton NH. 2014. Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. 95, 13–23.","apa":"Kelleher, J., Etheridge, A., & Barton, N. H. (2014). Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2014.05.001","ieee":"J. Kelleher, A. Etheridge, and N. H. Barton, “Coalescent simulation in continuous space: Algorithms for large neighbourhood size,” Theoretical Population Biology, vol. 95. Academic Press, pp. 13–23, 2014.","ama":"Kelleher J, Etheridge A, Barton NH. Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. 2014;95:13-23. doi:10.1016/j.tpb.2014.05.001","chicago":"Kelleher, Jerome, Alison Etheridge, and Nicholas H Barton. “Coalescent Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical Population Biology. Academic Press, 2014. https://doi.org/10.1016/j.tpb.2014.05.001.","mla":"Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical Population Biology, vol. 95, Academic Press, 2014, pp. 13–23, doi:10.1016/j.tpb.2014.05.001.","short":"J. Kelleher, A. Etheridge, N.H. Barton, Theoretical Population Biology 95 (2014) 13–23."},"publication":"Theoretical Population Biology","page":"13 - 23","date_published":"2014-08-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","_id":"2168","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 95","title":"Coalescent simulation in continuous space: Algorithms for large neighbourhood size","status":"public","ddc":["570"],"pubrep_id":"391","file":[{"checksum":"979d7a8034e9df198f068f0d251f31bd","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:10:49Z","relation":"main_file","file_id":"4839","content_type":"application/pdf","file_size":569005,"creator":"system","access_level":"open_access","file_name":"IST-2015-391-v1+1_1-s2.0-S0040580914000355-main.pdf"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Many species have an essentially continuous distribution in space, in which there are no natural divisions between randomly mating subpopulations. Yet, the standard approach to modelling these populations is to impose an arbitrary grid of demes, adjusting deme sizes and migration rates in an attempt to capture the important features of the population. Such indirect methods are required because of the failure of the classical models of isolation by distance, which have been shown to have major technical flaws. A recently introduced model of extinction and recolonisation in two dimensions solves these technical problems, and provides a rigorous technical foundation for the study of populations evolving in a spatial continuum. The coalescent process for this model is simply stated, but direct simulation is very inefficient for large neighbourhood sizes. We present efficient and exact algorithms to simulate this coalescent process for arbitrary sample sizes and numbers of loci, and analyse these algorithms in detail."}]},{"month":"07","day":"22","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2014-07-22T00:00:00Z","doi":"10.1073/pnas.1410107111","page":"10398 - 10399","quality_controlled":"1","citation":{"chicago":"Barton, Nicholas H, Sebastian Novak, and Tiago Paixao. “Diverse Forms of Selection in Evolution and Computer Science.” PNAS. National Academy of Sciences, 2014. https://doi.org/10.1073/pnas.1410107111.","short":"N.H. Barton, S. Novak, T. Paixao, PNAS 111 (2014) 10398–10399.","mla":"Barton, Nicholas H., et al. “Diverse Forms of Selection in Evolution and Computer Science.” PNAS, vol. 111, no. 29, National Academy of Sciences, 2014, pp. 10398–99, doi:10.1073/pnas.1410107111.","ieee":"N. H. Barton, S. Novak, and T. Paixao, “Diverse forms of selection in evolution and computer science,” PNAS, vol. 111, no. 29. National Academy of Sciences, pp. 10398–10399, 2014.","apa":"Barton, N. H., Novak, S., & Paixao, T. (2014). Diverse forms of selection in evolution and computer science. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1410107111","ista":"Barton NH, Novak S, Paixao T. 2014. Diverse forms of selection in evolution and computer science. PNAS. 111(29), 10398–10399.","ama":"Barton NH, Novak S, Paixao T. Diverse forms of selection in evolution and computer science. PNAS. 2014;111(29):10398-10399. doi:10.1073/pnas.1410107111"},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115508/"}],"oa":1,"publication":"PNAS","issue":"29","publist_id":"4815","type":"journal_article","volume":111,"oa_version":"Submitted Version","date_updated":"2021-01-12T06:55:45Z","date_created":"2018-12-11T11:56:07Z","author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton"},{"full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","last_name":"Novak"},{"orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","first_name":"Tiago","full_name":"Paixao, Tiago"}],"intvolume":" 111","department":[{"_id":"NiBa"}],"publisher":"National Academy of Sciences","status":"public","publication_status":"published","title":"Diverse forms of selection in evolution and computer science","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2169","year":"2014"},{"month":"09","language":[{"iso":"eng"}],"conference":{"name":"ECCV: European Conference on Computer Vision","end_date":"2014-09-12","start_date":"2014-09-06","location":"Zurich, Switzerland"},"doi":"10.1007/978-3-319-10578-9_36","quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.7057"}],"oa":1,"publist_id":"4813","ec_funded":1,"date_created":"2018-12-11T11:56:07Z","date_updated":"2021-01-12T06:55:46Z","volume":8691,"author":[{"first_name":"Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"},{"full_name":"Guillaumin, Matthieu","last_name":"Guillaumin","first_name":"Matthieu"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"publication_status":"published","editor":[{"last_name":"Fleet","first_name":"David","full_name":"Fleet, David"},{"full_name":"Pajdla, Tomas","first_name":"Tomas","last_name":"Pajdla"},{"full_name":"Schiele, Bernt","last_name":"Schiele","first_name":"Bernt"},{"last_name":"Tuytelaars","first_name":"Tinne","full_name":"Tuytelaars, Tinne"}],"department":[{"_id":"ChLa"}],"publisher":"Springer","year":"2014","day":"01","scopus_import":1,"date_published":"2014-09-01T00:00:00Z","page":"550 - 565","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","citation":{"ieee":"A. Kolesnikov, M. Guillaumin, V. Ferrari, and C. Lampert, “Closed-form approximate CRF training for scalable image segmentation,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Zurich, Switzerland, 2014, vol. 8691, no. PART 3, pp. 550–565.","apa":"Kolesnikov, A., Guillaumin, M., Ferrari, V., & Lampert, C. (2014). Closed-form approximate CRF training for scalable image segmentation. In D. Fleet, T. Pajdla, B. Schiele, & T. Tuytelaars (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8691, pp. 550–565). Zurich, Switzerland: Springer. https://doi.org/10.1007/978-3-319-10578-9_36","ista":"Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. 2014. Closed-form approximate CRF training for scalable image segmentation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ECCV: European Conference on Computer Vision, LNCS, vol. 8691, 550–565.","ama":"Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. Closed-form approximate CRF training for scalable image segmentation. In: Fleet D, Pajdla T, Schiele B, Tuytelaars T, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8691. Springer; 2014:550-565. doi:10.1007/978-3-319-10578-9_36","chicago":"Kolesnikov, Alexander, Matthieu Guillaumin, Vittorio Ferrari, and Christoph Lampert. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, 8691:550–65. Springer, 2014. https://doi.org/10.1007/978-3-319-10578-9_36.","short":"A. Kolesnikov, M. Guillaumin, V. Ferrari, C. Lampert, in:, D. Fleet, T. Pajdla, B. Schiele, T. Tuytelaars (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 550–565.","mla":"Kolesnikov, Alexander, et al. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David Fleet et al., vol. 8691, no. PART 3, Springer, 2014, pp. 550–65, doi:10.1007/978-3-319-10578-9_36."},"abstract":[{"lang":"eng","text":"We present LS-CRF, a new method for training cyclic Conditional Random Fields (CRFs) from large datasets that is inspired by classical closed-form expressions for the maximum likelihood parameters of a generative graphical model with tree topology. Training a CRF with LS-CRF requires only solving a set of independent regression problems, each of which can be solved efficiently in closed form or by an iterative solver. This makes LS-CRF orders of magnitude faster than classical CRF training based on probabilistic inference, and at the same time more flexible and easier to implement than other approximate techniques, such as pseudolikelihood or piecewise training. We apply LS-CRF to the task of semantic image segmentation, showing that it achieves on par accuracy to other training techniques at higher speed, thereby allowing efficient CRF training from very large training sets. For example, training a linearly parameterized pairwise CRF on 150,000 images requires less than one hour on a modern workstation."}],"issue":"PART 3","alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","status":"public","title":"Closed-form approximate CRF training for scalable image segmentation","intvolume":" 8691","_id":"2171","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","abstract":[{"text":"In this work we introduce a new approach to co-classification, i.e. the task of jointly classifying multiple, otherwise independent, data samples. The method we present, named CoConut, is based on the idea of adding a regularizer in the label space to encode certain priors on the resulting labelings. A regularizer that encourages labelings that are smooth across the test set, for instance, can be seen as a test-time variant of the cluster assumption, which has been proven useful at training time in semi-supervised learning. A regularizer that introduces a preference for certain class proportions can be regarded as a prior distribution on the class labels. CoConut can build on existing classifiers without making any assumptions on how they were obtained and without the need to re-train them. The use of a regularizer adds a new level of flexibility. It allows the integration of potentially new information at test time, even in other modalities than what the classifiers were trained on. We evaluate our framework on six datasets, reporting a clear performance gain in classification accuracy compared to the standard classification setup that predicts labels for each test sample separately.\r\n","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2173","title":"CoConut: Co-classification with output space regularization","status":"public","ddc":["000"],"pubrep_id":"490","file":[{"date_created":"2018-12-12T10:08:23Z","date_updated":"2020-07-14T12:45:31Z","checksum":"c4c6d3efdb8ee648faf3e76849839ce2","file_id":"4683","relation":"main_file","creator":"system","file_size":408172,"content_type":"application/pdf","file_name":"IST-2016-490-v1+1_khamis-bmvc2014.pdf","access_level":"open_access"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"apa":"Khamis, S., & Lampert, C. (2014). CoConut: Co-classification with output space regularization. In Proceedings of the British Machine Vision Conference 2014. Nottingham, UK: BMVA Press.","ieee":"S. Khamis and C. Lampert, “CoConut: Co-classification with output space regularization,” in Proceedings of the British Machine Vision Conference 2014, Nottingham, UK, 2014.","ista":"Khamis S, Lampert C. 2014. CoConut: Co-classification with output space regularization. Proceedings of the British Machine Vision Conference 2014. BMVC: British Machine Vision Conference.","ama":"Khamis S, Lampert C. CoConut: Co-classification with output space regularization. In: Proceedings of the British Machine Vision Conference 2014. BMVA Press; 2014.","chicago":"Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output Space Regularization.” In Proceedings of the British Machine Vision Conference 2014. BMVA Press, 2014.","short":"S. Khamis, C. Lampert, in:, Proceedings of the British Machine Vision Conference 2014, BMVA Press, 2014.","mla":"Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output Space Regularization.” Proceedings of the British Machine Vision Conference 2014, BMVA Press, 2014."},"publication":"Proceedings of the British Machine Vision Conference 2014","date_published":"2014-09-01T00:00:00Z","ec_funded":1,"publist_id":"4811","file_date_updated":"2020-07-14T12:45:31Z","year":"2014","department":[{"_id":"ChLa"}],"publisher":"BMVA Press","publication_status":"published","author":[{"first_name":"Sameh","last_name":"Khamis","full_name":"Khamis, Sameh"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"}],"date_created":"2018-12-11T11:56:08Z","date_updated":"2021-01-12T06:55:46Z","month":"09","oa":1,"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"quality_controlled":"1","conference":{"end_date":"2014-09-05","start_date":"2014-09-01","location":"Nottingham, UK","name":"BMVC: British Machine Vision Conference"},"language":[{"iso":"eng"}]},{"ec_funded":1,"publist_id":"4812","abstract":[{"lang":"eng","text":"Fisher Kernels and Deep Learning were two developments with significant impact on large-scale object categorization in the last years. Both approaches were shown to achieve state-of-the-art results on large-scale object categorization datasets, such as ImageNet. Conceptually, however, they are perceived as very different and it is not uncommon for heated debates to spring up when advocates of both paradigms meet at conferences or workshops. In this work, we emphasize the similarities between both architectures rather than their differences and we argue that such a unified view allows us to transfer ideas from one domain to the other. As a concrete example we introduce a method for learning a support vector machine classifier with Fisher kernel at the same time as a task-specific data representation. We reinterpret the setting as a multi-layer feed forward network. Its final layer is the classifier, parameterized by a weight vector, and the two previous layers compute Fisher vectors, parameterized by the coefficients of a Gaussian mixture model. We introduce a gradient descent based learning algorithm that, in contrast to other feature learning techniques, is not just derived from intuition or biological analogy, but has a theoretical justification in the framework of statistical learning theory. Our experiments show that the new training procedure leads to significant improvements in classification accuracy while preserving the modularity and geometric interpretability of a support vector machine setup."}],"type":"conference","author":[{"full_name":"Sydorov, Vladyslav","first_name":"Vladyslav","last_name":"Sydorov"},{"full_name":"Sakurada, Mayu","last_name":"Sakurada","first_name":"Mayu"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"oa_version":"None","date_updated":"2021-01-12T06:55:46Z","date_created":"2018-12-11T11:56:08Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2172","year":"2014","publisher":"IEEE","department":[{"_id":"ChLa"}],"status":"public","publication_status":"published","title":"Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters","day":"24","month":"09","scopus_import":1,"date_published":"2014-09-24T00:00:00Z","doi":"10.1109/CVPR.2014.182","conference":{"end_date":"2014-06-28","location":"Columbus, USA","start_date":"2014-06-23","name":"CVPR: Computer Vision and Pattern Recognition"},"language":[{"iso":"eng"}],"citation":{"chicago":"Sydorov, Vladyslav, Mayu Sakurada, and Christoph Lampert. “Deep Fisher Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1402–9. IEEE, 2014. https://doi.org/10.1109/CVPR.2014.182.","mla":"Sydorov, Vladyslav, et al. “Deep Fisher Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–09, doi:10.1109/CVPR.2014.182.","short":"V. Sydorov, M. Sakurada, C. Lampert, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–1409.","ista":"Sydorov V, Sakurada M, Lampert C. 2014. Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Computer Vision and Pattern Recognition, 1402–1409.","ieee":"V. Sydorov, M. Sakurada, and C. Lampert, “Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Columbus, USA, 2014, pp. 1402–1409.","apa":"Sydorov, V., Sakurada, M., & Lampert, C. (2014). Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 1402–1409). Columbus, USA: IEEE. https://doi.org/10.1109/CVPR.2014.182","ama":"Sydorov V, Sakurada M, Lampert C. Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE; 2014:1402-1409. doi:10.1109/CVPR.2014.182"},"publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"page":"1402 - 1409","quality_controlled":"1"}]