the ever severe dynamic competitive environment has led to increasing complexity of strategic decision making in giant organizations. strategy formulation is one of basic processes in achieving long range goals. since, in ordinary methods considering all factors and their significance in accomplishing individual goals are almost impossible. here, a new approach based on clustering method is pro...

the present study was an attempt to compare the effect of three vlss, namely word-part strategy, word-card strategy and context-clue strategy on immediate and delayed english vocabulary retention of iranian third grade high school students. to this end, 90 students, studying at three high schools in tabriz, in three intact groups, were considered as the participants of the study. in order to en...

We lift the theory of optimal reduction to a decomposition of the lambda calculus known as the Linear Substitution Calculus (LSC). LSC decomposes β-reduction into finer steps that manipulate substitutions in two distinctive ways: it uses context rules that allow substitutions to act “at a distance” and rewrites modulo a set of equations that allow substitutions to “float” in a term. We propose ...

Traditional convolutional neural networks (CNN) are stationary and feedforward. They neither change their parameters during evaluation nor use feedback from higher to lower layers. Real brains, however, do. So does our Deep Attention Selective Network (dasNet) architecture. DasNet’s feedback structure can dynamically alter its convolutional filter sensitivities during classification. It harness...

From applied linguistic point of view, the fundamental question facing the language teachers, methodologists and course designers is which procedure is more effective in FL/SL: learning to use or using to learn? Definitely, in order to be a competent language user, knowledge of language system is necessary, but it is not sufficient to be a successful language user. That is why there was a gradu...

This paper defines head linear reduction, a reduction strategy of λ-terms that performs the minimal number of substitutions for reaching a head normal form. The definition relies on an extended notion of redex, and head linear reduction is therefore not a strategy in the exact usual sense. Krivine’s Abstract Machine is proved to be sound by relating it both to head linear reduction and to usual...

We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. L evy's ordering on reductions) in nite reductions in Conditional Orthogonal Expression Reduction Systems. We use this strategy to derive two characterizations of perpetual redexes, i.e., redexes whose contractions retain the existence of in nite reductions. These characterizations generalize existin...

Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outermost-fair-like strategy that is allowed to be unfair to some redex of a term when con...

Let P = fP0; :::; Png be a partition of a nite abelian group A and L(P ) the complex vector space generated by the indicator functions of the sets P0; :::; Pn. In [1] it was proved that P de nes an abelian association scheme on A if L(P ) equals the space L(P ) of all Fourier transforms of functions in L(P ). In this paper it is shown that P de nes an abelian association scheme on A if and only...