37,195 research outputs found

    Working memory and second language development: A complex, dynamic future?

    Get PDF
    Working memory (WM) is inherently dynamic and complex, being a multi-faceted system that links storage and processing components; yet it is widely understood as internal. Hence, in second language (L2) research, its connection to complex dynamic systems theory (CDST) remains underspecified. This paper seeks to bridge a gap between CDST and WM in L2 research. First, definitions of WM are reviewed, along with evidence for its relationship to L2 outcomes. Next, a brief overview of CDST highlights its metatheoretical and methodological implications. Three perspectives are presented to illustrate how WM can be viewed in terms of major tenets in CDST. These consider WM effects as: (1) context-dependent, (2) interrelated with those of other variables, and (3) amenable to change across the lifespan. Despite this reappraisal, numerous challenges remain. Thus, in addition to noting research opportunities, the paper also considers measurement issues, such as the determination of boundaries and selection of appropriate timescales. In closing, while WM studies have shown its influence on L2 proficiency and processing, to more fully understand its dynamic nature, what is needed is further research on the reciprocal influences of bilingual development and changes in WM components, such as control of attention

    Scheler on shame: a critical review

    Get PDF
    This paper presents a critical review of Scheler’s analysis of shame's structure, dynamic, and affectivity, and his explanation of phenomena of shame. This first part of the paper examines Scheler’s accounts of shame’s basic condition, the law ultimately governing its origin, and its basic dynamic. The second part of the paper turns to his general descriptions of what we feel when we feel shame and his analyses of two distinct forms of shame. The conclusion attempts to draw these aspects of his account of shame together to illustrate why, according to Scheler, we feel shame. Throughout the paper, some basic criticisms of Scheler’s account are advanced. At the same time the paper attempts to demonstrate the virtues of his highly differentiated descriptions of experiences of shame and his attempt to weave these descriptions together into a general theory.Published versio

    Comprehensive Health Insurance: The Reality

    Get PDF
    In his article, Dr. O\u27Keefle outlines the major proposals (both generic and specIfic) in the area of national health insurance. He then describes in depth the proposed Warren County Plan and the Foundation Concept in relation to three fundamental concepts: availability, utilization and financing of medical care

    Transformation From Semantic Data Model to Rdf

    Get PDF
    There have been several efforts to use relational model and database to store and manipulate Resource Description Framework (RDF). They have one general disadvantage, i.e. one is forced to map the model of semantics of RDF into relational model, which will end up in constraints and additional properties, such as, validating each assertion against the RDF schema which also stored as a triplets table. In this paper, we introduce Semantic Data Model as a proposed data model language to store and manipulate Resource Description Framework. This study also tries to prescribe the procedure on transforming a semantic data model into a RDF data model. Keyworsd: Semantic Data Model, Resource Description Framework

    Seventy Years of Bequests for Masses in New York Courts 1883-1953

    Get PDF

    Operational experience with passive falling spheres on the AFETR

    Get PDF
    Operational performance of falling sphere systems for measuring meteorological parameters of upper atmospher

    Hamiltonicity in connected regular graphs

    Full text link
    In 1980, Jackson proved that every 2-connected kk-regular graph with at most 3k3k vertices is Hamiltonian. This result has been extended in several papers. In this note, we determine the minimum number of vertices in a connected kk-regular graph that is not Hamiltonian, and we also solve the analogous problem for Hamiltonian paths. Further, we characterize the smallest connected kk-regular graphs without a Hamiltonian cycle.Comment: 5 page
    • …
    corecore