In this paper, the modified weighted g-fair (MWGF) scheduling scheme with rise over thermal (RoT) filling is proposed for QoS guaranteed services in DS-CDMA uplink networks, in which RoT is directly related to the loading factor of a wireless network. The proposed scheme computes priorities of QoS guaranteed traffic for each slot based upon the weighted values of the QoS factor, channel factor,...

Two distinct redistribution grids - adaptation techniques, spring analogy and elliptic grid generator are applied to two-dimensional steady, inviscid, shocked flows, and the ability of each technique is examined and compared. Euler equations are solved base on Roe's Reimann solver approach to simulate supersonic flow around a sphere, transonic flow about an airfoil and supersonic flow in a symm...

Currently, ultra-rapid orbits play an important role in the high-speed development of global navigation satellite system (GNSS) real-time applications. This contribution focuses on the impact of the fitting arc length of observed orbits and solar radiation pressure (SRP) on the orbit prediction performance for GPS, GLONASS, Galileo and BeiDou. One full year's precise ephemerides during 2015 wer...

Davis, R. and A. Prieditis, The expected length of a shortest path, Information Processing Letters 46 (1993) 135-141. We derive an exact summation formula and a closed-form approximation for the expected length of a shortest path for a complete graph where the arc lengths are independent and exponentially distributed random variables. Experimental data validates both results. The property of co...

An arc in a tournament T with n ≥ 3 vertices is called k-pancyclic, if it belongs to a cycle of length l for all k ≤ l ≤ n. In this paper, the result that each s-strong (s ≥ 3) tournament T contains at least s + 2 out-arc 5-pancyclic vertices is obtained. Furthermore, our proof yields a polynomial algorithm to find s + 2 out-arc 5-pancyclic vertices of T .

This paper derives expressions for the arc length and the bending energy of quadratic Bézier curves. The formulae are in terms of the control point coordinates. For fixed start and end points of the Bézier curve, the locus of the middle control point is analyzed for curves of fixed arc length or bending energy. In the case of arc length this locus is convex. For bending energy it is not. Given ...

Wimer, S., I. Koren and I. Cederbaum, On paths with the shortest average arc length in weighted graphs, Discrete Applied Mathematics 45 (1993) 169-179. The problem of finding the path having the smallest average arc length in an acyclic digraph with a single source and a single sink is considered in this paper. This problem arises in VLSI block placement procedures when spreading the building b...

This paper derives expressions for the arc length and the bending energy of quadratic Bézier curves. The formulae are in terms of the control point coordinates. For fixed start and end points of the Bézier curve, the locus of the middle control point is analyzed for curves of fixed arc length or bending energy. In the case of arc length this locus is convex. For bending energy it is not. Given ...

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph G is defined to have vertices the arcs of G such that two arcs uv, xy are adjacent if and only if (v, u, x, y) is a 3-arc of G. In this paper we study the independence, domination and chromatic numbers of 3-arc graphs ...

We present the results of a search for gravitationally-lensed giant arcs conducted on a sample of 825 SDSS galaxy clusters. Both a visual inspection of the images and an automated search were performed and no arcs were found. This result is used to set an upper limit on the arc probability per cluster. We present selection functions for our survey, in the form of arc detection efficiency curves...