Distributed Estimation Over an Adaptive Incremental Network Based on the Affine Projection Algorithm

We study the problem of distributed estimation based on the affine projection algorithm (APA), which is developed from Newton`s method for minimizing a cost function. The proposed solution is formulated to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The analysis of transient and steady-state performances at each individual node within the network is developed by using a weighted spatial-temporal energy conservation relation and confirmed by computer simulations. The simulation results also verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance with lower computational and memory cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, as compared to a distributed recursive-least-squares (RLS) based method.

Applying semantics to grid middleware

Scheduling parallel and distributed applications efficiently onto grid environments is a difficult task and a great variety of scheduling heuristics has been developed aiming to address this issue. A successful grid resource allocation depends, among other things, on the quality of the available information about software artifacts and grid resources. In this article, we propose a semantic approach to integrate selection of equivalent resources and selection of equivalent software artifacts to improve the scheduling of resources suitable for a given set of application execution requirements. We also describe a prototype implementation of our approach based on the Integrade grid middleware and experimental results that illustrate its benefits. Copyright (C) 2009 John Wiley & Sons, Ltd.

Distributed power control algorithm for multiple access systems based on Verhulst model

In this paper the continuous Verhulst dynamic model is used to synthesize a new distributed power control algorithm (DPCA) for use in direct sequence code division multiple access (DS-CDMA) systems. The Verhulst model was initially designed to describe the population growth of biological species under food and physical space restrictions. The discretization of the corresponding differential equation is accomplished via the Euler numeric integration (ENI) method. Analytical convergence conditions for the proposed DPCA are also established. Several properties of the proposed recursive algorithm, such as Euclidean distance from optimum vector after convergence, convergence speed, normalized mean squared error (NSE), average power consumption per user, performance under dynamics channels, and implementation complexity aspects, are analyzed through simulations. The simulation results are compared with two other DPCAs: the classic algorithm derived by Foschini and Miljanic and the sigmoidal of Uykan and Koivo. Under estimated errors conditions, the proposed DPCA exhibits smaller discrepancy from the optimum power vector solution and better convergence (under fixed and adaptive convergence factor) than the classic and sigmoidal DPCAs. (C) 2010 Elsevier GmbH. All rights reserved.

Reachability of the synchronous state in a mutually connected PLL network

Second-order phase locked loops (PLLs) are devices that are able to provide synchronization between the nodes in a network even under severe quality restrictions in the signal propagation. Consequently, they are widely used in telecommunication and control. Conventional master-slave (M-S) clock-distribution systems are being, replaced by mutually connected (MC) ones due to their good potential to be used in new types of application such as wireless sensor networks, distributed computation and communication systems. Here, by using an analytical reasoning, a nonlinear algebraic system of equations is proposed to establish the existence conditions for the synchronous state in an MC PLL network. Numerical experiments confirm the analytical results and provide ideas about how the network parameters affect the reachability of the synchronous state. The phase-difference oscillation amplitudes are related to the node parameters helping to design PLL neural networks. Furthermore, estimation of the acquisition time depending on the node parameters allows the performance evaluation of time distribution systems and neural networks based on phase-locked techniques. (c) 2008 Elsevier GmbH. All rights reserved.

Vector within-host feeding preference mediates transmission of a heterogeneously distributed pathogen

2. We documented the within-host distribution of two vector species that differ in transmission efficiency, the leafhoppers Draeculacephala minerva and Graphocephala atropunctata, and which are free to move throughout entirely caged alfalfa plants. The more efficient vector D. minerva fed preferentially at the base of the plant near the soil surface, whereas the less efficient G. atropunctata preferred overwhelming the top of the plant. 3. Next we documented X. fastidiosa heterogeneity in mechanically inoculated plants. Infection rates were up to 50% higher and mean bacterial population densities were 100-fold higher near the plant base than at the top or in the taproot. 4. Finally, we estimated transmission efficiency of the two leafhoppers when they were confined at either the base or top of inoculated alfalfa plants. Both vectors were inefficient when confined at the top of infected plants and were 20-60% more efficient when confined at the plant base. 5. These results show that vector transmission efficiency is determined by the interaction between leafhopper within-plant feeding behaviour and pathogen within-plant distribution. Fine-scale vector and pathogen overlap is likely to be a requirement generally for efficient transmission of vector-borne pathogens.

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

A scheme for efficient quantum computation wtih linear optics

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

Wolbachia infections are distributed throughout insect somatic and germ line tissues

Wolbachia are intracellular microorganisms that form maternally-inherited infections within numerous arthropod species. These bacteria have drawn much attention, due in part to the reproductive alterations that they induce in their hosts including cytoplasmic incompatibility (CI), feminization and parthenogenesis. Although Wolbachia's presence within insect reproductive tissues has been well described, relatively few studies have examined the extent to which Wolbachia infects other tissues. We have examined Wolbachia tissue tropism in a number of representative insect hosts by western blot, dot blot hybridization and diagnostic PCR. Results from these studies indicate that Wolbachia are much more widely distributed in host tissues than previously appreciated. Furthermore, the distribution of Wolbachia in somatic tissues varied between different Wolbachia/host associations. Some associations showed Wolbachia disseminated throughout most tissues while others appeared to be much more restricted, being predominantly limited to the reproductive tissues. We discuss the relevance of these infection patterns to the evolution of Wolbachia/host symbioses and to potential applied uses of Wolbachia.

The Conditional Autonomy of Tafuri's Historian / De Provisorische Autonomie van de Historicus bij Tafuri

This article considers the conditions placed on the autonomous architectural history discipline often understood at stake in Manfredo Tafuri's 1968 book Teorie e storia dell'architettura.

Special issue on advances in data mining and its applications

Data mining is the process to identify valid, implicit, previously unknown, potentially useful and understandable information from large databases. It is an important step in the process of knowledge discovery in databases, (Olaru & Wehenkel, 1999). In a data mining process, input data can be structured, seme-structured, or unstructured. Data can be in text, categorical or numerical values. One of the important characteristics of data mining is its ability to deal data with large volume, distributed, time variant, noisy, and high dimensionality. A large number of data mining algorithms have been developed for different applications. For example, association rules mining can be useful for market basket problems, clustering algorithms can be used to discover trends in unsupervised learning problems, classification algorithms can be applied in decision-making problems, and sequential and time series mining algorithms can be used in predicting events, fault detection, and other supervised learning problems (Vapnik, 1999). Classification is among the most important tasks in the data mining, particularly for data mining applications into engineering fields. Together with regression, classification is mainly for predictive modelling. So far, there have been a number of classification algorithms in practice. According to (Sebastiani, 2002), the main classification algorithms can be categorized as: decision tree and rule based approach such as C4.5 (Quinlan, 1996); probability methods such as Bayesian classifier (Lewis, 1998); on-line methods such as Winnow (Littlestone, 1988) and CVFDT (Hulten 2001), neural networks methods (Rumelhart, Hinton & Wiliams, 1986); example-based methods such as k-nearest neighbors (Duda & Hart, 1973), and SVM (Cortes & Vapnik, 1995). Other important techniques for classification tasks include Associative Classification (Liu et al, 1998) and Ensemble Classification (Tumer, 1996).

Computation of bifurcation boundaries for power systems: A new Delta-plane method

This paper is devoted to the problems of finding the load flow feasibility, saddle node, and Hopf bifurcation boundaries in the space of power system parameters. The first part contains a review of the existing relevant approaches including not-so-well-known contributions from Russia. The second part presents a new robust method for finding the power system load flow feasibility boundary on the plane defined by any three vectors of dependent variables (nodal voltages), called the Delta plane. The method exploits some quadratic and linear properties of the load now equations and state matrices written in rectangular coordinates. An advantage of the method is that it does not require an iterative solution of nonlinear equations (except the eigenvalue problem). In addition to benefits for visualization, the method is a useful tool for topological studies of power system multiple solution structures and stability domains. Although the power system application is developed, the method can be equally efficient for any quadratic algebraic problem.

Target similarity effects: Support for the parallel distributed processing assumptions

Recent research has begun to provide support for the assumptions that memories are stored as a composite and are accessed in parallel (Tehan & Humphreys, 1998). New predictions derived from these assumptions and from the Chappell and Humphreys (1994) implementation of these assumptions were tested. In three experiments, subjects studied relatively short lists of words. Some of the Lists contained two similar targets (thief and theft) or two dissimilar targets (thief and steal) associated with the same cue (ROBBERY). AS predicted, target similarity affected performance in cued recall but not free association. Contrary to predictions, two spaced presentations of a target did not improve performance in free association. Two additional experiments confirmed and extended this finding. Several alternative explanations for the target similarity effect, which incorporate assumptions about separate representations and sequential search, are rejected. The importance of the finding that, in at least one implicit memory paradigm, repetition does not improve performance is also discussed.

Prediction of carbon monoxide in fires by conditional moment closure

Carbon monoxide is the chief killer in fires. Dangerous levels of CO can occur when reacting combustion gases are quenched by heat transfer, or by mixing of the fire plume in a cooled under- or overventilated upper layer. In this paper, carbon monoxide predictions for enclosure fires are modeled by the conditional moment closure (CMC) method and are compared with laboratory data. The modeled fire situation is a buoyant, turbulent, diffusion flame burning under a hood. The fire plume entrains fresh air, and the postflame gases are cooled considerably under the hood by conduction and radiation, emulating conditions which occur in enclosure fires and lead to the freezing of CO burnout. Predictions of CO in the cooled layer are presented in the context of a complete computational fluid dynamics solution of velocity, temperature, and major species concentrations. A range of underhood equivalence ratios, from rich to lean, are investigated. The CMC method predicts CO in very good agreement with data. In particular, CMC is able to correctly predict CO concentrations in lean cooled gases, showing its capability in conditions where reaction rates change considerably.

Does Petrolisthes armatus (Anomura, Porcellanidae) form a Species Complex or Are We Dealing with Just One Widely Distributed Species?

Fernando L. Mantelatto, Leonardo G. Pileggi, Ivana Miranda, and Ingo S. Wehrtmann (2011) Does Petrolisthes armatus (Anomura, Porcellanidae) form a species complex or are we dealing with just one widely distributed species? Zoological Studies 50(3): 372-384. Petrolisthes armatus has the widest distribution known among members of the family Porcellanidae and is one of the most ubiquitous and locally abundant intertidal decapods along the Atlantic coast of the Americas. Considering its geographical distribution and morphological plasticity, several authors postulated the existence of a P. armatus species complex. In the present study we used genetic data from the mitochondrial 16S ribosomal gene to determine the genetic variability of P. armatus from selected locations within its eastern tropical Pacific and western Atlantic distributions. Our phylogenic analysis included 49 specimens represented by 26 species of the genus Petrolisthes and 16 specimens from 10 species and 4 related genera. Genetic distances estimated among the analyzed Petrolisthes species ranged from 2.6%-22.0%; varied between 0%-5.7% for 16S. Additionally, the revision of P. armatus specimens from Pacific Costa Rica and Brazilian Waters showed no geographically significant morphological variations among the analyzed specimens. Therefore, our morphological and genetic data do not support the hypothesis of a P. armatus complex within the specimens studied herein from the Americas, but convincingly confirm the monophyly and non-separateness of the members assigned as P. armatus. http://zoolstud.sinica.edu.tw/Journals/50.3/372.pdf