Hybrid multi-channel cooperative spectrum sensing to satisfy channel target

Spectrum sensing of multiple primary user channels is a crucial function in cognitive radio networks. In this paper we propose an optimal, sensing resource allocation algorithm for multi-channel cooperative spectrum sensing. The channel target is implemented as an objective and constraint to ensure a pre-determined number of empty channels are detected for secondary user network operations. Based on primary user traffic parameters, we calculate the minimum number of primary user channels that must be sensed to satisfy the channel target. We implement a hybrid sensing structure by grouping secondary user nodes into clusters and assign each cluster to sense a different primary user channels. We then solve the resource allocation problem to find the optimal sensing configuration and node allocation to minimise sensing duration. Simulation results show that the proposed algorithm requires the shortest sensing duration to achieve the channel target compared to existing studies that require long sensing and cannot guarantee the target.

Robust clustering of multi-type relational data via a heterogeneous manifold ensemble

High-Order Co-Clustering (HOCC) methods have attracted high attention in recent years because of their ability to cluster multiple types of objects simultaneously using all available information. During the clustering process, HOCC methods exploit object co-occurrence information, i.e., inter-type relationships amongst different types of objects as well as object affinity information, i.e., intra-type relationships amongst the same types of objects. However, it is difficult to learn accurate intra-type relationships in the presence of noise and outliers. Existing HOCC methods consider the p nearest neighbours based on Euclidean distance for the intra-type relationships, which leads to incomplete and inaccurate intra-type relationships. In this paper, we propose a novel HOCC method that incorporates multiple subspace learning with a heterogeneous manifold ensemble to learn complete and accurate intra-type relationships. Multiple subspace learning reconstructs the similarity between any pair of objects that belong to the same subspace. The heterogeneous manifold ensemble is created based on two-types of intra-type relationships learnt using p-nearest-neighbour graph and multiple subspaces learning. Moreover, in order to make sure the robustness of clustering process, we introduce a sparse error matrix into matrix decomposition and develop a novel iterative algorithm. Empirical experiments show that the proposed method achieves improved results over the state-of-art HOCC methods for FScore and NMI.

Evaluation of the relationship between Chlamydia pecorum sequence types and disease using a species-specific multi-locus sequence typing scheme (MLST)

Chlamydia pecorum is globally associated with several ovine diseases including keratoconjunctivitis and polyarthritis. The exact relationship between the variety of C. pecorum strains reported and the diseases described in sheep remains unclear, challenging efforts to accurately diagnose and manage infected flocks. In the present study, we applied C. pecorum multi-locus sequence typing (MLST) to C. pecorum positive samples collected from sympatric flocks of Australian sheep presenting with conjunctivitis, conjunctivitis with polyarthritis, or polyarthritis only and with no clinical disease (NCD) in order to elucidate the exact relationships between the infecting strains and the range of diseases. Using Bayesian phylogenetic and cluster analyses on 62 C. pecorum positive ocular, vaginal and rectal swab samples from sheep presenting with a range of diseases and in a comparison to C. pecorum sequence types (STs) from other hosts, one ST (ST 23) was recognised as a globally distributed strain associated with ovine and bovine diseases such as polyarthritis and encephalomyelitis. A second ST (ST 69) presently only described in Australian animals, was detected in association with ovine as well as koala chlamydial infections. The majority of vaginal and rectal C. pecorum STs from animals with NCD and/or anatomical sites with no clinical signs of disease in diseased animals, clustered together in a separate group, by both analyses. Furthermore, 8/13 detected STs were novel. This study provides a platform for strain selection for further research into the pathogenic potential of C. pecorum in animals and highlights targets for potential strain-specific diagnostic test development.

Effect of an interactive therapeutic robotic animal on engagement, mood states, agitation and psychotropic drug use in people with dementia: A cluster-randomised controlled trial protocol

