Presence Of Tasks Research Articles

Task-guided attention increases non-linearity of steady-state visually evoked potentials

Objective.Attention is a multifaceted cognitive process, with nonlinear dynamics playing a crucial role. We investigated the involvement of nonlinear processes in top-down visual attention.Approach.The research paradigm employed a contrast-modulated sequence of letters and numerals, encircled by a consistently flickering white square on a black background-a setup that generated steady-state visually evoked potentials. Nonlinear processes are recognized for eliciting and modulating the harmonics of constant frequencies. Using the rhythmic entrainment source separation technique, we examined the fundamental and harmonic frequencies of each stimulus to evaluate the underlying nonlinear dynamics during stimulus processing.Main results.In line with prior research, our findings indicate that the power spectrum density of electroencephalogram responses is influenced by both task presence and stimulus contrast. We discovered that actively searching for a target within a letter stream heightened the amplitude of the fundamental frequency and harmonics related to the background flickering stimulus. While the fundamental frequency amplitude remained unaffected by the stimulus contrast, a lower contrast led to an increase in the second harmonic's amplitude. We assessed the relationship between the contrast response function and the nonlinear-based harmonic responses.Significance.Our findings contribute to a more nuanced understanding of the nonlinear processes impacting top-down visual attention.

Interactive methods of teaching mathematics, contributing to the formation of competencies in students of the field of training Agronomy format

The article outlines aspects of the formation of general professional competencies (GPC-1) through the study of mathematical disciplines; reveals the features of the methodology for the application of tasks (tasks of profile content, task case, task-situation), which are the main means of assessing the formation of the corresponding indicators of achievement of competence: ID-1, ID-2, ID-3, etc. The work analyzed educational publications in mathematical disciplines for the presence of tasks for an objective assessment of the level of formation of general professional competence (GPC-1), the problem of developing the content of criteria and assessment tools for formation of general professional competencies. The authors provide examples of tasks in the disciplines of Higher Mathematics and Mathematics and Mathematical Statistics, designed to form skills in identifying and defining a problem, choosing research methods, analyzing, interpreting the result and transferring fundamental knowledge into the language of professional activity.

Optimization of a heterogeneous computing system architecture based on its coordination with a sensors group of a mobile unmanned platform

This article analyses the existing variety of sensors used in robotics and related fields and also proposes the architecture of a heterogeneous computing system designed to analyze data obtained from sensors of a mobile unmanned platform (MUP). A feature of unmanned platforms is the presence of tasks that require a significantly different level of performance of the on-board computing system for processing data from sensors of the corresponding type. Therefore, the adaptation of existing universal computing systems seems to be impractical, compared to the development of a specialized computing system with a heterogeneous architecture. The computing system is designed to solve problems of local navigation, stabilize the position of the MUP and control its movement, as well as control special equipment installed on the MUP. Often, if the goal is to ensure maximum efficiency, expressed in speed, accuracy and reliability, it is necessary to develop specialized devices. The article provides information on sensors of the main types used in robotics and indicates the requirements for the performance of a computing system necessary for processing data from sensors of this type. This, in turn, made it possible to propose a heterogeneous architecture containing processor subsystems focused on processing data from sensors requiring low, medium and high performance according to the considered classification.

TECHNOLOGY OF DIFFERENTIATED TEACHING TEXT PROGRAMMING IN PRIMARY SCHOOL ON THE BASIS OF SITE DL.GSU.BY

The article describes the technology of learning text programming in primary school based on the site DL.GSU.BY. The key features of the technology are the following: zero entry threshold; text programming propaedeutics; developing, interesting, differentiated, task-oriented learning; minimalist approach to the theory; conducting regional programming Olympiads for pupils of grades I–IV; preparing primary school students for participation in Olympiads for students of V—VIII grades; presence of tasks on school, Olympiad and informatics mathematics; contests which motivate to permanent classes; many years of practical experience; practice-proven learning scalability; effectiveness; low requirements for professional qualifications of the teacher; availability of an accelerated course of studying; support the transition to learning C++.

Optimistic perspectives in communicating difficult news on fetal development

Communicating diagnostic news in health contexts is a potentially difficult event for all parties involved. However, despite this task's presence in the physician-patient context, it is rarely addressed during clinical training. The current study thus aimed to describe and evaluate how difficult news can be toned down during genetic counseling sessions involving cases of fetal syndromes and/or malformations. The study analyzed 33 naturalistic interactions (i.e. real situations), taped and transcribed, according to the theoretical and methodological perspective of Conversation Analysis, with an ethnomethodological basis. These interactions consisted of sessions in clinical genetics with pregnant women seen at the fetal medicine service of a reference hospital for maternal and child health in the Brazilian Unified National Health System (SUS). The analysis showed that communicating difficult news can be accompanied by optimistic perspectives that are scaled-up according to each situation's severity. In the absence of a positive diagnosis, the appointments can conclude with positive aspects such as recommendations for palliative care, so that the patient always leaves the appointment with some kind of recommendation. This study proposes to innovate and expand the scope of studies on communicating difficult news in the physician-patient relationship in Brazil, precisely by developing an analysis of real interactions in genetic counseling and thus providing interactional backing for training health professionals that deal with this challenge in their routine work.

Task difficulty moderates the revelation effect.

Tasks that precede a recognition probe induce a more liberal response criterion than do probes without tasks-the "revelation effect." For example, participants are more likely to claim that a stimulus is familiar directly after solving an anagram, relative to a condition without an anagram. Revelation effect hypotheses disagree whether hard preceding tasks should produce a larger revelation effect than easy preceding tasks. Although some studies have shown that hard tasks increase the revelation effect as compared to easy tasks, these studies suffered from a confound of task difficulty and task presence. Conversely, other studies have shown that the revelation effect is independent of task difficulty. In the present study, we used new task difficulty manipulations to test whether hard tasks produce larger revelation effects than easy tasks. Participants (N = 464) completed hard or easy preceding tasks, including anagrams (Exps. 1 and 2) and the typing of specific arrow key sequences (Exps. 3-6). With sample sizes typical of revelation effect experiments, the effect sizes of task difficulty on the revelation effect varied considerably across experiments. Despite this variability, a consistent data pattern emerged: Hard tasks produced larger revelation effects than easy tasks. Although the present study falsifies certain revelation effect hypotheses, the general vagueness of revelation effect hypotheses remains.

Optimal distributed task scheduling in volunteer clouds

The ever increasing request of computational resources has shifted the computing paradigm towards solutions where less computation is performed locally. The most widely adopted approach nowadays is represented by cloud computing. With the cloud, users can transparently access to virtually infinite resources with the same aptitude of using any other utility. Next to the cloud, the volunteer computing paradigm has gained attention in the last decade, where the spared resources on each personal machine are shared thanks to the users’ willingness to cooperate. Cloud and volunteer paradigms have been recently seen as companion technologies to better exploit the use of local resources. Conversely, this scenario places complex challenges in managing such a large-scale environment, as the resources available on each node and the presence of the nodes online are not known a-priori. The complexity further increases in presence of tasks that have an associated Service Level Agreement specified, e.g., through a deadline. Distributed management solutions have then be advocated as the only approaches that are realistically applicable.In this paper, we propose a framework to allocate tasks according to different policies, defined by suitable optimization problems. Then, we provide a distributed optimization approach relying on the Alternating Direction Method of Multipliers (ADMM) for one of these policies, and we compare it with a centralized approach. Results show that, when a centralized approach can not be adopted in a real environment, it could be possible to rely on the good suboptimal solutions found by the ADMM.

Estimation of the Distribution Algorithm With a Stochastic Local Search for Uncertain Capacitated Arc Routing Problems

The uncertain capacitated arc routing problem is a challenging problem in which the demands of tasks, the costs of edges, and the presence of tasks and edges are uncertain. The objective of this problem is to find a robust optimal solution for a finite set of possible scenarios. In this paper, we propose a novel robust optimization approach, called an estimation of distribution algorithm (EDA) with stochastic local search (SLS), to tackle this problem. The proposed method integrates an EDA with a novel two phase SLS procedure to minimize the maximal total cost over a set of different scenarios. The SLS procedure avoids excessive fitness evaluations of unpromising moves in local search. Our experimental results on two sets of benchmark problems (a total of 55 problem instances) showed that the proposed approach outperformed existing state-of-the-art algorithms.

Reorienting attention and inhibition of return

In experiments examining inhibition of return (IOR), it is common practice to present a second cue at fixation during the cue-target interval. The purpose of this fixation cue is to reorient attention away from the cued location to ensure that the facilitative effects of spatial attention do not obscure IOR. However, despite their frequent use, relatively little is known about the relationship between fixation cues and IOR. In the present experiments, we examined the role of fixation cues by manipulating their presence in tasks that either did or did not require target identification. When the participants were required to either detect (Experiment 1A) or localize (Experiment 2A) a target, the magnitude of IOR was unaffected by the presence of a fixation cue. In contrast, when the participants were required to identify a target (Experiments 1B, 2B, and 3), IOR was observed only when a fixation cue was presented. This result was obtained regardless of the type of response that was required (two-alternative forced choice or go/no go). The effectiveness of the fixation cue in revealing IOR in these tasks is consistent with its putative role in reorienting attention away from the cued location.

Advanced eager scheduling for Java‐based adaptive parallel computing

AbstractJavelin 3 is a software system for developing large‐scale, fault‐tolerant, adaptively parallel applications. When all or part of their application can be cast as a master–worker or branch‐and‐bound computation, Javelin 3 frees application developers from concerns about inter‐processor communication and fault tolerance among networked hosts, allowing them to focus on the underlying application. The paper describes a fault‐tolerant task scheduler and its performance analysis. The task scheduler integrates work stealing with an advanced form of eager scheduling. It enables dynamic task decomposition, which improves host load‐balancing in the presence of tasks whose non‐uniform computational load is evident only at execution time. Speedup measurements are presented of actual performance on up to 1000 hosts. We analyze the expected performance degradation due to unresponsive hosts, and measure actual performance degradation due to unresponsive hosts. Copyright © 2005 John Wiley & Sons, Ltd.