Дисертації з теми "Time-varying Efficiency"

This thesis consists of four self-contained papers related to the change of market structure and the quality of equity market. In Paper [I] we found, by using of a Flexible Dynamic Component Correlations (FDCC) model, that the creation of a common cross-border stock trading platform has increased the long-run trends in conditional correlations between foreign and domestic stock market returns. In Paper [II] we study whether the creation of a uniform Nordic and Baltic stock trading platform has affected weak-form information efficiency. The results indicate that the stock market consolidations have had a positive effect on the information efficiency and turnover for an average firm. The merger effects are, however, asymmetrically distributed in the sense that relatively large (small) firms located on relatively large (small) markets experience an improved (reduced) information efficiency and turnover. Although the results indicate that changes in the level of investor attention (measured by turnover) may explain part of the changes in information efficiency, they also lend support to the hypothesis that merger effects may partially be driven by changes in the composition of informed versus uninformed investors following a stock. Paper [III] analyzes whether the measured level of trust in different countries can explain bilateral stock market correlations. One finding is that generalized trust among nations is a robust predictor for stock market correlations. Another is that the trust effect is larger for countries which are close to each other. This indicates that distance mitigates the trust effect. Finally, we confirm the effect of trust upon stock market correlations, by using particular trust data (bilateral trust between country A and country B) as an alternative measurement of trust. In Paper [IV] we present the impact of the stock market mergers that took place in the Nordic countries during 2000 – 2007 on the probabilities for stock price jumps, i.e. for relatively extreme price movements. The main finding is that stock market mergers, on average, reduce the likelihood of observing stock price jumps. The effects are asymmetric in the sense that the probability of sudden price jumps is reduced for large and medium size firms whereas the effect is ambiguous for small size firms. The results also indicate that the market risk has been reduced after the stock market consolidations took place.

The extension of the CJS model to include individual, continuous, time-varying covariates relies on the estimation of covariate values on occasions on which individuals were not captured. Fitting this model in a Bayesian framework typically involves the implementation of a Markov chain Monte Carlo (MCMC) algorithm, such as a Gibbs sampler, to sample from the posterior distribution. For large data sets with many missing covariate values that must be estimated, this creates a computational issue, as each iteration of the MCMC algorithm requires sampling from the full conditional distributions of each missing covariate value. This dissertation examines two solutions to address this problem. First, I explore variational Bayesian algorithms, which derive inference from an approximation to the posterior distribution that can be fit quickly in many complex problems. Second, I consider an alternative approximation to the posterior distribution derived by truncating the individual capture histories in order to reduce the number of missing covariates that must be updated during the MCMC sampling algorithm. In both cases, the increased computational efficiency comes at the cost of producing approximate inferences. The variational Bayesian algorithms generally do not estimate the posterior variance very accurately and do not directly address the issues with estimating many missing covariate values. Meanwhile, the truncated CJS model provides a more significant improvement in computational efficiency while inflating the posterior variance as a result of discarding some of the data. Both approaches are evaluated via simulation studies and a large mark-recapture data set consisting of cliff swallow weights and capture histories.

Thesis (Ph. D.)--University of California, San Diego, 2007.
Title from first page of PDF file (viewed June 22, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 167-173).

Nonuniform sampling occurs in many practical applications either intentionally or unintentionally. This thesis deals with the reconstruction of two-periodic nonuniform signals which is of great importance in two-channel time-interleaved analog-to-digital converters. In a two-channel time-interleaved ADC, aperture delay mismatch between the channels gives rise to a two-periodic nonuniform sampling pattern, resulting in distortion and severely affecting the linearity of the converter. The problem is solved by digitally recovering a uniformly sampled sequence from a two-periodic nonuniformly sampled set. For this purpose, a time-varying FIR filter is employed. If the sampling pattern is known and fixed, this filter can be designed in an optimal way using least-squares or minimax design. When the sampling pattern changes now and then as during the normal operation of time-interleaved ADC, these filters have to be redesigned. This has implications on the implementation cost as general on-line design is cumbersome. To overcome this problem, a novel time-varying FIR filter with polynomial impulse response is developed and characterized in this thesis. The main advantage with these filters is that on-line design is no longer needed. It now suffices to perform only one design before implementation and in the implementation it is enough to adjust only one variable parameter when the sampling pattern changes. Thus the high implementation cost is decreased substantially.

