نتایج جستجو برای: remap
تعداد نتایج: 376 فیلتر نتایج به سال:
In this paper we address the problem of solving accurately gas-liquid compressible flows without pressure oscillations at the gas-liquid interface. We introduce a new Lagrange-projection scheme based on a random sampling technique introduced by Chalons and Goatin in [CG07]. We compare it to a ghost fluid approach introduced in [WLK06, MBKKH09] which is based on the ghost fluid method for the po...
Service Level Agreements (SLAs) serve as a foundation for a reliable and predictable job execution at remote grid sites. In this paper, we describe an error recovery mechanism for workflow within the SLA context, coping with catastrophic failure when one or several High Performance Computing Centers (HPCCs) are detached from the grid system. We propose an algorithm to detect all affected sub-jo...
The results of our research presented in this paper are two-fold. First, an estimation of global posteriors is formalized in the framework of hybrid HMM/ANN systems. It is shown that hybrid HMM/ANN systems, in which the ANN part estimates local posteriors, can be used to modelize global model posteriors. This formalization provides us with a clear theory in which both REMAP and \classical" Vite...
We present a numerical method for computing elasto-plastic ows in metals. The method uses a conservative Eulerian formulation of elasto-plasticity together with a higher-order Godunov nite diierence method combined with tracking of material boundaries. The Eulerian approach avoids the problem of mesh distortion caused by a Lagrangian remap, and can be easily extended to the computation of ows i...
In this paper we show that partitioning data cache into array and scalar caches can improve cache access pattern without having to remap data, while maintaining the constant access time of a direct-mapped cache and improving the performance of L-1 cache memories. By using 4 central moments (mean, standard-deviation, skewness and kurtosis) we report on the frequency of accesses to cache sets and...
We present a multi-heuristic evolutionary task allocation algorithm to dynamically map tasks to processors in a heterogeneous distributed system. It utilizes a genetic algorithm, combined with eight common heuristics, in an effort to minimize the total execution time. It operates on batches of unmapped tasks and can preemptively remap tasks to processors. The algorithm has been implemented on a...
One of the long-standing unsolved mysteries of visual neuroscience is how the world remains apparently stable in the face of continuous movements of eyes, head and body. Many factors seem to contribute to this stability, including rapid updating mechanisms that temporarily remap the visual input to compensate for the impending saccade. However, there is also a growing body of evidence pointing ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید