Search

Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous $4\sqrt{m/k}$ 4 m / k -competitive online algorithm by Amaris et al. , where $m$ m is the number of CPUs and $k$ k the number of GPUs ($m\geq k$ m ≥ k ). We prove that no online algorithm can have a competitive ratio smaller than $\sqrt{m/k}$ m / k . We also study how adding flexibility on task processing, such as task migration or spoliation, or increasing the knowledge of the scheduler by providing it with information on the task graph, influences the lower bound. We provide a $(2\sqrt{m/k}+1)$ (2 m / k + 1) -competitive algorithm as well as a tunable combination of a system-oriented heuristic and a competitive algorithm; this combination performs well in practice and has a competitive ratio in $\Theta (\sqrt{m/k})$ Θ (m / k) . We also adapt all our results to the case of multiple types of processors. Finally, simulations on different sets of task graphs illustrate how the instance properties impact the performance of the studied algorithms and show that our proposed tunable algorithm performs the best among the online algorithms in almost all cases and has even performance close to an offline algorithm. [ABSTRACT FROM AUTHOR]

Task allocation is a major challenge in Mobile Crowd Sensing (MCS). While previous task allocation approaches follow either the opportunistic or participatory mode, this paper proposes to integrate these two complementary modes in a two-phased hybrid framework called HyTasker. In the offline phase, a group of workers (called opportunistic workers) are selected, and they complete MCS tasks during their daily routines (i.e., opportunistic mode). In the online phase, we assign another set of workers (called participatory workers) and require them to move specifically to perform tasks that are not completed by the opportunistic workers (i.e., participatory mode). Instead of considering these two phases separately, HyTasker jointly optimizes them with a total incentive budget constraint. In particular, when selecting opportunistic workers in the offline phase of HyTasker, we propose a novel algorithm that simultaneously considers the predicted task assignment for the participatory workers, in which the density and mobility of participatory workers are taken into account. Experiments on two real-world mobility datasets demonstrate that HyTasker outperforms other methods with more completed tasks under the same budget constraint. [ABSTRACT FROM AUTHOR]

In this article, we study multirobot task allocation problems where task costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will update task assignments to reflect the new information using additional communication and computation. In dynamic settings, the robots are continually repairing the optimality of the system's task assignments, which can incur substantial communication and computation. We investigate how one can reduce communication and centralized computation expense during execution by using a prior model of how costs may change and performing upfront computation of possible robot–task assignments. First, we develop an algorithm that partitions a team of robots into several independent subteams that are able to maintain global optimality by communicating entirely amongst themselves. Second, we propose a method for computing the worst-case cost suboptimality if robots persist with the initial assignment and perform no further communication and computation. Finally, we introduce an algorithm to assess whether cost changes affect the optimality of the current assignment through a succession of local communication exchanges. Experimental results show that the proposed methods are helpful in reducing the degree of centralization needed by a multirobot system (e.g., the third method gave at least 45% reduction of global communication across all scenarios studied). The methods are valuable in transitioning multirobot techniques, which have met with success in structured applications (such as factories and warehouses) to the broader, wilder world. [ABSTRACT FROM AUTHOR]

This article considers a multiplayer reach–avoid game between two adversarial teams in a general convex domain which consists of a target region and a play region. The evasion team, initially lying in the play region, aims to send as many team members into the target region as possible, while the pursuit team with its team members initially distributed in both play region and target region, strives to prevent that by capturing the evaders. We aim at investigating a task assignment about the pursuer–evader matching, which can maximize the number of the evaders who can be captured before reaching the target region safely when both teams play optimally. To address this, two winning regions for a group of pursuers to intercept an evader are determined by constructing an analytical barrier which divides these two parts. Then, a task assignment to guarantee the most evaders intercepted is provided by solving a simplified 0-1 integer programming instead of a nondeterministic polynomial problem, easing the computation burden dramatically. It is worth noting that except the task assignment, the whole analysis is analytical. Finally, simulation results are also presented. [ABSTRACT FROM AUTHOR]

Crowdsensing paradigm facilitates a wide range of data collection, where great efforts have been made to address its fundamental issues of matching workers to their assigned tasks and processing the collected data. In this paper, we reexamine these issues by considering the spatio-temporal worker mobility and task arrivals, which more fit the actual situation. Specifically, we study the location-aware and location diversity based dynamic crowdsensing system, where workers move over time and tasks arrive stochastically. We first exploit offline crowdsensing by proposing a combinatorial algorithm, for efficiently distributing tasks to workers. After that, we mainly study the online crowdsensing, and further consider an indispensable aspect of worker's fair allocation. Apart from the stochastic characteristics and discontinuous coverage, the non-linear expectation is incurred as a new challenge concerning fairness issue. Based on Lyapunov optimization with perturbation parameters, we propose online control policy to overcome those challenges. Hereby, we can maintain system stability and achieve a time average sensing utility arbitrarily close to the optimum. Finally, we propose an optimization framework to aggregate the sensing data which can estimate worker expertise and task truth simultaneously. Performance evaluations on real and synthetic data set validate the proposed algorithm, where 80 percent gain of fairness is achieved at the expense of 12 percent loss of sensing value on average. [ABSTRACT FROM AUTHOR]

