Patient education for discharge after coronary bypass surgery in the 1990s: are patients adequately prepared?

Short hospitalizations for patients undergoing coronary artery bypass grafting (CABG) require continuous nursing evaluation of patients' discharge education. Six institutions collaborated in surveying 300 postoperative patients with CABG to identify learning priorities and patients' perceptions of the effectiveness of discharge education. Data analysis from the self-administered questionnaire demonstrated consistent patient priorities across institutions. Differences in teaching methods and content did not affect perceived preparedness or importance scores. Regional experience demonstrates that variable teaching efforts meet patients' priorities and provide high overall patient preparedness for discharge. Patients with the shortest hospitalizations had higher preparedness scores.     

An analysis of program and family costs of case managed care for technology-dependent infants with bronchopulmonary dysplasia

Influenza caused low levels of mortality and morbidity in England and Wales in the 1997/98 season. Influenza viruses of the H3N2 and H1N1 subtypes were isolated in small numbers from community and hospital patients in November and December. Their numbers subsequently increased to peak in February, H1N1 a week or two before H3N2. Most of the H1N1 isolates were similar to the A/Bayern/7/95-like virus, included in the vaccine recommended for 1997-98, whereas most H3N2 isolates were A/Sydney/5/97-like, a virus not covered by the season's vaccine but recommended for 1998/99. Consultation rates in general practice for influenza-like illnesses remained low until early February, when a small increase coincided with the increase in laboratory confirmed influenza. Fewer deaths directly attributed to influenza were registered during the surveillance period than in recent years. Localised outbreaks occurred in schools and nursing homes towards the end of the winter.     

Genetic basis of neurological tumours

Neurological tumours are common neoplasms of both adults and children. Recent studies have begun to delineate the genetic abnormalities that underlie such tumours, and have implicated two classes of genes, oncogenes and tumour suppressor genes. Most investigations have focused on those astrocytomas that affect the cerebral hemispheres of adults, since these are the most common and malignant brain tumours. The high-grade astrocytomas that affect adults, such as glioblastoma multiforme, often have amplification of the epidermal growth factor receptor (EGFR) oncogene and loss of a variety of chromosomal loci that probably harbour tumour suppressor genes. Of the various tumour suppressor gene loci, the p53 gene on chromosome 17p has been studied most closely and has been shown to be mutated in both low- and high-grade astrocytomas. These genetic alterations may provide a means for subdividing astrocytomas into diagnostic categories. For instance, p53 gene mutations occur more commonly in glioblastomas from young adults and women, while EGFR gene amplification is more common in glioblastomas from older adults and men. For the other primary CNS tumours, genetic studies remain in their infancy. The neurocutaneous syndromes, such as neurofibromatosis types 1 and 2, have provided unique insights into neurological oncogenesis. The NF1 gene on chromosomes 17q and its product, neurofibromin, may be important in the formation of neurofibrosarcomas, while the NF2 gene on chromosome 22q and its product, merlin, are probably involved in the formation of schwannomas and other nervous system tumours. The further characterization of these and other neurological tumour genes will undoubtedly illuminate many other areas in neurooncology.     

Incorporating statistical information into expert classification systems to reduce classification costs

Interactive expert systems seek relevant information from a user in order to answer a query or to solve a problem that the user has posed. A fundamental design issue for such a system is therefore itsinformation-seeking strategy, which determines the order in which it asks questions or performs experiments to gain the information that it needs to respond to the user. This paper examines the problem of optimal knowledge acquisition through questioning in contexts where it is expensive or time-consuming to obtain the answers to questions. An abstract model of an expert classification system — considered as a set of logical classification rules supplemented by some statistical knowledge about attribute frequencies — is developed and applied to analyze the complexity and to present constructive algorithms for doing probabilistic question-based classification. New heuristics are presented that generalize previous results for optimal identification keys and questionnaires. For an important class of discrete discriminant analysis problems, these heuristics find optimal or near-optimal questioning strategies in a small fraction of the time required by an exact solution algorithm.     

Algorithms and complexity concerning the preemptive scheduling of periodic,real-time tasks on one processor

