Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems using SIMULA

The stimulation technique has gained much importance in the performance studies of Concurrency Control (CC) algorithms for distributed database systems. However, details regarding the simulation methodology and implementation are seldom mentioned in the literature. One objective of this paper is to elaborate the simulation methodology using SIMULA. Detailed studies have been carried out on a centralised CC algorithm and its modified version. The results compare well with a previously reported study on these algorithms. Here, additional results concerning the update intensiveness of transactions and the degree of conflict are obtained. The degree of conflict is quantitatively measured and it is seen to be a useful performance index. Regression analysis has been carried out on the results, and an optimisation study using the regression model has been performed to minimise the response time. Such a study may prove useful for the design of distributed database systems.

Heat exposure and hypothyroid conditions decrease hydrogen peroxide generation in liver mitochondria

Exposure of rats to heat (39 +/- 1 degree C) decreased H2O2 generation in mitochondria of the liver, but not of the kidney or the heart. The effect was obtained with three substrates, succinate, glycerol 1-phosphate and choline, with a decrease to 50% in the first 2-3 days of exposure, and a further decrease on longer exposure. The dehydrogenase activity with only glycerol 1-phosphate decreased, which is indicative of the hypothyroid condition, whereas choline dehydrogenase activity remained unchanged and that of succinate dehydrogenase decreased on long exposure. The serum concentration of thyroxine decreased in heat-exposed rats. Thyroxine treatment of rats increased H2O2 generation. Hypothyroid conditions obtained by treatment with propylthiouracil or thyroidectomy caused a decrease in H2O2 generation and changes in dehydrogenase activities similar to those with heat exposure. Treatment of heat-exposed or thyroidectomized rats with thyroxine stimulated H2O2 generation by a mechanism apparently involving fresh protein synthesis. The results indicate that H2O2 generation in mitochondria of heat-exposed animals is determined by thyroid status.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

A new analytical approach to optimize a generation schedule

Identification of the optimum generation schedule by various methods of coordinating incremental generation costs and incremental transmission losses has been described previously in the literature. This paper presents an analytical approach which reduces the time-consuming iterative procedure into a mere positive-root determination of a third-order polynomial in λ. This approach includes the effect of transmission losses and is suitable for systems with any number of plants. The validity and effectiveness of this method are demonstrated by analysing a sample system.

Two Tools for Interprocess Communication in Distributed Data-Flow Systems

Abstract is not available.

Implementation of CSP-S for description of distributed algorithms

The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.

Generation of rotationally dominated galaxies by mergers of pressure-supported progenitors

Through the analysis of a set of numerical simulations of major mergers between initially non-rotating, pressure-supported progenitor galaxies with a range of central mass concentrations, we have shown that: (1) it is possible to generate elliptical-like galaxies, with outside one effective radius, as a result of the conversion of orbital- into internal-angular momentum; (2) the outer regions acquire part of the angular momentum first; (3) both the baryonic and the dark matter components of the remnant galaxy acquire part of the angular momentum, the relative fractions depending on the initial concentration of the merging galaxies. For this conversion to occur the initial baryonic component must be sufficiently dense and/or the encounter should take place on an orbit with high angular momentum. Systems with these hybrid properties have recently been observed through a combination of stellar absorption lines and planetary nebulae for kinematic studies of early-type galaxies. Our results are in qualitative agreement with these observations and demonstrate that even mergers composed of non rotating, pressure-supported progenitor galaxies can produce early-type galaxies with significant rotation at large radii.

Worst-Case Asymmetric Distributed Source Coding

We consider the asymmetric distributed source coding problem, where the recipient interactively communicates with N correlated informants to gather their data. We are mainly interested in minimizing the worst-case number of informant bits required for successful data-gathering at recipient, but we are also concerned with minimizing the number of rounds as well as the number of recipient bits. We provide two algorithms, one that optimally minimizes the number of informant bits and other that trades-off the number of informant bits to efficiently reduce the number of rounds and number of recipient bits.

Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes

