Co-operating retrodirective system

Practical demonstration of the operational advantages gained through the use of a co-operating retrodirective array (RDA) basestation and Van Atta node arrangements is discussed. The system exploits a number of inherent RDA features to provide analogue real time multifunctional operation at low physical complexity. An active dual-conversion four element RDA is used as the power distribution source (basestation) while simultaneously achieving a receive sensitivity level of ??109 dBm and 3 dB automatic beam steering angle of ??45??. When mobile units are each equipped with a semi-passive four element Van Atta array, it is shown mobile device orientation issues are mitigated and optimal energy transfer can occur because of automatic beam formation resulting from retrodirective self-pointing action. We show that operation in multipath rich environments with or without line of sight acts to reduce average power density limits in the operating volume with high energy density occurring at mobile nodes sites only. The system described can be used as a full duplex ASK communications link, or, as a means for remote node charging by wireless means, thereby enhancing deployment opportunities between unstabilised moving platforms.

Modal Extraction for Wind Turbines using Moving Window Subspace Identification

This paper proposes a method for wind turbine mode identification using the multivariable output error statespace (MOESP) identification algorithm. The paper incorporates a fast moving window QR decomposition and propagator method from array signal processing, yielding a moving window subspace identification algorithm. The algorithm assumes that the system order is known as a priori and remains constant during identification. For the purpose of extracting modal information for turbines modelled as a linear parameter varying (LPV) system, the algorithm is applicable since a nonlinear system can be approximated as a piecewise time invariant system in consecutive data windows. The algorithm is exemplified using numerical simulations which show that the moving window algorithm can track the modal information. The paper also demonstrates that the low computational burden of the algorithm, compared to conventional batch subspace identification, has significant implications for online implementation.

Fast Moving Window Algorithm for QR and Cholesky Decompositions

This paper proposes a fast moving window algorithm for QR and Cholesky decompositions by simultaneously applying data updating and downdating. The developed procedure is based on inner products and entails a similar downdating to that of the Chambers’ approach. For adding and deleting one row of data from the original matrix, a detailed analysis shows that the proposed algorithm outperforms existing ones in terms or computational efficiency, if the number of columns exceeds 7. For a large number of columns, the proposed algorithm is numerically superior compared to the traditional sequential technique.

Genome scan meta-analysis of schizophrenia and bipolar disorder, part II:Schizophrenia

Schizophrenia is a common disorder with high heritability and a 10-fold increase in risk to siblings of probands. Replication has been inconsistent for reports of significant genetic linkage. To assess evidence for linkage across studies, rank-based genome scan meta-analysis (GSMA) was applied to data from 20 schizophrenia genome scans. Each marker for each scan was assigned to 1 of 120 30-cM bins, with the bins ranked by linkage scores (1 = most significant) and the ranks averaged across studies (R(avg)) and then weighted for sample size (N(sqrt)[affected casess]). A permutation test was used to compute the probability of observing, by chance, each bin's average rank (P(AvgRnk)) or of observing it for a bin with the same place (first, second, etc.) in the order of average ranks in each permutation (P(ord)). The GSMA produced significant genomewide evidence for linkage on chromosome 2q (PAvgRnk

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we present AGWAN (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the AGWAN model to real-world graphs and for generating random graphs from the model. Using the Enron “who communicates with whom” social graph, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to the structure of real-world graphs.