∂if = f− sif xi − xi+1 where si acts on f by transposing xi and xi+1 and let π̃i = ∂i(xi(1− xi+1)f) Then the Grothendieck-Demazure polynomial κα, which is attributed to A. Lascoux and M. P. Schützenberger, is defined as κα = x α1 1 x α2 2 x α3 3 ... if α1 ≥ α2 ≥ α3 ≥ ..., i.e. α is non-increasing, and κα = π̃iκαsi if αi < αi+1, where si acts on α by transposing the indices. Example 2.1. Let α = (...

Remembering information is a fundamental aspect of cognition present in numerous natural systems. It allows adaptation the behavior as function previously encountered situations. For instance, many living organisms use memory to recall if given situation incurred penalty or reward and rely on that avoid reproduce situation. In groups, commonly studied case where individual members are themselve...

Four experiments were designed to investigate whether the frequency of words used to create pseudowords plays an important role in lexical decision. Computational models of the lexical decision task (e.g., the dual route cascaded model and the multiple read-out model) predict that latencies to low-frequency pseudowords should be faster than latencies to high-frequency pseudowords. Consistent wi...

A lifting based 2D DWT with efficient folded architecture and parallel scanning is being proposed. The architecture results in lesser hardware complexity and memory requirement due to multiplexing of 2 stages of lifting architecture. The 2D DWT architecture is realized by cascading two 2D processing elements. The coefficients for the lifting stage were chosen according with 9/7 filter. The 1D p...

We present a type-preserving translation of the polymorphic lambda calculus (System F) into an extension of the C programming language supporting parameterized classes and polymorphic methods. We observe that whilst parameterized classes alone are sufficient to encode the parameterized datatypes and letpolymorphism of languages such as ML and Haskell, it is the presence of polymorphic virtual m...