Generalized Selection Combining for Cognitive Relay Networks over Nakagami-m Fading

We consider transmit antenna selection with receive generalized selection combining (TAS/GSC) for cognitive decodeand-forward (DF) relaying in Nakagami-m fading channels. In an effort to assess the performance, the probability density function and the cumulative distribution function of the endto-end SNR are derived using the moment generating function, from which new exact closed-form expressions for the outage probability and the symbol error rate are derived. We then derive a new closed-form expression for the ergodic capacity. More importantly, by deriving the asymptotic expressions for the outage probability and the symbol error rate, as well as the high SNR approximations of the ergodic capacity, we establish new design insights under the two distinct constraint scenarios: 1) proportional interference power constraint, and 2) fixed interference power constraint. Several pivotal conclusions are reached. For the first scenario, the full diversity order of the
outage probability and the symbol error rate is achieved, and the high SNR slope of the ergodic capacity is 1/2. For the second scenario, the diversity order of the outage probability and the symbol error rate is zero with error floors, and the high SNR slope of the ergodic capacity is zero with capacity ceiling.

Generalized loopy 2U: A new algorithm for approximate inference in credal networks

Credal networks generalize Bayesian networks by relaxing the requirement of precision of probabilities. Credal networks are considerably more expressive than Bayesian networks, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal networks. The algorithm is based on an important representation result we prove for general credal networks: that any credal network can be equivalently reformulated as a credal network with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal network is then updated by L2U, a loopy approximate algorithm for binary credal networks. Overall, we generalize L2U to non-binary credal networks, obtaining a scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences with respect to other state-of-the-art algorithms is evaluated by extensive numerical tests.

Generalized Loopy 2U: A New Algorithm for Approximate Inference in Credal Networks

Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal nets. The algorithm is based on an important representation result we prove for general credal nets: that any credal net can be equivalently reformulated as a credal net with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal net is updated by L2U, a loopy approximate algorithm for binary credal nets. Thus, we generalize L2U to non-binary credal nets, obtaining an accurate and scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences is evaluated by empirical tests.

A Hundred Comets: The Visual-Wavelength Observations of the Survey of Ensemble Physical Properties of Cometary Nuclei (SEPPCoN)

We present new results from SEPPCoN, a Survey of Ensemble Physical Properties of Cometary Nuclei. This project is currently surveying 100 Jupiter-family comets (JFCs) to measure the mid-infrared thermal emission and visible reflected sunlight of the nuclei. The scientific goal is to determine the distributions of radius, geometric albedo, thermal inertia, axial ratio, and color among the JFC nuclei. In the past we have presented results from the completed mid-IR observations of our sample [1]; here we present preliminary results from ongoing, broadband visible-wavelength observations of nuclei obtained from a variety of ground-based facilities (Mauna Kea, Cerro Pachon, La Silla, La Palma, Apache Point, Table Mtn., and Palomar Mtn.), including contributions from the Near Earth Asteroid Telescope project (NEAT) archive. The nuclei were observed at high heliocentric distance (usually over 4 AU) and so many comets show either no or little contamination from dust coma. While several nuclei have been observed as snapshots, we have multiepoch photometry for many of our targets. With our datasets we are building a large database of photometry, and such a database is essential to the derivation of albedo and shape of a large number of nuclei, and to the understanding of biases in the survey. Support for this work was provided by NSF and the NASA Planetary Astronomy program. Reference: [1] Fernandez, Y.R., et al. 2007, BAAS 39, 827.

Outperformance in exchange-traded fund pricing deviations: Generalized control of data snooping bias

An investigation into exchange-traded fund (ETF) outperforrnance during the period 2008-2012 is undertaken utilizing a data set of 288 U.S. traded securities. ETFs are tested for net asset value (NAV) premium, underlying index and market benchmark outperformance, with Sharpe, Treynor, and Sortino ratios employed as risk-adjusted performance measures. A key contribution is the application of an innovative generalized stepdown procedure in controlling for data snooping bias. We find that a large proportion of optimized replication and debt asset class ETFs display risk-adjusted premiums with energy and precious metals focused funds outperforming the S&P 500 market benchmark. 

High accuracy android malware detection using ensemble learning

