The influence of memory for prior instances on performance in a conflict detection task

In 3 experiments, the authors examined the role of memory for prior instances for making relative judgments in conflict detection. Participants saw pairs of aircraft either repeatedly conflict with each other or pass safely before being tested on new aircraft pairs, which varied in similarity to the training pairs. Performance was influenced by the similarity between aircraft pairs. Detection time was faster when a conflict pair resembled a pair that had repeatedly conflicted. Detection time was slower, and participants missed conflicts, when a conflict pair resembled a pair that had repeatedly passed safely. The findings identify aircraft features that are used as inputs into the memory decision process and provide an indication of the processes involved in the use of memory for prior instances to make relative judgments.

An analysis of relational complexity in an air traffic control conflict detection task

Theoretical analyses of air traffic complexity were carried out using the Method for the Analysis of Relational Complexity. Twenty-two air traffic controllers examined static air traffic displays and were required to detect and resolve conflicts. Objective measures of performance included conflict detection time and accuracy. Subjective perceptions of mental workload were assessed by a complexity-sorting task and subjective ratings of the difficulty of different aspects of the task. A metric quantifying the complexity of pair-wise relations among aircraft was able to account for a substantial portion of the variance in the perceived complexity and difficulty of conflict detection problems, as well as reaction time. Other variables that influenced performance included the mean minimum separation between aircraft pairs and the amount of time that aircraft spent in conflict.

Reactive Recruitment of Attentional Control in Math Anxiety: An ERP Study of Numeric Conflict Monitoring and Adaptation

This study uses event-related brain potentials (ERPs) to investigate the electrophysiological correlates of numeric conflict monitoring in math-anxious individuals, by analyzing whether math anxiety is related to abnormal processing in early conflict detection (as shown by the N450 component) and/or in a later, response-related stage of processing (as shown by the conflict sustained potential; Conflict-SP). Conflict adaptation effects were also studied by analyzing the effect of the previous trial"s congruence in current interference. To this end, 17 low math-anxious (LMA)and 17 high math-anxious (HMA) individuals were presented with a numerical Stroop task. Groups were extreme in math anxiety but did not differ in trait or state anxiety or in simple math ability. The interference effect of the current trial (incongruent-congruent) and the interference effect preceded by congruence and by incongruity were analyzed both for behavioral measures and for ERPs. A greater interference effect was found for response times in the HMA group than in the LMA one. Regarding ERPs, the LMA group showed a greater N450 component for the interference effect preceded by congruence than when preceded by incongruity, while the HMA group showed greater Conflict-SP amplitude for the interference effect preceded by congruence than when preceded by incongruity. Our study showed that the electrophysiological correlates of numeric interference in HMA individuals comprise the absence of a conflict adaptation effect in the first stage of conflict processing (N450) and an abnormal subsequent up-regulation of cognitive control in order to overcome the conflict (Conflict-SP). More concretely, our study shows that math anxiety is related to a reactive and compensatory recruitment of control resources that is implemented only when previously exposed to a stimuli presenting conflicting information

Methods for conflict resolution in policy-based management systems

While developments in distributed object computing environments, such as the Common Object Request Broker Architecture (CORBA) [17] and the Telecommunication Intelligent Network Architecture (TINA) [16], have enabled interoperability between domains in large open distributed systems, managing the resources within such systems has become an increasingly complex task. This challenge has been considered for several years within the distributed systems management research community and policy-based management has recently emerged as a promising solution. Large evolving enterprises present a significant challenge for policy-based management partly due to the requirement to support both mutual transparency and individual autonomy between domains [2], but also because the fluidity and complexity of interactions occurring within such environments requires an ability to cope with the coexistence of multiple, potentially inconsistent policies. This paper discusses the need of providing both dynamic (run-time) and static (compile-time) conflict detection and resolution for policies in such systems and builds on our earlier conflict detection work [7, 8] to introduce the methods for conflict resolution in large open distributed systems.

Credit assignment: The memory representation of dynamic task events

The experiment examined the influence of memory for prior instances on aircraft conflict detection. Participants saw pairs of similar aircraft repeatedly conflict with each other. Performance improvements suggest that participants credited the conflict status of familiar aircraft pairs to repeated static features such as speed, and dynamic features such as aircraft relative position. Participants missed conflicts when a conflict pair resembled a pair that had repeatedly passed safely. Participants either did not attend to, or interpret, the bearing of aircraft correctly as a result of false memory-based expectations. Implications for instance models and situational awareness in dynamic systems are discussed.

The Impact of Catechol-O-Methyltransferase and Dopamine D4 Receptor Genotypes on Neurophysiological Markers of Performance Monitoring

