Various theories about the evolution of complex characters make predictions about the statistical distribution of genetic effects on phenotypic characters, also called the genotype-phenotype map. With the advent of QTL technology, data about these distributions are becoming available. In this article, we propose simple tests for the prediction that functionally integrated characters have a modu...

In prose literature often complex dynamics of interpersonal relationships can be observed between the different characters. Traditionally, node-link diagrams are used to depict the social network of a novel. However, static graphs can only visualize the overall social network structure but not the development of the networks over the course of the story, while dynamic graphs have the serious pr...

Traditional CNN-based text recognition problems have either been single-character classification like MNIST or complex, stateful full-word classifications like the LSTM approach in Graves et al. I explore a stateless approach to word recognition by using Faster R-CNN’s region proposal network in conjunction with a heuristic to produce word labels from region proposals. While the results are pro...

Handwriting recognition is often considered as an ideal solution for pen-based Chinese input. However, handwriting Chinese suffers from a performance bottleneck due to the complex structure of Chinese characters. We designed Donuts, a technique that allows a user to enter Chinese characters by navigating through a hierarchical marking menu of phonetic symbols. In particular, to place 12 vowels ...

Iwahori-Hecke algebras for the infinite series of complex reflection groups G(r, p, n) were constructed recently in the work of Ariki and Koike [AK], Broué and Malle [BM], and Ariki [Ari]. In this paper we give Murnaghan-Nakayama type formulas for computing the irreducible characters of these algebras. Our method is a generalization of that in our earlier paper [HR] in which we derived Murnagha...

Some problems concerning the decomposition of certain characters of SL( n, C) are studied from a combinatorial point of view. The specific characters considered include those of the exterior and symmetric algebras of the adjoint representation and the Euler characteristic of Hanlon's so-called "Macdonald complex." A general recursion is given for computing the irreducible decomposition of these...

Video game virtual characters should interact with the player, each other, and the environment. However, the cost of scripting complex behaviors becomes a bottleneck in content creation. Our goal is to help game designers to more easily populate their open world with background characters that exhibit more believable behaviors. We use a cyclic scheduling model that generates dynamic schedules f...

Interpreting, modeling and representing emotions is a key feature of new generation games. This paper describes the first version of the Emotional Engine we have developed as a component of more complex behavior simulators. The purpose of this module is to manage the state and behavior of the characters present in a scene while they interact with a human user. We use preexistent language recogn...

While bi-directional long short-term (BLSTM) neural network have been demonstrated to perform very well for English or Arabic, the huge number of different output classes (characters) encountered in many Asian fonts, poses a severe challenge. In this work we investigate different encoding schemes of Bangla compound characters and compare the recognition accuracies. We propose to model complex c...

This paper presents the results of a comprehensive empirical study of the impact of integrating complex game characters in multi-player Role Playing Games across tabletop and digital formats. Players were provided with characters that had detailed background history, personality and goals. Player and character personality were assessed using the Extended Personal Attributes Questionnaire (EPAQ)...