{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":49,"n_cols":5,"rows_kept":49,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[12,2,12,3],[13,2,13,3],[17,2,17,3],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[30,2,30,3],[41,2,41,3],[42,2,42,3],[46,2,46,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910451147003321"]
[null,null,"Titolo",null,"Cognitive-behavioral therapies for trauma [[electronic resource] /] / edited by Victoria M. Follette, Josef I. Ruzek"]
[null,null,"Pubbl/distr/stampa",null,"New York, : Guilford Press, c2006"]
[null,null,"ISBN",null,"1-281-12306-4"]
[{"$nulls":4},"9786611123062"]
[{"$nulls":4},"1-59385-508-7"]
[null,null,"Edizione",null,"[2nd ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (492 p.)"]
[null,null,"Disciplina",null,"616.85/210651"]
[null,null,"Soggetti",null,"Cognitive therapy"]
[{"$nulls":4},"Post-traumatic stress disorder - Treatment"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"CONTENTS; CHAPTER ONE Back to the Future of Understanding Trauma: Implications for Cognitive-Behavioral Therapies for Trauma; CHAPTER TWO Functional Analytic Clinical Assessment in Trauma Treatment; CHAPTER THREE Recent Advances in Psychological Assessment of Adults with Posttraumatic Stess Disorder; CHAPTER FOUR Prolonged Exposure Treatment of Posttraumatic Stress Disorder; CHAPTER FIVE Cognitive Therapy for Postraumatic Stress Disorder; CHAPTER SIX Applications of Dialectical Behavior Therapy to Posttraumatic Stress Disorder and Related Problems"]
[{"$nulls":4},"CHAPTER SEVEN Acceptance and Commitment Therapy in the Treatment of Posttraumatic Stress Disorder: Theoretical and Applied IssuesCHAPTER EIGHT Functional Analytic Psychotherapy and the Treatment of Complex Posttraumatic Stress Disorder; CHAPTER NINE Cognitive-Behavioral Therapy for Acute Stress Disorder; CHAPTER TEN Seeking Safety: Therapy for Posttraumatic Stress Disorder and Substance Use Disorder; CHAPTER ELEVEN Cognitive Therapy for Trauma-Related Guilt and Shame; CHAPTER TWELVE Treatment of Complicated Grief: Integrating Cognitive-Behavioral Methods with Other Treatment Approaches"]
[{"$nulls":4},"CHAPTER THIRTEEN Sexual Revictimization: Risk Factors and PreventionCHAPTER FOURTEEN A Principle-Based Intervention for Couples Affected by Trauma; CHAPTER FIFTEEN Group Therapies for "]
[{"$nulls":4},"Trauma Using Cognitive-Behavioral Therapy; CHAPTER SIXTEEN Trauma in Childhood; CHAPTER SEVENTEEN Bringing Cognitive-Behavioral Psychology to Bear on Early Intervention with Trauma Survivors: Accident, Assault, War, Disaster, Mass Violence, and Terrorism; Index"]
[null,null,null,"Sommario/riassunto","Significantly revised and restructured to reflect major developments in the field, the expanded second edition of this important work is essentially a new book. The volume presents cutting-edge cognitive and behavioral applications for treating a variety of trauma-related symptoms, disorders, and special populations. Leading scientist-practitioners summarize the available treatment data and succinctly review the  \"\"whys,\"\" \"\"whats,\"\" and \"\"hows\"\" of their respective approaches. Nearly all extant chapters have been completely rewritten, many with new authors, and new chapters have been add"]
[null,"2.","Record Nr.",null,"UNINA9910767572103321"]
[null,null,"Titolo",null,"Algorithm Engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings / / edited by Jeffrey S. Vitter, Christos D. Zaroliagis"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999"]
[null,null,"ISBN",null,"3-540-48318-7"]
[null,null,"Edizione",null,"[1st ed. 1999.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 368 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 1611-3349 ; ; 1668"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Discrete Mathematics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"This volume contains the papers accepted for presentation at the 3rd International Workshop on Algorithm Engineering (WAE'99) held in London, UK, on July 19-21, 1999\"--Introd."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Lectures -- Selecting Problems for Algorithm Evaluation -- BSP Algorithms — “Write Once, Run Anywhere” -- Ten Years of LEDA: Some Thoughts -- Contributed Papers -- Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison -- Efficient Implementation of Lazy Suffix Trees -- Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism -- Finding Minimum Congestion Spanning Trees -- Evaluation of an Algorithm for the Transversal Hypergraph Problem -- Construction Heuristics and Domination Analysis for the Asymmetric TSP -- Counting in Mobile Networks: Theory and Experimentation -- Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport -- Implementation and Experimental Evaluation of Graph Connectivity "]
[{"$nulls":4},"Algorithms Using LEDA -- On-Line Zone Construction in Arrangements of Lines in the Plane -- The Design and Implementation of Planar Maps in CGAL -- An Easy to Use Implementation of Linear Perturbations within Cupgal -- Analysing Cache Effects in Distribution Sorting -- Fast Regular Expression Search -- An Experimental Evaluation of Hybrid Data Structures for Searching -- LEDA-SM: Extending LEDA to Secondary Memory -- A Priority Queue Transform -- Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks -- Estimating Large Distances in Phylogenetic Reconstruction -- The Performance of Concurrent Red-Black Tree Algorithms -- Performance Engineering Case Study: Heap Construction -- A Fast and Simple Local Search for Graph Coloring -- BALL: Biochemical Algorithms Library -- An Experimental Study of Priority Queues in External Memory."]
[null,null,null,"Sommario/riassunto","This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) \\bri- ingmodel\". Thismodel isdesignated asa programmer'smodelfora ne-grained computation framework called Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set. This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented."]