Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"flow decomposition"”.

  1. Approximation algorithms for the minimum congestion routing problem via k-route flows

    … c_e on each edge e in E, an elementary k-flow is defined as a flow of 1 unit along each of k edge-disjoint s-t paths. A k-route flow, first introduced as a concept by Kishimoto, is defined as a non-negative linear sum of elementary k-flows. In this thesis, the study of k-route flows is …

    uiuc Repository record for Approximation algorithms for the minimum congestion routing problem via k-route flows (opens in a new tab)

  2. Optimization and network sensitivity analysis for process retrofitting

    … in the problem formulation, the analysis of the flowsheet, the synthesis of retrofitting options and the final decision, allow the decision maker to handle the complexity of the problem and focus on the truly critical aspects of the flowsheet. The proposed methodology structures the problem by …

    mit Repository record for Optimization and network sensitivity analysis for process retrofitting (opens in a new tab)

  3. Predicting Motion of Engine-Ingested Particles Using Deep Neural Networks

    … expense to accurately simulate the fluid flow and particle motion inside the separator. It has been well-documented that particle ingestion yields many detrimental impacts for gas turbine engines. The consequences of ice particle ingestion can range from surface-wear abrasion to engine …

    vt Repository record for Predicting Motion of Engine-Ingested Particles Using Deep Neural Networks (opens in a new tab)

  4. From graphs to matrices, and back : new techniques for graph algorithms

    … graph problems including: -- The Maximum s-t Flow and Minimum s-t Cut Problems. We develop a new approach to computing (1 - [epsilon])-approximately maximum s-t flow and (1 + [epsilon])-approximately minimum s-t cut in undirected graphs that gives the fastest known algorithms for these tasks. …

    mit Repository record for From graphs to matrices, and back : new techniques for graph algorithms (opens in a new tab)

  5. Horizontal vorticity redistribution and vortex alignment in developing and mature tropical cyclones

    … be meaningfully represented through a wave, mean-flow decomposition. This is typically true if the vortex cores at upper and lower levels overlap. The validity of the linear model is tested for a range of vortex tilts using a quasi-geostrophic model in both its complete and linear, …

    colostate Repository record for Horizontal vorticity redistribution and vortex alignment in developing and mature tropical cyclones (opens in a new tab)

  6. Propeller Noise Prediction of an Urban Air Mobility Vehicle in Urban Environment

    … (i) transition (tilt) flight, (ii) edgewise inflow, and (iii) wake–propeller interaction. Each case emphasizes different physical mechanisms that dominate noise generation in UAM operations. Hybrid turbulence-resolving approaches—Detached Eddy Simulation (DES) and Delayed Detached Eddy …

    embry-riddle Repository record for Propeller Noise Prediction of an Urban Air Mobility Vehicle in Urban Environment (opens in a new tab)