[{"type":"journal_article","abstract":[{"text":"We study the density of varieties in a certain family which do not satisfy the Hasse principle. This work relies on results recently obtained by Colliot-Thélène [3].","lang":"eng"}],"publist_id":"7651","issue":"1","extern":1,"_id":"251","year":"2013","status":"public","publication_status":"published","title":"Counter examples to the Hasse principle among certain coflasque tori","intvolume":" 26","publisher":"Universite de Bordeaux I","author":[{"first_name":"Régis","last_name":"De La Bretèche","full_name":"de la Bretèche, Régis"},{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","full_name":"Timothy Browning"}],"date_updated":"2021-01-12T06:57:55Z","date_created":"2018-12-11T11:45:26Z","volume":26,"month":"05","day":"14","publication":"Journal de Theorie des Nombres de Bordeaux","citation":{"chicago":"De La Bretèche, Régis, and Timothy D Browning. “Counter Examples to the Hasse Principle among Certain Coflasque Tori.” Journal de Theorie Des Nombres de Bordeaux. Universite de Bordeaux I, 2013. https://doi.org/10.5802/jtnb.857.","short":"R. De La Bretèche, T.D. Browning, Journal de Theorie Des Nombres de Bordeaux 26 (2013) 25–44.","mla":"De La Bretèche, Régis, and Timothy D. Browning. “Counter Examples to the Hasse Principle among Certain Coflasque Tori.” Journal de Theorie Des Nombres de Bordeaux, vol. 26, no. 1, Universite de Bordeaux I, 2013, pp. 25–44, doi:10.5802/jtnb.857.","ieee":"R. De La Bretèche and T. D. Browning, “Counter examples to the Hasse principle among certain coflasque tori,” Journal de Theorie des Nombres de Bordeaux, vol. 26, no. 1. Universite de Bordeaux I, pp. 25–44, 2013.","apa":"De La Bretèche, R., & Browning, T. D. (2013). Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie Des Nombres de Bordeaux. Universite de Bordeaux I. https://doi.org/10.5802/jtnb.857","ista":"De La Bretèche R, Browning TD. 2013. Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie des Nombres de Bordeaux. 26(1), 25–44.","ama":"De La Bretèche R, Browning TD. Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie des Nombres de Bordeaux. 2013;26(1):25-44. doi:10.5802/jtnb.857"},"quality_controlled":0,"page":"25 - 44","date_published":"2013-05-14T00:00:00Z","doi":"10.5802/jtnb.857"},{"doi":"10.1007/978-3-642-39212-2_3","conference":{"end_date":"2013-07-12","location":"Riga, Latvia","start_date":"2013-07-08","name":"ICALP: Automata, Languages and Programming"},"language":[{"iso":"eng"}],"oa":1,"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","month":"07","author":[{"full_name":"Almagor, Shaull","last_name":"Almagor","first_name":"Shaull"},{"full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"volume":7966,"date_created":"2018-12-11T11:58:08Z","date_updated":"2020-08-11T10:09:47Z","acknowledgement":"ERC Grant QUALITY. ","year":"2013","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","ec_funded":1,"publist_id":"4384","file_date_updated":"2020-07-14T12:45:42Z","date_published":"2013-07-01T00:00:00Z","citation":{"ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","apa":"Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.","ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:10.1007/978-3-642-39212-2_3","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_3.","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.","mla":"Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3."},"page":"15 - 27","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":1,"series_title":"Lecture Notes in Computer Science","oa_version":"Submitted Version","file":[{"checksum":"85afbf6c18a2c7e377c52c9410e2d824","date_created":"2020-05-15T11:16:12Z","date_updated":"2020-07-14T12:45:42Z","file_id":"7860","relation":"main_file","creator":"dernst","file_size":363031,"content_type":"application/pdf","access_level":"open_access","file_name":"2013_ICALP_Almagor.pdf"}],"_id":"2517","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 7966","ddc":["000"],"title":"Formalizing and reasoning about quality","status":"public","issue":"Part 2","abstract":[{"lang":"eng","text":"Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL."}],"type":"conference","alternative_title":["LNCS"]},{"oa_version":"Preprint","intvolume":" 7965","status":"public","title":"The power of linear programming for finite-valued CSPs: A constructive characterization","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2518","issue":"1","abstract":[{"text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2013-07-01T00:00:00Z","page":"625 - 636","citation":{"apa":"Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39206-1_53","ieee":"V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.","ista":"Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965, 625–636.","ama":"Kolmogorov V. The power of linear programming for finite-valued CSPs: A constructive characterization. In: Vol 7965. Springer; 2013:625-636. doi:10.1007/978-3-642-39206-1_53","chicago":"Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. https://doi.org/10.1007/978-3-642-39206-1_53.","short":"V. Kolmogorov, in:, Springer, 2013, pp. 625–636.","mla":"Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53."},"day":"01","scopus_import":1,"volume":7965,"date_updated":"2023-02-23T10:35:42Z","date_created":"2018-12-11T11:58:08Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"2271"}]},"author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer","department":[{"_id":"VlKo"}],"publication_status":"published","year":"2013","publist_id":"4383","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39206-1_53","conference":{"start_date":"2013-07-08","location":"Riga, Latvia","end_date":"2013-07-12","name":"ICALP: Automata, Languages and Programming"},"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7213"}],"external_id":{"arxiv":["1207.7213"]},"month":"07"},{"oa_version":"None","volume":36,"date_updated":"2021-01-12T06:57:58Z","date_created":"2018-12-11T11:58:08Z","author":[{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"first_name":"Hannes","last_name":"Nickisch","full_name":"Nickisch, Hannes"},{"last_name":"Harmeling","first_name":"Stefan","full_name":"Harmeling, Stefan"}],"intvolume":" 36","department":[{"_id":"ChLa"}],"publisher":"IEEE","status":"public","title":"Attribute-based classification for zero-shot learning of object categories","publication_status":"published","_id":"2516","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","publist_id":"4385","abstract":[{"lang":"eng","text":"We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object's color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1109/TPAMI.2013.140","date_published":"2013-07-30T00:00:00Z","page":"453 - 465","quality_controlled":"1","citation":{"ama":"Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2013;36(3):453-465. doi:10.1109/TPAMI.2013.140","ista":"Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(3), 453–465.","apa":"Lampert, C., Nickisch, H., & Harmeling, S. (2013). Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2013.140","ieee":"C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification for zero-shot learning of object categories,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 3. IEEE, pp. 453–465, 2013.","mla":"Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:10.1109/TPAMI.2013.140.","short":"C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2013) 453–465.","chicago":"Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2013. https://doi.org/10.1109/TPAMI.2013.140."},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","day":"30","month":"07","scopus_import":1},{"oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2013-137-v1+1_QuaShaKnoGha13.pdf","creator":"system","file_size":1117100,"content_type":"application/pdf","file_id":"5134","relation":"main_file","checksum":"325f20c4b926bd74d39006b97df572bd","date_created":"2018-12-12T10:15:16Z","date_updated":"2020-07-14T12:45:42Z"}],"pubrep_id":"137","title":"The supervised IBP: Neighbourhood preserving infinite latent feature models","ddc":["000"],"status":"public","_id":"2520","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We propose a probabilistic model to infer supervised latent variables in\r\nthe Hamming space from observed data. Our model allows simultaneous\r\ninference of the number of binary latent variables, and their values. The\r\nlatent variables preserve neighbourhood structure of the data in a sense\r\nthat objects in the same semantic concept have similar latent values, and\r\nobjects in different concepts have dissimilar latent values. We formulate\r\nthe supervised infinite latent variable problem based on an intuitive\r\nprinciple of pulling objects together if they are of the same type, and\r\npushing them apart if they are not. We then combine this principle with a\r\nflexible Indian Buffet Process prior on the latent variables. We show that\r\nthe inferred supervised latent variables can be directly used to perform a\r\nnearest neighbour search for the purpose of retrieval. We introduce a new\r\napplication of dynamically extending hash codes, and show how to\r\neffectively couple the structure of the hash codes with continuously\r\ngrowing structure of the neighbourhood preserving infinite latent feature\r\nspace.","lang":"eng"}],"type":"conference","date_published":"2013-07-11T00:00:00Z","page":"527 - 536","citation":{"ama":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. The supervised IBP: Neighbourhood preserving infinite latent feature models. In: Proceedings of the 29th Conference Uncertainty in Artificial Intelligence. AUAI Press; 2013:527-536.","apa":"Quadrianto, N., Sharmanska, V., Knowles, D., & Ghahramani, Z. (2013). The supervised IBP: Neighbourhood preserving infinite latent feature models. In Proceedings of the 29th conference uncertainty in Artificial Intelligence (pp. 527–536). Bellevue, WA, United States: AUAI Press.","ieee":"N. Quadrianto, V. Sharmanska, D. Knowles, and Z. Ghahramani, “The supervised IBP: Neighbourhood preserving infinite latent feature models,” in Proceedings of the 29th conference uncertainty in Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 527–536.","ista":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. 2013. The supervised IBP: Neighbourhood preserving infinite latent feature models. Proceedings of the 29th conference uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial Intelligence, 527–536.","short":"N. Quadrianto, V. Sharmanska, D. Knowles, Z. Ghahramani, in:, Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–536.","mla":"Quadrianto, Novi, et al. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–36.","chicago":"Quadrianto, Novi, Viktoriia Sharmanska, David Knowles, and Zoubin Ghahramani. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” In Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, 527–36. AUAI Press, 2013."},"publication":"Proceedings of the 29th conference uncertainty in Artificial Intelligence","has_accepted_license":"1","day":"11","scopus_import":1,"date_created":"2018-12-11T11:58:09Z","date_updated":"2023-02-23T10:46:36Z","author":[{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0192-9308","first_name":"Viktoriia","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia"},{"full_name":"Knowles, David","first_name":"David","last_name":"Knowles"},{"last_name":"Ghahramani","first_name":"Zoubin","full_name":"Ghahramani, Zoubin"}],"department":[{"_id":"ChLa"}],"publisher":"AUAI Press","publication_status":"published","year":"2013","publist_id":"4381","file_date_updated":"2020-07-14T12:45:42Z","language":[{"iso":"eng"}],"conference":{"name":"UAI: Uncertainty in Artificial Intelligence","location":"Bellevue, WA, United States","start_date":"2013-07-11","end_date":"2013-07-15"},"quality_controlled":"1","oa":1,"publication_identifier":{"isbn":["9780974903996"]},"month":"07"}]