Showing papers on "Character (mathematics) published in 2010"

Narrative planning: balancing plot and character

Abstract: Narrative, and in particular storytelling, is an important part of the human experience. Consequently, computational systems that can reason about narrative can be more effective communicators, entertainers, educators, and trainers. One of the central challenges in computational narrative reasoning is narrative generation, the automated creation of meaningful event sequences. There are many factors - logical and aesthetic - that contribute to the success of a narrative artifact. Central to this success is its understandability. We argue that the following two attributes of narratives are universal: (a) the logical causal progression of plot, and (b) character believability. Character believability is the perception by the audience that the actions performed by characters do not negatively impact the audience's suspension of disbelief. Specifically, characters must be perceived by the audience to be intentional agents. In this article, we explore the use of refinement search as a technique for solving the narrative generation problem - to find a sound and believable sequence of character actions that transforms an initial world state into a world state in which goal propositions hold. We describe a novel refinement search planning algorithm - the Intent-based Partial Order Causal Link (IPOCL) planner - that, in addition to creating causally sound plot progression, reasons about character intentionality by identifying possible character goals that explain their actions and creating plan structures that explain why those characters commit to their goals. We present the results of an empirical evaluation that demonstrates that narrative plans generated by the IPOCL algorithm support audience comprehension of character intentions better than plans generated by conventional partial-order planners.

The SEMAINE corpus of emotionally coloured character interactions

Abstract: We have recorded a new corpus of emotionally coloured conversations Users were recorded while holding conversations with an operator who adopts in sequence four roles designed to evoke emotional reactions The operator and the user are seated in separate rooms; they see each other through teleprompter screens, and hear each other through speakers To allow high quality recording, they are recorded by five high-resolution, high framerate cameras, and by four microphones All sensor information is recorded synchronously, with an accuracy of 25 μs In total, we have recorded 20 participants, for a total of 100 character conversational and 50 non-conversational recordings of approximately 5 minutes each All recorded conversations have been fully transcribed and annotated for five affective dimensions and partially annotated for 27 other dimensions The corpus has been made available to the scientific community through a web-accessible database

Computer Controlled Video Game Incorporating Constraints

Abstract: In an embodiment, a computer controlled video game maintains one or more environments and permits control of the quantity and distribution of parameters, such as resources, materials and character attribute/skills. A player character can use and modify such parameters.

Voice models for document narration

Abstract: Disclosed are techniques and systems to provide a narration of a text in multiple different voices. Further disclosed are techniques and systems for modifying a voice model associated with a selected character based on data received from a user.

The Different Forms of Flowers on Plants of the Same Species: CONCLUDING REMARKS ON HETEROSTYLED PLANTS

Abstract: I n the foregoing chapters all the heterostyled plants known to me have been more or less fully described Several other cases have been indicated, especially by Professor Asa Gray and Kuhn, in which the individuals of the same species differ in the length of their stamens and pistils; but as I have been often deceived by this character taken alone, it seems to me the more prudent course not to rank any species as heterostyled, unless we have evidence of more important differences between the forms, as in the diameter of the pollen-grains, or in the structure of the stigma The individuals of many ordinary hermaphrodite plants habitually fertilise one another, owing to their male and female organs being mature at different periods, or to the structure of the parts, or to self-sterility, c and so it is with many hermaphrodite animals, for instance, land-snails or earth-worms ; but in all these cases any one individual can fully fertilise or be fertilised by any other individual of the same species This is not so with heterostyled plants: a long-styled, mid-styled or short-styled plant cannot fully fertilise or be fertilised by any other individual, but only by one belonging to another form Thus the essential character of plants belonging to the heterostyled class is that the individuals are divided into two or three bodies, like the males and females of dioecious plants or of the higher animals, which exist in approximately equal numbers and are adapted for reciprocal fertilisation

Cohomology of generalized supergrassmannians and character formulae for basic classical Lie superalgebras

Abstract: We use geometrical methods adapted from Borel-Weil-Bott theory to compute the character of every finite dimensional simple module over a basic classical Lie superalgebra. The answer is given by a combinatorial algorithm in terms of weight and cap diagrams, which were defined by Brundan and Stroppel for the general linear superalgebra. AMS subject classification 20G05, 14F05.

The Mukai pairing. I. A categorical approach

Abstract: We study the Hochschild homology of smooth spaces, em- phasizing the importance of a pairing which generalizes Mukai's pairing on the cohomology of K3 surfaces. We show that integral transforms be- tween derived categories of spaces functorially induce linear maps on ho- mology. Adjoint functors induce adjoint linear maps with respect to the Mukai pairing. We define a Chern character with values in Hochschild homology, and we discuss analogues of the Hirzebruch-Riemann-Roch theorem and the Cardy Condition from physics. This is done in the con- text of a 2-category which has spaces as its objects and integral kernels as its 1-morphisms.

Simplified Feature Set for Arabic Named Entity Recognition

