Downlink power control and beamforming designs in wireless system have been a recent research focus. To achieve reliable and efficient designs, good estimation of wireless channel knowledge is desired. However, the presence of uncertain channel knowledge due to constant changing radio environment will cause performance degradation in system designs. Thus the mismatches between the actual and presumed channel state information (CSI) may frequently occur in practical situations. Robust power control and beamforming were introduced considering the channel uncertainty. In this thesis, a new robust downlink power control solution based on worst-case performance optimization is developed. Our approach explicitly models uncertainties in the downlink channel correlation (DCC) matrices, uses worst-case performance optimization and guarantees that the quality of service (QoS) constraints are satisfied for all users using minimum amount of power. An iterative algorithm to find the optimum power allocation is proposed. The key in the iteration is the step to solve an originally non-convex problem to obtain worst-case uncertainty matrices. When the uncertainty is small enough to guarantee that the DCC matrices are positive semidefinite, we obtain a closed-form solution of this problem. When the uncertainty is large, we transform this intractable problem into a convex problem. Simulation results show that our proposed robust downlink power control using the approach of worst-case performance optimization converges in a few iterations and reduces the transmission power effectively under imperfect knowledge of the channel condition. / Thesis / Master of Applied Science (MASc)

The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The applications of the OBPP can be found in the subway station systems in Hong Kong and Taipei and the scheduling in manufacturing industries. We show that the OBPP is NP-hard and propose two heuristic algorithms instead of solving the problem to optimality. We propose two offline algorithms in which the information of the items is known in advance. First, we consider the First Fit Decreasing (FFD) which is a good approximation algorithm for the bin packing problem. We prove that its asymptotic worst-case performance ratio is no more than 3/2. We observe that its performance for the OBPP is worse than that of the BPP. Consequently, we modify it by adding the algorithm that the set of largest items is the set of last items in each bin. Then, we propose the Modified First Fit Decreasing (MFFD) as an alternative and prove that its asymptotic worst-case performance ratio is no more than 91/80. We conduct empirical tests to show their average-case performance. The results show that in general, the FFD and MFFD algorithms use no more than 33% and 1% of the number of bins than that of optimal packing, respectively. In addition, the MFFD is asymptotically optimal when the sizes of items are (0,1) uniformly distributed. / Ph. D.

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada / Robust adaptive beamforming using worst-case performance optimization is developed in recent years. It had good performance against array response errors, but it cannot reject strong interferences. In this paper, we propose a scheme for robust adaptive beamforming with broad nulls to reject strong interferences. We add a quadratic constraint to suppress the power of the array response over a spatial region of the interferences. The optimal weighting vector is then obtained by minimizing the power of the array output subject to quadratic constrains on the desired signal and interferences, respectively. We derive the formulations for the optimization problem and solve it efficiently using Newton recursive algorithm. Numerical examples are presented to compare the performances of the robust adaptive beamforming with no null constrains, sharp nulls and broad nulls. The results show its powerful ability to reject strong interferences.

<p> </p><p>Upon a closer examination of the role and performance of the International Court of Justice, we find that it does primarily fulfil its role and obligation as far as the UN charter and the Courts stature are concerned. It is upon the application of Kjell Goldmann’s <em>Internationalists Programme </em>that we find ourselves wanting more from the Court.</p><p>If we assume the development of international institutions, exchange, communication and the like to be desirable and necessary for the continued development of international peace and security, the ICJ can be shown to have had historical opportunities to affect the development to such an effect, but lacks the formal means to do so.</p><p>With the subscription to the internationalists programme, we find that there are plenty of potential improvements that could reasonably be made. These are primarily about the official influence of the Court, with regards to cases relevant to it and its jurisdiction, which is severely crippled by current regulatory framework. This is a condition shared with plenty of other international courts in their various forms.</p><p>Essentially, the current state of the ICJ lacks the desirable attributes and possibilities to influence the development of international law to any meaningful extent. If we indeed were to look for an international court with the means to build international legal institutions and seek to further enforce international peace and security, the ICJ is not what we are looking for.</p><p> </p>

Upon a closer examination of the role and performance of the International Court of Justice, we find that it does primarily fulfil its role and obligation as far as the UN charter and the Courts stature are concerned. It is upon the application of Kjell Goldmann’s Internationalists Programme that we find ourselves wanting more from the Court. If we assume the development of international institutions, exchange, communication and the like to be desirable and necessary for the continued development of international peace and security, the ICJ can be shown to have had historical opportunities to affect the development to such an effect, but lacks the formal means to do so. With the subscription to the internationalists programme, we find that there are plenty of potential improvements that could reasonably be made. These are primarily about the official influence of the Court, with regards to cases relevant to it and its jurisdiction, which is severely crippled by current regulatory framework. This is a condition shared with plenty of other international courts in their various forms. Essentially, the current state of the ICJ lacks the desirable attributes and possibilities to influence the development of international law to any meaningful extent. If we indeed were to look for an international court with the means to build international legal institutions and seek to further enforce international peace and security, the ICJ is not what we are looking for.

Le Network Calculus est une théorie visant à calculer des bornes pire-cas sur les performances des réseaux de communication. Le réseau est modélisé par un graphe orienté où les noeuds représentent des serveurs, et les flux traversant le réseau doivent suivre les arcs. S'ajoutent à cela des contraintes sur les courbes de trafic (la quantité de données passées par un point depuis la mise en route du réseau) et sur les courbes de service (la quantité de travail fournie par chaque serveur). Pour borner les performances pire-cas, comme la charge en différents points ou les délais de bout en bout, ces enveloppes sont combinées à l'aide d'opérateurs issus notamment des algèbres tropicales : min, +, convolution-(min, +)... Cette thèse est centrée sur l'algorithmique du Network Calculus, à savoir comment rendre effectif ce formalisme. Ce travail nous a amené d'abord à comparer les variations présentes dans la littérature sur les modèles utilisés, révélant des équivalences d'expressivité comme entre le Real-Time Calculus et le Network Calculus. Dans un deuxième temps, nous avons proposé un nouvel opérateur (min, +) pour traiter le calcul de performances en présence d'agrégation de flux, et nous avons étudié le cas des réseaux sans dépendances cycliques sur les flux et avec politique de service quelconque. Nous avons montré la difficulté algorithmique d'obtenir précisément les pires cas, mais nous avons aussi fourni une nouvelle heuristique pour les calculer. Elle s'avère de complexité polynomiale dans des cas intéressants. / Network Calculus is a theory aiming at computing worst-case bounds on performances in communication networks. The network is usually modelled by a digraph : the servers are located on the nodes and the flows must follow path in the digraph. There are constraints on the trafic curves (how much data have been through a given point since the activation of the network) and on the service curves (how much work each server may provide). To derive bounds on the worst-case performances, as the backlog or the end-to-end delay, these envelopes are combined thanks to tropical algebra operators: min, +, convolution... This thesis focuses on Network Calculus algorithmics, that is how effective is this formalism. This work led us to compare various models in the litterature, and to show expressiveness equivalence between Real-Time Calculus and Network Calculus. Then, we suggested a new (min, +) operator to compute performances bounds in networks with agregated flows and we studied feed-forward networks under blind multiplexing. We showed the difficulty to compute these bounds, but we gave an heuristic, which is polynomial for interesting cases.