Results 81 to 90 of about 1,228,420 (310)

On the minimization of maximum transient energy growth [PDF]

open access: yes, 2007
The problem of minimizing the maximum transient energy growth is considered. This problem has importance in some fluid flow control problems and other classes of nonlinear systems.
Whidborne, James F., McKernan, John
core   +1 more source

Maximum Flow Model With Multiple Origin and Destination and Its Application in Designing Urban Drainage Systems

open access: yesIEEE Access
In this paper, a multi-origin and multi-destination maximum flow model is proposed by integrating the objective programming method with graph theory. Through Model 1, low-cost design of drainage pipeline networks can be achieved.
Mu Ren   +3 more
doaj   +1 more source

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Ratio of maximum flow to average flow

open access: yes, 2019
Ratio of maximum flow to average ...
Rod Shaw (1258020)   +2 more
core   +1 more source

On the maximum capacity augmentation algorithm for the maximum flow problem

open access: yesDiscrete Applied Mathematics, 1993
The subject of this paper is two variants of the classical path- augmentation algorithm for maximum capacitated flow problem. The main point of the paper is that both algorithms have polynomial bounds even when the capacities have real values. The first bound is \(O(m^ 2\log m)\) flow augmentations and \(O(m^ 3\log m)\) operations.
Donald Goldfarb, Jianxiu Hao
openaire   +1 more source

Maximum Flows in Parametric Graph Templates

open access: yes, 2023
Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template representation allows us to reason about the execution graph of a parallel program at a cost that only depends on the ...
Tal Ben-Nun   +3 more
openaire   +3 more sources

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

Playing with the Maximum-Flow Problem

open access: yesEPiC Series in Computing, 2018
In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges. The problem has been extensively used in order to optimize the performance of networks in numerous application areas.
openaire   +2 more sources

On the history of the transportation and maximum flow problems [PDF]

open access: yesMathematical Programming, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Phosphoinositides and inositol phosphates as molecular glues

open access: yesFEBS Letters, EarlyView.
Inositol phosphates (IPs) and phosphoinositides (PIPs) regulate diverse eukaryotic processes. Beyond recruiting signaling proteins or acting as structural cofactors, recent studies suggest they mediate protein–protein interactions as natural molecular glues.
Aleshia Seaton‐Terry   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy