Psychoanalytic perspectives on substance use and antisocial personality disorder

Psychoanalysis and related psychodynamic psychotherapies have historically had a limited engagement with substance use and antisocial personality disorders. This in part reflects an early preoccupation with 'transference neuroses' and in part reflects later de-emphasis of diagnosis and focus on therapeutic process. Nonetheless, psychoanalytic perspectives can usefully inform thinking about approaches to treatment of such disorders and there are psychoanalytic constructs that have specific relevance to their treatment. This paper reviews some prominent strands of psychoanalytic thinking as they pertain to the treatment of substance abuse and antisocial personality disorders. It is argued that, while Freudian formulations lead to a primarily pessimistic view of the prospect of treatment of such disorders, both the British object relations and the North American self psychology traditions suggest potentially productive approaches. Finally the limited empirical evidence from brief psycho dynamically informed treatments of substance use disorders is reviewed. It is concluded that such treatments are not demonstrably effective but that, since no form of psychotherapy has established high efficacy with substance use disorders, brief psychdynamic therapies are not necessarily of lesser value than other treatments and may have specific value for particular individuals and in particular treatment contexts.

Tool support for generating passive C++ test oracles from object-z specifications

A test oracle provides a means for determining whether an implementation behaves according to its specification. A passive test oracle checks that the correct behaviour has been implemented, but does not implement the behaviour itself. In previous work, we have presented a method that allows us to derive passive C++ test oracles from formal specifications written in Object-Z. We describe the "Warlock" prototype tool that supports the method. Warlock is built on top of an existing Object-Z type checker and generates oracle code for a substantial subset of the Object-Z language. We describe the architecture of Warlock and its application to a number of Object-Z specifications. We also discuss its current limitations.

Properties of the stochastic Gross-Pitaevskii equation: finite temperature Ehrenfest relations and the optimal plane wave representation

We present Ehrenfest relations for the high temperature stochastic Gross-Pitaevskii equation description of a trapped Bose gas, including the effect of growth noise and the energy cutoff. A condition for neglecting the cutoff terms in the Ehrenfest relations is found which is more stringent than the usual validity condition of the truncated Wigner or classical field method-that all modes are highly occupied. The condition requires a small overlap of the nonlinear interaction term with the lowest energy single particle state of the noncondensate band, and gives a means to constrain dynamical artefacts arising from the energy cutoff in numerical simulations. We apply the formalism to two simple test problems: (i) simulation of the Kohn mode oscillation for a trapped Bose gas at zero temperature, and (ii) computing the equilibrium properties of a finite temperature Bose gas within the classical field method. The examples indicate ways to control the effects of the cutoff, and that there is an optimal choice of plane wave basis for a given cutoff energy. This basis gives the best reproduction of the single particle spectrum, the condensate fraction and the position and momentum densities.

The role of self-efficacy in predicting rule-following behaviors in shelters for homeless youth: A test of the theory of planned behavior

Through a prospective study of 70 youths staying at homeless-youth shelters, the authors tested the utility of I. Ajzen's (1991) theory of planned behavior (TPB), by comparing the constructs of self-efficacy with perceived behavioral control (PBC), in predicting people's rule-following behavior during shelter stays. They performed the 1st wave of data collection through a questionnaire assessing the standard TPB components of attitudes, subjective norms, PBC, and behavioral intentions in relation to following the set rules at youth shelters. Further, they distinguished between items assessing PBC (or perceived control) and those reflecting self-efficacy (or perceived difficulty). At the completion of each youth's stay at the shelter, shelter staff rated the rule adherence for that participant. Regression analyses revealed some support for the TPB in that subjective norm was a significant predictor of intentions. However, self-efficacy emerged as the strongest predictor of intentions and was the only significant predictor of rule-following behavior. Thus, the results of the present study indicate the possibility that self-efficacy is integral to predicting rule adherence within this context and reaffirm the importance of incorporating notions of people's perceived ease or difficulty in performing actions in models of attitude-behavior prediction.

UML approach to the generation of test sequences for Java-based concurrent systems

Starting with a UML specification that captures the underlying functionality of some given Java-based concurrent system, we describe a systematic way to construct, from this specification, test sequences for validating an implementation of the system. The approach is to first extend the specification to create UML state machines that directly address those aspects of the system we wish to test. To be specific, the extended UML state machines can capture state information about the number of waiting threads or the number of threads blocked on a given object. Using the SAL model checker we can generate from the extended UML state machines sequences that cover all the various possibilities of events and states. These sequences can then be directly transformed into test sequences suitable for input into a testing tool such as ConAn. As an illustration, the methodology is applied to generate sequences for testing a Java implementation of the producer-consumer system. © 2005 IEEE

Relations between physiologic parameters and pulse transit time during loaded breathing

Pulse transit time (PTT) is a non-invasive measure, defined as time taken for the pulse pressure waves to travel from the R-wave of electrocardiogram to a selected peripheral site. Baseline PTT value is known to be influenced by physiologic variables like heart rate (HR), blood pressure (BP) and arterial compliance (AC). However, few quantitative data are available describing the factors which can influence PTT measurements in a child during breathing. The aim of this study was to investigate the effects of changes in breathing efforts on PTT baseline and fluctuations. Two different inspiratory resistive loading (IRL) devices were used to simulate loaded breathing in order to induce these effects. It is known that HR can influence the normative PTT value however the effect of HR variability (HRV) is not well-studied. Two groups of 3 healthy children ( 0.05) HR changes during all test activities. Results showed that HRV is not the sole contributor to PTT variations and suggest that changes in other physiologic parameters are also equally important. Hence, monitoring PTT measurement can be indicative of these associated changes during tidal or increased breathing efforts in healthy children.

Incremental derivation of abstraction relations for data refinements

Data refinements are refinement steps in which a program’s local data structures are changed. Data refinement proof obligations require the software designer to find an abstraction relation that relates the states of the original and new program. In this paper we describe an algorithm that helps a designer find an abstraction relation for a proposed refinement. Given sufficient time and space, the algorithm can find a minimal abstraction relation, and thus show that the refinement holds. As it executes, the algorithm displays mappings that cannot be in any abstraction relation. When the algorithm is not given sufficient resources to terminate, these mappings can help the designer find a suitable abstraction relation. The same algorithm can be used to test an abstraction relation supplied by the designer.