Personality types and languages learning strategies: chameleons changing colours

This exploration of associations between the reported Language Learning Strategy (LLS) preferences of learners of English as a Second Language (ESL) and their personality types is positioned within the contention that the two are generally related. Our findings unequivocally support the existence of this relationship. Moreover, they also provide a platform from which to understand the contribution to learning a second language of two very commonly cited personality traits, introversion/extroversion and neuroticism. However, they also provide the basis for the important caution that the association between personality types and LLS is quite volatile. We have found that it is variation rather than unwavering stability that features in how personality traits apply as predictive of ESL learners' specific LLS preferences. Such prediction is specified even further by the particular contexts of ESL learning where the LLS are applied, for example for listening or speaking and whether this occurs inside or outside a classroom. The implications of these findings for ESL teaching and learning are discussed as is the explanatory power of the chameleon metaphor.

Reachable sets bounding for switched systems with time-varying delay and bounded disturbances

In this paper, we address the problem of finding outer bound of forward reachable sets and inter-bound of backward reachable sets of switched systems with an interval time-varying delay and bounded disturbances. By constructing a flexible Lyapunov–Krasovskii functional combining with some recent refined integral-based inequalities, some sufficient conditions are derived for the existence of (1) the smallest possible outer bound of forwards reachable sets; and (2) the largest possible inter-bound of backward reachable sets. These conditions are delay dependent and in the form of linear matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. A constructive geometric design of switching laws is also presented. Two numerical examples with simulation results are provided to demonstrate the effectiveness of our results.

Code pattern analysis of object-oriented programming languages

Code patterns, including programming patterns and design patterns, are good references for programming language feature improvement and software re-engineering. However, to our knowledge, no existing research has attempted to detect code patterns based on code clone detection technology. In this study, we build upon the previous work and propose to detect and analyze code patterns from a collection of open source projects using NiPAT technology. Because design patterns are most closely associated with object-oriented languages, we choose Java and Python projects to conduct our study. The tool we use for detecting patterns is NiPAT, a pattern detecting tool originally developed for the TXL programming language based on the NiCad clone detector. We extend NiPAT for the Java and Python programming languages. Then, we try to identify all the patterns from the pattern report and classify them into several different categories. In the end of the study, we analyze all the patterns and compare the differences between Java and Python patterns.

When do dialects become languages? A cognitive perspective

Several definitions exist that offer to identify the boundaries between languages and dialects, yet these distinctions are inconsistent and are often as political as they are linguistic (Chambers & Trudgill, 1998). A different perspective is offered in this thesis, by investigating how closely related linguistic varieties are represented in the brain and whether they engender similar cognitive effects as is often reported for bilingual speakers of recognised independent languages, based on the principles of Green’s (1998) model of bilingual language control. Study 1 investigated whether bidialectal speakers exhibit similar benefits in non-linguistic inhibitory control as a result of the maintenance and use of two dialects, as has been proposed for bilinguals who regularly employ inhibitory control mechanisms, in order to suppress one language while speaking the other. The results revealed virtually identical performance across all monolingual, bidialectal and bilingual participant groups, thereby not just failing to find a cognitive control advantage in bidialectal speakers over monodialectals/monolinguals, but also in bilinguals; adding to a growing body of evidence which challenges this bilingual advantage in non-linguistic inhibitory control. Study 2 investigated the cognitive representation of dialects using an adaptation of a Language Switching Paradigm to determine if the effort required to switch between dialects is similar to the effort required to switch between languages. The results closely replicated what is typically shown for bilinguals: Bidialectal speakers exhibited a symmetrical switch cost like balanced bilinguals while monodialectal speakers, who were taught to use the dialect words before the experiment, showed the asymmetrical switch cost typically displayed by second language learners. These findings augment Green’s (1998) model by suggesting that words from different dialects are also tagged in the mental lexicon, just like words from different languages, and as a consequence, it takes cognitive effort to switch between these mental settings. Study 3 explored an additional explanation for language switching costs by investigating whether changes in articulatory settings when switching between different linguistic varieties could - at least in part – be responsible for these previously reported switching costs. Using a paradigm which required participants to switch between using different articulatory settings, e.g. glottal stops/aspirated /t/ and whispers/normal phonation, the results also demonstrated the presence of switch costs, suggesting that switching between linguistic varieties has a motor task-switching component which is independent of representations in the mental lexicon. Finally, Study 4 investigated how much exposure is needed to be able to distinguish between different varieties using two novel language categorisation tasks which compared German vs Russian cognates, and Standard Scottish English vs Dundonian Scots cognates. The results showed that even a small amount of exposure (i.e. a couple of days’ worth) is required to enable listeners to distinguish between different languages, dialects or accents based on general phonetic and phonological characteristics, suggesting that the general sound template of a language variety can be represented before exact lexical representations have been formed. Overall, these results show that bidialectal use of typologically closely related linguistic varieties employs similar cognitive mechanisms as bilingual language use. This thesis is the first to explore the cognitive representations and mechanisms that underpin the use of typologically closely related varieties. It offers a few novel insights and serves as the starting point for a research agenda that can yield a more fine-grained understanding of the cognitive mechanisms that may operate when speakers use closely related varieties. In doing so, it urges caution when making assumptions about differences in the mechanisms used by individuals commonly categorised as monolinguals, to avoid potentially confounding any comparisons made with bilinguals.

