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.

A new cyano-bridged one-dimensional (GdFeIII)-Fe-III coordination polymer with o-phenanthroline as the blocking ligand: synthesis, structure, and magnetic properties

Synthesis, structural characterization, and magnetic properties of a new cyano-bridged one-dimensional iron (III)-gadolinium (III) compound, trans-[Gd(o-phen)(2)(H2O)(2)(mu-CN)(2)Fe(CN)(4)], - 2no-phen (o-phen = 1,10-phenanthroline), have been described. The compound crystallizes in the triclinic P (1) over bar space group with the following unit cell parameters: a = 10.538(14) angstrom, b = 12.004(14) angstrom, c = 20.61(2) angstrom, alpha = 92.41(1)degrees, beta = 92.76(1)degrees, gamma = 11 2.72(1)degrees, and Z = 2. In this complex, each gadolinium (III) is coordinated to two nitrile nitrogens of the CN groups coming from two different ferricyanides, the mutually trans cyanides of each of which links another different Gd-III to create -NC-Fe(CN)(4)-CN-Gd-NC- type 1-D chain structure. The one-dimensional chains are self-assembled in two-dimensions via weak C-H center dot center dot center dot N hydrogen bonds. Both the variable-temperature (2-300 K, 0.01 T and 0.8 T) and variable-field (0-50 000 Gauss, 2 K) magnetic measurements reveal the existence of very weak interaction in this molecule. The temperature dependence of the susceptibilities has been analyzed using a model for a chain of alternating classic (7/2) and quantum (1/2) spins. (c) 2005 Elsevier B.V. All rights reserved.

Modulation of the fecal microflora profile and immune function by a novel trans-galactooligosaccharide mixture (B-GOS) in healthy elderly volunteers

Background: Aging is associated with reduced numbers of beneficial colonic bifidobacteria and impaired immunity. Galactooligosaccharides (GOSs) stimulate the growth of bifidobacteria in younger adults, but little is known about their effects in the elderly and their immunomodulatory capacity. Objective: We assessed the effect of a prebiotic GOS mixture (B-GOS) on immune function and fecal microflora composition in healthy elderly subjects. Design: In a double-blind, placebo-controlled, crossover study, 44 elderly subjects were randomly assigned to receive either a placebo or the B-GOS treatment (5.5 g/d). Subjects consumed the treatments for 10 wk, and then went through a 4-wk washout period, before switching to the other treatment for the final 10 wk. Blood and fecal samples were collected at the beginning, middle (5 wk), and end of the test period. Predominant bacterial groups were quantified, and phagocytosis, natural killer (NK) cell activity, cytokine production, plasma cholesterol, and HDL cholesterol were measured. Results: B-GOS significantly increased the numbers of beneficial bacteria, especially bifidobacteria, at the expense of less beneficial groups compared with the baseline and placebo. Significant increases in phagocytosis, NK cell activity, and the production of antiinflammatory cytokine interleukin-10 (IL-10) and significant reduction in the production of proinflammatory cytokines (IL-6, IL-1 beta , and tumor necrosis factor-alpha) were also observed. B-GOS exerted no effects on total cholesterol or HDL-cholesterol production, however. Conclusions: B-GOS administration to healthy elderly persons resulted in positive effects on both the microflora composition and the immune response. Therefore, B-GOS may be a useful dietary candidate for the enhancement of gastrointestinal health and immune function in elderly persons. Am J Clin Nutr 2008; 88: 1438-46.

Parallel and distributed computing with Java

The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based.simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications.

Semantic organization to enhance active learning based on distributed multimedia educational resources

In order to organize distributed educational resources efficiently, to provide active learners an integrated, extendible and cohesive interface to share the dynamically growing multimedia learning materials on the Internet, this paper proposes a generic resource organization model with semantic structures to improve expressiveness, scalability and cohesiveness. We developed an active learning system with semantic support for learners to access and navigate through efficient and flexible manner. We learning resources in an efficient and flexible manner. We provide facilities for instructors to manipulate the structured educational resources via a convenient visual interface. We also developed a resource discovering and gathering engine based on complex semantic associations for several specific topics.

Performance of GPRS coding scheme detection under severe multipath and co-channel interference as a function of soft-bit width

The General Packet Radio Service (GPRS) has been developed for the mobile radio environment to allow the migration from the traditional circuit switched connection to a more efficient packet based communication link particularly for data transfer. GPRS requires the addition of not only the GPRS software protocol stack, but also more baseband functionality for the mobile as new coding schemes have be en defined, uplink status flag detection, multislot operation and dynamic coding scheme detect. This paper concentrates on evaluating the performance of the GPRS coding scheme detection methods in the presence of a multipath fading channel with a single co-channel interferer as a function of various soft-bit data widths. It has been found that compressing the soft-bit data widths from the output of the equalizer to save memory can influence the likelihood decision of the coding scheme detect function and hence contribute to the overall performance loss of the system. Coding scheme detection errors can therefore force the channel decoder to either select the incorrect decoding scheme or have no clear decision which coding scheme to use resulting in the decoded radio block failing the block check sequence and contribute to the block error rate. For correct performance simulation, the performance of the full coding scheme detection must be taken into account.

A flexible monitoring and notification system for distributed resources

Resource monitoring in distributed systems is required to understand the 'health' of the overall system and to help identify particular problems, such as dysfunctional hardware, a faulty, system or application software. Desirable characteristics for monitoring systems are the ability to connect to any number of different types of monitoring agents and to provide different views of the system, based on a client's particular preferences. This paper outlines and discusses the ongoing activities within the GridRM wide-area resource-monitoring project.

Using a RESTful messaging and registry system to support a range a distributed applications

Tycho was conceived in 2003 in response to a need by the GridRM [1] resource-monitoring project for a ldquolight-weightrdquo, scalable and easy to use wide-area distributed registry and messaging system. Since Tycho's first release in 2006 a number of modifications have been made to the system to make it easier to use and more flexible. Since its inception, Tycho has been utilised across a number of application domains including widearea resource monitoring, distributed queries across archival databases, providing services for the nodes of a Cray supercomputer, and as a system for transferring multi-terabyte scientific datasets across the Internet. This paper provides an overview of the initial Tycho system, describes a number of applications that utilise Tycho, discusses a number of new utilities, and how the Tycho infrastructure has evolved in response to experience of building applications with it.

Probability density function estimation using orthogonal forward regression

Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression technique is adopted to construct sparse kernel density estimates. The proposed algorithm incrementally minimises a leave-one-out test error score to select a sparse kernel model, and a local regularisation method is incorporated into the density construction process to further enforce sparsity. The kernel weights are finally updated using the multiplicative nonnegative quadratic programming algorithm, which has the ability to reduce the model size further. Except for the kernel width, the proposed algorithm has no other parameters that need tuning, and the user is not required to specify any additional criterion to terminate the density construction procedure. Two examples are used to demonstrate the ability of this regression-based approach to effectively construct a sparse kernel density estimate with comparable accuracy to that of the full-sample optimised Parzen window density estimate.