We describe three different methods to compute all those characters of a finite group that have certain properties of transitive permutation characters. First, a combinatorial approach can be used to enumerate vectors of multiplicities. Secondly, these characters can be found as certain integral solutions of a system of inequalities. Thirdly, they are calculated via Gaussian elimination. The me...

This paper sketches an overview of the problems related to the analysis and synthesis of face to virtual face communication in a virtual world. We describe different components of our system for real-time interaction and communication between a cloned face representing a real person and an autonomous virtual face. It provides an insight into the various problems and gives particular solutions a...

Approach: The majority of fonts in use today represent glyphs as outlines formed by knots and splines. At rasterization time, these outlines are scaled to the desired size on the pixel grid and each pixel lying within the outline is turned on. Hinting significantly improves the readbility of text by giving the typographer finer control over the final appearance of each glyph beyond this simple ...

Many virtual reality applications and games need a large number of virtual characters. Some of these applications require, in addition to the quantity, the simulation of kinship and evolution, not only of human character models, but also of different types of animals, toon models or other creatures. Some applications also require interactions between isolated populations with well-defined ethni...

Dynamic simulation is a potentially useful tool for creating realistic motion for animated characters. However, improved control techniques are required before this approach will bear fruit. We compare and contrast control for animation with control for robotics. This is followed by an overview of two control methods which were conceived in the context of computer animation, but which also have...

We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p-block for all primes p in the set. Our main focus is on the simple and quasisimple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may b...

Observation of young children is common in educational settings but student practitioners have infrequent access so limited amounts of observable activity can ever be captured. We have developed a software application using research-based models of child development to support observations made by pedagogical practitioners. The prototype system – Observation – which we believe is the first to e...

The distinction between characters and glyphs is a fundamental issue of computing. This talk aims in giving a new definition of these notions. We first review and comment the definitions given in various standards. Then we give and explain our own definitions. We consider that the Unicode character model is lacunary and formulate a proposal for adding supplementary information and obtaining thu...