Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each lower priority are deliberately queued whenever the number of servers busy equals or exceeds a given priority-dependent cutoff number. A queued priority i customer enters service the instant the number of servers busy is at most the respective cutoff number of servers minus the number of servers requested (by the customer) and all higher priority queues are empty. In other words the queueing discipline is in a sense HOL by priorities, FCFS within a priority. All servers requested by a customer start service simultaneously; service completion instants are independent. We derive the priority i waiting time distribution (in transform domain) and other system statistics.

Quantum key distribution (QKD) can provide unconditional security based on the fundamental laws of quantum physics. Unfortunately, real-life implementations of a QKD system may contain overlooked imperfections and thus violate the practical security of QKD. It is vital to explore these imperfections. In this thesis, I study two practical imperfections in QKD: i) Discovering security loophole in a commercial QKD system: I perform a proof-of-principle experiment to demonstrate a technically feasible quantum attack on top of a commercial QKD system. The attack I utilize is called phase-remapping attack. ii) Generating high-speed truly random numbers: I propose and experimentally demonstrate an ultrafast QRNG at a rate over 6 Gb/s, which is based on the quantum phase fluctuations of a laser. Moreover, I consider a potential adversary who has partial knowledge of the raw data and discuss how one can rigorously remove such partial knowledge with post-processing.

Quantum key distribution (QKD) can provide unconditional security based on the fundamental laws of quantum physics. Unfortunately, real-life implementations of a QKD system may contain overlooked imperfections and thus violate the practical security of QKD. It is vital to explore these imperfections. In this thesis, I study two practical imperfections in QKD: i) Discovering security loophole in a commercial QKD system: I perform a proof-of-principle experiment to demonstrate a technically feasible quantum attack on top of a commercial QKD system. The attack I utilize is called phase-remapping attack. ii) Generating high-speed truly random numbers: I propose and experimentally demonstrate an ultrafast QRNG at a rate over 6 Gb/s, which is based on the quantum phase fluctuations of a laser. Moreover, I consider a potential adversary who has partial knowledge of the raw data and discuss how one can rigorously remove such partial knowledge with post-processing.

Digital video broadcasting for Terrestrial (DVB-T) is one of the major standards for the fixed reception of digital television services, and the orthogonal frequency division multiplexing (OFDM) demodulator is a critical module of DVB-T receivers. As the remarkable advace of the VLSI (very large scale integration) circuits, the SOC (system-on-a-chip) of the DVB-T receiver is an inevitabel evolution. Considering the integration of the mixed-signal circuits, the issues ot beat could be the frequency synthesis and the calibration of the mixed-signal circuits. Hence, this thesis proposes an OFDM demodulator and discusses the design issues emerged from the SOC integration. The proposed OFDM demodulator is composed of four blocks: time synchronization, frequency synchronization, 2K/8K mode FFT (fast Fourier transform), and channel estimation. The demodulator utilizes the pilot signals embeded in OFDM symbols to estimate the frequency offset and the channel response. Besides, the demodulator use the cyclic prefix of an OFDM symbol to find the correct starting position of an OFDM symbol, and consequently the payload data of an OFDM symbol can be transmitted to the 2K/8K FFT for further processing. As the demand for a low noise frequency signal, we propose a direct digital frequency synthesizer (DDFS) based on the quadruple angle approximation. According to the proposed trigonometric 2nd-order quadruple angle approximation, the DDFS can produce a high-resolution and low-phase noise digital sinusoid without any ROM (read only memory). The digital calibration is an effective scheme to prevent ADCs (analog-to-digital converter) from the interference of noise. A random number generator (RNG) is an essential component for the calibration circuitry. However, the realization of the RNG is an important but long ignored issue. This thesis proposes a RNG based on a chaotic system wherein the coefficients of the system is dynamically changed to attain an ideal random bit stream with flat power spectrum density.

In this paper we present the results of a first empirical investigation on how the quality of non-uniform variates is influenced by the underlying uniform RNG and the transformation method used. We use well known standard RNGs and transformation methods to the normal distribution as examples. We find that except for transformed density rejection methods, which do not seem to introduce any additional defects, the quality of the underlying uniform RNG can be both increased and decreased by transformations to non-uniform distributions. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

published_or_final_version / abstract / toc / Computer Science and Information Systems / Master / Master of Philosophy

Pseudorandom number generator‘s statistical features were analyzed in this work. Pseudorandom numbers are applied in many fields, that‘s why it‘s important for them to satisfy following requirements: • to have uniform distribution, • to be uncorrelated. Hypothesis that random numbers are distributed uniformly is checked by Pearson test. Hypothesis that autocorrelation function is equal to zero is checked by Box Ljung test. During investigation it was noticed, that in all ways generated random numbers didn’t have uniform distribution, except linear congriuential generator. Applying different transformations was set, that for combinations v1-v8 when using parabola, transformed random numbers had uniform distribution. Arcsine was the best transformation for nonlinear congriuential generator. While testing hypothesis about autocorrelation function’s equality to zero was noticed, that zero hypothesis rejection or not depends on: • random numbers generation algorithm, • generated sample size, The best generator, which satisfied requirements, is linear congriuential generator, but it is not suitable, because it is too predictable. Nonlinear congruential generator is chosen as the best one, because its statistical features are closest to the linear generator.

No description available.

Depressed and suicidal patients have difficulty in recollecting specific autobiographical events. In response to cue words they tend to generate summarised or general memories instead of specific events. The objectives of this thesis are to explore the mechanisms underlying the production of specific and general autobiographical memories in a non clinical population. The roles of imagery and working memory in the generation of autobiographical memories were investigated. Four experiments examined how manipulating the imageability of the cue affected subsequent retrieval in autobiographical memory. The results show that cues high in imageability facilitated access to specific memories and that visual imageability was the most significant piedictor of memory specificity compared to a range of other perceptual modalities. The effect of an experimental manipulation on retrieval style was examined by instructing participants to retrieve specific events or general events using high or low imageable words to cue memories. The results show that induction. of a generic retrieval style reduced the specificity of images of future events. This models clinical findings with depressed and suicidal patients and suggests that associations between memory retrieval and future imaging share common intermediate pathways. A further experiment suggested that the image ability effects mediating the construction of specific memories may be in part due to the predicability of such retrieval cues. The hypothesis that retrieval of specific autobiographical memories is more effortful compared to the retrieval of general memories was also investigated using a dual task paradigm. Although central executive function has been implicated many times in the monitoring of autobiographical retrieval, no direct assessment of executive capacity during retrieval has been made. The results showed no significant difference in the randomness of a keypressing task when specific or general autobiographical memories were retrieved in response to either high or low imageable cue words. A direct retrieval hypothesis was proposed whereby cues directly accessed specific events in autobiographical memory and the adoption of such a strategy enabled participants to maintain performance on the secondary task.

No description available.