Dynamic adaptations of one"s behavior by means of performance monitoring are a central function of the human executive system, that underlies considerable interindividual variation. Converging evidence from electrophysiological and neuroimaging studies in both animals and humans hints atthe importance ofthe dopaminergic system forthe regulation of performance monitoring. Here, we studied the impact of two polymorphisms affecting dopaminergic functioning in the prefrontal cortex [catechol-O-methyltransferase (COMT) Val108/158Met and dopamine D4 receptor (DRD4) single-nucleotide polymorphism (SNP)-521] on neurophysiological correlates of performance monitoring. We applied a modified version of a standard flanker task with an embedded stop-signal task to tap into the different functions involved, particularly error monitoring, conflict detection and inhibitory processes. Participants homozygous for the DRD4 T allele produced an increased error-related negativity after both choice errors and failed inhibitions compared with C-homozygotes. This was associated with pronounced compensatory behavior reflected in higher post-error slowing. No group differences were seen in the incompatibility N2, suggesting distinct effects of the DRD4 polymorphism on error monitoring processes. Additionally, participants homozygous for the COMTVal allele, with a thereby diminished prefrontal dopaminergic level, revealed increased prefrontal processing related to inhibitory functions, reflected in the enhanced stop-signal-related components N2 and P3a. The results extend previous findings from mainly behavioral and neuroimaging data on the relationship between dopaminergic genes and executive functions and present possible underlying mechanisms for the previously suggested association between these dopaminergic polymorphisms and psychiatric disorders as schizophrenia or attention deficit hyperactivity disorder.

Hybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments

This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, high-performance embedded computing recently witnessed the shift from single CPU platforms with application-specific accelerators to programmable Multi Processor Systems-on-Chip (MPSoCs). Those allow higher flexibility, real time performance and low energy consumption, but the programmer must be able to effectively exploit the platform parallelism. This raises interest in the development of algorithmic techniques to be embedded in CAD tools; in particular, given a specific application and platform, the objective if to perform optimal allocation of hardware resources and to compute an execution schedule. On this regard, since embedded systems tend to run the same set of applications for their entire lifetime, off-line, exact optimization approaches are particularly appealing. Quite surprisingly, the use of exact algorithms has not been well investigated so far; this is in part motivated by the complexity of integrated allocation and scheduling, setting tough challenges for ``pure'' combinatorial methods. The use of hybrid CP/OR approaches presents the opportunity to exploit mutual advantages of different methods, while compensating for their weaknesses. In this work, we consider in first instance an Allocation and Scheduling problem over the Cell BE processor by Sony, IBM and Toshiba; we propose three different solution methods, leveraging decomposition, cut generation and heuristic guided search. Next, we face Allocation and Scheduling of so-called Conditional Task Graphs, explicitly accounting for branches with outcome not known at design time; we extend the CP scheduling framework to effectively deal with the introduced stochastic elements. Finally, we address Allocation and Scheduling with uncertain, bounded execution times, via conflict based tree search; we introduce a simple and flexible time model to take into account duration variability and provide an efficient conflict detection method. The proposed approaches achieve good results on practical size problem, thus demonstrating the use of exact approaches for system design is feasible. Furthermore, the developed techniques bring significant contributions to combinatorial optimization methods.

Simulation of air traffic controllers' behaviour using the operator choice model

The Operator Choice Model (OCM) was developed to model the behaviour of operators attending to complex tasks involving interdependent concurrent activities, such as in Air Traffic Control (ATC). The purpose of the OCM is to provide a flexible framework for modelling and simulation that can be used for quantitative analyses in human reliability assessment, comparison between human computer interaction (HCI) designs, and analysis of operator workload. The OCM virtual operator is essentially a cycle of four processes: Scan Classify Decide Action Perform Action. Once a cycle is complete, the operator will return to the Scan process. It is also possible to truncate a cycle and return to Scan after each of the processes. These processes are described using Continuous Time Probabilistic Automata (CTPA). The details of the probability and timing models are specific to the domain of application, and need to be specified using domain experts. We are building an application of the OCM for use in ATC. In order to develop a realistic model we are calibrating the probability and timing models that comprise each process using experimental data from a series of experiments conducted with student subjects. These experiments have identified the factors that influence perception and decision making in simplified conflict detection and resolution tasks. This paper presents an application of the OCM approach to a simple ATC conflict detection experiment. The aim is to calibrate the OCM so that its behaviour resembles that of the experimental subjects when it is challenged with the same task. Its behaviour should also interpolate when challenged with scenarios similar to those used to calibrate it. The approach illustrated here uses logistic regression to model the classifications made by the subjects. This model is fitted to the calibration data, and provides an extrapolation to classifications in scenarios outside of the calibration data. A simple strategy is used to calibrate the timing component of the model, and the results for reaction times are compared between the OCM and the student subjects. While this approach to timing does not capture the full complexity of the reaction time distribution seen in the data from the student subjects, the mean and the tail of the distributions are similar.

Managing the airspace: A task analysis of Australian air traffic control

The aim of this study was to examine the way Australian air traffic controllers manage their airspace. Fourteen controllers ranging from 7 to 30 years experience were sampled from the Brisbane air traffic control centre. All had previously been endorsed for en route radar sectors. Five static pictures varying in workload level (low, medium and high) were presented to participants. Controllers were asked to work through the scenarios and describe aloud how they would resolve any potential conflicts between the aircraft. Following this controllers were asked a set of probe questions based on the critical decision method, to extract further information about the way they manage their airspace. A content analysis was used to assess patterns in the way controllers scan, strategies used in conflict detection and conflict resolution and the effect of workload on strategy choice. Findings revealed that controllers use specific strategies (such as working in a left to right scan or prioritising levels) when managing their airspace. Further analyses are still planned however a model based on the processes controllers used to resolve conflicts has been developed and will be presented as a summary of the results.

