Role of Ponded Turbidity Currents in Reservoir Trap Efficiency

The capacity to store water in a reservoir declines as it traps sediment. A river entering a reservoir forms a prograding delta. Coarse sediment (e.g., sand) deposits in the fluvial topset and avalanching foreset of the delta, and is typically trapped with an efficiency near 100%. The trap efficiency of fine sediment (e.g., mud), on the other hand, may be below 100%, because some of this sediment may pass out of the reservoir without settling out. Here, a model of trap efficiency of mud is developed in terms of the mechanics of a turbidity current that plunges on the foreset. The dam causes a sustained turbidity current to reflect and form a muddy pond bounded upstream by a hydraulic jump. If the interface of this muddy pond rises above any vent or overflow point at the dam, the trap efficiency of mud drops below 100%. A model of the coevolution of topset, foreset, and bottomset in a reservoir that captures the dynamics of the internal muddy pond is presented. Numerical implementation, comparison against an experiment, and application to a field-scale case provide the basis for a physical understanding of the processes that determine reservoir trap efficiency.     

Family burden following traumatic brain injury.

Investigated burden experienced by 60 spouses and 71 parents who served as primary caregivers to individuals with traumatic brain injury (BI). Burden levels, as assessed by the Questionnaire on Resources and Stress (QRS-SF), were compared for spouses and parents. Both parents and spouses exhibited high levels of burden. Relative to spouses, parents reported significantly greater burden related to lifespan care. Spouses reported significantly less personal reward than did parents. The presence of social aggression and cognitive disability in the individual with BI was found to have a greater association with subjective burden of caregivers than was the presence of physical disability or injury severity. Results of previous studies with QRS-SF scores show that the responsibility assumed by spouses and parents of persons with BI was as great as that experienced by families of people with severe chronic physical disabilities. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Multimodel analysis and controller design for nonlinear processes

Multimodel analysis and controller design for nonlinear processes via gap metric is discussed. It is shown that the loop-shaping H_∞ approach can integrate the procedure of selecting operating points and the local controller design. The local controllers can guarantee not only stability but also performance specified by the pre- and/or post-compensators. Thus, at each operating points, local controllers can have similar performance, and the global performance of the system can be predicted.     

Al ionic radius influence on molecular dynamics simulations ofγ-Al2O3

Molecular dynamics (MD) simulations of-Al₂O₃, using a pairwise additive interaction potential of Pauling's type with four different radii for aluminum atoms, were analysed in order to determine the influence of the radius on the modification of coordination numbers of A1 relative to the ideal structure, at two different temperatures of 300 and 1500 K. It is found that the best choice is the radius of penta-coordinated aluminum, reproducing structural and vibrational properties of the compound in excellent agreement with experimentally observed properties.     

Computational Aspects of Uncertainty Profiles and Angel-Daemon Games

We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called angel-daemon games. Those games were introduced to asses the performance of the execution of a web orchestration on a moderate faulty or under stress environment. Angel-daemon games are a natural example of zero-sum games whose representation is naturally succinct. We show that the problems of deciding the existence of a pure Nash equilibrium or of a dominant strategy for a given player are ${\Sigma}^{p}_{2}$ -complete. Furthermore, computing the value of an angel-daemon game is EXP-complete. Thus, our results match the already known classification of the corresponding problems for the generic families of succinctly represented games with exponential number of actions.     

Efficient algorithms for counting parameterized list H-colorings

We study the fixed parameter tractability of the counting version of a parameterization of the restrictive list H-coloring problem. The parameterization is defined by fixing the number of preimages of a subset C of the vertices in H through a weight assignment K on C. We show the fixed parameter tractability of counting the number of list (H,C,K)-colorings, for the case in which (H,C,K) is simple. We introduce the concept of compactor and a new algorithmic technique, compactor enumeration, that allow us to design fixed parameter algorithms for parameterized counting problems.     

Search intensity versus search diversity: a false trade off?

An implicit tenet of modern search heuristics is that there is a mutually exclusive balance between two desirable goals: search diversity (or distribution), i.e., search through a maximum number of distinct areas, and, search intensity, i.e., a maximum search exploitation within each specific area. We claim that the hypothesis that these goals are mutually exclusive is false in parallel systems. We argue that it is possible to devise methods that exhibit high search intensity and high search diversity during the whole algorithmic execution. It is considered how distance metrics, i.e., functions for measuring diversity (given by the minimum number of local search steps between two solutions) and coordination policies, i.e., mechanisms for directing and redirecting search processes based on the information acquired by the distance metrics, can be used together to integrate a framework for the development of advanced collective search methods that present such desiderata of search intensity and search diversity under simultaneous coexistence. The presented model also avoids the undesirable occurrence of a problem we refer to as the ‘ergometric bike phenomenon’. Finally, this work is one of the very few analysis accomplished on a level of meta-meta-heuristics, because all arguments are independent of specific problems handled (such as scheduling, planning, etc.), of specific solution methods (such as genetic algorithms, simulated annealing, tabu search, etc.) and of specific neighborhood or genetic operators (2-opt, crossover, etc.).