this study was conducted to compare digestibility of wheat straw (ws) by fungi and whole rumen microorganisms (wrm). dry matter (dm), neutral and acid detergent fiber (ndf and adf) digestibility of ws were compared with in vitro digestion (ivd), gas production (gp) and specific rumen anaerobic fungi culture (srafc). dry matter, ndf and adf digestibility of ws by wrm of buffalo (60.80, 49.93 and...

Data parallel languages, like High Performance Fortran (HPF), support the notion of distributed arrays. However, the implementation of such distributed array structures and their access on message passing computers is not straightforward. This holds especially for distributed arrays that are aligned to each other and given a block-cyclic distribution. In this paper, an implementation framework ...

In this paper, we investigate the applicability of backtrack technique to solve the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtrack algorithm for the face enumeration problem whose space complexity is polynomial in the input size, but the vertex enumeration problem require...

In 2014, the orthogonalized integer representation was proposed independently by Ding et al. using genetic algorithm and Fukase et al. using sampling technique to solve SVP. Their results are promising. In this paper, we consider sparse orthogonalized integer representations for shortest vectors and propose a new enumeration method, called orthognalized enumeration, by integrating such a repres...

In this paper, we study efficient computation of tree similarity for ordered trees based on compressed subtree enumeration. The compressed subtree enumeration is a new paradigm of enumeration algorithms that enumerates all subtrees of an input tree T in the form of their compressed bit signatures. For the task of enumerating all compressed bit signatures of k-subtrees in an ordered tree T , we ...

In technology mapping, enumeration of subcircuits or cuts to be replaced by a standard cell is an important step that decides both the quality of the solution and execution speed. In this work, we view cuts as set of edges instead of as set of nodes and based on it, provide a classification of cuts. It is shown that if enumeration is restricted to a subclass of cuts called unidirectional cuts, ...

We study Kalimullin pairs, a definable class (of pairs) of enumeration degrees that has been used to give first-order definitions of other important classes and relations, including the enumeration jump and the total enumeration degrees. We show that the global definition of Kalimullin pairs is also valid in the local structure of the enumeration degrees, giving a simpler local definition than ...

Two models that predict the relation between mean enumeration time and numerosity in a speeded enumeration experiment are tested. The first is a bilinear two-process model, and the second is a log-linear single-process model. Previously, support for the bilinear model has provided evidence for the existence of a unique numerical ability called "subitizing." Both models are shown to yield close ...

The local structure of the enumeration degrees Ge is the partially ordered set of the enumeration degrees below the first jump 0e of the least enumeration degree 0e. Cooper [3] shows that Ge consists exactly of the Σ2 enumeration degrees, degrees which contain Σ2 sets, or equivalently consist entirely of Σ 0 2 sets. In investigating structural complexity of Ge, the natural question of what othe...

Articulatory suppression (repeatedly pronouncing a syllable or word while carrying out another task) is thought to interfere selectively with the phonological store in working memory. Although suppression interferes with temporal enumeration (enumerating successive light flashes), to date there has been little evidence of such interference in spatial enumeration (enumerating units laid out in s...