Pozvánka na přednášku - Ústav informatiky
https://www.cs.cas.cz/seminars
Přehled konaných přednášek z oblasti informatikyMichał M. Stronkowski: Profiniteness and finitely generated varieties
https://www.cs.cas.cz/logics/seminar.html
Profinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety V of algebras is standard if every Boolean topological algebra with the algebraic reduct in V is profinite. We show that there is no algorithm that takes as input a finite algebra A (of a finite type) and decides whether the variety generated by A is standard. We also show the undecidability of some related properties. In particular, we solve the problem posed by Clark, Davey, Freese, and Jackson about finitely determined syntactic congruences in finitely generated varieties. Our work is based on Moore's theorem about undecidability of having definable principal subcongruences for finitely generated varieties. Joint work with Anvar M. Nurakunov.Michał M. StronkowskiSeminář aplikované matematické logiky - 23.10.2019 16:00 @
Místnost 318Moraschini Tommaso: Profinite Heyting algebras and the representation problem for Esakia spaces
https://www.cs.cas.cz/logics/seminar.html
A poset is said to be "representable" if it can be endowed with an Esakia topology. Gratzer's classical representation problem asks for a description of representable posets which - unfortunately - is not expected to take a simple form, as these do not form an elementary class. As at the moment a solution to the representation problem seems out of reach, we address a simpler version of the problem which, roughly speaking, asks to determine the posets that may occur as top parts of Esakia spaces. Crossing the mirror between algebra and topology, this task amounts to characterize the profinite Heyting algebras that are also profinite completions. We shall report on the on-going effort to solve this problem by understanding the structure of varieties of Heyting algebras whose profinite members are profinite completions. This talk is based on joint work with G. Bezhanishvili, N. Bezhanishvili, and M. Stronkowski.Moraschini TommasoSeminář aplikované matematické logiky - 30.10.2019 16:00 @
Místnost 318Renata Tiene de Carvalho Yokota: addhaz: Contribution of Chronic Diseases to the Disability Burden Using R
https://sites.google.com/site/iscbcr/in-the-news/addhazcontributionofchronicdiseasestothedisabilityburdenusingr
The increase in life expectancy followed by the growing proportion of old individuals living with chronic diseases contributes to the burden of disability worldwide. The estimation of how much each chronic condition contributes to the disability prevalence can be useful to develop public health strategies to reduce the burden. In this presentation the R package addhaz, which is based on the attribution method (Nusselder and Looman 2004) to partition the total disability prevalence into the additive contributions of chronic diseases using cross-sectional data, will be introduced. The R package includes tools to fit the binomial and multinomial additive hazard models, the core of the attribution method. The models are fitted by maximizing the binomial and multinomial log-likelihood functions using constrained optimization (constrOptim function in R). The 95% Wald and bootstrap percentile confidence intervals can be obtained for the parameter estimates. Also, the absolute and relative contribution of each chronic condition to the disability prevalence and their bootstrap confidence intervals can be estimated. An additional feature of addhaz is the possibility to use parallel computing to obtain the bootstrap confidence intervals, reducing computation time. In this presentation, we will illustrate the use of addhaz with examples for the binomial and multinomial models, using the data from the Brazilian National Health Survey, 2013.Renata Tiene de Carvalho YokotaSeminář ISCB ČR - 10.10.2019 14:00 @
Místnost 222Sanhueza Nicolás: Partitioning 2-coloured complete 3-graphs into two monochromatic tight cycles
http://uivty.cs.cas.cz/ExtrA/seminar.html
As a variant on the traditional Ramsey-type questions, there has been a lot of research about the existence of spanning monochromatic subgraphs in complete edge-coloured graphs and hypergraphs. One of the central questions in this area was proposed by Lehel around 1979, who conjectured that the vertex set of every 2-edge-coloured complete graph can be partitioned into two monochromatic cycles of distinct colours. This was answered in the affirmative by Bessy and Thomassé in 2010. We generalise the question of Lehel to the setting of 3-uniform hypergraphs (3-graphs). More precisely, we show that every sufficiently large 2-edge-coloured complete 3-graph admits a vertex partition into two monochromatic tight cycles, possibly of the same colour. We also present examples showing that (in contrast to the graph case) it is not always possible to find partitions into two monochromatic tight cycles of different colours. As by-products from our proof, we can find vertex partitions into two cycles of different colours and two vertices, and vertex partitions into a cycle and a path of different colours. This is joint work with Frederik Garbe, Richard Mycroft, Richard Lang and Allan Lo.Sanhueza NicolásGraph Theory Seminar - 11.10.2019 10:00 @
Místnost 318Daniel Statman: The Use of Drones and the Problem of Disproportionate Harm to Civilians
https://www.cevast.org/
Prof. Daniel Statman je mezinárodně uznávaný odborník na teorii spravedlivé války a etiku moderních vojenských technologií. Jeho poslední publikace War by Agreement: A Contractarian Ethics of War právě vyšla v nakladatelství Oxford University Press. Prosime o registraci zajemcu na adrese david.cerny@ilaw.cas.czDaniel StatmanCentrum Karla Čapka pro studium hodnot ve vědě a technice - 18.10.2019 14:00 @ Ústav státu a práva AV ČR, v. v. i., Národní 18, 11600 Praha 1 (sedmé patro).