Zur härtung von diandiglycidylether mit anhydridmodifizierten phenolischen härtern und zu vergleichbaren in situ-reaktionen

The curing of diglycidyl ether of bisphenol A (DGEBA) with 2,6-dimethylol-p-cresol modified by hexahydrophthalic acid anhydride was investigated and compared with the analogous in situ curing of DGEBA, hexahydrophthalic acid anhydride and 2,6-dimethylol-p-cresol. The chemical reactions were investigated by means of titration and different spectroscopic and chromatographic methods. It was examined whether the less complicated and therefore cheaper in situ reaction delivers postcured products with equal or better properties. Furthermore, it was investigated whether the results are similar using technical phenolic hardeners.     

Holocaust survivors and escapees: Their strengths.

The conclusions clinicians have drawn about Holocaust survivors over the last 50 yrs differ sharply from researchers' findings. It is important to evaluate these discrepancies since different perceptions of survivors affect treatment approaches. The researchers' view, stressing the survivor's resilience and resourcefulness, contrasts with clinical impressions centering on a survivor syndrome involving deep emotional disturbances as residues of the Holocaust experience. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Elderly men with cancer: social work interventions in prostate cancer

Prostate cancer requires the attention of social workers in health care for three reasons: the growing elderly population which will increase the number diagnosed, the recent introduction of new treatments and the lack of social acceptability for this condition. Interventions for prostate cancer are specific to the stage of the disease. These individual, family and group interventions are a model for social work services to elderly men with other forms of cancer. Social workers have opportunity to research quality of life and decision-making issues to enhance medical practise in prostate cancer.     

A competitive study of the pseudoflow algorithm for the minimum <Emphasis Type="Italic">s</Emphasis>–<Emphasis Type="Italic">t</Emphasis> cut problem in vision applications

Rapid advances in image acquisition and storage technology underline the need for real-time algorithms that are capable of solving large-scale image processing and computer-vision problems. The minimum s–t cut problem, which is a classical combinatorial optimization problem, is a prominent building block in many vision and imaging algorithms such as video segmentation, co-segmentation, stereo vision, multi-view reconstruction, and surface fitting to name a few. That is why finding a real-time algorithm which optimally solves this problem is of great importance. In this paper, we introduce to computer vision the Hochbaum’s pseudoflow (HPF) algorithm, which optimally solves the minimum s–t cut problem. We compare the performance of HPF, in terms of execution times and memory utilization, with three leading published algorithms: (1) Goldberg’s and Tarjan’s Push-Relabel; (2) Boykov’s and Kolmogorov’s augmenting paths; and (3) Goldberg’s partial augment-relabel. While the common practice in computer-vision is to use either BK or PRF algorithms for solving the problem, our results demonstrate that, in general, HPF algorithm is more efficient and utilizes less memory than these three algorithms. This strongly suggests that HPF is a great option for many real-time computer-vision problems that require solving the minimum s–t cut problem.     

Automatic boosting of cross-product coverage using Bayesian networks

Closing the feedback loop from coverage data to the stimuli generator is one of the main challenges in the verification process. Typically, verification engineers with deep domain knowledge manually prepare a set of stimuli generation directives for that purpose. Bayesian networks based CDG (coverage directed generation) systems have been successfully used to assist the process by automatically closing this feedback loop. However, constructing these CDG systems requires manual effort and a certain amount of domain knowledge from a machine learning specialist. We propose a new method that boosts coverage in the early stages of the verification process with minimal effort, namely a fully automatic construction of a CDG system that requires no domain knowledge. Experimental results on a real-life cross-product coverage model demonstrate the efficiency of the proposed method.     

Hybrid visualization for white matter tracts using triangle strips and point sprites