A new cognitive approach is proposed for understanding the texts of planimetric tasks and for visualizing the task conditions to complement the syntactic-semantical sentence parsing. Two main difficulties in understanding texts of plane geometry tasks are observed: the ellipticity and vagueness of texts. To overcome the difficulties in understanding the task conditions it is proposed constructing cognitive models of objects and relations between them. The proposed cognitive approach is incorporated in an integrated system for automatic solving planimetric tasks with the natural language interface. The interactive visualization has been developed in the system. It depicts the syntactic and semantic structures as a result of natural language text analysis and searching for task solution. This visualization allows the users to obtain explanations associated with any elements of the images and to correct the tasks' texts in dialog with the system. The destiny of the system is to serve for training schoolchildren in the domain of Euclidean geometry. The cognitive approach proposed can be a first step to automated analyzing plane geometry texts, in perspective, as a cognitively controlled parsing. [ABSTRACT FROM AUTHOR]

Task allocation is a critical phase of project management. Tree-type structures are frequently used constraints to obtain a pertinent task allocation. They can illustrate where one task may require numerous agents and when an agent can be assigned to different tasks (roles). The process of task allocation is made more complex when administrators need to satisfy sequential and fixed branch relationships between/among tasks (roles). This paper formalizes the tree-structured task allocation problem (TSTAP) with group multirole assignment (GMRA) and proves necessary conditions, the necessary and sufficient condition, as well as sufficient conditions, of TSTAP. The formalization makes it easy to find a solution with the IBM ILOG CPLEX optimization package (CPLEX). The necessary conditions improve the CPLEX solution by eliminating infeasible cases. The necessary and sufficient condition describes the solution space of TSTAP completely. Another exciting result is that the sufficient conditions can not only improve the CPLEX solution by describing a practical approximate solution space but also help decision-makers and human resource officers organize a team in order to successfully assign tasks. The proposed approach is verified by simulation experiments with respect to a real-world problem. The experimental results present the practicability of the proposed solutions in this paper. This paper was motivated by general cooperative projects whose tasks have tree-structured relationships. This can make the problem of successful multitask assignment extremely challenging. The traditional method of assignment such as the KM algorithm can no longer solve this problem. To solve the assignment problem with tree-structured relationships, an efficient many-to-many assignment with constraints is required. The proposed approach provides theoretical and technical foundations for efficient assignment of TSTA, which can not only provide a viable and effective assignment scheme for TSTA problems but also help human resource officers to formulate reasonable plans according to the relationships between/among tasks. [ABSTRACT FROM AUTHOR]

Utilization bound is a well-known concept in real-time scheduling theory for sequential periodic tasks, which can be used both for quantifying the performance of scheduling algorithms and as efficient schedulability tests. However, the schedulability of parallel real time task graphs depends on not only utilization, but also another parameter tensity, the ratio between the longest path length and period. In this paper, we use utilization-tensity bounds to better characterize the schedulability of parallel real-time tasks. In particular, we derive utilization-tensity bounds for parallel DAG tasks under global EDF scheduling, which facilitate significantly more precise schedulability analysis than the state-of-the-art analysis techniques based on capacity augmentation bound and response time analysis. Moreover, we apply the above results to the federated scheduling paradigm to improve the system schedulability by choosing proper scheduling strategies for tasks with different workload and structure features. [ABSTRACT FROM AUTHOR]

Two factors primarily affect the performance of multi-threaded tasks on many-core processors with logically-shared and physically-distributed Last-Level Cache (LLC): the LLC latencies of threads running on different cores and the per-core power budgets that aim to guarantee thermally safe operation. Two knobs affect these factors: First, the mapping of threads to cores affects both the LLC latencies and the power budgets. Second, dynamic power budgeting refines the power budgets during task execution. A mapping that spatially distributes threads across the many-core increases the power budgets, but unfortunately also increases the LLC latencies. Contrarily, mapping all threads near the center of the many-core minimizes the LLC latencies, but unfortunately also decreases the power budgets. Consequently, both metrics cannot be simultaneously optimal, which leads to a Pareto-optimization for task mapping that has formerly not been exploited. Dynamic power budgeting reallocates the power budgets according to the tasks’ execution phases. This results in a dynamically changing non-uniform power budget, which further increases the performance. We are the first to present a run-time algorithm PCGov combining task-agnostic task mapping and task-aware dynamic power budgeting for many-cores with shared distributed LLC. PCGov yields up to 21 percent lower response time and 13 percent lower energy consumption compared to the state-of-the-art, with a low overhead of less than 0.5 percent. [ABSTRACT FROM AUTHOR]

Recently, several parallel frameworks have emerged to utilize the increasing computational capacity of multiprocessors. Parallel tasks are distinguished from traditional sequential tasks in that the subtasks contained in a single parallel task can simultaneously execute on multiple processors. In this study, we consider the scheduling problem of minimizing the number of processors on which the parallel real-time tasks feasibly run. In particular, we focus on scheduling sporadic parallel real-time tasks, in which precedence constraints between subtasks of each parallel task are expressed using a directed acyclic graph (DAG). To address the problem, we formulate an optimization problem that aims to minimize the maximum processing capacity for executing the given tasks. We then suggest a polynomial solution consisting of three steps: (1) transform each parallel real-time task into a series of multithreaded segments, while respecting the precedence constraints of the DAG; (2) selectively extend the segment lengths; and (3) interpret the problem as a flow network to balance the flows on the terminal edges. We also provide the schedulability bound of the proposed solution: it has a capacity augmentation bound of 2. Our experimental results show that the proposed approach yields higher performance than one developed in a recent study. [ABSTRACT FROM AUTHOR]

