5,060 research outputs found

    Improved Design of Wireless Electrical Energy Transfer System for Various Power Applications

    Get PDF
    This thesis introduces a state-of-the-art review of existing wireless power transfer (WPT) technologies with a detailed comparison and presents the limitations of the inductive power transfer system through simulation and practical analyses. This thesis also presents the expanded use of the high-frequency analysis tool, known as FEKO, and the novel application of frequency response analyser (FRA) with various simulations and practical demonstrations for enhancing the design and maintenance of WPT systems

    Simultaneous dual-frequency radio observations of S5 0716+714: A search for intraday variability with the Korean VLBI Network

    Full text link
    This study aims to search for the existence of intraday variability (IDV) of BL Lac object S5 0716+714 at high radio frequencies for which the interstellar scintillation effect is not significant. Using the 21-meter radio telescope of the Korean VLBI Network (KVN), we present results of multi-epoch simultaneous dual-frequency radio observations. Single-dish observations of S5 0716+714 were simultaneously conducted at 21.7 GHz (K-band) and 42.4 GHz (Q-band), with a high cadence of 30-60 minute intervals.We observed four epochs between December 2009 and June 2010. Over the whole set of observation epochs, S5 0716+714 showed significant inter-month variations in flux density at both the K- and Q-bands, with modulation indices of approximately 19% for the K-band and approximately 36% for the Q-band. In all epochs, no clear intraday variability was detected at either frequency. The source shows monotonic flux density increase in epochs 1 and 3 and monotonic flux density decrease in epochs 2 and 4. In the flux density increasing phases, the flux densities at the Q-band increase more rapidly. In the decreasing phase, no significant flux density difference is seen at the two frequencies. The situation could be different close to flux density peaks that we did not witness in our observations. We find an inverted spectrum with mean spectral indices of -0.57+-0.13 in epoch 1 and -0.15+-0.11 in epoch 3. On the other hand, we find relatively steep indices of +0.24+-0.14 and +0.17+-0.18 in epochs 2 and 4, respectively. We conclude that the frequency dependence of the variability and the change of the spectral index are caused by source-intrinsic effects rather than by any extrinsic scintillation effect.Comment: 6 pages and 4 figures and 4 table

    Interoperable Summary Description Model Using Dublin Core

    Get PDF
    This paper proposes an interoperable metadata model generating summary description for multimedia content using Dublin Core (DC). The motive is based on the fundamental concepts such as (1) Description information about the multimedia content is essential in multimedia content access, search and retrieval process (2) the existing metadata are too complicated to use in applications such as e-cataloguing and browsing of e-commerce. As an approach to solve the problem, summary description that may be optimally minimal descriptive elements set derived from existing metadata schemes (full descriptions) is described in this paper. The proposed summary description generator model is achieved using thesaurus approach built on the basis of DC and any existing various metadata schemes

    Low-complexity dynamic resource scheduling for downlink MC-NOMA over fading channels

    Full text link
    In this paper, we investigate dynamic resource scheduling (i.e., joint user, subchannel, and power scheduling) for downlink multi-channel non-orthogonal multiple access (MC-NOMA) systems over time-varying fading channels. Specifically, we address the weighted average sum rate maximization problem with quality-of-service (QoS) constraints. In particular, to facilitate fast resource scheduling, we focus on developing a very low-complexity algorithm. To this end, by leveraging Lagrangian duality and the stochastic optimization theory, we first develop an opportunistic MC-NOMA scheduling algorithm whereby the original problem is decomposed into a series of subproblems, one for each time slot. Accordingly, resource scheduling works in an online manner by solving one subproblem per time slot, making it more applicable to practical systems. Then, we further develop a heuristic joint subchannel assignment and power allocation (Joint-SAPA) algorithm with very low computational complexity, called Joint-SAPA-LCC, that solves each subproblem. Finally, through simulation, we show that our Joint-SAPA-LCC algorithm provides good performance comparable to the existing Joint-SAPA algorithms despite requiring much lower computational complexity. We also demonstrate that our opportunistic MC-NOMA scheduling algorithm in which the Joint-SAPA-LCC algorithm is embedded works well while satisfying given QoS requirements.Comment: 39 pages, 11 figure

    Low-complexity joint user and power scheduling in downlink NOMA over fading channels

    Full text link
    Non-orthogonal multiple access (NOMA) has been considered one of the most promising radio access techniques for next-generation cellular networks. In this paper, we study the joint user and power scheduling for downlink NOMA over fading channels. Specifically, we focus on a stochastic optimization problem to maximize the weighted average sum rate while ensuring given minimum average data rates of users. To address this problem, we first develop an opportunistic user and power scheduling algorithm (OUPS) based on the duality and stochastic optimization theory. By OUPS, the stochastic problem is transformed into a series of deterministic ones for the instantaneous weighted sum rate maximization for each slot. Thus, we additionally develop a heuristic algorithm with very low computational complexity, called user selection and power allocation algorithm (USPA), for the instantaneous weighted sum rate maximization problem. Via simulation results, we demonstrate that USPA provides near-optimal performance with very low computational complexity, and OUPS well guarantees given minimum average data rates.Comment: 7 pages, 5 figure
    corecore