First-passage failure and its feedback minimization of quasi-partially integrable Hamiltonian systems

An n degree-of-freedom Hamiltonian system with r (1¡r¡n) independent 0rst integrals which are in involution is calledpartially integrable Hamiltonian system. A partially integrable Hamiltonian system subject to light dampings andweak stochastic excitations is called quasi-partially integrable Hamiltonian system. In the present paper, the procedures for studying the 0rst-passage failure and its feedback minimization of quasi-partially integrable Hamiltonian systems are proposed. First, the stochastic averaging methodfor quasi-partially integrable Hamiltonian systems is brie4y reviewed. Then, basedon the averagedIt ˆo equations, a backwardKolmogorov equation governing the conditional reliability function, a set of generalized Pontryagin equations governing the conditional moments of 0rst-passage time and their boundary and initial conditions are established. After that, the dynamical programming equations and their associated boundary and 0nal time conditions for the control problems of maximization of reliability andof maximization of mean 0rst-passage time are formulated. The relationship between the backwardKolmogorov equation andthe dynamical programming equation for reliability maximization, andthat between the Pontryagin equation andthe dynamical programming equation for maximization of mean 0rst-passage time are discussed. Finally, an example is worked out to illustrate the proposed procedures and the e9ectiveness of feedback control in reducing 0rst-passage failure.

First-passage failure of quasi-integrable Hamiltonian systems

The first-passage failure of quasi-integrable Hamiltonian si-stems (multidegree-of-freedom integrable Hamiltonian systems subject to light dampings and weakly random excitations) is investigated. The motion equations of such a system are first reduced to a set of averaged Ito stochastic differential equations by using the stochastic averaging method for quasi-integrable Hamiltonian systems. Then, a backward Kolmogorov equation governing the conditional reliability function and a set of generalized Pontryagin equations governing the conditional moments of first-passage time are established. Finally, the conditional reliability function, and the conditional probability density and moments of first-passage time are obtained by solving these equations with suitable initial and boundary conditions. Two examples are given to illustrate the proposed procedure and the results from digital simulation are obtained to verify the effectiveness of the procedure.

Size hierarchies affecting the social interactions and growth of juvenile Japanese flounder, Paralichthys olivaceus

Japanese flounder Paralichthys olivaceus (T. & S.)juveniles were size-graded and divided into three groups (small, large, and mixture of small and large flounder), and their social interactions (feeding, aggressive attacking and activity) and growth were investigated. The growth of the small flounder was markedly suppressed by the presence of the large flounder. Large flounder did not significantly suppress the overall food intake of the small flounder but exhibited high aggressive attacking on them and consequently inhibited their activity. Size dominance showed little influence on the aggressive behavior, feeding, activity and growth of the large flounder. The large flounder could not effectively defend the food in excess during the experiments ruling out disproportional food acquisition as the primary mechanism responsible for the size hierarchy effect. Aggressive interaction of the large flounder on the small flounder might be an important cause for the growth retardation of the small flounder. In culture, size grading could markedly improve the growth and survival of the early juvenile flounder. (C) 2004 Elsevier B.V. All rights reserved.

Resolving Ambiguity in Nonmonotonic Inheritance Hierarchies

This paper describes a theory of inheritance theories. We present an original theory of inheritance in nonmonotonic hierarchies. The structures on which this theory is based delineate a framework that subsumes most inheritance theories in the literature, providing a new foundation for inheritance. * Our path-based theory is sound and complete w.r.t. a direct model-theoretic semantics. * Both the credulous and the skeptical conclusions of this theory are polynomial-time computable. * We prove that true skeptical inheritance is not contained in the language of path-based inheritance. Because our techniques are modular w.r.t. the definition of specificity, they generalize to provide a unified framework for a broad class of inheritance theories. By describing multiple inheritance theories in the same "language" of credulous extensions, we make principled comparisons rather than the ad-hoc examination of specific examples makes up most of the comparative inheritance work.

A Comparison of Programming Models for Multiprocessors with Explicitly Managed Memory Hierarchies

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle the complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet speci?c enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The ?rst programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address spaces divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.

Deconstructing Victim and offender Identities in Discourses on Child Sexual Abuse: Hierarchies, Blame and the Good/Evil Dialectic

Contemporary social and political constructions of victimhood and offending behaviour lie at the heart of regulatory policies on child sexual abuse. Legislation is named after specific child victims of high profile cases, and a burgeoning range of pre-emptive measures are enacted to protect an amorphous class of ‘all potential victims’ from the risk sex offenders are seen as posing. Such policies are also heavily premised on the omnipresent predatory stranger. These constructed identities, however, are at odds with the actual identities of victims and offenders of such crimes. Drawing on a range of literatures, the core task of this article is to confront some of the complexities and tensions surrounding constructions of the victim/offender dyad within the specific context of sexual offending against children. In particular, the article argues that discourses on ‘blame’ – and the polarised notions of ‘innocence’ and ‘guilt’ – inform respective hierarchies of victimhood and offending concerning ‘legitimate’ victim and offender status. Based on these insights, the article argues for the need to move beyond such monochromatic understandings of victims and offenders of sexual crime and to reframe the politics of risk accordingly.