Designing brain-computer interfaces (BCIs) that can be used in conjunction with ongoing motor behavior requires an understanding of how neural activity co-opted for brain control interacts with existing neural circuits. For example, BCIs may be used to regain lost motor function after stroke. This requires that neural activity controlling unaffected limbs is dissociated from activity controlling the BCI. In this study we investigated how primary motor cortex accomplishes simultaneous BCI control and motor control in a task that explicitly required both activities to be driven from the same brain region (i.e. a dual-control task). Single-unit activity was recorded from intracortical, multi-electrode arrays while a non-human primate performed this dual-control task. Compared to activity observed during naturalistic motor control, we found that both units used to drive the BCI directly (control units) and units that did not directly control the BCI (non-control units) significantly changed their tuning to wrist torque. Using a measure of effective connectivity, we observed that control units decrease their connectivity. Through an analysis of variance we found that the intrinsic variability of the control units has a significant effect on task proficiency. When this variance is accounted for, motor cortical activity is flexible enough to perform novel BCI tasks that require active decoupling of natural associations to wrist motion. This study provides insight into the neural activity that enables a dual-control brain-computer interface. [ABSTRACT FROM AUTHOR]

Latency in a visualization system is widely believed to affect user behavior in measurable ways, such as requiring the user to wait for the visualization system to respond, leading to interruption of the analytic flow. While this effect is frequently observed and widely accepted, precisely how latency affects different analysis scenarios is less well understood. In this paper, we examine the role of latency in the context of visual search, an essential task in data foraging and exploration using visualization. We conduct a series of studies on Amazon Mechanical Turk and find that under certain conditions, latency is a statistically significant predictor of visual search behavior, which is consistent with previous studies. However, our results also suggest that task type, task complexity, and other factors can modulate the effect of latency, in some cases rendering latency statistically insignificant in predicting user behavior. This suggests a more nuanced view of the role of latency than previously reported. Building on these results and the findings of prior studies, we propose design guidelines for measuring and interpreting the effects of latency when evaluating performance on visual search tasks. [ABSTRACT FROM AUTHOR]

Common pitfalls in visualization projects include lack of data availability and the domain users' needs and focus changing too rapidly for the design process to complete. While it is often prudent to avoid such projects, we argue it can be beneficial to engage them in some cases as the visualization process can help refine data collection, solving a “chicken and egg” problem of having the data and tools to analyze it. We found this to be the case in the domain of task parallel computing where such data and tooling is an open area of research. Despite these hurdles, we conducted a design study. Through a tightly-coupled iterative design process, we built Atria, a multi-view execution graph visualization to support performance analysis. Atria simplifies the initial representation of the execution graph by aggregating nodes as related to their line of code. We deployed Atria on multiple platforms, some requiring design alteration. We describe how we adapted the design study methodology to the “moving target” of both the data and the domain experts' concerns and how this movement kept both the visualization and programming project healthy. We reflect on our process and discuss what factors allow the project to be successful in the presence of changing data and user needs. [ABSTRACT FROM AUTHOR]

Task offloading is a promising technology to exploit the available computational resources in spatially distributed fog nodes efficiently in the era of fog computing. In this paper, we look for an online task offloading strategy to minimize the long-term cost, which factors in the latency, the energy consumption, and the switching cost. To this end, we formulate a stochastic programming problem and the expectations of the system parameters are allowed to change abruptly at unknown time instants. Meanwhile, we consider the fact that the queried nodes can only feed back the processing results after finishing the tasks. Then we put forth an effective bandit learning algorithm, i.e., the BLOT, to solve this challenging stochastic programming under the non-stationary bandit model. We also demonstrate that our proposed BLOT algorithm is asymptotically optimal in a non-stationary fog-enabled network. Numerical experiments further verify the superb performance of BLOT. [ABSTRACT FROM AUTHOR]

In automotive embedded real-time systems, e.g., the engine control unit, tasks are activated whenever the engine arrives at a specific angular position. In consequence the frequency of activation changes with the speed of the engine. Additionally, the execution times and deadlines may also depend on the engine speed. In recently published works analytical methods for tasks with this rate-dependent behavior were introduced. Though those methods do not consider angular phases between tasks. For instance, in a typical engine control unit one event is displaced a certain angular position after an event of another task. This paper introduces a sufficient analysis, which considers such angular phases. A number of experimental results are reported to compare our method with existing analysis. These illustrate the improvement in terms of precision and runtime. [ABSTRACT FROM AUTHOR]

Visual analytics tools integrate provenance recording to externalize analytic processes or user insights. Provenance can be captured on varying levels of detail, and in turn activities can be characterized from different granularities. However, current approaches do not support inferring activities that can only be characterized across multiple levels of provenance. We propose a task abstraction framework that consists of a three stage approach, composed of 1) initializing a provenance task hierarchy, 2) parsing the provenance hierarchy by using an abstraction mapping mechanism, and 3) leveraging the task hierarchy in an analytical tool. Furthermore, we identify implications to accommodate iterative refinement, context, variability, and uncertainty during all stages of the framework. We describe a use case which exemplifies our abstraction framework, demonstrating how context can influence the provenance hierarchy to support analysis. The article concludes with an agenda, raising and discussing challenges that need to be considered for successfully implementing such a framework. [ABSTRACT FROM AUTHOR]

