For simplicity, we adopt the following convention: n is a natural number, p, q, u, w are points of En T, S is a subset of En T, A, B are convex subsets of En T, and r is a real number. Next we state several propositions: (1) (1− r) · p+ r · q = p+ r · (q − p). (2) If u, w ∈ halfline(p, q) and |u− p| = |w − p|, then u = w. (3) Let given S. Suppose p ∈ S and p 6= q and S ∩ halfline(p, q) is Bound...

s e l e c t i o n o f a p p r o p r i a t e g r o u n d m o t i o n i s a k e y e l e m e n t w i t h i n a n y s e i s m i c a s s e s s m e n t o f s t r u c t u r e s. m a n y m e t h o d o l o g i e s h a v e b e e n d e v e l o p e d i n o r d e r t o s e l e c t a n d s c a l e g r o u n d m o t i o n r e c o r d s f o r t h e p u r p o s e o f r e s p o n s e h i s t o r y a n a l y s i ...

Characterizing the communication behavior of larges cale ap p lications is a d iffi cult and cos tly tas k d ue to cod e/s y s tem comp lex ity and their long ex ecution times . A n alternative to running actual cod es is to gather their communication traces and then rep lay them, w hich facilitates ap p lication tuning and future p rocurements . W hile p as t ap p roaches lack ed los s les s s...

The design of efficient algorithms for planar graphs, as a field of research, is over forty year old and continues to be an exciting area. There are several new efficient algorithms for a variety of graph optimization problems that exploit planarity and, in general, the structure of low genus graphs and graphs with excluded minors. Efficient space-bounded computations, on the other hand, involv...

Let ' 2 C1([0, 1]N ,R). When 0 < s < 1, p 1 and 1  sp < N , the W s,p-semi-norm |'|W s,p of ' is not controlled by |g|W s,p , where g := eı' [3]. [This question is related to existence, for S1-valued maps g, of a lifting ' as smooth as allowed by g.] In [4], the authors suggested that |g|W s,p does control a weaker quantity, namely |'|W s,p+W 1,sp . Existence of such control is due to J. Bourg...

In this note, we generalize two retarded Ouyang integral inequalities. One of these inequalities says: under suitable assumptions of functions w,α, h, f, g and p on [0,∞), if w(t) ≤ h(t) + 2 ∫ α(t) 0 { f(s)w(s) [ w(s) + ∫ s 0 g(r)w(r)dr ] + p(s)w(s) } ds, then w(t) ≤ [ h(t) + ∫ α(t) 0 p(s)ds ] exp {∫ α(t) 0 [ f(s) + (∫ s 0 g(r)dr ) ds ]} , t ≥ 0. AMS Subject Classifications: 26D15.

Video streaming is becoming increasingly popular among the wireless users. However, supporting video streaming over the wireless networks is not an easy task due to the dynamic radio propagation environment, limited radio resources as well as Quality of Service (QoS) requirements of the video streaming that need to be satisfied at acceptable levels. Most studies proposed to support video stream...