Numerické optimalizační metody
Lukšan, Ladislav
2024 - Czech Tato zpráva popisuje teoretické i praktické vlastnosti numerických metod pro nepodmíněnou optimalizaci. Studují se metody pro obecné i speciální optimalizační úlohy, mezi které patří minimalizace součtu čtverců, součtu absolutních hodnot, maximní hodnoty a dalších nehladkých funkcí. Kromě metod pro standardní úlohy středních rozměrů jsou studovány i metody pro rozsáhlé řídké a strukturované úlohy. Velká pozornost je věnována soustavám nelineárních rovnic.\n Keywords: Numerická optimalizace; nelineární aproximace; systémy nelineárních rovnic; algoritmy Available on request at various institutes of the ASCR Numerické optimalizační metody

Tato zpráva popisuje teoretické i praktické vlastnosti numerických metod pro nepodmíněnou optimalizaci. Studují se metody pro obecné i speciální optimalizační úlohy, mezi které patří minimalizace ...

Lukšan, Ladislav
Ústav informatiky, 2024

Some modifications of the limited-memory variable metric optimization methods
Vlček, Jan; Lukšan, Ladislav
2023 - English Several modifications of the limited-memory variable metric (or quasi-Newton) line search methods for large scale unconstrained optimization are investigated. First the block version of the symmetric rank-one (SR1) update formula is derived in a similar way as for the block BFGS update in Vlˇcek and Lukˇsan (Numerical Algorithms 2019). The block SR1 formula is then modified to obtain an update which can reduce the required number of arithmetic operations per iteration. Since it usually violates the corresponding secant conditions, this update is combined with the shifting investigated in Vlˇcek and Lukˇsan (J. Comput. Appl. Math. 2006). Moreover, a new efficient way how to realize the limited-memory shifted BFGS method is proposed. For a class of methods based on the generalized shifted economy BFGS update, global convergence is established. A numerical comparison with the standard L-BFGS and BNS methods is given. Keywords: unconstrained minimization; variable metric methods; limited-memory methods; variationally derived methods; arithmetic operations reduction; global convergence Available in a digital repository NRGL Some modifications of the limited-memory variable metric optimization methods

Several modifications of the limited-memory variable metric (or quasi-Newton) line search methods for large scale unconstrained optimization are investigated. First the block version of the symmetric ...

Vlček, Jan; Lukšan, Ladislav
Ústav informatiky, 2023

Epidemiologické modely s agenty
Neruda, Roman
2023 - Czech Tento příspěvek je jemným úvodem do problematiky agentních modelů a jejich aplikací v epidemiologickém modelování. Představíme agentní modely jednak z hlediska informatiky, jednak jako nástroj modelování v jiných vědních disciplínách. V příkladové studii ukážeme model s agenty a sociální sítí jejich kontaktů, který slouží pro simulaci vývoje epidemie a vlivu protiepidemických opatření. Available at various institutes of the ASCR Epidemiologické modely s agenty

Tento příspěvek je jemným úvodem do problematiky agentních modelů a jejich aplikací v epidemiologickém modelování. Představíme agentní modely jednak z hlediska informatiky, jednak jako nástroj ...

Neruda, Roman
Ústav informatiky, 2023

From John Graunt to Adolphe Quetelet: on the Origins Of Demography
Kalina, Jan
2023 - English John Graunt (1620-1674) and Adolphe Quetelet (1796-1874) were two important personalities, who contributed to the origins of demography. As they both developed statistical techniques for the analysis of demographic data, they are important also from the point of view of history of statistics. The contributions of both Graunt and Quetelet especially to the development of mortality tables and models are recalled in this paper. Already from the 17th century, the available mortality tables were exploited for computing life annuities. Also the contribution of selected personalities inspired by Graunt are recalled here, the work of Christian Huygens, Jacob Bernoulli, or Abraham de Moivre is discussed to document that the historical development of statistics and probability theory was connected with the development of demography. Keywords: history of demography; history of statistics; probability theory; moral statistics; mortality tables Fulltext is available at external website. From John Graunt to Adolphe Quetelet: on the Origins Of Demography

John Graunt (1620-1674) and Adolphe Quetelet (1796-1874) were two important personalities, who contributed to the origins of demography. As they both developed statistical techniques for the analysis ...

Kalina, Jan
Ústav informatiky, 2023

Different Boundary Conditions For LES Solver PALM 6.0 Used for ABL in Tunnel Experiment
Řezníček, Hynek; Geletič, Jan; Bureš, Martin; Krč, Pavel; Resler, Jaroslav; Vrbová, Kateřina; Trush, Arsenii; Michálek, Petr; Beneš, L.; Sühring, M.
2023 - English We tried to reproduce results measured in the wind tunnel experiment with a CFD simulation provided by numerical model PALM. A realistic buildings layout from the Prague-Dejvice quarter has been chosen as a testing domain because solid validation campaign for PALM simulation of Atmospheric Boundary Layer (ABL) over this quarter was documented in the past. The question of input data needed for such simulation and capability of the model to capture correctly the inlet profile and its turbulence structure provided by the wind-tunnel is discussed in the study The PALM dynamical core contains a solver for the Navier-Stokes equations. By default, the model uses the Large Eddy Simulation (LES) approach in which the bulk of the turbulent motions is explicitly resolved. It is well validated tool for simulations of the complex air-flow within the real urban canopy and also within its reduced scale provided by wind tunnel experiments. However the computed flow field between the testing buildings did not correspond well to the measured wind velocity in some points. Different setting of the inlet boundary condition was tested but none of them gave completely developed turbulent flow generated by vortex generators and castellated barrier wall place at the entrance of the aerodynamic section of the wind tunnel. Keywords: large eddy simulation; wind tunnel; atmospheric boundary layer; PALM model; turbulence Fulltext is available at external website. Different Boundary Conditions For LES Solver PALM 6.0 Used for ABL in Tunnel Experiment

