[{"pubrep_id":"199","publisher":"Springer","_id":"2445","alternative_title":["LNCS"],"publication_status":"published","type":"conference","ddc":["000","004"],"oa_version":"Submitted Version","file":[{"file_name":"IST-2014-199-v1+1_cav2013-final.pdf","creator":"system","file_id":"5158","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:40Z","file_size":365548,"checksum":"70c70ca5487faba82262c63e1b678a27","date_created":"2018-12-12T10:15:37Z"}],"year":"2013","month":"07","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-09-07T11:57:01Z","scopus_import":1,"abstract":[{"lang":"eng","text":"We develop program synthesis techniques that can help programmers fix concurrency-related bugs. We make two new contributions to synthesis for concurrency, the first improving the efficiency of the synthesized code, and the second improving the efficiency of the synthesis procedure itself. The first contribution is to have the synthesis procedure explore a variety of (sequential) semantics-preserving program transformations. Classically, only one such transformation has been considered, namely, the insertion of synchronization primitives (such as locks). Based on common manual bug-fixing techniques used by Linux device-driver developers, we explore additional, more efficient transformations, such as the reordering of independent instructions. The second contribution is to speed up the counterexample-guided removal of concurrency bugs within the synthesis procedure by considering partial-order traces (instead of linear traces) as counterexamples. A partial-order error trace represents a set of linear (interleaved) traces of a concurrent program all of which lead to the same error. By eliminating a partial-order error trace, we eliminate in a single iteration of the synthesis procedure all linearizations of the partial-order trace. We evaluated our techniques on several simplified examples of real concurrency bugs that occurred in Linux device drivers."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1130"}]},"author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"last_name":"Ryzhyk","full_name":"Ryzhyk, Leonid","first_name":"Leonid"},{"full_name":"Tarrach, Thorsten","last_name":"Tarrach","orcid":"0000-0003-4409-8487","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","first_name":"Thorsten"}],"status":"public","oa":1,"conference":{"name":"CAV: Computer Aided Verification","start_date":"2013-07-13","location":"St. Petersburg, Russia","end_date":"2013-07-19"},"quality_controlled":"1","citation":{"ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Efficient synthesis for concurrency by semantics-preserving transformations. In: Vol 8044. Springer; 2013:951-967. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967.","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">https://doi.org/10.1007/978-3-642-39799-8_68</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,” 8044:951–67. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">https://doi.org/10.1007/978-3-642-39799-8_68</a>.","mla":"Cerny, Pavol, et al. <i>Efficient Synthesis for Concurrency by Semantics-Preserving Transformations</i>. Vol. 8044, Springer, 2013, pp. 951–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>."},"date_created":"2018-12-11T11:57:42Z","page":"951 - 967","publist_id":"4458","title":"Efficient synthesis for concurrency by semantics-preserving transformations","volume":8044,"day":"01","date_published":"2013-07-01T00:00:00Z","has_accepted_license":"1","intvolume":"      8044","file_date_updated":"2020-07-14T12:45:40Z","doi":"10.1007/978-3-642-39799-8_68","ec_funded":1},{"status":"public","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","full_name":"Gaiser, Andreas","last_name":"Gaiser"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2020-08-11T10:09:47Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.5281"}],"abstract":[{"text":"The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.","lang":"eng"}],"scopus_import":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"year":"2013","month":"07","department":[{"_id":"KrCh"}],"publisher":"Springer","oa_version":"Preprint","type":"conference","external_id":{"arxiv":["1304.5281"]},"alternative_title":["LNCS"],"publication_status":"published","_id":"2446","doi":"10.1007/978-3-642-39799-8_37","ec_funded":1,"day":"01","volume":8044,"intvolume":"      8044","date_published":"2013-07-01T00:00:00Z","publist_id":"4457","page":"559 - 575","title":"Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis","oa":1,"date_created":"2018-12-11T11:57:42Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis</i>. Vol. 8044, Springer, 2013, pp. 559–75, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">10.1007/978-3-642-39799-8_37</a>.","apa":"Chatterjee, K., Gaiser, A., &#38; Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">https://doi.org/10.1007/978-3-642-39799-8_37</a>","chicago":"Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">https://doi.org/10.1007/978-3-642-39799-8_37</a>.","ama":"Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">10.1007/978-3-642-39799-8_37</a>","ista":"Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.","ieee":"K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.","short":"K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575."},"arxiv":1,"quality_controlled":"1","conference":{"name":"CAV: Computer Aided Verification","start_date":"2013-07-13","end_date":"2013-07-19","location":"St. Petersburg, Russia"}},{"scopus_import":1,"abstract":[{"text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2020-08-11T10:09:47Z","author":[{"last_name":"Piskac","full_name":"Piskac, Ruzica","first_name":"Ruzica"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Wies, Thomas","last_name":"Wies"},{"orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien"}],"status":"public","_id":"2447","publication_status":"published","alternative_title":["LNCS"],"ddc":["000"],"file":[{"file_id":"7859","creator":"dernst","relation":"main_file","file_name":"2013_CAV_Piskac.pdf","checksum":"2e866932ab688f47ecd504acb4d5c7d4","file_size":309182,"date_created":"2020-05-15T11:13:01Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:41Z"}],"oa_version":"Submitted Version","type":"conference","publisher":"Springer","department":[{"_id":"ToHe"}],"year":"2013","month":"07","date_published":"2013-07-01T00:00:00Z","has_accepted_license":"1","intvolume":"      8044","volume":8044,"day":"01","article_processing_charge":"No","file_date_updated":"2020-07-14T12:45:41Z","doi":"10.1007/978-3-642-39799-8_54","conference":{"name":"CAV: Computer Aided Verification","start_date":"2013-07-13","location":"St. Petersburg, Russia","end_date":"2013-07-19"},"quality_controlled":"1","citation":{"ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.","apa":"Piskac, R., Wies, T., &#38; Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>","chicago":"Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>.","mla":"Piskac, Ruzica, et al. <i>Automating Separation Logic Using SMT</i>. Vol. 8044, Springer, 2013, pp. 773–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>."},"date_created":"2018-12-11T11:57:43Z","oa":1,"title":"Automating separation logic using SMT","publist_id":"4456","page":"773 - 789"},{"citation":{"chicago":"Remy, Estelle, Pawel Baster, Jiří Friml, and Paula Duque. “ZIFL1.1 Transporter Modulates Polar Auxin Transport by Stabilizing Membrane Abundance of Multiple PINs in Arabidopsis Root Tip.” <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis, 2013. <a href=\"https://doi.org/10.4161/psb.25688\">https://doi.org/10.4161/psb.25688</a>.","apa":"Remy, E., Baster, P., Friml, J., &#38; Duque, P. (2013). ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip. <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/psb.25688\">https://doi.org/10.4161/psb.25688</a>","mla":"Remy, Estelle, et al. “ZIFL1.1 Transporter Modulates Polar Auxin Transport by Stabilizing Membrane Abundance of Multiple PINs in Arabidopsis Root Tip.” <i>Plant Signaling &#38; Behavior</i>, vol. 8, no. 10, e25688, Taylor &#38; Francis, 2013, doi:<a href=\"https://doi.org/10.4161/psb.25688\">10.4161/psb.25688</a>.","ista":"Remy E, Baster P, Friml J, Duque P. 2013. ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip. Plant Signaling &#38; Behavior. 8(10), e25688.","short":"E. Remy, P. Baster, J. Friml, P. Duque, Plant Signaling &#38; Behavior 8 (2013).","ieee":"E. Remy, P. Baster, J. Friml, and P. Duque, “ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip,” <i>Plant Signaling &#38; Behavior</i>, vol. 8, no. 10. Taylor &#38; Francis, 2013.","ama":"Remy E, Baster P, Friml J, Duque P. ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip. <i>Plant Signaling &#38; Behavior</i>. 2013;8(10). doi:<a href=\"https://doi.org/10.4161/psb.25688\">10.4161/psb.25688</a>"},"date_created":"2018-12-11T11:57:43Z","quality_controlled":"1","oa":1,"article_number":"e25688","title":"ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip","publist_id":"4455","intvolume":"         8","date_published":"2013-07-10T00:00:00Z","day":"10","publication":"Plant Signaling & Behavior","volume":8,"pmid":1,"ec_funded":1,"article_processing_charge":"No","doi":"10.4161/psb.25688","oa_version":"Submitted Version","type":"journal_article","publication_status":"published","external_id":{"pmid":["23857365"]},"_id":"2448","issue":"10","publisher":"Taylor & Francis","department":[{"_id":"JiFr"}],"article_type":"original","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"year":"2013","month":"07","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4091088/","open_access":"1"}],"abstract":[{"lang":"eng","text":"Cell-to-cell directional flow of the phytohormone auxin is primarily established by polar localization of the PIN auxin transporters, a process tightly regulated at multiple levels by auxin itself. We recently reported that, in the context of strong auxin flows, activity of the vacuolar ZIFL1.1 transporter is required for fine-tuning of polar auxin transport rates in the Arabidopsis root. In particular, ZIFL1.1 function protects plasma-membrane stability of the PIN2 carrier in epidermal root tip cells under conditions normally triggering PIN2 degradation. Here, we show that ZIFL1.1 activity at the root tip also promotes PIN1 plasma-membrane abundance in central cylinder cells, thus supporting the notion that ZIFL1.1 acts as a general positive modulator of polar auxin transport in roots."}],"scopus_import":"1","date_updated":"2025-05-07T11:12:32Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"first_name":"Estelle","last_name":"Remy","full_name":"Remy, Estelle"},{"first_name":"Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","last_name":"Baster","full_name":"Baster, Pawel"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"first_name":"Paula","full_name":"Duque, Paula","last_name":"Duque"}]},{"publisher":"Cell Press","citation":{"ama":"Nodzyński T, Feraru M, Hirsch S, et al. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. <i>Molecular Plant</i>. 2013;6(6):1849-1862. doi:<a href=\"https://doi.org/10.1093/mp/sst044\">10.1093/mp/sst044</a>","ieee":"T. Nodzyński <i>et al.</i>, “Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis,” <i>Molecular Plant</i>, vol. 6, no. 6. Cell Press, pp. 1849–1862, 2013.","ista":"Nodzyński T, Feraru M, Hirsch S, De Rycke R, Nicuales C, Van Leene J, De Jaeger G, Vanneste S, Friml J. 2013. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 6(6), 1849–1862.","short":"T. Nodzyński, M. Feraru, S. Hirsch, R. De Rycke, C. Nicuales, J. Van Leene, G. De Jaeger, S. Vanneste, J. Friml, Molecular Plant 6 (2013) 1849–1862.","apa":"Nodzyński, T., Feraru, M., Hirsch, S., De Rycke, R., Nicuales, C., Van Leene, J., … Friml, J. (2013). Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. <i>Molecular Plant</i>. Cell Press. <a href=\"https://doi.org/10.1093/mp/sst044\">https://doi.org/10.1093/mp/sst044</a>","chicago":"Nodzyński, Tomasz, Murguel Feraru, Sibylle Hirsch, Riet De Rycke, Claudiu Nicuales, Jelle Van Leene, Geert De Jaeger, Steffen Vanneste, and Jiří Friml. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” <i>Molecular Plant</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1093/mp/sst044\">https://doi.org/10.1093/mp/sst044</a>.","mla":"Nodzyński, Tomasz, et al. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” <i>Molecular Plant</i>, vol. 6, no. 6, Cell Press, 2013, pp. 1849–62, doi:<a href=\"https://doi.org/10.1093/mp/sst044\">10.1093/mp/sst044</a>."},"date_created":"2018-12-11T11:57:44Z","type":"journal_article","oa_version":"None","_id":"2449","issue":"6","publication_status":"published","quality_controlled":"1","month":"11","year":"2013","publist_id":"4454","page":"1849 - 1862","title":"Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis","department":[{"_id":"JiFr"}],"volume":6,"date_updated":"2021-01-12T06:57:33Z","day":"01","publication":"Molecular Plant","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. "}],"intvolume":"         6","scopus_import":1,"date_published":"2013-11-01T00:00:00Z","doi":"10.1093/mp/sst044","author":[{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"first_name":"Murguel","full_name":"Feraru, Murguel","last_name":"Feraru"},{"first_name":"Sibylle","last_name":"Hirsch","full_name":"Hirsch, Sibylle"},{"first_name":"Riet","full_name":"De Rycke, Riet","last_name":"De Rycke"},{"last_name":"Nicuales","full_name":"Nicuales, Claudiu","first_name":"Claudiu"},{"first_name":"Jelle","full_name":"Van Leene, Jelle","last_name":"Van Leene"},{"full_name":"De Jaeger, Geert","last_name":"De Jaeger","first_name":"Geert"},{"first_name":"Steffen","full_name":"Vanneste, Steffen","last_name":"Vanneste"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"status":"public"},{"publication":"ACM Transactions on Graphics","day":"01","volume":32,"has_accepted_license":"1","intvolume":"        32","date_published":"2013-07-01T00:00:00Z","doi":"10.1145/2461912.2461982","file_date_updated":"2020-07-14T12:45:41Z","article_processing_charge":"No","oa":1,"article_number":"103","date_created":"2018-12-11T11:57:50Z","quality_controlled":"1","publist_id":"4436","title":"Highly adaptive liquid simulations on tetrahedral meshes","date_updated":"2024-11-19T11:56:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"We introduce a new method for efficiently simulating liquid with extreme amounts of spatial adaptivity. Our method combines several key components to drastically speed up the simulation of large-scale fluid phenomena: We leverage an alternative Eulerian tetrahedral mesh discretization to significantly reduce the complexity of the pressure solve while increasing the robustness with respect to element quality and removing the possibility of locking. Next, we enable subtle free-surface phenomena by deriving novel second-order boundary conditions consistent with our discretization. We couple this discretization with a spatially adaptive Fluid-Implicit Particle (FLIP) method, enabling efficient, robust, minimally-dissipative simulations that can undergo sharp changes in spatial resolution while minimizing artifacts. Along the way, we provide a new method for generating a smooth and detailed surface from a set of particles with variable sizes. Finally, we explore several new sizing functions for determining spatially adaptive simulation resolutions, and we show how to couple them to our simulator. We combine each of these elements to produce a simulation algorithm that is capable of creating animations at high maximum resolutions while avoiding common pitfalls like inaccurate boundary conditions and inefficient computation.","lang":"eng"}],"scopus_import":"1","status":"public","author":[{"last_name":"Ando","full_name":"Ando, Ryoichi","first_name":"Ryoichi"},{"full_name":"Thuerey, Nils","last_name":"Thuerey","first_name":"Nils"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"publisher":"ACM","pubrep_id":"605","type":"journal_article","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:41Z","file_size":8601561,"checksum":"aeea6b0ff2b27c695aeb8408c7d2fc50","date_created":"2018-12-12T10:17:25Z","file_name":"IST-2016-605-v1+1_tetflip_fixed.pdf","file_id":"5279","creator":"system","relation":"main_file"}],"ddc":["000"],"oa_version":"Submitted Version","publication_status":"published","_id":"2466","issue":"4","month":"07","year":"2013","department":[{"_id":"ChWo"}]},{"author":[{"first_name":"Gilbert","full_name":"Bernstein, Gilbert","last_name":"Bernstein"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-23T10:44:16Z","scopus_import":1,"abstract":[{"text":"This paper presents a method for computing topology changes for triangle meshes in an interactive geometric modeling environment. Most triangle meshes in practice do not exhibit desirable geometric properties, so we develop a solution that is independent of standard assumptions and robust to geometric errors. Specifically, we provide the first method for topology change applicable to arbitrary non-solid, non-manifold, non-closed, self-intersecting surfaces. We prove that this new method for topology change produces the expected conventional results when applied to solid (closed, manifold, non-self-intersecting) surfaces---that is, we prove a backwards-compatibility property relative to prior work. Beyond solid surfaces, we present empirical evidence that our method remains tolerant to a variety of surface aberrations through the incorporation of a novel error correction scheme. Finally, we demonstrate how topology change applied to non-solid objects enables wholly new and useful behaviors.","lang":"eng"}],"month":"07","year":"2013","department":[{"_id":"ChWo"}],"pubrep_id":"604","publisher":"ACM","issue":"4","_id":"2467","publication_status":"published","oa_version":"Submitted Version","ddc":["000"],"type":"journal_article","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:41Z","checksum":"9c8425d62246996ca632c5a01870515b","file_size":3514674,"date_created":"2018-12-12T10:09:43Z","file_name":"IST-2016-604-v1+1_toptop2013.pdf","creator":"system","file_id":"4768","relation":"main_file"}],"file_date_updated":"2020-07-14T12:45:41Z","doi":"10.1145/2461912.2462027","volume":32,"day":"01","publication":"ACM Transactions on Graphics","date_published":"2013-07-01T00:00:00Z","intvolume":"        32","has_accepted_license":"1","publist_id":"4435","title":"Putting holes in holey geometry: Topology change for arbitrary surfaces","article_number":"34","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:57:50Z","citation":{"ista":"Bernstein G, Wojtan C. 2013. Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. 32(4), 34.","short":"G. Bernstein, C. Wojtan, ACM Transactions on Graphics 32 (2013).","ieee":"G. Bernstein and C. Wojtan, “Putting holes in holey geometry: Topology change for arbitrary surfaces,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.","ama":"Bernstein G, Wojtan C. Putting holes in holey geometry: Topology change for arbitrary surfaces. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2462027\">10.1145/2461912.2462027</a>","mla":"Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology Change for Arbitrary Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, 34, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2462027\">10.1145/2461912.2462027</a>.","chicago":"Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology Change for Arbitrary Surfaces.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2462027\">https://doi.org/10.1145/2461912.2462027</a>.","apa":"Bernstein, G., &#38; Wojtan, C. (2013). Putting holes in holey geometry: Topology change for arbitrary surfaces. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2462027\">https://doi.org/10.1145/2461912.2462027</a>"}},{"publisher":"ACM","pubrep_id":"603","publication_status":"published","issue":"4","_id":"2468","file":[{"file_name":"IST-2016-603-v1+1_liquidError_web.pdf","file_id":"4761","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:41Z","file_size":5813685,"checksum":"53d905e0180e23ef3e813b969ffed4e1","date_created":"2018-12-12T10:09:37Z"}],"oa_version":"Submitted Version","ddc":["000"],"type":"journal_article","year":"2013","month":"07","department":[{"_id":"ChWo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-23T10:44:18Z","scopus_import":1,"abstract":[{"text":"Our work concerns the combination of an Eulerian liquid simulation with a high-resolution surface tracker (e.g. the level set method or a Lagrangian triangle mesh). The naive application of a high-resolution surface tracker to a low-resolution velocity field can produce many visually disturbing physical and topological artifacts that limit their use in practice. We address these problems by defining an error function which compares the current state of the surface tracker to the set of physically valid surface states. By reducing this error with a gradient descent technique, we introduce a novel physics-based surface fairing method. Similarly, by treating this error function as a potential energy, we derive a new surface correction force that mimics the vortex sheet equations. We demonstrate our results with both level set and mesh-based surface trackers.","lang":"eng"}],"status":"public","author":[{"id":"439F0C8C-F248-11E8-B48F-1D18A9856A87","first_name":"Morten","full_name":"Bojsen-Hansen, Morten","last_name":"Bojsen-Hansen","orcid":"0000-0002-4417-3224"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan"}],"oa":1,"article_number":"68","quality_controlled":"1","citation":{"ieee":"M. Bojsen-Hansen and C. Wojtan, “Liquid surface tracking with error compensation,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.","short":"M. Bojsen-Hansen, C. Wojtan, ACM Transactions on Graphics 32 (2013).","ista":"Bojsen-Hansen M, Wojtan C. 2013. Liquid surface tracking with error compensation. ACM Transactions on Graphics. 32(4), 68.","ama":"Bojsen-Hansen M, Wojtan C. Liquid surface tracking with error compensation. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461991\">10.1145/2461912.2461991</a>","mla":"Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error Compensation.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, 68, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461991\">10.1145/2461912.2461991</a>.","chicago":"Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error Compensation.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461991\">https://doi.org/10.1145/2461912.2461991</a>.","apa":"Bojsen-Hansen, M., &#38; Wojtan, C. (2013). Liquid surface tracking with error compensation. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461991\">https://doi.org/10.1145/2461912.2461991</a>"},"date_created":"2018-12-11T11:57:50Z","publist_id":"4434","title":"Liquid surface tracking with error compensation","publication":"ACM Transactions on Graphics","day":"01","volume":32,"date_published":"2013-07-01T00:00:00Z","has_accepted_license":"1","intvolume":"        32","file_date_updated":"2020-07-14T12:45:41Z","doi":"10.1145/2461912.2461991"},{"intvolume":"        23","has_accepted_license":"1","date_published":"2013-07-22T00:00:00Z","volume":23,"day":"22","publication":"Current Biology","pmid":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1016/j.cub.2013.06.019","file_date_updated":"2020-07-14T12:45:41Z","citation":{"chicago":"Maître, Jean-Léon, and Carl-Philipp J Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">https://doi.org/10.1016/j.cub.2013.06.019</a>.","apa":"Maître, J.-L., &#38; Heisenberg, C.-P. J. (2013). Three functions of cadherins in cell adhesion. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">https://doi.org/10.1016/j.cub.2013.06.019</a>","mla":"Maître, Jean-Léon, and Carl-Philipp J. Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” <i>Current Biology</i>, vol. 23, no. 14, Cell Press, 2013, pp. R626–33, doi:<a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">10.1016/j.cub.2013.06.019</a>.","ista":"Maître J-L, Heisenberg C-PJ. 2013. Three functions of cadherins in cell adhesion. Current Biology. 23(14), R626–R633.","ieee":"J.-L. Maître and C.-P. J. Heisenberg, “Three functions of cadherins in cell adhesion,” <i>Current Biology</i>, vol. 23, no. 14. Cell Press, pp. R626–R633, 2013.","short":"J.-L. Maître, C.-P.J. Heisenberg, Current Biology 23 (2013) R626–R633.","ama":"Maître J-L, Heisenberg C-PJ. Three functions of cadherins in cell adhesion. <i>Current Biology</i>. 2013;23(14):R626-R633. doi:<a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">10.1016/j.cub.2013.06.019</a>"},"date_created":"2018-12-11T11:57:51Z","quality_controlled":"1","oa":1,"title":"Three functions of cadherins in cell adhesion","publist_id":"4433","page":"R626 - R633","abstract":[{"text":"Cadherins are transmembrane proteins that mediate cell–cell adhesion in animals. By regulating contact formation and stability, cadherins play a crucial role in tissue morphogenesis and homeostasis. Here, we review the three major  unctions of cadherins in cell–cell contact formation and stability. Two of those functions lead to a decrease in interfacial ension at the forming cell–cell contact, thereby promoting contact expansion — first, by providing adhesion tension that lowers interfacial tension at the cell–cell contact, and second, by signaling to the actomyosin cytoskeleton in order to reduce cortex tension and thus interfacial tension at the contact. The third function of cadherins in cell–cell contact formation is to stabilize the contact by resisting mechanical forces that pull on the contact.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T06:57:40Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","full_name":"Maître, Jean-Léon","last_name":"Maître","orcid":"0000-0002-3688-1474"},{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"}],"status":"public","type":"journal_article","file":[{"date_created":"2019-01-24T15:40:22Z","checksum":"6a424b2f007b41d4955a9135793b2162","file_size":247320,"date_updated":"2020-07-14T12:45:41Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5881","creator":"dernst","file_name":"2013_CurrentBiology_Maitre.pdf"}],"oa_version":"Published Version","ddc":["570"],"issue":"14","_id":"2469","publication_status":"published","external_id":{"pmid":["23885883"]},"publisher":"Cell Press","department":[{"_id":"CaHe"}],"year":"2013","month":"07"},{"status":"public","author":[{"first_name":"Milada","last_name":"Čovanová","full_name":"Čovanová, Milada"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"first_name":"Jan","full_name":"Rychtář, Jan","last_name":"Rychtář"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"full_name":"Zažímalová, Eva","last_name":"Zažímalová","first_name":"Eva"}],"scopus_import":1,"abstract":[{"text":"Background:Auxin binding protein 1 (ABP1) is a putative auxin receptor and its function is indispensable for plant growth and development. ABP1 has been shown to be involved in auxin-dependent regulation of cell division and expansion, in plasma-membrane-related processes such as changes in transmembrane potential, and in the regulation of clathrin-dependent endocytosis. However, the ABP1-regulated downstream pathway remains elusive.Methodology/Principal Findings:Using auxin transport assays and quantitative analysis of cellular morphology we show that ABP1 regulates auxin efflux from tobacco BY-2 cells. The overexpression of ABP1can counterbalance increased auxin efflux and auxin starvation phenotypes caused by the overexpression of PIN auxin efflux carrier. Relevant mechanism involves the ABP1-controlled vesicle trafficking processes, including positive regulation of endocytosis of PIN auxin efflux carriers, as indicated by fluorescence recovery after photobleaching (FRAP) and pharmacological manipulations.Conclusions/Significance:The findings indicate the involvement of ABP1 in control of rate of auxin transport across plasma membrane emphasizing the role of ABP1 in regulation of PIN activity at the plasma membrane, and highlighting the relevance of ABP1 for the formation of developmentally important, PIN-dependent auxin gradients.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:57:40Z","department":[{"_id":"JiFr"}],"month":"07","year":"2013","publication_status":"published","issue":"7","_id":"2470","oa_version":"Published Version","file":[{"file_id":"4681","creator":"system","relation":"main_file","file_name":"IST-2016-413-v1+1_journal.pone.0070050.pdf","file_size":2294955,"checksum":"2d47ef47616ef4de1d517d146548184e","date_created":"2018-12-12T10:08:21Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:41Z"}],"ddc":["570"],"type":"journal_article","publisher":"Public Library of Science","pubrep_id":"413","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2020-07-14T12:45:41Z","doi":"10.1371/journal.pone.0070050","date_published":"2013-07-23T00:00:00Z","has_accepted_license":"1","intvolume":"         8","day":"23","publication":"PLoS One","volume":8,"title":"Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells","publist_id":"4432","quality_controlled":"1","citation":{"ieee":"M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, and E. Zažímalová, “Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science, 2013.","ista":"Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. 2013. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. 8(7), e70050.","short":"M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, E. Zažímalová, PLoS One 8 (2013).","ama":"Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. <i>PLoS One</i>. 2013;8(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0070050\">10.1371/journal.pone.0070050</a>","mla":"Čovanová, Milada, et al. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” <i>PLoS One</i>, vol. 8, no. 7, e70050, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0070050\">10.1371/journal.pone.0070050</a>.","chicago":"Čovanová, Milada, Michael Sauer, Jan Rychtář, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0070050\">https://doi.org/10.1371/journal.pone.0070050</a>.","apa":"Čovanová, M., Sauer, M., Rychtář, J., Friml, J., Petrášek, J., &#38; Zažímalová, E. (2013). Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0070050\">https://doi.org/10.1371/journal.pone.0070050</a>"},"date_created":"2018-12-11T11:57:51Z","oa":1,"article_number":"e70050"},{"date_published":"2013-07-30T00:00:00Z","has_accepted_license":"1","intvolume":"         8","day":"30","publication":"PLoS One","volume":8,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2020-07-14T12:45:41Z","doi":"10.1371/journal.pone.0070013","quality_controlled":"1","date_created":"2018-12-11T11:57:51Z","citation":{"mla":"Sanchez-Romero, Inmaculada, et al. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” <i>PLoS One</i>, vol. 8, no. 7, e70013, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0070013\">10.1371/journal.pone.0070013</a>.","apa":"Sanchez-Romero, I., Ariza, A., Wilson, K., Skjøt, M., Vind, J., De Maria, L., … Sánchez Ruiz, J. (2013). Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0070013\">https://doi.org/10.1371/journal.pone.0070013</a>","chicago":"Sanchez-Romero, Inmaculada, Antonio Ariza, Keith Wilson, Michael Skjøt, Jesper Vind, Leonardo De Maria, Lars Skov, and Jose Sánchez Ruiz. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0070013\">https://doi.org/10.1371/journal.pone.0070013</a>.","ama":"Sanchez-Romero I, Ariza A, Wilson K, et al. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. <i>PLoS One</i>. 2013;8(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0070013\">10.1371/journal.pone.0070013</a>","ista":"Sanchez-Romero I, Ariza A, Wilson K, Skjøt M, Vind J, De Maria L, Skov L, Sánchez Ruiz J. 2013. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. 8(7), e70013.","short":"I. Sanchez-Romero, A. Ariza, K. Wilson, M. Skjøt, J. Vind, L. De Maria, L. Skov, J. Sánchez Ruiz, PLoS One 8 (2013).","ieee":"I. Sanchez-Romero <i>et al.</i>, “Mechanism of protein kinetic stabilization by engineered disulfide crosslinks,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science, 2013."},"oa":1,"article_number":"e70013","title":"Mechanism of protein kinetic stabilization by engineered disulfide crosslinks","publist_id":"4430","scopus_import":1,"abstract":[{"text":"The impact of disulfide bonds on protein stability goes beyond simple equilibrium thermodynamics effects associated with the conformational entropy of the unfolded state. Indeed, disulfide crosslinks may play a role in the prevention of dysfunctional association and strongly affect the rates of irreversible enzyme inactivation, highly relevant in biotechnological applications. While these kinetic-stability effects remain poorly understood, by analogy with proposed mechanisms for processes of protein aggregation and fibrillogenesis, we propose that they may be determined by the properties of sparsely-populated, partially-unfolded intermediates. Here we report the successful design, on the basis of high temperature molecular-dynamics simulations, of six thermodynamically and kinetically stabilized variants of phytase from Citrobacter braakii (a biotechnologically important enzyme) with one, two or three engineered disulfides. Activity measurements and 3D crystal structure determination demonstrate that the engineered crosslinks do not cause dramatic alterations in the native structure. The inactivation kinetics for all the variants displays a strongly non-Arrhenius temperature dependence, with the time-scale for the irreversible denaturation process reaching a minimum at a given temperature within the range of the denaturation transition. We show this striking feature to be a signature of a key role played by a partially unfolded, intermediate state/ensemble. Energetic and mutational analyses confirm that the intermediate is highly unfolded (akin to a proposed critical intermediate in the misfolding of the prion protein), a result that explains the observed kinetic stabilization. Our results provide a rationale for the kinetic-stability consequences of disulfide-crosslink engineering and an experimental methodology to arrive at energetic/structural descriptions of the sparsely populated and elusive intermediates that play key roles in irreversible protein denaturation.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:57:41Z","status":"public","author":[{"first_name":"Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","full_name":"Sanchez Romero, Inmaculada","last_name":"Sanchez Romero"},{"first_name":"Antonio","last_name":"Ariza","full_name":"Ariza, Antonio"},{"first_name":"Keith","full_name":"Wilson, Keith","last_name":"Wilson"},{"first_name":"Michael","last_name":"Skjøt","full_name":"Skjøt, Michael"},{"full_name":"Vind, Jesper","last_name":"Vind","first_name":"Jesper"},{"last_name":"De Maria","full_name":"De Maria, Leonardo","first_name":"Leonardo"},{"first_name":"Lars","full_name":"Skov, Lars","last_name":"Skov"},{"last_name":"Sánchez Ruiz","full_name":"Sánchez Ruiz, Jose","first_name":"Jose"}],"publication_status":"published","_id":"2471","issue":"7","type":"journal_article","file":[{"date_updated":"2020-07-14T12:45:41Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:15:07Z","checksum":"c0c96cc76ed7ef0d036a31a7e33c9a37","file_size":1323666,"file_name":"IST-2016-414-v1+1_journal.pone.0070013.pdf","relation":"main_file","file_id":"5124","creator":"system"}],"oa_version":"Published Version","ddc":["570"],"publisher":"Public Library of Science","pubrep_id":"414","department":[{"_id":"HaJa"}],"year":"2013","month":"07"},{"department":[{"_id":"JiFr"},{"_id":"EvBe"}],"year":"2013","month":"07","project":[{"grant_number":"207362","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Hormonal cross-talk in plant organogenesis"},{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"file":[{"date_updated":"2020-07-14T12:45:41Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:16:34Z","checksum":"3be71828b6c2ba9c90eb7056e3f7f57a","file_size":9003465,"file_name":"IST-2015-393-v1+1_journal.pone.0070069.pdf","relation":"main_file","file_id":"5222","creator":"system"}],"oa_version":"Published Version","ddc":["580","570"],"type":"journal_article","_id":"2472","issue":"7","publication_status":"published","pubrep_id":"393","publisher":"Public Library of Science","author":[{"last_name":"Cazzonelli","full_name":"Cazzonelli, Christopher","first_name":"Christopher"},{"last_name":"Vanstraelen","full_name":"Vanstraelen, Marleen","first_name":"Marleen"},{"id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","first_name":"Sibu","orcid":"0000-0002-1998-6741","full_name":"Simon, Sibu","last_name":"Simon"},{"first_name":"Kuide","full_name":"Yin, Kuide","last_name":"Yin"},{"first_name":"Ashley","full_name":"Carron Arthur, Ashley","last_name":"Carron Arthur"},{"first_name":"Nazia","last_name":"Nisar","full_name":"Nisar, Nazia"},{"last_name":"Tarle","full_name":"Tarle, Gauri","first_name":"Gauri"},{"full_name":"Cuttriss, Abby","last_name":"Cuttriss","first_name":"Abby"},{"first_name":"Iain","full_name":"Searle, Iain","last_name":"Searle"},{"last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mathesius","full_name":"Mathesius, Ulrike","first_name":"Ulrike"},{"first_name":"Josette","last_name":"Masle","full_name":"Masle, Josette"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"first_name":"Barry","full_name":"Pogson, Barry","last_name":"Pogson"}],"status":"public","abstract":[{"lang":"eng","text":"Plant-specific PIN-formed (PIN) efflux transporters for the plant hormone auxin are required for tissue-specific directional auxin transport and cellular auxin homeostasis. The Arabidopsis PIN protein family has been shown to play important roles in developmental processes such as embryogenesis, organogenesis, vascular tissue differentiation, root meristem patterning and tropic growth. Here we analyzed roles of the less characterised Arabidopsis PIN6 auxin transporter. PIN6 is auxin-inducible and is expressed during multiple auxin-regulated developmental processes. Loss of pin6 function interfered with primary root growth and lateral root development. Misexpression of PIN6 affected auxin transport and interfered with auxin homeostasis in other growth processes such as shoot apical dominance, lateral root primordia development, adventitious root formation, root hair outgrowth and root waving. These changes in auxin-regulated growth correlated with a reduction in total auxin transport as well as with an altered activity of DR5-GUS auxin response reporter. Overall, the data indicate that PIN6 regulates auxin homeostasis during plant development."}],"scopus_import":1,"date_updated":"2021-01-12T06:57:41Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development","publist_id":"4431","date_created":"2018-12-11T11:57:52Z","citation":{"ama":"Cazzonelli C, Vanstraelen M, Simon S, et al. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. <i>PLoS One</i>. 2013;8(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0070069\">10.1371/journal.pone.0070069</a>","ieee":"C. Cazzonelli <i>et al.</i>, “Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science, 2013.","ista":"Cazzonelli C, Vanstraelen M, Simon S, Yin K, Carron Arthur A, Nisar N, Tarle G, Cuttriss A, Searle I, Benková E, Mathesius U, Masle J, Friml J, Pogson B. 2013. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. 8(7), e70069.","short":"C. Cazzonelli, M. Vanstraelen, S. Simon, K. Yin, A. Carron Arthur, N. Nisar, G. Tarle, A. Cuttriss, I. Searle, E. Benková, U. Mathesius, J. Masle, J. Friml, B. Pogson, PLoS One 8 (2013).","apa":"Cazzonelli, C., Vanstraelen, M., Simon, S., Yin, K., Carron Arthur, A., Nisar, N., … Pogson, B. (2013). Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0070069\">https://doi.org/10.1371/journal.pone.0070069</a>","chicago":"Cazzonelli, Christopher, Marleen Vanstraelen, Sibu Simon, Kuide Yin, Ashley Carron Arthur, Nazia Nisar, Gauri Tarle, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0070069\">https://doi.org/10.1371/journal.pone.0070069</a>.","mla":"Cazzonelli, Christopher, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” <i>PLoS One</i>, vol. 8, no. 7, e70069, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0070069\">10.1371/journal.pone.0070069</a>."},"quality_controlled":"1","article_number":"e70069","oa":1,"ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1371/journal.pone.0070069","file_date_updated":"2020-07-14T12:45:41Z","has_accepted_license":"1","intvolume":"         8","date_published":"2013-07-29T00:00:00Z","volume":8,"publication":"PLoS One","day":"29"},{"volume":87,"day":"03","publication":"Theoretical Population Biology","intvolume":"        87","has_accepted_license":"1","date_published":"2013-01-03T00:00:00Z","doi":"10.1016/j.tpb.2012.12.001","file_date_updated":"2020-07-14T12:45:41Z","ec_funded":1,"oa":1,"date_created":"2018-12-11T11:57:52Z","citation":{"short":"N.H. Barton, A. Etheridge, J. Kelleher, A. Véber, Theoretical Population Biology 87 (2013) 75–89.","ieee":"N. H. Barton, A. Etheridge, J. Kelleher, and A. Véber, “Genetic hitch-hiking in spatially extended populations,” <i>Theoretical Population Biology</i>, vol. 87, no. 8. Elsevier, pp. 75–89, 2013.","ista":"Barton NH, Etheridge A, Kelleher J, Véber A. 2013. Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. 87(8), 75–89.","ama":"Barton NH, Etheridge A, Kelleher J, Véber A. Genetic hitch-hiking in spatially extended populations. <i>Theoretical Population Biology</i>. 2013;87(8):75-89. doi:<a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">10.1016/j.tpb.2012.12.001</a>","mla":"Barton, Nicholas H., et al. “Genetic Hitch-Hiking in Spatially Extended Populations.” <i>Theoretical Population Biology</i>, vol. 87, no. 8, Elsevier, 2013, pp. 75–89, doi:<a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">10.1016/j.tpb.2012.12.001</a>.","chicago":"Barton, Nicholas H, Alison Etheridge, Jerome Kelleher, and Amandine Véber. “Genetic Hitch-Hiking in Spatially Extended Populations.” <i>Theoretical Population Biology</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">https://doi.org/10.1016/j.tpb.2012.12.001</a>.","apa":"Barton, N. H., Etheridge, A., Kelleher, J., &#38; Véber, A. (2013). Genetic hitch-hiking in spatially extended populations. <i>Theoretical Population Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">https://doi.org/10.1016/j.tpb.2012.12.001</a>"},"quality_controlled":"1","publist_id":"4428","page":"75 - 89","title":"Genetic hitch-hiking in spatially extended populations","date_updated":"2021-01-12T06:57:42Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"When a mutation with selective advantage s spreads through a panmictic population, it may cause two lineages at a linked locus to coalesce; the probability of coalescence is exp(−2rT), where T∼log(2Ns)/s is the time to fixation, N is the number of haploid individuals, and r is the recombination rate. Population structure delays fixation, and so weakens the effect of a selective sweep. However, favourable alleles spread through a spatially continuous population behind a narrow wavefront; ancestral lineages are confined at the tip of this front, and so coalesce rapidly. In extremely dense populations, coalescence is dominated by rare fluctuations ahead of the front. However, we show that for moderate densities, a simple quasi-deterministic approximation applies: the rate of coalescence within the front is λ∼2g(η)/(ρℓ), where ρ is the population density and  is the characteristic scale of the wavefront; g(η) depends only on the strength of random drift,  . The net effect of a sweep on coalescence also depends crucially on whether two lineages are ever both within the wavefront at the same time: even in the extreme case when coalescence within the front is instantaneous, the net rate of coalescence may be lower than in a single panmictic population. Sweeps can also have a substantial impact on the rate of gene flow. A single lineage will jump to a new location when it is hit by a sweep, with mean square displacement  ; this can be substantial if the species’ range, L, is large, even if the species-wide rate of sweeps per map length, Λ/R, is small. This effect is half as strong in two dimensions. In contrast, the rate of coalescence between lineages, at random locations in space and on the genetic map, is proportional to (c/L)(Λ/R), where c is the wavespeed: thus, on average, one-dimensional structure is likely to reduce coalescence due to sweeps, relative to panmixis. In two dimensions, genes must move along the front before they can coalesce; this process is rapid, being dominated by rare fluctuations. This leads to a dramatically higher rate of coalescence within the wavefront than if lineages simply diffused along the front. Nevertheless, the net rate of coalescence due to a sweep through a two-dimensional population is likely to be lower than it would be with panmixis.","lang":"eng"}],"scopus_import":1,"author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Etheridge","full_name":"Etheridge, Alison","first_name":"Alison"},{"last_name":"Kelleher","full_name":"Kelleher, Jerome","first_name":"Jerome"},{"first_name":"Amandine","last_name":"Véber","full_name":"Véber, Amandine"}],"status":"public","pubrep_id":"118","publisher":"Elsevier","ddc":["570"],"type":"journal_article","oa_version":"Submitted Version","file":[{"file_name":"IST-2013-118-v1+1_bartonetalRevision.pdf","relation":"main_file","file_id":"5376","creator":"system","date_updated":"2020-07-14T12:45:41Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:18:54Z","checksum":"4274ec1f433b838a7d5b941cc9684ca7","file_size":1706282}],"_id":"2473","issue":"8","publication_status":"published","year":"2013","month":"01","project":[{"grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"NiBa"}]},{"publisher":"IEEE","oa_version":"None","type":"journal_article","date_created":"2018-12-11T11:58:08Z","citation":{"mla":"Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:<a href=\"https://doi.org/10.1109/TPAMI.2013.140\">10.1109/TPAMI.2013.140</a>.","apa":"Lampert, C., Nickisch, H., &#38; Harmeling, S. (2013). Attribute-based classification for zero-shot learning of object categories. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2013.140\">https://doi.org/10.1109/TPAMI.2013.140</a>","chicago":"Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/TPAMI.2013.140\">https://doi.org/10.1109/TPAMI.2013.140</a>.","ama":"Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot learning of object categories. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2013;36(3):453-465. doi:<a href=\"https://doi.org/10.1109/TPAMI.2013.140\">10.1109/TPAMI.2013.140</a>","ista":"Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(3), 453–465.","short":"C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2013) 453–465.","ieee":"C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification for zero-shot learning of object categories,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 3. IEEE, pp. 453–465, 2013."},"publication_status":"published","quality_controlled":"1","issue":"3","_id":"2516","page":"453 - 465","publist_id":"4385","month":"07","year":"2013","department":[{"_id":"ChLa"}],"title":"Attribute-based classification for zero-shot learning of object categories","day":"30","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","volume":36,"date_updated":"2021-01-12T06:57:58Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        36","abstract":[{"lang":"eng","text":"We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object's color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes."}],"date_published":"2013-07-30T00:00:00Z","scopus_import":1,"doi":"10.1109/TPAMI.2013.140","status":"public","author":[{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"},{"first_name":"Hannes","full_name":"Nickisch, Hannes","last_name":"Nickisch"},{"first_name":"Stefan","last_name":"Harmeling","full_name":"Harmeling, Stefan"}]},{"month":"07","year":"2013","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","file":[{"file_size":363031,"checksum":"85afbf6c18a2c7e377c52c9410e2d824","date_created":"2020-05-15T11:16:12Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:42Z","creator":"dernst","file_id":"7860","relation":"main_file","file_name":"2013_ICALP_Almagor.pdf"}],"type":"conference","oa_version":"Submitted Version","ddc":["000"],"_id":"2517","issue":"Part 2","alternative_title":["LNCS"],"publication_status":"published","author":[{"first_name":"Shaull","last_name":"Almagor","full_name":"Almagor, Shaull"},{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"status":"public","series_title":"Lecture Notes in Computer Science","date_updated":"2020-08-11T10:09:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL.","lang":"eng"}],"scopus_import":1,"publist_id":"4384","page":"15 - 27","title":"Formalizing and reasoning about quality","oa":1,"citation":{"mla":"Almagor, Shaull, et al. <i>Formalizing and Reasoning about Quality</i>. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>.","ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27."},"date_created":"2018-12-11T11:58:08Z","conference":{"location":"Riga, Latvia","end_date":"2013-07-12","start_date":"2013-07-08","name":"ICALP: Automata, Languages and Programming"},"quality_controlled":"1","doi":"10.1007/978-3-642-39212-2_3","file_date_updated":"2020-07-14T12:45:42Z","ec_funded":1,"article_processing_charge":"No","volume":7966,"acknowledgement":"ERC Grant QUALITY. ","day":"01","intvolume":"      7966","has_accepted_license":"1","date_published":"2013-07-01T00:00:00Z"},{"intvolume":"      7965","date_published":"2013-07-01T00:00:00Z","volume":7965,"day":"01","doi":"10.1007/978-3-642-39206-1_53","date_created":"2018-12-11T11:58:08Z","citation":{"ieee":"V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.","short":"V. Kolmogorov, in:, Springer, 2013, pp. 625–636.","ista":"Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965, 625–636.","ama":"Kolmogorov V. The power of linear programming for finite-valued CSPs: A constructive characterization. In: Vol 7965. Springer; 2013:625-636. doi:<a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">10.1007/978-3-642-39206-1_53</a>","chicago":"Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">https://doi.org/10.1007/978-3-642-39206-1_53</a>.","apa":"Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">https://doi.org/10.1007/978-3-642-39206-1_53</a>","mla":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization</i>. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">10.1007/978-3-642-39206-1_53</a>."},"conference":{"start_date":"2013-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","location":"Riga, Latvia"},"arxiv":1,"quality_controlled":"1","oa":1,"title":"The power of linear programming for finite-valued CSPs: A constructive characterization","page":"625 - 636","publist_id":"4383","abstract":[{"text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard.","lang":"eng"}],"related_material":{"record":[{"id":"2271","relation":"later_version","status":"public"}]},"main_file_link":[{"url":"http://arxiv.org/abs/1207.7213","open_access":"1"}],"scopus_import":1,"date_updated":"2023-02-23T10:35:42Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"status":"public","oa_version":"Preprint","type":"conference","_id":"2518","issue":"1","external_id":{"arxiv":["1207.7213"]},"alternative_title":["LNCS"],"publication_status":"published","publisher":"Springer","department":[{"_id":"VlKo"}],"year":"2013","month":"07"},{"publication":"Proceedings of the 29th conference uncertainty in Artificial Intelligence","day":"11","has_accepted_license":"1","date_published":"2013-07-11T00:00:00Z","file_date_updated":"2020-07-14T12:45:42Z","oa":1,"date_created":"2018-12-11T11:58:09Z","citation":{"mla":"Quadrianto, Novi, et al. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>, AUAI Press, 2013, pp. 527–36.","apa":"Quadrianto, N., Sharmanska, V., Knowles, D., &#38; Ghahramani, Z. (2013). The supervised IBP: Neighbourhood preserving infinite latent feature models. In <i>Proceedings of the 29th conference uncertainty in Artificial Intelligence</i> (pp. 527–536). Bellevue, WA, United States: AUAI Press.","chicago":"Quadrianto, Novi, Viktoriia Sharmanska, David Knowles, and Zoubin Ghahramani. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” In <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>, 527–36. AUAI Press, 2013.","ama":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. The supervised IBP: Neighbourhood preserving infinite latent feature models. In: <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>. AUAI Press; 2013:527-536.","ista":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. 2013. The supervised IBP: Neighbourhood preserving infinite latent feature models. Proceedings of the 29th conference uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial Intelligence, 527–536.","ieee":"N. Quadrianto, V. Sharmanska, D. Knowles, and Z. Ghahramani, “The supervised IBP: Neighbourhood preserving infinite latent feature models,” in <i>Proceedings of the 29th conference uncertainty in Artificial Intelligence</i>, Bellevue, WA, United States, 2013, pp. 527–536.","short":"N. Quadrianto, V. Sharmanska, D. Knowles, Z. Ghahramani, in:, Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–536."},"conference":{"name":"UAI: Uncertainty in Artificial Intelligence","start_date":"2013-07-11","location":"Bellevue, WA, United States","end_date":"2013-07-15"},"quality_controlled":"1","page":"527 - 536","publist_id":"4381","title":"The supervised IBP: Neighbourhood preserving infinite latent feature models","date_updated":"2023-02-23T10:46:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"We propose a probabilistic model to infer supervised latent variables in\r\nthe Hamming space from observed data. Our model allows simultaneous\r\ninference of the number of binary latent variables, and their values. The\r\nlatent variables preserve neighbourhood structure of the data in a sense\r\nthat objects in the same semantic concept have similar latent values, and\r\nobjects in different concepts have dissimilar latent values. We formulate\r\nthe supervised infinite latent variable problem based on an intuitive\r\nprinciple of pulling objects together if they are of the same type, and\r\npushing them apart if they are not. We then combine this principle with a\r\nflexible Indian Buffet Process prior on the latent variables. We show that\r\nthe inferred supervised latent variables can be directly used to perform a\r\nnearest neighbour search for the purpose of retrieval.  We introduce a new\r\napplication of dynamically extending hash codes, and show how to\r\neffectively couple the structure of the hash codes with continuously\r\ngrowing structure of the neighbourhood preserving infinite latent feature\r\nspace.","lang":"eng"}],"scopus_import":1,"author":[{"first_name":"Novi","full_name":"Quadrianto, Novi","last_name":"Quadrianto"},{"id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","first_name":"Viktoriia","orcid":"0000-0003-0192-9308","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia"},{"first_name":"David","full_name":"Knowles, David","last_name":"Knowles"},{"first_name":"Zoubin","last_name":"Ghahramani","full_name":"Ghahramani, Zoubin"}],"status":"public","pubrep_id":"137","publisher":"AUAI Press","file":[{"file_name":"IST-2013-137-v1+1_QuaShaKnoGha13.pdf","file_id":"5134","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:42Z","checksum":"325f20c4b926bd74d39006b97df572bd","file_size":1117100,"date_created":"2018-12-12T10:15:16Z"}],"type":"conference","ddc":["000"],"oa_version":"Submitted Version","_id":"2520","publication_status":"published","publication_identifier":{"isbn":["9780974903996"]},"month":"07","year":"2013","department":[{"_id":"ChLa"}]},{"doi":"10.4171/JEMS/416","volume":15,"publication":"Journal of the European Mathematical Society","day":"16","date_published":"2013-10-16T00:00:00Z","intvolume":"        15","page":"2093 - 2113","publist_id":"4198","title":"Stability and semiclassics in self-generated fields","oa":1,"arxiv":1,"quality_controlled":"1","citation":{"ama":"Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated fields. <i>Journal of the European Mathematical Society</i>. 2013;15(6):2093-2113. doi:<a href=\"https://doi.org/10.4171/JEMS/416\">10.4171/JEMS/416</a>","ieee":"L. Erdös, S. Fournais, and J. Solovej, “Stability and semiclassics in self-generated fields,” <i>Journal of the European Mathematical Society</i>, vol. 15, no. 6. European Mathematical Society, pp. 2093–2113, 2013.","short":"L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society 15 (2013) 2093–2113.","ista":"Erdös L, Fournais S, Solovej J. 2013. Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. 15(6), 2093–2113.","mla":"Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.” <i>Journal of the European Mathematical Society</i>, vol. 15, no. 6, European Mathematical Society, 2013, pp. 2093–113, doi:<a href=\"https://doi.org/10.4171/JEMS/416\">10.4171/JEMS/416</a>.","apa":"Erdös, L., Fournais, S., &#38; Solovej, J. (2013). Stability and semiclassics in self-generated fields. <i>Journal of the European Mathematical Society</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JEMS/416\">https://doi.org/10.4171/JEMS/416</a>","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics in Self-Generated Fields.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society, 2013. <a href=\"https://doi.org/10.4171/JEMS/416\">https://doi.org/10.4171/JEMS/416</a>."},"date_created":"2018-12-11T11:59:07Z","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"first_name":"Søren","full_name":"Fournais, Søren","last_name":"Fournais"},{"first_name":"Jan","full_name":"Solovej, Jan","last_name":"Solovej"}],"status":"public","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:59:07Z","abstract":[{"lang":"eng","text":"We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator."}],"main_file_link":[{"url":"http://arxiv.org/abs/1105.0506","open_access":"1"}],"month":"10","year":"2013","department":[{"_id":"LaEr"}],"publisher":"European Mathematical Society","_id":"2698","issue":"6","publication_status":"published","external_id":{"arxiv":["1105.0506"]},"oa_version":"Preprint","type":"journal_article"},{"quality_controlled":"1","conference":{"start_date":"2013-07-06","name":"GECCO: Genetic and evolutionary computation conference","location":"Amsterdam, Netherlands","end_date":"2013-07-10"},"citation":{"ista":"Barton NH, Paixao T. 2013. Can quantitative and population genetics help us understand evolutionary computation? Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 1573–1580.","ieee":"N. H. Barton and T. Paixao, “Can quantitative and population genetics help us understand evolutionary computation?,” in <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i>, Amsterdam, Netherlands, 2013, pp. 1573–1580.","short":"N.H. Barton, T. Paixao, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–1580.","ama":"Barton NH, Paixao T. Can quantitative and population genetics help us understand evolutionary computation? In: <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>. ACM; 2013:1573-1580. doi:<a href=\"https://doi.org/10.1145/2463372.2463568\">10.1145/2463372.2463568</a>","chicago":"Barton, Nicholas H, and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” In <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, 1573–80. ACM, 2013. <a href=\"https://doi.org/10.1145/2463372.2463568\">https://doi.org/10.1145/2463372.2463568</a>.","apa":"Barton, N. H., &#38; Paixao, T. (2013). Can quantitative and population genetics help us understand evolutionary computation? In <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i> (pp. 1573–1580). Amsterdam, Netherlands: ACM. <a href=\"https://doi.org/10.1145/2463372.2463568\">https://doi.org/10.1145/2463372.2463568</a>","mla":"Barton, Nicholas H., and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, ACM, 2013, pp. 1573–80, doi:<a href=\"https://doi.org/10.1145/2463372.2463568\">10.1145/2463372.2463568</a>."},"date_created":"2018-12-11T11:59:14Z","oa":1,"title":"Can quantitative and population genetics help us understand evolutionary computation?","publist_id":"4174","page":"1573 - 1580","date_published":"2013-07-01T00:00:00Z","has_accepted_license":"1","publication":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","day":"01","ec_funded":1,"file_date_updated":"2020-07-14T12:45:45Z","doi":"10.1145/2463372.2463568","publication_status":"published","_id":"2718","ddc":["570"],"file":[{"file_name":"IST-2016-564-v1+1_NickGECCO_2013_1_-1.pdf","creator":"system","file_id":"5159","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:45Z","file_size":475844,"checksum":"9d9be9090ce5c20766e0eb076ace5b98","date_created":"2018-12-12T10:15:38Z"}],"oa_version":"Submitted Version","type":"conference","publisher":"ACM","pubrep_id":"564","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"project":[{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"year":"2013","month":"07","scopus_import":1,"abstract":[{"lang":"eng","text":"Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C."}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:59:15Z","status":"public","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Paixao, Tiago","last_name":"Paixao","orcid":"0000-0003-2361-3953","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"day":"01","publication":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","date_updated":"2021-01-12T06:59:15Z","date_published":"2013-07-01T00:00:00Z","scopus_import":1,"abstract":[{"lang":"eng","text":"Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation."}],"doi":"10.1145/2463372.2463470","status":"public","author":[{"orcid":"0000-0003-2361-3953","last_name":"Paixao","full_name":"Paixao, Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago"},{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"ec_funded":1,"publisher":"ACM","publication_status":"published","quality_controlled":"1","conference":{"name":"GECCO: Genetic and evolutionary computation conference","start_date":"2013-07-06","location":"Amsterdam, Netherlands","end_date":"2013-07-10"},"_id":"2719","type":"conference","oa_version":"None","citation":{"ama":"Paixao T, Barton NH. A variance decomposition approach to the analysis of genetic algorithms. In: <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>. ACM; 2013:845-852. doi:<a href=\"https://doi.org/10.1145/2463372.2463470\">10.1145/2463372.2463470</a>","short":"T. Paixao, N.H. Barton, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–852.","ista":"Paixao T, Barton NH. 2013. A variance decomposition approach to the analysis of genetic algorithms. Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 845–852.","ieee":"T. Paixao and N. H. Barton, “A variance decomposition approach to the analysis of genetic algorithms,” in <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i>, Amsterdam, Netherlands, 2013, pp. 845–852.","apa":"Paixao, T., &#38; Barton, N. H. (2013). A variance decomposition approach to the analysis of genetic algorithms. In <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i> (pp. 845–852). Amsterdam, Netherlands: ACM. <a href=\"https://doi.org/10.1145/2463372.2463470\">https://doi.org/10.1145/2463372.2463470</a>","chicago":"Paixao, Tiago, and Nicholas H Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” In <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, 845–52. ACM, 2013. <a href=\"https://doi.org/10.1145/2463372.2463470\">https://doi.org/10.1145/2463372.2463470</a>.","mla":"Paixao, Tiago, and Nicholas H. Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, ACM, 2013, pp. 845–52, doi:<a href=\"https://doi.org/10.1145/2463372.2463470\">10.1145/2463372.2463470</a>."},"date_created":"2018-12-11T11:59:15Z","publist_id":"4173","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152"}],"page":"845 - 852","year":"2013","month":"07","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"title":"A variance decomposition approach to the analysis of genetic algorithms"}]