Impression creep of zinc and the rate-controlling dislocation mechanism of plastic flow at high temperatures

The impression creep behaviour of zinc is studied in the range 300 to 500 K and the results are compared with the data from conventional creep tests. The steady-state impression velocity is found to exhibit the same stress and temperature dependence as in conventional tensile creep with the same power law stress exponent. Also studied is the effect of indenter size on the impression velocity. The thermal activation parameters for plastic flow at high temperatures derived from a number of testing techniques agree reasonably well. Grain boundary sliding is shown to be unimportant in controlling the rate of plastic flow at high temperatures. It is observed that the Cottrell-Stokes law is obeyed during high-temperature deformation of zinc. It is concluded that a mechanism such as forest intersection involving attractive trees controls the high-temperature flow rather than a diffusion mechanism.

Rate capability of graphite materials as negative electrodes in lithium-ion capacitors

The lithium-ion exchange rate capability of various commercial graphite materials are evaluated using galvanostatic charge/discharge cycling in a half-cell configuration over a wide range of C-rates (0.1 similar to 60C). The results confirm that graphite is capable of de-intercalating stored charge at high rates, but has a poor intercalating rate capability. Decreasing the graphite coating thickness leads to a limited rate performance improvement of the electrode. Reducing the graphite particle size shows enhanced C-rate capability but with increased irreversible capacity loss (ICL). It is demonstrated that the rate of intercalation of lithium-ions into the graphite is significantly limited compared with the corresponding rate of de-intercalation at high C-rates. For the successful utilisation of commercially available conventional graphite as a negative electrode in a lithium-ion capacitor (LIC), its intercalation rate capability needs to be improved or oversized to accommodate high charge rates.

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.

Algorithm of medication review in frail older people: Focus on minimizing the use of high-risk medications

Aim Frail older people typically suffer several chronic diseases, receive multiple medications and are more likely to be institutionalized in residential aged care facilities. In such patients, optimizing prescribing and avoiding use of high-risk medications might prevent adverse events. The present study aimed to develop a pragmatic, easily applied algorithm for medication review to help clinicians identify and discontinue potentially inappropriate high-risk medications. Methods The literature was searched for robust evidence of the association of adverse effects related to potentially inappropriate medications in older patients to identify high-risk medications. Prior research into the cessation of potentially inappropriate medications in older patients in different settings was synthesized into a four-step algorithm for incorporation into clinical assessment protocols for patients, particularly those in residential aged care facilities. Results The algorithm comprises several steps leading to individualized prescribing recommendations: (i) identify a high-risk medication; (ii) ascertain the current indications for the medication and assess their validity; (iii) assess if the drug is providing ongoing symptomatic benefit; and (iv) consider withdrawing, altering or continuing medications. Decision support resources were developed to complement the algorithm in ensuring a systematic and patient-centered approach to medication discontinuation. These include a comprehensive list of high-risk medications and the reasons for inappropriateness, lists of alternative treatments, and suggested medication withdrawal protocols. Conclusions The algorithm captures a range of different clinical scenarios in relation to potentially inappropriate medications, and offers an evidence-based approach to identifying and, if appropriate, discontinuing such medications. Studies are required to evaluate algorithm effects on prescribing decisions and patient outcomes.

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.

Mortality Rate: 150 People Died Daily Artworks

Digital Image

Mortality Rate: 150 People Died Daily Artworks

postwar version of F 38352

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