Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"random permutation"”.

  1. The spectrum of random permutation matrices

    … establish the limit laws of linear statistics of random permutation matrices. In the second part, we show Central Limit theorems for the characteristic polynomial of random permutation matrices and multiplicative class functions. A third part contains some natural extensions of the techniques of …

    zurich

  2. Random Permutation Codes: Lossless Source Coding of Non-Sequential Data

    … formal definition for non-sequential objects as random sets of equivalent sequences, which we refer to as \emph{Combinatorial Random Variables} (CRVs). The definition of equivalence, formalized as an equivalence relation, establishes the non-sequential data type represented by the CRV. The …

    toronto-retro Repository record for Random Permutation Codes: Lossless Source Coding of Non-Sequential Data (opens in a new tab)

  3. Random Permutation Testing Applied to Measurement Invariance with Dichotomous and Likert-type Indicator Variables

    … present research was to introduce and evaluate random permutation testing applied to measurement invariance testing with ordered-categorical data. The random permutation test builds a reference distribution from the observed data that is used to calculate a p-value for the observed chi-square …

    ku Repository record for Random Permutation Testing Applied to Measurement Invariance with Dichotomous and Likert-type Indicator Variables (opens in a new tab)

  4. Comparing vector-based and ACT-R memory models using large-scale datasets: User-customized hashtag and tag prediction on Twitter and StackOverflow

    … chosen tags: an ACT-R based Bayesian model and a random permutation vector-based model. Millions of posts and tweets were collected, and both declarative memory models were used to predict Twitter hashtags and StackOverflow tags. The results show that past user behavior of tag use is a strong …

    rice Repository record for Comparing vector-based and ACT-R memory models using large-scale datasets: User-customized hashtag and tag prediction on Twitter and StackOverflow (opens in a new tab)

  5. Thresholds for patterns in random compositions and random permutations

    We explore how the asymptotic structure of a random permutation of [n] with minversions evolves, as m increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. Our investigation beginswith exploring how the asymptotic structure of a …

    strathclyde Repository record for Thresholds for patterns in random compositions and random permutations (opens in a new tab)

  6. Essays in Problems in Sequential Decisions and Large-Scale Randomized Algorithms

    … selection of a monotone subsequence from a random permutation. We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length $n$. The second problem we consider deals with the multiplicative …

    penn Repository record for Essays in Problems in Sequential Decisions and Large-Scale Randomized Algorithms (opens in a new tab)

  7. The Expected Number of Patterns in a Random Generated Permutation on [n] = {1,2,...,n}

    … n. In this thesis, we will extend this work to permutations, focusing on the maximum number of distinct permutations contained in a permutation on [n] = {1,2,...,n} and on the expected number of distinct permutations contained in a random permutation on [n]. We further considered the problem …

    etsu Repository record for The Expected Number of Patterns in a Random Generated Permutation on [n] = {1,2,...,n} (opens in a new tab) Download PDF for The Expected Number of Patterns in a Random Generated Permutation on [n] = {1,2,...,n} (opens in a new tab)

  8. TESTING THE EQUALITY OF SEVERAL COVARIANCE FUNCTIONS FOR FUNCTIONAL DATA

    … based on Welch-Satterthwaite moment-matching or random permutation are proposed to approximate the null distributions. The asymptotic powers are also investigated and all the tests are shown to be root-n consistent. Intensive simulation studies are conducted to compare the proposed tests with …

    nus Repository record for TESTING THE EQUALITY OF SEVERAL COVARIANCE FUNCTIONS FOR FUNCTIONAL DATA (opens in a new tab) Download file for TESTING THE EQUALITY OF SEVERAL COVARIANCE FUNCTIONS FOR FUNCTIONAL DATA (opens in a new tab)

  9. Atsitiktinių keitinių funkcijų dispersijų įverčiai /

    … The coordinates of the cycle vector of a random permutation are dependent random variables. That is why the variance of a linear statistic is not the sum of its summands’ variances. E. Manstavičius has published some research addressing this problem. His recent paper, published jointly …

    vilnius Repository record for Atsitiktinių keitinių funkcijų dispersijų įverčiai / (opens in a new tab)

  10. Rebuild performance enhancement using onboard caching and delayed vacation termination in clustered raid 5

    … operating in rebuild mode. The Nearly Random Permutation (NRP) layout provides the flexibility to vary the declustering ratio ([alpha]) for a given N, and the Vacationing Server Model (VSM) of processing the rebuild requests provides acceptable rebuild and user response times. The …

    njit Repository record for Rebuild performance enhancement using onboard caching and delayed vacation termination in clustered raid 5 (opens in a new tab)

  11. Asymptotic Distributions for Block Statistics on Non-crossing Partitions

    … literature on the asymptotic cycle structures of random permutations. This motivates our study on analogous results regarding the asymptotic block structure of random non-crossing partitions. We first investigate an analogous result of the asymptotic distribution for the total number of cycles of …

    waterloo Repository record for Asymptotic Distributions for Block Statistics on Non-crossing Partitions (opens in a new tab)

  12. Analysis of protein secondary structure via the discrete wavelet transform

    … of each protein, each realization being a random permutation of the proteins amino acid sequence. The realizations are subjected to the same analysis as the parent protein. Our analysis involves examinining the correlation between locations of significant hydrophobicity fluctuations and …

    depaul Repository record for Analysis of protein secondary structure via the discrete wavelet transform (opens in a new tab)

  13. Aspects of the analysis of variance for classifactory data

    … and obtained the expected mean squares under random permutation. These expected mean squares are expressed simply in terms of the quantities (SIGMA) which are defined as certain combinations of the variance components (sigma). The (SIGMA) are easily derived whether or not there is …

    iastate Repository record for Aspects of the analysis of variance for classifactory data (opens in a new tab)

  14. On Large Values of Non-Gaussian Logarithmically Correlated Fields

    <p>Random field models with logarithmic correlation structure appear widely across probability theory and there has been great progress in understanding the large value statistics of many Gaussian (or nearly Gaussian) log-correlated fields in the past decades. Studying the universality and …

    duke Repository record for On Large Values of Non-Gaussian Logarithmically Correlated Fields (opens in a new tab)

  15. Computational history: using semantic models to measure changes in attitudes, values, and beliefs from language

    … model of distributed semantics called the Random Permutation (RP) model that “reads” through a corpus of text and generates a mathematical representation of word meaning (i.e., a vector representation). I used the RP model to generate a vector representation for each word written in each …

    manitoba Repository record for Computational history: using semantic models to measure changes in attitudes, values, and beliefs from language (opens in a new tab)

  16. Statistical evaluation of surrogate markers in randomized clinical trials

    In many randomized clinical trials, the primary endpoints are clinical measurements of disease process. It usually requires an extremely long follow-up period and a considerable sample size to assess the treatment effect on such clinical endpoints. Therefore surrogate markers that can predict the …

    bu Repository record for Statistical evaluation of surrogate markers in randomized clinical trials (opens in a new tab) Embargoed until 2999-01-01

  17. Profiles of Large Combinatorial Structures

    We derive limit laws for random combinatorial structures using singularity analysis of generating functions. We begin with a study of the Boltzmann samplers of Flajolet and collaborators, a useful method for generating large discrete structures at random which is useful both for providing intuition …

    penn Repository record for Profiles of Large Combinatorial Structures (opens in a new tab)

  18. Online algorithms for markets

    … their valuations but their order is a uniformly random permutation. We obtain asymptotically tight worst-case guarantees for both cases, under a competitive analysis benchmark.</p> <p>In the second part, we study the strategic implications that arise from adding one extra option to the miners …

    oxford Repository record for Online algorithms for markets (opens in a new tab)

  19. New results on some quadratic programming problems

    … both a deterministic 2-approximation and also a randomized approximation algorithm. The deterministic algorithm has a complexity exponential in k, while the randomized algorithm runs in O(kmn) time. The second part of this thesis is about portfolio selection under some (hard) realistic setting. …

    uiuc Repository record for New results on some quadratic programming problems (opens in a new tab)

  20. Some combinatorial problems in group theory

    … [0,1]?</p> <p>3. What is the probability that a random permutation π ∈ 𝒮<sub>n</sub> has a fixed set of some predetermined size k? Particularly, how does this probability change as k grows? This problem is also related to the following one. Suppose we πck a few permutations π_1, ..., π_r ∈ …

    oxford Repository record for Some combinatorial problems in group theory (opens in a new tab)

Page 1 of 2