Wireless Energy Harvesting and Spectrum Sharing in Cognitive Radio

A wireless energy harvesting protocol is proposed for a decode-and-forward relay- assisted secondary user (SU) network in a cognitive spectrum sharing paradigm. An expression for the outage probability of the relay-assisted cognitive network is derived subject to the following power constraints: 1) the maximum power that the source and the relay in the SU network can transmit from the harvested energy, 2) the peak interference power from the source and the relay in the SU network at the primary user (PU) network, and 3) the interference power of the PU network at the relay-assisted SU network. The results show that as the energy harvesting conversion efficiency improves, the relay- assisted network with the proposed wireless energy harvesting protocol can operate with outage probabilities below 20% for some practical applications.

Inter-Agency Evidence Sharing in Competition Law Enforcement

While transnational antitrust enforcement is becoming only more common, the access to foreign-based evidence remains a considerable practical challenge. This article appraises considerations and concerns surrounding confidentiality, and looks into ways of their possible accommodation. It further identifies and critically evaluates the existing mechanisms allowing for inter-agency confidential information/ evidence sharing in competition law enforcement. The article outlines the shortcomings of the current framework and points to novel unilateral approaches. In the latter regard the focus is devoted to Australia, where the competition agency is empowered to share confidential information with foreign counterparts, also without any underlying bilateral agreement and on a non-reciprocal basis. This solution shows that a pragmatic and workable approach to inter-agency evidence sharing can be achieved.

Dissidents with an innovation cause? Non-institutionalized actors ’ online social knowledge sharing, solution-finding tensions and technology management innovation

Purpose
– Traditionally, most studies focus on institutionalized management-driven actors to understand technology management innovation. The purpose of this paper is to argue that there is a need for research to study the nature and role of dissident non-institutionalized actors’ (i.e. outsourced web designers and rapid application software developers). The authors propose that through online social knowledge sharing, non-institutionalized actors’ solution-finding tensions enable technology management innovation.

Design/methodology/approach
– A synthesis of the literature and an analysis of the data (21 interviews) provided insights in three areas of solution-finding tensions enabling management innovation. The authors frame the analysis on the peripherally deviant work and the nature of the ways that dissident non-institutionalized actors deviate from their clients (understood as the firm) original contracted objectives.

Findings
– The findings provide insights into the productive role of solution-finding tensions in enabling opportunities for management service innovation. Furthermore, deviant practices that leverage non-institutionalized actors’ online social knowledge to fulfill customers’ requirements are not interpreted negatively, but as a positive willingness to proactively explore alternative paths.

Research limitations/implications
– The findings demonstrate the importance of dissident non-institutionalized actors in technology management innovation. However, this work is based on a single country (USA) and additional research is needed to validate and generalize the findings in other cultural and institutional settings.

Originality/value
– This paper provides new insights into the perceptions of dissident non-institutionalized actors in the practice of IT managerial decision making. The work departs from, but also extends, the previous literature, demonstrating that peripherally deviant work in solution-finding practice creates tensions, enabling management innovation between IT providers and users.

Interference Investigation for Cognitive Spectrum Sharing Networks with Reactive DF Relay Selection

Cognitive radio (CR) with spectrum-sharing has been envisioned as emerging technology for the next generation of mobile and wireless networks by allowing the unlicensed customers simultaneously utilize the licensed radio frequency spectrums. However, the CR has faced some practical challenges due to its deduced system performance as compared to non spectrum-sharing counterpart. In this paper, we therefore consider the potential of incorporating the cooperative communications into CR by introducing the concept of reactive multiple decode-and-forward (DF) relays. In particular, we derive new results for exact and asymptotic expressions for the performance of cognitive relay networks with K-th best relay selection. Our novel results have exhibited the significance of using relay networks to enhance the system performance of CR.

Power Scaling of Uplink Massive MIMO Systems with Arbitrary-Rank Channel Means