We tried to reproduce results measured in the wind tunnel experiment with a CFD simulation provided by numerical model PALM. A realistic buildings layout from the Prague-Dejvice quarter has been ...

Řezníček, Hynek; Geletič, Jan; Bureš, Martin; Krč, Pavel; Resler, Jaroslav; Vrbová, Kateřina; Trush, Arsenii; Michálek, Petr; Beneš, L.; Sühring, M.
Ústav informatiky, 2023

On the structure and values of betweenness centrality in dense betweenness-uniform graphs
Ghanbari, B.; Hartman, David; Jelínek, V.; Pokorná, Aneta; Šámal, R.; Valtr, P.
2023 - English Betweenness centrality is a network centrality measure based on the amount of shortest paths passing through a given vertex. A graph is betweenness-uniform (BUG)if all vertices have an equal value of betweenness centrality. In this contribution, we focus on betweenness-uniform graphs with betweenness centrality below one. We disprove a conjecture about the existence of a BUG with betweenness value α for any rational numberαfrom the interval (3/4,∞) by showing that only very few betweenness centrality values below 6/7 are attained for at least one BUG. Furthermore, among graphs with diameter at least three, there are no betweenness-uniform graphs with a betweenness centrality smaller than one. In graphs of smaller diameter, the same can be shown under a uniformity condition on the components of the complement. Keywords: betweenness; graphs Available in digital repository of the ASCR On the structure and values of betweenness centrality in dense betweenness-uniform graphs

Betweenness centrality is a network centrality measure based on the amount of shortest paths passing through a given vertex. A graph is betweenness-uniform (BUG)if all vertices have an equal value of ...

Ghanbari, B.; Hartman, David; Jelínek, V.; Pokorná, Aneta; Šámal, R.; Valtr, P.
Ústav informatiky, 2023

Souhrnná zpráva projektu LINE za rok 2023
Brabec, Marek; Juruš, Pavel; Malý, Marek; Pelikán, Emil; Šrotýř, M.; Turčičová, Marie
2023 - Czech Tato zpráva byla vytvořena řešitelským týmem Ústavu informatiky AV ČR, v.v.i. v Praze pro potřeby společnosti GasNet, s.r.o. na základě objednávky č. 4500028548. Ve zprávě jsou shrnuty výsledky činností prováděných v roce 2023. Je popsán proces zpracování vstupních dat a jsou řešeny úlohy detekce odlehlých pozorování spotřeby, analýzy bilančních rozdílů a charakterizace vývoje spotřeby plynu v prostoru a čase. Available at various institutes of the ASCR Souhrnná zpráva projektu LINE za rok 2023

Tato zpráva byla vytvořena řešitelským týmem Ústavu informatiky AV ČR, v.v.i. v Praze pro potřeby společnosti GasNet, s.r.o. na základě objednávky č. 4500028548. Ve zprávě jsou shrnuty výsledky ...

Brabec, Marek; Juruš, Pavel; Malý, Marek; Pelikán, Emil; Šrotýř, M.; Turčičová, Marie
Ústav informatiky, 2023

Etika AI: Přehled současné debaty v kontextu energetiky
Černý, David; Trčka, M.; Kolaříková, L.; Hvorecký, J.; Pelikán, Emil; Hříbek, T.; Novotný, D.; Wiedermann, Jiří
2023 - Czech Available at various institutes of the ASCR Etika AI: Přehled současné debaty v kontextu energetiky

Černý, David; Trčka, M.; Kolaříková, L.; Hvorecký, J.; Pelikán, Emil; Hříbek, T.; Novotný, D.; Wiedermann, Jiří
Ústav informatiky, 2023

Beyond the Erdős–Sós conjecture
Davoodi, Akbar; Piguet, Diana; Řada, Hanka; Sanhueza-Matamala, N.
2023 - English We prove an asymptotic version of a tree-containment conjecture of Klimošová, Piguet and Rozhoň [European J. Combin. 88 (2020), 103106] for graphs with quadratically many edges. The result implies that the asymptotic version of the Erdős-Sós conjecture in the setting of dense graphs is correct. Keywords: conjecture; Erdős-Sós conjecture Available in digital repository of the ASCR Beyond the Erdős–Sós conjecture

We prove an asymptotic version of a tree-containment conjecture of Klimošová, Piguet and Rozhoň [European J. Combin. 88 (2020), 103106] for graphs with quadratically many edges. The result implies ...

Davoodi, Akbar; Piguet, Diana; Řada, Hanka; Sanhueza-Matamala, N.
Ústav informatiky, 2023

Rooting algebraic vertices of convergent sequences
Hartman, David; Hons, T.; Nešetřil, J.
2023 - English Structural convergence is a framework for convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given sequence of graphs (Gn) converging to a limit L and a vertex r of L it is possible to find a sequence of vertices (rn) such that L rooted at r is the limit of the graphs Gn rooted at rn. A counterexample was found by Christofides and Král’, but they showed that the statement holds for almost all vertices r of L. We offer another perspective to the original problem by considering the size of definable sets to which the root r belongs. We prove that if r is an algebraic vertex (i.e. belongs to a finite definable set), the sequence of roots (rn) always exists. Keywords: rooting; algebraic vertices; convergent sequences Available in digital repository of the ASCR Rooting algebraic vertices of convergent sequences

Structural convergence is a framework for convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem ...

Hartman, David; Hons, T.; Nešetřil, J.
Ústav informatiky, 2023