1,152 research outputs found
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
We introduce a new problem that combines the well known All Pairs Shortest
Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to
compute the shortest paths for all pairs of vertices for all possible flow
amounts. We call this new problem the All Pairs Shortest Paths for All Flows
(APSP-AF) problem. We firstly solve the APSP-AF problem on directed graphs with
unit edge costs and real edge capacities in
time,
where is the number of vertices, is the number of distinct edge
capacities (flow amounts) and is the time taken
to multiply two -by- matrices over a ring. Secondly we extend the problem
to graphs with positive integer edge costs and present an algorithm with
worst case time complexity, where is
the upper bound on edge costs
Optimization of suppression for two-element treatment liners for turbomachinery exhaust ducts
Sound wave propagation in a soft-walled rectangular duct with steady uniform flow was investigated at exhaust conditions, incorporating the solution equations for sound wave propagation in a rectangular duct with multiple longitudinal wall treatment segments. Modal analysis was employed to find the solution equations and to study the effectiveness of a uniform and of a two-sectional liner in attenuating sound power in a treated rectangular duct without flow (M = 0) and with uniform flow of Mach 0.3. Two-segment liners were shown to increase the attenuation of sound as compared to a uniform liner. The predicted sound attenuation was compared with measured laboratory results for an optimized two-segment suppressor. Good correlation was obtained between the measured and predicted suppressions when practical variations in the modal content and impedance were taken into account. Two parametric studies were also completed
- …