Filter design and the associated performance metrics have been validated using MATLAB. The design space has been explored to limits imposed by machine precision on matrix inversions. Studies related to finite wordlength effects in practical filter realisations have also been carried out. These formulations can also be extended to the general M - periodic nonuniform sampling case.

This thesis investigates systematic liquidity risk and short-term stock price reaction to large one-day price changes. We study 642 constituents of the FTSALL share index over the period from 1st July 1992 to 29th June 2007. We show that the US evidence of a priced systematic liquidity risk of Pastor and Stambaugh (2003) and Liu (2006) is not country-specific. Particularly, systematic liquidity risk is priced in the London Stock Exchange when Amihud's (2002) illiquidity ratio is used as a liquidity proxy. Given the importance of systematic liquidity risk in the asset pricing literature, we are interested in testing whether the different levels of systematic liquidity risk across stocks can explain the anomaly following large one-day price changes. Specifically, we expect that the stocks with high sensitivity to the fluctuations in aggregate market liquidity to be more affected by price shocks. We find that most liquid stocks react efficiently to price shocks, while the reactions of the least liquid stocks support the uncertain information hypothesis. However, we show that time-varying risk is more important than systematic liquidity risk in explaining the price reaction of stocks in different liquidity portfolios. Indeed, the time varying risk explains nearly all of the documented overreaction and underreaction following large one-day price changes. Our evidence suggests that the observed anomalies following large one-day price shocks are caused by the pricing errors arising from the use of static asset pricing models. In particular, the conditional asset pricing model of Harris et al. (2007), which allow both risk and return to vary systematically over time, explain most of the observed anomalies. This evidence supports the Brown et al. (1988) findings that both risk and return increase in a systematic fashion following price shocks.
Yarmouk University, Jordan.

This thesis investigates systematic liquidity risk and short-term stock price reaction to large one-day price changes. We study 642 constituents of the FTSALL share index over the period from 1st July 1992 to 29th June 2007. We show that the US evidence of a priced systematic liquidity risk of Pastor and Stambaugh (2003) and Liu (2006) is not country-specific. Particularly, systematic liquidity risk is priced in the London Stock Exchange when Amihud's (2002) illiquidity ratio is used as a liquidity proxy. Given the importance of systematic liquidity risk in the asset pricing literature, we are interested in testing whether the different levels of systematic liquidity risk across stocks can explain the anomaly following large one-day price changes. Specifically, we expect that the stocks with high sensitivity to the fluctuations in aggregate market liquidity to be more affected by price shocks. We find that most liquid stocks react efficiently to price shocks, while the reactions of the least liquid stocks support the uncertain information hypothesis. However, we show that time-varying risk is more important than systematic liquidity risk in explaining the price reaction of stocks in different liquidity portfolios. Indeed, the time varying risk explains nearly all of the documented overreaction and underreaction following large one-day price changes. Our evidence suggests that the observed anomalies following large one-day price shocks are caused by the pricing errors arising from the use of static asset pricing models. In particular, the conditional asset pricing model of Harris et al. (2007), which allow both risk and return to vary systematically over time, explain most of the observed anomalies. This evidence supports the Brown et al. (1988) findings that both risk and return increase in a systematic fashion following price shocks.

The estimation and analysis of signals that have polynomial phase and constant or time-varying amplitudes with the addititve noise is considered in this dissertation.Much work has been undertaken on this problem over the last decade or so, and there are a number of estimation schemes available. The fundamental problem when trying to estimate the parameters of these type of signals is the nonlinear characterstics of the signal, which lead to computationally difficulties when applying standard techniques such as maximum likelihood and least squares. When considering only the phase data, we also encounter the well known problem of the unobservability of the true noise phase curve. The methods that are currently most popular involve differencing in phase followed by regression, or nonlinear transformations. Although these methods perform quite well at high signal to noise ratios, their performance worsens at low signal to noise, and there may be significant bias. One of the biggest problems to efficient estimation of these models is that the majority of methods rely on sequential estimation of the phase coefficients, in that the highest-order parameter is estimated first, its contribution removed via demodulation, and the same procedure applied to estimation of the next parameter and so on. This is clearly an issue in that errors in estimation of high order parameters affect the ability to estimate the lower order parameters correctly. As a result, stastical analysis of the parameters is also difficult. In thie dissertation, we aim to circumvent the issues of bias and sequential estiamtion by considering the issue of full parameter iterative refinement techniques. ie. given a possibly biased initial estimate of the phase coefficients, we aim to create computationally efficient iterative refinement techniques to produce stastically efficient estimators at low signal to noise ratios. Updating will be done in a multivariable manner to remove inaccuracies and biases due to sequential procedures. Stastical analysis and extensive simulations attest to the performance of the schemes that are presented, which include likelihood, least squares and bayesian estimation schemes. Other results of importance to the full estimatin problem, namely when there is error in the time variable, the amplitude is not constant, and when the model order is not known, are also condsidered.

