<p> In this work, optimal censoring schemes are investigated for the non-parametric confidence intervals of population quantiles under progressive Type-II right censoring. The proposed inference can be universally applied to any probability distributions for continuous random variables. By using the interval mass as an optimality criterion, the optimization process is also independent of the actual observed values from a sample as long as the initial sample size n and the number of observations m are predetermined. This study is based on the fact that each (uncensored) order statistic observed from progressive Type-II censoring can be represented as a mixture of underlying ordinary order statistics with exactly known weights [11, 12]. Using several sample sizes combined with various degrees of censoring, the results of the optimization are tabulated here for a wide range of quantiles with selected levels of significance (i.e., α = 0.01, 0.05, 0.10). With the optimality criterion under consideration, the efficiencies of the worst progressive Type-II censoring scheme and ordinary Type-II censoring scheme are also examined in comparison with the best censoring scheme obtained for a given quantile with fixed n and m.</p> / Thesis / Master of Science (MSc)

Simultaneous operation of different wireless applications in the same geographical region and the same frequency band gives rise to undesired interference issues. Since licensed (primary) applications have been granted priority access to the frequency spectrum, unlicensed (secondary) services should avoid imposing interference on the primary system. In other words, secondary system’s activity in the same bands should be in a controlled fashion so that the primary system maintains its quality of service (QoS) requirements. In this thesis, we consider collocated point-to-multipoint primary and secondary networks that have simultaneous access to the same frequency band. Particularly, we examine three different levels at which the two networks may coexist: pure interference, asymmetric co-existence, and symmetric co-existence levels. At the pure interference level, both networks operate simultaneously regardless of their interference to each other. At the other two levels, at least one of the networks attempts to mitigate its interference to the other network by deactivating some of its users. Specifically, at the asymmetric co-existence level, the secondary network selectively deactivates its users based on knowledge of the interference and channel gains, whereas at the symmetric level, the primary network also schedules its users in the same way. Our aim is to derive optimal sum-rates (i.e., throughputs) of both networks at each co-existence level as the number of users grows asymptotically and evaluate how the sum-rates scale with the network size. In order to find the asymptotic throughput results, we derive two propositions; one on the asymptotic behaviour of the largest order statistic and one on the asymptotic behaviour of the sum of lower order statistics. As a baseline comparison, we calculate primary and secondary sum-rates for the time division (TD) channel sharing. Then, we compare the asymptotic secondary sum-rate in TD to that under simultaneous channel sharing, while ensuring the primary network maintains the same sum-rate in both cases. Our results indicate that simultaneous channel sharing at both asymmetric and symmetric co-existence levels can outperform TD. Furthermore, this enhancement is achievable when user scheduling in uplink mode is based only on the interference gains to the opposite network and not on a network’s own channel gains. In other words, the optimal secondary sum-rate is achievable by applying a scheduling strategy, referred to as the least interference strategy, for which only the knowledge of interference gains is required and can be performed in a distributed way.

Simultaneous operation of different wireless applications in the same geographical region and the same frequency band gives rise to undesired interference issues. Since licensed (primary) applications have been granted priority access to the frequency spectrum, unlicensed (secondary) services should avoid imposing interference on the primary system. In other words, secondary system’s activity in the same bands should be in a controlled fashion so that the primary system maintains its quality of service (QoS) requirements. In this thesis, we consider collocated point-to-multipoint primary and secondary networks that have simultaneous access to the same frequency band. Particularly, we examine three different levels at which the two networks may coexist: pure interference, asymmetric co-existence, and symmetric co-existence levels. At the pure interference level, both networks operate simultaneously regardless of their interference to each other. At the other two levels, at least one of the networks attempts to mitigate its interference to the other network by deactivating some of its users. Specifically, at the asymmetric co-existence level, the secondary network selectively deactivates its users based on knowledge of the interference and channel gains, whereas at the symmetric level, the primary network also schedules its users in the same way. Our aim is to derive optimal sum-rates (i.e., throughputs) of both networks at each co-existence level as the number of users grows asymptotically and evaluate how the sum-rates scale with the network size. In order to find the asymptotic throughput results, we derive two propositions; one on the asymptotic behaviour of the largest order statistic and one on the asymptotic behaviour of the sum of lower order statistics. As a baseline comparison, we calculate primary and secondary sum-rates for the time division (TD) channel sharing. Then, we compare the asymptotic secondary sum-rate in TD to that under simultaneous channel sharing, while ensuring the primary network maintains the same sum-rate in both cases. Our results indicate that simultaneous channel sharing at both asymmetric and symmetric co-existence levels can outperform TD. Furthermore, this enhancement is achievable when user scheduling in uplink mode is based only on the interference gains to the opposite network and not on a network’s own channel gains. In other words, the optimal secondary sum-rate is achievable by applying a scheduling strategy, referred to as the least interference strategy, for which only the knowledge of interference gains is required and can be performed in a distributed way.

