Fractional power dependence of rate on activation energy for reactions with very low internal barriers

The dynamics of reactions with low internal barriers are studied both analytically and numerically for two different models. Exact expressions for the average rate,kI, are obtained by solving the associated first passage time problems. Both the average rate constant, kI, and the numerically calculated long-time rate constant, kL, show a fractional power law dependence on the barrier height for very low barriers. The crossover of the reaction dynamics from low to high barrier is investigated.

Electrochemical phase formation (ECPF) and macrogrowth Part II. Two-rate models

A general theory is evolved for a class of macrogrowth models which possess two independent growth-rates. Relations connecting growth-rates to growth geometry are established and some new growth forms are shown to result for models with passivation or diffusion-controlled rates. The corresponding potentiostatic responses, their small and large time behaviours and peak characteristics are obtained. Numerical transients are also presented. An empirical equation is derived as a special case and an earlier equation is corrected. An interesting stochastic result pertaining to nucleation events in the successive layers is proved.

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.

State Dependent Attempt Rate Modeling of Single Cell IEEE 802.11 WLANs with Homogeneous Nodes and Poisson Arrivals

Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-field approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA/CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the M queues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA/CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA/CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.

Improving the dynamic range of a CVSD coder

The letter describes a method of improving the dynamic range of a continuously variable slope delta modulator (CVSD). This is achieved by modifying the basic step size delta0 Compared to the CVSD algorithm, the modified CVSD (MCVSD) algorithm yields about 15–20 dB dynamic range improvement without degrading the peak SNR and the bit error rate tolerance.

An algorithm for optimum control of static VAR compensators to meet phase-wise unbalanced reactive power demands

The operation of thyristor-controlled static VAR compensators (SVCs) at various conduction angles can be used advantageously to meet the unablanced reactive power demands in a system. However, such operation introduces harmonic currents into the AC system. This paper presents an algorithm to evaluate an optimum combination of the phase-wise reactive power generations from SVC and balanced reactive power supply from the AC system, based on the defined performance indices, namely, the telephone influence factor (TIF), the total harmonic current factor (IT) and the distortion factor (D). Results of the studies conducted on a typical distribution system are presented and discussed.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

Combustion and Thermal Decomposition of a Binary Oxidiser System: Ammonium Perchlorate-Potassium Perchlorate

Combustion behaviour of ammonium perchlorate-potassium perchlorate pellets is studied using Crawford strand burners. At low concentrations of potassium perchlorate (up to 30 percent potassium perchlorate) the burning rate of ammonium perchlorate-potassium perchlorate condensed mixtures increases with potassium perchlorate content. Above 40 percent potassium perchlorate content, combustion sustenance becomes difficult. Decomposition products of ammonium perchlorate sensitize the melting and subsequent decomposition of potassium perchlorate. The results are explained in terms of the melt layer thickness, flame temperature and the resultant surface temperature, and heat wave penetration into the solid. The study suggests the importance of melt layer on the burning surface in the deflagration behaviour of ammonium perchlorate-potassium perchlorate condensed mixtures

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters I. Algorithm

The simultaneous state and parameter estimation problem for a linear discrete-time system with unknown noise statistics is treated as a large-scale optimization problem. The a posterioriprobability density function is maximized directly with respect to the states and parameters subject to the constraint of the system dynamics. The resulting optimization problem is too large for any of the standard non-linear programming techniques and hence an hierarchical optimization approach is proposed. It turns out that the states can be computed at the first levelfor given noise and system parameters. These, in turn, are to be modified at the second level.The states are to be computed from a large system of linear equations and two solution methods are considered for solving these equations, limiting the horizon to a suitable length. The resulting algorithm is a filter-smoother, suitable for off-line as well as on-line state estimation for given noise and system parameters. The second level problem is split up into two, one for modifying the noise statistics and the other for modifying the system parameters. An adaptive relaxation technique is proposed for modifying the noise statistics and a modified Gauss-Newton technique is used to adjust the system parameters.

A parallel wilf algorithm for complex zeros of a polynomial

A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.

PLA folding algorithm from compatibility relations

The letter reports an algorithm for the folding of programmable logic arrays. The algorithm is valid for both column and row folding, although it has been presented considering only the simple column folding. The pairwise compatibility relations among all the pairs of the columns of the PLA are plotted in a matrix called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), a new concept defined in the letter, is then derived from the compatibility matrix. Once an FCM is obtained, the ordered pairs of fold-able columns and the reordering of the rows are readily determined

Effect of Load on Dry Sliding Wear of Aluminum-Silicon Alloys

Aluminum-silicon alloy pins were slid against steel disks under nominally dry condition at a speed of 0.6 m s-1. Each pin was slid at a constant load for 5 min, the load being increased in suitable steps from 2 to 65 N. The results show the wear to increase almost monotonically with load, to be sensitive to the presence of silicon in the alloy, and to be insensitive to actual silicon content. The monotonic nature of wear rate-load characteristic suggests that one dominant wear mechanism prevails over the load range studied. Morphological studies of the pin surface and the debris support this contention and point to delamination as being the dominant mode of wear.

Divide-and-Correct Algorithm for Division in a Negative Base

A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient.