Sparse multi-carrier index keying OFDM with index separation over correlated sub-carriers

In this paper, we propose a sparse multi-carrier index keying (MCIK) method for orthogonal frequency division multiplexing (OFDM) system, which uses the indices of sparse sub-carriers to transmit the data, and improve the performance
of signal detection in highly correlated sub-carriers. Although a receiver is able to exploit a power gain with precoding in OFDM, the sensitivity of the signal detection is usually high as the orthogonality is not retained in highly dispersive
environments. To overcome this, we focus on developing the trade-off between the sparsity of the MCIK, correlation, and performances, analyzing the average probability of the error propagation imposed by incorrect index detection over highly correlated sub-carriers. In asymptotic cases, we are able to see how sparsity of MCIK should be designed in order to perform superior to the classical OFDM system. Based on this feature, sparse MCIK based OFDM is a better choice for low detection errors in highly correlated sub-carriers.

A Fast Algorithm for Sparse Support Vector Machines for Mobile Computing Applications

This research presents a fast algorithm for projected support vector machines (PSVM) by selecting a basis vector set (BVS) for the kernel-induced feature space, the training points are projected onto the subspace spanned by the selected BVS. A standard linear support vector machine (SVM) is then produced in the subspace with the projected training points. As the dimension of the subspace is determined by the size of the selected basis vector set, the size of the produced SVM expansion can be specified. A two-stage algorithm is derived which selects and refines the basis vector set achieving a locally optimal model. The model expansion coefficients and bias are updated recursively for increase and decrease in the basis set and support vector set. The condition for a point to be classed as outside the current basis vector and selected as a new basis vector is derived and embedded in the recursive procedure. This guarantees the linear independence of the produced basis set. The proposed algorithm is tested and compared with an existing sparse primal SVM (SpSVM) and a standard SVM (LibSVM) on seven public benchmark classification problems. Our new algorithm is designed for use in the application area of human activity recognition using smart devices and embedded sensors where their sometimes limited memory and processing resources must be exploited to the full and the more robust and accurate the classification the more satisfied the user. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm. This work builds upon a previously published algorithm specifically created for activity recognition within mobile applications for the EU Haptimap project [1]. The algorithms detailed in this paper are more memory and resource efficient making them suitable for use with bigger data sets and more easily trained SVMs.

Scoup-SMT: Scalable Coupled Sparse Matrix-Tensor Factorization

How can we correlate neural activity in the human brain as it responds to words, with behavioral data expressed as answers to questions about these same words? In short, we want to find latent variables, that explain both the brain activity, as well as the behavioral responses. We show that this is an instance of the Coupled Matrix-Tensor Factorization (CMTF) problem. We propose Scoup-SMT, a novel, fast, and parallel algorithm that solves the CMTF problem and produces a sparse latent low-rank subspace of the data. In our experiments, we find that Scoup-SMT is 50-100 times faster than a state-of-the-art algorithm for CMTF, along with a 5 fold increase in sparsity. Moreover, we extend Scoup-SMT to handle missing data without degradation of performance. We apply Scoup-SMT to BrainQ, a dataset consisting of a (nouns, brain voxels, human subjects) tensor and a (nouns, properties) matrix, with coupling along the nouns dimension. Scoup-SMT is able to find meaningful latent variables, as well as to predict brain activity with competitive accuracy. Finally, we demonstrate the generality of Scoup-SMT, by applying it on a Facebook dataset (users, friends, wall-postings); there, Scoup-SMT spots spammer-like anomalies.

Gendered Candidate Selection and the Representation of Women in Northern Ireland

In an attempt to account for the exceptionally low levels of female representation in Northern Ireland, this paper provides an analysis of the contemporary candidate selection procedures of the region's five main political parties. Drawing on evidence gathered from 29 elite interviews, plus official internal party documents, the study finds that the localised nature of the parties' selection procedures may disadvantage women aspirants. Also important are ‘supply-side’ factors influencing legislative recruitment and female participation rates, namely the strongly embedded social norm of female domestic responsibility, a masculinised political culture and the lack of confidence of potential female candidates.

Similarity or Variation? Employee Representation and Consultation Approaches Amongst Liberal Market Economy Multinationals

This paper engages with the varieties of capitalism literature to investigate the employee representation and consultation approaches of liberal market economy multinational companies (MNCs), specifically Australian, British and US MNCs operating in Australia. While the literature would suggest commonality amongst these MNCs, the paper considers whether the evidence points to similarity or variation amongst liberal market headquartered MNCs. The findings contribute to filling a recognized empirical gap on MNC employment relations practice in Australia and to a better understanding of within category varieties of capitalism similarity and variation. Drawing on survey data from MNCs operating in Australia, the results demonstrated that UK-owned MNCs were the least likely to report collective structures of employee representation. Moreover, it was found that Australian MNCs were the most likely to engage in collective forms of employee representation and made less use of direct consultative mechanisms relative to their British and US counterparts. In spite of the concerted individualization of the employment relations domain over previous decades, Australian MNCs appear to have upheld more long-standing national institutional arrangements with respect to engaging with employees on a collective basis. This varies from British and US MNC approaches which denotes that our results display within category deviation in the variety of capitalism liberal market economy typology. Just as Hall and Soskice described their seminal work on liberal market economy (LME) and coordinated market economy (CME) categories as a “work-in-progress” (2001: 2), we too suggest that Australia’s evolution in the LME category, and more specifically its industrial relations system development, and the consequences for employment relations practices of its domestic MNCs, may be a work-in-progress.

The basic principles of uncertain information fusion. An organised review of merging rules in different representation frameworks.

We propose and advocate basic principles for the fusion of incomplete or uncertain information items, that should apply regardless of the formalism adopted for representing pieces of information coming from several sources. This formalism can be based on sets, logic, partial orders, possibility theory, belief functions or imprecise probabilities. We propose a general notion of information item representing incomplete or uncertain information about the values of an entity of interest. It is supposed to rank such values in terms of relative plausibility, and explicitly point out impossible values. Basic issues affecting the results of the fusion process, such as relative information content and consistency of information items, as well as their mutual consistency, are discussed. For each representation setting, we present fusion rules that obey our principles, and compare them to postulates specific to the representation proposed in the past. In the crudest (Boolean) representation setting (using a set of possible values), we show that the understanding of the set in terms of most plausible values, or in terms of non-impossible ones matters for choosing a relevant fusion rule. Especially, in the latter case our principles justify the method of maximal consistent subsets, while the former is related to the fusion of logical bases. Then we consider several formal settings for incomplete or uncertain information items, where our postulates are instantiated: plausibility orderings, qualitative and quantitative possibility distributions, belief functions and convex sets of probabilities. The aim of this paper is to provide a unified picture of fusion rules across various uncertainty representation settings.