No abstract

No abstract

This study demonstrates some new aspects of preboundary lengthening and preaccentual shortening on a test word banana in American English. Preboundary lengthening was found to be extended to the initial unstressed syllable beyond the main-stressed syllable, presenting more complexity than has previously been assumed. Preaccentual shortening was observed regardless of boundary strength or the stress pattern (trochaic vs iambic) of the following context word, suggesting that it operates globally at an utterance level. The locus of preaccentual shortening, however, was modulated by prosodic boundary: It is realized on the final vowel IP-finally but on the non-final stressed vowel IP-medially.

The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, the variants of the ACD problem based on Chinese remainder theorem (CRT) are being used in the constructions of a batch fully homomorphic encryption to encrypt multiple messages in one ciphertext. Despite the utility of the CRT-variant scheme, the algorithms that secures its security foundation have not been probed well enough.In this paper, we propose two algorithms and the results of experiments in which the proposed algorithms were used to solve the variant problem. Both algorithms take the same time complexity $\begin{array}{} \displaystyle 2^{\tilde{O}(\frac{\gamma}{(\eta-\rho)^2})} \end{array}$ up to a polynomial factor to solve the variant problem for the bit size of samples γ, secret primes η, and error bound ρ. Our algorithm gives the first parameter condition related to η and γ size. From the results of the experiments, it has been proved that the proposed algorithms work well both in theoretical and experimental terms.

Theoretical interest in the relation between speech production and perception has led to research on whether individual speaker-listeners' production patterns are linked to the information they attend to in perception. However, for prosodic structure, the productionperception relation has received little attention. This dissertation investigates the hypothesis

This study investigates individual differences in the weighting of phonetic properties in the production of prosodic boundaries in American English. The motivation of the study is to inform understanding of individual speaker variation and its accommodation in the representation of prosodic structure. In an acoustic study, 32 speakers produced 16 sentence pairs differing in type of boundary (Intonational Phrase (IP) boundary vs. Word boundary). Pause duration, phrase-final lengthening (three syllables before the boundary), phrase-initial lengthening (one syllable after the boundary), and pitch reset were examined. The results showed substantial individual differences in (1) which segmental and suprasegmental properties speakers phonetically modulated to produce IP boundaries, and (2) the scope and the degree of such modulations.

No abstract

We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.