We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give, as our main lemma, both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions cannot, in general, be tested efficiently (unless P=NP), they do allow us to give efficient algorithms for deciding feasibility on one processor for certain types of periodic task systems. For example, we give a pseudo-polynomial-time algorithm for synchronous systems whose densities are bounded by a fixed constant less than 1. This algorithm represents an exponential improvement over the previous best algorithm. We also give a polynomial-time algorithm for systems having a fixed number of distinct types of tasks. Furthermore, we are able to use our main lemma to show that the feasibility problem for task systems on one processor is co-NP-complete in the strong sence. In order to show this last result, we first show the Simultaneous Congruences Problem to be NP-complete in the strong sense. Both of these last two results answer questions that have been open for ten years. We conclude by showing that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ₂ ^p -complete.This work was supported in part by National Science Foundation Grant No. CCR-8711579. Some of these results were presented at the 15th Symposium on Mathematical Foundations of Computer Science, 1990.     

Transporting Deformations of Face Emotions in the Shape Spaces: A Comparison of Different Approaches

Studying the changes of shape is a common concern in many scientific fields. We address here two problems: (1) quantifying the deformation between two given shapes and (2) transporting this deformation to morph a third shape. These operations can be done with or without point correspondence, depending on the availability of a surface matching algorithm, and on the type of mathematical procedure adopted. In computer vision, the re-targeting of emotions mapped on faces is a common application. We contrast here four different methods used for transporting the deformation toward a target once it was estimated upon the matching of two shapes. These methods come from very different fields such as computational anatomy, computer vision and biology. We used the large diffeomorphic deformation metric mapping and thin plate spline, in order to estimate deformations in a deformational trajectory of a human face experiencing different emotions. Then we use naive transport (NT), linear shift (LS), direct transport (DT) and fanning scheme (FS) to transport the estimated deformations toward four alien faces constituted by 240 homologous points and identifying a triangulation structure of 416 triangles. We used both local and global criteria for evaluating the performance of the 4 methods, e.g., the maintenance of the original deformation. We found DT, LS and FS very effective in recovering the original deformation while NT fails under several aspects in transporting the shape change. As the best method may differ depending on the application, we recommend carefully testing different methods in order to choose the best one for any specific application.

     

The role of visual complexity and prototypicality regarding first impression of websites: Working towards understanding aesthetic judgments

This paper experimentally investigates the role of visual complexity (VC) and prototypicality (PT) as design factors of websites, shaping users' first impressions by means of two studies. In the first study, 119 screenshots of real websites varying in VC (low vs. medium vs. high) and PT (low vs. high) were rated on perceived aesthetics. Screenshot presentation time was varied as a between-subject factor (50 ms vs. 500 ms vs. 1000 ms). Results reveal that VC and PT affect participants' aesthetics ratings within the first 50 ms of exposure. In the second study presentation times were shortened to 17, 33 and 50 ms. Results suggest that VC and PT affect aesthetic perception even within 17 ms, though the effect of PT is less pronounced than the one of VC. With increasing presentation time the effect of PT becomes as influential as the VC effect. This supports the reasoning of the information-processing stage model of aesthetic processing (Leder et al., 2004), where VC is processed at an earlier stage than PT. Overall, websites with low VC and high PT were perceived as highly appealing.     

EASEA: specification and execution of evolutionary algorithms on GPGPU

EASEA is a framework designed to help non-expert programmers to optimize their problems by evolutionary computation. It allows to generate code targeted for standard CPU architectures, GPGPU-equipped machines as well as distributed memory clusters. In this paper, EASEA is presented by its underlying algorithms and by some example problems. Achievable speedups are also shown onto different NVIDIA GPGPUs cards for different optimization algorithm families.     

Archiving the web using page changes patterns: a case study

A pattern is a model or a template used to summarize and describe the behavior (or the trend) of data having generally some recurrent events. Patterns have received a considerable attention in recent years and were widely studied in the data mining field. Various pattern mining approaches have been proposed and used for different applications such as network monitoring, moving object tracking, financial or medical data analysis, scientific data processing, etc. In these different contexts, discovered patterns were useful to detect anomalies, to predict data behavior (or trend) or, more generally, to simplify data processing or to improve system performance. However, to the best of our knowledge, patterns have never been used in the context of Web archiving. Web archiving is the process of continuously collecting and preserving portions of the World Wide Web for future generations. In this paper, we show how patterns of page changes can be useful tools to efficiently archive Websites. We first define our pattern model that describes the importance of page changes. Then, we present the strategy used to (i) extract the temporal evolution of page changes, (ii) discover patterns, to (iii) exploit them to improve Web archives. The archive of French public TV channels France Télévisions is chosen as a case study to validate our approach. Our experimental evaluation based on real Web pages shows the utility of patterns to improve archive quality and to optimize indexing or storing.