Abstract: This paper introduces simplified yet effective features that can robustly identify named entities in Arabic text without the need for morphological or syntactic analysis or gazetteers. A CRF sequence labeling model is trained on features that primarily use character n-gram of leading and trailing letters in words and word n-grams. The proposed features help overcome some of the morphological and orthgraphic complexities of Arabic. In comparing to results in the literature using Arabic specific features such POS tags on the same dataset and same CRF implementation, the results in this paper are lower by 2 F-measure points for locations, but are better by 8 points for organizations and 9 points for persons.

Miniature character input mechanism

Abstract: A device includes a touch screen with a maximum of nine distinct touch areas, displays an input interface on the touch screen, where the input interface includes a scrollable character wheel, receives selections of characters from the character wheel, and displays the selected characters on the user interface. The receiving of selections includes detecting a scrolling up or down of the character wheel to position a character in a particular location, and detecting a pressing action on the character in the particular location. The input interface provides a way for a user to enter a phone number and place a call using only nine distinct touch areas.

Bounding sup-norms of cusp forms of large level

Abstract: Let f be an L 2-normalized weight zero Hecke-Maas cusp form of square-free level N, character χ and Laplacian eigenvalue λ≥1/4. It is shown that ‖f‖∞≪ λ N −1/37, from which the hybrid bound ‖f‖∞≪λ 1/4(N λ)−δ (for some δ>0) is derived. The first bound holds also for f=y k/2 F where F is a holomorphic cusp form of weight k with the implied constant now depending on k.

On teaching to be critical

Abstract: What is it to teach a child to be critical, and how can we tell whether we have been successful in doing so? Is it a matter of imparting facts, of inculcating habits, of training in skills, of developing capacities, of forming the character, or something different from any of these?

Recognition of Isolated Handwritten Characters in Gurmukhi Script

Abstract: Isolated handwritten character recognition has been the subject of intensive research during last decades because it is useful in wide range of real world problems. It also provides a solution for processing large volumes of data automatically. Work has been done in recognizing handwritten characters in many languages like Chinese, Arabic, Devnagari, Urdu and English. The work presented in this thesis, focuses on the problem of recognition of isolated handwritten characters in Gurmukhi script. The whole process consists of two stages. The first, feature extraction stage analyzes the set of isolated characters and selects a set of features that can be used to uniquely identify characters. The performance of recognition system depends heavily on what features are being used. The selection of stable and representative set of features is the heart of recognition system. The feature extraction method Zoning, is used for extracting features of the character under consideration in this problem. In Zoning method, the frame containing the character is divided into several overlapping or non-overlapping zones and the densities of object pixels in each zone are calculated. Densities are used to form a representation. The final, classification stage is the main decision making stage of the recognition system. It uses features extracted in the feature extraction stage to identify the character. K-Nearest Neighbor and Support Vector Machine are the two classifiers used for identifying the character in the problem. In k-nearest classification method, the Euclidean distance between the test point and all the reference points is calculated in order to find K nearest neighbors, and then the obtained distances are ranked in ascending order and the reference points corresponding to the k smallest Euclidean distances are taken. The Support Vector Machine (SVM) is learning machine with very good generalization ability. SVM implements the Structural Risk Minimization Principal which seeks to minimize an upper bound of the generalization error. An SVM classifier discriminates two classes of feature vectors by generating hyper-surfaces in the feature space, which are "optimal" in a specific sense that is the hyper-surface obtained by the SVM optimization is guaranteed to have the maximum distance to the "nearest” support vectors. SVM operate on kernel evaluations of the feature vectors. An annotated sample image database of isolated handwritten characters in Gurmukhi script has been prepared which has been used for training and testing of the system.

Airwriting recognition using wearable motion sensors

Abstract: In this work we present a wearable input device which enables the user to input text into a computer. The text is written into the air via character gestures, like using an imaginary blackboard. To allow hands-free operation, we designed and implemented a data glove, equipped with three gyroscopes and three accelerometers to measure hand motion. Data is sent wirelessly to the computer via Bluetooth. We use HMMs for character recognition and concatenated character models for word recognition. As features we apply normalized raw sensor signals. Experiments on single character and word recognition are performed to evaluate the end-to-end system. On a character database with 10 writers, we achieve an average writer-dependent character recognition rate of 94.8% and a writer-independent character recognition rate of 81.9%. Based on a small vocabulary of 652 words, we achieve a single-writer word recognition rate of 97.5%, a performance we deem is advisable for many applications. The final system is integrated into an online word recognition demonstration system to showcase its applicability.

Chinese character decoding: a semantic bias?