Objective: To introduce a novel event-related potential (ERP)-based brain–computer interface (BCI) paradigm with active mental tasks multiplying precise judgment and visual cognitive capacities and evaluate its performance. Methods: This study employed a paradigm with three types of targets (true-, pseudo-, and non-), double flash codes, colors and color terms, and four test conditions. The primary hypothesis was that active mental tasks combining multiple cognitive capacities and clear judgment for different categories of stimuli increase the BCI performance and evoke stronger or specific ERPs. Classification methods were proposed and evaluated, and two were used in online experiments. Results: The modes containing active mental tasks provided higher accuracy than the control mode (by up to 19.06%). The color-word matching mode had the highest judgment level and achieved the best performance. True-stimuli evoked strong P3b, while pseudotarget signals provided obvious N4, but the control mode seemed less sensitive to both of them. Different types of stimuli evoked distinctive N2 and P3a components. Conclusion: An appropriate boost in the judgment level using multiple stimuli and cognitive approaches could be investigated to improve the BCI performance and evoke or enhance ERPs. Utilizing active mental tasks may be a promising way to promote BCIs. Significance: Active mental tasks combining multiple cognitive capacities and precise judgments were adopted in an ERP-based BCI. Color and color words were introduced as stimuli to construct an alternative paradigm, and the judgment levels of different conditions were calculated. High accuracies and the participants’ preferences were obtained, which may promote the effective use of BCIs. [ABSTRACT FROM AUTHOR]

Objective: Brain-computer interface (BCI) systems aim to control external devices by using brain signals. The performance of these systems is influenced by the user's mental state, such as attention. In this study, we classified two attention states to a target task (attended and distracted task level) while attention to the task is altered by one of three types of distractors. Methods: A total of 27 participants were allocated into three experimental groups and exposed to one type of distractor. An attended condition that was the same across the three groups comprised only the main task execution (self-paced dorsiflexion) while the distracted condition was concurrent execution of the main task and an oddball task (dual-task condition). Electroencephalography signals were recorded from 28 electrodes to classify the two attention states of attended or distracted task conditions by extracting temporal and spectral features. Results: The results showed that the ensemble classification accuracy using the combination of temporal and spectral features (spectro-temporal features, 82.3 ± 2.7%) was greater than using temporal (69 ± 2.2%) and spectral (80.3 ± 2.6%) features separately. The classification accuracy was computed using a combination of different channel locations, and it was demonstrated that a combination of parietal and centrally located channels was superior for classification of two attention states during movement preparation (parietal channels: 84.6 ± 1.3%, central and parietal channels: 87.2 ± 1.5%). Conclusion: It is possible to monitor the users’ attention to the task for different types of distractors. Significance: It has implications for online BCI systems where the requirement is for high accuracy of intention detection. [ABSTRACT FROM AUTHOR]

In precision motion systems, well-designed feedforward control can effectively compensate for the reference-induced error. Compared to iterative learning control (ILC), data-based fixed-structure feedforward control (DFFC) possesses robustness against reference variations, but results in mediocre performance in exactly repeating tasks. In this paper, a novel data-based switching feedforward control (DSFC) approach is synthesized to well balance the tradeoff between the extrapolation capabilities and servo performance. Specifically, a theoretical framework is developed for the proposed DSFC approach, where the feedforward control is switched between ILC and DFFC according to whether the successive references are repeated or not. When operating in the DFFC mode, a new iterative parameter tuning algorithm is proposed to enable the performance enhancement compared to the pre-existing DFFC and overcome the limitation of the allowable reference variations. Furthermore, an unbiased estimate method for the convolution matrix of the (process) sensitivity function is developed based on the impulse response experiment. No parametric model is required throughout the proposed DSFC procedure, and the optimal parameters of the DFFC mode can be unbiasedly estimated. Experimental results on an ultraprecision wafer stage confirm that the proposed DSFC combines advantages of ILC and DFFC, and achieves high performance for both repeating and varying tasks. [ABSTRACT FROM AUTHOR]

Contemporary resource constraint mobile devices face great challenges to execute computationally expensive tasks of low-latency Tactile Internet applications in a time-efficient manner. The so-called HART has emerged as a promising platform to address the burden of resource-limited mobile devices by allowing collaboration among humans, cloud agents, and robots for task execution. To facilitate a better task execution performance, dynamic task offloading onto suitable actors represents an important research problem, taking time-varying task, robot, and cloud agent properties into account. To tackle this open problem, this article first discusses characteristics, applications, and challenges of HART tasks. Next, this article investigates the problem of whether and where a HART task should be offloaded and presents a COTA strategy by taking task offloading gain and communication overhead into account. For HART-centric task offloading, this article leverages central cloud, mobile edge computing (MEC) servers, and multi-robot FiWi networks. Finally, numerical results are presented to examine the performance of the proposed COTA scheme over FiWi based Tactile Internet infrastructures. [ABSTRACT FROM AUTHOR]

Fog computing has the potential to liberate the computation-intensive mobile devices by task offloading. In this paper, we propose an online learning based task offloading algorithm for delay-sensitive applications in dynamic fog networks, which combines with the Combinatorial Multi-Armed Bandits (CMAB) framework. First, the proposed algorithm learns the sharing computing resources of fog nodes at a negligible computational cost. Then, we aim to minimize the task's offloading latency by jointly optimizing the task allocation decision and the spectrum scheduling. Finally, simulation results show that the proposed algorithm achieves much better delay performance than the traditional Upper Confidence Bound (UCB) algorithm and maintains ultra-low offloading delay in dynamic system state. [ABSTRACT FROM AUTHOR]

