Scheme of squares: Part II. Systems formalism for sinusoidal perturbations

We extend here the formalism developed in Part I (for the potentiostatic response) to the admittance analysis of the scheme of squares. The results are applicable, as before, to several configurations of the electrode such as the rotating disk or the planar. All that one has to do is “to plug in” the appropriate matrices relating the interfacial concentrations to the fluxes.

A Fuzzy Approximation Scheme for Sequential Learning in Pattern Recognition

An adaptive learning scheme, based on a fuzzy approximation to the gradient descent method for training a pattern classifier using unlabeled samples, is described. The objective function defined for the fuzzy ISODATA clustering procedure is used as the loss function for computing the gradient. Learning is based on simultaneous fuzzy decisionmaking and estimation. It uses conditional fuzzy measures on unlabeled samples. An exponential membership function is assumed for each class, and the parameters constituting these membership functions are estimated, using the gradient, in a recursive fashion. The induced possibility of occurrence of each class is useful for estimation and is computed using 1) the membership of the new sample in that class and 2) the previously computed average possibility of occurrence of the same class. An inductive entropy measure is defined in terms of induced possibility distribution to measure the extent of learning. The method is illustrated with relevant examples.

Simple Coding Scheme For Modular Arithmetic

A dual representation scheme for performing arithmetic modulo an arbitrary integer M is presented. The coding scheme maps each integer N in the range 0 <= N < M into one of two representations, each being identified by its most significant bit. The encoding of numbers is straightforward and the problem of checking for unused combinations is eliminated.

An Adaptive Scheme for Learning the Probability Threshold in Pattern Recognition

The statistical minimum risk pattern recognition problem, when the classification costs are random variables of unknown statistics, is considered. Using medical diagnosis as a possible application, the problem of learning the optimal decision scheme is studied for a two-class twoaction case, as a first step. This reduces to the problem of learning the optimum threshold (for taking appropriate action) on the a posteriori probability of one class. A recursive procedure for updating an estimate of the threshold is proposed. The estimation procedure does not require the knowledge of actual class labels of the sample patterns in the design set. The adaptive scheme of using the present threshold estimate for taking action on the next sample is shown to converge, in probability, to the optimum. The results of a computer simulation study of three learning schemes demonstrate the theoretically predictable salient features of the adaptive scheme.

A knowledge-based clustering scheme

In this paper the notion of conceptual cohesiveness is precised and used to group objects semantically, based on a knowledge structure called ‘cohesion forest’. A set of axioms is proposed which should be satisfied to make the generated clusters meaningful.

Improving the optimum generalised stop-and-wait ARQ scheme

Instead of waiting for the acknowledgments from all the copies of a single data block sent, as in the optimum generalised stop-and-wait ARQ scheme, the transmitter in the proposed scheme starts sending an optimum number of copies of the next block in the queue, soon after receiving the positive acknowledgment from the receiver, thereby further improving the throughput efficiency.

A parallel-serial binary arbitration scheme for collision-free multi-access techniques

Multi-access techniques are widely used in computer networking and distributed multiprocessor systems. On-the-fly arbitration schemes permit one of the many contenders to access the medium without collisions. Serial arbitration is cost effective but is slow and hence unsuitable for high-speed multiprocessor environments supporting very high data transfer rates. A fully parallel arbitration scheme takes less time but is not practically realisable for large numbers of contenders. In this paper, a generalised parallel-serial scheme is proposed which significantly reduces the arbitration time and is practically realisable.

Implementation of a hybrid PCM encoding scheme

An improved encoding scheme is proposed wherein the quantizer step size incorporates both instantaneous and syllabic adaptation. The information needed to carry out this adaptation is extracted at the coder after the D/A conversion of the digital output, so that the coder and the decoder track each other. A 5-bit coder has been designed and built which has a dynamic range of 38 dB with a constant SNR of 30 dB, and the quality of its output signal is found to be comparable to that of other coding schemes

An Optimal g-Guidance Scheme for Satellite Launch Vehicles

A closed-loop steering logic based on an optimal (2-guidance is developed here. The guidance system drives the satellite launch vehicle along a two- or three- dimensional trajectory for placing the payload into a specified circular orbit. The modified g-guidance algorithm makes use of the optimal required velocity vector, which minimizes the total impulse needed for an equivalent two-impluse transfer from the present state to the final orbit. The required velocity vector is defined as velocity of the vehicle on the hypothetical transfer orbit immediately after the application of the first impulse. For this optimal transfer orbit, a simple and elegant expression for the Q-matrix is derived. A working principle for the guidance algorithm in terms of the major and minor cycles, and also for the generation of the steering command, is outlined.

Priority-oriented reservation multiple access scheme for data communication through satellites

A multi-access scheme is proposed for handling priority-based messages in data communication systems through satellites. The different schemes by which time slots are alloted by the satellite are based on a ‘priority index’. The performance characteristics of the system using these schemes under different traffic conditions are discussed.

A Microprocessor-Based Scheme for Testing Protective Relays

This paper presents a general hardware scheme for testing protective relays using microprocessor based systems. The microprocessor simulates the relaying signals for test purpose and monitors the relay performance. Based on the proposed hardware, a teat procedure for directional overcurrent relays is presented in detail. Typical test results of various routine tests conducted on a commercial single phase directional over-current relay clearly demonstrate the efficacy of the proposed technique for conducting tests on commercial relays.

A parametric differentiation version with finite-difference scheme applicable to a class of problems in boundary layer flow with massive blowing

A numerical procedure, based on the parametric differentiation and implicit finite difference scheme, has been developed for a class of problems in the boundary-layer theory for saddle-point regions. Here, the results are presented for the case of a three-dimensional stagnation-point flow with massive blowing. The method compares very well with other methods for particular cases (zero or small mass blowing). Results emphasize that the present numerical procedure is well suited for the solution of saddle-point flows with massive blowing, which could not be solved by other methods.

On the computation of two-dimensional compressible flow fields by the modified local stability scheme

The modified local stability scheme is applied to several two-dimensional problems—blunt body flow, regular reflection of a shock and lambda shock. The resolution of the flow features obtained by the modified local stability scheme is found to be better than that achieved by the other first order schemes and almost identical to that achieved by the second order schemes incorporating artificial viscosity. The scheme is easy for coding, consumes moderate amount of computer storage and time. The scheme can be advantageously used in place of second order schemes.

A Finite Variable Difference Relaxation Scheme for hyperbolic-parabolic equations

Using the framework of a new relaxation system, which converts a nonlinear viscous conservation law into a system of linear convection-diffusion equations with nonlinear source terms, a finite variable difference method is developed for nonlinear hyperbolic-parabolic equations. The basic idea is to formulate a finite volume method with an optimum spatial difference, using the Locally Exact Numerical Scheme (LENS), leading to a Finite Variable Difference Method as introduced by Sakai [Katsuhiro Sakai, A new finite variable difference method with application to locally exact numerical scheme, journal of Computational Physics, 124 (1996) pp. 301-308.], for the linear convection-diffusion equations obtained by using a relaxation system. Source terms are treated with the well-balanced scheme of Jin [Shi Jin, A steady-state capturing method for hyperbolic systems with geometrical source terms, Mathematical Modeling Numerical Analysis, 35 (4) (2001) pp. 631-645]. Bench-mark test problems for scalar and vector conservation laws in one and two dimensions are solved using this new algorithm and the results demonstrate the efficiency of the scheme in capturing the flow features accurately.