Activation of the human diaphragm during a repetitive postural task

1. The co-ordination between respiratory and postural functions of the diaphragm was investigated during repetitive upper Limb movement. It was hypothesised that diaphragm activity would occur either tonically or phasically in association with the forces from each movement and that this activity would combine with phasic respiratory activity. 2. Movements of the upper limb and ribcage were measured while standing subjects performed repetitive upper limb movements 'as fast as possible'. Electromyographic (EMG) recordings of the costal diaphragm were made using intramuscular electrodes in four subjects. Surface electrodes were placed over the deltoid and erector spinae muscles. 3. In contrast to standing at rest, diaphragm activity was present throughout expiration at 78 +/- 17% (mean +/- S.D.) of its peak inspiratory magnitude during repeated upper limb movement. 4. Bursts of deltoid and erector spinae EMG activity occurred at the Limb movement frequency (similar to 2.9 Hz). Although the majority of diaphragm EMG power was at the respiratory frequency (similar to 0.4 Hz), a peak was also present at the movement frequency. This finding was corroborated by averaged EMG activity triggered from upper limb movement. In addition, diaphragm EMG activity was coherent with ribcage motion at the respiratory frequency and with upper limb movement at the movement frequency. 5. The diaphragm response was similar when movement was performed while sitting. In addition, when subjects moved with increasing frequency the peak upper limb acceleration correlated with diaphragm EMG amplitude. These findings support the argument that diaphragm contraction is related to trunk control. 6. The results indicate that activity of human phrenic motoneurones is organised such that it contributes to both posture and respiration during a task which repetitively challenges trunk posture.

Why do non-color words interfere with color naming?

In the non-color-word Stroop task, university students' response latencies were longer for low-frequency than for higher frequency target words. Visual identity primes facilitated color naming in groups reading the prime silently or processing it semantically (Experiment 1) but did not when participants generated a rhyme of the prime (Experiment 3). With auditory identity primes, generating an associate or a rhyme of the prime produced interference (Experiments 2 and 3). Color-naming latencies were longer for nonwords than for words (Experiment 4). There was a small long-term repetition benefit in color naming for low-frequency words that had been presented in the lexical decision task (Experiment 5). Facilitation of word recognition speeds color naming except when phonological activation of the base word increases response competition.

Stereotypic explanatory bias: Implicit stereotyping as a predictor of discrimination

Two experiments examined whether a measure of implicit stereotyping based on the tendency to explain Black stereotype-incongruent events more often than Black stereotype-congruent events (Stereotypic Explanatory Bias or SEB) is predictive of behavior toward a partner in an interracial interaction. In Experiment I SEB predicted White males' choice to ask stereotypic questions of a Black female (but not a White male or White female) in an interview. In Experiment 2 the type of explanation (internal or external attribution) made for stereotype-inconsistency was examined. Results showed that White participants who made internal attributions for Black stereotype-incongruent behavior were rated more positively and those who made external attributions were rated more negatively by a Black male confederate. These results point to the potential of implicit stereotyping as an important predictor of behavior in an interracial interaction. (C) 2002 Elsevier Science (USA). All rights reserved.

An association rule-based method to support medical image diagnosis with efficiency

In this paper, we propose a method based on association rule-mining to enhance the diagnosis of medical images (mammograms). It combines low-level features automatically extracted from images and high-level knowledge from specialists to search for patterns. Our method analyzes medical images and automatically generates suggestions of diagnoses employing mining of association rules. The suggestions of diagnosis are used to accelerate the image analysis performed by specialists as well as to provide them an alternative to work on. The proposed method uses two new algorithms, PreSAGe and HiCARe. The PreSAGe algorithm combines, in a single step, feature selection and discretization, and reduces the mining complexity. Experiments performed on PreSAGe show that this algorithm is highly suitable to perform feature selection and discretization in medical images. HiCARe is a new associative classifier. The HiCARe algorithm has an important property that makes it unique: it assigns multiple keywords per image to suggest a diagnosis with high values of accuracy. Our method was applied to real datasets, and the results show high sensitivity (up to 95%) and accuracy (up to 92%), allowing us to claim that the use of association rules is a powerful means to assist in the diagnosing task.

