Four methods were adopted, including the mobile nylon bag (MNB) method, modified three-step in vitro (MTS) method, original three-step in vitro (OTS) method, and acid detergent insoluble nitrogen (ADIN) estimating method, to evaluate the intestinal digestibility of rumen undegradable protein (DRUP) of 10 types of concentrates and 7 types of roughages. After correlation analysis to determine the...

Eighty-nine samples, 45 of standing forage and 44 of baled hay, were collected from alfalfa harvested at various maturities over three cuttings each during 2 yr. Alfalfa was cut and conditioned mechanically; samples of standing forage were collected by removing bunches of forage from windrows and freeze-drying them. Forage was allowed to field cure and was harvested at an average 80% DM as smal...

We prove an identity conjectured by Adin and Roichman involving the descent set of λ-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are usually proven algebraically. Here, we give a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set ...

Introduction: The most important limitation of 5-aminolevulinic acid (5-ALA)-induced photodynamic therapy (PDT) is the efficacy of the cells in converting 5-ALA to protoporphyrin IX. The present study aimed to investigate the effectiveness of silver nanoparticles (AgNPs) with the photosensitivity at the surface plasmon resonance wavelength on 5-ALA-mediated PDT. Material and Methods: First of a...

Our work is based on the premise that analysis of the connections exploited by a recommender algorithm can provide insight into the algorithm that could be useful to predict its performance in a fielded system. We use the jumping connections model defined by Mirza et al. [6], which describes the recommendation process in terms of graphs. Here we discuss our work that has come out of trying to u...

Given an integer s ≥ 0 and a permutation π ∈ Sn, let Γπ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and there are at most s integers k, i < k < j, such that π = [. . . j . . . k . . . i . . .]. In this short paper we determine the maximum number of edges in Γπ,s for all s ≥ 1 and characterize all permutations π which ach...