The estimation and analysis of signals that have polynomial phase and constant or time-varying amplitudes with the addititve noise is considered in this dissertation.Much work has been undertaken on this problem over the last decade or so, and there are a number of estimation schemes available. The fundamental problem when trying to estimate the parameters of these type of signals is the nonlinear characterstics of the signal, which lead to computationally difficulties when applying standard techniques such as maximum likelihood and least squares. When considering only the phase data, we also encounter the well known problem of the unobservability of the true noise phase curve. The methods that are currently most popular involve differencing in phase followed by regression, or nonlinear transformations. Although these methods perform quite well at high signal to noise ratios, their performance worsens at low signal to noise, and there may be significant bias. One of the biggest problems to efficient estimation of these models is that the majority of methods rely on sequential estimation of the phase coefficients, in that the highest-order parameter is estimated first, its contribution removed via demodulation, and the same procedure applied to estimation of the next parameter and so on. This is clearly an issue in that errors in estimation of high order parameters affect the ability to estimate the lower order parameters correctly. As a result, stastical analysis of the parameters is also difficult. In thie dissertation, we aim to circumvent the issues of bias and sequential estiamtion by considering the issue of full parameter iterative refinement techniques. ie. given a possibly biased initial estimate of the phase coefficients, we aim to create computationally efficient iterative refinement techniques to produce stastically efficient estimators at low signal to noise ratios. Updating will be done in a multivariable manner to remove inaccuracies and biases due to sequential procedures. Stastical analysis and extensive simulations attest to the performance of the schemes that are presented, which include likelihood, least squares and bayesian estimation schemes. Other results of importance to the full estimatin problem, namely when there is error in the time variable, the amplitude is not constant, and when the model order is not known, are also condsidered.

碩士
國立彰化師範大學
機電工程學系
99
ABSTRACT With the widespread use of nonlinear loads in the power system, harmonic distortion causes a serious pollution of power quality. Besides, the power unbalance between the generation and the load demand would make the fundamental frequency varying with time. These disturbances may introduce operational problems of power system equipments. Therefore, improving the power quality has become a great concern for both utilities and customers. The frequency-domain methods have been widely used for the signal processing because of its computational efficiency. In addition, most power meters adopt FFT-based algorithm to analyze the harmonics and to show the frequency spectra. However, the FFT-based algorithm is less accurate if the system frequency varies and the frequency resolution decreases. The analysis results will show errors caused by the leakage and picket-fence effects. Therefore, how to achieve both the high resolution and efficiency is worth investigating. According to aforementioned facts, this thesis proposes a Prony-based improved algorithm for harmonics and interharmonics measurement. Not only the calculation time is reduced, but also the result is with a better accuracy, even if the power signals contain frequency variations and non-integer harmonic components. Finally, the thesis applies LabVIEW and the dedicated hardware to design a simple setup for measuring power quality signals. The performance of improved algorithm is validated by testing the synthesized and actual signals. Key Words: Harmonics, System Frequency Variation, Fast Fourier Transform, Prony's Method, LabVIEW

