Thesis (Ph. D.)--University of Missouri-Columbia, 1998. / Typescript. Vita. Includes bibliographical references (leaves 216-229). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1998. / Typescript. Vita. Includes bibliographical references (leaves 216-229). Also available on the Internet.

Thesis (M.S.)--OGI School of Science & Engineering at OHSU, Oct. 2005. / Includes bibliographical references (leave 22).

Thesis (M.Eng.)--Memorial University of Newfoundland, 2003. / Bibliography: leaves 71-74. Also available online.

Thesis (Ph. D.)--University of Rhode Island, 2006. / Includes bibliographical references (leaves 99-100).

No description available.

The remember-know paradigm is widely used in recognition memory research to explore the mechanisms underlying recognition judgments. The most intriguing question about the paradigm that needs to be answered is: Are the processes that underlie “remember” and “know” responses the same or different? The extant remember-know models provide different answers. The dual-process model (Yonelinas, 1994) assumes that “remember” and “know” judgments are made with qualitatively different underlying processes. The one-dimensional Signal Detection Theory (SDT) model (Donaldson, 1996; Hirshman & Master, 1997) and the Sum-difference Theory of Remembering and Knowing (STREAK) model assume that “remember” and “know” judgments are made with same underlying processes but different response criteria. In this thesis, three experiments were conducted to evaluate these models. The remember-know models were fit to the accuracy data to see which model provides the best account for the ROC data. In addition, the reaction time data were fit with ex-Gaussian distributions and the best-fit skew parameters were used to reveal whether the underlying strategic processes for “remember” and “know” judgments are same or not. The results of the remember-know model fit were mixed: In the first experiment with list length manipulation, 6 out of 8 cases were best fit with the one-dimensional models and the other 2 cases were best fit with the dual-process models; in the second experiment with list strength manipulation, 11 out of 18 cases were best fit with the one-dimensional models, another 6 cases were best fit with the dual-process models and the rest one case were best fit with the STREAK model; in the third experiment with response bias manipulation, 6 out of 16 cases were best fit with the one-dimensional models and the other 10 cases were best fit with the dual-process models. The results of ex-Gaussian fit to RT data supported the one-dimensional model better: for the subjects who provide enough overlapping data in comparison of the distributions of hits followed by “remember” and “know” judgments, the values of skew parameter did not differ for “remember” and “know” responses in 7 out of 8 cases. This indicates that the same process underlies “remember” and “know” responses.

Yes / Probability density function (PDF) control strategy investigates the controller design approaches where the random variables for the stochastic processes were adjusted to follow the desirable distributions. In other words, the shape of the system PDF can be regulated by controller design.Different from the existing stochastic optimization and control methods, the most important problem of PDF control is to establish the evolution of the PDF expressions of the system variables. Once the relationship between the control input and the output PDF is formulated, the control objective can be described as obtaining the control input signals which would adjust the system output PDFs to follow the pre-specified target PDFs. Motivated by the development of data-driven control and the state of the art PDF-based applications, this paper summarizes the recent research results of the PDF control while the controller design approaches can be categorized into three groups: (1) system model-based direct evolution PDF control; (2) model-based distribution-transformation PDF control methods and (3) data-based PDF control. In addition, minimum entropy control, PDF-based filter design, fault diagnosis and probabilistic decoupling design are also introduced briefly as extended applications in theory sense. / De Montfort University - DMU HEIF’18 project, Natural Science Foundation of Shanxi Province [grant number 201701D221112], National Natural Science Foundation of China [grant numbers 61503271 and 61603136]