This paper investigates the uplink achievable rates of massive multiple-input multiple-output (MIMO) antenna systems in Ricean fading channels, using maximal-ratio combining (MRC) and zero-forcing (ZF) receivers, assuming perfect and imperfect channel state information (CSI). In contrast to previous relevant works, the fast fading MIMO channel matrix is assumed to have an arbitrary-rank deterministic component as well as a Rayleigh-distributed random component. We derive tractable expressions for the achievable uplink rate in the large-antenna limit, along with approximating results that hold for any finite number of antennas. Based on these analytical results, we obtain the scaling law that the users' transmit power should satisfy, while maintaining a desirable quality of service. In particular, it is found that regardless of the Ricean K-factor, in the case of perfect CSI, the approximations converge to the same constant value as the exact results, as the number of base station antennas, M, grows large, while the transmit power of each user can be scaled down proportionally to 1/M. If CSI is estimated with uncertainty, the same result holds true but only when the Ricean K-factor is non-zero. Otherwise, if the channel experiences Rayleigh fading, we can only cut the transmit power of each user proportionally to 1/√M. In addition, we show that with an increasing Ricean K-factor, the uplink rates will converge to fixed values for both MRC and ZF receivers.

Massive MIMO with Non-Ideal Arbitrary Arrays: Hardware Scaling Laws and Circuit-Aware Design

Massive multiple-input multiple-output (MIMO) systems are cellular networks where the base stations (BSs) are equipped with unconventionally many antennas, deployed on colocated or distributed arrays. Huge spatial degrees-of-freedom are achieved by coherent processing over these massive arrays, which provide strong signal gains, resilience to imperfect channel knowledge, and low interference. This comes at the price of more infrastructure; the hardware cost and circuit power consumption scale linearly/affinely with the number of BS antennas N. Hence, the key to cost-efficient deployment of large arrays is low-cost antenna branches with low circuit power, in contrast to today’s conventional expensive and power-hungry BS antenna branches. Such low-cost transceivers are prone to hardware imperfections, but it has been conjectured that the huge degrees-of-freedom would bring robustness to such imperfections. We prove this claim for a generalized uplink system with multiplicative phasedrifts, additive distortion noise, and noise amplification. Specifically, we derive closed-form expressions for the user rates and a scaling law that shows how fast the hardware imperfections can increase with N while maintaining high rates. The connection between this scaling law and the power consumption of different transceiver circuits is rigorously exemplified. This reveals that one can make the circuit power increase as p N, instead of linearly, by careful circuit-aware system design.

Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases

There is extensive theoretical work on measures of inconsistency for arbitrary formulae in knowledge bases. Many of these are defined in terms of the set of minimal inconsistent subsets (MISes) of the base. However, few have been implemented or experimentally evaluated to support their viability, since computing all MISes is intractable in the worst case. Fortunately, recent work on a related problem of minimal unsatisfiable sets of clauses (MUSes) offers a viable solution in many cases. In this paper, we begin by drawing connections between MISes and MUSes through algorithms based on a MUS generalization approach and a new optimized MUS transformation approach to finding MISes. We implement these algorithms, along with a selection of existing measures for flat and stratified knowledge bases, in a tool called mimus. We then carry out an extensive experimental evaluation of mimus using randomly generated arbitrary knowledge bases. We conclude that these measures are viable for many large and complex random instances. Moreover, they represent a practical and intuitive tool for inconsistency handling.

Probing the Unfolded Configurations of a β-Hairpin Using Sketch-Map

This work examines the conformational ensemble involved in β-hairpin folding by means of advanced molecular dynamics simulations and dimensionality reduction. A fully atomistic description of the protein and the surrounding solvent molecules is used, and this complex energy landscape is sampled by means of parallel tempering metadynamics simulations. The ensemble of configurations explored is analyzed using the recently proposed sketch-map algorithm. Further simulations allow us to probe how mutations affect the structures adopted by this protein. We find that many of the configurations adopted by a mutant are the same as those adopted by the wild-type protein. Furthermore, certain mutations destabilize secondary-structure-containing configurations by preventing the formation of hydrogen bonds or by promoting the formation of new intramolecular contacts. Our analysis demonstrates that machine-learning techniques can be used to study the energy landscapes of complex molecules and that the visualizations that are generated in this way provide a natural basis for examining how the stabilities of particular configurations of the molecule are affected by factors such as temperature or structural mutations.