Heterogenerous multi-cores utilize the strength of different architectures for executing particular types of workload, and usually offer higher performance and energy efficiency. In this paper, we study the worst-case response time (WCRT) analysis of typed scheduling of parallel DAG tasks on heterogeneous multi-cores, where the workload of each vertex in the DAG is only allowed to execute on a particular type of cores. The only known WCRT bound for this problem is grossly pessimistic and suffers the non-self-sustainability problem. In this paper, we propose two new WCRT bounds. The first new bound has the same time complexity as the existing bound, but is more precise and solves its non-self-sustainability problem. The second new bound explores more detailed task graph structure information to greatly improve the precision, but is computationally more expensive. We prove that the problem of computing the second bound is strongly NP-hard if the number of types in the system is a variable, and develop an efficient algorithm which has polynomial time complexity if the number of types is a constant. Experiments with randomly generated workload show that our proposed new methods are more precise than the existing bound while having good scalability. [ABSTRACT FROM AUTHOR]

In data centers, up to dozens of tasks are colocated on a single physical machine. Machines are used more efficiently, but the performance of the tasks deteriorates, as the colocated tasks compete for shared resources. Since the tasks are heterogeneous, the resulting performance dependencies are complex. In our previous work [1] , [2] we proposed a new combinatorial optimization model that uses two parameters of a task — its size and its type — to characterize how a task influences the performance of other tasks allocated to the same machine. In this paper, we study the egalitarian optimization goal: the aim is to optimize the performance of the worst-off task. This problem generalizes the classic makespan minimization on multiple processors ($P||C_{\max }$P||Cmax). We prove that polynomially-solvable variants of $P||C_{\max }$P||Cmax are NP-hard for this generalization, and that the problem is hard to approximate when the number of types is not constant. For a constant number of types, we propose a PTAS, a fast approximation algorithm, and a series of heuristics. We simulate the algorithms on instances derived from a trace of one of Google clusters. Compared with baseline algorithms solving $P||C_{\max }$P||Cmax, our proposed algorithms aware of the types of the jobs lead to significantly better tasks' performance. The notion of type enables us to extend standard combinatorial optimization methods to handle degradation of performance caused by colocation. Types add a layer of additional complexity. However, our results — approximation algorithms and good average-case performance — show that types can be handled efficiently. [ABSTRACT FROM AUTHOR]

The performance of electroencephalogram (EEG)-based brain-computer interfaces (BCIs) still needs improvements for real world applications. An improvement on BCIs could be achieved by enhancing brain signals from the source via subject intention-based modulation. In this work, we aim to investigate the effects of task complexity on performance of motor imagery (MI) based BCIs. In specific, we studied the effects of motor imagery of a complex task versus a simple task on discriminability of brain activation patterns using EEG. The results show an increase of up to 7.25% in BCI classification accuracy for motor imagery of the complex task in comparison to the simple task. Furthermore, spectral power analysis in low frequency bands, alpha and beta, shows a significant decrease in power value for the complex task. However, high frequency gamma band analysis unveils a significant increase for the complex task. These findings may lead to designing better BCIs with high performance. [ABSTRACT FROM AUTHOR]

Task mapping has been a hot topic in multiprocessor system-on-chip software design for decades. During the mapping process, load balance (LB) and communication optimization have been two important performance optimization factors. This paper studies the relations between LB, interprocessor communications, and communication pipeline technique during the mapping process, and proposes an integer linear programming (ILP)-based static task mapping approach, which considers both LB and communication optimization. The approach consists of an optimized ILP model for task mapping with fewer variables compared to previous ILP mapping works. Moreover, to enhance the scalability of the ILP task mapping, the task-processor-cluster algorithm is proposed to reduce the scale of the task graph and the number of processors and then solve the coarse-grained input by the ILP mapping. To increase the adaptability of the ILP task mapping, the improved augmented $\epsilon $ -constraint method is further integrated with the ILP formulations to select the best mapping for different applications. Experimental results on a 2/4/8/16/24-CPU platform of both synthetic and real-life benchmarks demonstrate the efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

Interactive model steering helps people incrementally build machine learning models that are tailored to their domain and task. Existing visual analytic tools allow people to steer a single model (e.g., assignment attribute weights used by a dimension reduction model). However, the choice of model is critical in such situations. What if the model chosen is suboptimal for the task, dataset, or question being asked? What if instead of parameterizing and steering this model, a different model provides a better fit? This paper presents a technique to allow users to inspect and steer multiple machine learning models. The technique steers and samples models from a broader set of learning algorithms and model types. We incorporate this technique into a visual analytic prototype, BEAMES, that allows users to perform regression tasks via multimodel steering. This paper demonstrates the effectiveness of BEAMES via a use case, and discusses broader implications for multimodel steering. [ABSTRACT FROM AUTHOR]