Advances in digital signal processing (DSP) and computing technology have resulted in the emergence of increasingly adaptive radar systems. It is clear that the Electronic Attack (EA), or jamming, of such radar systems is expected to become a more difficult task. The reason for this research was to address the issue of jamming adaptive radar systems. This required consideration of adaptive jamming systems and the development of a methodology for outlining the features of such a system is proposed as the key contribution of this thesis. For the first time, game-based optimization methods have been applied to a maritime counter-surveillance/counter-targeting scenario involving conventional, as well as so-called ‘smart’ noise jamming.Conventional noise jamming methods feature prominently in the origins of radar electronic warfare, and are still widely implemented. They have been well studied, and are important for comparisons with coherent jamming techniques.Moreover, noise jamming is more readily applied with limited information support and is therefore germane to the problem of jamming adaptive radars; during theearly stages when the jammer tries to learn about the radar’s parameters and its own optimal actions.A radar and a jammer were considered as informed opponents ‘playing’ in a non-cooperative two-player, zero-sum game. The effects of jamming on the target detection performance of a radar using Constant False Alarm Rate (CFAR)processing were analyzed using a game theoretic approach for three cases: (1) Ungated Range Noise (URN), (2) Range-Gated Noise (RGN) and (3) False-Target (FT) jamming.Assuming a Swerling type II target in the presence of Rayleigh-distributed clutter, utility functions were described for Cell-Averaging (CA) and Order Statistic (OS) CFAR processors and the three cases of jamming. The analyses included optimizations of these utility functions, subject to certain constraints, with respectto control variables (strategies) in the jammer, such as jammer power and spatial extent of jamming, and control variables in the radar, such as threshold parameter and reference window size. The utility functions were evaluated over the players’ strategy sets and the resulting matrix-form games were solved for the optimal or ‘best response’ strategies of both the jammer and the radar.

Advances in digital signal processing (DSP) and computing technology have resulted in the emergence of increasingly adaptive radar systems. It is clear that the Electronic Attack (EA), or jamming, of such radar systems is expected to become a more difficult task. The reason for this research was to address the issue of jamming adaptive radar systems. This required consideration of adaptive jamming systems and the development of a methodology for outlining the features of such a system is proposed as the key contribution of this thesis. For the first time, game-based optimization methods have been applied to a maritime counter-surveillance/counter-targeting scenario involving conventional, as well as so-called ‘smart’ noise jamming.Conventional noise jamming methods feature prominently in the origins of radar electronic warfare, and are still widely implemented. They have been well studied, and are important for comparisons with coherent jamming techniques.Moreover, noise jamming is more readily applied with limited information support and is therefore germane to the problem of jamming adaptive radars; during theearly stages when the jammer tries to learn about the radar’s parameters and its own optimal actions.A radar and a jammer were considered as informed opponents ‘playing’ in a non-cooperative two-player, zero-sum game. The effects of jamming on the target detection performance of a radar using Constant False Alarm Rate (CFAR)processing were analyzed using a game theoretic approach for three cases: (1) Ungated Range Noise (URN), (2) Range-Gated Noise (RGN) and (3) False-Target (FT) jamming.Assuming a Swerling type II target in the presence of Rayleigh-distributed clutter, utility functions were described for Cell-Averaging (CA) and Order Statistic (OS) CFAR processors and the three cases of jamming. The analyses included optimizations of these utility functions, subject to certain constraints, with respectto control variables (strategies) in the jammer, such as jammer power and spatial extent of jamming, and control variables in the radar, such as threshold parameter and reference window size. The utility functions were evaluated over the players’ strategy sets and the resulting matrix-form games were solved for the optimal or ‘best response’ strategies of both the jammer and the radar.

In this thesis we present results about some eigenvalue statistics of the beta-Hermite ensembles, both in the classical cases corresponding to beta = 1, 2, 4, that is the Gaussian orthogonal ensemble (consisting of real symmetric matrices), the Gaussian unitary ensemble (consisting of complex Hermitian matrices) and the Gaussian symplectic ensembles (consisting of quaternionic self-dual matrices) respectively. We also look at the less explored general beta-Hermite ensembles (consisting of real tridiagonal symmetric matrices). Specifically we look at the empirical distribution function and two different scalings of the largest eigenvalue. The results we present relating to these statistics are the convergence of the empirical distribution function to the semicircle law, the convergence of the scaled largest eigenvalue to the Tracy-Widom distributions, and with a different scaling, the convergence of the largest eigenvalue to 1. We also use simulations to illustrate these results. For the Gaussian unitary ensemble, we present an expression for its level density. To aid in understanding the Gaussian symplectic ensemble we present properties of the eigenvalues of quaternionic matrices. Finally, we prove a theorem about the symmetry of the order statistic of the eigenvalues of the beta-Hermite ensembles. / I denna kandidatuppsats presenterar vi resultat om några olika egenvärdens-statistikor från beta-Hermite ensemblerna, först i de klassiska fallen då beta = 1, 2, 4, det vill säga den gaussiska ortogonala ensemblen (bestående av reella symmetriska matriser), den gaussiska unitära ensemblen (bestående av komplexa hermitiska matriser) och den gaussiska symplektiska ensemblen (bestående av kvaternioniska själv-duala matriser). Vi tittar även på de mindre undersökta generella beta-Hermite ensemblerna (bestående av reella symmetriska tridiagonala matriser). Specifikt tittar vi på den empiriska fördelningsfunktionen och två olika normeringar av det största egenvärdet. De resultat vi presenterar för dessa statistikor är den empiriska fördelningsfunktionens konvergens mot halvcirkel-fördelningen, det normerade största egenvärdets konvergens mot Tracy-Widom fördelningen, och, med en annan normering, största egenvärdets konvergens mot 1. Vi illustrerar även dessa resultat med hjälp av simuleringar. För den gaussiska unitära ensemblen presenterar vi ett uttryck för dess nivåtäthet. För att underlätta förståelsen av den gaussiska symplektiska ensemblen presenterar vi egenskaper hos egenvärdena av kvaternioniska matriser. Slutligen bevisar vi en sats om symmetrin hos ordningsstatistikan av egenvärdena av beta-Hermite ensemblerna.