156 resultados para Task constraints
Resumo:
We present a Spatio-temporal 2D Models Framework (STMF) for 2D-Pose tracking. Space and time are discretized and a mixture of probabilistic "local models" is learnt associating 2D Shapes and 2D Stick Figures. Those spatio-temporal models generalize well for a particular viewpoint and state of the tracked action but some spatio-temporal discontinuities can appear along a sequence, as a direct consequence of the discretization. To overcome the problem, we propose to apply a Rao-Blackwellized Particle Filter (RBPF) in the 2D-Pose eigenspace, thus interpolating unseen data between view-based clusters. The fitness to the images of the predicted 2D-Poses is evaluated combining our STMF with spatio-temporal constraints. A robust, fast and smooth human motion tracker is obtained by tracking only the few most important dimensions of the state space and by refining deterministically with our STMF.
Resumo:
Increasingly infrastructure providers are supplying the cloud marketplace with storage and on-demand compute resources to host cloud applications. From an application user's point of view, it is desirable to identify the most appropriate set of available resources on which to execute an application. Resource choice can be complex and may involve comparing available hardware specifications, operating systems, value-added services, such as network configuration or data replication, and operating costs, such as hosting cost and data throughput. Providers' cost models often change and new commodity cost models, such as spot pricing, have been introduced to offer significant savings. In this paper, a software abstraction layer is used to discover infrastructure resources for a particular application, across multiple providers, by using a two-phase constraints-based approach. In the first phase, a set of possible infrastructure resources are identified for a given application. In the second phase, a heuristic is used to select the most appropriate resources from the initial set. For some applications a cost-based heuristic is most appropriate; for others a performance-based heuristic may be used. A financial services application and a high performance computing application are used to illustrate the execution of the proposed resource discovery mechanism. The experimental result shows the proposed model could dynamically select an appropriate set of resouces that match the application's requirements.
Resumo:
Objective: Previous studies with patients diagnosed with Major Depressive Disorder (MDD) revealed deficits in working memory and executive functions. In the present study we investigated whether patients with MDD have the ability to allocate cognitive resources in dual task performance of a highly challenging cognitive task (working memory) and a task that is seemingly automatic in nature (postural control). Method: Fifteen young (18–35 years old) patients with MDD and 24 healthy age-matched controls performed a working memory task and two postural control tasks (standing on a stable or on a moving platform) both separately (single task) and concurrently (dual task). Results: Postural stability under single task conditions was similar in the two groups, and in line with earlier studies, MDD patients recalled fewer working memory items than controls. To equate working memory challenges for patients and controls, task difficulty (number of items presented) in dual task was individually adjusted such that accuracy of working memory performance was similar for the two groups under single task conditions. Patients showed greater postural instability in dual task performance on the stable platform, and more importantly when posture task difficulty increased (moving platform) they showed deficits in both working memory accuracy and postural stability compared with healthy controls. Conclusions: We interpret our results as evidence for executive control deficits in MDD patients that affect their task coordination. In multitasking, these deficits affect not only cognitive but also sensorimotor task performance.
Resumo:
The prevalence of multicore processors is bound to drive most kinds of software development towards parallel programming. To limit the difficulty and overhead of parallel software design and maintenance, it is crucial that parallel programming models allow an easy-to-understand, concise and dense representation of parallelism. Parallel programming models such as Cilk++ and Intel TBBs attempt to offer a better, higher-level abstraction for parallel programming than threads and locking synchronization. It is not straightforward, however, to express all patterns of parallelism in these models. Pipelines are an important parallel construct, although difficult to express in Cilk and TBBs in a straightfor- ward way, not without a verbose restructuring of the code. In this paper we demonstrate that pipeline parallelism can be easily and concisely expressed in a Cilk-like language, which we extend with input, output and input/output dependency types on procedure arguments, enforced at runtime by the scheduler. We evaluate our implementation on real applications and show that our Cilk-like scheduler, extended to track and enforce these dependencies has performance comparable to Cilk++.
Resumo:
The value proposition concept, while forming a central foundational premise of service-dominant (S-D) logic, has nevertheless been treated somewhat ambiguously. Recent work in attempting to address this has focused through a S-D logic lens on the reciprocal nature of value propositions. Important to this work has been a focus on communicative interactions and resource integration between network suppliers and customers. Overall, value proposition thinking has not studied in detail their adoption and use in practice. Considering the compelling notion of reciprocity, there have been recent calls for research to consider reciprocal value propositions in practice. The overall aim of this paper, therefore, was to explore how reciprocal value propositions are developed (or not) in practice at the network level. The study was set in the mobile television (TV) sector, which, as an internet-driven sector, is viewed as particularly pertinent. To conduct the study an S-D logic and Industrial Marketing and Purchasing (IMP) Group framework are integrated for the first time. A key finding is that while the reciprocal value proposition concept is theoretically intuitive, it is by no means inevitable in practice. Reciprocal value propositions were found to be simultaneously constrained, and, potentially enabled by these constraints in practice. At an overall level this paper contributes to the ongoing collaborative process, which aims to move S-D logic from a framework to a theory. More specifically, we provide new insights into the development of reciprocal value propositions in practice.
Resumo:
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem.
Resumo:
The deployment of biofuels is significantly affected by policy in energy and agriculture. In the energy arena, concerns regarding the sustainability of biofuel systems and their impact on food prices led to a set of sustainability criteria in EU Directive 2009/28/EC on Renewable Energy. In addition, the 10% biofuels target by 2020 was replaced with a 10% renewable energy in transport target. This allows the share of renewable electricity used by electric vehicles to contribute to the mix in achieving the 2020 target. Furthermore, only biofuel systems that effect a 60% reduction in greenhouse gas emissions by 2020 compared with the fuel they replace are allowed to contribute to meeting the target. In the agricultural arena, cross-compliance (which is part of EU Common Agricultural Policy) dictates the allowable ratio of grassland to total agricultural land, and has a significant impact on which biofuels may be supported. This paper outlines the impact of these policy areas and their implications for the production and use of biofuels in terms of the 2020 target for 10% renewable transport energy, focusing on Ireland. The policies effectively impose constraints on many conventional energy crop biofuels and reinforce the merits of using biomethane, a gaseous biofuel. The analysis shows that Ireland can potentially satisfy 15% of renewable energy in transport by 2020 (allowing for double credit for biofuels from residues and ligno-cellulosic materials, as per Directive 2009/28/EC) through the use of indigenous biofuels: grass biomethane, waste and residue derived biofuels, electric vehicles and rapeseed biodiesel. © 2010 Elsevier Ltd. All rights reserved.
Resumo:
In many coastal areas of North America and Scandinavia, post-glacial clay sediments have emerged above sea level due to iso-static uplift. These clays are often destabilised by fresh water leaching and transformed to so-called quick clays as at the investigated area at Smørgrav, Norway. Slight mechanical disturbances of these materials may trigger landslides. Since the leaching increases the electrical resistivity of quick clay as compared to normal marine clay, the application of electromagnetic (EM) methods is of particular interest in the study of quick clay structures.
For the first time, single and joint inversions of direct-current resistivity (DCR), radiomagnetotelluric (RMT) and controlled-source audiomagnetotelluric (CSAMT) data were applied to delineate a zone of quick clay. The resulting 2-D models of electrical resistivity correlate excellently with previously published data from a ground conductivity metre and resistivity logs from two resistivity cone penetration tests (RCPT) into marine clay and quick clay. The RCPT log into the central part of the quick clay identifies the electrical resistivity of the quick clay structure to lie between 10 and 80 O m. In combination with the 2-D inversion models, it becomes possible to delineate the vertical and horizontal extent of the quick clay zone. As compared to the inversions of single data sets, the joint inversion model exhibits sharper resistivity contrasts and its resistivity values are more characteristic of the expected geology. In our preferred joint inversion model, there is a clear demarcation between dry soil, marine clay, quick clay and bedrock, which consists of alum shale and limestone.
Resumo:
Cognitive and neurophysiological correlates of arithmetic calculation, concepts, and applications were examined in 41 adolescents, ages 12-15 years. Psychological and task-related EEG measures which correctly distinguished children who scored low vs. high (using a median split) in each arithmetic subarea were interpreted as indicative of processes involved. Calculation was related to visual-motor sequencing, spatial visualization, theta activity measured during visual-perceptual and verbal tasks at right- and left-hemisphere locations, and right-hemisphere alpha activity measured during a verbal task. Performance on arithmetic word problems was related to spatial visualization and perception, vocabulary, and right-hemisphere alpha activity measured during a verbal task. Results suggest a complex interplay of spatial and sequential operations in arithmetic performance, consistent with processing model concepts of lateralized brain function.
Resumo:
Task-based dataflow programming models and runtimes emerge as promising candidates for programming multicore and manycore architectures. These programming models analyze dynamically task dependencies at runtime and schedule independent tasks concurrently to the processing elements. In such models, cache locality, which is critical for performance, becomes more challenging in the presence of fine-grain tasks, and in architectures with many simple cores.
This paper presents a combined hardware-software approach to improve cache locality and offer better performance is terms of execution time and energy in the memory system. We propose the explicit bulk prefetcher (EBP) and epoch-based cache management (ECM) to help runtimes prefetch task data and guide the replacement decisions in caches. The runtimem software can use this hardware support to expose its internal knowledge about the tasks to the architecture and achieve more efficient task-based execution. Our combined scheme outperforms HW-only prefetchers and state-of-the-art replacement policies, improves performance by an average of 17%, generates on average 26% fewer L2 misses, and consumes on average 28% less energy in the components of the memory system.
Resumo:
Task dataflow languages simplify the specification of parallel programs by dynamically detecting and enforcing dependencies between tasks. These languages are, however, often restricted to a single level of parallelism. This language design is reflected in the runtime system, where a master thread explicitly generates a task graph and worker threads execute ready tasks and wake-up their dependents. Such an approach is incompatible with state-of-the-art schedulers such as the Cilk scheduler, that minimize the creation of idle tasks (work-first principle) and place all task creation and scheduling off the critical path. This paper proposes an extension to the Cilk scheduler in order to reconcile task dependencies with the work-first principle. We discuss the impact of task dependencies on the properties of the Cilk scheduler. Furthermore, we propose a low-overhead ticket-based technique for dependency tracking and enforcement at the object level. Our scheduler also supports renaming of objects in order to increase task-level parallelism. Renaming is implemented using versioned objects, a new type of hyper object. Experimental evaluation shows that the unified scheduler is as efficient as the Cilk scheduler when tasks have no dependencies. Moreover, the unified scheduler is more efficient than SMPSS, a particular implementation of a task dataflow language.