Samples of spontaneous and descriptive speech were obtained from 12 patients with Huntington's disease (HD) and 24 at risk (AR) controls. The data were assessed according to a neurolinguistic protocol. HD was identified with a significant reduction in number of words produced, a diminished level of syntactic complexity, reductions of melodic line, phrase length, articulatory agility, and gramma...

Abstract Nouns and verbs are known to differ in the types of grammatical information they encode. What is less well relationship between verbal nominal coding within across languages. The equi-complexity hypothesis holds that all languages equally complex overall, which entails trade-offs different domains. From a diachronic point view, this implies loss gain domains can be expected balance eac...

By selecting the largest possible value of k ∈ (n/2, 2n/3], we further reduce the AND and XOR gate complexities of the CRT-based hybrid parallel GF (2) polynomial basis multipliers for the irreducible trinomial f = u + u + 1 over GF (2): they are always less than those of the current fastest parallel multipliers – quadratic multipliers, i.e., n AND gates and n− 1 XOR gates. Our experimental res...

Guarded fragments of rst-order logic were recently introduced by Andr eka, van Benthem and N emeti; they consist of relational rst-order formulae whose quantiiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidabl...

It is often wrongly assumed that the provision of teacher corrective feedback naturally entails learners' attendance to and application of it, but learners have repeatedly been reported not to pay attention to teacher feedback due to lack of motivation and the distracting effect of the grades they receive. The present study was an attempt to tackle this problem. To do so, the technique named Dr...

Title of dissertation: BINDING PHENOMENA WITHIN A REDUCTIONIST THEORY OF GRAMMATICAL DEPENDENCIES Alex Drummond, Doctor of Philosophy, 2011 Dissertation directed by Norbert Hornstein Department of Linguistics This thesis investigates the implications of binding phenomena for the development of a reductionist theory of grammatical dependencies. The starting point is the analysis of binding and c...

A small-biased distribution of bit sequences is defined as one withstanding GF (2)-linear tests for randomness, which are linear combinations of the bits themselves. We consider linear combinations over larger fields, specifically, GF (2) for n that divides the length of the bit sequence. Indeed, this means that we partition the bits to blocks of length n and treat each block as the representat...

The linear complexity of a periodic sequence over GF (p) play an important role in cryptography and communication([1]). In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of an arbitrary period un (where u|p−1, gcd(n, p −1) = 1) sequence over GF (p) to the computation of the linear complexities and minimal connectio...

In this paper, we focus on exact, deterministic algorithms for computing the number of models in Boolean formulas in Two Conjuntive Form (2-CF), denoted as #2-SAT problem. We present a series of linear procedures which when they are integrated into a main program, allow us to compute in polynomial time the number of models of a formula F in 2-CF when the constraint graph GF holds the following ...

Non-linear equation systems arise in many problems. It is well known that solving such systems is NP-complete in general. In this paper we present a method for solving sparse non-linear equation systems, using ideas from graph based iterative decoding techniques. The motivation for doing this comes from cryptanalysis, and we try to attack DES using our method. We show that it is easy to break t...