Task (computing)

About: Task (computing) is a research topic. Over the lifetime, 9718 publications have been published within this topic receiving 129364 citations.

A Co-Interactive Transformer for Joint Slot Filling and Intent Detection

Abstract: Intent detection and slot filling are two main tasks for building a spoken language understanding (SLU) system. The two tasks are closely related and the information of one task can benefit the other. Previous studies either implicitly model the two tasks with multi-task framework or only explicitly consider the single information flow from intent to slot. None of the prior approaches model the bidirectional connection between the two tasks simultaneously in a unified framework. In this paper, we propose a Co-Interactive Transformer which considers the cross-impact between the two tasks. Instead of adopting the self-attention mechanism in vanilla Transformer, we propose a co-interactive module to consider the cross-impact by building a bidirectional connection between the two related tasks, where slot and intent can be able to attend on the corresponding mutual information. The experimental results on two public datasets show that our model achieves the state-of-the-art performance.

Semi-automatic process partitioning for parallel computation

Abstract: Automatic process partitioning is the operation of automatically rewriting an algorithm as a collection of tasks, each operating primarily on its own portion of the data, to carry out the computation in parallel. Hybrid shared memory systems provide a hierarchy of globally accessible memories. To achieve high performance on such machines one must carefully distribute the work and the data so as to keep the workload balanced while optimizing the access to nonlocal data. In this paper we consider a semi-automatic approach to process partitioning in which the compiler, guided by advice from the user, automatically transforms programs into such an interacting set of tasks. This approach is illustrated with a picture processing example written in BLAZE, which is transformed by the compiler into a task system maximizing locality of memory reference.

Automatic error recovery in robot assembly operations using reverse execution

Abstract: Robotic assembly tasks are in general difficult to program and require a high degree of precision. As the complexity of the task increases it becomes increasingly unlikely that tasks can always be executed without errors. Preventing errors beyond a certain point is economically infeasible, in particular for small-batch productions. As an alternative, we propose a system for automatically handling certain classes of errors instead of preventing them. Specifically, we show that many operations can be automatically reversed. Errors can be handled through automatic reverse execution of the control program to a safe point, from which forward execution can be resumed. This paper describes the principles behind automatic reversal of robotic assembly operations, and experimentally demonstrates the use of a domain-specific language that supports automatic error handling through reverse execution. Our contribution represents the first experimental demonstration of reversible computing principles applied to industrial robotics.

Fast Distributed Near-Optimum Assignment of Assets to Tasks

Abstract: We investigate the assignment of assets to tasks where each asset can potentially execute any of the tasks, but assets execute tasks with a probabilistic outcome of success. There is a cost associated with each possible assignment of an asset to a task, and if a task is not executed, there is also a cost associated with the non-execution of the task. Thus, any assignment of assets to tasks will result in an expected overall cost which we wish to minimize. We formulate the allocation of assets to tasks in order to minimize this expected cost, as a nonlinear combinatorial optimization problem. A neural network approach for its approximate solution is proposed based on selecting parameters of a random neural network (RNN), solving the network in equilibrium, and then identifying the assignment by selecting the neurons whose probability of being active is the highest. Evaluations of the proposed approach are conducted by comparison with the optimum (enumerative) solution as well as with a greedy approach over a large number of randomly generated test cases. The evaluation indicates that the proposed RNN-based algorithm is better in terms of performance than the greedy heuristic, consistently achieving on average results within 5% of the cost obtained by the optimal solution for all problem cases considered. The RNN-based approach is fast and is of low polynomial complexity in the size of the problem, while it can be used for decentralized decision making.

Apparatus and method for providing a user interface within a computing device

Abstract: A user interface for simultaneously representing tasks and notifications in a computing device. The user interface presents the tasks as reduced size representations of the output of the corresponding tasks which are continually updated. The user interface allows a user to bring a selected task to the foreground or to close the task, both by interacting with the representations of the tasks. The user interface further associates notifications with corresponding tasks by superimposing an icon of the notification on the representation of the corresponding task. The user interface orders and arranges the task representations and icons of the notifications according to certain layout rules.