Development, reliability, and concurrent validity of the modified inventory of potential reconstructive needs

Documentation of burn sequelae can be a difficult and time-consuming task. To date a reliable and systematic format for recording postburn trauma is lacking. The purpose of this research was two-fold: first, to develop a Modified Inventory of Potential Reconstructive Needs from the original Inventory of Potential Reconstructive Needs to allow methodical documentation of functional and cosmetic burn sequelae in all body surface areas of children with burns and, second, to establish interrater reliability and concurrent validity of the instrument, thus allowing its clinical application. Two raters scored the Modified Inventory of Potential Reconstructive Needs on 41 children with a range of burns types and severity. Excellent interrater reliability was demonstrated for both total (intraclass correlation coefficient = 0.996) and subsection inventory scores. Concurrent validity was also established with total scores showing strong positive correlations (0.73-0.76) with three indicators of burn severity. These findings provide initial support for the tool's clinical applicability, particularly in relation to rehabilitative planning and documentation.

Prototyping Concurrent Systems in Cw

Software architecture is currently recognized as one of the most critical design steps in Software Engineering. The specification of the overall system structure, on the one hand, and of the interactions patterns between its components, on the other, became a major concern for the working developer. Although a number of formalisms to express behaviour and supply the indispensable calculational power to reason about designs, are available, the task of deriving architectural designs on top of popular component platforms has remained largely informal. This paper introduces a systematic approach to derive, from behavioural specifications written in Cw, the corresponding architectural skeletons in the Microsoft .NET framework in the form of executable code

Sistemas de Tipos para Verificación de Programas Concurrentes. Type Systems for Concurrent Programs Verification.

La programación concurrente es una tarea difícil aún para los más experimentados programadores. Las investigaciones en concurrencia han dado como resultado una gran cantidad de mecanismos y herramientas para resolver problemas de condiciones de carrera de datos y deadlocks, problemas que surgen por el mal uso de los mecanismos de sincronización. La verificación de propiedades interesantes de programas concurrentes presenta dificultades extras a los programas secuenciales debido al no-determinismo de su ejecución, lo cual resulta en una explosión en el número de posibles estados de programa, haciendo casi imposible un tratamiento manual o aún con la ayuda de computadoras. Algunos enfoques se basan en la creación de lenguajes de programación con construcciones con un alto nivel de abstración para expresar concurrencia y sincronización. Otros enfoques tratan de desarrollar técnicas y métodos de razonamiento para demostrar propiedades, algunos usan demostradores de teoremas generales, model-checking o algortimos específicos sobre un determinado sistema de tipos. Los enfoques basados en análisis estático liviano utilizan técnicas como interpretación abstracta para detectar ciertos tipos de errores, de una manera conservativa. Estas técnicas generalmente escalan lo suficiente para aplicarse en grandes proyectos de software pero los tipos de errores que pueden detectar es limitada. Algunas propiedades interesantes están relacionadas a condiciones de carrera y deadlocks, mientras que otros están interesados en problemas relacionados con la seguridad de los sistemas, como confidencialidad e integridad de datos. Los principales objetivos de esta propuesta es identificar algunas propiedades de interés a verificar en sistemas concurrentes y desarrollar técnicas y herramientas para realizar la verificación en forma automática. Para lograr estos objetivos, se pondrá énfasis en el estudio y desarrollo de sistemas de tipos como tipos dependientes, sistema de tipos y efectos, y tipos de efectos sensibles al flujo de datos y control. Estos sistemas de tipos se aplicarán a algunos modelos de programación concurrente como por ejemplo, en Simple Concurrent Object-Oriented Programming (SCOOP) y Java. Además se abordarán propiedades de seguridad usando sistemas de tipos específicos. Concurrent programming has remained a dificult task even for very experienced programmers. Concurrency research has provided a rich set of tools and mechanisms for dealing with data races and deadlocks that arise of incorrect use of synchronization. Verification of most interesting properties of concurrent programs is a very dificult task due to intrinsic non-deterministic nature of concurrency, resulting in a state explosion which make it almost imposible to be manually treat and it is a serious challenge to do that even with help of computers. Some approaches attempts create programming languages with higher levels of abstraction for expressing concurrency and synchronization. Other approaches try to develop reasoning methods to prove properties, either using general theorem provers, model-checking or specific algorithms on some type systems. The light-weight static analysis approach apply techniques like abstract interpretation to find certain kind of bugs in a conservative way. This techniques scale well to be applied in large software projects but the kind of bugs they may find are limited. Some interesting properties are related to data races and deadlocks, while others are interested in some security problems like confidentiality and integrity of data. The main goals of this proposal is to identify some interesting properties to verify in concurrent systems and develop techniques and tools to do full automatic verification. The main approach will be the application of type systems, as dependent types, type and effect systems, and flow-efect types. Those type systems will be applied to some models for concurrent programming as Simple Concurrent Object-Oriented Programming (SCOOP) and Java. Other goals include the analysis of security properties also using specific type systems.