Background: Skill assessment in surgery traditionally has relied on the expert observation and qualitative scoring. Our novel study design demonstrates how analysis of performance in sensorimotor tasks and bench-top surgical simulators can provide inferences about the technical proficiency as well as the training history of surgeons. Methods: We examined metrics for basic sensorimotor tasks in a virtual reality interface as well as motion metrics in clinical scenario simulations. As indicators of the training level, we considered survey responses from surgery residents, including the number of postgraduation years (PGY, four levels), research years (RY, three levels), and clinical years (CY, three levels). Next, we performed a linear discriminant analysis with cross-validation (90% training, 10% testing) to relate the training levels to the selected metrics. Results: Using combined metrics from all stations, we found greater than chance predictions for each survey category, with an overall accuracy of 43.4 ± 2.9% for identifying the level for post-graduate years, 79.1 ± 1.0% accuracy for research training years, and 64.2 ± 1.0% for clinical training years. Our main finding was that combining metrics from all stations resulted in more accurate predictions than using only sensorimotor or clinical scenario tasks. In addition, we found that metrics related to the ability to cope with changes in the task environment were the most important predictors of training level. Conclusions: These results suggest that each simulator-type provided crucial information for evaluating surgical proficiency. The methods developed in this paper could improve evaluations of a surgeon's clinical proficiency as well as training potential in terms of basic sensorimotor ability. [ABSTRACT FROM AUTHOR]

With the development of technologies such as the Internet of Things and artificial intelligence, mobile applications are becoming more and more intelligent. Compared to traditional applications realized by mobile cloud computing technology, these novel applications have a higher requirement for a task offloading scheme. However, the traditional task offloading schemes are hard pressed to meet latency and personalization requirements of these new applications. For intelligent application, how to realize personalized and fine-grained task offloading is still a challenging problem. Therefore, we propose a scheme called intelligent task offloading (iTaskOffloading) for a cloud-edge collaborative system, which can provide personalized task offloading. To be specific, we first propose the architecture of iTaskOffloading which includes the local device layer, edge cloud layer, remote cloud layer, and cognitive engine. Then we analyze the method of iTaskOffloading, which contains coarse-grained computing and fine-grained computing. Finally, we build a testbed to evaluate the proposed iTaskOffloading scheme using a typical intelligent application of emotion detection. The experimental results show that compared to the traditional cloud computing scheme, iTaskOffloading has less task duration. [ABSTRACT FROM AUTHOR]

Vehicular fog computing has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize effective server recruitment and reliable task offloading under information asymmetry and uncertainty remains a critical challenge. In this paper, we adopt a two-stage task offloading framework to address this challenge. First, we propose a convex–concave-procedure-based contract optimization algorithm for server recruitment, which aims to maximize the expected utility of the operator with asymmetric information. Then, a low-complexity and stable task offloading mechanism is proposed to minimize the total network delay based on the pricing-based matching. Furthermore, we extend the work to the scenario of information uncertainty and develop a matching-learning-based task offloading mechanism, which takes both occurrence awareness and conflict awareness into consideration. Simulation results demonstrate that the proposed algorithm can effectively motivate resource sharing and guarantee bounded deviation from the optimal performance without the global information. [ABSTRACT FROM AUTHOR]

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to "nearby" cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. However, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75 percent relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation. [ABSTRACT FROM AUTHOR]

This paper proposes a novel task allocation framework, PSTasker, for participatory sensing (PS), which aims to maximize the overall system utility on PS platform by coordinating the allocation of multiple tasks. While existing studies mainly optimize the task allocation from the perspective of the task organizer (e.g., maximizing coverage or minimizing incentive cost), PSTasker further considers diverse factors on the participants' side, including user work bandwidth, user availability, devices' sensor configuration, task completion likelihood, and mobility pattern. Furthermore, by considering the heterogeneity in three dimensions (i.e., task, time, and space), it adopts a novel model to measure task sensing quality and overall system utility. In PSTasker, it first calculates the utlity of a given task allocation plan by jointly fusing different participant-side factors into one unified estimation function, and then employs an iterative greedy process to optimize the task allocation. Extensive evaluations based on real-world mobility traces demonstrate that PSTasker outperforms the baseline methods under various settings. [ABSTRACT FROM AUTHOR]

• We extend our tool focusing on the evaluation of depth perception to include the evaluation of shape perception. • We extend the generation of task-based experiments based on vascular surface models to arbitrary surfaces models. • We provide an automatic preparation of web-based studies to evaluate depth and shape perception in visualization techniques. User studies are indispensable for visualization application papers in order to assess the value and limitations of the presented approach. Important aspects are how well depth and shape information can be perceived, as coding of these aspects is essential to enable an understandable representation of complex 3D data. In practice, there is usually little time to perform such studies, and the establishment and conduction of user studies can be labour-intensive. In addition, it can be difficult to reach enough participants to obtain expressive results regarding the quality of different visualization techniques. In this paper, we propose a framework that allows visualization researchers to quickly create task-based user studies on depth and shape perception for different surface visualizations and perform the resulting tasks via a web interface. With our approach, the effort for generating user studies is reduced and at the same time the web-based component allows researchers to attract more participants to their study. We demonstrate our framework by applying shape and depth evaluation tasks to visualizations of various surface representations used in many technical and biomedical applications. [ABSTRACT FROM AUTHOR]