Abstract: The effects of semantic and phonetic radicals on Chinese character decoding were examined. Our results suggest that semantic and phonetic radicals are each available for access when a corresponding task emphasizes one or the other kind of radical. But in a more neutral lexical recognition task, the semantic radical is more informative. Semantic radicals that correctly pertain to character meaning facilitated reaction time in semantic categorization tasks (Experiment #1), while radicals that had no immediately interpretable relation to character meaning had a strong inhibitory effect. Likewise, phonetic radicals that accurately indicated a character’s pronunciation facilitated a homonym recognition task (Experiment #2), whereas phonetic radicals that differed significantly in pronunciation from their character inhibited homonym recognition. In a lexical decision task (Experiment #3) where each character had either a blurred semantic radical or a blurred phonetic radical, the characters with a blurred semantic radical elicited a significantly higher error rate and a trend for longer response times. These results are interpreted to indicate that while educated native Chinese speakers have full use of both semantic and phonetic paths to character decoding, there is a slight predisposition to semantic decoding strategies over phonetic ones indicating that the semantic path is the default means of character recognition.

Device, method and program for inputting character

Abstract: PROBLEM TO BE SOLVED: To provide a character input device, or the like which facilitates a touch typing using a software keyboard. SOLUTION: The character input device includes: a display part for displaying an image; an input part arranged to be overlapped with the display part for detecting the touch input of an operator; and a control part for making a display part display a software keyboard and for, when it is detected that the image of one key of the software keyboard has been touched by an input detection part, making the display part display a character corresponding to a key in touch in a character input area of the display part as an input candidate character, and for, when it is detected that the operation, for determining the input candidate character, has been performed by the input detection part, making the display part display the input candidate character in the character input area of the display part as an input character configuring an input character string. COPYRIGHT: (C)2011,JPO&INPIT

On ordered -semigroups

Abstract: In this paper we show the way we pass from ordered semigroups to ordered -semigroups. Moreover we show that, exactly as in ordered semigroups, in the results of ordered -semigroups based on right (left) ideals, quasi-ideals and bi-ideals, points do not play any essential role, but the sets, which shows their pointless character. Under the methodology using in this paper, all the results of ordered semigroups can be transferred into ordered -semigroups.

Systems and Methods for Challenge-Response Animation and Randomization Testing

Abstract: Systems and methods are provided for challenge/response animation. In one implementation, a request for protected content may be received from a client, and the protected content may comprise data. A challenge phrase comprising a plurality of characters may be determined, and a computer processor may divide the challenge phrase into at least two character subsets selected from the characters comprising the challenge phrase. Each of the at least two character subsets may include less than all of the characters comprising the challenge phrase. The at least two character subsets may be sent to the client in response to the request; and an answer to the challenge phrase may be received from the client in response to the at least two character subsets. Access to the protected content may be limited based on whether the answer correctly solves the challenge phrase.

Support Vector Machine (SVM) for English Handwritten Character Recognition

Abstract: This paper proposes a recognition model for English handwritten (lowercase, uppercase and letter) character recognition that uses Freeman chain code (FCC) as the representation technique of an image character. Chain code representation gives the boundary of a character image in which the codes represent the direction of where is the location of the next pixel. An FCC method that uses 8-neighbourhood that starts from direction labelled as 1 to 8 is used. Randomized algorithm is used to generate the FCC. After that, features vector is built. The criteria of features to input the classification is the chain code that converted to 64 features. Support vector machine (SVM) is chosen for the classification step. NIST Databases are used as the data in the experiment. Our test results show that by applying the proposed model, we reached a relatively high accuracy for the problem of English handwritten recognition.

Predictive Text Entry for Input Devices

Abstract: Methods, systems, and apparatus, including computer program products, for providing predictive text functionality to input devices. In one aspect, a method includes receiving a selection of a first character from a plurality of characters displayed in a virtual representation of an input device; generating one or more first selectable suggestions based on the first character; and displaying the one or more first selectable suggestions proximate to the first character in the virtual representation of the input device. The first selectable suggestions are displayed closer to the first character than any of the plurality of characters normally displayed in the virtual representation of the input device.

Widening the Lens to Teach Character Education Alongside Standards Curriculum

Abstract: This article challenges policymakers, school leaders, and teachers to implement wide-scale and systematic teaching of character education in every classroom. In support of the idea that student character development should be a priority in all classes, I explain that youth need “decision-filters” to negotiate life's challenges. Further, the article illustrates how character education can be taught through various courses. Several state-level academic standards are analyzed to (1) identify cognitive instructional emphases and (2) determine relevant affective teachings for character instruction. As I explain, the teaching of character education can be integrated naturally with and taught alongside any state's standards-based curriculum. Rather than adding a new course to an already overloaded school curriculum, character education should be integrated with other subject areas and routinely taught through all classes and by all teachers.

Systems and methods for applying animations or motions to a character

Abstract: An virtual character such as an on-screen object, an avatar, an on-screen character, or the like may be animated using a live motion of a user and a pre-recorded motion. For example, a live motion of a user may be captured and a pre-recorded motion such as a pre-recorded artist generated motion, a pre-recorded motion of the user, and/or a programmatically controlled transformation may be received. The live motion may then be applied to a first portion of an the virtual character and the pre-recorded motion may be applied to a second portion of the virtual character such that the virtual character may be animated with a combination of the live and pre-recorded motions.

Character energy and link energy-based text extraction in scene images

Abstract: Extracting text objects from scene images is a challenging problem. In this paper, by investigating the properties of single characters and text objects, we propose a new text extraction approach for scene images. First, character energy is computed based on the similarity of stroke edges to detect candidate character regions, then link energy is calculated based on the spatial relationship and similarity between neighboring candidate character regions to group characters and eliminate false positives. We applied the approach on ICDAR dataset 2003. The experimental results demonstrate the validity of our method.