نتایج جستجو برای: twophase flow

تعداد نتایج: 482147  

Journal: :CoRR 2018
Peixian Liang Jianxu Chen Pavel A. Brodskiy Qinfeng Wu Yejia Zhang Yizhe Zhang Lin Yang Jeremiah J. Zartman Danny Ziyi Chen

Wing disc pouches of fruit flies are a powerful genetic model for studying physiological intercellular calcium (Ca) signals for dynamic analysis of cell signaling in organ development and disease studies. A key to analyzing spatial-temporal patterns of Ca signal waves is to accurately align the pouches across image sequences. However, pouches in different image frames may exhibit extensive inte...

1995
Marek S. Makowski Dragan MaksimoviC

Theoretical performance limits of twophase switched-capacitor (SC) dc-dc converters are discussed in this paper. For a given number of capacitors k, the complete set of attainable dc conversion ratios is found. The maximum step-up or stepdown ratio is given by the k t h Fibonacci number, while the bound on the number of switches required in any SC circuit is 3k 2. Practical implications, illust...

2000
Mark A. Knackstedt Adrian P. Sheppard Muhammad Sahimi

Using large scale computer simulations and pore network models of porous rock, we investigate the e€ect of correlated heterogeneity on two-phase ̄ow through porous media. First, we review and discuss the experimental evidence for correlated heterogeneity. We then employ the invasion percolation model of two-phase ̄ow in porous media to study the e€ect of correlated heterogeneity on rate-control...

1997
Jing-Chiou Liou Michael A. Palis

This paper demonstrates the effectiveness of the twophase method of scheduling, in which task clustering is performed prior to the actual scheduling process. Task clustering determines the optimal or near-optimal number of processors on which to schedule the task graph. In other words, there is never a need to use more processors (even though they are available) than the number of clusters prod...

1996
Patrick E. O'Neil Krithi Ramamritham Calton Pu

We consider the problem of designing a database system that schedules ACID transactions to meet real-time deadlines. Two complementary algorithms are proposed, valid for a large class of applications, that minimize the unproductive data contention and limit to one the number of transaction aborts and subsequent retries arising from achieving serializability in concurrent execution. This is a cr...

Journal: :J. Scheduling 2015
Egbert van der Veen Erwin W. Hans Gerhard F. Post Bart Veltman

This paper introduces a shift rostering problem that surprisingly has not been studied in literature: the weekend shift rostering problem. It is motivated by our experience that employees’ shift preferences predominantly focus on the weekends, since many social activities happen during weekends. The Weekend Rostering Problem (WRP) addresses the rostering of weekend shifts, for which we design a...

2013
Nam-Yong Lee

For deblurring images corrupted by random valued noise, two-phase methods first select likely-to-be reliables (data that are not corrupted by random valued noise) and then deblur images only with selected data. The selective use of data in twophase methods, however, often causes missing data artifacts. In this paper, to suppress these missing data artifacts, we propose a blurring model based re...

2017
Ulysse Gérard Dale Miller

The logical foundation of arithmetic generally starts with a quantificational logic over relations. Of course, one often wishes to have a formal treatment of functions within this setting. Both Hilbert and Church added choice operators (such as the epsilon operator) to logic in order to coerce relations that happen to encode functions into actual functions. Others have extended the term languag...

2013
Sanjaya Kumar Panda Pabitra Mohan Khilar

Scheduling is an emergent area in Grid Environment. It is essential to utilize the processors efficiently and minimize the schedule length. In Grid Environment, tasks are dependent on each other. We use Directed Acyclic Graph (DAG) to solve task scheduling problems. In this paper, we have proposed a new scheduling algorithm called M-Level Sufferage-based Scheduling Algorithm (MSSA) for minimizi...

1998
D. Agrawal A. El Abbadi

We explore the use of di erent variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a twophase commitment protocol for ensurin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید