this study was conducted to determine the chemical composition, metabolizable energy, digestibility and ability of gas production of poa trivialis. samples was collected at three phenological stages including: vegetative growth, flowering and seedling on two different elevations of 1300 to 1500 m and 2000 to 1800 m asl in neor and hir region as the first and second sites, respectively. testing ...

Over the last 50 years the world’s population and industrialization have soared leading to increased resource use, pollution and waste, and in turn to problems including raw materials shortage and unsustainable increases in landfill areas environmental, social and economic expectation stakeholders of the company every day more and more. Designing products with reuse at end of life in mind is a ...

There is a very long tradition in designing color palettes for various applications, going back to at least the Upanishad. Although color palettes have been influenced by the available colorants, starting with the advent of aniline dyes in the late 1850s there have been few physical limits on the choice of individual colors. This abundance of choices exacerbates the problem of limiting the numb...

Very recently a new method has been developed for finding lower bounds on the maximum number of codewords possible in a code of minimum distance d and length n . This method has led in turn to a number of interesting questions in graph theory and additive number theory. In this brief survey we summarize some of these developments. -/ * Visiting Professor, Computer Science Department, Stanford U...

Based on the harmonious unifying hybrid preferential model (HUHPM) network proposed by our group, the entropy characteristic of an un-weighted HUHPM-BA network and a weighted HUHPM-BBV network are investigated as the total hybrid ratio d/r is changed. We derive and compute the general relation of the power exponent of the degree distribution with the entropy by using the Boltzmann-Gibbs entropy...

We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit harmonious labellings. A graceful labelling of a graph G with q edges is an injection f : V (G) → {0, 1, 2, . . . , q} such that when each edge xy ∈ E(G) is assigned the label, |f(x) − f(y)|, all of the edge labels are distinct. A graph which admits a graceful labelling is sai...