VQA is an ambitious task aiming to answer any image-related question. However, in reality, it hard build such a system once for all since the needs of users are continuously updated, and has implement new functions. Thus, Continual Learning (CL) ability must developing advanced systems. Recently, pioneer work split dataset into disjoint sets study this topic. CL on involves not only expansion l...

The study of the multi-agent task allocation problem with multiple depots is crucial for investigating collaboration. Although many traditional heuristic algorithms can be adopted to handle concerned problem, they are not able efficiently obtain optimal or suboptimal solutions. To this end, a graph attention pointer network built in paper deal problem. Specifically, multi-head mechanism employe...

In [1], we describe the design and development of a task taxonomy for temporal graph visualisation. This paper details the full instantiation of that task taxonomy. Our task taxonomy is based on the Andrienko framework [2], which uses a systematic approach to develop a formal task framework for visual tasks specifically associated with Exploratory Data Analysis. The Andrienko framework is inten...

We present a new graph-based real-time task model that can specify complex job arrival patterns and global statebased mode switching. The mode switching is of a mixedcriticality style, enabling immediate changes to the parameters of active jobs upon mode switches. The resulting task model therefore generalizes previously proposed task graph models as well as mixed-criticality (sporadic) task mo...

The scheduling and mapping of task graph to processors is considered to be the most crucial NP-complete in parallel and distributed computing systems. In this paper, the theoretical graph application using matching is presented to assign a number of tasks onto two processors. This paper addresses a directed-weighted cyclic graph. The effort is to reduce the graph onto directed acyclic graph. A ...

Genetic algorithms have successfully been applied to multiprocessor task graph scheduling. In these previous attempts the schedules are constructed from directed acyclic task graphs. However, recurrent applications such as real-time control and digital signal processing can be expressed as directed cyclic task graphs. This paper presents a method for transforming a cyclic task graph into severa...

This paper presents improvements on techniques of merging tasks in task graphs generated in the ModPar automatic parallelization module of the OpenModelica compiler. Automatic parallelization is performed on Modelica models by building data dependency graphs called task graphs from the model equations. To handle large task graphs with fine granularity, i.e. low ratio of execution and communicat...

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...