Zobrazeno 1 - 10
of 56
pro vyhledávání: '"SERGEI SOLOVIEV"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 56, Iss Proc. AMMSE 2011, Pp 33-47 (2011)
This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed lambda-ca
Externí odkaz:
https://doaj.org/article/91daacc4a6a14142894a7ee33756ffe7
Publikováno v:
SIN
The paper considers the task of bot detection in social networks. It checks the hypothesis that bots break Benford’s law much more often than users, so one can identify them. A bot detection approach is proposed based on experiments where the test
Publikováno v:
Poster presentations.
The LupusQoL is a disease-specific health-related quality of life (HRQoL) measure for patients with lupus. We conducted this study to compare the efficiency of LupusQoL with the 36-item Short-Form Health Survey (SF-36), a generic quality of life (QoL
Autor:
J. Malakhovski, Sergei Soloviev
Publikováno v:
Journal of Mathematical Sciences
Journal of Mathematical Sciences, Springer Verlag (Germany), 2019, 240 (5), pp.692--706. ⟨10.1007/s10958-019-04386-8⟩
Journal of Mathematical Sciences, Springer Verlag (Germany), 2019, 240 (5), pp.692--706. ⟨10.1007/s10958-019-04386-8⟩
We outline recent results in the theory of type isomorphisms and automorphisms and present several practical applications of these results that can be useful in the contexts of programming and data security. Bibliography: 27 titles.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd6cf159b8dca98405e8cc2e8c24fb4c
https://hal.archives-ouvertes.fr/hal-03003829
https://hal.archives-ouvertes.fr/hal-03003829
Autor:
Sergei Soloviev
Publikováno v:
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 29 (4), pp.511-551. ⟨10.1017/S0960129518000129⟩
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 29 (4), pp.511-551. ⟨10.1017/S0960129518000129⟩
International audience; The notion of automorphism of types is defined, as usual, it is an isomorphism A->A. The groups of automorphisms of types in different type theories are studied. It is shown that in simply typed lambda calculus the automorphis
Autor:
Sergei Soloviev, Zhaohui Luo
Publikováno v:
Logic, Language, Information, and Computation
24th International Workshop Logic, Language, Information, and Computation (WoLLIC 2017)
24th International Workshop Logic, Language, Information, and Computation (WoLLIC 2017), Jul 2017, London, United Kingdom. pp. 216-228
Logic, Language, Information, and Computation ISBN: 9783662553855
WoLLIC
24th International Workshop Logic, Language, Information, and Computation (WoLLIC 2017)
24th International Workshop Logic, Language, Information, and Computation (WoLLIC 2017), Jul 2017, London, United Kingdom. pp. 216-228
Logic, Language, Information, and Computation ISBN: 9783662553855
WoLLIC
This paper studies how dependent types can be employed for a refined treatment of event types, offering a nice improvement to Davidson’s event semantics. We consider dependent event types indexed by thematic roles and illustrate how, in the presenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2c35722d4328ecea9f38f5bd791a8c1
https://hal.archives-ouvertes.fr/hal-01913662/document
https://hal.archives-ouvertes.fr/hal-01913662/document
Autor:
Alan Cowey, Lucia M. Vaina, Ferdinando S. Buonanno, Richard E. Passingham, Finnegan J. Calabro, Sergei Soloviev
Publikováno v:
Journal of Cognitive Neuroscience. 26:1266-1282
We studied patient JS, who had a right occipital infarct that encroached on visual areas V1, V2v, and VP. When tested psychophysically, he was very impaired at detecting the direction of motion in random dot displays where a variable proportion of do
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2013, vol. 223, pp. 18-42. ⟨10.1016/j.ic.2012.10.020⟩
Information and Computation, Elsevier, 2013, vol. 223, pp. 18-42. ⟨10.1016/j.ic.2012.10.020⟩
International audience; Coercive subtyping is a useful and powerful framework of subtyping for type theories. The key idea of coercive subtyping is subtyping as abbreviation. In this paper, we give a new and adequate formulation of T[C], the system t
Publikováno v:
Journal of Mathematical Sciences. 168:491-503
We consider certain applications of proof theory to the study of algebraic categories, The case usually studied in the literature is that of free categories with an additional structure. In this paper, we consider several problems in nonfree categori
Autor:
Nicholas Asher, Sergei Soloviev
Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 8th International Conference on Logical Aspects of Computational Linguistics (LACL 2014) held in Toulouse, F