An experiment was conducted to measure DE and ME in copra (Cocos nucifera) meal (CM), palm kernel meal (PKM), and cassava (Manihot esculenta) root (CR) in growing pigs. Eight boars with an initial BW of 67.3 ± 5.8 kg were individually housed in metabolism crates that were equipped with a feeder and a nipple drinker. A replicated 4 × 4 Latin square design was used with 4 dietary treatments, 4 pe...

In the title compound, [Cr(C(29)H(30)P(2))(CO)(4)], the Cr atom is octa-hedrally coordinated by four carbonyl ligands and one bidentate phosphine ligand, which is bounded as a chelate in a cis position. The average Cr-P and Cr-C bond lengths are 2.377 and 1.865 Å, respectively.

Interactions of low-energy electrons with the FEBID precursor Cr(CO)6 have been investigated in a crossed electron-molecular beam setup coupled with a double focusing mass spectrometer with reverse geometry. Dissociative electron attachment leads to the formation of a series of anions by the loss of CO ligand units. The bare chromium anion is formed by electron capture at an electron energy of ...

Arthrobacter viscosus biomass was used for Cr(VI) biosorption. The effect of pH on Cr(VI) reduction and removal from aqueous solution was studied in the range of 1-4. The Cr(VI) removal involves both redox reaction and adsorption of metal ions on biomass surface. The removal rate of Cr(VI) was enhanced by very acid conditions, while higher solution pH values favored the removal of total chromiu...

We compared the efficacy and tolerability of controlled-release carbamazepine (CBZ-CR) with conventional carbamazepine (CBZ) in 131 epileptic patients (both men and women, ages 6-65 years) in an open, multicentre, cross-over trial. Patients entered into the trial were previously on CBZ monotherapy or polytherapy. During the first 4 weeks, patients were treated with equivalent daily doses of CBZ...

The minimum number of crossings for all drawings of a given graph G on a plane is called its crossing number, denoted cr(G). Exact crossing numbers are known only for a few families of graphs, and even the crossing number of a complete graph Km is not known for all m. Wenping et al. showed that cr(Km2Cn) > n · cr(Km+2) for n > 4 and m > 4. We adopt their method to find a lower bound for cr(G2Cn...