Formal methods for the development and verification of autonomic IT systems

This chapter explores ways in which rigorous mathematical techniques, termed formal methods, can be employed to improve the predictability and dependability of autonomic computing. Model checking, formal specification, and quantitative verification are presented in the contexts of conflict detection in autonomic computing policies, and of implementation of goal and utility-function policies in autonomic IT systems, respectively. Each of these techniques is illustrated using a detailed case study, and analysed to establish its merits and limitations. The analysis is then used as a basis for discussing the challenges and opportunities of this endeavour to transition the development of autonomic IT systems from the current practice of using ad-hoc methods and heuristic towards a more principled approach. © 2012, IGI Global.

Algorithms for efficient transaction management and consistent queries in client -server semantic object-oriented parallel databases

Large read-only or read-write transactions with a large read set and a small write set constitute an important class of transactions used in such applications as data mining, data warehousing, statistical applications, and report generators. Such transactions are best supported with optimistic concurrency, because locking of large amounts of data for extended periods of time is not an acceptable solution. The abort rate in regular optimistic concurrency algorithms increases exponentially with the size of the transaction. The algorithm proposed in this dissertation solves this problem by using a new transaction scheduling technique that allows a large transaction to commit safely with significantly greater probability that can exceed several orders of magnitude versus regular optimistic concurrency algorithms. A performance simulation study and a formal proof of serializability and external consistency of the proposed algorithm are also presented.^ This dissertation also proposes a new query optimization technique (lazy queries). Lazy Queries is an adaptive query execution scheme which optimizes itself as the query runs. Lazy queries can be used to find an intersection of sub-queries in a very efficient way, which does not require full execution of large sub-queries nor does it require any statistical knowledge about the data.^ An efficient optimistic concurrency control algorithm used in a massively parallel B-tree with variable-length keys is introduced. B-trees with variable-length keys can be effectively used in a variety of database types. In particular, we show how such a B-tree was used in our implementation of a semantic object-oriented DBMS. The concurrency control algorithm uses semantically safe optimistic virtual "locks" that achieve very fine granularity in conflict detection. This algorithm ensures serializability and external consistency by using logical clocks and backward validation of transactional queries. A formal proof of correctness of the proposed algorithm is also presented. ^

Improvements in Hardware Transactional Memory for GPU Architectures

In the multi-core CPU world, transactional memory (TM)has emerged as an alternative to lock-based programming for thread synchronization. Recent research proposes the use of TM in GPU architectures, where a high number of computing threads, organized in SIMT fashion, requires an effective synchronization method. In contrast to CPUs, GPUs offer two memory spaces: global memory and local memory. The local memory space serves as a shared scratch-pad for a subset of the computing threads, and it is used by programmers to speed-up their applications thanks to its low latency. Prior work from the authors proposed a lightweight hardware TM (HTM) support based in the local memory, modifying the SIMT execution model and adding a conflict detection mechanism. An efficient implementation of these features is key in order to provide an effective synchronization mechanism at the local memory level. After a quick description of the main features of our HTM design for GPU local memory, in this work we gather together a number of proposals designed with the aim of improving those mechanisms with high impact on performance. Firstly, the SIMT execution model is modified to increase the parallelism of the application when transactions must be serialized in order to make forward progress. Secondly, the conflict detection mechanism is optimized depending on application characteristics, such us the read/write sets, the probability of conflict between transactions and the existence of read-only transactions. As these features can be present in hardware simultaneously, it is a task of the compiler and runtime to determine which ones are more important for a given application. This work includes a discussion on the analysis to be done in order to choose the best configuration solution.

Analytic and heuristic processes in the detection and resolution of conflict

Previous research with the ratio-bias task found larger response latencies for conflict trials where the heuristic- and analytic-based responses are assumed to be in opposition (e.g., choosing between 1/10 and 9/100 ratios of success) when compared to no-conflict trials where both processes converge on the same response (e.g., choosing between 1/10 and 11/100). This pattern is consistent with parallel dualprocess models, which assume that there is effective, rather than lax, monitoring of the output of heuristic processing. It is, however, unclear why conflict resolution sometimes fails. Ratio-biased choices may increase because of a decline in analytical reasoning (leaving heuristic-based responses unopposed) or to a rise in heuristic processing (making it more difficult for analytic processes to override the heuristic preferences). Using the process-dissociation procedure, we found that instructions to respond logically and response speed affected analytic (controlled) processing (C), leaving heuristic processing (H) unchanged, whereas the intuitive preference for large nominators (as assessed by responses to equal ratio trials) affected H but not C. These findings create new challenges to the debate between dual-process and singleprocess accounts, which are discussed.