This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tasks with variable duration and heights. The resource function is no more constant but is a positive or negative piecewise linear function of time. Finally, a task is no more pre-assigned to one resource, but to a task corresponds...

Introducción. La biodisponibilidad de un nutriente refleja la fracción disponible para ser absorbido y utilizado. Resulta crítica al evaluar calidad nutricional alimento. Objetivo. Comparar bioaccesibilidad calcio entre el ajonjolí (Sesamun indicum) almendra (Prunus amygdalus) con leche vaca utilizando método in vitro. Métodos. Estudio tipo observacional que evaluó mediante vitro dializabilidad...

In the Big Data era, the gap between the storage performance and an application’s I/O requirement is increasing. I/O congestion caused by concurrent storage accesses from multiple applications is inevitable and severely harms the performance. Conventional approaches either focus on optimizing an application’s access pattern individually or handle I/O requests on a low-level storage layer withou...

The elaboration of exaggerated, sexually selected weapons and ornaments often comes at a cost to other traits. For instance, by sustaining the growth of an exaggerated weapon during development, shared and limited resources such as morphogens, growth factors, and nutrients may become depleted and limit the size to which other structures can grow. Such interactions are characteristic of resource...

Changes are needed in the way that visualization is performed, if we expect the analysis of scientific data to be effective at the petascale and beyond. By using similar techniques as those used to parallelize simulations, such as parallel I/O, load balancing, and effective use of interprocess communication, the supercomputers that compute these datasets can also serve as analysis and visualiza...

This report describes a novel parallel Multi-unit resource Deadlock Detection Algorithm (MDDA) and its hardware implementation (MDDU). The contributions are (i) the first O(1) hardware deadlock detection, (ii) reduced O(min(m,n)) preparation, where m and n are the number of processes and resources, respectively, and (iii) support for multi-unit resources. O(min(m,n)), previously O(m×n), is achi...