نتایج جستجو برای: leader

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

M. Gorji Ashtiani , , R. Ramezanian, ,

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...

Journal: :Parasitology today 2000
D A Campbell N R Sturm M C Yu

In recent years, much has been learned about the cis-elements controlling transcription of the kinetoplastid spliced leader (SL) RNA gene. The SL RNA gene contains the first 39 nucleotides that are trans-spliced on to all nuclear-derived mRNAs in these organisms. Transcription initiation is determined by two precisely spaced upstream elements and transcription termination is directed by the dow...

1993
Chungki Lee Mostafa H. Ammar James E. Burns

This paper presents two randomized protocols for the problem of electing a \leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. BGI87] is presented, in which the termination problem is addressed. Then, an eecient randomized leader election protocol in arbitrary multi-hop radio networks is presented. Our el...

2016
Karine Altisen Ajoy Kumar Datta Stéphane Devismes Anaïs Durand Lawrence L. Larmore

We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings Kk with bounded multiplicity k ≥ 2. However, we show that process-terminating leader election is possible in the subclass U∗ ∩ Kk, where U ∗ is the class of rings which contain a pr...

1998
Alexander Russell David Zuckerman

In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Protocols proceed in rounds: though players are synchronized between rounds, within each round the...

Journal: :مدیریت فرهنگ سازمانی 0
محمد رمضانی کارشناس ارشد مدیریت دولتی، دانشگاه پیام نور، تهران، ایران طاهره فیضی دانشیار، دانشگاه پیام نور، تهران، ایران

present research studies the relationship between leader empowering behaviors and employee stress in qom agricultural jihad organization. to measure leader empowering behaviors, hoy’s (1994) leader empowering behaviors model and for measure employee distress, rondelof and blackburn questionnaire (1990) have been used. statistical sample consists of 70 employees of qom agricultural jihad organiz...

2008
Vadim A. KAIMANOVICH

We explain how one can construct a class of discrete hypergroups which are non-unimodular. They arise as double coset hypergroups induced by the transitive action of a non-unimodular group of permutations on an innnite set. A concrete example is given in terms of the aane group of a homogeneous tree.

2008
Hiroshi Kunitomo

The double-spinor formalism, proposed by Aisaka and Kazama, provides a basis for the pure-spinor formalism, which allows manifestly super-Poincaré covariant quantization of superstrings. We extend it to the case of backgrounds realized by coset superspaces. A general method constructing reparametrization invariant action is given by using two concrete examples, the flat space-time and AdS5 × S....

Journal: :Inf. Process. Lett. 1996
Sukumar Ghosh Arobinda Gupta

Self-stabilizing algorithms are designed to guarantee convergence to some desired stable state from arbitrary initial states arising out of an arbitrarily large number of faults. However, in a well-designed system, the simultaneous occurrence of a large number of faults is rare. It is therefore desirable to design algorithms that are not only self-stabilizing, but also have the ability to recov...

1997
Stefan Dobrev Peter Ruzicka

In this paper, we provide eecient broadcasting and election algorithms in unoriented hypercubes. First, O(N) broadcasting and traversing algorithms are introduced, where N is the number of hy-percube vertices. This answers aarmatively the open question stated in Tel95a] whether linear-message broadcasting and traversing can be achieved on hypercubes without sense of direction. Moreover, by expl...

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

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