Experimental manipulation of prior experience: Effects on item and associative recognition

Frequency of exposure to very low- and high-frequency words was manipulated in a three-phase (familiarisation, study, and test) design. During familiarisation, words were presented with their definition (once, four times, or not presented). One week (Experiment 1) or one day (Experiment 2) later, participants studied a list of homogeneous pairs (i.e., pair members were matched on background and familiarisation frequency). Item and associative recognition of high- and very low-frequency words presented in intact, rearranged, old-new, or new-new pairs were tested in Experiment 1. Associative recognition of very low-frequency words was tested in Experiment 2. Results showed that prior familiaris ation improved associative recognition of very low-frequency pairs, but had no effect on high-frequency pairs. The role of meaning in the formation of item-to-item and item-to-context associations and the implications for current models of memory are discussed.

Quantum doubles from a class of noncocommutative weak Hopf algebras

The concept of biperfect (noncocommutative) weak Hopf algebras is introduced and their properties are discussed. A new type of quasi-bicrossed products is constructed by means of weak Hopf skew-pairs of the weak Hopf algebras which are generalizations of the Hopf pairs introduced by Takeuchi. As a special case, the quantum double of a finite dimensional biperfect (noncocommutative) weak Hopf algebra is built. Examples of quantum doubles from a Clifford monoid as well as a noncommutative and noncocommutative weak Hopf algebra are given, generalizing quantum doubles from a group and a noncommutative and noncocommutative Hopf algebra, respectively. Moreover, some characterizations of quantum doubles of finite dimensional biperfect weak Hopf algebras are obtained. (C) 2004 American Institute of Physics.

Braided m-Lie algebras

Braided m-Lie algebras induced by multiplication are introduced, which generalize Lie algebras, Lie color algebras and quantum Lie algebras. The necessary and sufficient conditions for the braided m-Lie algebras to be strict Jacobi braided Lie algebras are given. Two classes of braided m-Lie algebras are given, which are generalized matrix braided m-Lie algebras and braided m-Lie subalgebras of End(F)M, where M is a Yetter-Drinfeld module over B with dimB < infinity. In particular, generalized classical braided m-Lie algebras sl(q,f)(GM(G)(A),F) and osp(q,l)(GM(G)(A),M,F) of generalized matrix algebra GMG(A) are constructed and their connection with special generalized matrix Lie superalgebra sl(s,f)(GM(Z2)(A(s)),F) and orthosymplectic generalized matrix Lie super algebra osp(s,l) (GM(Z2)(A(s)),M-s,F) are established. The relationship between representations of braided m-Lie algebras and their associated algebras are established.

Alcohol-related associative strength and drinking behaviours: concurrent and prospective relationships

The first part of this research assessed the longitudinal relationships between alcohol- related associative strength and alcohol use measured at two time- points, 6 months apart. Cross-lagged results support the utility of alcohol- related associative strength to predict drinking behaviours prospectively and vice versa. These results remained after competing explanations of previous use, autocorrelations between memory measures, sensation seeking and background variables of age and gender were accounted for. Findings offer further evidence for an implicit cognitions approach to drinking processes. In the second part of our study, cross-sectional analysis investigated potential mediating mechanisms in the relation of associative strength to quantity and frequency dimensions of drinking. Mediational models provide preliminary evidence that implicit memory processes may have differential effects on quantity and frequency dimensions of drinking behaviours. The results point to the possibility that increasing awareness of implicit alcohol-related associations may have utility in interventions for young adults.

Adolescent tobacco-related associative memory: a cross-sectional and contextual analysis

