We introduce the bilingual dual-coding theory as a model for bilingual mental representation. Based on this model, lexical selection neural networks are implemented for a connectionist transfer project in machine translation.

A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extend...

Elman (2009) proposed that the traditional role of the mental lexicon in language processing can largely be replaced by a theoretical model of schematic event knowledge founded on dynamic context-dependent variables. We evaluate Elman’s approach and propose an alternative view, based on dual coding theory and evidence that modality-specific cognitive representations contribute strongly to word ...

This paper aims to answer two questions. The first is how screen captures in software manuals should be used to support learning. Four functions of screen captures in software manuals are presented. Three studies report the influence of these functions on the effectiveness and efficiency of the learning process. The second question is how users of visual manuals process combinations of text and...

A survey of self-dual codes, written for the Handbook of Coding Theory. Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this chapter include codes over

Dual coding theory (DCT) allows students to process information based on stimuli in the form of visual-verbal signals. This study aims measure relationship between implementation DCT teaching and learning process. An experimental approach was used by involving 101 students. The results show that theoretical can be improve language research findings strategies correlation coefficient is positive...

Association schemes form one of the main objects of algebraic combinatorics, classically defined on finite sets. At the same time, direct extensions of this concept to infinite sets encounter some problems even in the case of countable sets, for instance, countable discrete Abelian groups. In an attempt to resolve these difficulties, we define association schemes on arbitrary, possibly uncounta...

It is still an open challenge in coding theory how to design a systematic linear (n, k)− code C over GF(2) with maximal minimum distance d. In this study, based on matroid theory (MT), a limited class of good systematic binary linear codes (n, k, d ) is constructed, where n = 2 1 + · · · + 2 δ and d = 2 − 2 + · · · + 2 δ− 1 for k≥ 4, 1≤ δ < k. These codes are well known as special cases of code...