00887nam0-2200313---450-99000978991040332120131114114638.09789400757509000978991FED01000978991(Aleph)000978991FED0100097899120131114d2013----km-y0itay50------baengNL--------001yySoil remediation and rehabilitationtreatment of contaminated and disturbed landHelmut MeuserDordrechtSpringerc2013387 p.24 cmPedologia631.4222itaMeuser,Helmut521374ITUNINARICAUNIMARCBK99000978991040332160 631.42 B 2714245FAGBCFAGBCSoil remediation and rehabilitation833267UNINA03245nam 2200625 a 450 991045244080332120170815154049.01-283-88191-81-4462-6401-71-4462-1291-2(CKB)2550000000106314(EBL)1023965(OCoLC)823384360(SSID)ssj0000685933(PQKBManifestationID)11385532(PQKBTitleCode)TC0000685933(PQKBWorkID)10732072(PQKB)10558036(MiAaPQ)EBC1023965(OCoLC)1007860846(StDuBDS)EDZ0000072175(EXLCZ)99255000000010631420120412d2007 fy 0engur|n|---|||||txtccrUsing drama to teach personal, social and emotional skills[electronic resource] /Jacqui O'Hanlon and Angie WoottenLondon Paul Chapman20071 online resource (173 p.)Lucky Duck Books" A Lucky Duck book."1-4129-1820-0 1-4129-1821-9 Includes bibliographical references.Cover; Contents; Acknowledgements; How to Use the CD-ROM; Introduction; Using this Book; Assessment and Evaluation Sheet; Part I - 'I Can Express How I Feel'; Chapter 1 - Beginnings; Chapter 2 - Exploring Feelings; Chapter 3 - Showing Feelings; Part II - 'I Know How You Feel'; Chapter 1 - Recognising Feelings; Chapter 2 - How Do I Know What You Feel?; Chapter 3 - Knowing How to Respond; Part III - 'I Can Make Friends'; Chapter 1 - Showing Interest; Chapter 2 - Sharing; Chapter 3 - Trust; Chapter 4 - Empathy; Chapter 5 - Empathy and Affirmation; Part IV - 'I can Keep Friends'Chapter 1 - Causes of Friendship BreakdownChapter 2 - Conflict Escalation; Chapter 3 - Exploring Anger and Choosing; Chapter 4 - Practising Alternatives; Part V - 'I'm Happy Being Me'; Chapter 1 - Introducing Jake; Chapter 2 - A Day in Jake's Life; Chapter 3 - Turning Negatives into Positives; Chapter 4 - Using Positive 'Self-Talk'; Chapter 5 - Staying Positive; Part VI - 'I Can Express what I Need'; Chapter 1 - Identifying Needs; Chapter 2 - Creating Solutions; Chapter 3 - More Solutions; Chapter 4 - Advice for a New Child; Compendium of Games; Bibliography; CD-ROM ContentsOriginally developed for deaf children, this innovative and successful drama programme addressing personal, social and emotional needs can benefit all children in primary schools. The interactive and lively ideas cover a variety of themes from empathy to assertiveness.Lucky Duck BooksDrama in educationSocial skillsStudy and teachingElectronic books.Drama in education.Social skillsStudy and teaching.371.399372.83O'Hanlon Jacqui1050703Wootten Angie1050704StDuBDSStDuBDSBOOK9910452440803321Using drama to teach personal, social and emotional skills2480728UNINA04745nam 2200613 450 99646540910331620230725033328.03-540-37778-63-662-21545-410.1007/3-540-06841-4(CKB)1000000000229705(SSID)ssj0000321510(PQKBManifestationID)11260293(PQKBTitleCode)TC0000321510(PQKBWorkID)10263967(PQKB)11194218(DE-He213)978-3-540-37778-8(DE-He213)978-3-662-21545-6(MiAaPQ)EBC5586257(MiAaPQ)EBC6595832(Au-PeEL)EBL5586257(OCoLC)1066195213(Au-PeEL)EBL6595832(OCoLC)1164871865(PPN)155191403(EXLCZ)99100000000022970520220113d1974 uy 0engurnn#008mamaatxtccrAutomata, languages and programming 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974 /edited by J. Loeckx1st ed. 1974.Berlin ;Heidelberg ;New York :Springer-Verlag Berlin Heidelberg GmbH,[1974]©19741 online resource (619 p.)Lecture notes in computer science ;14Bibliographic Level Mode of Issuance: Monograph3-540-06863-5 3-540-06841-4 The generative power of two-level grammars -- A generalisation of Parikh's theorem in formal language theory -- Checking stacks and context-free programmed grammars accept p-complete languages -- Recursion and parameter mechanisms: An axiomatic approach -- Dynamic programming schemata -- Semantic characterization of flow diagrams and their decomposability -- On the most recent property of ALGOL-like programs -- Langages sans etiquettes et transformations de programmes -- Relations between semantics and complexity of recursive programs- -- On the relation between direct and continuation semantics -- Graph representation and computation rules for typeless recursive languages -- Application of Church-Rosser properties to increase the parallelism and efficiency of algorithms -- Combinatorial problems, combinator equations and normal forms -- Algorithmes d'Equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples -- Automatic generation of multiple exit parsing subroutines -- Production prefix parsing -- On eliminating unit productions from LR(k) parsers -- Deterministic techniques for efficient non-deterministic parsers -- File organization, an application of graph theory -- Characterizations of time-bounded computations by limited primitive recursion -- On maximal merging of information in Boolean computations -- On simple Goedel numberings and translations -- The ‘almost all’ theory of subrecursive degrees is decidable -- The computational complexity of program schemata -- Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini -- Sur l'Application du theoreme de suschkewitsch a l'etude des codes rationnels complets -- Composition of automata -- Context-free grammar forms -- Une suite decroissante de cônes rationnels -- Komplexitätsmaße for Ausdrocke -- Efficient procedures for using matrix algorithms -- Further schemes for combining matrix algorithms -- On the structure of complexity classes -- On sets having only hard subsets -- Turing machines with associative memory access -- Trade-off between the use of nonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems -- Operators reducing generalized OL-systems -- Parallel rewriting systems on terms -- Transductions of context-free languages into sets of sentential forms -- Parallelism in rewriting systems -- Mehrdeutigkeiten kontextfreier Grammatiken -- Monadic program schemes under restricted classes of free interpretations -- Generalized program schemas -- A decidability result for sequential grammars -- Effectivity problems of algorithmic logic -- Simple and structural redundancy in non-deterministic computation -- Sur une propriete syntactique des relations rationnelles.Lecture notes in computer science ;14.Sequential machine theoryCongressesSequential machine theory511.3Loeckx Jacques1931-MiAaPQMiAaPQMiAaPQBOOK996465409103316Automata, languages and programming339738UNISA