Diffusion tensor imaging is of high value in neurosurgery, providing information about the location of white matter tracts in the human brain. For their reconstruction, streamline techniques commonly referred to as fiber tracking model the underlying fiber structures and have therefore gained interest. To meet the requirements of surgical planning and to overcome the visual limitations of line representations, a new real-time visualization approach of high visual quality is introduced. For this purpose, textured triangle strips and point sprites are combined in a hybrid strategy employing GPU programming. The triangle strips follow the fiber streamlines and are textured to obtain a tube-like appearance. A vertex program is used to orient the triangle strips towards the camera. In order to avoid triangle flipping in case of fiber segments where the viewing and segment direction are parallel, a correct visual representation is achieved in these areas by chains of point sprites. As a result, a high quality visualization similar to tubes is provided allowing for interactive multimodal inspection. Overall, the presented approach is faster than existing techniques of similar visualization quality and at the same time allows for real-time rendering of dense bundles encompassing a high number of fibers, which is of high importance for diagnosis and surgical planning.     

A transfer matrix model of large deformations of curved rods

Transfer matrix models have been frequently used to analyze the structural behavior of rods, including curved and pretwisted ones. The advantages of these models include their relative simplicity, numerical efficiency and ease of implementation. Previous investigations did not include nonlinear analyses of curved rods that undergo large deformations. The present paper describes a nonlinear transfer matrix model of curved and pretwisted rods, which is capable of analyzing very large spatial deformations. The rod is divided into segments. A body system of coordinates is attached to each segment. This system translates and rotates with the segment during the deformation. If the segments are kept small enough, the local deformations of each segment, relative to its body system of coordinates, are small. The segments’ systems of coordinates rotate relative to their neighbors and if this rotation is dealt with properly, large rotations and displacement of the curved rod can be analyzed. In spite of its nonlinear nature, the model remains relatively simple and efficient. The new model is used to solve a few problems and the results show very good agreement with other analytical, finite-element, and experimental results.     

The Key Enzyme of the Sialic Acid Metabolism Is Involved in Embryoid Body Formation and Expression of Marker Genes of Germ Layer Formation

The bi-functional enzyme UDP-N-acetyl-2-epimerase/N-acetylmannosamine kinase (GNE) is the key enzyme of the sialic acid biosynthesis. Sialic acids are negatively charged nine carbon amino sugars and are found on most glycoproteins and many glycolipids in terminal positions, where they are involved in a variety of biological important molecular interactions. Inactivation of the GNE by homologous recombination results in early embryonic lethality in mice. Here, we report that GNE-deficient embryonic stem cells express less differentiation markers compared to wild-type embryonic stem cells. As a result, GNE-deficient embryonic stem cells fail to form proper embryoid bodies (EB) within the first day of culture. However, when culturing these cells in the presence of sialic acids for three days, also GNE-deficient embryonic stem cells form normal EBs. In contrast, when culturing these cells in sialic acid reduced medium, GNE-deficient embryonic stem cells proliferate faster and form larger EBs without any change in the expression of markers of the germ layers.     

Organizational memory information systems: a transactive memory approach

Effective management of organizational memory (OM) is critical to collaboration and knowledge sharing in organizations. We present a framework for managing organizational memory based on transactive memory, a mechanism of collective memory in small groups. While being effective in small groups, there are difficulties hindering the extension of transactive memory to larger groups. We claim that information technology can be used to help overcome these difficulties. We present a formal architecture for directories of meta-memories required in extended transactive memory systems and propose the use of meta-knowledge to substitute for the lack of tacit group knowledge that exists in small groups.     

Nearly optimal perfectly periodic schedules

We consider the problem of scheduling a set of pages on a single broadcast channel using time-multiplexing. In a perfectly periodic schedule, time is divided into equal size slots, and each page is transmitted in a time slot precisely every fixed interval of time (the period of the page). We study the case in which each page i has a given demand probability , and the goal is to design a perfectly periodic schedule that minimizes the average time a random client waits until its page is transmitted. We seek approximate polynomial solutions. Approximation bounds are obtained by comparing the costs of a solution provided by an algorithm and a solution to a relaxed (non-integral) version of the problem. A key quantity in our methodology is a fraction we denote by , that depends on the maximum demand probability: . The best known polynomial algorithm to date guarantees an approximation of . In this paper, we develop a tree-based methodology for perfectly periodic scheduling, and using new techniques, we derive algorithms with better bounds. For small values, our best algorithm guarantees approximation of . On the other hand, we show that the integrality gap between the cost of any perfectly periodic schedule and the cost of the fractional problem is at least . We also provide algorithms with good performance guarantees for large values of . Received: December 2001 / Accepted: September 2002