This pape~ describes an "intelligent" tutor of foreign language concepts and skills based upon state-of-the-art research in Intelligent reaching Systems and Computational Linguistics. The tutor is part of a large R&D project in ITS which resulted in a system (called DART~ for the design and development of intelligent teaching dialogues on PLATO I and in a program (called ELISA~ for teaching for...

A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces. Using the Moore-Penrose generalized inverse, a new additive trace is introduced on the restriction of this category to isometries, which trace is carried over to directed quantum Turing machines as monoidal automata. The JoyalStreet-...

Abstract As a contribution to the study of complex structures in native Amazonian languages, this article examines syntax additives and conjunctions language Gavião Rondônia. In particle k ĩ ´í ‘also, too, and’ is used form additive (‘also’) constructions with noun phrases verb phrases, without creating conjoined syntactic constituents. The same also constituents, which two or more are conjoine...

OF THE DISSERTATION On Generation of Cut Conjunctions, Minimal k-Connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices by Konrad Borys Dissertation Director: Professor Endre Boros We consider the following problems: • Cut conjunctions in graphs: given an undirected graphG = (V,E) and a collection of vertex pairs B ⊆ V × V generate all minimal edge sets X ⊆ E such tha...

Predicate encryption is an important cryptographic primitive that has found wide applications as it allows for fine-grained key management. In a predicate encryption scheme for a class P of predicates, the owner of the master secret key can derive a secret key SkP for any predicate P ∈ P. Similarly, when encrypting plaintext M , the sender can specify an attribute vector ~x for the ciphertext C...