Dynamic Complexity of Formal Languages

The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained using quantifier-free first-order updates, with and without auxiliary functions, respectively. It is shown that the languages maintainable in DynPROP exactly are the regular languages, even when allowing arbitrary precomputation. This enables lower bounds for DynPROP and separates DynPROP from DynQF and DynFO. Further, it is shown that any context-free language can be maintained in DynFO and a number of specific context-free languages, for example all Dyck-languages, are maintainable in DynQF. Furthermore, the dynamic complexity of regular tree languages is investigated and some results concerning arbitrary structures are obtained: there exist first-order definable properties which are not maintainable in DynPROP. On the other hand any existential first-order property can be maintained in DynQF when allowing precomputation.Comment: Contains the material presenten at STACS 2009, extendes with proofs and examples which were omitted due lack of spac

On the relationship between +/- ratings and event-level performance statistics

This work considers the challenge of identifying and properly assessing the contribution of a single player towards the performance of a team. In particular, we study the use of advanced plus-minus ratings for individual football players, which involves evaluating a player based on the goals scored and conceded with the player appearing on the pitch, while compensating for the quality of the opponents and the teammates as well as other factors. To increase the understanding of plus-minus ratings, event-based data from matches are first used to explain the observed variance of ratings, and then to improve their ability to predict outcomes of football matches. It is found that event-level performance statistics can explain from 22% to 38% of the variance in plus-minus ratings, depending on player positions, while incorporating the event-level statistics only marginally improves the predictive power of plus-minus ratings.publishedVersio

IQ, cultural values, and the technological achievement of nations.

It is shown that the technological capabilities of a nation are related to national IQ. Nations with a higher percentage of high-IQ individuals generate more technological knowledge (as measured by patents granted per head of population) than other nations. Technological achievement is also shown to mediate the relationship between national IQ and per-capita GDP, suggesting that high-IQ nations are wealthier partly because they are more successful at generating technological knowledge. Additional variance in technological achievement, beyond that explained by IQ, is accounted for by cultural values; nations that value intellectual autonomy and social equality produce more technological knowledge. Intellectual autonomy was also found to moderate the relationship between technological achievement and national IQ, suggesting that technological progress is enhanced where high-IQ individuals live in an intellectually open environment

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection

Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent nondeterministic finite automata (NFA). For practical purposes it is important to study the average behaviour of conversions between these models. In this paper, we focus on the conversion of regular expressions with intersection to nondeterministic finite automata, using partial derivatives and the notion of support. First, we give a tight upper bound of 2O(n) for the worst-case number of states of the resulting partial derivative automaton, where n is the size of the expression. Using the framework of analytic combinatorics, we then establish an upper bound of (1.056 + o(1))n for its asymptotic average-state complexity, which is significantly smaller than the one for the worst case. (c) IFIP International Federation for Information Processing 2016

Complexity and composition of synthesized web services

The paper investigates fundamental decision problems and composition synthesis for Web services commonly found in practice. We propose a notion of synthesized Web services (SWS’s) to specify the behaviors of the services. Upon receiving a sequence of input messages, an SWS issues multiple queries to a database and generates actions, in parallel; it produces external messages and database updates by synthesizing the actions parallelly generated. In contrast to previous models for Web services, SWS’s advocate parallel processing and (deterministic) synthesis of actions. We classify SWS’s based on what queries an SWS can issue, how the synthesis of actions is expressed, and whether unbounded input sequences are allowed in a single interaction session. We show that the behaviors of Web services supported by various prior models, data-driven or not, can be specified by different SWS classes. For each of these classes we study the non-emptiness, validation and equivalence problems, and establish matching upper and lower bounds on these problems. We also provide complexity bounds on composition synthesis for these SWS classes, identifying decidable cases

Parameterized Regular Expressions and their Languages

We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly semantics, the word must be denoted by every such expression. Such languages are regular, and we show that they naturally arise in several applications such as querying graph databases and program analysis. As the main contribution of the paper, we provide a complete characterization of the complexity of the main computational problems related to such languages: nonemptiness, universality, containment, membership, as well as the problem of constructing NFAs capturing such languages. We also look at the extension when domains of variables could be arbitrary regular languages, and show that under the certainty semantics, languages remain regular and the complexity of the main computational problems does not change

Ultrastructural localization of rRNA shows defective nuclear export of preribosomes in mutants of the Nup82p complex

To study the nuclear export of preribosomes, ribosomal RNAs were detected by in situ hybridization using fluorescence and EM, in the yeast Saccharomyces cerevisiae. In wild-type cells, semiquantitative analysis shows that the distributions of pre-40S and pre-60S particles in the nucleolus and the nucleoplasm are distinct, indicating uncoordinated transport of the two subunits within the nucleus. In cells defective for the activity of the GTPase Gsp1p/Ran, ribosomal precursors accumulate in the whole nucleus. This phenotype is reproduced with pre-60S particles in cells defective in pre-rRNA processing, whereas pre-40S particles only accumulate in the nucleolus, suggesting a tight control of the exit of the small subunit from the nucleolus. Examination of nucleoporin mutants reveals that preribosome nuclear export requires the Nup82p–Nup159p–Nsp1p complex. In contrast, mutations in the nucleoporins forming the Nup84p complex yield very mild or no nuclear accumulation of preribosome. Interestingly, domains of Nup159p required for mRNP trafficking are not necessary for preribosome export. Furthermore, the RNA helicase Dbp5p and the protein Gle1p, which interact with Nup159p and are involved in mRNP trafficking, are dispensable for ribosomal transport. Thus, the Nup82p–Nup159p–Nsp1p nucleoporin complex is part of the nuclear export pathways of preribosomes and mRNPs, but with distinct functions in these two processes

Learning curves of theta/beta neurofeedback in children with ADHD

Neurofeedback is widely applied as non-pharmacological intervention aimed at reducing symptoms of ADHD, even though efficacy has not been unequivocally established. Neuronal changes during the neurofeedback intervention that resemble learning can provide crucial evidence for the feasibility and specificity of this intervention. A total of 38 children (aged between 7 and 13 years) with a DSM-IV-TR diagnosis of ADHD, completed on average 29 sessions of theta (4–8 Hz)/beta (13–20 Hz) neurofeedback training. Dependent variables included training-related measures as well as theta and beta power during baseline and training runs for each session. Learning effects were analyzed both within and between sessions. To further specify findings, individual learning curves were explored and correlated with behavioral changes in ADHD symptoms. Over the course of the training, there was a linear increase in participants’ mean training level, highest obtained training level and the number of earned credits (range b = 0.059, −0.750, p b = 0.004, 95% CI = [0.0013–0.0067], p = 0.005) and over the course of the intervention (b = 0.0052, 95% CI = [0.0039–0.0065], p https://clinicaltrials.gov/show/NCT01363544.Multivariate analysis of psychological dat