We consider a certain class of vectorial evolution equations, which are linear in the (max,+) semi-eld. They can be used to model several types of discrete event systems, in particular stochastic service systems where we assume that the arrival process of customers (tokens, jobs, etc.) is Poisson. Under natural Cramer type conditions on certain variables, we show that the expected waiting time ...

background: b re a st con s er v i n g surg e ry ( b c s ) f o l l owed b y loc a l rad i ot h e ra p y is the standard t r eatment for e a rly sta g e of breast cancer. margin stat u s may have an important impact on local recurren c e and over a ll s u rvival of patients treated with bcs, but this h a s not b een defined adequately. in this study, we in ve stigated the rela t io n ship betwee...

• (z)r and (z)i denote the real and imaginary part of z. II. CONSTRAINED CRAMER-RAO BOUND A. Problem Statement Problem statement and notation are based on [1]. • a: a K × 1 non-random vector which are to be estimated. • r: an observation of a random vector . • â (R): an estimate of a basing on the observed vector r . It is required that â (R) satisfies M nonlinear equality constraints (M < K), ...

This paper presents a consistent theory for describing indeterminacy and uncertainty of 3-D reconstruction from a sequence of images. First, we present a group-theoretical analysis of gauge transformations and gauges by invoking the Lie group theory. We then discuss how to evaluate the reliability of the solution that has indeterminacy. We also extend the Cramer-Rao lower bound to problems with...

w

In this paper, we consider the online matching problem with two heterogeneous sensors s1 and s2 in a metric space (X,d). If request r is assigned to sensor s1, service cost of distance d(r,s1). Otherwise, s2, d(r,s2)w, where w≥1 weight s2. The goal minimize maximum cost, design an optimal algorithm competitive ratio 1+w+1w for 1≤w≤1.839, w+1+w2+6w+12 w&gt;1.839.

i n m a n u f a c t u r i n g a c t i v i t i e s, i s s u e s s u c h a s t h e i n t e n s i t y o f c o m p e t i t i o n, r i s i n g a n d c h a n g i n g c u s t o m e r e x p e c t a t i o n s, a n d e v e r-i n c r e a s i n g t e c h n o l o g i c a l d e v e l o p m e n t s, i n t e n s i f y m a n u f a c t u r e r c o m m i t m e n t t o e l i m i n a t e d e f e c t s i n i t s p r...

This paper is concerned with the problem of finding a lower bound for certain matrix operators such as Hausdorff and Hilbert matrices on sequence spaces lp(w) and Lorentz sequence spaces d(w,p), which is recently considered in [7,8], similar to [13] considered by J. Pecaric, I. Peric and R. Roki. Also, this study is an extension of some works which are studied before in [1,2,7,8].

! "! $#% & %'("! ) "!"* + ),' + "$ "!) .+ "! / "! & %' 0 "( 1 + 2"! !354&/ "( ! 6' "! 7"2869 "! )/ "! ": ! 1 + ; 6<= . <="->@? ? ACB D E F ?7? A G D H2IJ>CK L M 35NO 9 "2) .+ 1 5 "!' * + ; P " Q */ . . "! ) "! ; , % 1 . . "!.% 1 */ $ "! 29 "! R %'S / "! $ R ! +. "2 ; T "2 ; U .+. "!. VW 1 + YX . W . $ Z % ) "! "! WX '[ ! \ W ] +V! ^3 _ .$ / "W ' "W'` / $ "! 2 "! a bU"2 ] /c P ] @ d. W . e */ VW...