Nonlinear Schrödinger Equations and Their Spectral Semi-Discretizations Over Long Times

Cubic Schrödinger equations with small initial data (or small nonlinearity) and their spectral semi-discretizations in space are analyzed. It is shown that along both the solution of the nonlinear Schrödinger equation as well as the solution of the semi-discretized equation the actions of the linear Schrödinger equation are approximately conserved over long times. This also allows us to show approximate conservation of energy and momentum along the solution of the semi-discretized equation over long times. These results are obtained by analyzing a modulated Fourier expansion in time. They are valid in arbitrary spatial dimension.     

Clustering of imbalanced high-dimensional media data

Media content in large repositories usually exhibits multiple groups of strongly varying sizes. Media of potential interest often form notably smaller groups. Such media groups differ so much from the remaining data that it may be worthy to look at them in more detail. In contrast, media with popular content appear in larger groups. Identifying groups of varying sizes is addressed by clustering of imbalanced data. Clustering highly imbalanced media groups is additionally challenged by the high dimensionality of the underlying features. In this paper, we present the imbalanced clustering (IClust) algorithm designed to reveal group structures in high-dimensional media data. IClust employs an existing clustering method in order to find an initial set of a large number of potentially highly pure clusters which are then successively merged. The main advantage of IClust is that the number of clusters does not have to be pre-specified and that no specific assumptions about the cluster or data characteristics need to be made. Experiments on real-world media data demonstrate that in comparison to existing methods, IClust is able to better identify media groups, especially groups of small sizes.     

A survey of berth allocation and quay crane scheduling problems in container terminals

Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.