Orientadores: Lee Luan Ling, Fábio Violaro / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-19T05:40:32Z (GMT). No. of bitstreams: 1 GonzalezGonzalez_DianaCristina_M.pdf: 2589944 bytes, checksum: ddbbbef6076eb402f4abe638ebcd232b (MD5) Previous issue date: 2011 / Resumo: Esta dissertação apresenta a implementação de um sistema de Reconhecimento Automático de Locutor (ASR). Este sistema emprega um novo parâmetro de características de locutor baseado no modelo multifractal "VVGM" (Variable Variance Gaussian Multiplier). A metodologia adotada para o desenvolvimento deste sistema foi formulada em duas etapas. Inicialmente foi implementado um sistema ASR tradicional, usando como vetor de características os MFCCs (Mel-Frequency Cepstral Coefficients) e modelo de mistura gaussiana (GMM) como classificador, uma vez que é uma configuração clássica, adotada como referência na literatura. Este procedimento permite ter um conhecimento amplo sobre a produção de sinais de voz, além de um sistema de referência para comparar o desempenho do novo parâmetro VVGM. A segunda etapa foi dedicada ao estudo de processos multifractais em sinais de fala, já que eles enfatizam-se na análise das informações contidas nas partes não estacionárias do sinal avaliado. Aproveitando essa característica, sinais de fala são modelados usando o modelo VVGM. Este modelo é baseado no processo de cascata multiplicativa binomial, e usa as variâncias dos multiplicadores de cada estágio como um novo vetor de característica. As informações obtidas pelos dois métodos são diferentes e complementares. Portanto, é interessante combinar os parâmetros clássicos com os parâmetros multifractais, a fim de melhorar o desempenho dos sistemas de reconhecimento de locutor. Os sistemas propostos foram avaliados por meio de três bases de dados de fala com diferentes configurações, tais como taxas de amostragem, número de falantes e frases e duração do treinamento e teste. Estas diferentes configurações permitem determinar as características do sinal de fala requeridas pelo sistema. Do resultado dos experimentos foi observado que o sistema de identificação de locutor usando os parâmetros VVGM alcançou taxas de acerto significativas, o que mostra que este modelo multifractal contém informações relevantes sobre a identidade de cada locutor. Por exemplo, a segunda base de dados é composta de sinais de fala de 71 locutores (50 homens e 21 mulheres) digitalizados a 22,05 kHz com 16 bits/amostra. O treinamento foi feito com 20 frases para cada locutor, com uma duração total de cerca de 70 s. Avaliando o sistema ASR baseado em VVGM, com locuções de teste de 3 s de comprimento, foi obtida uma taxa de reconhecimento de 91,30%. Usando estas mesmas condições, o sistema ASR baseado em MFCCs atingiu uma taxa de reconhecimento de 98,76%. No entanto, quando os dois parâmetros foram combinados, a taxa de reconhecimento aumentou para 99,43%, mostrando que a nova característica acrescenta informações importantes para o sistema de reconhecimento de locutor / Abstract: This dissertation presents an Automatic Speaker Recognition (ASR) system, which employs a new parameter based on the ¿VVGM? (Variable Variance Gaussian Multiplier) multifractal model. The methodology adopted for the development of this system is formulated in two stages. Initially, a traditional ASR system was implemented, based on the use of Mel-Frequency Cepstral Coefficients (MFCCs) and the Gaussian mixture models (GMMs) as the classifier, since it is the method with the best results in the literature. This procedure allows having a broad knowledge about the production of speech signals and a reference system to compare the performance of the new VVGM parameter. The second stage was dedicated to the study of the multifractal processes for speech signals, given that with them, it is possible to analyze information contained in non-stationary parts of the evaluated signal. Taking advantage of this characteristic, speech signals are modeled using the VVGM model, which is based on the binomial multiplicative cascade process, and uses the variances of multipliers for each state as a new speech feature. The information obtained by the two methods is different and complementary. Therefore, it is interesting to combine the classic parameters with the multifractal parameters in order to improve the performance of speaker recognition systems. The proposed systems were evaluated using three databases with different settings, such as sampling rates, number of speakers and phrases, duration of training and testing. These different configurations allow the determination of characteristics of the speech signal required by the system. With the experiments, the speaker identification system based on the VVGM parameters achieved significant success rates, which shows that this multifractal model contains relevant information of the identity of each speaker. For example, the second database is composed of speech signals of 71 speakers (50 men and 21 women) digitized at 22.05 kHz with 16 bits/sample. The training was done with 20 phrases for each speaker, with an approximately total duration of 70 s. Evaluating the ASR system based on VVGM, with this database and using test locutions with 3s of duration, it was obtained a recognition rate of 91.3%. Using these same conditions, the ASR system based on MFCCs reached a recognition rate of 98.76%. However, when the two parameters are combined, the recognition rate increased to 99.43%, showing that the new feature adds substantial information to the speaker recognition system / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Thesis (PhD)--Stellenbosch University, 2012. / ENGLISH ABSTRACT: Various properties of integer partitions are studied in this work, in particular the number of summands, the number of ascents and the multiplicities of parts. We work on random partitions, where all partitions from a certain family are equally likely, and determine moments and limiting distributions of the different parameters. The thesis focuses on three main problems: the first of these problems is concerned with the length of prime partitions (i.e., partitions whose parts are all prime numbers), in particular restricted partitions (i.e., partitions where all parts are distinct). We prove a central limit theorem for this parameter and obtain very precise asymptotic formulas for the mean and variance. The second main focus is on the distribution of the number of parts of a given multiplicity, where we obtain a very interesting phase transition from a Gaussian distribution to a Poisson distribution and further to a degenerate distribution, not only in the classical case, but in the more general context of ⋋-partitions: partitions where all the summands have to be elements of a given sequence ⋋ of integers. Finally, we look into another phase transition from restricted to unrestricted partitions (and from Gaussian to Gumbel-distribution) as we study the number of summands in partitions with bounded multiplicities. / AFRIKAANSE OPSOMMING: Verskillende eienskappe van heelgetal-partisies word in hierdie tesis bestudeer, in die besonder die aantal terme, die aantal stygings en die veelvoudighede van terme. Ons werk met stogastiese partisies, waar al die partisies in ’n sekere familie ewekansig is, en ons bepaal momente en limietverdelings van die verskillende parameters. Die teses fokusseer op drie hoofprobleme: die eerste van hierdie probleme gaan oor die lengte van priemgetal-partisies (d.w.s., partisies waar al die terme priemgetalle is), in die besonder beperkte partisies (d.w.s., partisies waar al die terme verskillend is). Ons bewys ’n sentrale limietstelling vir hierdie parameter en verkry baie presiese asimptotiese formules vir die gemiddelde en die variansie. Die tweede hooffokus is op die verdeling van die aantal terme van ’n gegewe veelvoudigheid, waar ons ’n baie interessante fase-oorgang van ’n normaalverdeling na ’n Poisson-verdeling en verder na ’n ontaarde verdeling verkry, nie net in die klassieke geval nie, maar ook in die meer algemene konteks van sogenaamde ⋋-partities: partisies waar al die terme elemente van ’n gegewe ry ⋋ van heelgetalle moet wees.