Relative and absolute reliability of the clinical version of the Narrow Path Walking Test (NPWT) under single and dual task conditions.

Decline in gait stability has been associated with increased fall risk in older adults. Reliable and clinically feasible methods of gait instability assessment are needed. This study evaluated the relative and absolute reliability and concurrent validity of the testing procedure of the clinical version of the Narrow Path Walking Test (NPWT) under single task (ST) and dual task (DT) conditions. Thirty independent community-dwelling older adults (65-87 years) were tested twice. Participants were instructed to walk within the 6-m narrow path without stepping out. Trial time, number of steps, trial velocity, number of step errors, and number of cognitive task errors were determined. Intraclass correlation coefficients (ICCs) were calculated as indices of agreement, and a graphic approach called "mountain plot" was applied to help interpret the direction and magnitude of disagreements between testing procedures. Smallest detectable change and smallest real difference (SRD) were computed to determine clinically relevant improvement at group and individual levels, respectively. Concurrent validity was assessed using Performance Oriented Mobility Assessment Tool (POMA) and the Short Physical Performance Battery (SPPB). Test-retest agreement (ICC1,2) varied from 0.77 to 0.92 in ST and from 0.78 to 0.92 in DT conditions, with no apparent systematic differences between testing procedures demonstrated by the mountain plot graphs. Smallest detectable change and smallest real change were small for motor task performance and larger for cognitive errors. Significant correlations were observed for trial velocity and trial time with POMA and SPPB. The present results indicate that the NPWT testing procedure is highly reliable and reproducible.

Concurrent : Easy to use Python computing environment

Concurrent aims to be a different type of task distribution system compared to what MPI like system do. It adds a simple but powerful application abstraction layer to distribute the logic of an entire application onto a swarm of clusters holding similarities with volunteer computing systems. Traditional task distributed systems will just perform simple tasks onto the distributed system and wait for results. Concurrent goes one step further by letting the tasks and the application decide what to do. The programming paradigm is then totally async without any waits for results and based on notifications once a computation has been performed.

Effect of training on the ability of dual-task coordination

Within the framework of the working memory model proposed by A. Baddeley and G. Hitch, a dual-task paradigm has been suggested to evaluate the capacity to perform simultaneously two concurrent tasks. This capacity is assumed to reflect the functioning of the central executive component, which appears to be impaired in patients with dysexecutive syndrome. The present study extends the investigation of an index ("mu"), which is supposed to indicate the capacity of coordination of concurrent auditory digit span and tracking tasks, by testing the influence of training on the performance in the dual task. The presentation of the same digit sequence lists or always-different lists did not differently affect the performance. The span length affected the mu values. The improved performance in the tasks under the dual condition closely resembled the improvement in the single-task performance. So, although training improved performance in the single and dual conditions, especially for the tracking component, the mu values remained stable throughout the sessions when the single tasks were performed first. Conversely, training improved the capacity of dual-task coordination throughout the sessions when dual task was performed first, addressing the issue of the contribution of the within-session practice to the mu index.

Effect of practice and span length on the dual-task coordination executive test

The measure "mu", proposed as an index of the ability to coordinate concurrent box-crossing (BC) and digit-span (DS) tasks in the dual task (DT), should reflect the capacity of the executive component of the working memory system. We investigated the effect of practice in BC and of a change in the digit span on mu by adding previous practice trials in BC and diminishing, maintaining or increasing the digit sequence length. The mu behavior was evaluated throughout three trials of the test. Reported strategies in digit tasks were also analyzed. Subjects with diminished span showed the best performance in DT due to a stable performance in DS and BC in the single- and dual-task conditions. These subjects also showed a more stable performance throughout trials. Subjects with diminished span tended to employ effortless strategies, whereas subjects with increased span employed effort-requiring strategies and showed the lowest means of mu. Subjects with initial practice trials showed the best performance in BC and the most differentiated performance between the single- and dual-task conditions in BC. The correlation coefficient between the mu values obtained in the first and second trials was 0.814 for subjects with diminished span and practice trials in BC. It seems that the within-session practice in BC and the performance variability in DS affect the reliability of the index mu. To control these factors we propose the introduction of previous practice trials in BC and a modification of the current method to determine the digit sequence length. This proposal should contribute to the development of a more reliable method to evaluate the executive capacity of coordination in the dual-task paradigm.

The control of deliberate waiting strategies in a stop-signal task

