—Players of real-time strategy (RTS) games are often annoyed by the inability of the game AI to select and move teams of units in a natural way. Units travel and battle separately, resulting in huge losses and the AI looking unintelligent, as can the choice of units sent to counteract the opponents. Players are affected as well as computer commanded… (More)
In this article we study cocycles of discrete countable groups with values in 2 G and the ring of affiliated operators UG. We clarify properties of the first cohomology of a group G with coefficients in 2 G and answer several questions from De Cornulier et al. Moreover, we obtain strong results about the existence of free subgroups and the subgroup… (More)
— This paper investigates the intelligent moving and path-finding of groups in real-time strategy (RTS) games exemplified by the open source game Glest. We utilize the technique of Flocking for achieving a smooth and natural movement of a group of units and expect grouping to decrease the amount of unit losses in RTS games. Furthermore, we present a setting… (More)
—We present a classification-based approach to identify quasi-stellar radio sources (quasars) in the Sloan Digital Sky Survey and evaluate its performance on a manually labeled training set. While reasonable results can already be obtained via approaches working only on photometric data, our experiments indicate that simple but problem-specific features… (More)
In response to the increasing volume of trajectory data obtained, e.g., from tracking athletes, animals, or meteorological phenomena, we present a new space-efficient algorithm for the analysis of trajectory data. The algorithm combines techniques from computational geometry, data mining, and string processing and offers a modular design that allows for a… (More)
— The creation of interesting opponents for human players in computer games is an interesting and challenging task. In contrast to up-to-date computer games, e.g. real time strategy games, learning of non-player-character strategies for older games seems to be easier and not that time-consuming. This way, older games, like the famous arcade game Pac-Man,… (More)
In this paper we study characters on special linear groups SL n (R), where R is either an infinite field or the localization of an order in a number field. We give several applications to the theory of measure-preserving actions, operator-algebraic superrigidity, and almost homomorphisms.
We introduce a set of integrated interaction techniques to interpret and interrogate dimensionality-reduced data. Projection techniques generally aim to make a high-dimensional information space visible in form of a planar layout. However, the meaning of the resulting data projections can be hard to grasp. It is seldom clear why elements are placed far… (More)