Results 221 to 230 of about 245,163 (269)
Some of the next articles are maybe not open access.
MINIMUM FLOW VARIATION IN MAXIMUM FLOWS
Discrete Mathematics, Algorithms and Applications, 2010Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost.
M. Masoumi +2 more
openaire +2 more sources
Job Flows, Worker Flows, and Churning
Journal of Labor Economics, 2000We utilize a large employer‐level panel dataset to explore the links between gross job flows and gross worker flows. Our findings have relevance for models of job creation and job destruction, and labor reallocation. We find churning flows (the difference between worker and job flows at the level of the employer) to be high, pervasive, and highly ...
Burgess, SM, Lane, J, Stevens, D
openaire +3 more sources
"River Flow, Sewer Flow, Street Flow
Transfers, 2012River Flow, Sewer Flow, Street Flow is a location-based, interactive mobile soundscape originally presented in Old Montreal at DHC-ART1 as part of the exhibition Lost Rivers: La Petite St. Pierre. The exhibition took up mobility as a curatorial challenge and featured videos and photographs by underground explorer Andrew Emond and sound compositions by ...
Kim Sawchuk, Samuel Thulin
openaire +1 more source
IEEE Computer Graphics and Applications, 2011
This installment looks at the work of Brenda Molloy, who creates art based on digital imagery.
openaire +2 more sources
This installment looks at the work of Brenda Molloy, who creates art based on digital imagery.
openaire +2 more sources
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
A Single‐Flow Battery with Multiphase Flow
ChemSusChem, 2020AbstractWidespread adoption of redox flow batteries (RFBs) for renewable energy storage is inhibited by a relatively high cost of storage. This is due largely to typical RFBs requiring two flows, two external tanks, and expensive ion‐exchange membranes.
Lihi Amit +4 more
openaire +2 more sources
When “Slow Flow” Is Not “Low Flow”
JACC: Cardiovascular Interventions, 2022Gallinoro E +5 more
openaire +3 more sources
Manufacturing Engineer, 1992
When output isn't what it should be, and the losses are piling up, it is easy to look at the internal workings of the factory for the answer. But what about external influences? Vic Lilley explains.
openaire +1 more source
When output isn't what it should be, and the losses are piling up, it is easy to look at the internal workings of the factory for the answer. But what about external influences? Vic Lilley explains.
openaire +1 more source
Potential flow, viscous flow and compressible flow
1992Abstract At the close of Chapter 16 the Navier-Stokes, continuity, and thermal energy equations for fluid flow were introduced. The present chapter presents finite element formulations for a wide range of fluid flow problems governed by these equations.
openaire +1 more source