We study the class coNPMV of complements of NPMV functions. Though defined symmetrically to NPMV, this class exhibits very different properties. We clarify the complexity of coNPMV by showing that it is essentially the same as that of NPMVNP. Complete functions for coNPMV are exhibited and central complexity-theoretic properties of this class are studied. We show that computing maximum satisfyi...

PerformanceOperation implements DeriveMetricOperation PerformanceResult AbstractResult implementsResult implements TrialResult extends extends FIGURE 17: PerfExplorer script object hierarchy. AbstractPerformanceOperation class, and will take one more more input data sets with two or more metrics each, and generate a derived metric representing either the addition, subtraction, multiplication, o...

In this paper, we propose a Dynamic Naive Bayesian (DNB) network model for classifying data sets with hierarchical labels. The DNB model is built upon a Naive Bayesian (NB) network, a successful classifier for data with flattened (nonhierarchical) class labels. The problems using flattened class labels for hierarchical classification are addressed in this paper. The DNB has a top-down structure...

Dopamine (DA) plays significant roles in regulation of social behavior. In social groups of humans and other animals, social hierarchy exists, which is determined by several behavioral characteristics such as aggression and impulsivity as well as social affiliations. In this study, we investigated the effects of pharmacological blockade of DA D2 receptor on social hierarchy of Japanese macaque ...

We show that the Borel hierarchy of the class of context free ω-languages, or even of the class of ω-languages accepted by Büchi 1-counter automata, is the same as the Borel hierarchy of the class of ω-languages accepted by Turing machines with a Büchi acceptance condition. In particular, for each recursive non null ordinal α, there exist some Σ α -complete and some Π α -complete ω-languages ac...

The class NPkV consists of those partial, multivalued functions that can be computed by a nondeterministic, polynomial time-bounded transducer that has at most k distinct values on any input. We define the output-multiplicity hierarchy to consist of the collection of classes NPkV, for all positive integers k 1. In this paper we investigate the strictness of the output-multiplicity hierarchy and...

We show that in monadic second-order logic over finite directed graphs, a strict hierarchy of expressiveness is obtained by increasing the (second-order) quantifier alternation depth of formulas. Thus, the “monadic analogue” of the polynomial hierarchy is found to be strict, which solves a problem of Fagin. The proof is based on automata theoretic concepts (rather than Ehrenfeucht-Fraı̈ssé games...

A N = 4 supersymmetric matrix KP hierarchy is proposed and a wide class of its reductions which are characterized by a finite number of fields are described. This class includes the one-dimensional reduction of the two-dimensional N = (2|2) superconformal Toda lattice hierarchy possessing the N = 4 supersymmetry – the N = 4 Toda chain hierarchy – which may be relevant in the construction of sup...

A N = 4 supersymmetric matrix KP hierarchy is proposed and a wide class of its reductions which are characterized by a finite number of fields are described. This class includes the one-dimensional reduction of the two-dimensional N = (2|2) superconformal Toda lattice hierarchy possessing the N = 4 supersymmetry – the N = 4 Toda chain hierarchy – which may be relevant in the construction of sup...

The ability to de ne overloaded operators and generic templated classes in C++, provides a mechanism for the de nition of array classes. We present an array class hierarchy that can be substituted for builtin arrays in a given C program, with minimal changes to the actual code and no change in the run-time semantics of the program. This augments our previous work that developed a class hierarch...