Position Automaton Construction for Regular Expressions with Intersection

Positions and derivatives are two essential notions in the conversion methods from regular expressions to equivalent finite automata. Partial derivative based methods have recently been extended to regular expressions with intersection. In this paper, we present a position automaton construction for those expressions. This construction generalizes the notion of position making it compatible with intersection. The resulting automaton is homogeneous and has the partial derivative automaton as its quotient

Stretch goals and the distribution of organizational performance

Many academics, consultants, and managers advocate stretch goals to attain superior organizational performance. However, existing theory speculates that, although stretch goals may benefit some organizations, they are not a “rule for riches” for all organizations. To address this speculation, we use two experimental studies to explore the effects on the mean, median, variance, and skewness of performance of stretch compared with moderate goals. Participants were assigned moderate or stretch goals to manage a widely used business simulation. Compared with moderate goals, stretch goals improve performance for a few participants, but many abandon the stretch goals in favor of lower self-set goals, or adopt a survival goal when faced with the threat of bankruptcy. Consequently, stretch goals generate higher performance variance across organizations and a right-skewed performance distribution. Contrary to conventional wisdom, we find no positive stretch goal main effect on performance. Instead, stretch goals compared with moderate goals generate large attainment discrepancies that increase willingness to take risks, undermine goal commitment, and generate lower risk-adjusted performance. The results provide a richer theoretical and empirical appreciation of how stretch goals influence performance

Schemas for Unordered XML on a DIME

We investigate schema languages for unordered XML having no relative order among siblings. First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard concatenation, that define languages of unordered words to model the allowed content of a node (i.e., collections of the labels of children). However, unrestricted UREs are computationally too expensive as we show the intractability of two fundamental decision problems for UREs: membership of an unordered word to the language of a URE and containment of two UREs. Consequently, we propose a practical and tractable restriction of UREs, disjunctive interval multiplicity expressions (DIMEs). Next, we employ DIMEs to define languages of unordered trees and propose two schema languages: disjunctive interval multiplicity schema (DIMS), and its restriction, disjunction-free interval multiplicity schema (IMS). We study the complexity of the following static analysis problems: schema satisfiability, membership of a tree to the language of a schema, schema containment, as well as twig query satisfiability, implication, and containment in the presence of schema. Finally, we study the expressive power of the proposed schema languages and compare them with yardstick languages of unordered trees (FO, MSO, and Presburger constraints) and DTDs under commutative closure. Our results show that the proposed schema languages are capable of expressing many practical languages of unordered trees and enjoy desirable computational properties.Comment: Theory of Computing System

Genome-Wide Integration on Transcription Factors, Histone Acetylation and Gene Expression Reveals Genes Co-Regulated by Histone Modification Patterns

N-terminal tails of H2A, H2B, H3 and H4 histone families are subjected to posttranslational modifications that take part in transcriptional regulation mechanisms, such as transcription factor binding and gene expression. Regulation mechanisms under control of histone modification are important but remain largely unclear, despite of emerging datasets for comprehensive analysis of histone modification. In this paper, we focus on what we call genetic harmonious units (GHUs), which are co-occurring patterns among transcription factor binding, gene expression and histone modification. We present the first genome-wide approach that captures GHUs by combining ChIP-chip with microarray datasets from Saccharomyces cerevisiae. Our approach employs noise-robust soft clustering to select patterns which share the same preferences in transcription factor-binding, histone modification and gene expression, which are all currently implied to be closely correlated. The detected patterns are a well-studied acetylation of lysine 16 of H4 in glucose depletion as well as co-acetylation of five lysine residues of H3 with H4 Lys12 and H2A Lys7 responsible for ribosome biogenesis. Furthermore, our method further suggested the recognition of acetylated H4 Lys16 being crucial to histone acetyltransferase ESA1, whose essential role is still under controversy, from a microarray dataset on ESA1 and its bypass suppressor mutants. These results demonstrate that our approach allows us to provide clearer principles behind gene regulation mechanisms under histone modifications and detect GHUs further by applying to other microarray and ChIP-chip datasets. The source code of our method, which was implemented in MATLAB (http://www.mathworks.com/), is available from the supporting page for this paper: http://www.bic.kyoto-u.ac.jp/pathway/natsume/hm_detector.htm

Session No. 7 Pattern Recognition I General Papers 333 VISUAL DETECTION OF NOISY PATTERNS

Experiments are reported in which the quantum noise limitation of visual thresholds is explored further by the addition of noise to test patterns presented to the observers. The results show the characteristics predicted by a statistical theory of vision developed to account for the influence of the added noise, which was reported earlier. In particular, these measurements make it possible to calculate independent values for quantum efficiency and for Rose's factor of certainty. List of Symbols the area of summation of the eye the effective area of the stimulus (se

Regular Expressions with Counting: Weak versus Strong Determinism

Abstract. We study deterministic regular expressions extended with the counting operator. There exist two notions of determinism, strong and weak determinism, which almost coincide for standard regular expressions. This, however, changes dramatically in the presence of counting. In particular, we show that weakly deterministic expressions with counting are exponentially more succinct and strictly more expressive than strongly deterministic ones, even though they still do not capture all regular languages. In addition, we present a finite automaton model with counters, study its properties and investigate the natural extension of the Glushkov construction translating expressions with counting into such counting automata. This translation yields a deterministic automaton if and only if the expression is strongly deterministic. These results then also allow to derive upper bounds for decision problems for strongly deterministic expressions with counting.