This paper analyses the weighted fair queueing (W F Q) system subject to two classes of network applications. The ar rival traffic flows follow Poisson processes.The service times is exponentially distr ibuted. The system is modelled as a two-dimensional M arkov chain and use matrix geomet r ic technique to solve its stationary probabilities. The determination of the steady state probabilities ...

Characterizing the complicated flow behaviors arising from high water cut and low velocity oil-water flows is an important problem of significant challenge. We design a high-speed cycle motivation conductance sensor and carry out experiments for measuring the local flow information from different oil-in-water flow patterns. We first use multivariate time-frequency analysis to probe the typical ...

in this research the effect of two different methods of carcass chilling (immersion and evaporative) in the poultry industrial slaughter line on microbial load and carcass weight changes was studied. for sampling, after evisceration, each carcass weighted and rinsed with 250 ml of sterile water in a plastic bag. 25 ml of rinses water was taken and into sterile scaled container sent to laborator...

Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of r...

BACKGROUND AND PURPOSE Diffusion-weighted magnetic resonance imaging has been shown to be particularly suited to the study of the acute phase of cerebral ischemia in animal models. The studies reported in this paper were undertaken to determine whether this technique is sensitive to the known ischemic thresholds for cerebral tissue energy failure and disturbance of membrane ion gradients. MET...

Given a set of operations specified by their execution time intervals {[ai,zi)|i=1, ..., n}, where ai<zi, a processor-optimal allocation (POA) problem is to allocate the minimum number of processors to execute these operations, where any two operations [aj,zj) and [ak,zk) executed by a processor have the property of either zj≤ak or zk≤aj. A weighted version of the POA problem is to find a proce...

Purpose – In order to achieve excellence in manufacturing, goals like lean, economic and quality production with enhanced productivity play a crucial role in this competitive environment. It also necessitates major improvements in generally three primary technical areas: variation reduction, equipment reliability, and production scheduling. Complexity of the real world scheduling problems also ...

We consider preemptive online scheduling algorithms to minimize the total weighted/unweighted flow time plus energy for speed-scalable heterogeneous multiprocessors. We show that the well-known priority scheduling algorithms Highest Density First, Weighted Shortest Elapsed Time First, and Weighted Late Arrival Processor Sharing, are not O(1)-speed O(1)-competitive for the objective of weighted ...

We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the `p norms of weighted flow time onm identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.

BACKGROUND AND PURPOSE Admission infarct core lesion size is an important determinant of management and outcome in acute (<9 hours) stroke. Our purposes were to: (1) determine the optimal CT perfusion parameter to define infarct core using various postprocessing platforms; and (2) establish the degree of variability in threshold values between these different platforms. METHODS We evaluated 4...