exposure to trauma and risk for posttraumatic stress disorder

... events and prevalence of posttraumatic stress disorder (PTSD) symptoms among women raising children, and to identify factors that may alleviate the negative consequences of exposure to traumatic ... Somasundaram D: Lifetime events and posttraumatic stress disorder in postconflict settings JAMA 2001, 286:555-562 Rosner R, Powell S, Butollo W: Posttraumatic Stress Disorder three years after the ... Y, Bollini P, Trupmg T, Tor S, Lavelle J: The Harvard Trauma Questionnaire: Validating a cross-cultural instrument for measuring torture, trauma, and posttraumatic stress disorder in Indochinese...

Ngày tải lên: 18/06/2014, 22:20

... Ali and Amina and to his family Eeva, Rebecca, and Alexander Peter Van Roy would like to give a special thanks to his parents Frans and Hendrika and to his family Marie-Th´r`se, ee Johan, and ... like to thank our families and friends for their support and encouragement during the more than three years it took us to write this book Seif Haridi would like to give a special thanks to his ... lectures and lab sessions Together the three topics comprise one sixth of the full informatics curriculum for licentiate and engineering degrees There is another point we would like to make,...

Ngày tải lên: 22/02/2014, 06:20

... The alpha coefficients of internal consistency for the total number of life events ranged from 71 to 73 and for the total impact score from 0.71 to 0.84 Coping Capacities (CC) Our modified version ... prospective predictors Subst Use Misuse 1998, 33(13):2561-2604 Hawkins JD, Catalano RF, Miller JY: Risk and protective factors for alcohol and other drug problems in adolescence and early adulthood: ... depression, abnormal eating behaviour, and substance abuse were also included In order to analyze potential risk, compensatory, vulnerability, and protective factors of psychopathology [23], life...

Ngày tải lên: 13/08/2014, 18:21

Ngày tải lên: 13/08/2014, 18:21

... Ali and Amina and to his family Eeva, Rebecca, and Alexander Peter Van Roy would like to give a special thanks to his parents Frans and Hendrika and to his family Marie-Th´r`se, ee Johan, and ... like to thank our families and friends for their support and encouragement during the more than three years it took us to write this book Seif Haridi would like to give a special thanks to his ... lectures and lab sessions Together the three topics comprise one sixth of the full informatics curriculum for licentiate and engineering degrees There is another point we would like to make,...

Ngày tải lên: 14/08/2014, 10:22

... cell and returns new Bump and Read functions for it Returning functions as results of functions is another form of higher-order programming We group the Bump and Read functions together into one ... special syntax for it Chapter covers object-oriented programming and shows how to program with inheritance 1.15 Nondeterminism and time We have seen how to add concurrency and state to a program ... more about how to program with concurrency and state One way to make it easier is to use atomic operations An operation is atomic if no intermediate states can be observed It seems to jump directly...

Ngày tải lên: 14/08/2014, 10:22

... important are exception handling, concurrency, components (for programming in the large), capabilities (for encapsulation and security), and state (leading to objects and classes) In the context ... exception handling, which allows programs to handle unpredictable and exceptional situations • Section 2.7 gives a few advanced topics to let interested readers deepen their understanding of the ... different tools for many different purposes and all tools are there for a reason This section sets the stage for the rest of the book by explaining how we will present the syntax (“grammar”) and semantics...

Ngày tải lên: 14/08/2014, 10:22

... understood on its own, without having to understand the rest of the program The effort needed to understand the whole program is the sum of the efforts needed for the declarative component and for ... the component and the rest of the program, then they could not be understood independently They would have to be understood together, and the effort needed would be much bigger For example, it ... computer But it is not so nice for hand calculation We can make a simple change to the abstract machine that makes it much easier to use for hand calculation The idea is to replace the identifiers...

Ngày tải lên: 14/08/2014, 10:22

... ourselves a little and show how to repair the previous example Assume that X and Y are visible to the rest of the program If there is an exception, we arrange for X and Y to be bound to default values ... attempt to put conflicting information in the store For example, if we would bind X both to and to The declarative program cannot continue because there is no correct value for X Failure is an all-or-nothing ... Copyright c 2001-3 by P Van Roy and S Haridi All rights reserved 247 248 Declarative Concurrency To answer this question, we have to understand what it means for store contents to be “the same” Let us...

Ngày tải lên: 14/08/2014, 10:22

... mutable store Extension of execution state Next to the single-assignment store σ (and the trigger store τ , if laziness is important) we add a new store µ called the mutable store This store contains ... Van Roy and S Haridi All rights reserved 5.4 Program design for concurrency 375 call call(F) User presses button to call a lift Floor F calls a lift to itself User presses button to go to floor ... lift control system and show how the components interact The controller The controller is the easiest to explain It has two states, motor stopped and motor running At the motor stopped state the...

Ngày tải lên: 14/08/2014, 10:22

