[{"publist_id":"5661","date_created":"2018-12-11T11:52:28Z","conference":{"start_date":"2013-09-10","location":"Berlin, Germany","end_date":"2013-09-13","name":"QMath: Mathematical Results in Quantum Physics"},"month":"01","arxiv":1,"status":"public","date_published":"2014-01-01T00:00:00Z","external_id":{"arxiv":["1403.2563"]},"page":"127 - 137","publisher":"World Scientific Publishing","publication":"Proceedings of the QMath12 Conference","title":"On the BCS gap equation for superfluid fermionic gases","doi":"10.1142/9789814618144_0007","language":[{"iso":"eng"}],"oa":1,"_id":"1516","department":[{"_id":"RoSe"}],"publication_status":"published","abstract":[{"text":"We present a rigorous derivation of the BCS gap equation for superfluid fermionic gases with point interactions. Our starting point is the BCS energy functional, whose minimizer we investigate in the limit when the range of the interaction potential goes to zero.\r\n","lang":"eng"}],"citation":{"mla":"Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic Gases.” <i>Proceedings of the QMath12 Conference</i>, World Scientific Publishing, 2014, pp. 127–37, doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>.","apa":"Bräunlich, G., Hainzl, C., &#38; Seiringer, R. (2014). On the BCS gap equation for superfluid fermionic gases. In <i>Proceedings of the QMath12 Conference</i> (pp. 127–137). Berlin, Germany: World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>","ieee":"G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid fermionic gases,” in <i>Proceedings of the QMath12 Conference</i>, Berlin, Germany, 2014, pp. 127–137.","ama":"Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid fermionic gases. In: <i>Proceedings of the QMath12 Conference</i>. World Scientific Publishing; 2014:127-137. doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>","short":"G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference, World Scientific Publishing, 2014, pp. 127–137.","chicago":"Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS Gap Equation for Superfluid Fermionic Gases.” In <i>Proceedings of the QMath12 Conference</i>, 127–37. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>.","ista":"Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results in Quantum Physics, 127–137."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1403.2563"}],"article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bräunlich, Gerhard","first_name":"Gerhard","last_name":"Bräunlich"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"quality_controlled":"1","date_updated":"2021-01-12T06:51:19Z","type":"conference","oa_version":"Preprint","day":"01","year":"2014"},{"date_published":"2014-03-01T00:00:00Z","file":[{"access_level":"open_access","checksum":"7f91e588a4e888610313b98271e6418e","file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","date_updated":"2020-07-14T12:45:07Z","file_id":"4876","file_size":9832561,"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:11:22Z","relation":"main_file"}],"day":"01","type":"journal_article","date_updated":"2021-01-12T06:52:06Z","oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.1145/2591010","department":[{"_id":"ChWo"}],"has_accepted_license":"1","publisher":"ACM","file_date_updated":"2020-07-14T12:45:07Z","issue":"2","volume":33,"pubrep_id":"577","article_number":"15","status":"public","date_created":"2018-12-11T11:53:08Z","month":"03","publist_id":"5526","intvolume":"        33","year":"2014","quality_controlled":"1","author":[{"full_name":"Guerrero, Paul","last_name":"Guerrero","first_name":"Paul"},{"first_name":"Stefan","last_name":"Jeschke","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wimmer, Michael","last_name":"Wimmer","first_name":"Michael"},{"first_name":"Peter","last_name":"Wonka","full_name":"Wonka, Peter"}],"citation":{"ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>.","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2014). Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations."}],"oa":1,"ddc":["000"],"_id":"1629","title":"Edit propagation using geometric relationship functions","publication":"ACM Transactions on Graphics"},{"department":[{"_id":"KrPi"}],"doi":"10.1007/978-3-319-10879-7_7","language":[{"iso":"eng"}],"ec_funded":1,"day":"01","oa_version":"Submitted Version","date_updated":"2021-01-12T06:52:12Z","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"alternative_title":["LNCS"],"page":"95 - 114","date_published":"2014-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al."}],"publication_status":"published","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"_id":"1643","oa":1,"publication":"SCN 2014","title":"Constrained Verifiable Random Functions ","year":"2014","author":[{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"}],"citation":{"mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>.","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &#38; R. De Prisco (Eds.), <i>SCN 2014</i> (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. <i>SCN 2014</i>. Vol 8642. Springer; 2014:95-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114.","chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>."},"main_file_link":[{"url":"http://eprint.iacr.org/2014/537","open_access":"1"}],"status":"public","month":"01","conference":{"start_date":"2014-09-03","location":"Amalfi, Italy","end_date":"2014-09-05","name":"SCN: Security and Cryptography for Networks"},"date_created":"2018-12-11T11:53:13Z","publist_id":"5509","intvolume":"      8642","editor":[{"first_name":"Michel","last_name":"Abdalla","full_name":"Abdalla, Michel"},{"full_name":"De Prisco, Roberto","first_name":"Roberto","last_name":"De Prisco"}],"publisher":"Springer","volume":8642},{"publisher":"Open Publishing","date_published":"2014-12-02T00:00:00Z","page":"31 - 38","volume":169,"month":"12","conference":{"name":"HCVS: Horn Clauses for Verification and Synthesis","end_date":"2014-07-17","location":"Vienna, Austria","start_date":"2014-07-17"},"date_created":"2018-12-11T11:53:33Z","status":"public","alternative_title":["EPTCS"],"intvolume":"       169","publist_id":"5435","oa_version":"Submitted Version","date_updated":"2021-01-12T06:52:38Z","type":"conference","year":"2014","day":"02","main_file_link":[{"url":"http://arxiv.org/abs/1303.7378v2","open_access":"1"}],"citation":{"chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 169:31–38. Open Publishing, 2014. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.","ista":"Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 169. Open Publishing; 2014:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Vienna, Austria, 2014, vol. 169, pp. 31–38.","mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 169, Open Publishing, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"first_name":"Andrey","last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools."}],"publication_status":"published","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","title":"Generalised interpolation by solving recursion free-horn clauses","_id":"1702","department":[{"_id":"ToHe"}],"oa":1,"doi":"10.4204/EPTCS.169.5","language":[{"iso":"eng"}]},{"_id":"1708","department":[{"_id":"GaTk"}],"language":[{"iso":"eng"}],"title":"Spatio-temporal representations of uncertainty in spiking neural networks","abstract":[{"lang":"eng","text":"It has been long argued that, because of inherent ambiguity and noise, the brain needs to represent uncertainty in the form of probability distributions. The neural encoding of such distributions remains however highly controversial. Here we present a novel circuit model for representing multidimensional real-valued distributions using a spike based spatio-temporal code. Our model combines the computational advantages of the currently competing models for probabilistic codes and exhibits realistic neural responses along a variety of classic measures. Furthermore, the model highlights the challenges associated with interpreting neural activity in relation to behavioral uncertainty and points to alternative population-level approaches for the experimental validation of distributed representations."}],"publication_status":"published","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3933349E-F248-11E8-B48F-1D18A9856A87","full_name":"Savin, Cristina","first_name":"Cristina","last_name":"Savin"},{"first_name":"Sophie","last_name":"Denève","full_name":"Denève, Sophie"}],"main_file_link":[{"url":"http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf"}],"citation":{"apa":"Savin, C., &#38; Denève, S. (2014). Spatio-temporal representations of uncertainty in spiking neural networks (Vol. 3, pp. 2024–2032). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems.","mla":"Savin, Cristina, and Sophie Denève. <i>Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks</i>. Vol. 3, no. January, Neural Information Processing Systems, 2014, pp. 2024–32.","ieee":"C. Savin and S. Denève, “Spatio-temporal representations of uncertainty in spiking neural networks,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2014, vol. 3, no. January, pp. 2024–2032.","ama":"Savin C, Denève S. Spatio-temporal representations of uncertainty in spiking neural networks. In: Vol 3. Neural Information Processing Systems; 2014:2024-2032.","short":"C. Savin, S. Denève, in:, Neural Information Processing Systems, 2014, pp. 2024–2032.","chicago":"Savin, Cristina, and Sophie Denève. “Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks,” 3:2024–32. Neural Information Processing Systems, 2014.","ista":"Savin C, Denève S. 2014. Spatio-temporal representations of uncertainty in spiking neural networks. NIPS: Neural Information Processing Systems vol. 3, 2024–2032."},"year":"2014","day":"01","oa_version":"None","date_updated":"2021-01-12T06:52:40Z","type":"conference","scopus_import":1,"publist_id":"5427","intvolume":"         3","status":"public","month":"01","conference":{"location":"Montreal, Canada","start_date":"2014-12-08","end_date":"2014-12-13","name":"NIPS: Neural Information Processing Systems"},"date_created":"2018-12-11T11:53:35Z","issue":"January","page":"2024 - 2032","volume":3,"date_published":"2014-01-01T00:00:00Z","publisher":"Neural Information Processing Systems"},{"scopus_import":1,"page":"348 - 363","date_published":"2014-12-04T00:00:00Z","doi":"10.1016/j.tcs.2014.08.019","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ec_funded":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"04","date_updated":"2023-02-23T11:04:00Z","type":"journal_article","oa_version":"Submitted Version","publist_id":"5392","intvolume":"       560","status":"public","date_created":"2018-12-11T11:53:43Z","month":"12","issue":"3","volume":560,"publisher":"Elsevier","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2916"}]},"oa":1,"_id":"1733","publication":"Theoretical Computer Science","title":"Interface simulation distances","publication_status":"published","abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny"},{"last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"citation":{"ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>."},"year":"2014"},{"publication_status":"published","abstract":[{"lang":"eng","text":"Metal silicides formed by means of thermal annealing processes are employed as contact materials in microelectronics. Control of the structure of silicide/silicon interfaces becomes a critical issue when the characteristic size of the device is reduced below a few tens of nanometers. Here, we report on silicide clustering occurring within the channel of PtSi/Si/PtSi Schottky-barrier transistors. This phenomenon is investigated through atomistic simulations and low-temperature resonant-tunneling spectroscopy. Our results provide evidence for the segregation of a PtSi cluster with a diameter of a few nanometers from the silicide contact. The cluster acts as a metallic quantum dot giving rise to distinct signatures of quantum transport through its discrete energy states."}],"acknowledgement":"This work was supported by the Agence Nationale de la Recherche and by the EU through the ERC Starting Grant HybridNano","doi":"10.1103/PhysRevX.3.041025","oa":1,"_id":"1761","publication":"Physical Review X","title":"PtSi clustering in silicon probed by transport spectroscopy","day":"01","year":"2014","type":"journal_article","date_updated":"2021-01-12T06:53:02Z","extern":1,"author":[{"full_name":"Mongillo, Massimo","last_name":"Mongillo","first_name":"Massimo"},{"full_name":"Spathis, Panayotis N","last_name":"Spathis","first_name":"Panayotis"},{"full_name":"Georgios Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios"},{"full_name":"De Franceschi, Silvano","first_name":"Silvano","last_name":"De Franceschi"},{"first_name":"Pascal","last_name":"Gentile","full_name":"Gentile, Pascal"},{"first_name":"Riccardo","last_name":"Rurali","full_name":"Rurali, Riccardo"},{"full_name":"Cartoixà, Xavier","first_name":"Xavier","last_name":"Cartoixà"}],"quality_controlled":0,"citation":{"mla":"Mongillo, Massimo, et al. “PtSi Clustering in Silicon Probed by Transport Spectroscopy.” <i>Physical Review X</i>, vol. 3, no. 4, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevX.3.041025\">10.1103/PhysRevX.3.041025</a>.","apa":"Mongillo, M., Spathis, P., Katsaros, G., De Franceschi, S., Gentile, P., Rurali, R., &#38; Cartoixà, X. (2014). PtSi clustering in silicon probed by transport spectroscopy. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevX.3.041025\">https://doi.org/10.1103/PhysRevX.3.041025</a>","short":"M. Mongillo, P. Spathis, G. Katsaros, S. De Franceschi, P. Gentile, R. Rurali, X. Cartoixà, Physical Review X 3 (2014).","chicago":"Mongillo, Massimo, Panayotis Spathis, Georgios Katsaros, Silvano De Franceschi, Pascal Gentile, Riccardo Rurali, and Xavier Cartoixà. “PtSi Clustering in Silicon Probed by Transport Spectroscopy.” <i>Physical Review X</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevX.3.041025\">https://doi.org/10.1103/PhysRevX.3.041025</a>.","ista":"Mongillo M, Spathis P, Katsaros G, De Franceschi S, Gentile P, Rurali R, Cartoixà X. 2014. PtSi clustering in silicon probed by transport spectroscopy. Physical Review X. 3(4).","ama":"Mongillo M, Spathis P, Katsaros G, et al. PtSi clustering in silicon probed by transport spectroscopy. <i>Physical Review X</i>. 2014;3(4). doi:<a href=\"https://doi.org/10.1103/PhysRevX.3.041025\">10.1103/PhysRevX.3.041025</a>","ieee":"M. Mongillo <i>et al.</i>, “PtSi clustering in silicon probed by transport spectroscopy,” <i>Physical Review X</i>, vol. 3, no. 4. American Physical Society, 2014."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.5413"}],"status":"public","date_created":"2018-12-11T11:53:52Z","month":"01","publist_id":"5363","intvolume":"         3","publisher":"American Physical Society","issue":"4","volume":3,"date_published":"2014-01-01T00:00:00Z"},{"_id":"1791","doi":"10.1016/j.neuron.2014.04.036","publication":"Neuron","title":"Off-target effect of doublecortin family shRNA on neuronal migration associated with endogenous MicroRNA dysregulation","abstract":[{"lang":"eng","text":"Acute gene inactivation using short hairpin RNA (shRNA, knockdown) in developing brain is a powerful technique to study genetic function; however, discrepancies between knockdown and knockout murine phenotypes have left unanswered questions. For example, doublecortin (Dcx) knockdown but not knockout shows a neocortical neuronal migration phenotype. Here we report that in utero electroporation of shRNA, but not siRNA or miRNA, to Dcx demonstrates a migration phenotype in Dcx knockouts akin to the effect in wild-type mice, suggestingshRNA-mediated off-target toxicity. This effect wasnot limited to Dcx, as it was observed in Dclk1 knockouts, as well as with a fraction of scrambled shRNAs, suggesting a sequence-dependent but not sequence-specific effect. Profiling RNAs from electroporated cells showed a defect in endogenous let7 miRNA levels, and disruption of let7 or Dicer recapitulated the migration defect. The results suggest that shRNA-mediated knockdown can produce untoward migration effects by altering endogenous miRNA pathways."}],"publication_status":"published","acknowledgement":"This work was supported by the National Institutes of Health R01NS41537. G.K. was supported by an EMBO Long Term Fellowship, S.L.B. by the A.P. Giannini Fellowship, and A.G.F. by the Brain Behavior Research Foundation","quality_controlled":0,"extern":1,"author":[{"full_name":"Baek, SeungTae","first_name":"Seungtae","last_name":"Baek"},{"first_name":"Géraldine","last_name":"Kerjan","full_name":"Kerjan, Géraldine"},{"first_name":"Stephanie","last_name":"Bielas","full_name":"Bielas, Stephanie L"},{"full_name":"Lee, Jieun","last_name":"Lee","first_name":"Jieun"},{"full_name":"Fenstermaker, Ali G","last_name":"Fenstermaker","first_name":"Ali"},{"first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Gaia Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gleeson, Joseph G","first_name":"Joseph","last_name":"Gleeson"}],"citation":{"apa":"Baek, S., Kerjan, G., Bielas, S., Lee, J., Fenstermaker, A., Novarino, G., &#38; Gleeson, J. (2014). Off-target effect of doublecortin family shRNA on neuronal migration associated with endogenous MicroRNA dysregulation. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2014.04.036\">https://doi.org/10.1016/j.neuron.2014.04.036</a>","mla":"Baek, Seungtae, et al. “Off-Target Effect of Doublecortin Family ShRNA on Neuronal Migration Associated with Endogenous MicroRNA Dysregulation.” <i>Neuron</i>, vol. 82, no. 6, Elsevier, 2014, pp. 1255–62, doi:<a href=\"https://doi.org/10.1016/j.neuron.2014.04.036\">10.1016/j.neuron.2014.04.036</a>.","ieee":"S. Baek <i>et al.</i>, “Off-target effect of doublecortin family shRNA on neuronal migration associated with endogenous MicroRNA dysregulation,” <i>Neuron</i>, vol. 82, no. 6. Elsevier, pp. 1255–1262, 2014.","ama":"Baek S, Kerjan G, Bielas S, et al. Off-target effect of doublecortin family shRNA on neuronal migration associated with endogenous MicroRNA dysregulation. <i>Neuron</i>. 2014;82(6):1255-1262. doi:<a href=\"https://doi.org/10.1016/j.neuron.2014.04.036\">10.1016/j.neuron.2014.04.036</a>","ista":"Baek S, Kerjan G, Bielas S, Lee J, Fenstermaker A, Novarino G, Gleeson J. 2014. Off-target effect of doublecortin family shRNA on neuronal migration associated with endogenous MicroRNA dysregulation. Neuron. 82(6), 1255–1262.","short":"S. Baek, G. Kerjan, S. Bielas, J. Lee, A. Fenstermaker, G. Novarino, J. Gleeson, Neuron 82 (2014) 1255–1262.","chicago":"Baek, Seungtae, Géraldine Kerjan, Stephanie Bielas, Jieun Lee, Ali Fenstermaker, Gaia Novarino, and Joseph Gleeson. “Off-Target Effect of Doublecortin Family ShRNA on Neuronal Migration Associated with Endogenous MicroRNA Dysregulation.” <i>Neuron</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.neuron.2014.04.036\">https://doi.org/10.1016/j.neuron.2014.04.036</a>."},"year":"2014","day":"18","date_updated":"2021-01-12T06:53:13Z","type":"journal_article","publist_id":"5322","intvolume":"        82","status":"public","month":"06","date_created":"2018-12-11T11:54:01Z","volume":82,"issue":"6","page":"1255 - 1262","date_published":"2014-06-18T00:00:00Z","publisher":"Elsevier"},{"date_published":"2014-04-01T00:00:00Z","page":"143 - 170","publisher":"Springer","editor":[{"last_name":"Zažímalová","first_name":"Eva","full_name":"Zažímalová, Eva"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"orcid":"0000-0002-8510-9739","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","last_name":"Benková"}],"publist_id":"5304","scopus_import":1,"date_created":"2018-12-11T11:54:07Z","month":"04","status":"public","citation":{"ama":"Baster P, Friml J. Auxin on the road navigated by cellular PIN polarity. In: Zažímalová E, Petrášek J, Benková E, eds. <i>Auxin and Its Role in Plant Development</i>. Springer; 2014:143-170. doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">10.1007/978-3-7091-1526-8_8</a>","ieee":"P. Baster and J. Friml, “Auxin on the road navigated by cellular PIN polarity,” in <i>Auxin and Its Role in Plant Development</i>, E. Zažímalová, J. Petrášek, and E. Benková, Eds. Springer, 2014, pp. 143–170.","chicago":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” In <i>Auxin and Its Role in Plant Development</i>, edited by Eva Zažímalová, Jan Petrášek, and Eva Benková, 143–70. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">https://doi.org/10.1007/978-3-7091-1526-8_8</a>.","short":"P. Baster, J. Friml, in:, E. Zažímalová, J. Petrášek, E. Benková (Eds.), Auxin and Its Role in Plant Development, Springer, 2014, pp. 143–170.","ista":"Baster P, Friml J. 2014.Auxin on the road navigated by cellular PIN polarity. In: Auxin and Its Role in Plant Development. , 143–170.","apa":"Baster, P., &#38; Friml, J. (2014). Auxin on the road navigated by cellular PIN polarity. In E. Zažímalová, J. Petrášek, &#38; E. Benková (Eds.), <i>Auxin and Its Role in Plant Development</i> (pp. 143–170). Springer. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">https://doi.org/10.1007/978-3-7091-1526-8_8</a>","mla":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” <i>Auxin and Its Role in Plant Development</i>, edited by Eva Zažímalová et al., Springer, 2014, pp. 143–70, doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">10.1007/978-3-7091-1526-8_8</a>."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"full_name":"Baster, Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","first_name":"Pawel","last_name":"Baster"},{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří"}],"date_updated":"2021-01-12T06:53:19Z","type":"book_chapter","oa_version":"None","day":"01","year":"2014","title":"Auxin on the road navigated by cellular PIN polarity","publication":"Auxin and Its Role in Plant Development","language":[{"iso":"eng"}],"doi":"10.1007/978-3-7091-1526-8_8","_id":"1806","department":[{"_id":"JiFr"}],"publication_status":"published","abstract":[{"text":"The generation of asymmetry, at both cellular and tissue level, is one of the most essential capabilities of all eukaryotic organisms. It mediates basically all multicellular development ranging from embryogenesis and de novo organ formation till responses to various environmental stimuli. In plants, the awe-inspiring number of such processes is regulated by phytohormone auxin and its directional, cell-to-cell transport. The mediators of this transport, PIN auxin transporters, are asymmetrically localized at the plasma membrane, and this polar localization determines the directionality of intercellular auxin flow. Thus, auxin transport contributes crucially to the generation of local auxin gradients or maxima, which instruct given cell to change its developmental program. Here, we introduce and discuss the molecular components and cellular mechanisms regulating the generation and maintenance of cellular PIN polarity, as the general hallmarks of cell polarity in plants.","lang":"eng"}]},{"day":"16","oa_version":"Published Version","type":"journal_article","date_updated":"2021-01-12T06:53:23Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","department":[{"_id":"HeEd"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1142/S0218195914500034","page":"61 - 86","file":[{"creator":"system","content_type":"application/pdf","file_size":991734,"relation":"main_file","date_created":"2018-12-12T10:08:43Z","checksum":"be45c133ab4d43351260e21beaa8f4b1","file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","access_level":"open_access","file_id":"4704","date_updated":"2020-07-14T12:45:17Z"}],"date_published":"2014-03-16T00:00:00Z","scopus_import":1,"year":"2014","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","first_name":"Stefan","last_name":"Huber"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"full_name":"Meerwald, Peter","last_name":"Meerwald","first_name":"Peter"},{"full_name":"Kwitt, Roland","last_name":"Kwitt","first_name":"Roland"}],"quality_controlled":"1","citation":{"chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>.","short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.","ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. 2014;24(1):61-86. doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>.","apa":"Huber, S., Held, M., Meerwald, P., &#38; Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>"},"abstract":[{"text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.","lang":"eng"}],"publication_status":"published","_id":"1816","ddc":["000"],"oa":1,"title":"Topology-preserving watermarking of vector graphics","publication":"International Journal of Computational Geometry and Applications","publisher":"World Scientific Publishing","file_date_updated":"2020-07-14T12:45:17Z","pubrep_id":"443","volume":24,"issue":"1","status":"public","month":"03","date_created":"2018-12-11T11:54:10Z","publist_id":"5290","intvolume":"        24"},{"publication":"Journal of Mathematical Physics","title":"Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation","_id":"1821","ddc":["510","530"],"oa":1,"project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"abstract":[{"lang":"eng","text":"We review recent progress towards a rigorous understanding of the Bogoliubov approximation for bosonic quantum many-body systems. We focus, in particular, on the excitation spectrum of a Bose gas in the mean-field (Hartree) limit. A list of open problems will be discussed at the end."}],"publication_status":"published","citation":{"chicago":"Seiringer, Robert. “Bose Gases, Bose-Einstein Condensation, and the Bogoliubov Approximation.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2014. <a href=\"https://doi.org/10.1063/1.4881536\">https://doi.org/10.1063/1.4881536</a>.","short":"R. Seiringer, Journal of Mathematical Physics 55 (2014).","ista":"Seiringer R. 2014. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. Journal of Mathematical Physics. 55(7), 1.4881536.","ieee":"R. Seiringer, “Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation,” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7. American Institute of Physics, 2014.","ama":"Seiringer R. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. <i>Journal of Mathematical Physics</i>. 2014;55(7). doi:<a href=\"https://doi.org/10.1063/1.4881536\">10.1063/1.4881536</a>","apa":"Seiringer, R. (2014). Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4881536\">https://doi.org/10.1063/1.4881536</a>","mla":"Seiringer, Robert. “Bose Gases, Bose-Einstein Condensation, and the Bogoliubov Approximation.” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7, 1.4881536, American Institute of Physics, 2014, doi:<a href=\"https://doi.org/10.1063/1.4881536\">10.1063/1.4881536</a>."},"author":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"quality_controlled":"1","year":"2014","intvolume":"        55","publist_id":"5285","month":"06","date_created":"2018-12-11T11:54:11Z","article_number":"1.4881536","status":"public","pubrep_id":"532","issue":"7","volume":55,"file_date_updated":"2020-07-14T12:45:17Z","publisher":"American Institute of Physics","has_accepted_license":"1","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"doi":"10.1063/1.4881536","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T06:53:25Z","day":"26","scopus_import":1,"file":[{"date_updated":"2020-07-14T12:45:17Z","file_id":"5172","file_name":"IST-2016-532-v1+1_J._Mathematical_Phys._2014_Seiringer.pdf","checksum":"ed0efc93c10f1341155f0316af617b82","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:15:49Z","file_size":269171,"creator":"system","content_type":"application/pdf"}],"date_published":"2014-06-26T00:00:00Z"},{"intvolume":"        55","scopus_import":1,"publist_id":"5284","month":"07","date_created":"2018-12-11T11:54:12Z","status":"public","article_number":"075101","date_published":"2014-07-01T00:00:00Z","issue":"7","volume":55,"publisher":"American Institute of Physics","publication":"Journal of Mathematical Physics","title":"Introduction","_id":"1822","department":[{"_id":"RoSe"}],"doi":"10.1063/1.4884877","language":[{"iso":"eng"}],"publication_status":"published","citation":{"ieee":"V. Jakšić, C. Pillet, and R. Seiringer, “Introduction,” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7. American Institute of Physics, 2014.","ama":"Jakšić V, Pillet C, Seiringer R. Introduction. <i>Journal of Mathematical Physics</i>. 2014;55(7). doi:<a href=\"https://doi.org/10.1063/1.4884877\">10.1063/1.4884877</a>","ista":"Jakšić V, Pillet C, Seiringer R. 2014. Introduction. Journal of Mathematical Physics. 55(7), 075101.","short":"V. Jakšić, C. Pillet, R. Seiringer, Journal of Mathematical Physics 55 (2014).","chicago":"Jakšić, Vojkan, Claude Pillet, and Robert Seiringer. “Introduction.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2014. <a href=\"https://doi.org/10.1063/1.4884877\">https://doi.org/10.1063/1.4884877</a>.","apa":"Jakšić, V., Pillet, C., &#38; Seiringer, R. (2014). Introduction. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4884877\">https://doi.org/10.1063/1.4884877</a>","mla":"Jakšić, Vojkan, et al. “Introduction.” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7, 075101, American Institute of Physics, 2014, doi:<a href=\"https://doi.org/10.1063/1.4884877\">10.1063/1.4884877</a>."},"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Jakšić, Vojkan","first_name":"Vojkan","last_name":"Jakšić"},{"last_name":"Pillet","first_name":"Claude","full_name":"Pillet, Claude"},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"oa_version":"None","type":"journal_article","date_updated":"2021-01-12T06:53:25Z","year":"2014","day":"01"},{"publication_status":"published","abstract":[{"text":"Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can properly be returned to the opponent. These predictions get more accurate over time, hence the behaviors need to be continuously modified. As a result, movement templates with a learned global shape need to be adapted during the execution so that the racket reaches a target position and velocity that will return the ball over to the other side of the net or court. It requires altering learned movements to hit a varying target with the necessary velocity at a specific instant in time. Such a task cannot be incorporated straightforwardly in most movement representations suitable for learning. For example, the standard formulation of the dynamical system based motor primitives (introduced by Ijspeert et al (2002b)) does not satisfy this property despite their flexibility which has allowed learning tasks ranging from locomotion to kendama. In order to fulfill this requirement, we reformulate the Ijspeert framework to incorporate the possibility of specifying a desired hitting point and a desired hitting velocity while maintaining all advantages of the original formulation.We show that the proposed movement template formulation works well in two scenarios, i.e., for hitting a ball on a string with a table tennis racket at a specified velocity and for returning balls launched by a ball gun successfully over the net using forehand movements.","lang":"eng"}],"doi":"10.1007/978-3-319-03194-1_3","language":[{"iso":"eng"}],"_id":"1829","department":[{"_id":"ChLa"}],"publication":"Learning Motor Skills","title":"Movement templates for learning of hitting and batting","day":"01","year":"2014","type":"book_chapter","date_updated":"2021-01-12T06:53:28Z","series_title":"From Algorithms to Robot Experiments","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"full_name":"Muelling, Katharina","first_name":"Katharina","last_name":"Muelling"},{"full_name":"Kroemer, Oliver","last_name":"Kroemer","first_name":"Oliver"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"}],"citation":{"ieee":"K. Muelling, O. Kroemer, C. Lampert, and B. Schölkopf, “Movement templates for learning of hitting and batting,” in <i>Learning Motor Skills</i>, vol. 97, J. Kober and J. Peters, Eds. Springer, 2014, pp. 69–82.","ama":"Muelling K, Kroemer O, Lampert C, Schölkopf B. Movement templates for learning of hitting and batting. In: Kober J, Peters J, eds. <i>Learning Motor Skills</i>. Vol 97. From Algorithms to Robot Experiments. Springer; 2014:69-82. doi:<a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">10.1007/978-3-319-03194-1_3</a>","chicago":"Muelling, Katharina, Oliver Kroemer, Christoph Lampert, and Bernhard Schölkopf. “Movement Templates for Learning of Hitting and Batting.” In <i>Learning Motor Skills</i>, edited by Jens Kober and Jan Peters, 97:69–82. From Algorithms to Robot Experiments. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">https://doi.org/10.1007/978-3-319-03194-1_3</a>.","short":"K. Muelling, O. Kroemer, C. Lampert, B. Schölkopf, in:, J. Kober, J. Peters (Eds.), Learning Motor Skills, Springer, 2014, pp. 69–82.","ista":"Muelling K, Kroemer O, Lampert C, Schölkopf B. 2014.Movement templates for learning of hitting and batting. In: Learning Motor Skills. Springer Tracts in Advanced Robotics, vol. 97, 69–82.","apa":"Muelling, K., Kroemer, O., Lampert, C., &#38; Schölkopf, B. (2014). Movement templates for learning of hitting and batting. In J. Kober &#38; J. Peters (Eds.), <i>Learning Motor Skills</i> (Vol. 97, pp. 69–82). Springer. <a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">https://doi.org/10.1007/978-3-319-03194-1_3</a>","mla":"Muelling, Katharina, et al. “Movement Templates for Learning of Hitting and Batting.” <i>Learning Motor Skills</i>, edited by Jens Kober and Jan Peters, vol. 97, Springer, 2014, pp. 69–82, doi:<a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">10.1007/978-3-319-03194-1_3</a>."},"status":"public","date_created":"2018-12-11T11:54:14Z","month":"01","publist_id":"5274","scopus_import":1,"intvolume":"        97","alternative_title":["Springer Tracts in Advanced Robotics"],"publisher":"Springer","editor":[{"first_name":"Jens","last_name":"Kober","full_name":"Kober, Jens"},{"full_name":"Peters, Jan","first_name":"Jan","last_name":"Peters"}],"volume":97,"page":"69 - 82","date_published":"2014-01-01T00:00:00Z"},{"intvolume":"        53","scopus_import":1,"publist_id":"5260","month":"11","date_created":"2018-12-11T11:54:18Z","status":"public","date_published":"2014-11-14T00:00:00Z","issue":"1","page":"64 - 79","volume":53,"publisher":"Springer","title":"On the geometric ramsey number of outerplanar graphs","publication":"Discrete & Computational Geometry","_id":"1842","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"oa":1,"doi":"10.1007/s00454-014-9646-x","language":[{"iso":"eng"}],"acknowledgement":"Marek Krčál was supported by the ERC Advanced Grant No. 267165.","abstract":[{"text":"We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices.","lang":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.7004"}],"citation":{"chicago":"Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9646-x\">https://doi.org/10.1007/s00454-014-9646-x</a>.","short":"J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &#38; Computational Geometry 53 (2014) 64–79.","ista":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete &#38; Computational Geometry. 53(1), 64–79.","ieee":"J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 1. Springer, pp. 64–79, 2014.","ama":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. <i>Discrete &#38; Computational Geometry</i>. 2014;53(1):64-79. doi:<a href=\"https://doi.org/10.1007/s00454-014-9646-x\">10.1007/s00454-014-9646-x</a>","apa":"Cibulka, J., Gao, P., Krcál, M., Valla, T., &#38; Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9646-x\">https://doi.org/10.1007/s00454-014-9646-x</a>","mla":"Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:<a href=\"https://doi.org/10.1007/s00454-014-9646-x\">10.1007/s00454-014-9646-x</a>."},"author":[{"first_name":"Josef","last_name":"Cibulka","full_name":"Cibulka, Josef"},{"first_name":"Pu","last_name":"Gao","full_name":"Gao, Pu"},{"last_name":"Krcál","first_name":"Marek","full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Valla, Tomáš","first_name":"Tomáš","last_name":"Valla"},{"full_name":"Valtr, Pavel","first_name":"Pavel","last_name":"Valtr"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T06:53:33Z","year":"2014","day":"14"},{"day":"12","date_updated":"2021-01-12T06:53:34Z","type":"journal_article","oa_version":"Published Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.1093/molbev/msu312","department":[{"_id":"HaJa"}],"has_accepted_license":"1","page":"440 - 455","date_published":"2014-11-12T00:00:00Z","file":[{"content_type":"application/pdf","creator":"system","file_size":1545246,"relation":"main_file","date_created":"2018-12-12T10:16:56Z","checksum":"06215318e66be8f3e0c33abb07e9d3da","file_name":"IST-2016-430-v1+1_Mol_Biol_Evol-2015-Risso-440-55.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:19Z","file_id":"5247"}],"scopus_import":1,"year":"2014","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"author":[{"full_name":"Risso, Valeria","last_name":"Risso","first_name":"Valeria"},{"full_name":"Manssour Triedo, Fadia","first_name":"Fadia","last_name":"Manssour Triedo"},{"last_name":"Delgado Delgado","first_name":"Asuncion","full_name":"Delgado Delgado, Asuncion"},{"full_name":"Arco, Rocio","first_name":"Rocio","last_name":"Arco"},{"full_name":"Barroso Deljesús, Alicia","last_name":"Barroso Deljesús","first_name":"Alicia"},{"last_name":"Inglés Prieto","first_name":"Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro","orcid":"0000-0002-5409-8571"},{"full_name":"Godoy Ruiz, Raquel","last_name":"Godoy Ruiz","first_name":"Raquel"},{"full_name":"Gavira, Josè","first_name":"Josè","last_name":"Gavira"},{"full_name":"Gaucher, Eric","last_name":"Gaucher","first_name":"Eric"},{"first_name":"Beatriz","last_name":"Ibarra Molero","full_name":"Ibarra Molero, Beatriz"},{"full_name":"Sánchez Ruiz, Jose","last_name":"Sánchez Ruiz","first_name":"Jose"}],"quality_controlled":"1","citation":{"ama":"Risso V, Manssour Triedo F, Delgado Delgado A, et al. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. <i>Molecular Biology and Evolution</i>. 2014;32(2):440-455. doi:<a href=\"https://doi.org/10.1093/molbev/msu312\">10.1093/molbev/msu312</a>","ieee":"V. Risso <i>et al.</i>, “Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history,” <i>Molecular Biology and Evolution</i>, vol. 32, no. 2. Oxford University Press, pp. 440–455, 2014.","chicago":"Risso, Valeria, Fadia Manssour Triedo, Asuncion Delgado Delgado, Rocio Arco, Alicia Barroso Deljesús, Álvaro Inglés Prieto, Raquel Godoy Ruiz, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/molbev/msu312\">https://doi.org/10.1093/molbev/msu312</a>.","short":"V. Risso, F. Manssour Triedo, A. Delgado Delgado, R. Arco, A. Barroso Deljesús, Á. Inglés Prieto, R. Godoy Ruiz, J. Gavira, E. Gaucher, B. Ibarra Molero, J. Sánchez Ruiz, Molecular Biology and Evolution 32 (2014) 440–455.","ista":"Risso V, Manssour Triedo F, Delgado Delgado A, Arco R, Barroso Deljesús A, Inglés Prieto Á, Godoy Ruiz R, Gavira J, Gaucher E, Ibarra Molero B, Sánchez Ruiz J. 2014. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 32(2), 440–455.","apa":"Risso, V., Manssour Triedo, F., Delgado Delgado, A., Arco, R., Barroso Deljesús, A., Inglés Prieto, Á., … Sánchez Ruiz, J. (2014). Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msu312\">https://doi.org/10.1093/molbev/msu312</a>","mla":"Risso, Valeria, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” <i>Molecular Biology and Evolution</i>, vol. 32, no. 2, Oxford University Press, 2014, pp. 440–55, doi:<a href=\"https://doi.org/10.1093/molbev/msu312\">10.1093/molbev/msu312</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"Local protein interactions (&quot;molecular context&quot; effects) dictate amino acid replacements and can be described in terms of site-specific, energetic preferences for any different amino acid. It has been recently debated whether these preferences remain approximately constant during evolution or whether, due to coevolution of sites, they change strongly. Such research highlights an unresolved and fundamental issue with far-reaching implications for phylogenetic analysis and molecular evolution modeling. Here, we take advantage of the recent availability of phenotypically supported laboratory resurrections of Precambrian thioredoxins and β-lactamases to experimentally address the change of site-specific amino acid preferences over long geological timescales. Extensive mutational analyses support the notion that evolutionary adjustment to a new amino acid may occur, but to a large extent this is insufficient to erase the primitive preference for amino acid replacements. Generally, site-specific amino acid preferences appear to remain conserved throughout evolutionary history despite local sequence divergence. We show such preference conservation to be readily understandable in molecular terms and we provide crystallographic evidence for an intriguing structural-switch mechanism: Energetic preference for an ancestral amino acid in a modern protein can be linked to reorganization upon mutation to the ancestral local structure around the mutated site. Finally, we point out that site-specific preference conservation naturally leads to one plausible evolutionary explanation for the existence of intragenic global suppressor mutations."}],"ddc":["571"],"oa":1,"_id":"1844","title":"Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history","publication":"Molecular Biology and Evolution","publisher":"Oxford University Press","file_date_updated":"2020-07-14T12:45:19Z","volume":32,"issue":"2","pubrep_id":"430","status":"public","date_created":"2018-12-11T11:54:19Z","month":"11","publist_id":"5257","intvolume":"        32"},{"volume":24,"issue":"19","publisher":"Cell Press","intvolume":"        24","publist_id":"5248","date_created":"2018-12-11T11:54:22Z","month":"10","status":"public","citation":{"mla":"Sassi, Massimiliano, et al. “An Auxin-Mediated Shift toward Growth Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” <i>Current Biology</i>, vol. 24, no. 19, Cell Press, 2014, pp. 2335–42, doi:<a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">10.1016/j.cub.2014.08.036</a>.","apa":"Sassi, M., Ali, O., Boudon, F., Cloarec, G., Abad, U., Cellier, C., … Traas, J. (2014). An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">https://doi.org/10.1016/j.cub.2014.08.036</a>","short":"M. Sassi, O. Ali, F. Boudon, G. Cloarec, U. Abad, C. Cellier, X. Chen, B. Gilles, P. Milani, J. Friml, T. Vernoux, C. Godin, O. Hamant, J. Traas, Current Biology 24 (2014) 2335–2342.","chicago":"Sassi, Massimiliano, Olivier Ali, Frédéric Boudon, Gladys Cloarec, Ursula Abad, Coralie Cellier, Xu Chen, et al. “An Auxin-Mediated Shift toward Growth Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” <i>Current Biology</i>. Cell Press, 2014. <a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">https://doi.org/10.1016/j.cub.2014.08.036</a>.","ista":"Sassi M, Ali O, Boudon F, Cloarec G, Abad U, Cellier C, Chen X, Gilles B, Milani P, Friml J, Vernoux T, Godin C, Hamant O, Traas J. 2014. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. Current Biology. 24(19), 2335–2342.","ieee":"M. Sassi <i>et al.</i>, “An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis,” <i>Current Biology</i>, vol. 24, no. 19. Cell Press, pp. 2335–2342, 2014.","ama":"Sassi M, Ali O, Boudon F, et al. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. <i>Current Biology</i>. 2014;24(19):2335-2342. doi:<a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">10.1016/j.cub.2014.08.036</a>"},"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01074821"}],"author":[{"first_name":"Massimiliano","last_name":"Sassi","full_name":"Sassi, Massimiliano"},{"first_name":"Olivier","last_name":"Ali","full_name":"Ali, Olivier"},{"full_name":"Boudon, Frédéric","first_name":"Frédéric","last_name":"Boudon"},{"first_name":"Gladys","last_name":"Cloarec","full_name":"Cloarec, Gladys"},{"last_name":"Abad","first_name":"Ursula","full_name":"Abad, Ursula"},{"full_name":"Cellier, Coralie","first_name":"Coralie","last_name":"Cellier"},{"last_name":"Chen","first_name":"Xu","full_name":"Chen, Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gilles, Benjamin","last_name":"Gilles","first_name":"Benjamin"},{"last_name":"Milani","first_name":"Pascale","full_name":"Milani, Pascale"},{"last_name":"Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Teva","last_name":"Vernoux","full_name":"Vernoux, Teva"},{"first_name":"Christophe","last_name":"Godin","full_name":"Godin, Christophe"},{"full_name":"Hamant, Olivier","first_name":"Olivier","last_name":"Hamant"},{"first_name":"Jan","last_name":"Traas","full_name":"Traas, Jan"}],"quality_controlled":"1","year":"2014","title":"An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis","publication":"Current Biology","oa":1,"_id":"1852","publication_status":"published","abstract":[{"text":"To control morphogenesis, molecular regulatory networks have to interfere with the mechanical properties of the individual cells of developing organs and tissues, but how this is achieved is not well known. We study this issue here in the shoot meristem of higher plants, a group of undifferentiated cells where complex changes in growth rates and directions lead to the continuous formation of new organs [1, 2]. Here, we show that the plant hormone auxin plays an important role in this process via a dual, local effect on the extracellular matrix, the cell wall, which determines cell shape. Our study reveals that auxin not only causes a limited reduction in wall stiffness but also directly interferes with wall anisotropy via the regulation of cortical microtubule dynamics. We further show that to induce growth isotropy and organ outgrowth, auxin somehow interferes with the cortical microtubule-ordering activity of a network of proteins, including AUXIN BINDING PROTEIN 1 and KATANIN 1. Numerical simulations further indicate that the induced isotropy is sufficient to amplify the effects of the relatively minor changes in wall stiffness to promote organogenesis and the establishment of new growth axes in a robust manner.","lang":"eng"}],"date_published":"2014-10-06T00:00:00Z","page":"2335 - 2342","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:53:37Z","type":"journal_article","oa_version":"Submitted Version","day":"06","doi":"10.1016/j.cub.2014.08.036","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"acknowledgement":"This work was funded by grants from EraSysBio+ (iSAM) and ERC (Morphodynamics). "},{"title":"Game theoretic secure localization in wireless sensor networks","department":[{"_id":"KrCh"}],"_id":"1853","language":[{"iso":"eng"}],"doi":"10.1109/IOT.2014.7030120","abstract":[{"lang":"eng","text":"Wireless sensor networks (WSNs) composed of low-power, low-cost sensor nodes are expected to form the backbone of future intelligent networks for a broad range of civil, industrial and military applications. These sensor nodes are often deployed through random spreading, and function in dynamic environments. Many applications of WSNs such as pollution tracking, forest fire detection, and military surveillance require knowledge of the location of constituent nodes. But the use of technologies such as GPS on all nodes is prohibitive due to power and cost constraints. So, the sensor nodes need to autonomously determine their locations. Most localization techniques use anchor nodes with known locations to determine the position of remaining nodes. Localization techniques have two conflicting requirements. On one hand, an ideal localization technique should be computationally simple and on the other hand, it must be resistant to attacks that compromise anchor nodes. In this paper, we propose a computationally light-weight game theoretic secure localization technique and demonstrate its effectiveness in comparison to existing techniques."}],"publication_status":"published","citation":{"apa":"Jha, S., Tripakis, S., Seshia, S., &#38; Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. <a href=\"https://doi.org/10.1109/IOT.2014.7030120\">https://doi.org/10.1109/IOT.2014.7030120</a>","mla":"Jha, Susmit, et al. <i>Game Theoretic Secure Localization in Wireless Sensor Networks</i>. IEEE, 2014, pp. 85–90, doi:<a href=\"https://doi.org/10.1109/IOT.2014.7030120\">10.1109/IOT.2014.7030120</a>.","short":"S. Jha, S. Tripakis, S. Seshia, K. Chatterjee, in:, IEEE, 2014, pp. 85–90.","chicago":"Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,” 85–90. IEEE, 2014. <a href=\"https://doi.org/10.1109/IOT.2014.7030120\">https://doi.org/10.1109/IOT.2014.7030120</a>.","ista":"Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization in wireless sensor networks. IOT: Internet of Things, 85–90.","ama":"Jha S, Tripakis S, Seshia S, Chatterjee K. Game theoretic secure localization in wireless sensor networks. In: IEEE; 2014:85-90. doi:<a href=\"https://doi.org/10.1109/IOT.2014.7030120\">10.1109/IOT.2014.7030120</a>","ieee":"S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"full_name":"Jha, Susmit","last_name":"Jha","first_name":"Susmit"},{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"first_name":"Sanjit","last_name":"Seshia","full_name":"Seshia, Sanjit"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"}],"oa_version":"None","date_updated":"2021-01-12T06:53:38Z","type":"conference","year":"2014","day":"03","publist_id":"5247","conference":{"start_date":"2014-10-06","location":"Cambridge, USA","end_date":"2014-10-08","name":"IOT: Internet of Things"},"month":"02","date_created":"2018-12-11T11:54:22Z","status":"public","date_published":"2014-02-03T00:00:00Z","page":"85 - 90","publisher":"IEEE"},{"citation":{"apa":"Guerrero, P., Auzinger, T., Wimmer, M., &#38; Jeschke, S. (2014). Partial shape matching using transformation parameter similarity. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12509\">https://doi.org/10.1111/cgf.12509</a>","mla":"Guerrero, Paul, et al. “Partial Shape Matching Using Transformation Parameter Similarity.” <i>Computer Graphics Forum</i>, vol. 34, no. 1, Wiley, 2014, pp. 239–52, doi:<a href=\"https://doi.org/10.1111/cgf.12509\">10.1111/cgf.12509</a>.","ieee":"P. Guerrero, T. Auzinger, M. Wimmer, and S. Jeschke, “Partial shape matching using transformation parameter similarity,” <i>Computer Graphics Forum</i>, vol. 34, no. 1. Wiley, pp. 239–252, 2014.","ama":"Guerrero P, Auzinger T, Wimmer M, Jeschke S. Partial shape matching using transformation parameter similarity. <i>Computer Graphics Forum</i>. 2014;34(1):239-252. doi:<a href=\"https://doi.org/10.1111/cgf.12509\">10.1111/cgf.12509</a>","chicago":"Guerrero, Paul, Thomas Auzinger, Michael Wimmer, and Stefan Jeschke. “Partial Shape Matching Using Transformation Parameter Similarity.” <i>Computer Graphics Forum</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/cgf.12509\">https://doi.org/10.1111/cgf.12509</a>.","short":"P. Guerrero, T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 34 (2014) 239–252.","ista":"Guerrero P, Auzinger T, Wimmer M, Jeschke S. 2014. Partial shape matching using transformation parameter similarity. Computer Graphics Forum. 34(1), 239–252."},"author":[{"last_name":"Guerrero","first_name":"Paul","full_name":"Guerrero, Paul"},{"first_name":"Thomas","last_name":"Auzinger","orcid":"0000-0002-1546-3265","full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wimmer, Michael","last_name":"Wimmer","first_name":"Michael"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan","first_name":"Stefan","last_name":"Jeschke"}],"quality_controlled":"1","year":"2014","title":"Partial shape matching using transformation parameter similarity","publication":"Computer Graphics Forum","_id":"1854","oa":1,"ddc":["000"],"abstract":[{"lang":"eng","text":"In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achieved by a two-step approach. First, pointwise correspondences between the query region and the whole shape are established. The transformation parameters of these correspondences are registered in an appropriate transformation space. For transformations between similar regions, these parameters form surfaces in transformation space, which are extracted in the second step of our method. The extracted regions may be related to the query region by a non-rigid transform, enabling non-rigid shape matching. In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achieved by a two-step approach. First, pointwise correspondences between the query region and the whole shape are established. The transformation parameters of these correspondences are registered in an appropriate transformation space. For transformations between similar regions, these parameters form surfaces in transformation space, which are extracted in the second step of our method. The extracted regions may be related to the query region by a non-rigid transform, enabling non-rigid shape matching."}],"publication_status":"published","pubrep_id":"574","volume":34,"issue":"1","file_date_updated":"2020-07-14T12:45:19Z","publisher":"Wiley","intvolume":"        34","publist_id":"5246","month":"11","date_created":"2018-12-11T11:54:22Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","date_updated":"2021-01-12T06:53:38Z","type":"journal_article","day":"05","department":[{"_id":"ChWo"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1111/cgf.12509","file":[{"checksum":"91946bfc509c77f5fd3151a3ff2b2c8f","file_name":"IST-2016-574-v1+1_Guerrero-2014-TPS-paper.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:19Z","file_id":"5182","file_size":24817484,"creator":"system","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:15:58Z"}],"date_published":"2014-11-05T00:00:00Z","page":"239 - 252","scopus_import":1},{"project":[{"call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","grant_number":"282300"}],"publication_status":"published","abstract":[{"lang":"eng","text":"The prominent and evolutionarily ancient role of the plant hormone auxin is the regulation of cell expansion. Cell expansion requires ordered arrangement of the cytoskeleton but molecular mechanisms underlying its regulation by signalling molecules including auxin are unknown. Here we show in the model plant Arabidopsis thaliana that in elongating cells exogenous application of auxin or redistribution of endogenous auxin induces very rapid microtubule re-orientation from transverse to longitudinal, coherent with the inhibition of cell expansion. This fast auxin effect requires auxin binding protein 1 (ABP1) and involves a contribution of downstream signalling components such as ROP6 GTPase, ROP-interactive protein RIC1 and the microtubule-severing protein katanin. These components are required for rapid auxin-and ABP1-mediated re-orientation of microtubules to regulate cell elongation in roots and dark-grown hypocotyls as well as asymmetric growth during gravitropic responses."}],"title":"Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules","publication":"Nature","pmid":1,"oa":1,"_id":"1862","year":"2014","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4257754/","open_access":"1"}],"citation":{"chicago":"Chen, Xu, Laurie Grandont, Hongjiang Li, Robert Hauschild, Sébastien Paque, Anas Abuzeineh, Hana Rakusova, Eva Benková, Catherine Perrot Rechenmann, and Jiří Friml. “Inhibition of Cell Expansion by Rapid ABP1-Mediated Auxin Effect on Microtubules.” <i>Nature</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nature13889\">https://doi.org/10.1038/nature13889</a>.","short":"X. Chen, L. Grandont, H. Li, R. Hauschild, S. Paque, A. Abuzeineh, H. Rakusova, E. Benková, C. Perrot Rechenmann, J. Friml, Nature 516 (2014) 90–93.","ista":"Chen X, Grandont L, Li H, Hauschild R, Paque S, Abuzeineh A, Rakusova H, Benková E, Perrot Rechenmann C, Friml J. 2014. Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules. Nature. 516(729), 90–93.","ieee":"X. Chen <i>et al.</i>, “Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules,” <i>Nature</i>, vol. 516, no. 729. Nature Publishing Group, pp. 90–93, 2014.","ama":"Chen X, Grandont L, Li H, et al. Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules. <i>Nature</i>. 2014;516(729):90-93. doi:<a href=\"https://doi.org/10.1038/nature13889\">10.1038/nature13889</a>","apa":"Chen, X., Grandont, L., Li, H., Hauschild, R., Paque, S., Abuzeineh, A., … Friml, J. (2014). Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature13889\">https://doi.org/10.1038/nature13889</a>","mla":"Chen, Xu, et al. “Inhibition of Cell Expansion by Rapid ABP1-Mediated Auxin Effect on Microtubules.” <i>Nature</i>, vol. 516, no. 729, Nature Publishing Group, 2014, pp. 90–93, doi:<a href=\"https://doi.org/10.1038/nature13889\">10.1038/nature13889</a>."},"author":[{"id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Xu","first_name":"Xu","last_name":"Chen"},{"full_name":"Grandont, Laurie","last_name":"Grandont","first_name":"Laurie"},{"last_name":"Li","first_name":"Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang"},{"orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","first_name":"Robert"},{"first_name":"Sébastien","last_name":"Paque","full_name":"Paque, Sébastien"},{"last_name":"Abuzeineh","first_name":"Anas","full_name":"Abuzeineh, Anas"},{"last_name":"Rakusova","first_name":"Hana","full_name":"Rakusova, Hana","id":"4CAAA450-78D2-11EA-8E57-B40A396E08BA"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"},{"last_name":"Perrot Rechenmann","first_name":"Catherine","full_name":"Perrot Rechenmann, Catherine"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí"}],"quality_controlled":"1","date_created":"2018-12-11T11:54:25Z","month":"12","status":"public","intvolume":"       516","publist_id":"5237","article_type":"original","publisher":"Nature Publishing Group","volume":516,"issue":"729","acknowledgement":"We thank R. Dixit for performing complementary experiments, D. W. Ehrhardt and T. Hashimoto for providing the seeds of TUB6–RFP and EB1b–GFP respectively, E. Zazimalova, J. Petrasek and M. Fendrych for discussing the manuscript and J. Leung for text optimization. This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), ANR blanc AuxiWall project (ANR-11-BSV5-0007, to C.P.-R. and L.G.) and the Agency for Innovation by Science and Technology (IWT) (to H.R.). This work benefited from the facilities and expertise of the Imagif Cell Biology platform (http://www.imagif.cnrs.fr), which is supported by the Conseil Général de l’Essonne.","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1038/nature13889","department":[{"_id":"JiFr"},{"_id":"Bio"},{"_id":"EvBe"}],"type":"journal_article","date_updated":"2025-05-07T11:12:31Z","oa_version":"Submitted Version","day":"04","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"scopus_import":"1","date_published":"2014-12-04T00:00:00Z","external_id":{"pmid":["25409144"]},"page":"90 - 93"},{"page":"68 - 74","date_published":"2014-01-01T00:00:00Z","alternative_title":["LNCS"],"day":"01","date_updated":"2021-01-12T06:53:44Z","type":"conference","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The work presented in this paper was supported in part by the European Research Council (ERC) under grant agreement QUAINT (I774-N23)","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-13338-6_6","department":[{"_id":"ToHe"}],"ec_funded":1,"publisher":"Springer","editor":[{"full_name":"Yahav, Eran","last_name":"Yahav","first_name":"Eran"}],"volume":8855,"status":"public","date_created":"2018-12-11T11:54:27Z","conference":{"location":"Haifa, Israel","start_date":"2014-11-18","name":"HVC: Haifa Verification Conference","end_date":"2014-11-20"},"month":"01","publist_id":"5228","intvolume":"      8855","year":"2014","author":[{"full_name":"Hofferek, Georg","first_name":"Georg","last_name":"Hofferek"},{"first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","citation":{"ista":"Hofferek G, Gupta A. 2014. Suraq - a controller synthesis tool using uninterpreted functions. HVC 2014. HVC: Haifa Verification Conference, LNCS, vol. 8855, 68–74.","short":"G. Hofferek, A. Gupta, in:, E. Yahav (Ed.), HVC 2014, Springer, 2014, pp. 68–74.","chicago":"Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using Uninterpreted Functions.” In <i>HVC 2014</i>, edited by Eran Yahav, 8855:68–74. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">https://doi.org/10.1007/978-3-319-13338-6_6</a>.","ieee":"G. Hofferek and A. Gupta, “Suraq - a controller synthesis tool using uninterpreted functions,” in <i>HVC 2014</i>, Haifa, Israel, 2014, vol. 8855, pp. 68–74.","ama":"Hofferek G, Gupta A. Suraq - a controller synthesis tool using uninterpreted functions. In: Yahav E, ed. <i>HVC 2014</i>. Vol 8855. Springer; 2014:68-74. doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">10.1007/978-3-319-13338-6_6</a>","apa":"Hofferek, G., &#38; Gupta, A. (2014). Suraq - a controller synthesis tool using uninterpreted functions. In E. Yahav (Ed.), <i>HVC 2014</i> (Vol. 8855, pp. 68–74). Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">https://doi.org/10.1007/978-3-319-13338-6_6</a>","mla":"Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using Uninterpreted Functions.” <i>HVC 2014</i>, edited by Eran Yahav, vol. 8855, Springer, 2014, pp. 68–74, doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">10.1007/978-3-319-13338-6_6</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"Boolean controllers for systems with complex datapaths are often very difficult to implement correctly, in particular when concurrency is involved. Yet, in many instances it is easy to formally specify correctness. For example, the specification for the controller of a pipelined processor only has to state that the pipelined processor gives the same results as a non-pipelined reference design. This makes such controllers a good target for automated synthesis. However, an efficient abstraction for the complex datapath elements is needed, as a bit-precise description is often infeasible. We present Suraq, the first controller synthesis tool which uses uninterpreted functions for the abstraction. Quantified firstorder formulas (with specific quantifier structure) serve as the specification language from which Suraq synthesizes Boolean controllers. Suraq transforms the specification into an unsatisfiable SMT formula, and uses Craig interpolation to compute its results. Using Suraq, we were able to synthesize a controller (consisting of two Boolean signals) for a five-stage pipelined DLX processor in roughly one hour and 15 minutes."}],"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"_id":"1869","publication":"HVC 2014","title":"Suraq - a controller synthesis tool using uninterpreted functions"}]