[{"oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:56:10Z","citation":{"chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Semicircle Law with Imprimitive Variance Matrix.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2014. https://doi.org/10.1214/ECP.v19-3121.","apa":"Ajanki, O. H., Erdös, L., & Krüger, T. H. (2014). Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/ECP.v19-3121","mla":"Ajanki, Oskari H., et al. “Local Semicircle Law with Imprimitive Variance Matrix.” Electronic Communications in Probability, vol. 19, Institute of Mathematical Statistics, 2014, doi:10.1214/ECP.v19-3121.","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local semicircle law with imprimitive variance matrix,” Electronic Communications in Probability, vol. 19. Institute of Mathematical Statistics, 2014.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Electronic Communications in Probability 19 (2014).","ista":"Ajanki OH, Erdös L, Krüger TH. 2014. Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. 19.","ama":"Ajanki OH, Erdös L, Krüger TH. Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. 2014;19. doi:10.1214/ECP.v19-3121"},"publist_id":"4803","title":"Local semicircle law with imprimitive variance matrix","volume":19,"day":"09","publication":"Electronic Communications in Probability","date_published":"2014-06-09T00:00:00Z","intvolume":" 19","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:31Z","doi":"10.1214/ECP.v19-3121","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"},"pubrep_id":"426","publisher":"Institute of Mathematical Statistics","_id":"2179","publication_status":"published","type":"journal_article","file":[{"checksum":"bd8a041c76d62fe820bf73ff13ce7d1b","file_size":327322,"date_created":"2018-12-12T10:09:06Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:31Z","file_id":"4729","creator":"system","relation":"main_file","file_name":"IST-2016-426-v1+1_3121-17518-1-PB.pdf"}],"oa_version":"Published Version","ddc":["570"],"year":"2014","month":"06","department":[{"_id":"LaEr"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:55:48Z","scopus_import":1,"abstract":[{"lang":"eng","text":"We extend the proof of the local semicircle law for generalized Wigner matrices given in MR3068390 to the case when the matrix of variances has an eigenvalue -1. In particular, this result provides a short proof of the optimal local Marchenko-Pastur law at the hard edge (i.e. around zero) for sample covariance matrices X*X, where the variances of the entries of X may vary."}],"license":"https://creativecommons.org/licenses/by/4.0/","author":[{"id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","first_name":"Oskari H","full_name":"Ajanki, Oskari H","last_name":"Ajanki"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László"},{"orcid":"0000-0002-4821-3297","last_name":"Krüger","full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H"}],"status":"public"},{"oa":1,"quality_controlled":"1","citation":{"short":"A. Bellet, A. Habrard, E. Morvant, M. Sebban, Machine Learning 97 (2014) 129–154.","ieee":"A. Bellet, A. Habrard, E. Morvant, and M. Sebban, “Learning a priori constrained weighted majority votes,” Machine Learning, vol. 97, no. 1–2. Springer, pp. 129–154, 2014.","ista":"Bellet A, Habrard A, Morvant E, Sebban M. 2014. Learning a priori constrained weighted majority votes. Machine Learning. 97(1–2), 129–154.","ama":"Bellet A, Habrard A, Morvant E, Sebban M. Learning a priori constrained weighted majority votes. Machine Learning. 2014;97(1-2):129-154. doi:10.1007/s10994-014-5462-z","mla":"Bellet, Aurélien, et al. “Learning a Priori Constrained Weighted Majority Votes.” Machine Learning, vol. 97, no. 1–2, Springer, 2014, pp. 129–54, doi:10.1007/s10994-014-5462-z.","chicago":"Bellet, Aurélien, Amaury Habrard, Emilie Morvant, and Marc Sebban. “Learning a Priori Constrained Weighted Majority Votes.” Machine Learning. Springer, 2014. https://doi.org/10.1007/s10994-014-5462-z.","apa":"Bellet, A., Habrard, A., Morvant, E., & Sebban, M. (2014). Learning a priori constrained weighted majority votes. Machine Learning. Springer. https://doi.org/10.1007/s10994-014-5462-z"},"date_created":"2018-12-11T11:56:10Z","page":"129 - 154","publist_id":"4802","title":"Learning a priori constrained weighted majority votes","publication":"Machine Learning","day":"01","acknowledgement":"This work was funded by the French project SoLSTiCe ANR-13-BS02-01 of the ANR. ","volume":97,"date_published":"2014-10-01T00:00:00Z","intvolume":" 97","doi":"10.1007/s10994-014-5462-z","ec_funded":1,"publisher":"Springer","publication_status":"published","_id":"2180","issue":"1-2","type":"journal_article","oa_version":"Submitted Version","project":[{"grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"month":"10","year":"2014","department":[{"_id":"ChLa"}],"language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:55:49Z","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01009578/document"}],"abstract":[{"text":"Weighted majority votes allow one to combine the output of several classifiers or voters. MinCq is a recent algorithm for optimizing the weight of each voter based on the minimization of a theoretical bound over the risk of the vote with elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated good performance when combining weak classifiers, MinCq cannot make use of the useful a priori knowledge that one may have when using a mixture of weak and strong voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate such knowledge in the form of a constraint over the distribution of the weights, along with general proofs of convergence that stand in the sample compression setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers with a specific modeling of the voters' performance. P-MinCq significantly outperforms the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We show that it is also competitive with LMNN, a popular metric learning algorithm, and that combining both approaches further reduces the error.","lang":"eng"}],"status":"public","author":[{"full_name":"Bellet, Aurélien","last_name":"Bellet","first_name":"Aurélien"},{"first_name":"Amaury","last_name":"Habrard","full_name":"Habrard, Amaury"},{"last_name":"Morvant","full_name":"Morvant, Emilie","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","first_name":"Emilie"},{"last_name":"Sebban","full_name":"Sebban, Marc","first_name":"Marc"}]},{"intvolume":" 89","date_published":"2014-06-16T00:00:00Z","day":"16","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","acknowledgement":"V.B.S. is partially supported by contract MEC (Grant No. AYA2010-22111-C03-02).\r\n","volume":89,"article_processing_charge":"No","ec_funded":1,"doi":"10.1103/PhysRevE.89.062809","citation":{"chicago":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2014. https://doi.org/10.1103/PhysRevE.89.062809.","apa":"Botella Soler, V., & Glendinning, P. (2014). Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.89.062809","mla":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 6, 062809, American Institute of Physics, 2014, doi:10.1103/PhysRevE.89.062809.","ista":"Botella Soler V, Glendinning P. 2014. Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 89(6), 062809.","short":"V. Botella Soler, P. Glendinning, Physical Review E Statistical Nonlinear and Soft Matter Physics 89 (2014).","ieee":"V. Botella Soler and P. Glendinning, “Hierarchy and polysynchrony in an adaptive network ,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 6. American Institute of Physics, 2014.","ama":"Botella Soler V, Glendinning P. Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 2014;89(6). doi:10.1103/PhysRevE.89.062809"},"date_created":"2018-12-11T11:56:11Z","quality_controlled":"1","oa":1,"article_number":"062809","title":"Hierarchy and polysynchrony in an adaptive network ","publist_id":"4798","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.3209"}],"abstract":[{"text":"We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes.","lang":"eng"}],"scopus_import":"1","date_updated":"2022-08-25T14:04:45Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"status":"public","author":[{"id":"421234E8-F248-11E8-B48F-1D18A9856A87","first_name":"Vicente","last_name":"Botella Soler","full_name":"Botella Soler, Vicente","orcid":"0000-0002-8790-1914"},{"full_name":"Glendinning, Paul","last_name":"Glendinning","first_name":"Paul"}],"type":"journal_article","oa_version":"Preprint","publication_status":"published","issue":"6","_id":"2183","publisher":"American Institute of Physics","department":[{"_id":"GaTk"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"year":"2014","month":"06"},{"title":"Computing all maps into a sphere","publist_id":"4797","quality_controlled":"1","date_created":"2018-12-11T11:56:12Z","citation":{"mla":"Čadek, Martin, et al. “Computing All Maps into a Sphere.” Journal of the ACM, vol. 61, no. 3, 17, ACM, 2014, doi:10.1145/2597629.","apa":"Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner, U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM. https://doi.org/10.1145/2597629","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner. “Computing All Maps into a Sphere.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597629.","ama":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing all maps into a sphere. Journal of the ACM. 2014;61(3). doi:10.1145/2597629","ista":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.","short":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal of the ACM 61 (2014).","ieee":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014."},"article_number":"17 ","oa":1,"doi":"10.1145/2597629","date_published":"2014-05-01T00:00:00Z","intvolume":" 61","volume":61,"publication":"Journal of the ACM","acknowledgement":"The research by M. K. was supported by project GAUK 49209. The research by M. K. was also supported by project 1M0545 by the Ministry of Education of the Czech Republic and by Center of Excellence { Inst. for Theor. Comput. Sci., Prague (project P202/12/G061 of GACR). The research by U. W. was supported by the Swiss National Science Foundation (SNF Projects 200021-125309, 200020-138230, and PP00P2-138948).","day":"01","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"year":"2014","month":"05","_id":"2184","issue":"3","publication_status":"published","oa_version":"Preprint","type":"journal_article","publisher":"ACM","author":[{"full_name":"Čadek, Martin","last_name":"Čadek","first_name":"Martin"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Krcál, Marek","last_name":"Krcál"},{"first_name":"Jiří","full_name":"Matoušek, Jiří","last_name":"Matoušek"},{"first_name":"Francis","last_name":"Sergeraert","full_name":"Sergeraert, Francis"},{"full_name":"Vokřínek, Lukáš","last_name":"Vokřínek","first_name":"Lukáš"},{"orcid":"0000-0002-1494-0568","last_name":"Wagner","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"status":"public","scopus_import":1,"abstract":[{"lang":"eng","text":"Given topological spaces X,Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X→ Y. We consider a computational version, where X,Y are given as finite simplicial complexes, and the goal is to compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected; in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [X,Y] is known to be uncomputable for general X,Y, since for X = S1 it includes a well known undecidable problem: testing triviality of the fundamental group of Y. In follow-up papers, the algorithm is shown to run in polynomial time for d fixed, and extended to other problems, such as the extension problem, where we are given a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or computing the Z2-index-everything in the stable range. Outside the stable range, the extension problem is undecidable."}],"main_file_link":[{"url":"http://arxiv.org/abs/1105.6257","open_access":"1"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:55:50Z"},{"oa":1,"conference":{"end_date":"2014-05-15","location":"Copenhagen, Denmark","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2014-05-11"},"quality_controlled":"1","date_created":"2018-12-11T11:56:12Z","citation":{"mla":"Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation without Entropy Waste.” edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110. Springer, 2014. https://doi.org/10.1007/978-3-642-55220-5_6.","apa":"Dodis, Y., Pietrzak, K. Z., & Wichs, D. (2014). Key derivation without entropy waste. In P. Nguyen & E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-642-55220-5_6","ista":"Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441, 93–110.","short":"Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.","ieee":"Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.","ama":"Dodis Y, Pietrzak KZ, Wichs D. Key derivation without entropy waste. In: Nguyen P, Oswald E, eds. Vol 8441. Springer; 2014:93-110. doi:10.1007/978-3-642-55220-5_6"},"publist_id":"4795","page":"93 - 110","title":"Key derivation without entropy waste","volume":8441,"day":"01","date_published":"2014-04-01T00:00:00Z","editor":[{"full_name":"Nguyen, Phong","last_name":"Nguyen","first_name":"Phong"},{"first_name":"Elisabeth","full_name":"Oswald, Elisabeth","last_name":"Oswald"}],"intvolume":" 8441","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:31Z","doi":"10.1007/978-3-642-55220-5_6","pubrep_id":"680","publisher":"Springer","_id":"2185","publication_status":"published","alternative_title":["LNCS"],"type":"conference","ddc":["000","004"],"file":[{"file_name":"IST-2016-680-v1+1_708.pdf","file_id":"4705","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:31Z","file_size":505389,"checksum":"da1aa01221086083b23c92e547b48ff4","date_created":"2018-12-12T10:08:43Z"}],"oa_version":"Submitted Version","month":"04","year":"2014","department":[{"_id":"KrPi"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:55:51Z","scopus_import":1,"abstract":[{"lang":"eng","text":"We revisit the classical problem of converting an imperfect source of randomness into a usable cryptographic key. Assume that we have some cryptographic application P that expects a uniformly random m-bit key R and ensures that the best attack (in some complexity class) against P(R) has success probability at most δ. Our goal is to design a key-derivation function (KDF) h that converts any random source X of min-entropy k into a sufficiently "good" key h(X), guaranteeing that P(h(X)) has comparable security δ′ which is 'close' to δ. Seeded randomness extractors provide a generic way to solve this problem for all applications P, with resulting security δ′ = O(δ), provided that we start with entropy k ≥ m + 2 log (1/δ) - O(1). By a result of Radhakrishnan and Ta-Shma, this bound on k (called the "RT-bound") is also known to be tight in general. Unfortunately, in many situations the loss of 2 log (1/δ) bits of entropy is unacceptable. This motivates the study KDFs with less entropy waste by placing some restrictions on the source X or the application P. In this work we obtain the following new positive and negative results in this regard: - Efficient samplability of the source X does not help beat the RT-bound for general applications. This resolves the SRT (samplable RT) conjecture of Dachman-Soled et al. [DGKM12] in the affirmative, and also shows that the existence of computationally-secure extractors beating the RT-bound implies the existence of one-way functions. - We continue in the line of work initiated by Barak et al. [BDK+11] and construct new information-theoretic KDFs which beat the RT-bound for large but restricted classes of applications. Specifically, we design efficient KDFs that work for all unpredictability applications P (e.g., signatures, MACs, one-way functions, etc.) and can either: (1) extract all of the entropy k = m with a very modest security loss δ′ = O(δ·log (1/δ)), or alternatively, (2) achieve essentially optimal security δ′ = O(δ) with a very modest entropy loss k ≥ m + loglog (1/δ). In comparison, the best prior results from [BDK+11] for this class of applications would only guarantee δ′ = O(√δ) when k = m, and would need k ≥ m + log (1/δ) to get δ′ = O(δ). - The weaker bounds of [BDK+11] hold for a larger class of so-called "square- friendly" applications (which includes all unpredictability, but also some important indistinguishability, applications). Unfortunately, we show that these weaker bounds are tight for the larger class of applications. - We abstract out a clean, information-theoretic notion of (k,δ,δ′)- unpredictability extractors, which guarantee "induced" security δ′ for any δ-secure unpredictability application P, and characterize the parameters achievable for such unpredictability extractors. Of independent interest, we also relate this notion to the previously-known notion of (min-entropy) condensers, and improve the state-of-the-art parameters for such condensers."}],"author":[{"last_name":"Dodis","full_name":"Dodis, Yevgeniy","first_name":"Yevgeniy"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"status":"public"},{"oa":1,"citation":{"short":"T. Chen, C. Hainzl, N. Pavlović, R. Seiringer, Letters in Mathematical Physics 104 (2014) 871–891.","ista":"Chen T, Hainzl C, Pavlović N, Seiringer R. 2014. On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. 104(7), 871–891.","ieee":"T. Chen, C. Hainzl, N. Pavlović, and R. Seiringer, “On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti,” Letters in Mathematical Physics, vol. 104, no. 7. Springer, pp. 871–891, 2014.","ama":"Chen T, Hainzl C, Pavlović N, Seiringer R. On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. 2014;104(7):871-891. doi:10.1007/s11005-014-0693-2","mla":"Chen, Thomas, et al. “On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum de Finetti.” Letters in Mathematical Physics, vol. 104, no. 7, Springer, 2014, pp. 871–91, doi:10.1007/s11005-014-0693-2.","chicago":"Chen, Thomas, Christian Hainzl, Nataša Pavlović, and Robert Seiringer. “On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum de Finetti.” Letters in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s11005-014-0693-2.","apa":"Chen, T., Hainzl, C., Pavlović, N., & Seiringer, R. (2014). On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-014-0693-2"},"date_created":"2018-12-11T11:56:12Z","quality_controlled":"1","page":"871 - 891","publist_id":"4793","title":"On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti","publication":"Letters in Mathematical Physics","day":"07","volume":104,"intvolume":" 104","date_published":"2014-05-07T00:00:00Z","doi":"10.1007/s11005-014-0693-2","publisher":"Springer","type":"journal_article","oa_version":"Submitted Version","publication_status":"published","_id":"2186","issue":"7","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"month":"05","year":"2014","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T06:55:51Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1311.2136","open_access":"1"}],"abstract":[{"text":"We prove the existence of scattering states for the defocusing cubic Gross-Pitaevskii (GP) hierarchy in ℝ3. Moreover, we show that an exponential energy growth condition commonly used in the well-posedness theory of the GP hierarchy is, in a specific sense, necessary. In fact, we prove that without the latter, there exist initial data for the focusing cubic GP hierarchy for which instantaneous blowup occurs.","lang":"eng"}],"scopus_import":1,"status":"public","author":[{"first_name":"Thomas","full_name":"Chen, Thomas","last_name":"Chen"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"full_name":"Pavlović, Nataša","last_name":"Pavlović","first_name":"Nataša"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer"}]},{"title":"Synthesizing robust systems","page":"193 - 220","publist_id":"4787","quality_controlled":"1","citation":{"mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0191-5","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5.","ama":"Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. Acta Informatica. 2014;51(3-4):193-220. doi:10.1007/s00236-013-0191-5","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.","ieee":"R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014."},"date_created":"2018-12-11T11:56:13Z","oa":1,"article_processing_charge":"No","ec_funded":1,"file_date_updated":"2020-07-14T12:45:31Z","doi":"10.1007/s00236-013-0191-5","date_published":"2014-06-01T00:00:00Z","intvolume":" 51","has_accepted_license":"1","publication":"Acta Informatica","day":"01","volume":51,"article_type":"original","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"month":"06","year":"2014","publication_status":"published","issue":"3-4","_id":"2187","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:16:44Z","file_size":169523,"checksum":"d7f560f3d923f0f00aa10a0652f83273","file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","relation":"main_file","creator":"system","file_id":"5234"}],"type":"journal_article","ddc":["621"],"publisher":"Springer","pubrep_id":"71","status":"public","author":[{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Greimel, Karin","last_name":"Greimel","first_name":"Karin"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Georg","last_name":"Hofferek","full_name":"Hofferek, Georg"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"last_name":"Könighofer","full_name":"Könighofer, Bettina","first_name":"Bettina"},{"first_name":"Robert","full_name":"Könighofer, Robert","last_name":"Könighofer"}],"scopus_import":1,"abstract":[{"text":"Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:55:51Z"},{"quality_controlled":"1","citation":{"short":"U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).","ista":"Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.","ieee":"U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities and differences to animal epithelial cells,” Open Biology, vol. 4, no. APRIL. Royal Society, 2014.","ama":"Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. 2014;4(APRIL). doi:10.1098/rsob.140017","mla":"Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” Open Biology, vol. 4, no. APRIL, 140017, Royal Society, 2014, doi:10.1098/rsob.140017.","chicago":"Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” Open Biology. Royal Society, 2014. https://doi.org/10.1098/rsob.140017.","apa":"Kania, U., Fendrych, M., & Friml, J. (2014). Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. Royal Society. https://doi.org/10.1098/rsob.140017"},"date_created":"2018-12-11T11:56:13Z","oa":1,"article_number":"140017","title":"Polar delivery in plants; commonalities and differences to animal epithelial cells","publist_id":"4786","date_published":"2014-04-16T00:00:00Z","has_accepted_license":"1","intvolume":" 4","acknowledgement":"This work was supported by a grant from the Research Foundation-Flanders (Odysseus).\r\n\r\n","day":"16","publication":"Open Biology","volume":4,"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:31Z","doi":"10.1098/rsob.140017","publication_status":"published","issue":"APRIL","_id":"2188","type":"journal_article","ddc":["570"],"oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5025","creator":"system","file_name":"IST-2016-441-v1+1_140017.full.pdf","date_created":"2018-12-12T10:13:40Z","checksum":"2020627feff36cf0799167c84149fa75","file_size":682570,"date_updated":"2020-07-14T12:45:31Z","access_level":"open_access","content_type":"application/pdf"}],"publisher":"Royal Society","pubrep_id":"441","department":[{"_id":"JiFr"}],"year":"2014","month":"04","scopus_import":1,"abstract":[{"text":"Although plant and animal cells use a similar core mechanism to deliver proteins to the plasma membrane, their different lifestyle, body organization and specific cell structures resulted in the acquisition of regulatory mechanisms that vary in the two kingdoms. In particular, cell polarity regulators do not seem to be conserved, because genes encoding key components are absent in plant genomes. In plants, the broad knowledge on polarity derives from the study of auxin transporters, the PIN-FORMED proteins, in the model plant Arabidopsis thaliana. In animals, much information is provided from the study of polarity in epithelial cells that exhibit basolateral and luminal apical polarities, separated by tight junctions. In this review, we summarize the similarities and differences of the polarization mechanisms between plants and animals and survey the main genetic approaches that have been used to characterize new genes involved in polarity establishment in plants, including the frequently used forward and reverse genetics screens as well as a novel chemical genetics approach that is expected to overcome the limitation of classical genetics methods.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:55:52Z","status":"public","author":[{"id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","first_name":"Urszula","last_name":"Kania","full_name":"Kania, Urszula"},{"last_name":"Fendrych","full_name":"Fendrych, Matyas","first_name":"Matyas"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jiřĺ","last_name":"Friml","first_name":"Jiřĺ","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}]},{"status":"public","article_processing_charge":"No","author":[{"first_name":"Emilie","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8301-7240","last_name":"Morvant","full_name":"Morvant, Emilie"}],"day":"01","volume":1,"date_updated":"2021-01-12T06:55:52Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01005776/","open_access":"1"}],"intvolume":" 1","abstract":[{"lang":"fre","text":"En apprentissage automatique, nous parlons d'adaptation de domaine lorsque les données de test (cibles) et d'apprentissage (sources) sont générées selon différentes distributions. Nous devons donc développer des algorithmes de classification capables de s'adapter à une nouvelle distribution, pour laquelle aucune information sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq. PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté'' (justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage non itératif qui se focalise dans les régions où les distributions marginales source et cible sont les plus similaires. Dans un second temps, nous étudions l'influence de notre auto-étiquetage pour en déduire une procédure de validation des hyperparamètres. Finalement, notre approche montre des résultats empiriques prometteurs."}],"date_published":"2014-07-01T00:00:00Z","publist_id":"4785","page":"49-58","month":"07","year":"2014","department":[{"_id":"ChLa"}],"title":"Adaptation de domaine de vote de majorité par auto-étiquetage non itératif","publisher":"Elsevier","oa":1,"type":"conference","oa_version":"Preprint","date_created":"2018-12-11T11:56:13Z","citation":{"ama":"Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. In: Vol 1. Elsevier; 2014:49-58.","short":"E. Morvant, in:, Elsevier, 2014, pp. 49–58.","ista":"Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference) vol. 1, 49–58.","ieee":"E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014, vol. 1, pp. 49–58.","apa":"Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France: Elsevier.","chicago":"Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif,” 1:49–58. Elsevier, 2014.","mla":"Morvant, Emilie. Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif. Vol. 1, Elsevier, 2014, pp. 49–58."},"quality_controlled":"1","publication_status":"published","_id":"2189","conference":{"name":"CAP: Conférence Francophone sur l'Apprentissage Automatique (Machine Learning French Conference)","location":"Saint-Etienne, France"}},{"publisher":"Springer","_id":"2190","publication_status":"published","alternative_title":["LNCS"],"oa_version":"Submitted Version","type":"conference","month":"01","year":"2014","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:55:53Z","abstract":[{"text":"We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of φ. The slave automaton for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1402.3388","open_access":"1"}],"author":[{"first_name":"Javier","last_name":"Esparza","full_name":"Esparza, Javier"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"status":"public","oa":1,"conference":{"name":"CAV: Computer Aided Verification"},"quality_controlled":"1","date_created":"2018-12-11T11:56:14Z","citation":{"short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.","ieee":"J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.","ista":"Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.","ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:10.1007/978-3-319-08867-9_13","mla":"Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata: A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208, doi:10.1007/978-3-319-08867-9_13.","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_13.","apa":"Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13"},"page":"192 - 208","publist_id":"4784","title":"From LTL to deterministic automata: A safraless compositional approach","volume":8559,"acknowledgement":"The author is on leave from Faculty of Informatics, Masaryk University, Czech Republic, and partially supported by the Czech Science Foundation, grant No. P202/12/G061.","day":"01","date_published":"2014-01-01T00:00:00Z","intvolume":" 8559","doi":"10.1007/978-3-319-08867-9_13","ec_funded":1},{"article_number":"16","oa":1,"citation":{"apa":"Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2579821","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 2014;15(2). doi:10.1145/2579821","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.","ista":"Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.","short":"K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014)."},"date_created":"2018-12-11T11:56:21Z","quality_controlled":"1","arxiv":1,"publist_id":"4759","title":"Partial-observation stochastic games: How to win when belief fails","volume":15,"publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","intvolume":" 15","date_published":"2014-04-01T00:00:00Z","doi":"10.1145/2579821","publisher":"ACM","type":"journal_article","oa_version":"Preprint","issue":"2","_id":"2211","external_id":{"arxiv":["1107.2141"]},"publication_status":"published","month":"04","year":"2014","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:43Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Our main results for pure strategies are as follows: (1) For one-sided games with player 2 having perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 having perfect observation we show that nonelementarymemory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least nonelementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibit serious flaws in previous results of the literature: we show a nonelementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1903"},{"relation":"earlier_version","status":"public","id":"2955"},{"id":"5381","relation":"earlier_version","status":"public"}]},"main_file_link":[{"url":"http://arxiv.org/abs/1107.2141","open_access":"1"}],"scopus_import":1,"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"status":"public"},{"oa_version":"None","type":"conference","_id":"2212","alternative_title":["LNCS"],"publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"month":"04","year":"2014","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"abstract":[{"lang":"eng","text":"The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2 1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic). We present an algorithm running in time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which the objective can be ensured with probability 1, where n is the number of states of the game, d the number of priorities of the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states in 2 1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). "}],"related_material":{"record":[{"id":"5405","status":"public","relation":"earlier_version"}]},"scopus_import":1,"date_updated":"2023-02-23T12:24:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Hugo","full_name":"Gimbert, Hugo","last_name":"Gimbert"},{"first_name":"Youssouf","full_name":"Oualhadj, Youssouf","last_name":"Oualhadj"}],"status":"public","citation":{"mla":"Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_14","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14.","ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:10.1007/978-3-642-54830-7_14","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225."},"date_created":"2018-12-11T11:56:21Z","conference":{"location":"Grenoble, France","end_date":"2014-04-13","start_date":"2014-04-05","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"quality_controlled":"1","title":"Perfect-information stochastic mean-payoff parity games","publist_id":"4758","page":"210 - 225","intvolume":" 8412","date_published":"2014-04-01T00:00:00Z","volume":8412,"acknowledgement":"This research was supported by European project Cassting (FP7-601148).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128.","day":"01","ec_funded":1,"doi":"10.1007/978-3-642-54830-7_14"},{"title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","page":"242 - 257","publist_id":"4757","citation":{"ista":"Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.","ieee":"K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.","short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.","ama":"Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Vol 8412. Springer; 2014:242-257. doi:10.1007/978-3-642-54830-7_16","mla":"Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp. 242–57, doi:10.1007/978-3-642-54830-7_16.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_16.","apa":"Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16"},"date_created":"2018-12-11T11:56:21Z","arxiv":1,"quality_controlled":"1","conference":{"location":"Grenoble, France","end_date":"2014-04-13","name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2014-04-05"},"oa":1,"ec_funded":1,"doi":"10.1007/978-3-642-54830-7_16","intvolume":" 8412","date_published":"2014-04-01T00:00:00Z","day":"01","acknowledgement":"This research was supported by European project Cassting (FP7-601148), NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.","volume":8412,"department":[{"_id":"KrCh"}],"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"year":"2014","month":"04","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"publication_status":"published","external_id":{"arxiv":["1401.3289"]},"_id":"2213","publisher":"Springer","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":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Nain","full_name":"Nain, Sumit","first_name":"Sumit"},{"last_name":"Vardi","full_name":"Vardi, Moshe","first_name":"Moshe"}],"main_file_link":[{"url":"http://arxiv.org/abs/1401.3289","open_access":"1"}],"related_material":{"record":[{"id":"5408","status":"public","relation":"earlier_version"}]},"abstract":[{"lang":"eng","text":"We consider two-player partial-observation stochastic games on finitestate graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are ε-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). These qualitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME.We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis."}],"scopus_import":1,"date_updated":"2023-02-23T12:24:58Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"acknowledgement":"Michael Sixt's research is supported by the European Research Council (ERC Starting grant).","day":"22","publication":"PLoS One","volume":9,"date_published":"2014-01-22T00:00:00Z","has_accepted_license":"1","intvolume":" 9","file_date_updated":"2020-07-14T12:45:33Z","doi":"10.1371/journal.pone.0085699","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"},"ec_funded":1,"oa":1,"article_number":"e85699","quality_controlled":"1","date_created":"2018-12-11T11:56:22Z","citation":{"ama":"Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085699","short":"L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M.K. Sixt, R. Alon, PLoS One 9 (2014).","ista":"Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. 2014. Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. 9(1), e85699.","ieee":"L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M. K. Sixt, and R. Alon, “Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.","apa":"Stoler Barak, L., Moussion, C., Shezen, E., Hatzav, M., Sixt, M. K., & Alon, R. (2014). Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085699","chicago":"Stoler Barak, Liat, Christine Moussion, Elias Shezen, Miki Hatzav, Michael K Sixt, and Ronen Alon. “Blood Vessels Pattern Heparan Sulfate Gradients between Their Apical and Basolateral Aspects.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085699.","mla":"Stoler Barak, Liat, et al. “Blood Vessels Pattern Heparan Sulfate Gradients between Their Apical and Basolateral Aspects.” PLoS One, vol. 9, no. 1, e85699, Public Library of Science, 2014, doi:10.1371/journal.pone.0085699."},"publist_id":"4756","title":"Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:56:03Z","scopus_import":1,"abstract":[{"lang":"eng","text":"A hallmark of immune cell trafficking is directional guidance via gradients of soluble or surface bound chemokines. Vascular endothelial cells produce, transport and deposit either their own chemokines or chemokines produced by the underlying stroma. Endothelial heparan sulfate (HS) was suggested to be a critical scaffold for these chemokine pools, but it is unclear how steep chemokine gradients are sustained between the lumenal and ablumenal aspects of blood vessels. Addressing this question by semi-quantitative immunostaining of HS moieties around blood vessels with a pan anti-HS IgM mAb, we found a striking HS enrichment in the basal lamina of resting and inflamed post capillary skin venules, as well as in high endothelial venules (HEVs) of lymph nodes. Staining of skin vessels with a glycocalyx probe further suggested that their lumenal glycocalyx contains much lower HS density than their basolateral extracellular matrix (ECM). This polarized HS pattern was observed also in isolated resting and inflamed microvascular dermal cells. Notably, progressive skin inflammation resulted in massive ECM deposition and in further HS enrichment around skin post capillary venules and their associated pericytes. Inflammation-dependent HS enrichment was not compromised in mice deficient in the main HS degrading enzyme, heparanase. Our results suggest that the blood vasculature patterns steep gradients of HS scaffolds between their lumenal and basolateral endothelial aspects, and that inflammatory processes can further enrich the HS content nearby inflamed vessels. We propose that chemokine gradients between the lumenal and ablumenal sides of vessels could be favored by these sharp HS scaffold gradients."}],"status":"public","author":[{"first_name":"Liat","last_name":"Stoler Barak","full_name":"Stoler Barak, Liat"},{"last_name":"Moussion","full_name":"Moussion, Christine","first_name":"Christine","id":"3356F664-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Elias","last_name":"Shezen","full_name":"Shezen, Elias"},{"first_name":"Miki","full_name":"Hatzav, Miki","last_name":"Hatzav"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"},{"last_name":"Alon","full_name":"Alon, Ronen","first_name":"Ronen"}],"publisher":"Public Library of Science","pubrep_id":"433","publication_status":"published","issue":"1","_id":"2214","oa_version":"Published Version","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:33Z","file_size":12634775,"checksum":"84a8033bda2e07e39405f5acc85f4eca","date_created":"2018-12-12T10:07:48Z","file_name":"IST-2016-433-v1+1_journal.pone.0085699.pdf","creator":"system","file_id":"4646","relation":"main_file"}],"type":"journal_article","ddc":["570"],"project":[{"call_identifier":"FP7","name":"Stromal Cell-immune Cell Interactions in Health and Disease","_id":"25A76F58-B435-11E9-9278-68D0E5697425","grant_number":"289720"}],"year":"2014","month":"01","department":[{"_id":"MiSi"}]},{"date_created":"2018-12-11T11:56:22Z","citation":{"mla":"Renkawitz, Jörg, et al. “Mechanisms and Principles of Homology Search during Recombination.” Nature Reviews Molecular Cell Biology, vol. 15, no. 6, Nature Publishing Group, 2014, pp. 369–83, doi:10.1038/nrm3805.","apa":"Renkawitz, J., Lademann, C., & Jentsch, S. (2014). Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. Nature Publishing Group. https://doi.org/10.1038/nrm3805","chicago":"Renkawitz, Jörg, Claudio Lademann, and Stefan Jentsch. “Mechanisms and Principles of Homology Search during Recombination.” Nature Reviews Molecular Cell Biology. Nature Publishing Group, 2014. https://doi.org/10.1038/nrm3805.","ama":"Renkawitz J, Lademann C, Jentsch S. Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. 2014;15(6):369-383. doi:10.1038/nrm3805","ieee":"J. Renkawitz, C. Lademann, and S. Jentsch, “Mechanisms and principles of homology search during recombination,” Nature Reviews Molecular Cell Biology, vol. 15, no. 6. Nature Publishing Group, pp. 369–383, 2014.","short":"J. Renkawitz, C. Lademann, S. Jentsch, Nature Reviews Molecular Cell Biology 15 (2014) 369–383.","ista":"Renkawitz J, Lademann C, Jentsch S. 2014. Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. 15(6), 369–383."},"type":"journal_article","oa_version":"None","issue":"6","_id":"2215","quality_controlled":"1","publication_status":"published","publisher":"Nature Publishing Group","title":"Mechanisms and principles of homology search during recombination","department":[{"_id":"MiSi"}],"month":"05","year":"2014","publist_id":"4755","page":"369 - 383","abstract":[{"lang":"eng","text":"Homologous recombination is crucial for genome stability and for genetic exchange. Although our knowledge of the principle steps in recombination and its machinery is well advanced, homology search, the critical step of exploring the genome for homologous sequences to enable recombination, has remained mostly enigmatic. However, recent methodological advances have provided considerable new insights into this fundamental step in recombination that can be integrated into a mechanistic model. These advances emphasize the importance of genomic proximity and nuclear organization for homology search and the critical role of homology search mediators in this process. They also aid our understanding of how homology search might lead to unwanted and potentially disease-promoting recombination events."}],"intvolume":" 15","date_published":"2014-05-14T00:00:00Z","scopus_import":1,"volume":15,"date_updated":"2021-01-12T06:56:03Z","acknowledgement":"J.R. was supported by a Boehringer Ingelheim Fonds PhD stipend.","day":"14","publication":"Nature Reviews Molecular Cell Biology","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","first_name":"Jörg","orcid":"0000-0003-2856-3369","last_name":"Renkawitz","full_name":"Renkawitz, Jörg"},{"first_name":"Claudio","full_name":"Lademann, Claudio","last_name":"Lademann"},{"first_name":"Stefan","full_name":"Jentsch, Stefan","last_name":"Jentsch"}],"status":"public","doi":"10.1038/nrm3805"},{"department":[{"_id":"KrCh"}],"title":"Edit distance for timed automata","publist_id":"4752","page":"303 - 312","month":"01","year":"2014","publication_status":"published","quality_controlled":"1","_id":"2216","conference":{"end_date":"2017-04-17","location":"Berlin, Germany","start_date":"2017-04-15","name":"HSCC: Hybrid Systems - Computation and Control"},"type":"conference","oa_version":"Submitted Version","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.","short":"K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.","ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.","ama":"Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata. In: Springer; 2014:303-312. doi:10.1145/2562059.2562141","mla":"Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer, 2014, pp. 303–12, doi:10.1145/2562059.2562141.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141"},"date_created":"2018-12-11T11:56:22Z","oa":1,"publisher":"Springer","status":"public","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"doi":"10.1145/2562059.2562141","date_published":"2014-01-01T00:00:00Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5409"}]},"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=2562059.2562141"}],"abstract":[{"text":"The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory, parsing, and speech recognition. In this paper, we lift the study of edit distances from untimed languages to the timed setting. We define an edit distance between timed words which incorporates both the edit distance between the untimed words and the absolute difference in time stamps. Our edit distance between two timed words is computable in polynomial time. Further, we show that the edit distance between a timed word and a timed language generated by a timed automaton, defined as the edit distance between the word and the closest word in the language, is PSPACE-complete. While computing the edit distance between two timed automata is undecidable, we show that the approximate version, where we decide if the edit distance between two timed automata is either less than a given parameter or more than δ away from the parameter, for δ > 0, can be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques can be generalized to the setting of hybrid systems, and analogous decidability results hold for rectangular automata.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"day":"01","date_updated":"2023-02-23T12:25:01Z"},{"conference":{"start_date":"2014-04-15","name":"HSCC: Hybrid Systems - Computation and Control","location":"Berlin, Germany","end_date":"2014-04-17"},"quality_controlled":"1","citation":{"mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.","apa":"Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. In Proceedings of the 17th international conference on Hybrid systems: computation and control (pp. 213–222). Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562130","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.” In Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, 213–22. Springer, 2014. https://doi.org/10.1145/2562059.2562130.","ama":"Henzinger TA, Otop J. Model measuring for hybrid systems. In: Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control. Springer; 2014:213-222. doi:10.1145/2562059.2562130","short":"T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.","ieee":"T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings of the 17th international conference on Hybrid systems: computation and control, Berlin, Germany, 2014, pp. 213–222.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222."},"date_created":"2018-12-11T11:56:23Z","page":"213 - 222","publist_id":"4751","title":"Model measuring for hybrid systems","acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/171","publication":"Proceedings of the 17th international conference on Hybrid systems: computation and control","day":"01","date_published":"2014-04-01T00:00:00Z","doi":"10.1145/2562059.2562130","ec_funded":1,"article_processing_charge":"No","publisher":"Springer","_id":"2217","publication_status":"published","type":"conference","oa_version":"None","year":"2014","month":"04","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-23T12:25:23Z","scopus_import":1,"abstract":[{"text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem.","lang":"eng"}],"related_material":{"record":[{"id":"5416","status":"public","relation":"earlier_version"}]},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"status":"public"},{"title":"Regression-free synthesis for concurrency","publist_id":"4749","page":"568 - 584","quality_controlled":"1","conference":{"start_date":"2014-07-18","name":"CAV: Computer Aided Verification","end_date":"2014-07-22","location":"Vienna, Austria"},"citation":{"apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_38","chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_38.","mla":"Cerny, Pavol, et al. Regression-Free Synthesis for Concurrency. Vol. 8559, Springer, 2014, pp. 568–84, doi:10.1007/978-3-319-08867-9_38.","ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:10.1007/978-3-319-08867-9_38","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584."},"date_created":"2018-12-11T11:56:23Z","oa":1,"ec_funded":1,"file_date_updated":"2020-07-14T12:45:33Z","doi":"10.1007/978-3-319-08867-9_38","date_published":"2014-07-22T00:00:00Z","has_accepted_license":"1","intvolume":" 8559","day":"22","volume":8559,"department":[{"_id":"ToHe"}],"project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"month":"07","year":"2014","publication_identifier":{"isbn":["978-331908866-2"]},"alternative_title":["LNCS"],"publication_status":"published","_id":"2218","type":"conference","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:33Z","checksum":"a631d3105509f239724644e77a1212e2","file_size":416732,"date_created":"2018-12-12T10:13:14Z","file_name":"IST-2014-297-v1+1_cav14-final.pdf","creator":"system","file_id":"4995","relation":"main_file"},{"file_name":"IST-2014-297-v2+1_cav14-final2.pdf","relation":"main_file","creator":"system","file_id":"4996","date_updated":"2020-07-14T12:45:33Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:13:15Z","checksum":"f8b0f748cc9fa697ca992cc56c87bc4e","file_size":616293}],"ddc":["000"],"publisher":"Springer","pubrep_id":"297","status":"public","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"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"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1130"}]},"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38","open_access":"1"}],"abstract":[{"lang":"eng","text":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-09-07T11:57:01Z"},{"department":[{"_id":"KrPi"}],"publication_identifier":{"isbn":["978-364254630-3"]},"year":"2014","month":"03","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"publication_status":"published","_id":"2219","publisher":"Springer","status":"public","author":[{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"first_name":"Daniel","last_name":"Masny","full_name":"Masny, Daniel"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"https://eprint.iacr.org/2015/401","open_access":"1"}],"abstract":[{"lang":"eng","text":"Recently, Döttling et al. (ASIACRYPT 2012) proposed the first chosen-ciphertext (IND-CCA) secure public-key encryption scheme from the learning parity with noise (LPN) assumption. In this work we give an alternative scheme which is conceptually simpler and more efficient. At the core of our construction is a trapdoor technique originally proposed for lattices by Micciancio and Peikert (EUROCRYPT 2012), which we adapt to the LPN setting. The main technical tool is a new double-trapdoor mechanism, together with a trapdoor switching lemma based on a computational variant of the leftover hash lemma."}],"scopus_import":1,"date_updated":"2021-01-12T06:56:05Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Simple chosen-ciphertext security from low noise LPN","page":"1 - 18","publist_id":"4748","citation":{"ama":"Kiltz E, Masny D, Pietrzak KZ. Simple chosen-ciphertext security from low noise LPN. In: Vol 8383. Springer; 2014:1-18. doi:10.1007/978-3-642-54631-0_1","short":"E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.","ieee":"E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security from low noise LPN,” presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18.","ista":"Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from low noise LPN. IACR: International Conference on Practice and Theory in Public-Key Cryptography, LNCS, vol. 8383, 1–18.","mla":"Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN. Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.","apa":"Kiltz, E., Masny, D., & Pietrzak, K. Z. (2014). Simple chosen-ciphertext security from low noise LPN (Vol. 8383, pp. 1–18). Presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, Springer. https://doi.org/10.1007/978-3-642-54631-0_1","chicago":"Kiltz, Eike, Daniel Masny, and Krzysztof Z Pietrzak. “Simple Chosen-Ciphertext Security from Low Noise LPN,” 8383:1–18. Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_1."},"date_created":"2018-12-11T11:56:24Z","quality_controlled":"1","conference":{"name":"IACR: International Conference on Practice and Theory in Public-Key Cryptography"},"oa":1,"doi":"10.1007/978-3-642-54631-0_1","intvolume":" 8383","date_published":"2014-03-01T00:00:00Z","day":"01","volume":8383},{"title":"Suppressive drug interactions between antifungals","publist_id":"4747","page":"439 - 440","citation":{"mla":"de Vos, Marjon, and Mark Tobias Bollenbach. “Suppressive Drug Interactions between Antifungals.” Chemistry and Biology, vol. 21, no. 4, Cell Press, 2014, pp. 439–40, doi:10.1016/j.chembiol.2014.04.004.","chicago":"Vos, Marjon de, and Mark Tobias Bollenbach. “Suppressive Drug Interactions between Antifungals.” Chemistry and Biology. Cell Press, 2014. https://doi.org/10.1016/j.chembiol.2014.04.004.","apa":"de Vos, M., & Bollenbach, M. T. (2014). Suppressive drug interactions between antifungals. Chemistry and Biology. Cell Press. https://doi.org/10.1016/j.chembiol.2014.04.004","short":"M. de Vos, M.T. Bollenbach, Chemistry and Biology 21 (2014) 439–440.","ieee":"M. de Vos and M. T. Bollenbach, “Suppressive drug interactions between antifungals,” Chemistry and Biology, vol. 21, no. 4. Cell Press, pp. 439–440, 2014.","ista":"de Vos M, Bollenbach MT. 2014. Suppressive drug interactions between antifungals. Chemistry and Biology. 21(4), 439–440.","ama":"de Vos M, Bollenbach MT. Suppressive drug interactions between antifungals. Chemistry and Biology. 2014;21(4):439-440. doi:10.1016/j.chembiol.2014.04.004"},"date_created":"2018-12-11T11:56:24Z","quality_controlled":"1","oa":1,"doi":"10.1016/j.chembiol.2014.04.004","intvolume":" 21","date_published":"2014-04-24T00:00:00Z","day":"24","publication":"Chemistry and Biology","volume":21,"pmid":1,"department":[{"_id":"ToBo"}],"publication_identifier":{"issn":["10745521"]},"month":"04","year":"2014","type":"journal_article","oa_version":"Published Version","external_id":{"pmid":["24766845"]},"publication_status":"published","_id":"2220","issue":"4","publisher":"Cell Press","status":"public","author":[{"first_name":"Marjon","id":"3111FFAC-F248-11E8-B48F-1D18A9856A87","last_name":"De Vos","full_name":"De Vos, Marjon"},{"first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/24766845","open_access":"1"}],"abstract":[{"lang":"eng","text":"In this issue of Chemistry & Biology, Cokol and colleagues report a systematic study of drug interactions between antifungal compounds. Suppressive drug interactions occur more frequently than previously realized and come in different flavors with interesting implications."}],"scopus_import":1,"date_updated":"2021-01-12T06:56:06Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]}]