Existing studies on crowdsourcing often adopt the retail-style allocation approach, in which tasks are allocated individually and independently. However, such retail-style task allocation has the following problems: 1) each task is executed independently from scratch, thus the execution of one task seldom utilize the results of other tasks and the requester must pay in full for the task; 2) many workers only undertake a very small number of tasks contemporaneously, thus the workers' skills and time may not be fully utilized. We observe that many complex tasks in real-world crowdsourcing platforms have similar skill requirements and long deadlines. Based on these real-world observations, this paper presents a novel batch allocation approach for tasks with overlapping skill requirements. Requesters' real payment can be discounted because the real execution cost of tasks can be reduced due to batch allocation and execution, and each worker's real earnings may increase because he/she can undertake more tasks contemporaneously. This batch allocation optimization problem is proved to be NP-hard. Then, two types of heuristic approaches are designed: layered batch allocation and core-based batch allocation. The former approach mainly utilizes the hierarchy pattern to form all possible batches, which can achieve better performance but may require higher computational cost since all possible batches are formed and observed; the latter approach selects core tasks to form batches, which can achieve suboptimal performance with lower complexity and significantly reduce computational cost. With the theoretical analyses and experiments on a real-world Upwork dataset in which the proposed approaches are compared with the previous benchmark retail-style allocation approach, we find that our approaches have better performances in terms of total payment by requesters and average income of workers, as well as maintaining close successful task completion probability and consuming less task allocation time. [ABSTRACT FROM AUTHOR]

There is a growing interest in the development of in-network dispersed computing paradigms that leverage the computing capabilities of heterogeneous resources dispersed across the network for processing a massive amount of data collected at the edge of the network. We consider the problem of task scheduling for such networks, in a dynamic setting in which arriving computation jobs are modeled as chains, with nodes representing tasks, and edges representing precedence constraints among tasks. In our proposed model, motivated by significant communication costs in dispersed computing environments, the communication times are taken into account. More specifically, we consider a network where servers can serve all task types, and sending the outputs of processed tasks from one server to another server results in some communication delay. We first characterize the capacity region of the network, then propose a novel virtual queueing network encoding the state of the network. Finally, we propose a Max-Weight type scheduling policy, and considering the stochastic network in the fluid limit, we use a Lyapunov argument to show that the policy is throughput-optimal. Beyond the model of chains, we extend the scheduling problem to the model of the directed acyclic graph (DAG) which imposes a new challenge, namely logic dependency difficulty, requiring the data of processed parents tasks to be sent to the same server for processing the child task. We propose a virtual queueing network for DAG scheduling over broadcast networks, where servers always broadcast the data of processed tasks to other servers, and prove that Max-Weight policy is throughput-optimal. [ABSTRACT FROM AUTHOR]

Robotic therapy enables mass practice of complex hand movements after stroke, but current devices generally enforce patients to reproduce prescribed kinematic patterns using rigid actuators, without considering individuals’ unique impairment characteristics, thereby reducing their efficacy. In this paper, we tested the feasibility of a novel, theory-based “biomimetic” approach to restoring mechanics of complex hand tasks with subject-specific assistance patterns. Twelve chronic stroke survivors performed two simulated functional tasks: hand open and simulated pinch task (distal pad press). Assistance was provided by non-restraining actuators (exotendons) that counteracted ‘subject-specific’ impairments, identified during unassisted task performance. There was no constraint of movement to predefined patterns. Assistance patterns required to complete tasks were significantly different across subjects, reflecting high variability in impairment and required assistance patterns. For hand open, range of motion and interjoint coordination were significantly improved for severely impaired patients, while movement quality was enhanced (reduction in jerk) for those less impaired. For simulated pinch, subject-specific assistance restored task mechanics before injury, as patients were able to direct fingertip force toward the direction normal to surface; angular deviation reduced from 16.8°±10.4° to 3.7°±2.6°. Notably, electromyography data confirmed that subjects maintained an effort level under assistance comparable to unassisted conditions. The proposed method could lead to a novel paradigm for hand rehabilitation that restores complex task mechanics with a subject-specific assistance reflecting individual impairment characteristics while promoting subjects’ participation. [ABSTRACT FROM AUTHOR]

Visual analysis of multidimensional data requires expressive and effective ways to reduce data dimensionality to encode them visually. Multidimensional projections (MDP) figure among the most important visualization techniques in this context, transforming multidimensional data into scatter plots whose visual patterns reflect some notion of similarity in the original data. However, MDP come with distortions that make these visual patterns not trustworthy, hindering users to infer actual data characteristics. Moreover, the patterns present in the scatter plots might not be enough to allow a clear understanding of multidimensional data, motivating the development of layout enrichment methodologies to operate together with MDP. This survey attempts to cover the main aspects of MDP as a visualization and visual analytic tool. It provides detailed analysis and taxonomies as to the organization of MDP techniques according to their main properties and traits, discussing the impact of such properties for visual perception and other human factors. The survey also approaches the different types of distortions that can result from MDP mappings and it overviews existing mechanisms to quantitatively evaluate such distortions. A qualitative analysis of the impact of distortions on the different analytic tasks performed by users when exploring multidimensional data through MDP is also presented. Guidelines for choosing the best MDP for an intended task are also provided as a result of this analysis. Finally, layout enrichment schemes to debunk MDP distortions and/or reveal relevant information not directly inferable from the scatter plot are reviewed and discussed in the light of new taxonomies. We conclude the survey providing future research axes to fill discovered gaps in this domain. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of task offloading in a software-defined access network, where IoT devices are connected to fog computing nodes by multi-hop IoT access-points (APs). The proposed scheme considers the following aspects in a fog-computing-based IoT architecture: 1) optimal decision on local or remote task computation; 2) optimal fog node selection; and 3) optimal path selection for offloading. Accordingly, we formulate the multi-hop task offloading problem as an integer linear program (ILP). Since the feasible set is non-convex, we propose a greedy-heuristic-based approach to efficiently solve the problem. The greedy solution takes into account delay, energy consumption, multi-hop paths, and dynamic network conditions, such as link utilization and SDN rule-capacity. Experimental results show that the proposed scheme is capable of reducing the average delay and energy consumption by 12% and 21%, respectively, compared with the state of the art. [ABSTRACT FROM AUTHOR]