Crossing geographies, crossing languages

This book is of pivotal importance to the development of women's poetry in America and will serve as an invaluable reference for specialists and students alike.

Reachable sets bounding for generalized neural networks with interval time-varying delay and bounded disturbances

This paper deals with the problem of finding outer bound of forwards reachable sets and interbound of backwards reachable sets of generalized neural network systems with interval nondifferentiable time-varying delay and bounded disturbances. Based on constructing a suitable Lyapunov–Krasovskii functional and utilizing some improved Jensen integral-based inequalities, two sufficient conditions are derived for the existence of: (1) the smallest possible outer bound of forwards reachable sets and (2) the largest possible interbound of backwards reachable sets. These conditions are delay dependent and in the form of matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. Three numerical examples with simulation results are provided to demonstrate the effectiveness of our results.

Term Morphologies as Meaningful Typology Characteristics for Indexing Languages

Every indexing language is made up of terms. Those terms have morphological characteristics. These include terms made up of single words, two words, or more. We can also take into account the total number of terms.We can assemble these measures, normalize them, and then cluster indexing languages based on this common set of measures [1].Cluster analysis reviews discrete groups based on term morphology that comport with traditional design assumptions that separate ontologies, from thesauri, and folksonomies.

Diachronic and Synchronic Indexing: Modeling Conceptual Change in Indexing Languages

This paper outlines a model of conceptual change in indexing languages. Findings from this modeling effort point to three ways meaning and relationships are established and then change in an indexing language. These ways: structural, terminological, and textual point to ways indexing language metadata can aid in managing conceptual change in indexing languages.

Evidence of Term-Structure Differences among Folksonomies and Controlled Indexing Languages

With the advent of Internet-based technologies for information organization, many groups have constructed their own indexing languages. Biologists, Library and Information Science practitioners, and now social taggers have worked together to create large and many times complex indexing languages. In this environment of diversity, two questions surface: (1) what are the measurable characteristics of these indexing languages, and (2) do measurements of these indexing languages speciate along these characteristics? This poster presents data from this exploratory work.

Detailed analysis of a conservative difference approximation for the time fractional diffusion equation

Diffusion equations that use time fractional derivatives are attractive because they describe a wealth of problems involving non-Markovian Random walks. The time fractional diffusion equation (TFDE) is obtained from the standard diffusion equation by replacing the first-order time derivative with a fractional derivative of order α ∈ (0, 1). Developing numerical methods for solving fractional partial differential equations is a new research field and the theoretical analysis of the numerical methods associated with them is not fully developed. In this paper an explicit conservative difference approximation (ECDA) for TFDE is proposed. We give a detailed analysis for this ECDA and generate discrete models of random walk suitable for simulating random variables whose spatial probability density evolves in time according to this fractional diffusion equation. The stability and convergence of the ECDA for TFDE in a bounded domain are discussed. Finally, some numerical examples are presented to show the application of the present technique.

Experiences with an Object-Oriented, Multi-Stage Language

Metaphor is a multi-stage programming language extension to an imperative, object-oriented language in the style of C# or Java. This paper discusses some issues we faced when applying multi-stage language design concepts to an imperative base language and run-time environment. The issues range from dealing with pervasive references and open code to garbage collection and implementing cross-stage persistence.

Numerical approximation of a fractional-in-space diffusion equation (II) - with nonhomogeneous boundary conditions

In this paper, a space fractional di®usion equation (SFDE) with non- homogeneous boundary conditions on a bounded domain is considered. A new matrix transfer technique (MTT) for solving the SFDE is proposed. The method is based on a matrix representation of the fractional-in-space operator and the novelty of this approach is that a standard discretisation of the operator leads to a system of linear ODEs with the matrix raised to the same fractional power. Analytic solutions of the SFDE are derived. Finally, some numerical results are given to demonstrate that the MTT is a computationally e±cient and accurate method for solving SFDE.