Results 21 to 30 of about 99,580 (267)
Nauka ta progres transportu, 2018 Purpose. The purpose of the article is to develop a new unified procedure for planning of the fuzzy multi-product, dynamic and competitive flows in the transport networks and in the information network systems.
V. V. Skalozub, L. O. Panik
doaj +1 more source
Coordinator MPC for maximizing plant throughput [PDF]
Modeling, Identification and Control, 2008 In many cases economic optimal operation is the same as maximum plant throughput, which is the same as maximum flow through the bottleneck(s). This insight may greatly simplify implementation. In this paper, we consider the case where the bottlenecks may
Elvira M.B. Aske +2 more
doaj +1 more source
Seasonal Occurrence of Maximum Annual Flows in the Danube River Basin in Croatia
Građevinar, 2012 The analysis of seasonal occurrence of maximum annual flows, conducted at 95 gauging stations within the Danube river basin, is presented. Burn’s vector method, and RVA - Range of Variability Approach method based on elementary statistical analysis of ...
Darko Barbalić, Josip Petraš
doaj +1 more source
The quantitative estimation of the vulnerability of brick and concrete wall impacted by an experimental boulder [PDF]
Natural Hazards and Earth System Sciences, 2016 There is little historic data about the vulnerability of damaged elements due to debris flow events in China. Therefore, it is difficult to quantitatively estimate the vulnerable elements suffered by debris flows. This paper is devoted to the research of
J. Zhang, Z. X. Guo, D. Wang, H. Qian
doaj +1 more source
Effect of Monodisperse Coal Particles on the Maximum Drop Spreading After Impact on a Solid Wall
Energies, 2023 The effect of coal hydrophilic particles in water-glycerol drops on the maximum diameter of spreading along a hydrophobic solid surface is experimentally studied by analyzing the velocity of internal flows by Particle Image Velocimetry (PIV).
Alexander Ashikhmin +4 more
doaj +1 more source
Networks, 2020 AbstractIn 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan.
James B. Orlin, Xiao-Yue Gong
openaire +4 more sources
A STATISTICAL AND HYDROLOGICAL ANALYSIS OF THE MAXIMUM FLOW IN THE TERPEZITA RIVER DRAINAGE BASIN [PDF]
Riscuri şi Catastrofe, 2015 A statistical and hydrological analysis of the maximum flow in the Terpezița river drainage basin. Starting from the idea that hydrological and hydrometeorological parameters have a statistical existence over time and a spatial distribution that can be ...
GABRIELA ADINA MOROŞANU, G. VELCU
doaj
On maximum flows in polyhedral domains [PDF]
Proceedings of the fourth annual symposium on Computational geometry - SCG '88, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
THE STATISTICAL ANALYSIS AND THE QUANTITATIVE ASSESSMENT OF ANNUAL MAXIMUM FLOWS RECORDED IN THE HYDROGRAPHICAL BASIN OF TIMIŞ RIVER [PDF]
Aerul şi Apa: Componente ale Mediului, 2011 The statistical analysis and the quantitative assessment ofannual maximum flows recorded in the hydrographical basin of Timiş river.We should calculate the frequency of flooding in this part of the country anddetermine the flow values or maximum levels ...
ANDREEA MIHAELA DOMĂŞNEANU
doaj
Learning-augmented maximum flow
Information Processing LettersWe propose a framework for speeding up maximum flow computation by using predictions. A prediction is a flow, i.e., an assignment of non-negative flow values to edges, which satisfies the flow conservation property, but does not necessarily respect the edge capacities of the actual instance (since these were unknown at the time of learning). We present
Polak, Adam, Zub, Maksym
openaire +3 more sources