Database schemes can be viewed as hypergraphs with individual relation schemes corresponding to the edges of a hypergraph. Under this setting, a new class of "acyclic" database schemes was recently introduced and was shown to have a claim to a number of desirable properties. However, unlike the case of ordinary undirected graphs, there are several unequivalent notions of acyclicity of hypergraphs. Of special interest among these are agr-, beta-, and gamma-, degrees of acyclicity, each characterizing an equivalence class of desirable properties for database schemes, represented as hypergraphs. In this paper, two complementary approaches to designing beta-acyclic database schemes have been presented. For the first part, a new notion called "independent cycle" is introduced. Based on this, a criterion for beta-acyclicity is developed and is shown equivalent to the existing definitions of beta-acyclicity. From this and the concept of the dual of a hypergraph, an efficient algorithm for testing beta-acyclicity is developed. As for the second part, a procedure is evolved for top-down generation of beta-acyclic schemes and its correctness is established. Finally, extensions and applications of ideas are described.

A new method for generation of quasi-periodic structures withn fold axes: Application to five and seven folds

A new geometrical method for generating aperiodic lattices forn-fold non-crystallographic axes is described. The method is based on the self-similarity principle. It makes use of the principles of gnomons to divide the basic triangle of a regular polygon of 2n sides to appropriate isosceles triangles and to generate a minimum set of rhombi required to fill that polygon. The method is applicable to anyn-fold noncrystallographic axis. It is first shown how these regular polygons can be obtained and how these can be used to generate aperiodic structures. In particular, the application of this method to the cases of five-fold and seven-fold axes is discussed. The present method indicates that the recursion rule used by others earlier is a restricted one and that several aperiodic lattices with five fold symmetry could be generated. It is also shown how a limited array of approximately square cells with large dimensions could be detected in a quasi lattice and these are compared with the unit cell dimensions of MnAl6 suggested by Pauling. In addition, the recursion rule for sub-dividing the three basic rhombi of seven-fold structure was obtained and the aperiodic lattice thus generated is also shown.

Generation of hydrogen peroxide on oxidation of NADH by hepatic plasma membranes

The oxidation of NADH by mouse liver plasma membranes was shown to be accompanied by the formation of H2O2. The rate of H2O2 formation was less than one-tenth the rate of oxygen uptake and much slower than the rate of reduction of artificial electron acceptors. The optimum pH for this reaction was 7.0 and theK m value for NADH was found to be 3×10–6 M. The H2O2-generating system of plasma membranes was inhibited by quinacrine and azide, thus distinguishing it from similar activities in endoplasmic reticulum and mitochondria. Both NADH and NADPH served as substrates for plasma membrane H2O2 generation. Superoxide dismutase and adriamycin inhibited the reaction. Vanadate, known to stimulate the oxidation of NADH by plasma membranes, did not increase the formation of H2O2. In view of the growing evidence that H2O2 can be involved in metabolic control, the formation of H2O2 by a plasma membrane NAD(P)H oxidase system may be pertinent to control sites at the plasma membrane.

Ranking of Prospective New Generation Location for a Power Network in a Deregulated System

In developing countries high rate of growth in demand of electric energy is felt, and so the addition of new generating units becomes necessary. In deregulated power systems private generating stations are encouraged to add new generations. Finding the appropriate location of new generator to be installed can be obtained by running repeated power flows, carrying system studies like analyzing the voltage profile, voltage stability, loss analysis etc. In this paper a new methodology is proposed which will mainly consider the existing network topology into account. A concept of T-index is introduced in this paper, which considers the electrical distances between generator and load nodes.This index is used for ranking significant new generation expansion locations and also indicates the amount of permissible generations that can be installed at these new locations. This concept facilitates for the medium and long term planning of power generation expansions within the available transmission corridors. Studies carried out on a sample 7-bus system, EHV equivalent 24-bus system and IEEE 39 bus system are presented for illustration purpose.

Dissipativeness and Stability of a Class of Distributed Parameter Systems

Input-output stability of linear-distributed parameter systems of arbitrary order and type in the presence of a distributed controller is analyzed by extending the concept of dissipativeness, with certain modifications, to such systems. The approach is applicable to systems with homogeneous or homogenizable boundary conditions. It also helps in generating a Liapunov functional to assess asymptotic stability of the system.

Generation of High Magnetic Fields Using Thyristors

This paper describes the use of high-power thyristors in conjunction with a low-voltage supply for generating pulsed magnetic fields. A modular bank of electrolytic capacitors is charged through a programmable solid-state power supply and then rapidly discharged through a bank of thyristors into a magnetizing coil. The modular construction of capacitor banks enables the discrete control of pulse energy and time. Peak fields up to 15 telsa (150 KOe) and a half period of about 200 microseconds are generated through the discharges. Still higher fields are produced by discharging into a precooled coil ( 77°K). Measurement method for a pulsed field is described.