Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, L...

This research investigated contrastive perception of L1 phonological categories in Albanian–English bilinguals who returned to Albania after living abroad for over on average a decade. In Standard Albanian, there are phonemic contrasts between /c/ and /tʃ/, /ɫ/ /l/, /ɹ/ /r/. These do not occur English. Using “real speech” binary minimal pair identification task, we compared the accuracy respons...

This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we introduce techniques for inducing new rules using answer sets of the program. The produced new rules explain positive/negative examples in the context of inductive logic programming. The result of this paper combines tec...

This is the main entry point for the scheduler. This method has to be overridden to implement the scheduling algorithm. It is called from the JVM on a timed event or a software interrupt (see genInt()) is issued (e.g. when a Task gives up execution). vo i d i n t e r r u p t ( i n t nr ) The scheduler is notified on a hardware event. It can directly call an associated device driver or use this ...

We discuss a discrete optimization problem that arises in data analysis from the binarization of categorical attributes. It can be described as the maximization of a function F (l1(x), l2(x)), where l1(x) and l2(x) are linear functions of binary variables x ∈ {0, 1}n, and F : R2 −→ R. Though this problem is NP-hard, in general, an optimal solution x∗ of it can be found, under some mild monotoni...

We study the problem of Robust Least Squares Regression (RLSR) where several response variables can be adversarially corrupted. More specifically, for a data matrix X ∈ Rp×n and an underlying model w∗, the response vector is generated as y = XTw∗+b where b ∈ R is the corruption vector supported over at most C ·n coordinates. Existing exact recovery results for RLSR focus solely on L1-penalty ba...

Safe, effective, orally delivered, live adenovirus vaccines have been in use for three decades. Recombinant derivatives of the live adenovirus vaccines may prove an economical alternative to current vaccines for a variety of diseases. To explore that possibility, we constructed a series of recombinants that express the major capsid protein (L1) of canine oral papillomavirus (COPV), a model for ...

The CXXR project aims gradually to reengineer the fundamental parts of the R interpreter from C into C++ in such a way that: • the full functionality of the standard distribution of R (including the recommended packages) is preserved; • the behaviour of R code is unaffected (unless it probes into interpreter internals); • there is no change to the existing interfaces for calling out from R to o...