Numerical phenetic methods organize taxa (operational taxonomic units, or OTUs) into groups based on overall similarity. OTUs are grouped in such a way that there is a higher degree of similarity within groups than between groups. That is, two OTUs within a group share more character states than do two OTUs in different groups. The least inclusive (smallest) groups represent the highest level o...

In this paper, ‘T’ character-type array antenna system is proposed which estimates the directions of arrival (DOA) by the virtual uniform rectangular arrays. The proposed system consists of 4 antenna elements distributed like the character ‘T’. The performance of the proposed system in DOA estimation is evaluated by some simulation and experiments. First we show that DOA is estimated correctly ...

Let G be a finite group and let cd(G) be the set of irreducible character degrees of G. The degree graph ∆(G) is the graph whose set of vertices is the set of primes that divide degrees in cd(G), with an edge between p and q if pq divides a for some degree a ∈ cd(G). It is shown using the degree graphs of the finite simple groups that if G is a nonsolvable group, then the diameter of ∆(G) is at...

BACKGROUND Organisms use a variety of mechanisms to protect themselves against perturbations. For example, repair mechanisms fix damage, feedback loops keep homeostatic systems at their setpoints, and biochemical filters distinguish signal from noise. Such buffering mechanisms are often discussed in terms of robustness, which may be measured by reduced sensitivity of performance to perturbation...

The main theme of this paper is Chinese character recognition using a fuzzy proximity measure. The paper discusses in brief the techniques used for processing hand-written Chinese characters using the dominant point algorithm. The procedure is used to extract a total of twelve character variables for final analysis. The analysis in this paper is based on the leave-one-out method of cross valida...

The effects of restrictions of available character space on the mean morphological distance between living members of evolutionary phylads are examined by Monte Carlo simulation. The approach involves specifying the degree to which ancestor-descendant species may differ and limiting the range of attainable character states within a phylad. Morphological evolution is modeled as a Markovian proce...

We develop networks using the syllables (both base syllables and tonal syllables) and characters of Chinese. The nodes (vertices) of the networks represent the syllables of the syllable network and the characters of the character network respectively. The links (edges) are established between any two syllables (or two characters) that form part of one or more words. We use two dictionaries to p...

Definition 9.1.3. An additive character of F is a character of the additive group F, i.e. a map χ : (F,+) → T, with χ(a+ b) = χ(a)χ(b). Now, let Fq denote the field of order q = p . We can define it by Fq := Fp[x]/(f), where f is any irreducible polynomial of degree k. We know that Fq is a cyclic group of order q − 1, and is generated by some g ∈ Fq (in other word Fq = 〈g〉). That is, g = 1 and ...

Performance has a spontaneity and “aliveness” that can be difficult to capture in more methodical animation processes such as keyframing. Access to performance animation has traditionally been limited to either low degree of freedom characters or required expensive hardware. We present a performance-based animation system for humanoid characters that requires no special hardware, relying only o...