--- _id: '1097' abstract: - lang: eng text: We present an interactive system for computational design, optimization, and fabrication of multicopters. Our computational approach allows non-experts to design, explore, and evaluate a wide range of different multicopters. We provide users with an intuitive interface for assembling a multicopter from a collection of components (e.g., propellers, motors, and carbon fiber rods). Our algorithm interactively optimizes shape and controller parameters of the current design to ensure its proper operation. In addition, we allow incorporating a variety of other metrics (such as payload, battery usage, size, and cost) into the design process and exploring tradeoffs between them. We show the efficacy of our method and system by designing, optimizing, fabricating, and operating multicopters with complex geometries and propeller configurations. We also demonstrate the ability of our optimization algorithm to improve the multicopter performance under different metrics. acknowledgement: "We thank Nobuyuki Umetani for his insightful suggestions in our discussions. We thank Alan Schultz and his colleagues at NRL for building the hexacopter and for the valuable discussions. We thank Randall Davis, Boris Katz, and Howard Shrobe at MIT for their advice. We are grateful to Nick Bandiera for preprocessing mechanical parts and providing 3D printing technical support; Charles Blouin from RCBenchmark for dynamometer hardware support; Brian Saavedra for the composition UI; Yingzhe Yuan for data acquisition and video recording in the experiments; Michael Foshey and David Kim for their comments on the draft of the paper. \r\n\r\n\r\nThis work was partially supported by Air Force Research Laboratory’s sponsorship of Julia: A Fresh Approach to Technical Computing and Data Processing (Sponsor Award ID FA8750-15-2- 0272, MIT Award ID 024831-00003), and NSF Expedition project (Sponsor Award ID CCF-1138967, MIT Award ID 020610-00002). The views expressed herein are not endorsed by the sponsors. This project has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No 645599. " alternative_title: - ACM Transactions on Graphics article_number: '227' author: - first_name: Tao full_name: Du, Tao last_name: Du - first_name: Adriana full_name: Schulz, Adriana last_name: Schulz - first_name: Bo full_name: Zhu, Bo last_name: Zhu - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Wojciech full_name: Matusik, Wojciech last_name: Matusik citation: ama: 'Du T, Schulz A, Zhu B, Bickel B, Matusik W. Computational multicopter design. In: Vol 35. ACM; 2016. doi:10.1145/2980179.2982427' apa: 'Du, T., Schulz, A., Zhu, B., Bickel, B., & Matusik, W. (2016). Computational multicopter design (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. https://doi.org/10.1145/2980179.2982427' chicago: Du, Tao, Adriana Schulz, Bo Zhu, Bernd Bickel, and Wojciech Matusik. “Computational Multicopter Design,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2980179.2982427. ieee: 'T. Du, A. Schulz, B. Zhu, B. Bickel, and W. Matusik, “Computational multicopter design,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no. 6.' ista: 'Du T, Schulz A, Zhu B, Bickel B, Matusik W. 2016. Computational multicopter design. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol. 35, 227.' mla: Du, Tao, et al. Computational Multicopter Design. Vol. 35, no. 6, 227, ACM, 2016, doi:10.1145/2980179.2982427. short: T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016. conference: end_date: 2016-12-08 location: Macao, China name: 'SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia' start_date: 2016-12-05 date_created: 2018-12-11T11:50:07Z date_published: 2016-11-01T00:00:00Z date_updated: 2021-01-12T06:48:15Z day: '01' ddc: - '006' department: - _id: BeBi doi: 10.1145/2980179.2982427 ec_funded: 1 file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:17:42Z date_updated: 2018-12-12T10:17:42Z file_id: '5298' file_name: IST-2017-759-v1+1_copter.pdf file_size: 33114420 relation: main_file file_date_updated: 2018-12-12T10:17:42Z has_accepted_license: '1' intvolume: ' 35' issue: '6' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version project: - _id: 25082902-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '645599' name: Soft-bodied intelligence for Manipulation publication_status: published publisher: ACM publist_id: '6278' pubrep_id: '759' quality_controlled: '1' scopus_import: 1 status: public title: Computational multicopter design type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 35 year: '2016' ... --- _id: '1098' abstract: - lang: eng text: Better understanding of the potential benefits of information transfer and representation learning is an important step towards the goal of building intelligent systems that are able to persist in the world and learn over time. In this work, we consider a setting where the learner encounters a stream of tasks but is able to retain only limited information from each encountered task, such as a learned predictor. In contrast to most previous works analyzing this scenario, we do not make any distributional assumptions on the task generating process. Instead, we formulate a complexity measure that captures the diversity of the observed tasks. We provide a lifelong learning algorithm with error guarantees for every observed task (rather than on average). We show sample complexity reductions in comparison to solving every task in isolation in terms of our task complexity measure. Further, our algorithmic framework can naturally be viewed as learning a representation from encountered tasks with a neural network. acknowledgement: "This work was in parts funded by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.\r\n\r\n" alternative_title: - Advances in Neural Information Processing Systems author: - first_name: Anastasia full_name: Pentina, Anastasia id: 42E87FC6-F248-11E8-B48F-1D18A9856A87 last_name: Pentina - first_name: Ruth full_name: Urner, Ruth last_name: Urner citation: ama: 'Pentina A, Urner R. Lifelong learning with weighted majority votes. In: Vol 29. Neural Information Processing Systems; 2016:3619-3627.' apa: 'Pentina, A., & Urner, R. (2016). Lifelong learning with weighted majority votes (Vol. 29, pp. 3619–3627). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems.' chicago: Pentina, Anastasia, and Ruth Urner. “Lifelong Learning with Weighted Majority Votes,” 29:3619–27. Neural Information Processing Systems, 2016. ieee: 'A. Pentina and R. Urner, “Lifelong learning with weighted majority votes,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 3619–3627.' ista: 'Pentina A, Urner R. 2016. Lifelong learning with weighted majority votes. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 3619–3627.' mla: Pentina, Anastasia, and Ruth Urner. Lifelong Learning with Weighted Majority Votes. Vol. 29, Neural Information Processing Systems, 2016, pp. 3619–27. short: A. Pentina, R. Urner, in:, Neural Information Processing Systems, 2016, pp. 3619–3627. conference: end_date: 2016-12-10 location: Barcelona, Spain name: 'NIPS: Neural Information Processing Systems' start_date: 2016-12-05 date_created: 2018-12-11T11:50:08Z date_published: 2016-12-01T00:00:00Z date_updated: 2021-01-12T06:48:15Z day: '01' ddc: - '006' department: - _id: ChLa ec_funded: 1 file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:12:42Z date_updated: 2018-12-12T10:12:42Z file_id: '4961' file_name: IST-2017-775-v1+1_main.pdf file_size: 237111 relation: main_file - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:12:43Z date_updated: 2018-12-12T10:12:43Z file_id: '4962' file_name: IST-2017-775-v1+2_supplementary.pdf file_size: 185818 relation: main_file file_date_updated: 2018-12-12T10:12:43Z has_accepted_license: '1' intvolume: ' 29' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 3619-3627 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication_status: published publisher: Neural Information Processing Systems publist_id: '6277' pubrep_id: '775' quality_controlled: '1' scopus_import: 1 status: public title: Lifelong learning with weighted majority votes type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2016' ... --- _id: '1099' abstract: - lang: eng text: We present FlexMolds, a novel computational approach to automatically design flexible, reusable molds that, once 3D printed, allow us to physically fabricate, by means of liquid casting, multiple copies of complex shapes with rich surface details and complex topology. The approach to design such flexible molds is based on a greedy bottom-up search of possible cuts over an object, evaluating for each possible cut the feasibility of the resulting mold. We use a dynamic simulation approach to evaluate candidate molds, providing a heuristic to generate forces that are able to open, detach, and remove a complex mold from the object it surrounds. We have tested the approach with a number of objects with nontrivial shapes and topologies. acknowledgement: "The armadillo, bunny and dragon models are courtesy of the Stanford \ 3D Scanning Repository. The bimba, fertility and elephant models are courtesy of the AIM@SHAPE Shape Repository. \r\nThis project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant \ agreement\r\nNo. 645599." alternative_title: - ACM Transactions on Graphics article_number: '223' author: - first_name: Luigi full_name: Malomo, Luigi last_name: Malomo - first_name: Nico full_name: Pietroni, Nico last_name: Pietroni - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Paolo full_name: Cignoni, Paolo last_name: Cignoni citation: ama: 'Malomo L, Pietroni N, Bickel B, Cignoni P. FlexMolds: Automatic design of flexible shells for molding. In: Vol 35. ACM; 2016. doi:10.1145/2980179.2982397' apa: 'Malomo, L., Pietroni, N., Bickel, B., & Cignoni, P. (2016). FlexMolds: Automatic design of flexible shells for molding (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. https://doi.org/10.1145/2980179.2982397' chicago: 'Malomo, Luigi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “FlexMolds: Automatic Design of Flexible Shells for Molding,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2980179.2982397.' ieee: 'L. Malomo, N. Pietroni, B. Bickel, and P. Cignoni, “FlexMolds: Automatic design of flexible shells for molding,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no. 6.' ista: 'Malomo L, Pietroni N, Bickel B, Cignoni P. 2016. FlexMolds: Automatic design of flexible shells for molding. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol. 35, 223.' mla: 'Malomo, Luigi, et al. FlexMolds: Automatic Design of Flexible Shells for Molding. Vol. 35, no. 6, 223, ACM, 2016, doi:10.1145/2980179.2982397.' short: L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016. conference: end_date: 2016-12-08 location: Macao, China name: 'SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia' start_date: 2016-12-05 date_created: 2018-12-11T11:50:08Z date_published: 2016-11-01T00:00:00Z date_updated: 2021-01-12T06:48:16Z day: '01' ddc: - '000' - '005' department: - _id: BeBi doi: 10.1145/2980179.2982397 ec_funded: 1 file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:12:01Z date_updated: 2018-12-12T10:12:01Z file_id: '4918' file_name: IST-2017-760-v1+1_flexmolds.pdf file_size: 11122029 relation: main_file file_date_updated: 2018-12-12T10:12:01Z has_accepted_license: '1' intvolume: ' 35' issue: '6' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version project: - _id: 25082902-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '645599' name: Soft-bodied intelligence for Manipulation publication_status: published publisher: ACM publist_id: '6276' pubrep_id: '760' quality_controlled: '1' scopus_import: 1 status: public title: 'FlexMolds: Automatic design of flexible shells for molding' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 35 year: '2016' ... --- _id: '1102' abstract: - lang: eng text: Weakly-supervised object localization methods tend to fail for object classes that consistently co-occur with the same background elements, e.g. trains on tracks. We propose a method to overcome these failures by adding a very small amount of model-specific additional annotation. The main idea is to cluster a deep network\'s mid-level representations and assign object or distractor labels to each cluster. Experiments show substantially improved localization results on the challenging ILSVC2014 dataset for bounding box detection and the PASCAL VOC2012 dataset for semantic segmentation. acknowledgement: "This work was funded in parts by the European Research Council\r\nunder the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant\r\nagreement no 308036. We gratefully acknowledge the support of NVIDIA Corporation with\r\nthe donation of the GPUs used for this research." author: - first_name: Alexander full_name: Kolesnikov, Alexander id: 2D157DB6-F248-11E8-B48F-1D18A9856A87 last_name: Kolesnikov - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Kolesnikov A, Lampert C. Improving weakly-supervised object localization by micro-annotation. In: Proceedings of the British Machine Vision Conference 2016. Vol 2016-September. BMVA Press; 2016:92.1-92.12. doi:10.5244/C.30.92' apa: 'Kolesnikov, A., & Lampert, C. (2016). Improving weakly-supervised object localization by micro-annotation. In Proceedings of the British Machine Vision Conference 2016 (Vol. 2016–September, p. 92.1-92.12). York, United Kingdom: BMVA Press. https://doi.org/10.5244/C.30.92' chicago: Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised Object Localization by Micro-Annotation.” In Proceedings of the British Machine Vision Conference 2016, 2016–September:92.1-92.12. BMVA Press, 2016. https://doi.org/10.5244/C.30.92. ieee: A. Kolesnikov and C. Lampert, “Improving weakly-supervised object localization by micro-annotation,” in Proceedings of the British Machine Vision Conference 2016, York, United Kingdom, 2016, vol. 2016–September, p. 92.1-92.12. ista: 'Kolesnikov A, Lampert C. 2016. Improving weakly-supervised object localization by micro-annotation. Proceedings of the British Machine Vision Conference 2016. BMVC: British Machine Vision Conference vol. 2016–September, 92.1-92.12.' mla: Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised Object Localization by Micro-Annotation.” Proceedings of the British Machine Vision Conference 2016, vol. 2016–September, BMVA Press, 2016, p. 92.1-92.12, doi:10.5244/C.30.92. short: A. Kolesnikov, C. Lampert, in:, Proceedings of the British Machine Vision Conference 2016, BMVA Press, 2016, p. 92.1-92.12. conference: end_date: 2016-09-22 location: York, United Kingdom name: 'BMVC: British Machine Vision Conference' start_date: 2016-09-19 date_created: 2018-12-11T11:50:09Z date_published: 2016-09-01T00:00:00Z date_updated: 2021-01-12T06:48:18Z day: '01' department: - _id: ChLa doi: 10.5244/C.30.92 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: http://www.bmva.org/bmvc/2016/papers/paper092/paper092.pdf month: '09' oa: 1 oa_version: Published Version page: 92.1-92.12 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication: Proceedings of the British Machine Vision Conference 2016 publication_status: published publisher: BMVA Press publist_id: '6273' quality_controlled: '1' scopus_import: 1 status: public title: Improving weakly-supervised object localization by micro-annotation type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 2016-September year: '2016' ... --- _id: '1103' abstract: - lang: eng text: We propose two parallel state-space-exploration algorithms for hybrid automaton (HA), with the goal of enhancing performance on multi-core shared-memory systems. The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN model checker, when traversing the discrete modes of the HA, and enhances it with a parallel exploration of the continuous states within each mode. We show that this simple-minded extension of PBFS does not provide the desired load balancing in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS), which uses a cheap precomputation of the cost associated with the post operations (both continuous and discrete) in order to improve load balancing. We illustrate the TP-BFS and the cost precomputation of the post operators on a support-function-based algorithm for state-space exploration. The performance comparison of the two algorithms shows that, in general, TP-BFS provides a better utilization/load-balancing of the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect to SpaceEx LGG scenario. In order to make the comparison fair, we employed an equal number of post operations in both tools. To the best of our knowledge, this paper represents the first attempt to provide parallel, reachability-analysis algorithms for HA. acknowledgement: This work was supported in part by DST-SERB, GoI under Project No. YSS/2014/000623 and by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). article_number: '7797741' author: - first_name: Amit full_name: Gurung, Amit last_name: Gurung - first_name: Arup full_name: Deka, Arup last_name: Deka - first_name: Ezio full_name: Bartocci, Ezio last_name: Bartocci - first_name: Sergiy full_name: Bogomolov, Sergiy id: 369D9A44-F248-11E8-B48F-1D18A9856A87 last_name: Bogomolov orcid: 0000-0002-0686-0365 - first_name: Radu full_name: Grosu, Radu last_name: Grosu - first_name: Rajarshi full_name: Ray, Rajarshi last_name: Ray citation: ama: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. Parallel reachability analysis for hybrid systems. In: IEEE; 2016. doi:10.1109/MEMCOD.2016.7797741' apa: 'Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., & Ray, R. (2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India : IEEE. https://doi.org/10.1109/MEMCOD.2016.7797741' chicago: Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.” IEEE, 2016. https://doi.org/10.1109/MEMCOD.2016.7797741. ieee: 'A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel reachability analysis for hybrid systems,” presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India , 2016.' ista: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. 2016. Parallel reachability analysis for hybrid systems. MEMOCODE: International Conference on Formal Methods and Models for System Design, 7797741.' mla: Gurung, Amit, et al. Parallel Reachability Analysis for Hybrid Systems. 7797741, IEEE, 2016, doi:10.1109/MEMCOD.2016.7797741. short: A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, R. Ray, in:, IEEE, 2016. conference: end_date: 2016-11-20 location: 'Kanpur, India ' name: 'MEMOCODE: International Conference on Formal Methods and Models for System Design' start_date: 2016-11-18 date_created: 2018-12-11T11:50:09Z date_published: 2016-12-27T00:00:00Z date_updated: 2021-01-12T06:48:18Z day: '27' department: - _id: ToHe doi: 10.1109/MEMCOD.2016.7797741 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1606.05473 month: '12' oa: 1 oa_version: Preprint project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: IEEE publist_id: '6272' quality_controlled: '1' scopus_import: 1 status: public title: Parallel reachability analysis for hybrid systems type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1105' abstract: - lang: eng text: Jointly characterizing neural responses in terms of several external variables promises novel insights into circuit function, but remains computationally prohibitive in practice. Here we use gaussian process (GP) priors and exploit recent advances in fast GP inference and learning based on Kronecker methods, to efficiently estimate multidimensional nonlinear tuning functions. Our estimator require considerably less data than traditional methods and further provides principled uncertainty estimates. We apply these tools to hippocampal recordings during open field exploration and use them to characterize the joint dependence of CA1 responses on the position of the animal and several other variables, including the animal\'s speed, direction of motion, and network oscillations.Our results provide an unprecedentedly detailed quantification of the tuning of hippocampal neurons. The model\'s generality suggests that our approach can be used to estimate neural response properties in other brain regions. acknowledgement: "We thank Jozsef Csicsvari for kindly sharing the CA1 data.\r\nThis work was supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme(FP7/2007-2013) under REA grant agreement no. 291734." alternative_title: - Advances in Neural Information Processing Systems author: - first_name: Cristina full_name: Savin, Cristina id: 3933349E-F248-11E8-B48F-1D18A9856A87 last_name: Savin - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 citation: ama: 'Savin C, Tkačik G. Estimating nonlinear neural response functions using GP priors and Kronecker methods. In: Vol 29. Neural Information Processing Systems; 2016:3610-3618.' apa: 'Savin, C., & Tkačik, G. (2016). Estimating nonlinear neural response functions using GP priors and Kronecker methods (Vol. 29, pp. 3610–3618). Presented at the NIPS: Neural Information Processing Systems, Barcelona; Spain: Neural Information Processing Systems.' chicago: Savin, Cristina, and Gašper Tkačik. “Estimating Nonlinear Neural Response Functions Using GP Priors and Kronecker Methods,” 29:3610–18. Neural Information Processing Systems, 2016. ieee: 'C. Savin and G. Tkačik, “Estimating nonlinear neural response functions using GP priors and Kronecker methods,” presented at the NIPS: Neural Information Processing Systems, Barcelona; Spain, 2016, vol. 29, pp. 3610–3618.' ista: 'Savin C, Tkačik G. 2016. Estimating nonlinear neural response functions using GP priors and Kronecker methods. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 3610–3618.' mla: Savin, Cristina, and Gašper Tkačik. Estimating Nonlinear Neural Response Functions Using GP Priors and Kronecker Methods. Vol. 29, Neural Information Processing Systems, 2016, pp. 3610–18. short: C. Savin, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 3610–3618. conference: end_date: 2016-12-10 location: Barcelona; Spain name: 'NIPS: Neural Information Processing Systems' start_date: 2016-12-05 date_created: 2018-12-11T11:50:10Z date_published: 2016-12-01T00:00:00Z date_updated: 2021-01-12T06:48:19Z day: '01' department: - _id: GaTk ec_funded: 1 intvolume: ' 29' language: - iso: eng main_file_link: - url: http://papers.nips.cc/paper/6153-estimating-nonlinear-neural-response-functions-using-gp-priors-and-kronecker-methods month: '12' oa_version: None page: 3610-3618 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication_status: published publisher: Neural Information Processing Systems publist_id: '6265' quality_controlled: '1' scopus_import: 1 status: public title: Estimating nonlinear neural response functions using GP priors and Kronecker methods type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2016' ... --- _id: '1115' abstract: - lang: eng text: We present a coherent microwave to telecom signal converter based on the electro-optical effect using a crystalline WGM-resonator coupled to a 3D microwave cavity, achieving high photon conversion efficiency of 0.1% with MHz bandwidth. article_number: '7788479' article_processing_charge: No author: - first_name: Alfredo full_name: Rueda, Alfredo last_name: Rueda - first_name: Florian full_name: Sedlmeir, Florian last_name: Sedlmeir - first_name: Michele full_name: Collodo, Michele last_name: Collodo - first_name: Ulrich full_name: Vogl, Ulrich last_name: Vogl - first_name: Birgit full_name: Stiller, Birgit last_name: Stiller - first_name: Georg full_name: Schunk, Georg last_name: Schunk - first_name: Dimitry full_name: Strekalov, Dimitry last_name: Strekalov - first_name: Christoph full_name: Marquardt, Christoph last_name: Marquardt - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X - first_name: Oskar full_name: Painter, Oskar last_name: Painter - first_name: Gerd full_name: Leuchs, Gerd last_name: Leuchs - first_name: Harald full_name: Schwefel, Harald last_name: Schwefel citation: ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. In: IEEE; 2016. doi:10.1364/CLEO_SI.2016.SF2G.3' apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2016). Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. Presented at the CLEO: Conference on Lasers and Electro Optics, San Jose, CA, USA: IEEE. https://doi.org/10.1364/CLEO_SI.2016.SF2G.3' chicago: Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Georg Schunk, Dimitry Strekalov, et al. “Efficient Single Sideband Microwave to Optical Conversion Using a LiNbO₃ WGM-Resonator.” IEEE, 2016. https://doi.org/10.1364/CLEO_SI.2016.SF2G.3. ieee: 'A. Rueda et al., “Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator,” presented at the CLEO: Conference on Lasers and Electro Optics, San Jose, CA, USA, 2016.' ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. CLEO: Conference on Lasers and Electro Optics, 7788479.' mla: Rueda, Alfredo, et al. Efficient Single Sideband Microwave to Optical Conversion Using a LiNbO₃ WGM-Resonator. 7788479, IEEE, 2016, doi:10.1364/CLEO_SI.2016.SF2G.3. short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, IEEE, 2016. conference: end_date: 2016-06-10 location: San Jose, CA, USA name: 'CLEO: Conference on Lasers and Electro Optics' start_date: 2016-06-05 date_created: 2018-12-11T11:50:14Z date_published: 2016-12-16T00:00:00Z date_updated: 2022-09-06T07:23:25Z day: '16' department: - _id: JoFi doi: 10.1364/CLEO_SI.2016.SF2G.3 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1601.07261 month: '12' oa: 1 oa_version: Preprint publication_status: published publisher: IEEE publist_id: '6251' quality_controlled: '1' related_material: link: - relation: other url: http://ieeexplore.ieee.org/document/7788479/ scopus_import: '1' status: public title: Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1135' abstract: - lang: eng text: 'Time-triggered (TT) switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems. These networks rely on the notion of globally discretized time (i.e. time slots) and a static TT schedule that prescribes which message is sent through which link at every time slot, such that all messages reach their destination before a global timeout. These schedules are generated offline, assuming a static network with fault-free links, and entrusting all error-handling functions to the end user. Assuming the network is static is an over-optimistic view, and indeed links tend to fail in practice. We study synthesis of TT schedules on a network in which links fail over time and we assume the switches run a very simple error-recovery protocol once they detect a crashed link. We address the problem of finding a pk; qresistant schedule; namely, one that, assuming the switches run a fixed error-recovery protocol, guarantees that the number of messages that arrive at their destination by the timeout is at least no matter what sequence of at most k links fail. Thus, we maintain the simplicity of the switches while giving a guarantee on the number of messages that meet the timeout. We show how a pk; q-resistant schedule can be obtained using a CEGAR-like approach: find a schedule, decide whether it is pk; q-resistant, and if it is not, use the witnessing fault sequence to generate a constraint that is added to the program. The newly added constraint disallows the schedule to be regenerated in a future iteration while also eliminating several other schedules that are not pk; q-resistant. We illustrate the applicability of our approach using an SMT-based implementation. © 2016 ACM.' article_number: '26' author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Shibashis full_name: Guha, Shibashis last_name: Guha - first_name: Guillermo full_name: Rodríguez Navas, Guillermo last_name: Rodríguez Navas citation: ama: 'Avni G, Guha S, Rodríguez Navas G. Synthesizing time triggered schedules for switched networks with faulty links. In: Proceedings of the 13th International Conference on Embedded Software . ACM; 2016. doi:10.1145/2968478.2968499' apa: 'Avni, G., Guha, S., & Rodríguez Navas, G. (2016). Synthesizing time triggered schedules for switched networks with faulty links. In Proceedings of the 13th International Conference on Embedded Software . Pittsburgh, PA, USA: ACM. https://doi.org/10.1145/2968478.2968499' chicago: Avni, Guy, Shibashis Guha, and Guillermo Rodríguez Navas. “Synthesizing Time Triggered Schedules for Switched Networks with Faulty Links.” In Proceedings of the 13th International Conference on Embedded Software . ACM, 2016. https://doi.org/10.1145/2968478.2968499. ieee: G. Avni, S. Guha, and G. Rodríguez Navas, “Synthesizing time triggered schedules for switched networks with faulty links,” in Proceedings of the 13th International Conference on Embedded Software , Pittsburgh, PA, USA, 2016. ista: 'Avni G, Guha S, Rodríguez Navas G. 2016. Synthesizing time triggered schedules for switched networks with faulty links. Proceedings of the 13th International Conference on Embedded Software . EMSOFT: Embedded Software , 26.' mla: Avni, Guy, et al. “Synthesizing Time Triggered Schedules for Switched Networks with Faulty Links.” Proceedings of the 13th International Conference on Embedded Software , 26, ACM, 2016, doi:10.1145/2968478.2968499. short: G. Avni, S. Guha, G. Rodríguez Navas, in:, Proceedings of the 13th International Conference on Embedded Software , ACM, 2016. conference: end_date: 2016-10-07 location: Pittsburgh, PA, USA name: 'EMSOFT: Embedded Software ' start_date: 2016-10-01 date_created: 2018-12-11T11:50:20Z date_published: 2016-10-01T00:00:00Z date_updated: 2021-01-12T06:48:33Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1145/2968478.2968499 ec_funded: 1 file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:09:31Z date_updated: 2018-12-12T10:09:31Z file_id: '4755' file_name: IST-2016-644-v1+1_emsoft-no-format.pdf file_size: 279240 relation: main_file file_date_updated: 2018-12-12T10:09:31Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 'Proceedings of the 13th International Conference on Embedded Software ' publication_status: published publisher: ACM publist_id: '6223' pubrep_id: '644' quality_controlled: '1' scopus_import: 1 status: public title: Synthesizing time triggered schedules for switched networks with faulty links type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1134' abstract: - lang: eng text: 'Hybrid systems have both continuous and discrete dynamics and are useful for modeling a variety of control systems, from air traffic control protocols to robotic maneuvers and beyond. Recently, numerous powerful and scalable tools for analyzing hybrid systems have emerged. Several of these tools implement automated formal methods for mathematically proving a system meets a specification. This tutorial session will present three recent hybrid systems tools: C2E2, HyST, and TuLiP. C2E2 is a simulated-based verification tool for hybrid systems, and uses validated numerical solvers and bloating of simulation traces to verify systems meet specifications. HyST is a hybrid systems model transformation and translation tool, and uses a canonical intermediate representation to support most of the recent verification tools, as well as automated sound abstractions that simplify verification of a given hybrid system. TuLiP is a controller synthesis tool for hybrid systems, where given a temporal logic specification to be satisfied for a system (plant) model, TuLiP will find a controller that meets a given specification. © 2016 IEEE.' article_number: '7587948' author: - first_name: Parasara full_name: Duggirala, Parasara last_name: Duggirala - first_name: Chuchu full_name: Fan, Chuchu last_name: Fan - first_name: Matthew full_name: Potok, Matthew last_name: Potok - first_name: Bolun full_name: Qi, Bolun last_name: Qi - first_name: Sayan full_name: Mitra, Sayan last_name: Mitra - first_name: Mahesh full_name: Viswanathan, Mahesh last_name: Viswanathan - first_name: Stanley full_name: Bak, Stanley last_name: Bak - first_name: Sergiy full_name: Bogomolov, Sergiy id: 369D9A44-F248-11E8-B48F-1D18A9856A87 last_name: Bogomolov orcid: 0000-0002-0686-0365 - first_name: Taylor full_name: Johnson, Taylor last_name: Johnson - first_name: Luan full_name: Nguyen, Luan last_name: Nguyen - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 - first_name: Andrew full_name: Sogokon, Andrew last_name: Sogokon - first_name: Hoang full_name: Tran, Hoang last_name: Tran - first_name: Weiming full_name: Xiang, Weiming last_name: Xiang citation: ama: 'Duggirala P, Fan C, Potok M, et al. Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP. In: 2016 IEEE Conference on Control Applications. IEEE; 2016. doi:10.1109/CCA.2016.7587948' apa: 'Duggirala, P., Fan, C., Potok, M., Qi, B., Mitra, S., Viswanathan, M., … Xiang, W. (2016). Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP. In 2016 IEEE Conference on Control Applications. Buenos Aires, Argentina : IEEE. https://doi.org/10.1109/CCA.2016.7587948' chicago: 'Duggirala, Parasara, Chuchu Fan, Matthew Potok, Bolun Qi, Sayan Mitra, Mahesh Viswanathan, Stanley Bak, et al. “Tutorial: Software Tools for Hybrid Systems Verification Transformation and Synthesis C2E2 HyST and TuLiP.” In 2016 IEEE Conference on Control Applications. IEEE, 2016. https://doi.org/10.1109/CCA.2016.7587948.' ieee: 'P. Duggirala et al., “Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP,” in 2016 IEEE Conference on Control Applications, Buenos Aires, Argentina , 2016.' ista: 'Duggirala P, Fan C, Potok M, Qi B, Mitra S, Viswanathan M, Bak S, Bogomolov S, Johnson T, Nguyen L, Schilling C, Sogokon A, Tran H, Xiang W. 2016. Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP. 2016 IEEE Conference on Control Applications. CCA: Control Applications , 7587948.' mla: 'Duggirala, Parasara, et al. “Tutorial: Software Tools for Hybrid Systems Verification Transformation and Synthesis C2E2 HyST and TuLiP.” 2016 IEEE Conference on Control Applications, 7587948, IEEE, 2016, doi:10.1109/CCA.2016.7587948.' short: P. Duggirala, C. Fan, M. Potok, B. Qi, S. Mitra, M. Viswanathan, S. Bak, S. Bogomolov, T. Johnson, L. Nguyen, C. Schilling, A. Sogokon, H. Tran, W. Xiang, in:, 2016 IEEE Conference on Control Applications, IEEE, 2016. conference: end_date: 2016-09-22 location: 'Buenos Aires, Argentina ' name: 'CCA: Control Applications ' start_date: 2016-09-19 date_created: 2018-12-11T11:50:20Z date_published: 2016-10-10T00:00:00Z date_updated: 2021-01-12T06:48:32Z day: '10' department: - _id: ToHe doi: 10.1109/CCA.2016.7587948 language: - iso: eng month: '10' oa_version: None publication: 2016 IEEE Conference on Control Applications publication_status: published publisher: IEEE publist_id: '6224' quality_controlled: '1' scopus_import: 1 status: public title: 'Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1136' abstract: - lang: eng text: We propose an interactive sculpting system for seamlessly editing pre-computed animations of liquid, without the need for any resimulation. The input is a sequence of meshes without correspondences representing the liquid surface over time. Our method enables the efficient selection of consistent space-time parts of this animation, such as moving waves or droplets, which we call space-time features. Once selected, a feature can be copied, edited, or duplicated and then pasted back anywhere in space and time in the same or in another liquid animation sequence. Our method circumvents tedious user interactions by automatically computing the spatial and temporal ranges of the selected feature. We also provide space-time shape editing tools for non-uniform scaling, rotation, trajectory changes, and temporal editing to locally speed up or slow down motion. Using our tools, the user can edit and progressively refine any input simulation result, possibly using a library of precomputed space-time features extracted from other animations. In contrast to the trial-and-error loop usually required to edit animation results through the tuning of indirect simulation parameters, our method gives the user full control over the edited space-time behaviors. © 2016 Copyright held by the owner/author(s). acknowledgement: This work was partly supported by the starting grant BigSplash, as well as the advanced grant EXPRESSIVE from the European Research Council (ERC-2014-StG 638176 , and ERC-2011-ADG 20110209). article_number: '2994261' article_processing_charge: No author: - first_name: Pierre full_name: Manteaux, Pierre last_name: Manteaux - first_name: Ulysse full_name: Vimont, Ulysse last_name: Vimont - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Damien full_name: Rohmer, Damien last_name: Rohmer - first_name: Marie full_name: Cani, Marie last_name: Cani citation: ama: 'Manteaux P, Vimont U, Wojtan C, Rohmer D, Cani M. Space-time sculpting of liquid animation. In: Proceedings of the 9th International Conference on Motion in Games . ACM; 2016. doi:10.1145/2994258.2994261' apa: 'Manteaux, P., Vimont, U., Wojtan, C., Rohmer, D., & Cani, M. (2016). Space-time sculpting of liquid animation. In Proceedings of the 9th International Conference on Motion in Games . San Francisco, CA, USA: ACM. https://doi.org/10.1145/2994258.2994261' chicago: Manteaux, Pierre, Ulysse Vimont, Chris Wojtan, Damien Rohmer, and Marie Cani. “Space-Time Sculpting of Liquid Animation.” In Proceedings of the 9th International Conference on Motion in Games . ACM, 2016. https://doi.org/10.1145/2994258.2994261. ieee: P. Manteaux, U. Vimont, C. Wojtan, D. Rohmer, and M. Cani, “Space-time sculpting of liquid animation,” in Proceedings of the 9th International Conference on Motion in Games , San Francisco, CA, USA, 2016. ista: 'Manteaux P, Vimont U, Wojtan C, Rohmer D, Cani M. 2016. Space-time sculpting of liquid animation. Proceedings of the 9th International Conference on Motion in Games . MIG: Motion in Games, 2994261.' mla: Manteaux, Pierre, et al. “Space-Time Sculpting of Liquid Animation.” Proceedings of the 9th International Conference on Motion in Games , 2994261, ACM, 2016, doi:10.1145/2994258.2994261. short: P. Manteaux, U. Vimont, C. Wojtan, D. Rohmer, M. Cani, in:, Proceedings of the 9th International Conference on Motion in Games , ACM, 2016. conference: end_date: 2016-10-12 location: San Francisco, CA, USA name: 'MIG: Motion in Games' start_date: 2016-10-10 date_created: 2018-12-11T11:50:20Z date_published: 2016-10-10T00:00:00Z date_updated: 2023-02-21T09:49:49Z day: '10' ddc: - '004' department: - _id: ChWo doi: 10.1145/2994258.2994261 ec_funded: 1 has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://hal.inria.fr/hal-01367181 month: '10' oa: 1 oa_version: Submitted Version project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication: 'Proceedings of the 9th International Conference on Motion in Games ' publication_status: published publisher: ACM publist_id: '6222' quality_controlled: '1' scopus_import: '1' status: public title: Space-time sculpting of liquid animation type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1137' abstract: - lang: eng text: RASGRP1 is an important guanine nucleotide exchange factor and activator of the RAS-MAPK pathway following T cell antigen receptor (TCR) signaling. The consequences of RASGRP1 mutations in humans are unknown. In a patient with recurrent bacterial and viral infections, born to healthy consanguineous parents, we used homozygosity mapping and exome sequencing to identify a biallelic stop-gain variant in RASGRP1. This variant segregated perfectly with the disease and has not been reported in genetic databases. RASGRP1 deficiency was associated in T cells and B cells with decreased phosphorylation of the extracellular-signal-regulated serine kinase ERK, which was restored following expression of wild-type RASGRP1. RASGRP1 deficiency also resulted in defective proliferation, activation and motility of T cells and B cells. RASGRP1-deficient natural killer (NK) cells exhibited impaired cytotoxicity with defective granule convergence and actin accumulation. Interaction proteomics identified the dynein light chain DYNLL1 as interacting with RASGRP1, which links RASGRP1 to cytoskeletal dynamics. RASGRP1-deficient cells showed decreased activation of the GTPase RhoA. Treatment with lenalidomide increased RhoA activity and reversed the migration and activation defects of RASGRP1-deficient lymphocytes. article_processing_charge: No article_type: original author: - first_name: Elisabeth full_name: Salzer, Elisabeth last_name: Salzer - first_name: Deniz full_name: Çaǧdaş, Deniz last_name: Çaǧdaş - first_name: Miroslav full_name: Hons, Miroslav id: 4167FE56-F248-11E8-B48F-1D18A9856A87 last_name: Hons orcid: 0000-0002-6625-3348 - first_name: Emily full_name: Mace, Emily last_name: Mace - first_name: Wojciech full_name: Garncarz, Wojciech last_name: Garncarz - first_name: Oezlem full_name: Petronczki, Oezlem last_name: Petronczki - first_name: René full_name: Platzer, René last_name: Platzer - first_name: Laurène full_name: Pfajfer, Laurène last_name: Pfajfer - first_name: Ivan full_name: Bilic, Ivan last_name: Bilic - first_name: Sol full_name: Ban, Sol last_name: Ban - first_name: Katharina full_name: Willmann, Katharina last_name: Willmann - first_name: Malini full_name: Mukherjee, Malini last_name: Mukherjee - first_name: Verena full_name: Supper, Verena last_name: Supper - first_name: Hsiangting full_name: Hsu, Hsiangting last_name: Hsu - first_name: Pinaki full_name: Banerjee, Pinaki last_name: Banerjee - first_name: Papiya full_name: Sinha, Papiya last_name: Sinha - first_name: Fabienne full_name: Mcclanahan, Fabienne last_name: Mcclanahan - first_name: Gerhard full_name: Zlabinger, Gerhard last_name: Zlabinger - first_name: Winfried full_name: Pickl, Winfried last_name: Pickl - first_name: John full_name: Gribben, John last_name: Gribben - first_name: Hannes full_name: Stockinger, Hannes last_name: Stockinger - first_name: Keiryn full_name: Bennett, Keiryn last_name: Bennett - first_name: Johannes full_name: Huppa, Johannes last_name: Huppa - first_name: Loï̈C full_name: Dupré, Loï̈C last_name: Dupré - first_name: Özden full_name: Sanal, Özden last_name: Sanal - first_name: Ulrich full_name: Jäger, Ulrich last_name: Jäger - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Ilhan full_name: Tezcan, Ilhan last_name: Tezcan - first_name: Jordan full_name: Orange, Jordan last_name: Orange - first_name: Kaan full_name: Boztug, Kaan last_name: Boztug citation: ama: Salzer E, Çaǧdaş D, Hons M, et al. RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics. Nature Immunology. 2016;17(12):1352-1360. doi:10.1038/ni.3575 apa: Salzer, E., Çaǧdaş, D., Hons, M., Mace, E., Garncarz, W., Petronczki, O., … Boztug, K. (2016). RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics. Nature Immunology. Nature Publishing Group. https://doi.org/10.1038/ni.3575 chicago: Salzer, Elisabeth, Deniz Çaǧdaş, Miroslav Hons, Emily Mace, Wojciech Garncarz, Oezlem Petronczki, René Platzer, et al. “RASGRP1 Deficiency Causes Immunodeficiency with Impaired Cytoskeletal Dynamics.” Nature Immunology. Nature Publishing Group, 2016. https://doi.org/10.1038/ni.3575. ieee: E. Salzer et al., “RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics,” Nature Immunology, vol. 17, no. 12. Nature Publishing Group, pp. 1352–1360, 2016. ista: Salzer E, Çaǧdaş D, Hons M, Mace E, Garncarz W, Petronczki O, Platzer R, Pfajfer L, Bilic I, Ban S, Willmann K, Mukherjee M, Supper V, Hsu H, Banerjee P, Sinha P, Mcclanahan F, Zlabinger G, Pickl W, Gribben J, Stockinger H, Bennett K, Huppa J, Dupré L, Sanal Ö, Jäger U, Sixt MK, Tezcan I, Orange J, Boztug K. 2016. RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics. Nature Immunology. 17(12), 1352–1360. mla: Salzer, Elisabeth, et al. “RASGRP1 Deficiency Causes Immunodeficiency with Impaired Cytoskeletal Dynamics.” Nature Immunology, vol. 17, no. 12, Nature Publishing Group, 2016, pp. 1352–60, doi:10.1038/ni.3575. short: E. Salzer, D. Çaǧdaş, M. Hons, E. Mace, W. Garncarz, O. Petronczki, R. Platzer, L. Pfajfer, I. Bilic, S. Ban, K. Willmann, M. Mukherjee, V. Supper, H. Hsu, P. Banerjee, P. Sinha, F. Mcclanahan, G. Zlabinger, W. Pickl, J. Gribben, H. Stockinger, K. Bennett, J. Huppa, L. Dupré, Ö. Sanal, U. Jäger, M.K. Sixt, I. Tezcan, J. Orange, K. Boztug, Nature Immunology 17 (2016) 1352–1360. date_created: 2018-12-11T11:50:21Z date_published: 2016-12-01T00:00:00Z date_updated: 2021-01-12T06:48:33Z day: '01' department: - _id: MiSi doi: 10.1038/ni.3575 external_id: pmid: - '27776107' intvolume: ' 17' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6400263 month: '12' oa: 1 oa_version: Submitted Version page: 1352 - 1360 pmid: 1 publication: Nature Immunology publication_status: published publisher: Nature Publishing Group publist_id: '6221' quality_controlled: '1' scopus_import: 1 status: public title: RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2016' ... --- _id: '1138' abstract: - lang: eng text: Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider. © 2016 ACM. acknowledgement: This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S114 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Quantitative automata under probabilistic semantics. In: Proceedings of the 31st Annual ACM/IEEE Symposium. IEEE; 2016:76-85. doi:10.1145/2933575.2933588' apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.” In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016. https://doi.org/10.1145/2933575.2933588. ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85. ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 76–85.' mla: Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.” Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85, doi:10.1145/2933575.2933588. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85. conference: end_date: 2016-07-08 location: New York, NY, USA name: 'LICS: Logic in Computer Science' start_date: 2016-07-05 date_created: 2018-12-11T11:50:21Z date_published: 2016-07-05T00:00:00Z date_updated: 2021-01-12T06:48:34Z day: '05' department: - _id: KrCh - _id: ToHe doi: 10.1145/2933575.2933588 ec_funded: 1 external_id: arxiv: - '1604.06764' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1604.06764 month: '07' oa: 1 oa_version: Preprint page: 76 - 85 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Proceedings of the 31st Annual ACM/IEEE Symposium publication_status: published publisher: IEEE publist_id: '6220' quality_controlled: '1' scopus_import: 1 status: public title: Quantitative automata under probabilistic semantics type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1140' abstract: - lang: eng text: 'Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental -regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, Büchi, and coBüchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical -regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives. © 2016 ACM.' acknowledgement: "K. C., M. H., and W. D. are partially supported by the \ Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003.\r\nK. C. is partially supported by the Austrian Science Fund (FWF)\r\nNFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant\r\n(279307: Graph Games). For W. D., M. H., and V. L. the research\r\nleading to these results has received funding from the European\r\nResearch Council under the European Union’s Seventh Framework\r\nProgramme (FP/2007-2013) / ERC Grant Agreement no. 340506." alternative_title: - Proceedings Symposium on Logic in Computer Science article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvoák, Wolfgang last_name: Dvoák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer citation: ama: 'Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2016:197-206. doi:10.1145/2933575.2935304' apa: 'Chatterjee, K., Dvoák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304' chicago: 'Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016. https://doi.org/10.1145/2933575.2935304.' ieee: 'K. Chatterjee, W. Dvoák, M. H. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.' ista: 'Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, , 197–206.' mla: 'Chatterjee, Krishnendu, et al. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206, doi:10.1145/2933575.2935304.' short: K. Chatterjee, W. Dvoák, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206. conference: end_date: 2016-07-08 location: New York, NY, USA name: 'LICS: Logic in Computer Science' start_date: 2016-07-05 date_created: 2018-12-11T11:50:22Z date_published: 2016-07-05T00:00:00Z date_updated: 2022-09-09T11:46:17Z day: '05' department: - _id: KrCh doi: 10.1145/2933575.2935304 external_id: arxiv: - '1602.02670' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1602.02670 month: '07' oa: 1 oa_version: Preprint page: 197 - 206 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science publication_status: published publisher: IEEE publist_id: '6219' quality_controlled: '1' scopus_import: '1' status: public title: 'Model and objective separation with conditional lower bounds: disjunction is harder than conjunction' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1142' abstract: - lang: eng text: Hemolysis drives susceptibility to bacterial infections and predicts poor outcome from sepsis. These detrimental effects are commonly considered to be a consequence of heme-iron serving as a nutrient for bacteria. We employed a Gram-negative sepsis model and found that elevated heme levels impaired the control of bacterial proliferation independently of heme-iron acquisition by pathogens. Heme strongly inhibited phagocytosis and the migration of human and mouse phagocytes by disrupting actin cytoskeletal dynamics via activation of the GTP-binding Rho family protein Cdc42 by the guanine nucleotide exchange factor DOCK8. A chemical screening approach revealed that quinine effectively prevented heme effects on the cytoskeleton, restored phagocytosis and improved survival in sepsis. These mechanistic insights provide potential therapeutic targets for patients with sepsis or hemolytic disorders. acknowledgement: 'Y. Fukui (Medical Institute of Bioregulation, Kyushu University) and J. Stein (Theodor Kocher Institute, University of Bern) are acknowledged for providing the DOCK8 deficient bone marrow. and H. Häcker (St. Judes Children''s Research Hospital) for providing the ERHBD-HoxB8-encoding retroviral construct. pSpCas9(BB)-2a-Puro (PX459) was a gift from F. Zhang (Massachusetts Institute of Technology) (Addgene plasmid # 48139) and pGRG36 was a gift from N. Craig (Johns Hopkins University School of Medicine) (Addgene plasmid # 16666). LifeAct-GFP-encoding retrovirus was kindly provided by A. Leithner (Institute of Science and Technology Austria). pSIM8 and TKC E. coli were gifts from D.L. Court (Center for Cancer Research, National Cancer Institute). We acknowledge M. Gröger and S. Rauscher for excellent technical support (Core imaging facility, Medical University of Vienna). We thank D.P. Barlow and L.R. Cheever for critical reading of the manuscript. This work was supported by the Austrian Academy of Sciences, the Science Fund of the Austrian National Bank (14107) and the Austrian Science Fund FWF (I1620-B22) in the Infect-ERA framework (to S.Knapp).' author: - first_name: Rui full_name: Martins, Rui last_name: Martins - first_name: Julia full_name: Maier, Julia last_name: Maier - first_name: Anna full_name: Gorki, Anna last_name: Gorki - first_name: Kilian full_name: Huber, Kilian last_name: Huber - first_name: Omar full_name: Sharif, Omar last_name: Sharif - first_name: Philipp full_name: Starkl, Philipp last_name: Starkl - first_name: Simona full_name: Saluzzo, Simona last_name: Saluzzo - first_name: Federica full_name: Quattrone, Federica last_name: Quattrone - first_name: Riem full_name: Gawish, Riem last_name: Gawish - first_name: Karin full_name: Lakovits, Karin last_name: Lakovits - first_name: Michael full_name: Aichinger, Michael last_name: Aichinger - first_name: Branka full_name: Radic Sarikas, Branka last_name: Radic Sarikas - first_name: Charles full_name: Lardeau, Charles last_name: Lardeau - first_name: Anastasiya full_name: Hladik, Anastasiya last_name: Hladik - first_name: Ana full_name: Korosec, Ana last_name: Korosec - first_name: Markus full_name: Brown, Markus id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Kari full_name: Vaahtomeri, Kari id: 368EE576-F248-11E8-B48F-1D18A9856A87 last_name: Vaahtomeri orcid: 0000-0001-7829-3518 - first_name: Michelle full_name: Duggan, Michelle id: 2EDEA62C-F248-11E8-B48F-1D18A9856A87 last_name: Duggan - first_name: Dontscho full_name: Kerjaschki, Dontscho last_name: Kerjaschki - first_name: Harald full_name: Esterbauer, Harald last_name: Esterbauer - first_name: Jacques full_name: Colinge, Jacques last_name: Colinge - first_name: Stephanie full_name: Eisenbarth, Stephanie last_name: Eisenbarth - first_name: Thomas full_name: Decker, Thomas last_name: Decker - first_name: Keiryn full_name: Bennett, Keiryn last_name: Bennett - first_name: Stefan full_name: Kubicek, Stefan last_name: Kubicek - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Giulio full_name: Superti Furga, Giulio last_name: Superti Furga - first_name: Sylvia full_name: Knapp, Sylvia last_name: Knapp citation: ama: Martins R, Maier J, Gorki A, et al. Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions. Nature Immunology. 2016;17(12):1361-1372. doi:10.1038/ni.3590 apa: Martins, R., Maier, J., Gorki, A., Huber, K., Sharif, O., Starkl, P., … Knapp, S. (2016). Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions. Nature Immunology. Nature Publishing Group. https://doi.org/10.1038/ni.3590 chicago: Martins, Rui, Julia Maier, Anna Gorki, Kilian Huber, Omar Sharif, Philipp Starkl, Simona Saluzzo, et al. “Heme Drives Hemolysis-Induced Susceptibility to Infection via Disruption of Phagocyte Functions.” Nature Immunology. Nature Publishing Group, 2016. https://doi.org/10.1038/ni.3590. ieee: R. Martins et al., “Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions,” Nature Immunology, vol. 17, no. 12. Nature Publishing Group, pp. 1361–1372, 2016. ista: Martins R, Maier J, Gorki A, Huber K, Sharif O, Starkl P, Saluzzo S, Quattrone F, Gawish R, Lakovits K, Aichinger M, Radic Sarikas B, Lardeau C, Hladik A, Korosec A, Brown M, Vaahtomeri K, Duggan M, Kerjaschki D, Esterbauer H, Colinge J, Eisenbarth S, Decker T, Bennett K, Kubicek S, Sixt MK, Superti Furga G, Knapp S. 2016. Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions. Nature Immunology. 17(12), 1361–1372. mla: Martins, Rui, et al. “Heme Drives Hemolysis-Induced Susceptibility to Infection via Disruption of Phagocyte Functions.” Nature Immunology, vol. 17, no. 12, Nature Publishing Group, 2016, pp. 1361–72, doi:10.1038/ni.3590. short: R. Martins, J. Maier, A. Gorki, K. Huber, O. Sharif, P. Starkl, S. Saluzzo, F. Quattrone, R. Gawish, K. Lakovits, M. Aichinger, B. Radic Sarikas, C. Lardeau, A. Hladik, A. Korosec, M. Brown, K. Vaahtomeri, M. Duggan, D. Kerjaschki, H. Esterbauer, J. Colinge, S. Eisenbarth, T. Decker, K. Bennett, S. Kubicek, M.K. Sixt, G. Superti Furga, S. Knapp, Nature Immunology 17 (2016) 1361–1372. date_created: 2018-12-11T11:50:22Z date_published: 2016-12-01T00:00:00Z date_updated: 2021-01-12T06:48:36Z day: '01' department: - _id: MiSi - _id: PeJo doi: 10.1038/ni.3590 intvolume: ' 17' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://ora.ox.ac.uk/objects/uuid:f53a464e-1e5b-4f08-a7d8-b6749b852b9d month: '12' oa: 1 oa_version: Submitted Version page: 1361 - 1372 publication: Nature Immunology publication_status: published publisher: Nature Publishing Group publist_id: '6216' quality_controlled: '1' scopus_import: 1 status: public title: Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2016' ... --- _id: '1141' abstract: - lang: eng text: In this paper we introduce the Multiobjective Optimization Hierarchic Genetic Strategy with maturing (MO-mHGS), a meta-algorithm that performs evolutionary optimization in a hierarchy of populations. The maturing mechanism improves growth and reduces redundancy. The performance of MO-mHGS with selected state-of-the-art multiobjective evolutionary algorithms as internal algorithms is analysed on benchmark problems and their modifications for which single fitness evaluation time depends on the solution accuracy. We compare the proposed algorithm with the Island Model Genetic Algorithm as well as with single-deme methods, and discuss the impact of internal algorithms on the MO-mHGS meta-algorithm. © 2016 Elsevier B.V. acknowledgement: The work presented in this paper was partially supported by Polish National Science Centre grant nos. DEC-2012/05/N/ST6/03433 and DEC-2011/03/B/ST6/01393. Radosław Łazarz was supported by Polish National Science Centre grant no. DEC-2013/10/M/ST6/00531. author: - first_name: Radosław full_name: Łazarz, Radosław last_name: Łazarz - first_name: Michał full_name: Idzik, Michał last_name: Idzik - first_name: Konrad full_name: Gądek, Konrad last_name: Gądek - first_name: Ewa P full_name: Gajda-Zagorska, Ewa P id: 47794CF0-F248-11E8-B48F-1D18A9856A87 last_name: Gajda-Zagorska citation: ama: Łazarz R, Idzik M, Gądek K, Gajda-Zagorska EP. Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. Journal of Computational Science. 2016;17(1):249-260. doi:10.1016/j.jocs.2016.03.004 apa: Łazarz, R., Idzik, M., Gądek, K., & Gajda-Zagorska, E. P. (2016). Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. Journal of Computational Science. Elsevier. https://doi.org/10.1016/j.jocs.2016.03.004 chicago: Łazarz, Radosław, Michał Idzik, Konrad Gądek, and Ewa P Gajda-Zagorska. “Hierarchic Genetic Strategy with Maturing as a Generic Tool for Multiobjective Optimization.” Journal of Computational Science. Elsevier, 2016. https://doi.org/10.1016/j.jocs.2016.03.004. ieee: R. Łazarz, M. Idzik, K. Gądek, and E. P. Gajda-Zagorska, “Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization,” Journal of Computational Science, vol. 17, no. 1. Elsevier, pp. 249–260, 2016. ista: Łazarz R, Idzik M, Gądek K, Gajda-Zagorska EP. 2016. Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. Journal of Computational Science. 17(1), 249–260. mla: Łazarz, Radosław, et al. “Hierarchic Genetic Strategy with Maturing as a Generic Tool for Multiobjective Optimization.” Journal of Computational Science, vol. 17, no. 1, Elsevier, 2016, pp. 249–60, doi:10.1016/j.jocs.2016.03.004. short: R. Łazarz, M. Idzik, K. Gądek, E.P. Gajda-Zagorska, Journal of Computational Science 17 (2016) 249–260. date_created: 2018-12-11T11:50:22Z date_published: 2016-11-01T00:00:00Z date_updated: 2021-01-12T06:48:35Z day: '01' department: - _id: ChWo doi: 10.1016/j.jocs.2016.03.004 intvolume: ' 17' issue: '1' language: - iso: eng month: '11' oa_version: None page: 249 - 260 publication: Journal of Computational Science publication_status: published publisher: Elsevier publist_id: '6217' quality_controlled: '1' scopus_import: 1 status: public title: Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2016' ... --- _id: '1143' abstract: - lang: eng text: We study the ground state of a dilute Bose gas in a scaling limit where the Gross-Pitaevskii functional emerges. This is a repulsive nonlinear Schrödinger functional whose quartic term is proportional to the scattering length of the interparticle interaction potential. We propose a new derivation of this limit problem, with a method that bypasses some of the technical difficulties that previous derivations had to face. The new method is based on a combination of Dyson\'s lemma, the quantum de Finetti theorem and a second moment estimate for ground states of the effective Dyson Hamiltonian. It applies equally well to the case where magnetic fields or rotation are present. author: - first_name: Phan full_name: Nam, Phan id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Nam - first_name: Nicolas full_name: Rougerie, Nicolas last_name: Rougerie - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: 'Nam P, Rougerie N, Seiringer R. Ground states of large bosonic systems: The gross Pitaevskii limit revisited. Analysis and PDE. 2016;9(2):459-485. doi:10.2140/apde.2016.9.459' apa: 'Nam, P., Rougerie, N., & Seiringer, R. (2016). Ground states of large bosonic systems: The gross Pitaevskii limit revisited. Analysis and PDE. Mathematical Sciences Publishers. https://doi.org/10.2140/apde.2016.9.459' chicago: 'Nam, Phan, Nicolas Rougerie, and Robert Seiringer. “Ground States of Large Bosonic Systems: The Gross Pitaevskii Limit Revisited.” Analysis and PDE. Mathematical Sciences Publishers, 2016. https://doi.org/10.2140/apde.2016.9.459.' ieee: 'P. Nam, N. Rougerie, and R. Seiringer, “Ground states of large bosonic systems: The gross Pitaevskii limit revisited,” Analysis and PDE, vol. 9, no. 2. Mathematical Sciences Publishers, pp. 459–485, 2016.' ista: 'Nam P, Rougerie N, Seiringer R. 2016. Ground states of large bosonic systems: The gross Pitaevskii limit revisited. Analysis and PDE. 9(2), 459–485.' mla: 'Nam, Phan, et al. “Ground States of Large Bosonic Systems: The Gross Pitaevskii Limit Revisited.” Analysis and PDE, vol. 9, no. 2, Mathematical Sciences Publishers, 2016, pp. 459–85, doi:10.2140/apde.2016.9.459.' short: P. Nam, N. Rougerie, R. Seiringer, Analysis and PDE 9 (2016) 459–485. date_created: 2018-12-11T11:50:23Z date_published: 2016-03-24T00:00:00Z date_updated: 2021-01-12T06:48:36Z day: '24' department: - _id: RoSe doi: 10.2140/apde.2016.9.459 ec_funded: 1 intvolume: ' 9' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1503.07061 month: '03' oa: 1 oa_version: Preprint page: 459 - 485 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Analysis and PDE publication_status: published publisher: Mathematical Sciences Publishers publist_id: '6215' quality_controlled: '1' scopus_import: 1 status: public title: 'Ground states of large bosonic systems: The gross Pitaevskii limit revisited' type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2016' ... --- _id: '1145' abstract: - lang: eng text: Auxin directs plant ontogenesis via differential accumulation within tissues depending largely on the activity of PIN proteins that mediate auxin efflux from cells and its directional cell-to-cell transport. Regardless of the developmental importance of PINs, the structure of these transporters is poorly characterized. Here, we present experimental data concerning protein topology of plasma membrane-localized PINs. Utilizing approaches based on pH-dependent quenching of fluorescent reporters combined with immunolocalization techniques, we mapped the membrane topology of PINs and further cross-validated our results using available topology modeling software. We delineated the topology of PIN1 with two transmembrane (TM) bundles of five α-helices linked by a large intracellular loop and a C-terminus positioned outside the cytoplasm. Using constraints derived from our experimental data, we also provide an updated position of helical regions generating a verisimilitude model of PIN1. Since the canonical long PINs show a high degree of conservation in TM domains and auxin transport capacity has been demonstrated for Arabidopsis representatives of this group, this empirically enhanced topological model of PIN1 will be an important starting point for further studies on PIN structure–function relationships. In addition, we have established protocols that can be used to probe the topology of other plasma membrane proteins in plants. © 2016 The Authors acknowledgement: This research has been financially supported by the Ministry of Education, Youth and Sports of the Czech Republic under the project CEITEC 2020 (LQ1601) (T.N., M.Z., M.P., J.H.), Czech Science Foundation (13-40637S [J.F., M.Z.], 13-39982S [J.H.]); Research Foundation Flanders (Grant number FWO09/PDO/196) (S.V.) and the European Research Council (project ERC-2011-StG-20101109-PSDP) (J.F.). We thank David G. Robinson and Ranjan Swarup for sharing published material; Maria Šimášková, Mamoona Khan, Eva Benková for technical assistance; and R. Tejos, J. Kleine-Vehn, and E. Feraru for helpful discussions. author: - first_name: Tomasz full_name: Nodzyński, Tomasz last_name: Nodzyński - first_name: Steffen full_name: Vanneste, Steffen last_name: Vanneste - first_name: Marta full_name: Zwiewka, Marta last_name: Zwiewka - first_name: Markéta full_name: Pernisová, Markéta last_name: Pernisová - first_name: Jan full_name: Hejátko, Jan last_name: Hejátko - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Nodzyński T, Vanneste S, Zwiewka M, Pernisová M, Hejátko J, Friml J. Enquiry into the topology of plasma membrane localized PIN auxin transport components. Molecular Plant. 2016;9(11):1504-1519. doi:10.1016/j.molp.2016.08.010 apa: Nodzyński, T., Vanneste, S., Zwiewka, M., Pernisová, M., Hejátko, J., & Friml, J. (2016). Enquiry into the topology of plasma membrane localized PIN auxin transport components. Molecular Plant. Cell Press. https://doi.org/10.1016/j.molp.2016.08.010 chicago: Nodzyński, Tomasz, Steffen Vanneste, Marta Zwiewka, Markéta Pernisová, Jan Hejátko, and Jiří Friml. “Enquiry into the Topology of Plasma Membrane Localized PIN Auxin Transport Components.” Molecular Plant. Cell Press, 2016. https://doi.org/10.1016/j.molp.2016.08.010. ieee: T. Nodzyński, S. Vanneste, M. Zwiewka, M. Pernisová, J. Hejátko, and J. Friml, “Enquiry into the topology of plasma membrane localized PIN auxin transport components,” Molecular Plant, vol. 9, no. 11. Cell Press, pp. 1504–1519, 2016. ista: Nodzyński T, Vanneste S, Zwiewka M, Pernisová M, Hejátko J, Friml J. 2016. Enquiry into the topology of plasma membrane localized PIN auxin transport components. Molecular Plant. 9(11), 1504–1519. mla: Nodzyński, Tomasz, et al. “Enquiry into the Topology of Plasma Membrane Localized PIN Auxin Transport Components.” Molecular Plant, vol. 9, no. 11, Cell Press, 2016, pp. 1504–19, doi:10.1016/j.molp.2016.08.010. short: T. Nodzyński, S. Vanneste, M. Zwiewka, M. Pernisová, J. Hejátko, J. Friml, Molecular Plant 9 (2016) 1504–1519. date_created: 2018-12-11T11:50:23Z date_published: 2016-11-07T00:00:00Z date_updated: 2021-01-12T06:48:37Z day: '07' ddc: - '581' department: - _id: JiFr doi: 10.1016/j.molp.2016.08.010 ec_funded: 1 file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:13:22Z date_updated: 2018-12-12T10:13:22Z file_id: '5004' file_name: IST-2017-746-v1+1_1-s2.0-S1674205216301915-main.pdf file_size: 5005876 relation: main_file file_date_updated: 2018-12-12T10:13:22Z has_accepted_license: '1' intvolume: ' 9' issue: '11' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '11' oa: 1 oa_version: Published Version page: 1504 - 1519 project: - _id: 25716A02-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '282300' name: Polarity and subcellular dynamics in plants publication: Molecular Plant publication_status: published publisher: Cell Press publist_id: '6213' pubrep_id: '746' quality_controlled: '1' scopus_import: 1 status: public title: Enquiry into the topology of plasma membrane localized PIN auxin transport components tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2016' ... --- _id: '1147' abstract: - lang: eng text: Apical dominance is one of the fundamental developmental phenomena in plant biology, which determines the overall architecture of aerial plant parts. Here we show apex decapitation activated competition for dominance in adjacent upper and lower axillary buds. A two-nodal-bud pea (Pisum sativum L.) was used as a model system to monitor and assess auxin flow, auxin transport channels, and dormancy and initiation status of axillary buds. Auxin flow was manipulated by lateral stem wounds or chemically by auxin efflux inhibitors 2,3,5-triiodobenzoic acid (TIBA), 1-N-naphtylphtalamic acid (NPA), or protein synthesis inhibitor cycloheximide (CHX) treatments, which served to interfere with axillary bud competition. Redirecting auxin flow to different points influenced which bud formed the outgrowing and dominant shoot. The obtained results proved that competition between upper and lower axillary buds as secondary auxin sources is based on the same auxin canalization principle that operates between the shoot apex and axillary bud. © The Author(s) 2016. acknowledgement: This research was carried out under the project CEITEC 2020 (LQ1601) with financial support from the Ministry of Education, Youth and Sports of the Czech Republic under the National Sustainability Programme II., supported by the project “CEITEC–Central European Institute of Technology” (CZ.1.05/1.1.00/02.0068) and the Agronomy faculty grant from Mendel University “IGA AF MENDELU” (IP 14/2013). article_number: '35955' author: - first_name: Jozef full_name: Balla, Jozef last_name: Balla - first_name: Zuzana full_name: Medved'Ová, Zuzana last_name: Medved'Ová - first_name: Petr full_name: Kalousek, Petr last_name: Kalousek - first_name: Natálie full_name: Matiješčuková, Natálie last_name: Matiješčuková - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Vilém full_name: Reinöhl, Vilém last_name: Reinöhl - first_name: Stanislav full_name: Procházka, Stanislav last_name: Procházka citation: ama: Balla J, Medved’Ová Z, Kalousek P, et al. Auxin flow mediated competition between axillary buds to restore apical dominance. Scientific Reports. 2016;6. doi:10.1038/srep35955 apa: Balla, J., Medved’Ová, Z., Kalousek, P., Matiješčuková, N., Friml, J., Reinöhl, V., & Procházka, S. (2016). Auxin flow mediated competition between axillary buds to restore apical dominance. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep35955 chicago: Balla, Jozef, Zuzana Medved’Ová, Petr Kalousek, Natálie Matiješčuková, Jiří Friml, Vilém Reinöhl, and Stanislav Procházka. “Auxin Flow Mediated Competition between Axillary Buds to Restore Apical Dominance.” Scientific Reports. Nature Publishing Group, 2016. https://doi.org/10.1038/srep35955. ieee: J. Balla et al., “Auxin flow mediated competition between axillary buds to restore apical dominance,” Scientific Reports, vol. 6. Nature Publishing Group, 2016. ista: Balla J, Medved’Ová Z, Kalousek P, Matiješčuková N, Friml J, Reinöhl V, Procházka S. 2016. Auxin flow mediated competition between axillary buds to restore apical dominance. Scientific Reports. 6, 35955. mla: Balla, Jozef, et al. “Auxin Flow Mediated Competition between Axillary Buds to Restore Apical Dominance.” Scientific Reports, vol. 6, 35955, Nature Publishing Group, 2016, doi:10.1038/srep35955. short: J. Balla, Z. Medved’Ová, P. Kalousek, N. Matiješčuková, J. Friml, V. Reinöhl, S. Procházka, Scientific Reports 6 (2016). date_created: 2018-12-11T11:50:24Z date_published: 2016-11-08T00:00:00Z date_updated: 2021-01-12T06:48:38Z day: '08' ddc: - '581' department: - _id: JiFr doi: 10.1038/srep35955 file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:09:28Z date_updated: 2018-12-12T10:09:28Z file_id: '4752' file_name: IST-2017-745-v1+1_srep35955.pdf file_size: 1587544 relation: main_file file_date_updated: 2018-12-12T10:09:28Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '11' oa: 1 oa_version: Published Version publication: Scientific Reports publication_status: published publisher: Nature Publishing Group publist_id: '6211' pubrep_id: '745' quality_controlled: '1' scopus_import: 1 status: public title: Auxin flow mediated competition between axillary buds to restore apical dominance tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2016' ... --- _id: '1149' abstract: - lang: eng text: 'We study the usefulness of two most prominent publicly available rigorous ODE integrators: one provided by the CAPD group (capd.ii.uj.edu.pl), the other based on the COSY Infinity project (cosyinfinity.org). Both integrators are capable of handling entire sets of initial conditions and provide tight rigorous outer enclosures of the images under a time-T map. We conduct extensive benchmark computations using the well-known Lorenz system, and compare the computation time against the final accuracy achieved. We also discuss the effect of a few technical parameters, such as the order of the numerical integration method, the value of T, and the phase space resolution. We conclude that COSY may provide more precise results due to its ability of avoiding the variable dependency problem. However, the overall cost of computations conducted using CAPD is typically lower, especially when intervals of parameters are involved. Moreover, access to COSY is limited (registration required) and the rigorous ODE integrators are not publicly available, while CAPD is an open source free software project. Therefore, we recommend the latter integrator for this kind of computations. Nevertheless, proper choice of the various integration parameters turns out to be of even greater importance than the choice of the integrator itself. © 2016 IMACS. Published by Elsevier B.V. All rights reserved.' acknowledgement: "MG was partially supported by FAPESP grants 2013/07460-7 and 2010/00875-9, and by CNPq grants 305860/2013-5 and 306453/2009-6, Brazil. The work of HK was partially supported by Grant-in-Aid for Scientific Research (Nos.24654022, 25287029), Ministry of Education, Science, Technology, Culture and Sports, Japan. KM was supported by NSF grants NSF-DMS-0835621, 0915019, 1125174, 1248071, and contracts from AFOSR and DARPA. TM was supported by Grant-in-Aid for JSPS Fellows No. 245312. A part of the research of TM and HK was also supported by JST, CREST.\r\n\r\nResearch conducted by PP has received funding from Fundo Europeu de Desenvolvimento Regional (FEDER) through COMPETE – Programa Operacional Factores de Competitividade (POFC) and from the Portuguese national funds through Fundação para a Ciência e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645 (Ref. FCT PTDC/MAT/098871/2008); from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No. 622033; and from the same sources as HK.\r\n\r\nThe authors express their gratitude to the Department of Mathematics of Kyoto University for making their server available for conducting the computations described in the paper, and to the reviewers for helpful comments that contributed towards increasing the quality of the paper." author: - first_name: Tomoyuki full_name: Miyaji, Tomoyuki last_name: Miyaji - first_name: Pawel full_name: Pilarczyk, Pawel id: 3768D56A-F248-11E8-B48F-1D18A9856A87 last_name: Pilarczyk - first_name: Marcio full_name: Gameiro, Marcio last_name: Gameiro - first_name: Hiroshi full_name: Kokubu, Hiroshi last_name: Kokubu - first_name: Konstantin full_name: Mischaikow, Konstantin last_name: Mischaikow citation: ama: Miyaji T, Pilarczyk P, Gameiro M, Kokubu H, Mischaikow K. A study of rigorous ODE integrators for multi scale set oriented computations. Applied Numerical Mathematics. 2016;107:34-47. doi:10.1016/j.apnum.2016.04.005 apa: Miyaji, T., Pilarczyk, P., Gameiro, M., Kokubu, H., & Mischaikow, K. (2016). A study of rigorous ODE integrators for multi scale set oriented computations. Applied Numerical Mathematics. Elsevier. https://doi.org/10.1016/j.apnum.2016.04.005 chicago: Miyaji, Tomoyuki, Pawel Pilarczyk, Marcio Gameiro, Hiroshi Kokubu, and Konstantin Mischaikow. “A Study of Rigorous ODE Integrators for Multi Scale Set Oriented Computations.” Applied Numerical Mathematics. Elsevier, 2016. https://doi.org/10.1016/j.apnum.2016.04.005. ieee: T. Miyaji, P. Pilarczyk, M. Gameiro, H. Kokubu, and K. Mischaikow, “A study of rigorous ODE integrators for multi scale set oriented computations,” Applied Numerical Mathematics, vol. 107. Elsevier, pp. 34–47, 2016. ista: Miyaji T, Pilarczyk P, Gameiro M, Kokubu H, Mischaikow K. 2016. A study of rigorous ODE integrators for multi scale set oriented computations. Applied Numerical Mathematics. 107, 34–47. mla: Miyaji, Tomoyuki, et al. “A Study of Rigorous ODE Integrators for Multi Scale Set Oriented Computations.” Applied Numerical Mathematics, vol. 107, Elsevier, 2016, pp. 34–47, doi:10.1016/j.apnum.2016.04.005. short: T. Miyaji, P. Pilarczyk, M. Gameiro, H. Kokubu, K. Mischaikow, Applied Numerical Mathematics 107 (2016) 34–47. date_created: 2018-12-11T11:50:25Z date_published: 2016-09-01T00:00:00Z date_updated: 2021-01-12T06:48:38Z day: '01' department: - _id: HeEd doi: 10.1016/j.apnum.2016.04.005 ec_funded: 1 intvolume: ' 107' language: - iso: eng month: '09' oa_version: None page: 34 - 47 project: - _id: 255F06BE-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '622033' name: Persistent Homology - Images, Data and Maps publication: Applied Numerical Mathematics publication_status: published publisher: Elsevier publist_id: '6209' quality_controlled: '1' scopus_import: 1 status: public title: A study of rigorous ODE integrators for multi scale set oriented computations type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 107 year: '2016' ... --- _id: '1150' abstract: - lang: eng text: When neutrophils infiltrate a site of inflammation, they have to stop at the right place to exert their effector function. In this issue of Developmental Cell, Wang et al. (2016) show that neutrophils sense reactive oxygen species via the TRPM2 channel to arrest migration at their target site. © 2016 Elsevier Inc. author: - first_name: Jörg full_name: Renkawitz, Jörg id: 3F0587C8-F248-11E8-B48F-1D18A9856A87 last_name: Renkawitz orcid: 0000-0003-2856-3369 - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Renkawitz J, Sixt MK. A Radical Break Restraining Neutrophil Migration. Developmental Cell. 2016;38(5):448-450. doi:10.1016/j.devcel.2016.08.017 apa: Renkawitz, J., & Sixt, M. K. (2016). A Radical Break Restraining Neutrophil Migration. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2016.08.017 chicago: Renkawitz, Jörg, and Michael K Sixt. “A Radical Break Restraining Neutrophil Migration.” Developmental Cell. Cell Press, 2016. https://doi.org/10.1016/j.devcel.2016.08.017. ieee: J. Renkawitz and M. K. Sixt, “A Radical Break Restraining Neutrophil Migration,” Developmental Cell, vol. 38, no. 5. Cell Press, pp. 448–450, 2016. ista: Renkawitz J, Sixt MK. 2016. A Radical Break Restraining Neutrophil Migration. Developmental Cell. 38(5), 448–450. mla: Renkawitz, Jörg, and Michael K. Sixt. “A Radical Break Restraining Neutrophil Migration.” Developmental Cell, vol. 38, no. 5, Cell Press, 2016, pp. 448–50, doi:10.1016/j.devcel.2016.08.017. short: J. Renkawitz, M.K. Sixt, Developmental Cell 38 (2016) 448–450. date_created: 2018-12-11T11:50:25Z date_published: 2016-09-12T00:00:00Z date_updated: 2021-01-12T06:48:39Z day: '12' department: - _id: MiSi doi: 10.1016/j.devcel.2016.08.017 intvolume: ' 38' issue: '5' language: - iso: eng month: '09' oa_version: None page: 448 - 450 publication: Developmental Cell publication_status: published publisher: Cell Press publist_id: '6208' quality_controlled: '1' scopus_import: 1 status: public title: A Radical Break Restraining Neutrophil Migration type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2016' ...