1,955 research outputs found

    Comprehensive survey on quality of service provisioning approaches in cognitive radio networks : part one

    Get PDF
    Much interest in Cognitive Radio Networks (CRNs) has been raised recently by enabling unlicensed (secondary) users to utilize the unused portions of the licensed spectrum. CRN utilization of residual spectrum bands of Primary (licensed) Networks (PNs) must avoid harmful interference to the users of PNs and other overlapping CRNs. The coexisting of CRNs depends on four components: Spectrum Sensing, Spectrum Decision, Spectrum Sharing, and Spectrum Mobility. Various approaches have been proposed to improve Quality of Service (QoS) provisioning in CRNs within fluctuating spectrum availability. However, CRN implementation poses many technical challenges due to a sporadic usage of licensed spectrum bands, which will be increased after deploying CRNs. Unlike traditional surveys of CRNs, this paper addresses QoS provisioning approaches of CRN components and provides an up-to-date comprehensive survey of the recent improvement in these approaches. Major features of the open research challenges of each approach are investigated. Due to the extensive nature of the topic, this paper is the first part of the survey which investigates QoS approaches on spectrum sensing and decision components respectively. The remaining approaches of spectrum sharing and mobility components will be investigated in the next part

    Identification as a deterrent for security enhancement in cognitive radio networks

    Get PDF
    Cognitive Radio Networks (CRNs) are prone to emerging coexistence security threats such as Primary User Emulation Attack (PUEA). Specifically, a malicious CRN may mimic licensees’ (Primary Users (PUs)) signal characteristics to force another CRN to vacate its channels thinking that PUs have returned. While existing schemes are promising to some extent on detecting PUEAs, they are not able to prevent the attacks. In this article, we propose a PUEA Deterrent (PUED) algorithm that can provide PUEAs' commission details: offender CRNs and attacks’ time and bandwidth. There are many similarities between PUED and Closed-Circuit Television (CCTV) in terms of: deterrence strategy, reason for use, surveillance characteristics, surveillance outcome, and operation site. According to the criminology literature, robust CCTV systems have shown a significant reduction in visible offences (e.g. vehicle theft), reducing crime rates by 80%. Similarly, PUED will contribute the same effectiveness in deterring PUEAs. Furthermore, providing PUEAs’ details will prevent the network’s cognitive engine from considering the attacks as real PUs, consequently avoiding devising unreliable spectrum models for the attacked channels. Extensive simulations show the effectiveness of the PUED algorithm in terms of improving CRNs’ performance

    On the relation between hyperrings and fuzzy rings

    Get PDF
    We construct a full embedding of the category of hyperfields into Dress's category of fuzzy rings and explicitly characterize the essential image --- it fails to be essentially surjective in a very minor way. This embedding provides an identification of Baker's theory of matroids over hyperfields with Dress's theory of matroids over fuzzy rings (provided one restricts to those fuzzy rings in the essential image). The embedding functor extends from hyperfields to hyperrings, and we study this extension in detail. We also analyze the relation between hyperfields and Baker's partial demifields

    Molecular Theory of Hydrophobic Effects: ``She is too mean to have her name repeated.''

    Get PDF
    This paper reviews the molecular theory of hydrophobic effects relevant to biomolecular structure and assembly in aqueous solution. Recent progress has resulted in simple, validated molecular statistical thermodynamic theories and clarification of confusing theories of decades ago. Current work is resolving effects of wider variations of thermodynamic state, e.g. pressure denaturation of soluble proteins, and more exotic questions such as effects of surface chemistry in treating stability of macromolecular structures in aqueous solutionComment: submitted to Ann. Rev. Phys. Chem., 31 pages, 245 references, 2 figure

    XSleepNet: Multi-View Sequential Model for Automatic Sleep Staging

    Get PDF
    Automating sleep staging is vital to scale up sleep assessment and diagnosis to serve millions experiencing sleep deprivation and disorders and enable longitudinal sleep monitoring in home environments. This work proposes a sequence-to-sequence sleep staging model, XSleepNet, that is capable of learning a joint representation from both raw signals and time-frequency images. Since different views may generalize or overfit at different rates, the proposed network is trained such that the learning pace on each view is adapted based on their generalization/overfitting behavior. As a result, the network is able to retain the representation power of different views in the joint features which represent the underlying distribution better than those learned by each individual view alone. Furthermore, the XSleepNet architecture is principally designed to gain robustness to the amount of training data and to increase the complementarity between the input views. Experimental results on five databases of different sizes show that XSleepNet consistently outperforms the single-view baselines and the multi-view baseline with a simple fusion strategy. Finally, XSleepNet also outperforms prior sleep staging methods and improves previous state-of-the-art results on the experimental databases

    Improving GANs for Speech Enhancement

    Get PDF
    Generative adversarial networks (GAN) have recently been shown to be efficient for speech enhancement. However, most, if not all, existing speech enhancement GANs (SEGAN) make use of a single generator to perform one-stage enhancement mapping. In this work, we propose to use multiple generators that are chained to perform multi-stage enhancement mapping, which gradually refines the noisy input signals in a stage-wise fashion. Furthermore, we study two scenarios: (1) the generators share their parameters and (2) the generators' parameters are independent. The former constrains the generators to learn a common mapping that is iteratively applied at all enhancement stages and results in a small model footprint. On the contrary, the latter allows the generators to flexibly learn different enhancement mappings at different stages of the network at the cost of an increased model size. We demonstrate that the proposed multi-stage enhancement approach outperforms the one-stage SEGAN baseline, where the independent generators lead to more favorable results than the tied generators. The source code is available at http://github.com/pquochuy/idsegan.Comment: This letter has been accepted for publication in IEEE Signal Processing Letter

    Towards More Accurate Automatic Sleep Staging via Deep Transfer Learning.

    Get PDF
    BACKGROUND: Despite recent significant progress in the development of automatic sleep staging methods, building a good model still remains a big challenge for sleep studies with a small cohort due to the data-variability and data-inefficiency issues. This work presents a deep transfer learning approach to overcome these issues and enable transferring knowledge from a large dataset to a small cohort for automatic sleep staging. METHODS: We start from a generic end-to-end deep learning framework for sequence-to-sequence sleep staging and derive two networks as the means for transfer learning. The networks are first trained in the source domain (i.e. the large database). The pretrained networks are then finetuned in the target domain (i.e. the small cohort) to complete knowledge transfer. We employ the Montreal Archive of Sleep Studies (MASS) database consisting of 200 subjects as the source domain and study deep transfer learning on three different target domains: the Sleep Cassette subset and the Sleep Telemetry subset of the Sleep-EDF Expanded database, and the Surrey-cEEGrid database. The target domains are purposely adopted to cover different degrees of data mismatch to the source domains. RESULTS: Our experimental results show significant performance improvement on automatic sleep staging on the target domains achieved with the proposed deep transfer learning approach. CONCLUSIONS: These results suggest the efficacy of the proposed approach in addressing the above-mentioned data-variability and data-inefficiency issues. SIGNIFICANCE: As a consequence, it would enable one to improve the quality of automatic sleep staging models when the amount of data is relatively small

    Personalized automatic sleep staging with single-night data: a pilot study with Kullback-Leibler divergence regularization.

    Get PDF
    OBJECTIVE: Brain waves vary between people. This work aims to improve automatic sleep staging for longitudinal sleep monitoring via personalization of algorithms based on individual characteristics extracted from sleep data recorded during the first night. APPROACH: As data from a single night are very small, thereby making model training difficult, we propose a Kullback-Leibler (KL) divergence regularized transfer learning approach to address this problem. We employ the pretrained SeqSleepNet (i.e. the subject independent model) as a starting point and finetune it with the single-night personalization data to derive the personalized model. This is done by adding the KL divergence between the output of the subject independent model and it of the personalized model to the loss function during finetuning. In effect, KL-divergence regularization prevents the personalized model from overfitting to the single-night data and straying too far away from the subject independent model. MAIN RESULTS: Experimental results on the Sleep-EDF Expanded database consisting of 75 subjects show that sleep staging personalization with single-night data is possible with help of the proposed KL-divergence regularization. On average, we achieve a personalized sleep staging accuracy of 79.6%, a Cohen's kappa of 0.706, a macro F1-score of 73.0%, a sensitivity of 71.8%, and a specificity of 94.2%. SIGNIFICANCE: We find both that the approach is robust against overfitting and that it improves the accuracy by 4.5 percentage points compared to the baseline method without personalization and 2.2 percentage points compared to it with personalization but without regularization
    • …
    corecore