To inhibit an ongoing flow of thoughts or actions has been largely considered to be a crucial executive function, and the stop-signal paradigm makes inhibitory control measurable. Stop-signal tasks usually combine two concurrent tasks, i.e., manual responses to a primary task (go-task) are occasionally countermanded by a stimulus which signals participants to inhibit their response in that trial (stop-task). Participants are always instructed not to wait for the stop-signal, since waiting strategies cause the response times to be unstable, invalidating the data. The aim of the present study was to experimentally control the strategies of waiting deliberately for the stop-signal in a stop-task by means of an algorithm that measured the variation in the reaction times to go-stimuli on-line, and displayed a warning legend urging participants to be faster when their reaction times were more than two standard deviations of the mean. Thirty-four university students performed a stop-task with go- and stop-stimuli, both of which were delivered in the visual modality and were lateralized within the visual field. The participants were divided into two groups (group A, without the algorithm, vs group B, with the algorithm). Group B exhibited lower variability of reaction times to go-stimuli, whereas no significant between-group differences were found in any of the measures of inhibitory control, showing that the algorithm succeeded in controlling the deliberate waiting strategies. Differences between deliberate and unintentional waiting strategies, and anxiety as a probable factor responsible for individual differences in deliberate waiting behavior, are discussed.

A case study of concurrent engineering application on the development of parts for the white goods industry in Brazil

This classical way to manage product development processes for massive production seems to be changing: high pressure for cost reduction, higher quality standards, markets reaching for innovation lead to the necessity of new tools for development control. Into this, and learning from the automotive and aerospace industries factories from other segments are starting to understand and apply manufacturing and assembly oriented projects to ease the task of generate goods and from this obtain at least a part of the expected results. This paper is intended to demonstrate the applicability of the concepts of Concurrent Engineering and DFM/DFA (Design for Manufacturing and Assembly) in the development of products and parts for the White Goods industry in Brazil (major appliances as refrigerators, cookers and washing machines), showing one case concerning the development and releasing of a component. Finally is demonstrated in a short term how was reached a solution that could provide cost savings and reduction on the time to delivery using those techniques.

The Coin Rotation Task: A Valid Test for Manual Dexterity in Multiple Sclerosis

BACKGROUND: Impaired manual dexterity is frequent and disabling in patients with multiple sclerosis (MS). Therefore, convenient, quick and validated tests for manual dexterity in MS patients are needed. OBJECTIVE: The aim of this study was to validate the Coin Rotation task (CRT) to examine manual dexterity in patients with MS. DESIGN: Cross-sectional study. METHODS: 101 outpatients with MS were assessed with the CRT, the Expanded Disability Status Scale (EDSS), the Scale for the assessment and rating of ataxia (SARA), the Modified Ashworth Scale (MAS), and their muscle strength and sensory deficits of the hands were noted. Concurrent validity and diagnostic accuracy of the CRT were determined by comparison with the Nine Hole Peg Test (9HPT). Construct validity was determined by comparison with a valid dexterity questionnaire. Multiple regression analysis was done to explore correlations of the CRT with the EDSS, SARA, MAS, muscle strength and sensory deficits. RESULTS: The CRT correlated significantly with the 9HPT (r=.73, p<.0001) indicating good concurrent validity. The cut-off values for the CRT relative to the 9HPT were 18.75 seconds for the dominant (sensitivity: 81.5%; specificity 80.0%) and 19.25 seconds for the non-dominant hand (sensitivity: 90.3%; specificity: 81.8%) demonstrating good diagnostic accuracy. Furthermore, the CRT correlated significantly with the dexterity questionnaire (r=-.49, p<.0001) indicating moderate construct validity. Multiple regression analyses revealed that the EDSS was the strongest predictor for impaired dexterity. LIMITATIONS: Mostly relapsing-remitting MS patients with an EDSS up to 7 were examined. CONCLUSIONS: This study validates the CRT as a test that can be used easily and quickly to evaluate manual dexterity in patients with MS.

Blue bananas: development of a task to investigate the representation of synaesthetic experiences

Research has mainly focussed on the perceptual nature of synaesthesia. However, synaesthetic experiences are also semantically represented. It was our aim to develop a task to investigate the semantic representation of the concurrent and its relation to the inducer in grapheme-colour synaesthesia. Non-synaesthetes were either tested with a lexical-decision (i.e., word / non-word) or a semantic-classification (i.e., edibility decision) task. Targets consisted of words which were strongly associated with a specific colour (e.g., banana - yellow) and words which were neutral and not associated with a specific colour (e.g., aunt). Target words were primed with colours: the prime target relationship was either intramodal (i.e., word - word) or crossmodal (colour patch - word). Each of the four task versions consisted of three conditions: congruent (same colour for prime and target), incongruent (different colour), and unrelated (neutral target). For both tasks (i.e., lexical and semantic) and both versions of the task (i.e., intramodal and crossmodal), we expected faster reaction times (RTs) in the congruent condition than in the neutral condition and slower RTs in the incongruent condition than the neutral condition. Stronger effects were expected in the intramodal condition due to the overlap in the prime target modality. The results suggest that the hypotheses were partly confirmed. We conclude that the tasks and hypotheses can be readily adopted to investigate the nature of the representation of the synaesthetic experiences.

Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.

