An asynchronous distributed dynamic channel assignment scheme for dense WLANs

Wireless local area networks (WLANs) have changed the way many of us communicate, work, play and live. Due to its popularity, dense deployments are becoming a norm in many cities around the world. However, increased interference and traffic demands can severely limit the aggregate throughput achievable if an effective channel assignment scheme is not used. In this paper, we propose an enhanced asynchronous distributed and dynamic channel assignment scheme that is simple to implement, does not require any knowledge of the throughput function, allows asynchronous channel switching by each access point (AP) and is superior in performance. Simulation results show that our proposed scheme converges much faster than previously reported synchronous schemes, with a reduction in convergence time and channel switches by tip to 73.8% and 30.0% respectively.

An improved distributed dynamic channel assignment scheme for dense WLANs

The popularity of wireless local area networks (WLANs) has resulted in their dense deployment in many cities around the world. The increased interference among different WLANs severely degrades the throughput achievable. This problem has been further exacerbated by the limited number of frequency channels available. An improved distributed and dynamic channel assignment scheme that is simple to implement and does not depend on the knowledge of the throughput function is proposed in this work. It also allows each access point (AP) to asynchronously switch to the new best channel. Simulation results show that our proposed scheme converges much faster than similar previously reported work, with a reduction in convergence time and channel switches as much as 77.3% and 52.3% respectively. When it is employed in dynamic environments, the throughput improves by up to 12.7%.

Global exponential periodicity of a class of neural networks with recent-history distributed delays

In this paper, we propose to study a class of neural networks with recent-history distributed delays. A sufficient condition is derived for the global exponential periodicity of the proposed neural networks, which has the advantage that it assumes neither the differentiability nor monotonicity of the activation function of each neuron nor the symmetry of the feedback matrix or delayed feedback matrix. Our criterion is shown to be valid by applying it to an illustrative system. (c) 2005 Elsevier Ltd. All rights reserved.

Near-optimum detection for distributed space-time block coding under imperfect synchronization

Significant performance gain can potentially be achieved by employing distributed space-time block coding (D-STBC) in ad hoc or mesh networks. So far, however, most research on D-STBC has assumed that cooperative relay nodes are perfectly synchronized. Considering the difficulty in meeting such an assumption in many practical systems, this paper proposes a simple and near-optimum detection scheme for the case of two relay nodes, which proves to be able to handle far greater timing misalignment than the conventional STBC detector.

Distributed access control and privacy for the internet of me

This article presents an experimental scalable message driven IoT and its security architecture based on Decentralized Information Flow Control. The system uses a gateway that exports SoA (REST) interfaces to the internet simplifying external applications whereas uses DIFC and asynchronous messaging within the home environment.

The use of computer-based learning tools for teaching and clinical purposes: Interactive computing strategy for Iraq

Medical universities and teaching hospitals in Iraq are facing a lack of professional staff due to the ongoing violence that forces them to flee the country. The professionals are now distributed outside the country which reduces the chances for the staff and students to be physically in one place to continue the teaching and limits the efficiency of the consultations in hospitals. A survey was done among students and professional staff in Iraq to find the problems in the learning and clinical systems and how Information and Communication Technology could improve it. The survey has shown that 86% of the participants use the Internet as a learning resource and 25% for clinical purposes while less than 11% of them uses it for collaboration between different institutions. A web-based collaborative tool is proposed to improve the teaching and clinical system. The tool helps the users to collaborate remotely to increase the quality of the learning system as well as it can be used for remote medical consultation in hospitals.

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

A customizable multi-agent system for distributed data mining

We present a general Multi-Agent System framework for distributed data mining based on a Peer-to-Peer model. Agent protocols are implemented through message-based asynchronous communication. The framework adopts a dynamic load balancing policy that is particularly suitable for irregular search algorithms. A modular design allows a separation of the general-purpose system protocols and software components from the specific data mining algorithm. The experimental evaluation has been carried out on a parallel frequent subgraph mining algorithm, which has shown good scalability performances.

Scalability of efficient parallel K-Means

Clustering is defined as the grouping of similar items in a set, and is an important process within the field of data mining. As the amount of data for various applications continues to increase, in terms of its size and dimensionality, it is necessary to have efficient clustering methods. A popular clustering algorithm is K-Means, which adopts a greedy approach to produce a set of K-clusters with associated centres of mass, and uses a squared error distortion measure to determine convergence. Methods for improving the efficiency of K-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting a more efficient data structure, notably a multi-dimensional binary search tree (KD-Tree) to store either centroids or data points. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient K-Means techniques in parallel computational environments. In this work, we provide a parallel formulation for the KD-Tree based K-Means algorithm and address its load balancing issues.

