Many bioinformatics problems deal with chemical concentrations that should be non-negative. Non-negative matrix factorization (NMF) is an approach to take advantage of non-negativity in data. We have recently developed sparse NMF algorithms via alternating nonnegativity-constrained least squares in order to obtain sparser basis vectors or sparser mixing coefficients for each sample, which lead ...

In order to be able to account for the alternating and non-alternating uses of mood in Spanish this paper explores the field of illocution and modality and argues for two elaborations of the Functional Grammar framework: (i) a representation of main clauses which distinguishes between several layers, each representing a different subact of the speech act, and (ii) a representation of noun claus...

Children seem to be relatively delayed in their comprehension of the verbal be-passive English, compared acquisition other constructions object-movement such as wh-questions and unaccusatives. Prior work has found that children’s performance on these passives can affected by verb’s lexical semantics. Through a meta-analysis experimental studies assessing English-speaking age for be- passive, we...

Using exhaustive techniques and results from Lackenby many others, we compute the tunnel number of all 1655 alternating 11 12 crossing knots 881 non-alternating knots. We also find 5525 Montesinos with 14 crossings or fewer.

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all ω-regular specifications while still maintaining many of LTL’s desirable properties like an intuitive syntax and a translation into non-dete...

Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for pebble automata with “strong pebble handling” which means that pebbles can be lifted independently of the position of the reading head and withou...

We study the generating functions for pattern-restricted k-ary words of length n corresponding to the longest alternating subsequence statistic in which the pattern is any one of the six permutations of length three.

We present some new results on realtime classical and quantum alternating models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we define realtime private alternating finite automata (PAFAs) and show that they can recognize some non-regular unary languages, and the emptiness problem is undecidable for them. Moreover, PA...

The notion of almost alternating links was introduced by C. Adams et al ([1]). Here we give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. This solves a question asked in [1]. A partial solution for special almost alternating links has been obtained by M. Hirasawa ([4]). As its applications, Theorem 2.3 gives us a way to see if a given almost a...

This study explores syntactic, pragmatic, and lexical influences on adherence to SV and VS orders in native and fluent L2 speakers of Spanish. A judgment task examined 20 native monolingual and 20 longstanding L2 bilingual Spanish speakers' acceptance of SV and VS structures. Seventy-six distinct verbs were tested under a combination of syntactic and pragmatic constraints. Our findings challeng...