Best results in : Research Potential Pokaż wszystkie wyniki (2)
Search results for: IDF FORMULAS
-
Katedra Hydrotechniki
Research PotentialProfil badawczy Katedry Hydrotechniki jest głównie związany z procesem ruchu wody w środowisku naturalnym, jak również w instalacjach technicznych. Zespół katedralny jest silnie powiązany tematycznie z takimi zagadnieniami jak mechanika płynów, hydraulika, hydrologia, meteorologia, budownictwo wodne czy gospodarka wodna.
-
Zespół Katedry Rachunku Prawdopodobieństwa i Biomatematyki
Research Potential* modele ryzyka i ich zastosowania * probabilistyczne i grafowe metody w biologii * stochastyczne równania różniczkowe * statystyczna analiza danych * teoria grafów * teoria i zastosowania stochastycznych układów dynamicznych w biologii i medycynie
Other results Pokaż wszystkie wyniki (3)
Search results for: IDF FORMULAS
-
Development of Local IDF-formula Using Controlled Random Search Method for Global Optimization
PublicationThe aim of the study is to present the effective and relatively simple empirical approach to rainfall Intensity-Duration-Frequency-formulas development, based on Controlled Random Search (CRS) for global optimization. The approach is mainly dedicated to the cases in which the commonly used IDF-relationships do not provide satisfactory fit between simulations and observations, and more complex formulas with higher number of parameters...
-
Comparative Analysis of Developed Rainfall Intensity–Duration–Frequency Curves for Erbil with Other Iraqi Urban Areas
PublicationRainfall Intensity–Duration–Frequency (IDF) relationships are widely used in water infrastructure design and construction. IDF curves represent the relationship between rainfall intensity, duration, and frequency, and are obtained by analyzing observed data. These relationships are critical for the safe design of flood protection structures, storm sewers, culverts, bridges, etc. In this study, the IDF curves and empirical IDF formulas...
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...