We classify the finite dimensional indecomposable sl(m/n)-modules with at least a typical or singly atypical primitive weight. We do this classification not only for weight modules, but also for generalized weight modules. We obtain that such a generalized weight module is simply a module obtained by “linking” sub-quotient modules of generalized Kac-modules. By applying our results to sl(m/1), ...

...............................................................................................................................iii Acknowledgements.............................................................................................................. iv Table of

Abstmct-Self-orthogonal ternary codes of minimum weight 3 may be analyzed in a straightforward mamer using the theory of glueing introduced in earlier papers. The present paper describes a method far studying codes of minimum weight 6: the supporta of the words of weight 6 form what is c&xl a center set. Associated with each center set is a graph, and~tbegraphsthatcan~seinthiswayareknown.’Ibese...

The minimum message length (MML) family of estimators are discrete Bayesian point estimators which violate the Likelihood Principle. The nature of the breach is examined and examples are given. MML proponents have claimed that the violation is anìnnocent' one. This claim is examined.

This paper deals with a design problem of a continuous-time anti-windup generalized predictive control system using coprime factorization approach for nonminimum phase processes with input constraints. Based on the proposed design scheme, a condition for stability of the closed-loop system with input constraints and a straightforward method t.o improve the output response of the system with inp...

This paper describes the fundamental principles of launch vehicle flight control analysis and design. In particular, the classical concept of “drift-minimum” and “load-minimum” control principles is re-examined and its performance and stability robustness with respect to modeling uncertainties and a gimbal angle constraint is discussed. It is shown that an additional feedback of angle-of-attack...

This paper introduces the philosophy behind a new Grid model, the Minimum intrusion Grid, MiG. The idea behind MiG is to introduce a ‘fat’ Grid infrastructure which will allow much ‘slimmer’ Grid installations on both the user and resource side. This paper presents the ideas of MiG, some initial designs and finally a status report of the implementation.

We prove an O(nk 1=3) upper bound for planar k-sets. This is the rst considerable improvement on this bound after its early solutions approximately twenty seven years ago. Our proof technique also applies to improve the current bounds on the combinatorial complexities of k-levels in arrangements of line segments, k convex polygons in the union of n lines, parametric minimum spanning trees and p...