Introduction: Apathy, agitated behaviours, loneliness and depression are common consequences of dementia. This trial aims to evaluate the effect of a robotic animal on behavioural and psychological symptoms of dementia in people with dementia living in long-term aged care. Methods and analysis: A cluster-randomised controlled trial with three treatment groups: PARO (robotic animal), Plush-Toy (non-robotic PARO) or Usual Care (Control). The nursing home sites are Australian Government approved and accredited facilities of 60 or more beds. The sites are located in South-East Queensland, Australia. A sample of 380 adults with a diagnosis of dementia, aged 60 years or older living in one of the participating facilities will be recruited. The intervention consists of three individual 15 min non-facilitated sessions with PARO or Plush- Toy per week, for a period of 10 weeks. The primary outcomes of interest are improvement in agitation, mood states and engagement. Secondary outcomes include sleep duration, step count, change in psychotropic medication use, change in treatment costs, and staff and family perceptions of PARO or Plush-Toy. Video data will be analysed using Noldus XT Pocket Observer; descriptive statistics will be used for participants’ demographics and outcome measures; cluster and individual level analyses to test all hypotheses and Generalised Linear Models for cluster level and Generalised Estimation Equations and/or Multi-level Modeling for individual level data. Ethics and dissemination: The study participants or their proxy will provide written informed consent. The Griffith University Human Research Ethics Committee has approved the study (NRS/03/14/HREC). The results of the study will provide evidence of the efficacy of a robotic animal as a psychosocial treatment for the behavioural and psychological symptoms of dementia. Findings will be presented at local and international conference meetings and published in peer-reviewed journals.

Cluster randomised-control trial for an Australian child protection education program: Study protocol for the Learn to be safe with Emmy and friends™

Background Child maltreatment has severe short-and long-term consequences for children’s health, development, and wellbeing. Despite the provision of child protection education programs in many countries, few have been rigorously evaluated to determine their effectiveness. We describe the design of a multi-site gold standard evaluation of an Australian school-based child protection education program. The intervention has been developed by a not-for-profit agency and comprises 5 1-h sessions delivered to first grade students (aged 5–6 years) in their regular classrooms. It incorporates common attributes of effective programs identified in the literature, and aligns with the Australian education curriculum. Methods/Design A three-site cluster randomised controlled trial (RCT) of Learn to be safe with Emmy and friends™ will be conducted with children in approximately 72 first grade classrooms in 24 Queensland primary (elementary) schools from three state regions, over a period of 2 years. Entire schools will be randomised, using a computer generated list of random numbers, to intervention and wait-list control conditions, to prevent contamination effects across students and classes. Data will be collected at baseline (pre-assessment), immediately after the intervention (post-assessment), and at 6-, 12-, and 18-months (follow-up assessments). Outcome assessors will be blinded to group membership. Primary outcomes assessed are children’s knowledge of program concepts; intentions to use program knowledge, skills, and help-seeking strategies; actual use of program material in a simulated situation; and anxiety arising from program participation. Secondary outcomes include a parent discussion monitor, parent observations of their children’s use of program materials, satisfaction with the program, and parental stress. A process evaluation will be conducted concurrently to assess program performance. Discussion This RCT addresses shortcomings in previous studies and methodologically extends research in this area by randomising at school-level to prevent cross-learning between conditions; providing longer-term outcome assessment than any previous study; examining the degree to which parents/guardians discuss intervention content with children at home; assessing potential moderating/mediating effects of family and child demographic variables; testing an in-vivo measure to assess children’s ability to discriminate safe/unsafe situations and disclose to trusted adults; and testing enhancements to existing measures to establish greater internal consistency.

Distributed Source Coding for Sensor Data Model and Estimation of Cluster Head Errors Using Bayesian and K-Near Neighborhood Classifiers in Deployment of Dense Wireless Sensor Networks

