289,186 research outputs found
Joshua Davis: Author of Spare Parts
No full textCitation: 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
Steven Johnson Author Talk Poster
No full textK-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
k-fold cyclotomy and its application to frequency-hopping sequences
No full textFor an integer k ??? 1, let qi, 1 ??? I ??? k, be prime powers such that qi=Mi f + 1 for some integers M i and f. In this paper, the k -fold cyclotomy of double-struck F signq1 ?? ⋯ ?? double-struck F signqk as a nontrivial generalization of the conventional cyclotomy ( k=1 case) and its application to frequency-hopping sequences (FHSs) are presented, where double-struck F signq is the finite field with q elements. First, the definitions of k -fold cyclotomic classes and k-fold cyclotomic numbers are given. And then, their basic properties including k -fold diagonal sums are derived. Based on them, new optimal FHS sets of length N and frequency set size M or M+1 with respect to the Peng-Fan bound are constructed for a product N of distinct odd primes and a divisor M of N-1. Furthermore, new optimal FHSs of length N and frequency set size M with respect to the LempelGreenberger bound are constructed when N has at least one prime factor which is 3 modulo 4 and (N-1)/M is an even integer. Our constructions give several new optimal parameters not covered in the literature, which are summarized in Table I.clos
On the k-error linear complexity of p(m)-periodic binary sequences
No full textIn this correspondence, we study the statistical stability properties of p(m)-periodic binary sequences in terms of their linear complexity and k-error linear complexity, where 1) is a prime number and 2 is a primitive root modulo p(2). We show that their linear complexity and k-error linear complexity take a value only from some specific ranges. We then present the minimum value k for which the k-error linear complexity is strictly less than the linear complexity in a new viewpoint different from the approach by Meidl. We also derive the distribution of p(m)-periodic binary sequences with specific k-error linear complexity. Finally, we get an explicit formula for the expectation value of the k-error linear complexity and give its lower and upper bounds, when k <= [p/2].X1110sciescopu
New families of frequency-hopping sequences of length mN derived from the k-fold cyclotomy
No full textLet N = p(1) ... p(k) where p(i), 1 = 2. We also present near-optimal FHS sets with length mN and frequency set size (N - 1)/f + 1 for any integer in with 2 <= m <= M(1). The FHS sets constructed in this paper have new parameters not covered in the literature.11sciescopu
Performance of Multihop Wireless Links over Generalized-K Fading Channels
No full textThe performance of multihop links is studied in this contribution by both analysis and simulations, when communicating over Generalized-K (KG ) fading channels. The performance metrics considered include symbol error rate (SER), outage probability, level crossing rate (LCR) and average outage duration (AOD). First, the expressions for both the SER and outage probability are derived by approximating the probability density function (PDF) of the end-to-end signal-to-noise ratio (SNR) using an equivalent end-to-end PDF. We show that this equivalent end-to-end PDF is accurate for analyzing the outage probability. Then, the second-order statistics of LCR and AOD of multihop links are analyzed. Finally, the performance of multihop links is investigated either by simulations or by evaluation of the expressions derived. Our performance results show that the analytical expressions obtained can be well justified by the simulation results. The studies show that the KG channel model as well as the expressions derived in this paper are highly efficient for predicting the various types of performance metrics and statistics for design of multihop communication links
Optimal Frequency-Hopping Sequences With New Parameters
No full textA frequency-hopping sequence (FHS) of length and frequency set size M is called a (v, M, lambda)-FHS if its maximum out-of-phase Hamming autocorrelation is lambda. Three new classes of optimal FHSs with respect to the Lempel-Greenberger bound are presented in this paper. First, new optimal (p, M, f)-FHSs are constructed when p = Mf + 1 is an odd prime such that f is even and p 3 mod 4. And then, a construction for optimal (kp, p, k)-FHSs is given for any odd prime p and a positive integer k = 3 and any integer v with N + 1 = 3. These classes of optimal FHSs have new parameters which are not covered in the literature.X114038sciescopu
Asymptotically optimal optical orthogonal codes with new parameters
No full textOptical orthogonal codes (OOCs) are widely used as spreading codes in optical fiber networks. An (N,w,??a,?? c)-OOC with size L is a family of L{0,1}-sequences with length N, weight w, maximum autocorrelation ??a, and maximum cross correlation ??c. In this paper, we present two new constructions for OOCs with ??a=??c=1 which are asymptotically optimal with respect to the Johnson bound. We first construct an asymptotically optimal left(Mp^{n},M,1,1)-OOC with size (pn-1)/M by using the structure of Zpn, the ring of integers modulo pn, where p is an odd prime with M p-1, and N is a positive integer. We then present another asymptotically optimal (Mp1 pk, M, 1,1)-OOC with size (p1p k-1)/M from a product of k finite fields, where pi is an odd prime and M is a positive integer such that M ,pi-1 for 1??? i???k. In particular, it is optimal in the case that k=1 and (M-1)2 > p1-1.close
New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques
No full textIn this paper we construct new classes of optimal frequency-hopping sequences (FHSs) with respect to the Lempel-Greenberger bound and the Peng-Fan bound by interleaving techniques which are used to construct a sequence of length kN from k sequences of length N. We first give two generic constructions for optimal FHS sets from some known optimal FHS sets by interleaving techniques and present some examples of new optimal FHS sets. We then design new optimal FHSs whose parameters include those of the known optimal constructions with length kN and frequency set size N for some positive integers k and N. We also construct optimal FHS sets of length kp from power-residue sequences for any odd prime p and 2 <= k < p. In particular, our constructions give several new parameters not covered in the literature, which are summarized in Tables I and II.X115055sciescopu
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe 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
- …
