for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...

In this study, we examine the identity exploration possibilities presented by online multiplayer games in which players use graphics tools and character-creation software to construct an avatar, or character. We predicted World of Warcraft players would create their main character more similar to their ideal self than the players themselves were. Our results support this idea; a sample of playe...

This paper presents the three scripting commands and main functionalities of a novel character animation environment called CHASE. CHASE was developed for enabling inexperienced programmers, animators, artists, and students to animate in meaningful ways virtual reality characters. This is achieved by scripting simple commands within CHASE. The commands identified, which are associated with simp...

The recent advances in computer technology many recognition task have been automated. OCR, Optical Character Recognition is a scheme of converting the images of typewritten or printed text into a format that is understood by machine. The goal of OCR is to classify the given character data represented by some characteristics, into a predefined finite number of character classes. For the recognit...

In this paper we describe a new way to improve the usability of complex hardware setups in Instrumented Environments (IEs). By introducing a virtual character, we facilitate intuitive interaction with our IE. The character is capable of freely moving along the walls of the room. In this way, it may offer situated assistance to users within the environment. We make use of a steerable projector a...

This paper considers how many character comparisons are needed to find all occurrences of a pattern of length m in a text of length n. The main contribution is to show an upper bound of the form of n + O(n/m) character comparisons, following preprocessing. Specifically, we show an upper bound of n + 8 3(m+1) (n −m) character comparisons. This bound is achieved by an online algorithm which perfo...

A study was conducted which aimed to determine whether varying attractiveness and character integrity significantly affected the severity of the crime which participants associated with defendant portraits. Participants were shown attractive and unattractive portraits that were paired with a positive, negative or no-character statement. It was predicated that both variables would have effects o...

The character segmentation technology for printed documents plays an important role in optical character recognition, ticket information identification, postal code identification, automatic license plate recognition and so on. In this paper, a Chinese characters segmentation algorithm for complicated printed documents is proposed for the application in paper watermarking system. In this applic...