The lifetime calculation of large dense sensor networks with fixed energy resources and the remaining residual energy have shown that for a constant energy resource in a sensor network the fault rate at the cluster head is network size invariant when using the network layer with no MAC losses.Even after increasing the battery capacities in the nodes the total lifetime does not increase after a max limit of 8 times. As this is a serious limitation lots of research has been done at the MAC layer which allows to adapt to the specific connectivity, traffic and channel polling needs for sensor networks. There have been lots of MAC protocols which allow to control the channel polling of new radios which are available to sensor nodes to communicate. This further reduces the communication overhead by idling and sleep scheduling thus extending the lifetime of the monitoring application. We address the two issues which effects the distributed characteristics and performance of connected MAC nodes. (1) To determine the theoretical minimum rate based on joint coding for a correlated data source at the singlehop, (2a) to estimate cluster head errors using Bayesian rule for routing using persistence clustering when node densities are the same and stored using prior probability at the network layer, (2b) to estimate the upper bound of routing errors when using passive clustering were the node densities at the multi-hop MACS are unknown and not stored at the multi-hop nodes a priori. In this paper we evaluate many MAC based sensor network protocols and study the effects on sensor network lifetime. A renewable energy MAC routing protocol is designed when the probabilities of active nodes are not known a priori. From theoretical derivations we show that for a Bayesian rule with known class densities of omega1, omega2 with expected error P* is bounded by max error rate of P=2P* for single-hop. We study the effects of energy losses using cross-layer simulation of - large sensor network MACS setup, the error rate which effect finding sufficient node densities to have reliable multi-hop communications due to unknown node densities. The simulation results show that even though the lifetime is comparable the expected Bayesian posterior probability error bound is close or higher than Pges2P*.

Large improvements in application throughput of long-running multi-component applications using batch grids

Computational grids with multiple batch systems (batch grids) can be powerful infrastructures for executing long-running multi-component parallel applications. In this paper, we evaluate the potential improvements in throughput of long-running multi-component applications when the different components of the applications are executed on multiple batch systems of batch grids. We compare the multiple batch executions with executions of the components on a single batch system without increasing the number of processors used for executions. We perform our analysis with a foremost long-running multi-component application for climate modeling, the Community Climate System Model (CCSM). We have built a robust simulator that models the characteristics of both the multi-component application and the batch systems. By conducting large number of simulations with different workload characteristics and queuing policies of the systems, processor allocations to components of the application, distributions of the components to the batch systems and inter-cluster bandwidths, we show that multiple batch executions lead to 55% average increase in throughput over single batch executions for long-running CCSM. We also conducted real experiments with a practical middleware infrastructure and showed that multi-site executions lead to effective utilization of batch systems for executions of CCSM and give higher simulation throughput than single-site executions. Copyright (c) 2011 John Wiley & Sons, Ltd.

MPI-based parallel synchronous vector evaluated particle swarm optimization for multi-objective design optimization of composite structures

This paper presents a decentralized/peer-to-peer architecture-based parallel version of the vector evaluated particle swarm optimization (VEPSO) algorithm for multi-objective design optimization of laminated composite plates using message passing interface (MPI). The design optimization of laminated composite plates being a combinatorially explosive constrained non-linear optimization problem (CNOP), with many design variables and a vast solution space, warrants the use of non-parametric and heuristic optimization algorithms like PSO. Optimization requires minimizing both the weight and cost of these composite plates, simultaneously, which renders the problem multi-objective. Hence VEPSO, a multi-objective variant of the PSO algorithm, is used. Despite the use of such a heuristic, the application problem, being computationally intensive, suffers from long execution times due to sequential computation. Hence, a parallel version of the PSO algorithm for the problem has been developed to run on several nodes of an IBM P720 cluster. The proposed parallel algorithm, using MPI's collective communication directives, establishes a peer-to-peer relationship between the constituent parallel processes, deviating from the more common master-slave approach, in achieving reduction of computation time by factor of up to 10. Finally we show the effectiveness of the proposed parallel algorithm by comparing it with a serial implementation of VEPSO and a parallel implementation of the vector evaluated genetic algorithm (VEGA) for the same design problem. (c) 2012 Elsevier Ltd. All rights reserved.

CUDA-for-clusters: a system for efficient execution of CUDA kernels on multi-core clusters