With over 50 billion downloads and more than 1.3 million apps in Google’s official market, Android has continued to gain popularity amongst smartphone users worldwide. At the same time there has been a rise in malware targeting the platform, with more recent strains employing highly sophisticated detection avoidance techniques. As traditional signature based methods become less potent in detecting unknown malware, alternatives are needed for timely zero-day discovery. Thus this paper proposes an approach that utilizes ensemble learning for Android malware detection. It combines advantages of static analysis with the efficiency and performance of ensemble machine learning to improve Android malware detection accuracy. The machine learning models are built using a large repository of malware samples and benign apps from a leading antivirus vendor. Experimental results and analysis presented shows that the proposed method which uses a large feature space to leverage the power of ensemble learning is capable of 97.3 % to 99% detection accuracy with very low false positive rates.

Low complexity greedy detection method with generalized multicarrier index keying OFDM

Multicarrier Index Keying (MCIK) is a recently developed technique that modulates subcarriers but also indices of the subcarriers. In this paper a novel low-complexity detection scheme of subcarrier indices is proposed for an MCIK system and addresses a substantial reduction in complexity over the optimalmaximum likelihood (ML) detection. For the performance evaluation, a closed-form expression for the pairwise error probability (PEP) of an active subcarrier index, and a tight approximation of the average PEP of multiple subcarrier indices are derived in closed-form. The theoretical outcomes are validated usingsimulations, at a difference of less than 0.1dB. Compared to the optimal ML, the proposed detection achieves a substantial reduction in complexity with small loss in error performance (<= 0.6dB).

Towards generalized Doherty power amplifier design for multiband operation

This paper presents a new variant of broadband Doherty power amplifier that employs a novel output combiner. A new parameter ∝ is introduced to permit a generalized analysis of the recently reported Parallel Doherty power amplifier (PDPA),and hence offer design flexibility. The circuit prototype of the new DPA fabricated using GaN devices exhibits maximum drain efficiency of 85% at 43-dBm peak power and 63% at 6-dB backoff power (BOP). Measured drain efficiency of >60% at peak power across 500-MHz frequency range and >50% at 6-dB BOP across 480-MHz frequency range were achieved, confirming the  theoretical wideband characteristics of the new DPA.

Changes in epilithic biomasses and invertebrate community structure over a deposit metal concentration gradient in upland headwater streams

Stream bed metal deposits affect the taxon richness, density and taxonomic diversity of primary and secondary producers by a variety of direct or indirect abiotic and biotic processes but little is known about the relative importance of these processes over a deposit metal concentration gradient. Inorganic matter (IM), algal and non-photosynthetic detrital (NPD) dry biomasses were estimated for 10 monthly samples, between 2007 and 2008, from eight sites differing in deposit density. Invertebrate abundance, taxon richness and composition were also determined. Relations between these variables were investigated by canonical correspondence analysis (CCA), generalized estimating equation models and path analysis. The first CCA axis correlates with deposit density and invertebrate abundance, with lumbriculids and chironomids increasing in abundance with deposit density and all other taxa declining. Community structure changes significantly above a deposit density of approximately 8 mg cm, when algal biomass, invertebrate richness and diversity decline. Invertebrate richness and diversity were determined by direct effects of NPD biomass and indirect effects of IM. Algal biomass only had an effect on invertebrate abundance. Possible pH, oxygen, food and ecotoxicological effects of NPD biomass on the biota are discussed.

Clustering-Based Ensemble Learning for Activity Recognition in Smart Homes

Application of sensor-based technology within activity monitoring systems is becoming a popular technique within the smart environment paradigm. Nevertheless, the use of such an approach generates complex constructs of data, which subsequently requires the use of intricate activity recognition techniques to automatically infer the underlying activity. This paper explores a cluster-based ensemble method as a new solution for the purposes of activity recognition within smart environments. With this approach activities are modelled as collections of clusters built on different subsets of features. A classification process is performed by assigning a new instance to its closest cluster from each collection. Two different sensor data representations have been investigated, namely numeric and binary. Following the evaluation of the proposed methodology it has been demonstrated that the cluster-based ensemble method can be successfully applied as a viable option for activity recognition. Results following exposure to data collected from a range of activities indicated that the ensemble method had the ability to perform with accuracies of 94.2% and 97.5% for numeric and binary data, respectively. These results outperformed a range of single classifiers considered as benchmarks.