نتایج جستجو برای: at each node

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

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده ادبیات، زبانهای خارجی و تاریخ 1389

recent years have witnessed an increased attention to form focused instruction and consciousness raising activities (ellis, 2002; doughty & williams, 1998) on the one hand and extensive and meaningful exposure to the target language (klapper & rees, 2003; day & bamford, 1998) on the other. due to significance attributed to above mentioned issues by scholars, this study attempted to bridge them ...

Journal: :journal of medical signals and sensors 0
masoud moslehi ahmad shanei seyyed mohammad reza hakimian milad baradaran-ghahfarokhi golshan mahmoudi

sentinel lymph node is the first regional lymph node that drains the lymph from the primary tumor. it is potentially the first nodeto receive the seeding of lymph‑borne metastatic cells. this study aimed to discuss lymphoscintigraphy procedural guidelines fordetection of sentinel node using tc‑phytate in isfahan, iran. moreover, the preliminary results of the first year’s clinical experience of...

Journal: :مهندسی برق و الکترونیک ایران 0
javad taheri mohammad kazem akbari

among structured peer-to-peer systems, chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. however, chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing latency an...

2003
Yu Du Ye Bao J. J. Garcia-Luna-Aceves

This paper presents the history-based scheduling (HBS) protocol for collision-free channel access in ad hoc networks. In HBS, the channel is scheduled based on the history of activity of each node in order to attain higher channel utilization than traditional distributed scheduling schemes based on node activation. Conflict-free access to the channel is determined at each node based on a priori...

2013
Peter Jeavons Alex Scott Lei Xu

We propose two distributed algorithms for well-established problems that both operate efficiently under extremely harsh conditions. Both algorithms achieve state-of-the-art performance in a novel way. Our algorithm for maximal independent set selection operates on a network of identical anonymous processors. The processor at each node has no prior information about the network. At each time ste...

Journal: :iranian journal of cancer prevention 0
ali taghizadeh-kermani a) assistant professor, cardiothoracic surgery and transplant research center, imam reza hospital, faculty of medicine, mashhad university of medical sciences, mashhad, iran. b) assistant professor, surgical oncology research center, imam reza hospital, faculty of medicine, mashhad university of medical sciences, mashhad, iran. seyede zeinab yahouiyan faculty of medicine, mashhad university of medical sciences, mashhad, iran mohsen aliakbarian surgical oncology research center, imam reza hospital, faculty of medicine, mashhad university of medical sciences, mashhad, iran. mehdi seilanian toussi cancer research center, omid hospital, faculty of medicine, mashhad university of medical sciences, mashhad, iran.

background: in this study we evaluated the prognostic impact of metastatic lymph node ratio (mlr) in patients with gastric cancer undergoing curative surgical resection. methods: a total of 121 patients with gastric adenocarcinoma undergoing curative r0 surgical resection in our institutions between 2003 and 2010 were included in this study.  mlr was classified into 3 groups as follows: mlr0; 0...

Journal: :European Journal of Operational Research 2003
Amir Azaron Farhad Kianfar

In this paper, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node in stochastic dynamic networks, in which the arc lengths are independent random variables with exponential distributions. In each node there is an environmental variable, which evolves in accordance with a continuous time Markov process. The parameter of the exponen...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1389

wireless sensor networks (wsns) are one of the most interesting consequences of innovations in different areas of technology including wireless and mobile communications, networking, and sensor design. these networks are considered as a class of wireless networks which are constructed by a set of sensors. a large number of applications have been proposed for wsns. besides having numerous applic...

Journal: :IEEE Transactions on Pattern Analysis and Machine Intelligence 2021

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

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