نتایج جستجو برای: node flow analysis

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

Journal: :journal of dental school, shahid beheshti university of medical sciences 0
hassan mirmohammad sadeghi , dept. of oral & maxillofacial surgery, dental school, shahid beheshti university of medical sciences, tehran, iran alireza pournabi dept. of oral and maxillofacial surgery, dental school, shahid beheshti university of medical sciences, tehran, iran. mahshid namdari dept. of community of oral health, dental school, shahid beheshti university of medical sciences, tehran, iran

objectives: presence/absence of cervical lymph node metastasis plays a critical role in prognosis and survival of patients with oral squamous cell carcinoma (scc). this study was designed to assess the diagnostic accuracy of computed tomography (ct) scan for detection of cervical lymph node metastasis in oral scc in comparison with histopathological analysis after neck dissection methods: in th...

Journal: :RFC 1996
Peter Newman W. L. Edwards Robert M. Hinden Eric Hoffman FongChing Liaw Thomas L. Lyon Greg Minshall

Status of this Memo This document provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. IESG Note: This memo documents a private protocol for IPv4-based flows. This protocol is NOT the product of an IETF working group nor is it a standards track document. It has not necessarily benefited from the wid...

1997
Jorge Arturo Cobb Mohamed Waris

We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be used to route the allocation of new virtual circuits whose destination is the designated node. As virtual circuits are allocated and removed, the available capacity of the channels in the network changes, causing the ...

Journal: :J. Algorithms 1994
Jianxiu Hao James B. Orlin

We consider the problem of finding the minimum capacity cut in a directed network G with n nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum cut separating a designated source node s from a designated sink node t, and by varying the sink node one...

2001
Ludmila Cherkasova Robin Hodgson Vadim. Kotov Ian Robinson Tomas Rokicki

The three flow-control techniques introduced in this paper are backpressure flow control, alpha scheduling, and balanced injection. Our variations on backpressure flow control essures that all the buffers in a node are not filled with one particular category of packet, such as those destined for the same node, so that buffers are available for other packets. Alpha scheduling exploits the distin...

Journal: :Ground water 2005
Tom Clemo

The standard formulation of a block-centered finite-difference model, such as MODFLOW, uses the center of the cell as the location of a cell node. Simulations of a dynamic water table can be improved if the node of a cell containing the water table is located at the water table rather than at the center of the cell. The LPF package of MOD-FLOW-2000 was changed to position a cell's node at the w...

2003
Chisa Takano Masaki Aida

This paper focuses on flow control in high-speed networks. Each node in a network handles its local traffic flow only on the basis of the information it is aware of, but it is preferable that the decision-making of each node leads to high performance of the whole network. To this end, we investigate the relationship between the flow control mechanism of each node and network performance. We con...

Journal: :Softw., Pract. Exper. 1994
T. H. Tse Tsong Yueh Chen F. T. Chan Huo Yan Chen H. L. Xie

form suitable for the transform centre. An efferent stream, on the other hand, is a string of processes which convert output data from the transform centre into a more physical form suitable for output to the real world. We can know for sure that some nodes must belong to the transform centre. They satisfy either of the following conditions: (a) The node name contains a verb such as subtract wh...

2008
Vincent Conitzer

1 Maximum flow In the maximum flow problem, we are given a directed graph with a distinguished source node and a distinguished sink node. In addition, each edge has a capacity, which is the largest amount of flow that can go over this edge. Our goal is to route as much flow from the source to the sink as we can, along the edges of the graph. For example, consider the directed graph with capacit...

Hoseinkhalehjir Seyedgholamreza, Khoori Vahid, Naseri Mohsen, Nayebpour Mohsen, Salehi Aref,

Introduction: Ouabaine is a well-known atrioventricular (AV) node depressant agent, but its effects on functional properties of the AV node have not been cleared. The aim of the present study was to determine how ouabaine administration modifies the rate-dependent properties of the AV node. Methods: Selective stimulation protocols were used to quantify independently electrophysiological prop...

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

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