万年历还剩93年

手表显示日期看上去是一个基础简单的功能。但是每当碰到闰年、闰月的情况，大部分的机械手表都需要手动调整日期来纠正显示错误。为了解决这个技术上的难题，万年历手表诞生了。[编者按]     

Effect of profound hearing loss on a central auditory nucleus

The present study was designed to investigate the type and extent of degeneration occurring in the human central auditory system subsequent to profound hearing loss. The authors have examined the size of one population of neurons in the ventral cochlear nucleus in seven subjects with profound hearing loss (audiometric responses poorer than 90-100 dB HL). Six normal subjects, ages 35-78, were used as controls. Cell size in the hearing-impaired subjects ranged from normal to reduced by more than 50 percent. Two factors appear to contribute to the variability in cell size reduction. The correlation coefficient (Spearman rs) of cell size with duration of profound deafness was -0.48, indicating a moderate tendency for neurons to become smaller with longer periods of deafness. The correlation coefficient of cell size with number of surviving cochlear ganglion cells was 0.73, indicating a stronger tendency for neurons to be larger with greater eighth nerve innervation of the cochlear nucleus. Two cases of Scheibe degeneration showed the most severe degenerative change in the central auditory system.     

Caring for dying children: nurses' experiences

Interviews with 25 nurses in this grounded theory study show that when nurses recognized that a child's death was inevitable, they struggled with both grief distress and moral distress. Their distress occurred within the context of the nurse-patient relationship. Nurses employed a range of strategies to manage their distress. Several conditions facilitated or constrained nurses' strategies, and resulted in far-reaching implications both professionally and personally.     

Prophylactic efficacy of tilmicosin for bovine respiratory tract disease

The prophylactic administration of injectable tilmicosin for pneumonia in weaned beef calves was investigated in 1,806 animals. Comparisons were made among calves receiving an "on-arrival" injection of tilmicosin, calves receiving a single injection of long-acting oxytetracycline, and calves receiving no prophylaxis. Morbidity and mortality attributable to pneumonia, morbidity and mortality attributable to all causes, and case fatality were significantly lower in the group of calves that received tilmicosin, compared with calves that received long-acting oxytetracycline and calves that received no prophylactic antibiotic. Mean time to initial pneumonia treatment was significantly extended in calves that received prophylaxis, compared with those that received no antibiotic on arrival at the feedlot. Calves that received tilmicosin gained significantly more weight than calves that received oxytetracycline. Calves that were not treated for pneumonia during the trial period gained significantly more weight than did those calves that were treated for pneumonia regardless of experimental group. The majority of mortalities were attributable to fibrinous pneumonia (31/34). Important bacterial isolates (Pasteurella spp, Haemophilus somnus, Actinomyces pyogenes) obtained at necropsy did not have resistance to tilmicosin in association with administration of tilmicosin as prophylaxis for pneumonia. However, bacterial resistance to trimethoprim/sulfonamide and to oxytetracycline were commonly found in these postmortem isolates.     

Lower Bounds for Randomized Exclusive Write PRAMs

In this paper we study the question: How useful is randomization in speeding up Exclusive Write PRAM computations? Our results give further evidence that randomization is of limited use in these types of computations. First we examine a compaction problem on both the CREW and EREW PRAM models, and we present randomized lower bounds which match the best deterministic lower bounds known. (For the CREW PRAM model, the lower bound is asymptotically optimal.) These are the first nontrivial randomized lower bounds known for the compaction problem on these models. We show that our lower bounds also apply to the problem of approximate compaction. Next we examine the problem of computing boolean functions on the CREW PRAM model, and we present a randomized lower bound which improves on the previous best randomized lower bound for many boolean functions, including the OR function. (The previous lower bounds for these functions were asymptotically optimal, but we improve the constant multiplicative factor.) We also give an alternate proof for the randomized lower bound on PARITY, which was already optimal to within a constant additive factor. Lastly, we give a randomized lower bound for integer merging on an EREW PRAM which matches the best deterministic lower bound known. In all our proofs, we use the Random Adversary method, which has previously only been used for proving lower bounds on models with Concurrent Write capabilities. Thus this paper also serves to illustrate the power and generality of this method for proving parallel randomized lower bounds. Received October 2, 1995, and in final form January 29, 1997.