Distributing the workload of computationally intensive software components across a set of homogeneous computing resources (nodes, hosts, processors, cores), for the purpose of allowing them to meet precise timing (response-time) constraints, is often a pain due to the difficulties in understanding how the software will actually scale. Often, such a problem is faced by recurring to a trial-and-...

The jointly optimum noncoherent receiver is obtained for multiuser communications in a frequency non-selective Rayleigh fading channel with NT transmit antennas per user and NR receive antennas. Based on a general analysis of quadratic receivers in zero-mean complex Gaussian vectors, we derive asymptotically (for high SNR) tight expressions for the pair-wise error probabilities for some cases o...

The correct choice of time-step size is of crucial importance in the case of the (2, 4) finite-difference time-domain (FDTD) method, as it affects the algorithm’s overall accuracy and convergence rate. A description of the inherent discretisation error is introduced, which is exploited for the derivation of a simple, yet reliable, approximation of the optimum temporal sampling density. As the p...

In this paper, we present results on the application of reduced-rank adaptive filtering techniques to the problem of interference suppression in ultra-wideband (UWB) communications. It is shown that reduced-rank optimum combining (OC) methods, in particular the eigen-canceler (EC), are effective in suppressing interference modeled aas 802.11a signals. Simulation results are presented to show th...

— This paper considers optimum ordering policies minimizing the expected cost per unit time in the steady-state. It is assumed that a lead time for the spare is constant and order costs depend on time. It is shown in theorem that there exists afinite and unique optimum ordering policy under certain conditions.

We present a new time-stepping criterion for N -body simulations that is based on the true dynamical time of a particle. This allows us to follow the orbits of particles correctly in all environments since it has better adaptivity than previous time-stepping criteria used in N -body simulations. Furthermore, it requires far fewer force evaluations in low density regions of the simulation and ha...

In accordance with the increase of vehicles recently, traffic congestion has become a serious problem. In urban areas, almost all traffic congestion occurs at intersections. Intersections can be classified into three types according to the number of roads meeting at the intersection: T-junction (3-way intersection), Crossroads (4-way intersection), and Multi-way intersection (more than 4 ways)....

LetN be a point placed directed graph andG be a sub-graph of N . We study the point placement problem of optimally re-placing the nodes in G assuming that the remaining nodes in N are fixed. The goal is to minimize the total “wiring” cost i.e. the cost of the internal nets of G plus the external nets connecting G to other other nodes of N . The cost of a net is the semi-perimeter of the smalles...

The orthogonal array design has been used to determine the optimum conditions for gold recovery from Zarshuran refractory gold sulfide ore (Iran) by direct cyanidation and roasting-cyanidation. The Taguchi method was used as the experimental design to determine the optimum conditions of dissolution behavior of gold with cyanidation and roasting-cyanidation from Zarshuran refractory gold ore . T...