... state Next to the single-assignment store σ and the trigger store τ , we add a new store µ called the mutable store This store contains cells, which are pairs of the form x : y, where x and y are ... language For each loop, we defined the syntax and its translation into the kernel language, and then gave a proof rule The idea is to verify the proof rule once and for all and then to use it ... changed, and extended without touching the rest of the program For example, say we want to use the program with lists that are too big for main memory It is enough to change the list component to store...

Ngày tải lên: 14/08/2014, 10:22

... common self Forwarding does not imply a common self Let us show how to express forwarding and delegation We define special object creation functions, NewF and NewD, for forwarding and delegation ... meta-object protocol The ability to change the meta-object protocol is a powerful way to modify an object system Meta-object protocols are used for many purposes: debugging, customizing, and separation ... meta-object protocols is to method wrapping, that is, to intercept each method call, possibly performing a user-defined operation before and after the call and possibly changing the arguments to the call...

Ngày tải lên: 14/08/2014, 10:22

... refine locks into monitors and transactions Figure 8.4 shows the hierarchical relationships between these three concepts • Locks allow to group little atomic operations together into big atomic operations ... monitor lock is thread-reentrant and handles exceptions correctly Section 8.4.3 explains how the monitor is implemented Monitors were designed for building concurrent ADTs To make it easier to ... simple way to solve the problem is to add explicit state to the model Ports and cells are two important ways to add explicit state This gets us back to the model with both concurrency and state...

Ngày tải lên: 14/08/2014, 10:22

... translation is not automatic You will have to understand the program’s operational semantics and use this knowledge to translate into an equivalent relational program The bagof/3 and setof/3 predicates ... corresponds to using SolveAll inside a relational program Its extension setof/3 sorts the result and removes duplicates We show how to translate bagof/3; for setof/3 it is straightforward to follow ... (“or”), ↔ (“if and only if”), → (“implies”), and ¬ (“not”) The symbols p, q, r, and so forth are called atoms in logic An atom in logic is the smallest indivisible part of a logical formula This...

Ngày tải lên: 14/08/2014, 10:22

... lr(button(text:"One" glue:we) button(text:"Two" glue:we) button(text:"Three" glue:we) newline button(text:"Four" glue:we) button(text:"Five" glue:we) button(text:"Six" glue:we) newline button(text:"Seven" ... (see below) An interaction protocol defines what information is displayed by the widget and what sequences of user commands and widget actions are acceptable • Events and actions An event is a well-defined ... approach, and to supplement it with procedural aspects to increase expressiveness exactly where it is needed There is a recent standard for Web design, Dynamic HTML, that also makes it possible to combine...

Ngày tải lên: 14/08/2014, 10:22

... semantics For example, a remote operation on a cell could force the cell to migrate to the calling process, and thereafter perform the operation locally For all derived entities except for ports, ... 1970 The purpose of functor F is to tell us what time the compute server thinks it is To pass this functor to the compute server, we have to modify the server to accept functors instead of procedures ... sequence, and will bind the next variable after it has executed the lock body Each thread desiring the lock therefore references two variables: one to wait for the lock and one to pass the lock to the...

Ngày tải lên: 14/08/2014, 10:22

... W=atom c1:W Y=c1 Constraint store Mutable store Constraint store ST1 ST2 Mutable store STn Child space Threads W=atom Y=c1 S1 X= S2 Sn Threads c1:W W=atom c1:W Y=c1 Constraint store Mutable store ... store Constraint store ST1 Mutable store ST2 STn Child space Threads W=atom Y=c1 S1 X= S2 Sn Threads c1:W W=atom Y=c1 Constraint store c1:W Mutable store Constraint store Mutable store Figure 12.2: ... constraints and propagators We introduce basic constraints for finite domains as equations of the form x ∈ D, where D is a finite integer set This partial information is told to the store by the...

Ngày tải lên: 14/08/2014, 10:22

... store and a semantic stack For concurrency, we extended the machine to have multiple semantic stacks For lazy execution we added a trigger store For explicit state we added a mutable store For ... store The constraint store is a repository of information about the program variables For instance, the store can contain the information “x is bound to and x is equal to y”, which is written ... 13.1.1 The store The store consists of two parts: a single-assignment store and a predicate store: • The single-assignment store (also called constraint store) contains variables and their bindings...

Ngày tải lên: 14/08/2014, 10:22

... Description {IsAtom A} Return boolean saying whether A is an atom {AtomToString A} Return string corresponding to atom A {StringToAtom S} Return atom corresponding to string S Table B.6: Some atom operations ... nonterminals for the declaration parts of statements and loops, for binary operators (“constructing” operators consBinOp and “evaluating” operators evalBinOp ), for records (labels and features), and for ... sequence is transformed into a sequence of tokens C.6.1 Tokens Variables, atoms, strings, and characters Table C.9 defines the lexical syntax for variable identifiers, atoms, strings, and characters...

Ngày tải lên: 14/08/2014, 10:22