نتایج جستجو برای: jackson network

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

2012
George A. Anastassiou

This article deals with the determination of the fractional rate of convergence to the unit of some neural network operators, namely, the CardaliaguetEuvrard and ”squashing” operators. This is given through the moduli of continuity of the involved right and left Caputo fractional derivatives of the approximated function and they appear in the right-hand side of the associated Jackson type inequ...

Journal: :Social Networks 2006
Patrick Doreian

Considerable attention has been devoted to the evolution of social networks through time. Some has been descriptive, some has sought fundamental principles for studying network evolution and some has been analytical. The work described in this paper represents all three approaches and is cast within the framework of rational choice theory. One foundation is found in the work of Jackson and Woli...

2017
Clarence Cook Little William Singler Murray Leonell Clarence Strong

The Roscoe B. Jackson Laboratory, known commonly in the scientific field as the Jackson Laboratory, was founded by Clarence Cook Little [5] in May 1929. The lab has been pivotal in research with in vitro [6] fertilization [7], teratomas, gene replacement therapy for birth defects [8] , and more because its researchers have focused from the beginning on developing the mouse [9] as a model organi...

Journal: :Brain : a journal of neurology 2015
George K York

‘Two hunters are out in the woods when one of them collapses. He doesn’t seem to be breathing and his eyes are glazed. The other hunter whips out his phone and calls the emergency services. He gasps, “My friend is dead! What can I do?” The operator says “Calm down. I can help. First, let’s make sure he’s dead.” There is a silence, then a gun shot is heard. Back on the phone, the guy says “OK, n...

Journal: :Journal of Approximation Theory 2008
Feng Dai Zeev Ditzian S. Tikhonov

For trigonometric polynomials on [− , ] ≡ T , the classical Jackson inequalityEn(f )p C r (f, 1/n)p was sharpened by M. Timan for 1<p<∞ to yield n−r { n ∑ k=1 ksr−1Ek(f )p }1/s C r (f, n−1)p where s =max(p, 2). In this paper a general result on the relations between systems or sequences of best approximation and appropriate measures of smoothness is given. Approximation by algebraic polynomials...

Journal: :Clinical infectious diseases : an official publication of the Infectious Diseases Society of America 2015
Karen C Bloch Ari Bitnun Carol A Glaser Alexandra Mailles Jean-Paul Stahl Allan R Tunkel Arun Venkatesan

TO THE EDITOR—We appreciate Dr Jackson’s thoughtful comments regarding the diagnostic criteria for encephalitis proposed by the International Encephalitis Consortium (IEC) Working Group [1]. He raises concerns that (1) individual patients may have laboratory or pathologic evidence of encephalitis without meeting the clinical criteria specified in the IEC case definition, and (2) that patients w...

Journal: :Physical review letters 2014
B Lepetit B Jackson

Journal: :Math. Meth. of OR 2005
Arnon Arazi Eshel Ben-Jacob Uri Yechiali

We consider a Jackson-type network comprised of 2 queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a custome...

2005

We consider a Jackson network in which some of the nodes have an infinite supply of work: when all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience a traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability,...

2005
GIDEON WEISS

We consider a Jackson network in which some of the nodes have an infinite supply of work: When all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability, a...

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

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