Effects of 17 beta-estradiol on nitric oxide and ventricular myocardium metabolism

BACKGROUND: Arrhythmias are frequent pathology in patients with chronic hemodialysis. We evaluated whether a relatively new technique, signal averaging, could be useful in predicting the development of complex arrhythmias in these patients. METHODS: Thirty-three patients, 18 male and 15 female, subjected to thrice weekly chronic hemodialytic treatment with various dialysis techniques, were studied. Exclusion criteria were the presence of antiarrhythmic and inotropic treatment. The following examinations were carried out in all patients: a Holter dynamic electrocardiography for a duration of 24 hours, begun on the day of dialysis, high resolution ECG pre- and post-dialysis to find out if there were any ventricular late potential (VLP). Four hundred beats were examined in order to obtain a background noise of less than 0.7 microV and a better definition of the signal. The following parameters were considered significant for the presence of VLP: a) filtered QRS duration > 120 msec; b) the root mean square of the signal expressed in the terminal portion of QRS (RMS) < 25 microV) high frequency low amplitude signals duration (HFLA) > 40 msec. A positive value in two of these parameters was considered indicative of the presence of VLP. In addition various pre and post-dialysis indices of dialytic efficiency and a mono and two-dimensional echocardiogram with pulsed and color Doppler were carried out. Of the 33 patients studied, ten were excluded because they presented too high a background noise at the high resolution ECG. Of the remaining 23 patients, 13 (56%) presented VLP and nine of these (69%) presented complex arrhythmias. Of the ten patients without VLP, 5 (50%) presented complex arrhythmias. The incidence of arrhythmias was highest during the last two hours of dialysis and in the two hours following it. The patients were then divided into two groups (A and B) according to the ejection fraction (EF) found at the echocardiogram. Group A was composed of 17 patients of whom 8 (47%) presented complex arrhythmias; group B (EF < 45%) was composed of the remaining six patients, who all presented complex arrhythmias. In group A nine patients (53%) out of 17 had LVP, in group B four out of six (66%) had it. All the patients except one presented an increase in the thickness of the ventricular wall and alterations of Doppler transmitral filling rate. Left ventricular hypertrophy was diagnosed in 22 out of the 23 patients. Four patients also had chronic ischaemic heart disease; of these three had LVP. There was no correlation between the presence of LVP and the hemodialytic indices and between the latter and complex arrhythmias. CONCLUSIONS: Our study showed that arrhythmias are more frequent in patients with LVP before dialysis than in those without. The difference was statistically significant (p < 0.006); the incidence of arrhythmias was higher in patients with FE < 45% (p < 0.001). The majority of patients (95%) had left ventricular hypertrophy; only four (17%) had ischaemic heart disease too. It is highly probable that the presence of LVP in our patients can be attributed to hypertension and subsequent left ventricular hypertrophy. As patients with LVP at the end of dialysis had a greater incidence of arrhythmias than those without LVP, we suggest that this method could be useful as a first screening in dialysed patients.     

Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

Processor membership in asynchronous distributed systems

Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols     

The classification, fusion, and parallelization of array languageprimitives

We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators     

Unicast-based multicast communication in wormhole-routed networks

Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log ₂ m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given     

Quantization effects in digitally behaving circuit implementationsof Kohonen networks

Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation.     

On the design of dynamic associative neural memories

We consider the design problem for a class of discrete-time and continuous-time neural networks. We obtain a characterization of all connection weights that store a given set of vectors into the network, that is, each given vector becomes an equilibrium point of the network. We also give sufficient conditions that guarantee the asymptotic stability of these equilibrium points.     

The design, fabrication, and testing of corrugated silicon nitridediaphragms

Silicon nitride corrugated diaphragms of 2 mm×2 mm×1 μm have been fabricated with 8 circular corrugations, having depths of 4, 10, or 14 μm. The diaphragms with 4-μm-deep corrugations show a measured mechanical sensitivity (increase in the deflection over the increase in the applied pressure) which is 25 times larger than the mechanical sensitivity of flat diaphragms of equal size and thickness. Since this gain in sensitivity is due to reduction of the initial stress, the sensitivity can only increase in the case of diaphragms with initial stress. A simple analytical model has been proposed that takes the influence of initial tensile stress into account. The model predicts that the presence of corrugations increases the sensitivity of the diaphragms, because the initial diaphragm stress is reduced. The model also predicts that for corrugations with a larger depth the sensitivity decreases, because the bending stiffness of the corrugations then becomes dominant. These predictions have been confirmed by experiments. The application of corrugated diaphragms offers the possibility to control the sensitivity of thin diaphragms by geometrical parameters, thus eliminating the effect of variations in the initial stress, due to variations in the diaphragm deposition process and/or the influence of temperature changes and packaging stress