The concept of independence has been recently generalized to the constraint logic programming (CLP) paradigm. Also, several abstract domains specifically designed for CLP languages, and whose information can be used to detect the generalized independence conditions, have been recently defined. As a result we are now in a position where automatic parallelization of CLP programs is feasible. In this paper we study the task of automatically parallelizing CLP programs based on such analyses, by transforming them to explicitly concurrent programs in our parallel CC platform (CIAO) as well as to AKL. We describe the analysis and transformation process, and study its efficiency, accuracy, and effectiveness in program parallelization. The information gathered by the analyzers is evaluated not only in terms of its accuracy, i.e. its ability to determine the actual dependencies among the program variables, but also of its effectiveness, measured in terms of code reduction in the resulting parallelized programs. Given that only a few abstract domains have been already defined for CLP, and that none of them were specifically designed for dependency detection, the aim of the evaluation is not only to asses the effectiveness of the available domains, but also to study what additional information it would be desirable to infer, and what domains would be appropriate for further improving the parallelization process.

CA1-specific N-methyl-d-aspartate receptor knockout mice are deficient in solving a nonspatial transverse patterning task

In both humans and animals, the hippocampus is critical to memory across modalities of information (e.g., spatial and nonspatial memory) and plays a critical role in the organization and flexible expression of memories. Recent studies have advanced our understanding of cellular basis of hippocampal function, showing that N-methyl-d-aspartate (NMDA) receptors in area CA1 are required in both the spatial and nonspatial domains of learning. Here we examined whether CA1 NMDA receptors are specifically required for the acquisition and flexible expression of nonspatial memory. Mice lacking CA1 NMDA receptors were impaired in solving a transverse patterning problem that required the simultaneous acquisition of three overlapping odor discriminations, and their impairment was related to an abnormal strategy by which they failed to adequately sample and compare the critical odor stimuli. By contrast, they performed normally, and used normal stimulus sampling strategies, in the concurrent learning of three nonoverlapping concurrent odor discriminations. These results suggest that CA1 NMDA receptors play a crucial role in the encoding and flexible expression of stimulus relations in nonspatial memory.

Reasoning about deadlines in concurrent real-time programs

We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machine-dependent task. The latter takes into account the execution times of the program on a particular machine. Therefore, our goal is to make the machine-dependent phase of the analysis as simple as possible. We succeed in the sense that the machine-dependent phase remains the same as in the analysis of sequential programs. We shift the complexity introduced by concurrency completely to the machine-independent phase.

Adding concurrent data transfer to transport layer

In recent years, the internet has grown exponentially, and become more complex. This increased complexity potentially introduces more network-level instability. But for any end-to-end internet connection, maintaining the connection's throughput and reliability at a certain level is very important. This is because it can directly affect the connection's normal operation. Therefore, a challenging research task is to improve a network's connection performance by optimizing its throughput and reliability. This dissertation proposed an efficient and reliable transport layer protocol (called concurrent TCP (cTCP)), an extension of the current TCP protocol, to optimize end-to-end connection throughput and enhance end-to-end connection fault tolerance. The proposed cTCP protocol could aggregate multiple paths' bandwidth by supporting concurrent data transfer (CDT) on a single connection. Here concurrent data transfer was defined as the concurrent transfer of data from local hosts to foreign hosts via two or more end-to-end paths. An RTT-Based CDT mechanism, which was based on a path's RTT (Round Trip Time) to optimize CDT performance, was developed for the proposed cTCP protocol. This mechanism primarily included an RTT-Based load distribution and path management scheme, which was used to optimize connections' throughput and reliability. A congestion control and retransmission policy based on RTT was also provided. According to experiment results, under different network conditions, our RTT-Based CDT mechanism could acquire good CDT performance. Finally a CWND-Based CDT mechanism, which was based on a path's CWND (Congestion Window), to optimize CDT performance was introduced. This mechanism primarily included: a CWND-Based load allocation scheme, which assigned corresponding data to paths based on their CWND to achieve aggregate bandwidth; a CWND-Based path management, which was used to optimize connections' fault tolerance; and a congestion control and retransmission management policy, which was similar to regular TCP in its separate path handling. According to corresponding experiment results, this mechanism could acquire near-optimal CDT performance under different network conditions.