98,934 research outputs found

    Multi-Stage Multi-User Detection Assisted Asynchronous Fast-FH/MFSK

    No full text
    A multi-stage Multi-User Detection (MUD) scheme designed for asynchronous fast Frequency-Hopping/Multilevel Frequency-Shift-Keying (fast-FH/MFSK) systems is proposed, in which each signal detection interval is divided into sub-intervals and the MUD is applied to each sub-interval. In our scheme the MUD exploits the explicit knowledge of the hopping addresses assigned to users. The received signal level is attenuated by a constant scaling factor, when it is deemed to be overwhelmed by multi-user interference. For the sake of preventing erroneous detection events, when communicating over frequency-selective fading channels, the scheme advocated also invokes a space diversity technique. In the investigated scenario the achievable Bit Error Rate (BER) of the proposed scheme was reduced by as much as an order of magnitude in comparison to that of a conventional MUD scheme, when transmitting over an AWGN channel. For transmission over a channel exhibiting uncorrelated frequency-domain fading, selection diversity was used for the sake of achieving a reduced BER

    Joshua Davis: Author of Spare Parts

    No full text
    Citation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University

    Time-Frequency Spread OFDM/FHMA

    No full text
    A combined scheme based on Orthogonal Frequency-Division Multiplexing and Frequency-Hopped Multiple Access (OFDM/FHMA) is proposed, in which the transmitted data is spread over both the time and frequency axes without expanding the bandwidth. The OFDM system advocated employs the Walsh-Hadamard Transform (WHT) for spreading the data in the frequency domain and weights the received signal by the estimated Signal-to-Interference Ratio (SIR) for the sake of reducing the effects of interference. The performance recorded, when communicating over an interference-limited channel suggests that the achievable BER improvement is as much as an order of magnitude in comparison to that of an OFDM/FHMA scheme dispensing with WHT

    Steven Johnson Author Talk Poster

    No full text
    K-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book

    On the performance of Multi-Stage Multi-User Detection Assisted Fast-FH/MFSK

    No full text
    A multi-stage Multi-User Detection (MUD) scheme designed for a fast Frequency-Hopping/Multilevel Frequency-Shift-Keying (fast-FH/MFSK) system is proposed, which exploits the explicit knowledge of the hopping addresses assigned to users. The received signal level is attenuated by a constant scaling factor, when it is deemed to be overwhelmed by multi-user interference. For the sake of preventing erroneous detection events, when communicating over frequency-selective fading channels, the scheme advocated invokes a variable detection threshold parameter. In the investigated scenario the achievable Bit Error Rate (BER) of the proposed scheme was reduced by as much as an order of magnitude in comparison to that of a Single-User Detection (SUD) scheme when transmitting over an AWGN channel. For transmission over a channel exhibiting uncorrelated frequency-domain fading, a variable – rather than fixed – threshold was used for the sake of achieving reduced BER

    Multi-Stage Multi-User Detection Assisted Fast-FH/MFSK

    No full text
    A multi-stage multi-user detection (MUD) scheme designed for a fast-FH/MFSK system is proposed, in which the received signal level is attenuated by a constant scaling factor when the signal is deemed to be overwhelmed by multi-user interference. In the investigated scenario a substantially reduced bit error rate is achieved

    Going Beyond Counting First Authors in Author Co-citation Analysis

    No full text
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Appropriate Similarity Measures for Author Cocitation Analysis

    No full text
    We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis

    Expanding “Communities and Collections” in the K-State Research Exchange (K-REx) to benefit the K-State Community and Beyond

    No full text
    Kansas State University has used its institutional repository, the K-State Research Exchange (K-REx), to store and share its first year experience program, K-State First, and notably its common reading program, K-State First Book. We have done so with the aim that the accessibility and preservation of these documents ensures program stability, promotes engagement with first year programming, and provides the ability to foster growth,educational opportunities, and community building outside of K-State. Moving away from research concentrated repositories and taking a more holistic approach to scholarship, especially when realizing the pedagogical significance of collaborative campus programming, institutions can showcase, discover, preserve, and grow programs that shape campus communities and engagement. This session will provide an overview of K-REx and spotlight the digital archive of the university’s first year experience program and common reading program, K-State First Book. We will discuss the benefits and challenges to expanding the purview of your repositories. We talkthrough the types of materials we decide to host in our repository and why we share what we do. We will also provide recommendations on new ways to evaluate what belongs in institutional repositories and how this diversity can benefit your program, your institution, the community, and others

    Ready Player One Program Event Poster

    No full text
    K-State Book NetworkA poster advertising an author talk by Ernest Cline at Kansas State University on October 10, 2013. Ernest Cline's book "Ready Player One" was selected as the 2013-2014 common book
    corecore