Intestinal glucose absorption but not endogenous glucose production differs between colostrum- and formula-fed neonatal calves

Glucose supply markedly changes during the transition to extrauterine life. In this study, we investigated diet effects on glucose metabolism in neonatal calves. Calves were fed colostrum (C; n = 7) or milk-based formula (F; n = 7) with similar nutrient content up to d 4 of life. Blood plasma samples were taken daily before feeding and 2 h after feeding on d 4 to measure glucose, lactate, nonesterified fatty acids, protein, urea, insulin, glucagon, and cortisol concentrations. On d 2, additional blood samples were taken to measure glucose first-pass uptake (FPU) and turnover by oral [U-(13)C]-glucose and i.v. [6,6-(2)H(2)]-glucose infusion. On d 3, endogenous glucose production and gluconeogenesis were determined by i.v. [U-(13)C]-glucose and oral deuterated water administration after overnight feed deprivation. Liver tissue was obtained 2 h after feeding on d 4 and glycogen concentration and activities and mRNA abundance of gluconeogenic enzymes were measured. Plasma glucose and protein concentrations and hepatic glycogen concentration were higher (P < 0.05), whereas plasma urea, glucagon, and cortisol (d 2) concentrations as well as hepatic pyruvate carboxylase mRNA level and activity were lower (P < 0.05) in group C than in group F. Orally administered [U-(13)C]-glucose in blood was higher (P < 0.05) but FPU tended to be lower (P < 0.1) in group C than in group F. The improved glucose status in group C resulted from enhanced oral glucose absorption. Metabolic and endocrine changes pointed to elevated amino acid degradation in group F, presumably to provide substrates to meet energy requirements and to compensate for impaired oral glucose uptake.

3CAM - A NOVEL TERNARY CONTENT ADDRESSABLE MEMORY USING THREE-VALUED LOGIC

Content Addressable Memory (CAM) is a special type of Complementary Metal-Oxide-Semiconductor (CMOS) storage element that allows for a parallel search operation on a memory stack in addition to the read and write operations yielded by a conventional SRAM storage array. In practice, it is often desirable to be able to store a “don’t care” state for faster searching operation. However, commercially available CAM chips are forced to accomplish this functionality by having to include two binary memory storage elements per CAM cell,which is a waste of precious area and power resources. This research presents a novel CAM circuit that achieves the “don’t care” functionality with a single ternary memory storage element. Using the recent development of multiple-voltage-threshold (MVT) CMOS transistors, the functionality of the proposed circuit is validated and characteristics for performance, power consumption, noise immunity, and silicon area are presented. This workpresents the following contributions to the field of CAM and ternary-valued logic:• We present a novel Simple Ternary Inverter (STI) transistor geometry scheme for achieving ternary-valued functionality in existing SOI-CMOS 0.18µm processes.• We present a novel Ternary Content Addressable Memory based on Three-Valued Logic (3CAM) as a single-storage-element CAM cell with “don’t care” functionality.• We explore the application of macro partitioning schemes to our proposed 3CAM array to observe the benefits and tradeoffs of architecture design in the context of power, delay, and area.

Lower complexity bounds in justification logic

Justification Logic studies epistemic and provability phenomena by introducing justifications/proofs into the language in the form of justification terms. Pure justification logics serve as counterparts of traditional modal epistemic logics, and hybrid logics combine epistemic modalities with justification terms. The computational complexity of pure justification logics is typically lower than that of the corresponding modal logics. Moreover, the so-called reflected fragments, which still contain complete information about the respective justification logics, are known to be in~NP for a wide range of justification logics, pure and hybrid alike. This paper shows that, under reasonable additional restrictions, these reflected fragments are NP-complete, thereby proving a matching lower bound. The proof method is then extended to provide a uniform proof that the corresponding full pure justification logics are $\Pi^p_2$-hard, reproving and generalizing an earlier result by Milnikel.