Group theory and quasiprobability integrals of Wigner functions

The integral of the Wigner function of a quantum-mechanical system over a region or its boundary in the classical phase plane, is called a quasiprobability integral. Unlike a true probability integral, its value may lie outside the interval [0, 1]. It is characterized by a corresponding selfadjoint operator, to be called a region or contour operator as appropriate, which is determined by the characteristic function of that region or contour. The spectral problem is studied for commuting families of region and contour operators associated with concentric discs and circles of given radius a. Their respective eigenvalues are determined as functions of a, in terms of the Gauss-Laguerre polynomials. These polynomials provide a basis of vectors in a Hilbert space carrying the positive discrete series representation of the algebra su(1, 1) approximate to so(2, 1). The explicit relation between the spectra of operators associated with discs and circles with proportional radii, is given in terms of the discrete variable Meixner polynomials.

Background risk in generalized expected utility theory

In this paper, it is shown that, for a wide range of risk-averse generalized expected utility preferences, independent risks are complementary, contrary to the results for expected utility preferences satisfying conditions such as proper and standard risk aversion.

Dual C3a/C5a receptor agonism by a C5a C-terminal analogue decapeptide

No abstract

Extinction of affective learning: No evidence for dual process accounts of human learning

The acquisition and extinction of affective valence to neutral geometrical shape conditional stimuli was investigated in three experiments. Experiment 1 employed a differential conditioning procedure with aversive shock USs. Differential electrodermal responding was evident during acquisition and lost during extinction. As indexed by verbal ratings, the CS1 acquired negative valence during acquisition,which was reduced after extinction. Affective priming, a reaction time based demand free measure of stimulus valence, failed to provide evidence for affective learning. Experiment 2 employed pictures of happy and angry faces as USs.Valence ratings after acquisitionweremore positive for theCS paired with happy faces (CS-H) and less positive for the CS paired with angry faces (CS-A) than during baseline. Extinction training reduced the extent of acquired valence significantly for both CSs, however, ratings of the CS-A remained different from baseline. Affective priming confirmed these results yielding differences between CS-A and CS-H after acquisition for pleasant and unpleasant targets, but for pleasant targets only after extinction. Experiment 3 replicated the design of Experiment 2, but presented the US pictures backwardly masked. Neither rating nor affective priming measures yielded any evidence for affective learning. The present results confirm across two different experimental procedures that, contrary to predictions from dual process accounts of human learning, affective learning is subject to extinction.

Matching occupation and self: Does matching theory adequately model children's thinking?

The present exploratory-descriptive cross-national study focused on the career development of 11- to 14-yr.-old children, in particular whether they can match their personal characteristics with their occupational aspirations. Further, the study explored whether their matching may be explained in terms of a fit between person and environment using Holland's theory as an example. Participants included 511 South African and 372 Australian children. Findings relate to two items of the Revised Career Awareness Survey that require children to relate personal-social knowledge to their favorite occupation. Data were analyzed in three stages using descriptive statistics, i.e., mean scores, frequencies, and percentage agreement. The study indicated that children perceived their personal characteristics to be related to their occupational aspirations. However, how this matching takes place is not adequately accounted for in terms of a career theory such as that of Holland.

Career counseling: Applying the systems theory framework of career development

In recent years, career development and career counseling have increasingly been informed by concepts emanating from the constructivist worldview. For example, the Systems Theory Framework (STF; M. McMahon, 2002; M. McMahon I W. Patton, 1995; W. Patton I M. McMahon, 1997, 1999) of career development has been proposed as a metatheoretical account of career development. Furthermore, its theoretical constructs may be applied to career counseling. Thus, the STF provides a theoretical and practical consistency to career counseling and addresses concerns about a gulf between career theory and practice. This article discusses the practical application of the STF of career development as a guide to career counseling.

Multicultural career counseling: Theoretical applications of the systems theory framework

Increasing recognition of cultural influences on career development requires expanded theoretical and practical perspectives. Theories of career development need to explicate views of culture and provide direction for career counseling with clients who are culturally diverse. The Systems Theory Framework (STF) is a theoretical foundation that accounts for systems of influence on people's career development, including individual, social, and environmental/societal contexts. The discussion provides a rationale for systemic approaches in multicultural career counseling and introduces the central theoretical tenets of the STF. Through applications of the STF, career counselors are challenged to expand their roles and levels of intervention in multicultural career counseling.

Mathematical constraints on a theory of human memory - Response

Colonius suggests that, in using standard set theory as the language in which to express our computational-level theory of human memory, we would need to violate the axiom of foundation in order to express meaningful memory bindings in which a context is identical to an item in the list. We circumvent Colonius's objection by allowing that a list item may serve as a label for a context without being identical to that context. This debate serves to highlight the value of specifying memory operations in set theoretic notation, as it would have been difficult if not impossible to formulate such an objection at the algorithmic level.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.