LEADER 04647nam 22007212 450 001 9910450068703321 005 20160219111437.0 010 $a1-107-12374-7 010 $a1-280-43342-6 010 $a9786610433421 010 $a0-511-17458-6 010 $a0-511-04166-7 010 $a0-511-15454-2 010 $a0-511-32521-5 010 $a0-511-49005-4 010 $a0-511-04398-8 035 $a(CKB)1000000000007213 035 $a(EBL)202004 035 $a(OCoLC)225961272 035 $a(SSID)ssj0000244644 035 $a(PQKBManifestationID)11190854 035 $a(PQKBTitleCode)TC0000244644 035 $a(PQKBWorkID)10170462 035 $a(PQKB)11347987 035 $a(UkCbUP)CR9780511490057 035 $a(MiAaPQ)EBC202004 035 $a(Au-PeEL)EBL202004 035 $a(CaPaEBR)ebr10006815 035 $a(CaONFJC)MIL43342 035 $a(EXLCZ)991000000000007213 100 $a20090227d2001|||| uy| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSex differences in antisocial behaviour $econduct disorder, delinquency, and violence in the Dunedin longitudinal study /$fTerrie E. Moffitt [and three others]$b[electronic resource] 210 1$aCambridge :$cCambridge University Press,$d2001. 215 $a1 online resource (xvii, 278 pages) $cdigital, PDF file(s) 225 1 $aCambridge studies in criminology 300 $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). 311 $a0-521-01066-7 311 $a0-521-80445-0 320 $aIncludes bibliographical references (p. 246-273) and index. 327 $aCover; Half-title; Series-title; Title; Copyright; Dedication; Contents; Figures; Tables; Preface; Acknowledgements; CHAPTER ONE Introduction; CHAPTER TWO The Dunedin Multidisciplinary Health and Development Study; CHAPTER THREE Sex differences in the amount of antisocial behaviour: dimensional measures; CHAPTER FOUR Sex differences in the prevalence of antisocial behaviour: categorical diagnostic measures; CHAPTER FIVE Sex differences in physical violence and sex similarities in partner abuse; CHAPTER SIX Sex and the developmental stability of antisocial behaviour 327 $aCHAPTER TWELVE Do girls who develop antisocial behaviour surmount a higher threshold of risk than their male counterparts?CHAPTER THIRTEEN Sex differences in the effects of antisocial behaviour on young adult outcomes; CHAPTER FOURTEEN Sex, antisocial behaviour, and mating: mate selection and early childbearing; CHAPTER FIFTEEN Evaluating the recommendation to relax the criteria for diagnosing conduct disorder in girls; CHAPTER SIXTEEN Life-course persistent and adolescence-limited antisocial behaviour among males and females; CHAPTER SEVENTEEN Priorities for a research agenda; References 327 $aIndex 330 $aWhy are females rarely antisocial and males antisocial so often? This key question is addressed in a fresh approach to sex differences in the causes, course and consequences of antisocial behaviour. The book presents findings from a landmark investigation of 1,000 males and females studied from ages 3 to 21 years. It shows that young people develop antisocial behaviour for two main reasons. One form of antisocial behaviour is a neurodevelopmental disorder afflicting males, with low prevalence in the population, early childhood onset and subsequent persistence. The other form of antisocial behaviour, afflicting females as well as males, is common and emerges in the context of social relationships. The book offers insights about diagnosis and measurement, the importance of puberty, the problem of partner violence and the nature of intergenerational transmission. It puts forward an agenda for research about both neurodevelopmental and social influences on antisocial behaviour. 410 0$aCambridge studies in criminology. 606 $aConduct disorders in adolescence$xSex differences$vLongitudinal studies 606 $aAntisocial personality disorders$xSex differences$vLongitudinal studies 606 $aJuvenile delinquency$xSex differences$vLongitudinal studies 615 0$aConduct disorders in adolescence$xSex differences 615 0$aAntisocial personality disorders$xSex differences 615 0$aJuvenile delinquency$xSex differences 676 $a616.89/00835 700 $aMoffitt$b Terrie E.$0850537 801 0$bUkCbUP 801 1$bUkCbUP 906 $aBOOK 912 $a9910450068703321 996 $aSex differences in antisocial behaviour$91899074 997 $aUNINA LEADER 08696nam 22007695 450 001 9910767551103321 005 20251116234113.0 010 $a3-540-45022-X 024 7 $a10.1007/3-540-45022-X 035 $a(CKB)1000000000211269 035 $a(SSID)ssj0000321496 035 $a(PQKBManifestationID)11246810 035 $a(PQKBTitleCode)TC0000321496 035 $a(PQKBWorkID)10279534 035 $a(PQKB)11560013 035 $a(DE-He213)978-3-540-45022-1 035 $a(MiAaPQ)EBC3072415 035 $a(PPN)155181440 035 $a(EXLCZ)991000000000211269 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming $e27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings /$fedited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XVI, 952 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1853 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67715-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the Analysis of Cryptographic Protocols -- Average Bit-Complexity of Euclidean Algorithms -- Planar Maps and Airy Phenomena -- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System -- Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract) -- Award Talk -- The Genomics Revolution and Its Challenges for Algorithmic Research -- Invited Talk -- Alternating the Temporal Picture for Safety -- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations -- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP -- A New Unfolding Approach to LTL Model Checking -- Reasoning about Message Passing in Finite State Environments -- Extended Notions of Security for Multicast Public Key Cryptosystems -- One-Round Secure Computation and Secure Autonomous Mobile Agents -- Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing -- On the Centralizer of a Finite Set -- On the Power of Tree-Walking Automata -- Determinization of Transducers over Infinite Words -- Invited Talk -- Constraint Programming and Graph Algorithms -- Scalable Secure Storage when Half the System Is Faulty -- Generating Partial and Multiple Transversals of a Hypergraph -- Revisiting the Correspondence between Cut Elimination and Normalisation -- Negation Elimination from Simple Equational Formulae -- Hardness of Set Cover with Intersection 1 -- Strong Inapproximability of the Basic k-Spanner Problem -- Infinite Series-Parallel Posets: Logic and Languages -- On Deciding if Deterministic Rabin Language Is in Büchi Class -- On Message Sequence Graphs and Finitely Generated Regular MSC Languages -- Invited Talk -- Pseudorandomness -- A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols -- Deterministic Radio Broadcasting -- An ?-Complete Equational Specification of Interleaving -- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors -- Tight Size Bounds for Packet Headers in Narrow Meshes -- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link -- On the Logical Characterisation of Performability Properties -- On the Representation of Timed Polyhedra -- Invited Talk -- Min-wise Independent Permutations: Theory and Practice -- Testing Acyclicity of Directed Graphs in Sublinear Time -- Computing the Girth of a Planar Graph -- Lower Bounds Are Not Easier over the Reals: Inside PH -- Unlearning Helps -- Fast Approximation Schemes for Euclidean Multi-connectivity Problems -- Approximate TSP in Graphs with Forbidden Minors -- Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling -- The Many Faces of a Translation -- Gales and the Constructive Dimension of Individual Sequences -- The Global Power of Additional Queries to p-Random Oracles -- Homogenization and the Polynomial Calculus. 330 $aThis book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the state-of-the-art in theoretical computer science. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1853 606 $aComputers 606 $aSoftware engineering 606 $aComputer networks 606 $aComputers, Special purpose 606 $aComputer science?Mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aSpecial Purpose and Application-Based Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I13030 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aComputer networks. 615 0$aComputers, Special purpose. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aComputer Communication Networks. 615 24$aSpecial Purpose and Application-Based Systems. 615 24$aMathematics of Computing. 676 $a511.3 702 $aMontanari$b Ugo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRolim$b Jose D.P$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWelzl$b Emo$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767551103321 996 $aAutomata, languages and programming$9339738 997 $aUNINA