The diffusion decision model: theory and data for two-choice decision tasks

The diffusion decision model allows detailed explanations of behavior in two-choice discrimination tasks. In this article, the model is reviewed to show how it translates behavioral data-accuracy, mean response times, and response time distributions-into components of cognitive processing. Three experiments are used to illustrate experimental manipulations of three components: stimulus difficulty affects the quality of information on which a decision is based; instructions emphasizing either speed or accuracy affect the criterial amounts of information that a subject requires before initiating a response; and the relative proportions of the two stimuli affect biases in drift rate and starting point. The experiments also illustrate the strong constraints that ensure the model is empirically testable and potentially falsifiable. The broad range of applications of the model is also reviewed, including research in the domains of aging and neurophysiology.     

Learning traversability models for autonomous mobile vehicles

Autonomous mobile robots need to adapt their behavior to the terrain over which they drive, and to predict the traversability of the terrain so that they can effectively plan their paths. Such robots usually make use of a set of sensors to investigate the terrain around them and build up an internal representation that enables them to navigate. This paper addresses the question of how to use sensor data to learn properties of the environment and use this knowledge to predict which regions of the environment are traversable. The approach makes use of sensed information from range sensors (stereo or ladar), color cameras, and the vehicle’s navigation sensors. Models of terrain regions are learned from subsets of pixels that are selected by projection into a local occupancy grid. The models include color and texture as well as traversability information obtained from an analysis of the range data associated with the pixels. The models are learned without supervision, deriving their properties from the geometry and the appearance of the scene. The models are used to classify color images and assign traversability costs to regions. The classification does not use the range or position information, but only color images. Traversability determined during the model-building phase is stored in the models. This enables classification of regions beyond the range of stereo or ladar using the information in the color images. The paper describes how the models are constructed and maintained, how they are used to classify image regions, and how the system adapts to changing environments. Examples are shown from the implementation of this algorithm in the DARPA Learning Applied to Ground Robots (LAGR) program, and an evaluation of the algorithm against human-provided ground truth is presented.

A formal framework for scenario development in support of environmental decision-making

Scenarios are possible future states of the world that represent alternative plausible conditions under different assumptions. Often, scenarios are developed in a context relevant to stakeholders involved in their applications since the evaluation of scenario outcomes and implications can enhance decision-making activities. This paper reviews the state-of-the-art of scenario development and proposes a formal approach to scenario development in environmental decision-making. The discussion of current issues in scenario studies includes advantages and obstacles in utilizing a formal scenario development framework, and the different forms of uncertainty inherent in scenario development, as well as how they should be treated. An appendix for common scenario terminology has been attached for clarity. Major recommendations for future research in this area include proper consideration of uncertainty in scenario studies in particular in relation to stakeholder relevant information, construction of scenarios that are more diverse in nature, and sharing of information and resources among the scenario development research community.     

Improving the Behavior of Intelligent Tutoring Agents with Data Mining

This article presents a novel framework for adapting the behavior of intelligent agents. The framework consists of an extended sequential pattern mining algorithm that, in combination with association rule discovery techniques, is used to extract temporal patterns and relationships from the behavior of human agents executing a procedural task. The proposed framework has been integrated within the CanadarmTutor, an intelligent tutoring agent aimed at helping students solve procedural problems that involve moving a robotic arm in a complex virtual environment. We present the results of an evaluation that demonstrates the benefits of this integration to agents acting in ill-defined domains.     

A mathematical model for estimation of sulphide capacities of multi-component slags

The present work presents mathematical model for the estimation of sulphide capacities. The sulphide capacity, C_S is expressed as (1) where ΔG⁰ is the standard Gibbs energy change for the reaction, (2) ξ, being a function of both temperature and composition, is characterized by the system under consideration. By optimizing ξ, the sulphide capacities could be estimated as functions of temperature and composition. The slag composition is described using a modified Temkin approach, where complex polymeric ions are considered as dissociated to simple species. The model has been applied to the binary systems CaO-SiO₂, MnO-SiO₂ as well as the CaO-MnO-SiO₂ ternary system. The results show that reliable predictions of the sulphide capacities can be obtained using the present model.     

Hierarchical classification of data streams: a systematic literature review

The classification task usually works with flat and batch learners, assuming problems as stationary and without relations between class labels. Nevertheless, several real-world problems do not assume these premises, i.e., data have labels organized hierarchically and are made available in streaming fashion, meaning that their behavior can drift over time. Existing studies on hierarchical classification do not consider data streams as input of their process, and thus, data is assumed as stationary and handled through batch learners. The same can be said about works on streaming data, as the hierarchical classification is overlooked. Studies concerning each area individually are promising, yet, do not tackle their intersection. This study analyzes the main characteristics of the state-of-the-art works on hierarchical classification for streaming data concerning five aspects: (i) problems tackled, (ii) datasets, (iii) algorithms, (iv) evaluation metrics, and (v) research gaps in the area. We performed a systematic literature review of primary studies and retrieved 3,722 papers, of which 42 were identified as relevant and used to answer the aforementioned research questions. We found that the problems handled by hierarchical classification of data streams include mainly classification of images, human activities, texts, and audio; the datasets are mostly created or synthetic data; the algorithms and evaluation metrics are well-known techniques or based on those; and research gaps are related to dynamic context, data complexity, and computational resources constraints. We also provide implications for future research and experiments to consider common characteristics shared amongst hierarchical classification and data stream classification.

     