Tobacco use is prevalent in adolescents, and understanding factors that contribute to its uptake and early development remains a critical public health priority. Implicit drug-related memory associations (DMAs) are predictive of drug use in older samples, but such models have little application to adolescent tobacco use. Moreover, extant research on memory associations yields little information on contextual factors that may be instrumental in the development of DMAs. The present study examined (a) the degree to which tobacco-related memory associations (TMAs) were associated with concurrent tobacco use and (b) the extent to which TMAs mediated the association of peer and self-use. A sample of 210 Australian high school students was recruited. Participants completed TMA tasks and behavioral checklists designed to obscure the tobacco-related focus of the study. Results showed that TMAs were associated with peer use, and TMAs predicted self-use. We found no evidence that TMAs mediated the association of peer and self-use. Future research might examine the emotive valence of implicit nodes and drinking behavior. The results have implications for testing the efficacy of consciousness-raising interventions for adolescents at risk of tobacco experimentation or regular use.

Varieties of algebras arising from K-perfect m-cycle systems

A class of algebras forms a variety if it is characterised by a collection of identities. There is a well-known method, often called the standard construction, which gives rise to algebras from m-cycle systems. It is known that the algebras arising from {1}-perfect m-cycle systems form a variety for m is an element of {3, 5} only, and that the algebras arising from {1, 2}-perfect m-cycle systems form a variety for m is an element of {3, 5, 7} only. Here we give, for any set K of positive integers, necessary and sufficient conditions under which the algebras arising from K-perfect m-cycle systems form a variety. (c) 2006 Elsevier B.V. All rights reserved.

Entangled subspaces and quantum symmetries

Entanglement is defined for each vector subspace of the tensor product of two finite-dimensional Hilbert spaces, by applying the notion of operator entanglement to the projection operator onto that subspace. The operator Schmidt decomposition of the projection operator defines a string of Schmidt coefficients for each subspace, and this string is assumed to characterize its entanglement, so that a first subspace is more entangled than a second, if the Schmidt string of the second majorizes the Schmidt string of the first. The idea is applied to the antisymmetric and symmetric tensor products of a finite-dimensional Hilbert space with itself, and also to the tensor product of an angular momentum j with a spin 1/2. When adapted to the subspaces of states of the nonrelativistic hydrogen atom with definite total angular momentum (orbital plus spin), within the space of bound states with a given total energy, this leads to a complete ordering of those subspaces by their Schmidt strings.

Pseudo memory effects, majorization and entropy in quantum random walks

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial distribution. In a classical walk, entropy increase can be regarded as a consequence of the majorization ordering of successive distributions. The Lorenz curves of successive distributions for a symmetric quantum walk reveal no majorization ordering in general. Nevertheless, entropy can increase, and computer experiments show that it does so on average. Varying the stages at which the quantum coin system is traced out leads to new quantum walks, including a symmetric walk for which majorization ordering is valid but the spreading rate exceeds that of the usual symmetric quantum walk.

Coherent state construction of representations of osp(2|2) and primary fields of osp(2|2) conformal field theory

Representations of the superalgebra osp(2/2)(k)((1)) and current superalgebra. osp(2/2)k in the standard basis are investigated. All finite-dimensional typical and atypical representations of osp(2/2) are constructed by the vector coherent state method. Primary fields of the non-unitary conformal field theory associated with osp(2/2)(k)((1)) in the standard basis are obtained for arbitrary level k. (C) 2004 Elsevier B.V. All rights reserved.

Solution of the dual reflection equation for A(n-1)((1)) solid-on-solid model

We obtain a diagonal solution of the dual reflection equation for the elliptic A(n-1)((1)) solid-on-solid model. The isomorphism between the solutions of the reflection equation and its dual is studied. (C) 2004 American Institute of Physics.

