Relationship of Perceived Social Support to Readmission of the Congestive Heart Failure Patient

This study examined the relationship between perceived social support and the time between hospital admissions for congestive heart failure (CHF) patients based on Lazarus\u27 Stress and Coping Theory. A descriptive correlational design was used with a convenience sample of 40 inpatients aged 33-100 at a mid-western hospital. The Personal Resource Questionnaire was used to measure social support.; Data indicated that 50% of the sample were readmitted within 90 days of discharge. However, the hypothesized positive relationship between perceived social support and the number of days between admissions was not supported. Subjects\u27 age was related to time between admissions(r =.33, df = 38, p =.03). Implications for nursing are discussed

Implementing Fine/Medium Grained TLP Support in a Many-Core Architecture

Abstract. We believe that future many-core architectures should support a simple and scalable way to execute many threads that are generated by parallel programs. A good candidate to implement an efficient and scalable execution of threads is the DTA (Decoupled Threaded Architecture), which is designed to exploit fine/medium grained Thread Level Parallelism (TLP) by using a hardware scheduling unit and relying on existing simple cores. In this paper, we present an initial implementation of DTA concept in a many-core architecture where it interacts with other architectural components designed from scratch in order to address the problem of scalability. We present initial results that show the scalability of the solution that were obtained using a many-core simulator written in SARCSim (a variant of UNISIM) with DTA support

Process-induced skew reduction in nominal zero-skew clock trees

Abstract — This work develops an analytic framework for clock tree analysis considering process variations that is shown to correspond well with Monte Carlo results. The analysis frame-work is used in a new algorithm that constructs deterministic nominal zero-skew clock trees that have reduced sensitivity to process variation. The new algorithm uses a sampling approach to perform route embedding during a bottom-up merging phase, but does not select the best embedding until the top-down phase. This results in clock trees that exhibit a mean skew reduction of 32.4 % on average and a standard deviation reduction of 40.7 % as verified by Monte Carlo. The average increase in total clock tree capacitance is less than 0.02%. I