Effect of the Twisting Motion on the Nonunifornities of Transmyocardial Fiber Mechanics and Energy Demand A Theoretical Study

The contraction of the left ventricle (LV) is manifested by a distribution of strains and strain rates throughout the muscle thickness. Using a nested shell spheroidal model of the LV, which accounts for a fiber angle distribution from + 60°at the endocardium to ?60° at the epicardium, and the radial electrical activation pattern from the endocardium to the epicardium, it can be shown that endocardial layers undergo higher strains than the epicardial layers throughout the cardiac cycle, and higher length changes characterize the endocardial sarcomeres relative to the epicardial sarcomeres. However, the calculated nonuniformities in the sarcomeres' shortening are significantly moderated when the physiological twisting motion of the LV around the longitudinal axis is accounted for. Thus, the twisting motion of the heart is a basic mechanism by which the sarcomere function is maintained within its physiological range.     

Diversity of pituitary cells in primary cell culture. An immunocytochemical study

A bioassay system for rapid detection of carcinogenic agents has been developed using male Fischer 344 rats to bridge the gap between long-term carcinogenicity tests and short-term screening assays. The system, called the medium-term liver bioassay, is fundamentally based on the 2-stage hypothesis of tumor production, employing initiation by diethylnitrosamine (200 mg/kg, i.p.) in the first stage and test chemical administration during the second, in combination with two-thirds partial hepatectomy. It requires only 8 wk for animal experimentation and a further few weeks for quantitative analysis of immunohistochemically demonstrated glutathione S-transferase placental form positive hepatic foci. A total of 291 chemicals/substances have already been analyzed in our laboratory. Among 63 chemicals that were proved to be carcinogenic in the liver of rat and/or mouse, 57 (90%) gave positive results irrespective of their mutagenicity. Negative compounds include peroxisome proliferators and tamoxifen. Even nonhepatocarcinogens were positive at a rate of 24%. Eighty-six percent (12/14) of mouse liver carcinogens were also positive. On the other hand, only 2 out of 45 noncarcinogens showed very weak positivity. Thus, the efficacy of the system for hepatocarcinogens has been well established. This bioassay is increasingly regarded as an appropriate alternative test for carcinogenicity risk assessment and is practically used for a rapid evaluation of hepatocarcinogenicity of chemicals.     

Executing algorithms with hypercube topology on torusmulticomputers

Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact that the interconnection cost-per-node increases with the total number of nodes. From scalability point of view, meshes and toruses are more interesting classes of interconnection topologies. This paper focuses on the execution of algorithms with hypercube communication topology on multicomputers with mesh or torus interconnection topologies. The proposed approach is based on looking at different embeddings of hypercube graphs onto mesh or torus graphs. The paper concentrates on toruses since an already known embedding, which is called standard embedding, is optimal for meshes. In this paper, an embedding of hypercubes onto toruses of any given dimension is proposed. This novel embedding is called xor embedding. The paper presents a set of performance figures for both the standard and the xor embeddings and shows that the latter outperforms the former for any torus. In addition, it is proven that for a one-dimensional torus (a ring) the xor embedding is optimal in the sense that it minimizes the execution time of a class of parallel algorithms with hypercube topology. This class of algorithms is frequently found in real applications, such as FFT and some class of sorting algorithms     

The Gilbert-Holland FDTD thin slot model revisited: an alternative expression for the in-cell capacitance

This paper proposes an alternative expression for the in-cell capacitance of a photoelectrical cell (PEC)-mounted slot, which is the conceptual cornerstone of the Gilbert-Holland subcell finite difference time domain (FDTD) model. By treating a slightly modified electrostatic problem, the extraneous charge singularity on the PEC edges touching the cell, which is characteristic of the originally proposed model, is removed. The latter offers better physical grounds for a new expression of the capacitance and the effective permittivity used in the update equations. High resolution standard FDTD simulation results are presented in support of the new expression.     

Symbolic parametrization of curves

If algebraic varieties like curves or surfaces are to be manipulated by computers, it is essential to be able to represent these geometric objects in an appropriate way. For some applications an implicit representation by algebraic equations is desirable, whereas for others an explicit or parametric representation is more suitable. Therefore, transformation algorithms from one representation to the other are of utmost importance.We investigate the transformation of an implicit representation of a plane algebraic curve into a parametric representation. Various methods for computing a rational parametrization, if one exists, are described. As a new idea we introduce the concept of working with classes of conjugate (singular or simple) points on curves. All the necessary operations, like determining the multiplicity and the character of the singular points or passing a linear system of curves through these points, can be applied to such classes of conjugate points. Using this idea one can parametrize a curve if one knows only one simple point on it. We do not propose any new method for finding such a simple point. By classical methods a rational point on a rational curve can be computed, if such a point exists. Otherwise, one can express the coordinates of such a point in an algebraic extension of degree 2 over the ground field.     

Surface chemistry of tribochemical reactions explored in ultrahigh vacuum conditions

The thermal decomposition of model extreme-pressure lubricant additives on clean iron was studied in ultrahigh vacuum conditions using molecular beam strategies. Methylene chloride and chloroform react to deposit a solid film consisting of FeCl₂ and carbon, and evolve only hydrogen into the gas phase. No gas-phase products and less carbon on the surface are detected in the case of carbon tetrachloride. Dimethyl and diethyl disulfide react on clean iron to deposit a saturated sulfur plus carbon layer at low temperatures (∼600 K) and an iron sulfide film onto a Fe + C underlayer at higher temperatures (∼950 K). Methane is the only gas-phase product when dimethyl disulfide reacts with iron. Ethylene and hydrogen are detected when diethyl disulfide is used.     

The Berlekamp-Massey Algorithm revisited

We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to explain it in a simpler way and to adapt it to lazy evaluation. partially supported by the Galois Theory and Explicit Methods in Arithmetic Project HPRN-CT-2000-00114 partially supported by the European Union funded project RAAG CT-2001-00271     

Toward the Semantic Desktop: The seMouse Approach

Modern computers have enjoyed increasing storage capacity, but the mechanisms that harness this storage power haven't improved proportionally. Whether current desktops have scaled to handle the enormous number of files computers must handle compared to just a few years ago is doubtful at best. Scalability includes not only fault tolerance or performance stability of tools for users to harness this power. The lack of appropriate structures and tools for locating, navigating, relating, and sharing bulky file sets is preventing users from harnessing their PCs' full storage power. Powering desktops with metadata, leading to the semantic desktop, is a promising way to realize this potential. The seMouse approach realizes the promising vision of the semantic desktop. This approach provides seamless integration between file-centered tooling and semantically aware, resource-centered applications.