Fungible dynamics: There are only two types of entangling multiple-qubit interactions

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? It has been shown that all two-body Hamiltonian evolutions can be simulated using any fixed two-body entangling n-qubit Hamiltonian and fast local unitaries. By entangling we mean that every qubit is coupled to every other qubit, if not directly, then indirectly via intermediate qubits. We extend this study to the case where interactions may involve more than two qubits at a time. We find necessary and sufficient conditions for an arbitrary n-qubit Hamiltonian to be dynamically universal, that is, able to simulate any other Hamiltonian acting on n qubits, possibly in an inefficient manner. We prove that an entangling Hamiltonian is dynamically universal if and only if it contains at least one coupling term involving an even number of interacting qubits. For odd entangling Hamiltonians, i.e., Hamiltonians with couplings that involve only an odd number of qubits, we prove that dynamic universality is possible on an encoded set of n-1 logical qubits. We further prove that an odd entangling Hamiltonian can simulate any other odd Hamiltonian and classify the algebras that such Hamiltonians generate. Thus, our results show that up to local unitary operations, there are only two fundamentally different types of entangling Hamiltonian on n qubits. We also demonstrate that, provided the number of qubits directly coupled by the Hamiltonian is bounded above by a constant, our techniques can be made efficient.

Beating the urge: Implications of research into substance-related desires

Despite the advent of improved pharmacological treatments to alleviate substance-related desires, psychological approaches will continue to be required. However, the current psychological treatment that most specifically focuses on desires and their management-cue exposure (CE)-has not lived up to its original promise. This paper argues that current psychological approaches to desire do not adequately incorporate our knowledge about the factors that trigger, maintain, and terminate episodes of desire. It asserts that the instigation and maintenance of desires involve both associative and elaborative processes. Understanding the processes triggering the initiation of intrusive thoughts may assist in preventing some episodes, but occasional intrusions will be inevitable. A demonstration of the ineffectiveness of thought suppression may discourage its use as a coping strategy for desire-related intrusions, and mindfulness meditation plus cognitive therapy may help in accepting their occurrence and letting them go. Competing tasks may be used to reduce elaboration of desires, and competing sensory images may have particular utility. The application of these procedures during episodes that are elicited in the clinic may allow the acquisition of more effective strategies to address desires in the natural environment. (C) 2004 Elsevier Ltd. All rights reserved.

Do dogs (canis familiaris) understand invisible displacement?

Domestic dogs (Canis familiaris) perform above chance on invisible displacement tasks despite showing few other signs of possessing the necessary representational abilities. Four experiments investigated how dogs find an object that has been hidden in 1 of 3 opaque boxes. Dogs passed the task under a variety of control conditions, but only if the device used to displace the object ended up adjacent to the target box after the displacement. These results suggest that the search behavior of dogs was guided by simple associative rules rather than mental representation of the object's past trajectory. In contrast, Experiment 5 found that on the same task, 18- and 24-month-old children showed no disparity between trials in which the displacement device was adjacent or nonadjacent to the target box.

Cognitive fit between conceptual schemas and internal problem representations: The case of geospatio-temporal conceptual schema comprehension

Geospatio-temporal conceptual models provide a mechanism to explicitly represent geospatial and temporal aspects of applications. Such models, which focus on both what and when/where, need to be more expressive than conventional conceptual models (e.g., the ER model), which primarily focus on what is important for a given application. In this study, we view conceptual schema comprehension of geospatio-temporal data semantics in terms of matching the external problem representation (that is, the conceptual schema) to the problem-solving task (that is, syntactic and semantic comprehension tasks), an argument based on the theory of cognitive fit. Our theory suggests that an external problem representation that matches the problem solver's internal task representation will enhance performance, for example, in comprehending such schemas. To assess performance on geospatio-temporal schema comprehension tasks, we conducted a laboratory experiment using two semantically identical conceptual schemas, one of which mapped closely to the internal task representation while the other did not. As expected, we found that the geospatio-temporal conceptual schema that corresponded to the internal representation of the task enhanced the accuracy of schema comprehension; comprehension time was equivalent for both. Cognitive fit between the internal representation of the task and conceptual schemas with geospatio-temporal annotations was, therefore, manifested in accuracy of schema comprehension and not in time for problem solution. Our findings suggest that the annotated schemas facilitate understanding of data semantics represented on the schema.