Rapid advancements in multi-core processor architectures coupled with low-cost, low-latency, high-bandwidth interconnects have made clusters of multi-core machines a common computing resource. Unfortunately, writing good parallel programs that efficiently utilize all the resources in such a cluster is still a major challenge. Various programming languages have been proposed as a solution to this problem, but are yet to be adopted widely to run performance-critical code mainly due to the relatively immature software framework and the effort involved in re-writing existing code in the new language. In this paper, we motivate and describe our initial study in exploring CUDA as a programming language for a cluster of multi-cores. We develop CUDA-For-Clusters (CFC), a framework that transparently orchestrates execution of CUDA kernels on a cluster of multi-core machines. The well-structured nature of a CUDA kernel, the growing popularity, support and stability of the CUDA software stack collectively make CUDA a good candidate to be considered as a programming language for a cluster. CFC uses a mixture of source-to-source compiler transformations, a work distribution runtime and a light-weight software distributed shared memory to manage parallel executions. Initial results on running several standard CUDA benchmark programs achieve impressive speedups of up to 7.5X on a cluster with 8 nodes, thereby opening up an interesting direction of research for further investigation.

Support vector clustering-based direct coherency identification of generators in a multi-machine power system

This study investigates the application of support vector clustering (SVC) for the direct identification of coherent synchronous generators in large interconnected multi-machine power systems. The clustering is based on coherency measure, which indicates the degree of coherency between any pair of generators. The proposed SVC algorithm processes the coherency measure matrix that is formulated using the generator rotor measurements to cluster the coherent generators. The proposed approach is demonstrated on IEEE 10 generator 39-bus system and an equivalent 35 generators, 246-bus system of practical Indian southern grid. The effect of number of data samples and fault locations are also examined for determining the accuracy of the proposed approach. An extended comparison with other clustering techniques is also included, to show the effectiveness of the proposed approach in grouping the data into coherent groups of generators. This effectiveness of the coherent clusters obtained with the proposed approach is compared in terms of a set of clustering validity indicators and in terms of statistical assessment that is based on the coherency degree of a generator pair.

Multi-site downscaling of maximum and minimum daily temperature using support vector machine

Climate change impact assessment studies involve downscaling large-scale atmospheric predictor variables (LSAPVs) simulated by general circulation models (GCMs) to site-scale meteorological variables. This article presents a least-square support vector machine (LS-SVM)-based methodology for multi-site downscaling of maximum and minimum daily temperature series. The methodology involves (1) delineation of sites in the study area into clusters based on correlation structure of predictands, (2) downscaling LSAPVs to monthly time series of predictands at a representative site identified in each of the clusters, (3) translation of the downscaled information in each cluster from the representative site to that at other sites using LS-SVM inter-site regression relationships, and (4) disaggregation of the information at each site from monthly to daily time scale using k-nearest neighbour disaggregation methodology. Effectiveness of the methodology is demonstrated by application to data pertaining to four sites in the catchment of Beas river basin, India. Simulations of Canadian coupled global climate model (CGCM3.1/T63) for four IPCC SRES scenarios namely A1B, A2, B1 and COMMIT were downscaled to future projections of the predictands in the study area. Comparison of results with those based on recently proposed multivariate multiple linear regression (MMLR) based downscaling method and multi-site multivariate statistical downscaling (MMSD) method indicate that the proposed method is promising and it can be considered as a feasible choice in statistical downscaling studies. The performance of the method in downscaling daily minimum temperature was found to be better when compared with that in downscaling daily maximum temperature. Results indicate an increase in annual average maximum and minimum temperatures at all the sites for A1B, A2 and B1 scenarios. The projected increment is high for A2 scenario, and it is followed by that for A1B, B1 and COMMIT scenarios. Projections, in general, indicated an increase in mean monthly maximum and minimum temperatures during January to February and October to December.

Multi-objective design and optimisation of bypass outlet-guide vanes

This paper describes the development of an automated design optimization system that makes use of a high fidelity Reynolds-Averaged CFD analysis procedure to minimize the fan forcing and fan BOGV (bypass outlet guide vane) losses simultaneously taking into the account the down-stream pylon and RDF (radial drive fairing) distortions. The design space consists of the OGV's stagger angle, trailing-edge recambering, axial and circumferential positions leading to a variable pitch optimum design. An advanced optimization system called SOFT (Smart Optimisation for Turbomachinery) was used to integrate a number of pre-processor, simulation and in-house grid generation codes and postprocessor programs. A number of multi-objective, multi-point optimiztion were carried out by SOFT on a cluster of workstations and are reported herein.

Multi-objective shape optimisation for horizontal-axis wind turbine blades

We are developing a wind turbine blade optimisation package CoBOLDT (COmputa- tional Blade Optimisation and Load De ation Tool) for the optimisation of large horizontal- axis wind turbines. The core consists of the Multi-Objective Tabu Search (MOTS), which controls a spline parameterisation module, a fast geometry generation and a stationary Blade Element Momentum (BEM) code to optimise an initial wind turbine blade design. The objective functions we investigate are the Annual Energy Production (AEP) and the fl apwise blade root bending moment (MY0) for a stationary wind speed of 50 m/s. For this task we use nine parameters which define the blade chord, the blade twist (4 parameters each) and the blade radius. Throughout the optimisation a number of binary constraints are defined to limit the noise emission, to allow for transportation on land and to control the aerodynamic conditions during all phases of turbine operation. The test case shows that MOTS is capable to find enhanced designs very fast and eficiently and will provide a rich and well explored Pareto front for the designer to chose from. The optimised blade de- sign could improve the AEP of the initial blade by 5% with the same flapwise root bending moment or reduce MY0 by 7.5% with the original energy yield. Due to the fast runtime of order 10 seconds per design, a huge number of optimisation iterations is possible without the need for a large computing cluster. This also allows for increased design flexibility through the introduction of more parameters per blade function or parameterisation of the airfoils in future. © 2012 by Nordex Energy GmbH.

Multi-objective shape optimisation for horizontal-axis wind turbine blades

We are developing a wind turbine blade optimisation package CoBOLDT (COmputa- tional Blade Optimisation and Load Deation Tool) for the optimisation of large horizontal- axis wind turbines. The core consists of the Multi-Objective Tabu Search (MOTS), which controls a spline parameterisation module, a fast geometry generation and a stationary Blade Element Momentum (BEM) code to optimise an initial wind turbine blade design. The objective functions we investigate are the Annual Energy Production (AEP) and the apwise blade root bending moment (MY0) for a stationary wind speed of 50 m/s. For this task we use nine parameters which define the blade chord, the blade twist (4 parameters each) and the blade radius. Throughout the optimisation a number of binary constraints are defined to limit the noise emission, to allow for transportation on land and to control the aerodynamic conditions during all phases of turbine operation. The test case shows that MOTS is capable to find enhanced designs very fast and efficiently and will provide a rich and well explored Pareto front for the designer to chose from. The optimised blade de- sign could improve the AEP of the initial blade by 5% with the same apwise root bending moment or reduce MY0 by 7.5% with the original energy yield. Due to the fast runtime of order 10 seconds per design, a huge number of optimisation iterations is possible without the need for a large computing cluster. This also allows for increased design flexibility through the introduction of more parameters per blade function or parameterisation of the airfoils in future. © 2012 AIAA.

High-order harmonic generation and multi-photon ionization of Na-2 in laser fields

In this paper high-order harmonic generation (HHG) spectra and the ionization probabilities of various charge states of small cluster Na-2 in the multiphoton regimes are calculated by using time-dependent local density approximation (TDLDA) for one-colour (1064 nm) and two-colour (1064 nm and 532 nm) ultrashort (25 fs) laser pulses. HHG spectra of Na2 have not the large extent of plateaus due to pronounced collective effects of electron dynamics. In addition, the two-colour laser field can result in the breaking of the symmetry and generation of the even order harmonic such as the second order harmonic. The results of ionization probabilities show that a two-colour laser field can increase the ionization probability of higher charge state.