We model and analyze the distributed task allocation problem, which is solved by ant colonies on a daily basis. Ant colonies employ task allocation in which ants are moved from one task to the other in order to meet changing demands introduced by the environment, such as excess or shortage of food, dirtier or cleaner nest, etc. The different tasks are: nursing (overseeing the hatching of newbie...

In cognitive radio networks (CRNs), secondary users (SUs) may employ network coding to pursue higher throughput. However, as SUs must vacate the spectrum when it is accessed by primary users (PUs), the available transmission time of SUs is usually uncertain, i.e., SUs do not know how long the idle state can last. Meanwhile, existing network coding strategies generally adopt a block-based transm...

ABSTRACT IEEE 802.16 WiMAX is a promising technology to provide broadband wireless networking access. IEEE 802.16j Mobile Multihop Relay standard introduces multihop relaying to WiMAX system. Relay stations are used to extended network coverage and enhance system throughput. To reduce power consumption, an idle mode MS does not send location update messages while moving across cell borders. Pag...

SIDE EFFECTS: Nervousness, fine tremor of the skeletal muscle (particularly hands), peripheral vasodilatation, pa radox i ca l b ronchospasm, hypoka laem ia , hyperglycaemia, Cardiac Arrhythmias (including Supraventricular tachycardia, atrial fibrilliation, Extrasystoles). Salbutamol, like other sympathomimetic agents, can cause adverse effects such as drowsiness, flushing, restlessness, irrita...

Denote by C the elliptic curve y = x(x − 1)(x− s) over the function field Q(s). It degenerates only over the points s = 0, 1,∞ of P and so defines a fiber bundle over C \ {0, 1} with fibers being elliptic curves. Let Fs denote the fiber over the point s. The maps ι : (x, y, s) 7→ (1 − x, iy, 1 − s) and τ : (x, y, s) 7→ (x̄, ȳ, s̄) are topological automorphisms of C. Note ι = −1, τ = 1. The fundam...

The goal of this article is to examine the effectiveness of “forloop” and “while-loop” statements on SCMPDS by insert sort. In this article, first of all, we present an approach to compute the execution result of “for-loop” program by “loop-invariant”, based on Hoare’s axioms for program verification. Secondly, we extend the fundamental properties of the finite sequence and complex instructions...

Despite a low occurrence rate, silent data corruption represents a growing concern for storage systems designers. Throughout the storage hierarchy, from the file system down to the disk drives, various solutions exist to avoid, detect, and correct silent data corruption. Undetected errors during the completion of WRITEs may cause silent data corruption. A portion of the WRITE errors may be dete...

We deviate from the Berman et al. models in inventory with positive service time. We establish a necessary and sufficient condition for system stability. Several performance measures are computed. An optimisation problem is discussed. Our analysis suggests that it is optimal to place the replenishment order when the inventory level is positive (even in the zero lead time case). Numerical illust...

Chocs and-calculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more eeective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion ofàctivation' channel which we christen...