02951nam 2200613 a 450 991045129540332120170809155653.01-281-24501-197866112450161-84787-870-91-84860-547-1(CKB)1000000000411989(EBL)334389(OCoLC)476141759(SSID)ssj0000147756(PQKBManifestationID)11144778(PQKBTitleCode)TC0000147756(PQKBWorkID)10015979(PQKB)11338989(MiAaPQ)EBC334389(EXLCZ)99100000000041198920130515d2006 uy 0engur|n|---|||||txtccrEnhancing courage, respect and assertiveness[electronic resource] promoting children's resilience and wellbeing /Karen Brunskill ; [illustrations, Leanne Winfield ... [et al.]]London PCP20061 online resource (380 p.)Lucky Duck Books"A Lucky Duck book."Originally published in Australia as Values for life upper level primary series one 2002.1-4129-1964-9 Includes bibliographical references.Cover; Contents; Foreword; Introduction; Protective Factors Enhancing Resilience; Curriculum Links; Story Values and Outcomes; Structure of the Programme; Focus Values; Chapter 1 - Consideration; Chapter 2 - Friendliness; Chapter 3 - Honesty; Chapter 4 - Kindness; Chapter 5 - Responsibility; Chapter 6 - Tolerance; Chapter 7 - Confidence; Chapter 8 - Respect; Chapter 9 - Courage; Chapter 10 - Determination; Chapter 11 - Caring; Chapter 12 - Assertiveness; Bibliography; WorksheetsIncludes CD-Rom The four books in the series provide a whole-school value based programme for young people from five to twelve years of age. They help in the creation of wellbeing and resilience in students by introducing and developing a range of values and behaviours that will assist with social and emotional health. The series is well differentiated for the target age group and each volume follows a similar format: ointroduction; oguidance on how to use the materials; olinks to curriculum areas; ocomprehensive teacher notes on each thLucky Duck BooksSocial skillsStudy and teachingLife skillsStudy and teachingElectronic books.Social skillsStudy and teaching.Life skillsStudy and teaching.370.115370.153Brunskill Karen851039Winfield Leanne854199MiAaPQMiAaPQMiAaPQBOOK9910451295403321Enhancing courage, respect and assertiveness2019694UNINA05693nam 22007455 450 99646626100331620200630021211.03-540-48385-310.1007/3-540-57899-4(CKB)1000000000234099(SSID)ssj0000323614(PQKBManifestationID)11247884(PQKBTitleCode)TC0000323614(PQKBWorkID)10300455(PQKB)10957344(DE-He213)978-3-540-48385-4(PPN)155193481(EXLCZ)99100000000023409920121227d1994 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings /edited by Jan van Leeuwen1st ed. 1994.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1994.1 online resource (XI, 437 p.) Lecture Notes in Computer Science,0302-9743 ;790Bibliographic Level Mode of Issuance: Monograph3-540-57899-4 Near-optimal dominating sets in dense random graphs in polynomial expected time -- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality -- Hierarchically specified unit disk graphs -- Bounded tree-width and LOGCFL -- On reduction algorithms for graphs with small treewidth -- Algorithms and complexity of sandwich problems in graphs (extended abstract) -- On-line graph algorithms for incremental compilation -- Average case analysis of fully dynamic connectivity for directed graphs -- Fully dynamic maintenance of vertex cover -- Dynamic algorithms for graphs with treewidth 2 -- Short disjoint cycles in graphs with degree constraints -- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs -- Towards a solution of the Holyer's problem -- Graphs, hypergraphs and hashing -- Coloring k-colorable graphs in constant expected parallel time -- Deciding 3-colourability in less than O(1.415n) steps -- A rainbow about T-colorings for complete graphs -- Approximating the chromatic polynomial of a graph -- Asteroidal triple-free graphs -- The parallel complexity of elimination ordering procedures -- Dually chordal graphs -- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions -- Regular marked Petri nets -- The asynchronous committee meeting problem -- Gossiping in vertex-disjoint paths mode in interconnection networks -- The folded Petersen network: A new versatile multiprocessor interconnection topology -- Fast load balancing in Cayley graphs and in circuits -- Concurrent flows and packet routing in Cayley graphs (Preliminary version) -- On multi-label linear interval routing schemes -- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages -- Linear layouts of generalized hypercubes -- Graph ear decompositions and graph embeddings -- Improved bounds for the crossing numbers on surfaces of genus g -- Two algorithms for finding rectangular duals of planar graphs -- A more compact visibility representation.This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993. The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout. The 35 revised papers were chosen from 92 submissions after a careful refereeing process.Lecture Notes in Computer Science,0302-9743 ;790ComputersDiscrete mathematicsApplication softwareAlgorithmsCombinatoricsComputer logicTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Discrete Mathematicshttps://scigraph.springernature.com/ontologies/product-market-codes/M29000Computer Applicationshttps://scigraph.springernature.com/ontologies/product-market-codes/I23001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XComputers.Discrete mathematics.Application software.Algorithms.Combinatorics.Computer logic.Theory of Computation.Discrete Mathematics.Computer Applications.Algorithm Analysis and Problem Complexity.Combinatorics.Logics and Meanings of Programs.004/.01/5115Leeuwen Jan vanedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Graph-Theoretic Concepts in Computer Science(19th :1993 :Utrecht, Netherlands)BOOK996466261003316Graph-Theoretic Concepts in Computer Science772292UNISA03970oam 2200937Ia 450 991078457240332120211215042322.01-136-06837-61-136-06838-41-280-62875-897866106287590-08-045727-4(CKB)1000000000362558(EBL)269613(OCoLC)475998206(SSID)ssj0000207317(PQKBManifestationID)11197464(PQKBTitleCode)TC0000207317(PQKBWorkID)10235634(PQKB)10685974(Au-PeEL)EBL269613(CaPaEBR)ebr10138005(CaONFJC)MIL62875(OCoLC)243575799(FlBoTFG)9780080457277(OCoLC)795224979(OCoLC-P)795224979(CaSebORM)9780240806938(MiAaPQ)EBC269613(EXLCZ)99100000000036255820120612d2006 uy 0engurunu||||||||txtccrThe MXF book /editor: Nick Wells ; principal authors: Bruce Devlin, Jim Wilkinson ; contributing authors: Matt Beard, Phil Tudor1st editionBurlington, MA Focal Press©20061 online resource (414 p.)Includes index.0-240-81939-X 0-240-80693-X Includes bibliographical references and index.Cover; Half Title; Title Page; Copyright Page; Table of Contents; Acknowledgements; Author Biographies; Preface; 1 Introduction and Scene Setting; 2 What is an MXF File?; 3 Physical and Logical Structures within an MXF File; 4 Operational Patterns and Constraining MXF; 5 How to Put Essence into an MXF File; 6 Audio in MXF; 7DV, DVC Pro, and DVCam in MXF; 8 D-1O and D-11 in MXF; 9MPEG, MXF, and SMPTE 381M; 10 Generic Data Streams, VBI, and ANC; 11 DMS-1 Metadata Scheme; 12 Index Tables; 13 The MXF Data Model in Context; 14 The MXFLib Open Source Library15 Practical Examples and Approcaches to Using MXF16 JPEG 2000 Essence Container and Its Application; IndexWritten by a top team of industry professionals, this must-have guide will introduce you to everything you'll need to know about MXF. The MXF Book introduces and explains the MXF standard and helps engineers write MXF applications. The book also explains the reasons behind many details of the specification documents.Digital videoHandbooks, manuals, etcDigital videoStandardsDigital televisionHandbooks, manuals, etcMetadataHandbooks, manuals, etcImage processingDigital techniquesHandbooks, manuals, etcSoundRecording and reproducingDigital techniquesHandbooks, manuals, etcDigital mediaHandbooks, manuals, etcVideo compressionHandbooks, manuals, etcMPEG (Video coding standard)JPEG (Image coding standard)Digital videoDigital videoStandards.Digital televisionMetadataImage processingDigital techniquesSoundRecording and reproducingDigital techniquesDigital mediaVideo compressionMPEG (Video coding standard)JPEG (Image coding standard)006.7778.53Wells Nick1584278Devlin Bruce1584279Wilkinson Jim1584280Beard Matt1584281Tudor Phil1584282Society of Motion Picture and Television Engineers.OCoLC-POCoLC-PBOOK9910784572403321The MXF book3867943UNINA