Synthesis of a systolic array genetic algorithm

The paper presents a design for a hardware genetic algorithm which uses a pipeline of systolic arrays. These arrays have been designed using systolic synthesis techniques which involve expressing the algorithm as a set of uniform recurrence relations. The final design divorces the fitness function evaluation from the hardware and can process chromosomes of different lengths, giving the design a generic quality. The paper demonstrates the design methodology by progressively re-writing a simple genetic algorithm, expressed in C code, into a form from which systolic structures can be deduced. This paper extends previous work by introducing a simplification to a previous systolic design for the genetic algorithm. The simplification results in the removal of 2N 2 + 4N cells and reduces the time complexity by 3N + 1 cycles.

A dual role for integrin-linked kinase in platelets: regulating integrin function and alpha-granule secretion

Integrin-linked kinase (ILK) has been implicated in the regulation of a range of fundamental biological processes such as cell survival, growth, differentiation, and adhesion. In platelets ILK associates with beta 1- and beta 3-containing integrins, which are of paramount importance for the function of platelets. Upon stimulation of platelets this association with the integrins is increased and ILK kinase activity is up-regulated, suggesting that ILK may be important for the coordination of platelet responses. In this study a conditional knockout mouse model was developed to examine the role of ILK in platelets. The ILK-deficient mice showed an increased bleeding time and volume, and despite normal ultrastructure the function of ILK-deficient platelets was decreased significantly. This included reduced aggregation, fibrinogen binding, and thrombus formation under arterial flow conditions. Furthermore, although early collagen stimulated signaling such as PLC gamma 2 phosphorylation and calcium mobilization were unaffected in ILK-deficient platelets, a selective defect in alpha-granule, but not dense-granule, secretion was observed. These results indicate that as well as involvement in the control of integrin affinity, ILK is required for alpha-granule secretion and therefore may play a central role in the regulation of platelet function. (Blood. 2008; 112: 4523-4531)

Enhancing and diminishing gene function in human embryonic stem cells

It is widely recognized that gain- and loss-of-function approaches are essential for understanding the functions of specific genes, and such approaches would be particularly valuable in studies involving human embryonic stem (hES) cells. We describe a simple and efficient approach using lipofection to transfect hES cells, which enabled us to generate hES cell lines expressing naturally fluorescent green or red proteins without affecting cell pluripotency. We used these cell lines to establish a means of diminishing gene function using small interfering (si)RNAs, which were effective at knocking down gene expression in hES cells. We then demonstrated that stable expression of siRNA could knock down the expression of endogenous genes. Application of these gain- and loss-of-function approaches should have widespread use, not only in revealing the developmental roles of specific human genes, but also for their utility in modulating differentiation.

Coordination and extraction studies of an unexplored bi-functional ligand, carbamoyl methyl pyrazole (CMPz) with uranium(VI), lanthanum(III) and cerium(III) nitrates

The bi-functional carbamoyl methyl pyrazole ligands, C5H7N2CH2CONBu2 (L-1), (C5H7N2CH2CONBu2)-Bu-i (L-2), C3H3N2CH2CONBu2 (L-3), (C3H3N2CH2CONBu2)-Bu-i (L-4) and C5H7N2CH2CON(C8H17)(2) (L-5) were synthesized and characterized by spectroscopic and elemental analysis methods. The selected coordination chemistry of L-1 to L-4 with [UO2(NO3)(2)center dot 6H(2)O], [La(NO3)(3)center dot 6H(2)O] and [Ce(NO3)(3)center dot 6H(2)O] has been evaluated. Structures for the compounds [UO2(NO3)(2) C5H7N2CH2CONBu2] (6) [UO2(NO3)(2) (C5H7N2CHCONBu2)-Bu-i] (7) and [Ce(NO3)(3){C(3)H(3)N(2)CH(2)CON(i)Bu2}(2)] (11) have been determined by single crystal X-ray diffraction methods. Preliminary extraction studies of the ligand L-5 with U(VI) and Pu(IV) in tracer level showed an appreciable extraction for U(VI) and Pu(TV) up to 10 M HNO3 but not for Am(III). Thermal studies of the compounds 6 and 7 in air revealed that the ligands can be destroyed completely on incineration. (c) 2007 Elsevier Ltd. All rights reserved.