In this paper, a temporal partitioning algorithm is presented which partitions data flow graphs in a realtime domain. Timing constraint is a critical factor in temporal partitioning of real-time reconfigurable design. An incremental algorithm is presented to partition data flow graphs while meeting the timing constraints by obtaining the target number of partitions. In addition, the proposed al...

This study was aimed to evaluate the correlation between in vitro fermentation and in situ degradation parameters and to predict dry matter degradability and energy protein synchronization of roughage based diets. Different inclusion of roughage in diets [roughage 50% diet (R50D), roughage 60% diet (R60D), roughage 65% diet (R65D) and roughage ...

This study aimed to identify chemical composition of Thymus kotschyanus essential oil (TKEO) and to evaluate the effects of different doses of TKEO on in vitro gas production, fermentation parameters, acidosis and protozoal population using a completely randomized design with four replicates. Two diets (D1: 100% forage and D2: 30% forage+70% concentrate) were incubated with buffered rumen fluid...

This paper examines a number of broad-phase optimisations which can be used to improve the performance of collision detection in dynamic simulations. Specific focus is placed on hierarchical spatial partitioning techniques such as the octree, k-d tree and binary space partitioning (BSP) tree. A number of experiments are conducted using this subset of partitioning methods in order to evaluate th...

[1] Numerical studies have indicated that the steady‐state ocean‐atmosphere partitioning of carbon will change profoundly as emissions continue. In particular, the globally averaged Revelle buffer factor will first increase and then decrease at higher emissions. Furthermore, atmospheric carbon will initially grow exponentially with emission size, after which it will depend linearly on emissions...

We discuss the mesh-partitioning load-balancing problem for non-homogeneous communication systems, and investigate whether the MPI process topology functionality can aid in solving the problem. An example kernel shows that specific communication patterns can benefit substantially from a non-trivial MPI topology implementation, achieving improvements beyond a factor of five for certain system co...

Efficient retrieval of multimedia objects is a key factor for the success of distributed multimedia databases. One way to provide faster access to multimedia objects in these databases is using vertical partitioning. In this paper, we present a vertical partitioning algorithm for distributed multimedia databases (MAVP) that takes into account the size of the multimedia objects in order to gener...

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...