Maximum Flow Research Papers - Academia.edu (original) (raw)

Top Papers
Most Cited Papers
Most Downloaded Papers
Newest Papers
People
- by
- •
- Engineering, Microfluidics, Heat Transfer, Lab On A Chip
- by Cyril Lafon and +1
- •
- Algorithms, Biomedical Engineering, Humans, Computer Simulation
- by James Orlin
- •
- Applied Mathematics, Time Use, Business and Management, Operations
- by Christophe Duhamel
- •
- Applied Mathematics, Pure Mathematics, Column Generation, Symmetry Breaking
- by Yao-wen Chang
- •
- Vlsi Design, Industrial Design, Signal Integrity, Routing
- by Jogesh Muppala
- •
- Engineering, Technology, Computer Networks, Voice over IP
- by Farid Amirouche
- •
- Drug delivery, Nanotechnology, Power Consumption, Research and Development
- by Stefan Jacobsen
- •
- Civil Engineering, Surface Roughness, Building, Pipe Flow
- by Keejoe Lim
- •
- Numerical Simulation, Maximum Flow, Optimal Design, Piezoelectric Actuator
- by N. Lamaddalena
- •
- Drinking Water, Evolutionary Algorithm, Maximum Flow, Water Level

Laporan praktikum Riset Operasi: Shortes Path adalah salah satu permasalahan ‘mudah’ saat mempelajari materi tentang graph, yaitu dengan mencari cost dari jalur terpendek (jalur dengan cost terendah) dalam suatu graph. Ada beberapa algoritma yang dapat digunakan untuk memecahkan permasalahan ini, antara lain yang cukup terkenal adalah Bellman Ford dan Djikstra. Namun, masing-masing algoritma tersebut memiliki kelemahan dan kelebihan, semisal dari segi efisiensi antara Bellman Ford dan Djikstra yang lebih efisien adalah Djikstra, akan tetapi dalam beberapa kasus Bellman Ford lebih unggul yaitu jika salah satu cost dari edgenya ada yang bernilai negatif, hal ini disebabkan algoritma Djikstra hanya bisa dipakai jika semua cost dari edgenya tidak bernilai negatif. Kemudian maksimum flow, yaitu masalah bagaimana cara menentukan besarnya penugasan flow pada suatu jaringan kerja sehingga flow yang sampai ke tujuan maksimal. Penyelesaian masalah maksimum flow dapat lebih mudah dan efisien jika menggunakan algoritma. Dua algoritma yang sudah ada dan sering digunakan yaitu algoritma Lintasan Penambah dan algoritma Pelabelan Aka.

- by Rauzan Sumara
- •
- Shortest Path Problem, Maximum Flow, Shortest Path

Este informe acompaña a la implementación en C++ de cinco implementaciones de algoritmos que resuelven el problema de corte mínimo en un grafo conexo, no dirigido, sin slef-loops ni multiaristas. Entre ellos, dos deterministas, uno probabilista y dos que combinan ambos enfoques. El código se encuentra disponible en este repositorio https://github.com/jssprz/min-cut.git con la información necesaria para compilarla y ejecutarla en README.md. Además, se incluye la implementación de un conjunto de experimentos funcionales que validan su correcto funcionamiento y alta eficiencia.

- by Jesus Perez-Martin
- •
- Graphs Theory, Network Flow, Maximum Flow, Minimum Cut
- by Charles R Ortloff
- •
- Archaeology, Geochemistry, Archaeological Science, Flow Control
- by Kandasamy Ramamurthi
- •
- Engineering, Heat Exchanger, Desalination, Water Temperature
- by Orhan Dengiz and +1
- •
- Distributed Computing, Particle Swarm Optimization, Mobile Ad Hoc Network, Ad Hoc Networks
- by Monika Sharma
- •
- Engineering, Materials Engineering, Mechanical Engineering, Wear
- by Claudia D'Ambrosio
- •
- Computer Science, Algorithms, Visualization, Graph Theory
- by Randeep Singh
- •
- Engineering, Heat Transfer, Heat and Mass Transfer, Mathematical Sciences
- by Brahim Chaourar and +1
- •
- Throughput, Very high throughput, Maximum Flow, Multipath Routing
- by Luciane Alcoforado
- •
- Combinatorial Optimization, Multidisciplinary, Parallel Machines, Maximum Flow
- by Phalguni Gupta
- •
- Applied Mathematics, Combinatorial Optimization, Time Complexity, Network Flow
- by Eva Björkner and +2
- •
- Maximum Flow
- by Aj Prameswari
- •
- Algorithms, Database Systems, Computer Networks, Databases
- by Thomas Shepherd
- •
- Geology, Geochemistry, Spatial Variation, Maximum Flow
- by mohsen khosravi
- •
- Genetics, Intelligent Transport System, Genetic Algorithm, Maximum Flow
- by Qian Yu
- •
- Multidisciplinary, Nature, Dislocations, Sample Size

The regulated hydrograph of the Kootenai River between Libby Dam and Kootenay Lake has altered the natural flow regime, resulting in a significant decrease in maximum flows (60% net reduction in median 1-day annual maximum, and 77%-84% net reductions in median monthly flows for the historic peak flow months of May and June, respectively). Other key hydrologic characteristics have also

- by Rohan Benjankar and +1
- •
- Stratification, Populus, Spatial Distribution, Flow Regime
- by Derek Ingham
- •
- Engineering, Hydrogen Energy, PEM fuel cell, CHEMICAL SCIENCES

A numerical model and technique are described to simulate the turbulent fluid flow over and heat transfer through a model of vehicle windshield defrosting and demisting systems. The simplified geometry and the dimensions of the numerical model are representative of vehicle system with accurate locations of the nozzles and outlet vents, including cabin features such as seating and the rear parcel shelf. The three-dimensional geometry of the numerical model is created in Auto Cad (Release 14). Surface meshing and a computational mesh of 750,000 (tetrahedral) fluid cells is generated in the pre-processor of the CFD software used for the simulation of the fluid flow. Turbulence is modelled by using the k-ɛ turbulence equations together with the wall function method. This decision was made after comparing the k-ɛ model's performance with that of lower order models, and after considering the increased computer time requirements and decreased stability of more complex models, such as the Reynolds stress model. The numerical results of the study are very encouraging and compare favourably with measurements obtained from the actual vehicle by Thermograph and Hot Bulb probe techniques. The findings highlight some of the drawbacks of the existing design of the windshield systems and show that the maximum flow rates occur in the vicinity of the lower part of the windshield, progressing from the defroster nozzle in the dashboard.

- by amr hassan
- •
- Heat Transfer, Heat and Mass Transfer, Numerical Simulation, Fluid flow
- by Nam Nguyen
- •
- Materials Engineering, Mechanical Engineering, Printed Circuit Board, Maximum Flow

This paper presents the design, fabrication, and experimental characterization of a peristaltic micropump. The micropump is composed of two layers fabricated from polydimethylsiloxane (PDMS) material. The first layer has a rectangular channel and two valve seals. Three rectangular mini lightweight piezo-composite actuators are integrated in the second layer, and used as actuation parts. Two layers are bonded, and covered by two polymethyl methacrylate (PMMA) plates, which help increase the stiffness of the micropump. A maximum flow rate of 900 mokroliter per min and a maximum backpressure of 1.8 kPa are recorded when water is used as pump liquid. We measured the power consumption of the micropump. The micropump is found to be a promising candidate for bio-medical application due to its bio-compatibility, portability, bidirectionality, and simple effective design.

- by Thanh Tùng
- •
- Biomedical Engineering, Power Consumption, Polydimethylsiloxane, Maximum Flow
- by Lauren Hay
- •
- Environmental Engineering, Climate Change, Ecology, River

This article addresses the question of implementing a maximum flow algorithm on directed graphs in a formulation suitable for a quantum annealing computer. Three distinct approaches are presented. In all three cases, the flow problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem amenable to quantum annealing. The first implementation augments a graph with integral edge capacities into a multigraph with unit-capacity edges and encodes the fundamental objective and constraints of the maximum flow problem using a number of qubits equal to the total capacity of the graph ∑i ci . The second implementation, which encodes flows through edges using a binary representation, reduces the required number of qubits to O(|E|logCmax) , where |E| and Cmax denote the number of edges and maximum edge capacity of the graph, respectively. The third implementation adapts the dual minimum cut formulation and encodes the problem instance using |V| qubits, where |V| is the number of vertices in the graph. Scaling factors for penalty terms and coupling matrix construction times are made explicit in this article.

