03270nam 22005535 450 991049524800332120240314160557.09783030848798303084879510.1007/978-3-030-84879-8(CKB)4100000012008836(MiAaPQ)EBC6712500(Au-PeEL)EBL6712500(DE-He213)978-3-030-84879-8(EXLCZ)99410000001200883620210824d2021 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierExploring the Interface Between Individual Difference Variables and the Knowledge of Second Language Grammar /by Mirosław Pawlak1st ed. 2021.Cham :Springer International Publishing :Imprint: Springer,2021.1 online resource (139 pages)Second Language Learning and Teaching,2193-76569783030848781 3030848787 Includes bibliographical references.1. Introduction -- 2. Explicit and implicit knowledge of grammar -- 3. Individual differences as factors mediating the knowledge of grammar -- 4 . Design of the research project -- 5. Findings of the research project -- 6. Conclusions and implications. .The last few decades have seen extensive research focusing of the relative effectiveness of different instructional options that can be employed in teaching grammar structures (e.g., deduction and induction, different types of corrective feedback, input-based vs. output-based practice). However, the contribution of such pedagogical intervention and the resulting knowledge of target language grammar are mediated by a number of factors related to a specific context, the properties of the features being taught and, most importantly, individual learner profiles. Nonetheless, research into the moderating role of individual difference variables has been scant, limited to only several factors, and seldom taking into account complex interactions between variables. The book seeks to fill this evident gap by investigating the mediating effect of selected cognitive and affective factors on explicit and implicit (or highly automatized) knowledge of the English passive voice. In doing so, the studysheds the so-much-needed light on the predictors of second language grammar knowledge but also, to some extent, on the usefulness of instructional techniques used to develop it.Second Language Learning and Teaching,2193-7656Applied linguisticsLanguage and languagesStudy and teachingApplied LinguisticsLanguage EducationApplied linguistics.Language and languagesStudy and teaching.Applied Linguistics.Language Education.418.0071Pawlak Mirosław849595MiAaPQMiAaPQMiAaPQBOOK9910495248003321Exploring the Interface Between Individual Difference Variables and the Knowledge of Second Language Grammar1897175UNINA04658nam 22007215 450 991050264530332120251225173540.03-030-86838-910.1007/978-3-030-86838-3(CKB)4940000000612418(MiAaPQ)EBC6730139(Au-PeEL)EBL6730139(OCoLC)1268984006(DE-He213)978-3-030-86838-3(PPN)258051515(EXLCZ)99494000000061241820210919d2021 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierGraph-Theoretic Concepts in Computer Science 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers /edited by Łukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski1st ed. 2021.Cham :Springer International Publishing :Imprint: Springer,2021.1 online resource (417 pages)Theoretical Computer Science and General Issues,2512-2029 ;129113-030-86837-0 Includes bibliographical references and index.Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance -- On Fair Covering and Hitting Problems -- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem -- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More -- Disjoint Stable Matchings in Linear Time -- Complementation in T-perfect Graphs -- On subgraph complementation to H-free graphs -- Odd Cycle Transversal in Mixed Graphs -- Preventing Small $(s, t)$-Cuts by Protecting Edges -- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel -- A heuristic approach to the treedepth decomposition problem for large graphs -- The Perfect Matching Cut Problem Revisited -- The Complexity of Gerrymandering Over Graphs: Paths and Trees -- Feedback Vertex Set on Hamiltonian Graphs -- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality -- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms -- Linearizable special cases of the quadratic shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG -- On Morphing 1-Planar Drawings -- Bears with Hats and Independence Polynomials -- The Largest Connected Subgraph Game -- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries -- Beyond Helly graphs: the diameter problem on absolute retracts -- Acyclic, Star, and Injective Colouring: Bounding the Diameter -- The Graphs of Stably Matchable Pairs -- On additive spanners in weighted graphs with local error -- Labeling Schemes for Deterministic Radio Multi-Broadcast -- On 3-Coloring of (2P_4, C_5)-Free Graphs.Chapter “Bears with Hats and Independence Polynomials” is are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. Chapters 1, 6, and 22 are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.Theoretical Computer Science and General Issues,2512-2029 ;12911MathematicsData processingData structures (Computer science)Information theoryAlgorithmsComputer scienceMathematicsDiscrete mathematicsComputational Mathematics and Numerical AnalysisData Structures and Information TheoryDesign and Analysis of AlgorithmsDiscrete Mathematics in Computer ScienceMathematicsData processing.Data structures (Computer science).Information theory.Algorithms.Computer scienceMathematics.Discrete mathematics.Computational Mathematics and Numerical Analysis.Data Structures and Information Theory.Design and Analysis of Algorithms.Discrete Mathematics in Computer Science.511.5Kowalik ŁukaszPilipczuk MichałRzążewski PawełMiAaPQMiAaPQMiAaPQBOOK9910502645303321Graph-Theoretic Concepts in Computer Science2569248UNINA