Diversity and commonality in national identities: an exploratory analysis of cross-national patterns

Issues of boundary maintenance are implicit in all studies of national identity. By definition, national communities consist of those who are included but surrounded (literally or metaphorically) by those who are excluded. Most extant research on national identity explores criteria for national membership largely in terms of official or public definitions described, for example, in citizenship and immigration laws or in texts of popular culture. We know much less about how ordinary people in various nations reason about these issues. An analysis of cross-national (N = 23) survey data from the 1995 International Social Science Program reveals a core pattern in most of the countries studied. Respondents were asked how important various criteria were in being 'truly' a member of a particular nation. Exploratory factor analysis shows that these items cluster in terms of two underlying dimensions. Ascriptive/objectivist criteria relating to birth, religion and residence can be distinguished from civic/voluntarist criteria relating to subjective feelings of membership and belief in core institutions. In most nations the ascriptive/objectivist dimension of national identity was more prominent than the subjective civic/voluntarist dimension. Taken overall, these findings suggest an unanticipated homogeneity in the ways that citizens around the world think about national identity. To the extent that these dimensions also mirror the well-known distinction between ethnic and civic national identification, they suggest that the former remains robust despite globalization, mass migration and cultural pluralism. Throughout the world official definitions of national identification have tended to shift towards a civic model. Yet citizens remain remarkably traditional in outlook. A task for future research is to investigate the macrosociological forces that produce both commonality and difference in the core patterns we have identified.

The IWA Anaerobic Digestion Model No 1 (ADM1)

The IWA Anaerobic Digestion Modelling Task Group was established in 1997 at the 8th World Congress on,Anaerobic Digestion (Sendai, Japan) with the goal of developing a generalised anaerobic digestion model. The structured model includes multiple steps describing biochemical as well as physicochemical processes. The biochemical steps include disintegration from homogeneous particulates to carbohydrates, proteins and lipids; extracellular hydrolysis of these particulate substrates to sugars, amino acids, and long chain fatty acids (LCFA), respectively; acidogenesis from sugars and amino acids to volatile fatty acids (VFAs) and hydrogen; acetogenesis of LCFA and VFAs to acetate; and separate methanogenesis steps from acetate and hydrogen/CO2. The physico-chemical equations describe ion association and dissociation, and gas-liquid transfer. Implemented as a differential and algebraic equation (DAE) set, there are 26 dynamic state concentration variables, and 8 implicit algebraic variables per reactor vessel or element. Implemented as differential equations (DE) only, there are 32 dynamic concentration state variables.

Genetic sources of covariation among P3(00) and online performance variables in a delayed-response working memory task

Genetic and environmental sources of covariation among the P3(00) and online performance elicited in a delayed-response working memory task, and psychometric IQ assessed by the multidimensional aptitude battery, were examined in an adolescent twin sample. An association between frontal P3 latency and task performance (phenotypic r = -0.33; genotypic r = -0.49) was indicated, with genes (i.e. twin status) accounting for a large part of the covariation ( > 70%). In contrast, genes influencing P3 amplitude mediated only a small part (2%) of the total genetic variation in task performance. While task performance mediated 15% of the total genetic variation in IQ (phenotypic r = 0.22; genotypic r = 0.39) there was no association between P3 latency and IQ or P3 amplitude with IQ. The findings provide some insight into the inter-relationships among psychophysiological, performance and psychometric measures of cognitive ability, and provide support for a levels-of-processing genetic model of cognition where genes act on specific sub-components of cognitive processes.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.

Attention performance among Brazilian truck drivers and its association with amphetamine use: pilot study

The aim of this article was to describe the attention functioning of twenty-two truck drivers and its relationship with amphetamine use. Those drivers who reported using amphetamines in the twelve months previous to the interview had the best performance in a test evaluating sustained attention functioning. Although amphetamine use may initially seem advantageous to the drivers, it may actually impair safe driving. The findings suggest the importance of monitoring the laws regarding amphetamine use in this country.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.