The P300 is regarded as a psychosis endophenotype of schizophrenia and a putative biomarker of risk for schizophrenia. However, the brain activity (i.e., P300 amplitude) during tasks cannot always provide satisfying discrimination of patients with schizophrenia (SZs) from healthy controls (HCs). Spontaneous activity at rest indices the potential of the brain, such that if the task information can be efficiently processed, it provides a compensatory understanding of the cognitive deficits in SZs. In this paper, based on the resting and P300 task electroencephalogram (EEG) data sets, we constructed functional EEG networks and then extracted the inherent spatial pattern of network (SPN) features for both brain states. Finally, the combined SPN features of the rest and task networks were used to recognize SZs. The findings of this paper revealed that the combined SPN features could achieve the highest accuracy of 90.48%, with the sensitivity of 89.47%, and specificity of 91.30%. These findings consistently implied that the rest and task P300 EEGs could actually provide comprehensive information to reliably classify SZs from HCs, and the SPN is a promising tool for the clinical diagnosis of SZs. [ABSTRACT FROM AUTHOR]

D2D interactions are promoted both in the context of traffic and computation offloading. Applications with functionalities that are executed in parallel in more than one mobile device have been proposed while the idea of using another mobile device as a relay is going to be part of 5G. In this work, we first present the main types of D2D applications, then we discuss the characteristics of task offloading and the quality of experience in D2D ecosystems. After that, we list five popular questions regarding the ability of other users to be helpful in terms of resources, connectivity, availability, incentives, and security. To answer the listed questions, we use two mobile big data datasets, one experimental study, and arguments from our experience and the literature. [ABSTRACT FROM AUTHOR]

Copyright of Life & School: a Magazine for the Theory and Practice of Education / Život i škola : časopis za teoriju i praksu odgoja i obrazovanja is the property of Zivot i Skola and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Mobile crowdsensing (MCS) is a new paradigm to collect sensing data and infer useful knowledge over a vast area for numerous monitoring applications. In urban environments, as more and more applications need to utilize multi-source sensing information, it is almost indispensable to develop a generic mechanism supporting multiple concurrent MCS task assignment. However, most existing multi-task assignment methods focus on homogeneous tasks. Due to the diverse spatiotemporal task requirements and sensing contexts, MCS tasks often differ from each other in many aspects (e.g., spatial coverage, temporal interval). To this end, in the paper, we present and formalize an important Heterogeneous Multi-Task Assignment (HMTA) problem in mobile crowdsensing systems, and try to maximize data quality and minimize total incentive budget. By leveraging the implicit spatiotemporal correlations among heterogeneous tasks, we propose a two-stage HMTA problem-solving approach to effectively handle multiple concurrent tasks in a shared resource pool. Finally, in order to improve the assignment search efficiency, a decomposition-and-combination framework is devised to accommodate large-scale problem scenario. We evaluate our approach extensively using two large-scale real-world data sets. The experimental results validate the effectiveness and efficiency of our proposed approach. [ABSTRACT FROM AUTHOR]

Technological evolutions in the automobile industry, especially the development of connected and autonomous vehicles, have granted vehicles more computing, storage, and sensing resources. The necessity of efficient utilization of these resources leads to the vision of vehicular cloud computing (VCC), which can offload the computing tasks from the edge or remote cloud to enhance the overall efficiency. In this paper, we study the problem of computation offloading through the vehicular cloud (VC), where computing missions from edge cloud can be offloaded and executed cooperatively by vehicles in VC. Specifically, computing missions are further divided into computing tasks with interdependency and executed in different vehicles in the VC to minimize the overall response time. To characterize the instability of computing resources resulting from the high vehicular mobility, a mobility model focusing on vehicular dwell time is utilized. Considering the heterogeneity of vehicular computing capabilities and the interdependency of computing tasks, we formulate an optimization problem for task scheduling, which is NP-hard. For low complexity, a modified genetic algorithm based scheduling scheme is designed where integer coding is used rather than binary coding, and relatives are defined and employed to avoid infeasible solutions. In addition, a task load based stability analysis of the VCC system is presented for the cases where some vehicles within the VC are offline. Numerical results demonstrate that the proposed scheme can significantly improve the utilization of computing resources while guaranteeing low latency and system stability. [ABSTRACT FROM AUTHOR]

Digital Assistants (DAs) can support workers in the workplace and beyond. However, target user needs are not fully understood, and the functions that workers would ideally want a DA to support require further study. A richer understanding of worker needs could help inform the design of future DAs. We investigate user needs of future workplace DAs using data from a user study of 40 workers over a four-week period. Our qualitative analysis confirms existing research and generates new insight on the role of DAs in managing people's time, tasks, and information. Placing these insights in relation to quantitative analysis of self-reported task data, we highlight how different occupation roles require DAs to take varied approaches to these domains and the effect of task characteristics on the imagined features. Our findings have implications for the design of future DAs in work settings and we offer some recommendations for reduction to practice. • This paper aims to better understand the need for Digital Assistants (DAs) to support daily task management in work-related settings. • Demonstrating the perceived utility of Digital Assistants that support user time, tasks, and information by target users. • Different occupation roles require varied support domains from Digital Assistant • Task characteristics affect the Digital Assistant's features that users desire. [ABSTRACT FROM AUTHOR]