This thesis develops techniques to evaluate and to improve the performance of single-server service systems with time-varying arrivals. The performance measures considered are the time-varying expected length of the queue and the expected customer waiting time. Time varying arrival rates are considered because they often occur in service systems. For example, arrival rates often vary significantly over the hours of each day and over the days of each week. Stochastic textbook methods do not apply to models with time-varying arrival rates. Hence new techniques are needed to provide high quality of service when stationary steady-state analysis is not appropriate. In contrast to the extensive recent literature on many-server queues with time-varying arrival rates, we focus on single-server queues with time-varying arrival rates. Single-server queues arise in real applications where there is no flexibility in the number of service facilities (servers). Different analysis techniques are required for single-server queues, because the two kinds of models exhibit very different performance. Many-server models are more tractable because methods for highly tractable infinite-server models can be applied. In contrast, single-server models are more complicated because it takes a long time to respond to a build up of workload when there is only one server. The thesis is divided into two parts: simulation algorithms for performance evaluation and service-rate controls for performance stabilization. The first part of the thesis develops algorithms to efficiently simulate the single-server time-varying queue. For the generality considered, no explicit mathematical formulas are available for calculating performance measures, so simulation experiments are needed to calculate and evaluate system performance. Efficient algorithms for both standard simulation and rare-event simulation are developed. The second part of the thesis develops service-rate controls to stabilize performance in the time-varying single-server queue. The performance stabilization problem aims to minimize fluctuations in mean waiting times for customers coming at different times even though the arrival rate is time-varying. A new service rate control is developed, where the service rate at each time is a function of the arrival rate function. We show that a specific service rate control can be found to stabilize performance. In turn, that service rate control can be used to provide guidance for real applications on optimal changes in staffing, processing speed or machine power status over time. Both the simulation experiments to evaluate performance of alternative service-rate controls and the simulation search algorithm to find the best parameters for a damped time-lag service-rate control are based on efficient performance evaluation algorithms in the first part of the thesis. In Chapter Two, we present an efficient algorithm to simulate a general non-Poisson non-stationary point process. The general point process can be represented as a time transformation of a rate-one base process and by exploiting a table of the inverse cumulative arrival rate function outside of simulation, we can efficiently convert the simulated rate-one process into the simulated general point process. The simulation experiments can be conducted in linear time subject to small error bounds. Then we can apply this efficient algorithm to generate the arrival process, the service process and thus to calculate performance measures for the G_t/G_t/1 queues, which are single-server queues with time-varying arrival rates and service rates. Service models are constructed for this purpose where time-varying service rates are specified separately from the rate-one service requirement process, and service times are determined by equating service requirements with integrals of service rates over a time period equal to the service time. In Chapter Three, we develop rare-event simulation algorithms in periodic GI_t/GI/1 queues and further in GI_t/GI_t/1 queues to estimate probabilities of rare but important events as a sanity check of the system, for example, estimating the probability that the waiting time is very long. Importance sampling, specifically exponential tilting, is required to estimate rare-event probabilities because in standard simulation, the number of experiments may blow up to achieve a targeted relative error and for each experiment, it may take a very long time to determine that the rare event does not happen. To extend the rare-event simulation algorithm to periodic queues, we derive a convenient expression for the periodic steady-state virtual waiting time. We apply this expression to establish bounds between the periodic workload and the steady-state workload in stationary queues, so that we can prove that the exponential tilting algorithm with the same parameter efficient in stationary queues is efficient in the periodic setting as well, which has a bounded relative error. We apply this algorithm to compute the periodic steady-state distribution of reflected periodic Brownian motion with support of a heavy-traffic limit theorem and to calculate the periodic steady-state distribution and moments of the virtual waiting time. This algorithm's advantage in calculating these distributions and moments is that it can directly estimate them at a specific position of the cycle without simulating the whole queueing process until steady state is reached for the whole cycle. In Chapter Four, we conduct simulation experiments to validate performance of four service-rate controls: the rate-matching control, which is directly proportional to the arrival rate, two square-root controls related to the square root staffing formula and the square-root control based on the mean stationary waiting time. Simulations show that the rate-matching control stabilizes the queue length distribution but not the virtual waiting time. This is consistent with established theoretical results, which follow from the observation that with rate-matching control, the queueing process becomes a time transformation of the stationary queueing process with constant arrival rates and service rates. Simulation results also show that the two square-root controls analogous to the server staffing formula are not effective in stabilizing performance. On the other hand, the alternative square-root service rate control based on the mean stationary waiting time approximately stabilizes the virtual waiting time when the cycle is long so that the arrival rate changes slowly enough. In Chapter Five, since we are mostly interested in stabilizing waiting times in more common scenarios when the traffic intensity is not close to one or when the arrival rate does not change slowly, we develop a damped time-lag service-rate control that performs fairly well for this purpose. This control is a modification of the rate-matching control involving a time lag and a damping factor. To find the best parameters for this control, we search over reasonable intervals for the most time-stable performance measures, which are computed by the extended rare-event simulation algorithm in GI_t/GI_t/1 queue. We conduct simulation experiments to validate that this control is effective for stabilizing the expected steady-state virtual waiting time (and its distribution to a large extent). We also establish a heavy-traffic limit with periodicity in the fluid scale to provide theoretical support for this control. We also show that there is a time-varying Little's law in heavy-traffic, which implies that this control cannot stabilize the queue length and the waiting time at the same time.