A SIMD-efficient 14 instruction shader program for high-throughput microtriangle rasterization

This paper shows that breaking the barrier of 1 triangle/clock rasterization rate for microtriangles in modern GPU architectures in an efficient way is possible. The fixed throughput of the special purpose culling and triangle setup stages of the classic pipeline limits the GPU scalability to rasterize many triangles in parallel when these cover very few pixels. In contrast, the shader core counts and increasing GFLOPs in modern GPUs clearly suggests parallelizing this computation entirely across multiple shader threads, making use of the powerful wide-ALU instructions. In this paper, we present a very efficient SIMD-like rasterization code targeted at very small triangles that scales very well with the number of shader cores and has higher performance than traditional edge equation based algorithms. We have extended the ATTILA GPU shader ISA (del Barrioet al. in IEEE International Symposium on Performance Analysis of Systems and Software, pp. 231–241, 2006) with two fixed point instructions to meet the rasterization precision requirement. This paper also introduces a novel subpixel Bounding Box size optimization that adjusts the bounds much more finely, which is critical for small triangles, and doubles the 2×2-pixel stamp test efficiency. The proposed shader rasterization program can run on top of the original pixel shader program in such a way that selected fragments are rasterized, attribute interpolated and pixel shaded in the same pass. Our results show that our technique yields better performance than a classic rasterizer at 8 or more shader cores, with speedups as high as 4× for 16 shader cores.     

Transient model of induction machine using rotating magnetic field approach

Most simulation models of electric machines use the coupled circuit approach, where the machine is considered as an electric circuit element with time-varying inductances (abc model) or with constant inductances (dq0 model). On the other hand, the rotating magnetic field approach, which considers the electric machine as two groups of windings producing rotating magnetic fields and can give insight into internal phenomena of the machines, has not yet received much attention in electric machines modeling, especially for machine transient analysis. Based on the rotating magnetic field approach, this paper presents a transient model of the induction machine including main flux saturation effect. Based on the direct computation of the magnetizing fluxes of all machine windings, the model represents instantaneous main flux saturation by simply introducing a main flux saturation factor. No iteration process is involved to incorporate the saturation effects. The model combines the advantages of the dq0 and abc models advantages, such as rapid computation time and nonsymmetrical conditions simulation, respectively. The simulation results and the experimental tests show advantages and verification of the model.     

Inductive transfer for learning Bayesian networks

In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with different conditions; or in industrial diagnosis, where there is equipment with similar specifications. In these cases it is common to have plenty of data for some scenarios but very little for others. In order to learn accurate models for rare cases, it is desirable to use data and knowledge from similar cases; a technique known as transfer learning. In this paper we propose an inductive transfer learning method for Bayesian networks, that considers both structure and parameter learning. For structure learning we use conditional independence tests, by combining measures from the target task with those obtained from one or more auxiliary tasks, using a novel weighted sum of the conditional independence measures. For parameter learning, we propose two variants of the linear pool for probability aggregation, combining the probability estimates from the target task with those from the auxiliary tasks. To validate our approach, we used three Bayesian networks models that are commonly used for evaluating learning techniques, and generated variants of each model by changing the structure as well as the parameters. We then learned one of the variants with a small dataset and combined it with information from the other variants. The experimental results show a significant improvement in terms of structure and parameters when we transfer knowledge from similar tasks. We also evaluated the method with real-world data from a manufacturing process considering several products, obtaining an improvement in terms of log-likelihood between the data and the model when we do transfer learning from related products.     

Influence of Matrices on Oxygen Sensing of Three Sensing Films with Chemically Conjugated Platinum Porphyrin Probes and Preliminary Application for Monitoring of Oxygen Consumption of Escherichia coli (E. coli)

Oxygen sensing films were synthesized by a chemical conjugation of functional platinum porphyrin probes in silica gel, polystyrene (PS), and poly(2-hydroxyethyl methacrylate) (PHEMA) matrices. Responses of the sensing films to gaseous oxygen and dissolved oxygen were studied and the influence of the matrices on the sensing behaviors was investigated. Silica gel films had the highest fluorescence intensity ratio from deoxygenated to oxygenated environments and the fastest response time to oxygen. PHEMA films had no response to gaseous oxygen, but had greater sensitivity and a faster response time for dissolved oxygen than those of PS films. The influence of matrices on oxygen response, sensitivity and response time was discussed. The influence is most likely attributed to the oxygen diffusion abilities of the matrices. Since the probes were chemically immobilized in the matrices, no leaching of the probes was observed from the sensing films when applied in aqueous environment. One sensing film made from the PHEMA matrix was used to preliminarily monitor the oxygen consumption of Escherichia coli (E. coli) bacteria. E. coli cell density and antibiotics ampicillin concentration dependent oxygen consumption was observed, indicating the potential application of the oxygen sensing film for biological application.