- by Josef Eberhardsteiner
- •
- Irrigation, Comparative Study, In Vitro, Humans

The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first develop a parallel decomposition algorithm that in polylogarithmic depth and otilde(∣E∣)\otilde(|E|)otilde(∣E∣) work, partitions a graph into components with polylogarithmic diameter such that only a small fraction of the original edges are between the components. This can be used to generate low-stretch spanning trees with average stretch O(nalpha)O(n^{\alpha})O(nalpha) in O(n1+alpha)O(n^{1+\alpha})O(n1+alpha) work and O(nalpha)O(n^{\alpha})O(nalpha) depth. Alternatively, it can be used to generate spanning subgraphs with polylogarithmic average stretch in otilde(∣E∣)\otilde(|E|)otilde(∣E∣) work and polylogarithmic depth. We apply this subgraph construction to derive a parallel linear system solver. By using this solver in known applications, our results imply improved parallel randomized algorithms for several problems, including single-source shortest paths, maximum flow, minimum-cost flow, and approximate maximum flow.

- by Richard Peng
- •
- Applied Mathematics, Distributed Computing, Numerical Analysis, Cluster Computing
- by Shahin Tabatabaei and +1
- •
- Urology, Laser Therapy, Maximum Flow, Benign Prostate Hyperplasia

We encounter many different types of networks in our everyday lives, including electrical, telephone, cable,
highway, rail, manufacturing and computer networks. Networks consist of special points called nodes and links
connecting pairs of nodes called arcs. The maximum flow problem is one of the most fundamental problems in
network flow theory and has been investigated extensively. From last few decades researchers have made a steady
stream of innovation that have resulted in new solution methods and improvements to known methods. Continuous
improvements to algorithms have been made by researchers for solving several classes of problems. In this paper
recent techniques and algorithms related to parametric maximum flow problem are given.

- by Deepak Garg and +1
- •
- Maximum Flow
- by Pradeep Naik
- •
- Management, Environmental Engineering, Civil Engineering, Climate Change
- by maitane olabarrieta
- •
- Geology, Data Modelling, Spatial planning, Impact Assessment
- by Jabnon Nonjab
- •
- Problem Solving, Mathematical Sciences, Branch and Bound, Efficient Frontier
- by Juan Santiago
- •
- Engineering, Thermodynamics, Heat Exchanger, Physical sciences

In the framework of the European SCenarios for tsunami Hazard-induced Emergencies MAnagement (SCHEMA) project (<a href="http://www.schemaproject.org" target_"blank">www.schemaproject.org), we empirically developed new tsunami damage functions to be used for quantifying the potential tsunami damage to buildings along European-Mediterranean coasts. Since no sufficient post-tsunami observations exist in the Mediterranean areas, we based our work on data collected by several authors in Banda Aceh (Indonesia) after the 2004 Indian Ocean tsunami. Obviously, special attention has been paid in focusing on Indonesian buildings which present similarities (in structure, construction material, number of storeys) with the building typologies typical of the European-Mediterranean areas. An important part of the work consisted in analyzing, merging, and interpolating the post-disaster observations published by three independent teams in order to obtain the spatial distribution of flow depths necessary to link the flow-depth hazard parameter to the damage level observed on buildings. Then we developed fragility curves (showing the cumulative probability to have, for each flow depth, a damage level equal-to or greater-than a given threshold) and damage curves (giving the expected damage level) for different classes of buildings. It appears that damage curves based on the weighted mean damage level and the maximum flow depth are the most appropriate for producing, under GIS, expected damage maps for different tsunami scenarios.

- by Richard GUILLANDE
- •
- Geology, Emergency Management, Indian Ocean, Data Collection
- by Anna Padoa
- •
- Quality of life, Pelvic Organ Prolapse, Prospective studies, Humans
- by James Pak
- •
- Materials Engineering, Mechanical Engineering, Polydimethylsiloxane, Maximum Flow