Noise minimization in RC-active filters using generalized impedance converters

A procedure has been given for minimizing the total output noise of a Generalized Impedance Converter (GIC), subject to constraints dictated by signal handling capability of the Operational Amplifiers and ease of microcircuit fabrication. The noise reduction is achieved only by the adjustment of RC elements of the GIC, and the total output noise after optimization in the example cited is close to the theoretical lower limit. The output noise of a higher-order filter can be reduced by RC-optimizing the individual GIC's of the active realization. Experimental results on a 20–24 kHz channel bank band-pass filter demonstrate the effectiveness of the above procedure.

Nonlinear programming solutions for controlling the vibration pattern of stretched strings

The problem of controlling the vibration pattern of a driven string is considered. The basic question dealt with here is to find the control forces which reduce the energy of vibration of a driven string over a prescribed portion of its length while maintaining the energy outside that length above a desired value. The criterion of keeping the response outside the region of energy reduction as close to the original response as possible is introduced as an additional constraint. The slack unconstrained minimization technique (SLUMT) has been successfully applied to solve the above problem. The effect of varying the phase of the control forces (which results in a six-variable control problem) is then studied. The nonlinear programming techniques which have been effectively used to handle problems involving many variables and constraints therefore offer a powerful tool for the solution of vibration control problems.

Simultaneous display of image and spectrum in the same plane: a generalized analysis

A generalized analysis, using the Vander Lugt operational notation, of the building block optical system comprising a single holographic optical element (HOE) for achieving simultaneous display of the spectrum and the image of an object in a single plane, has been carried out. The salient features of this analysis are: (1) it allows comprehensive characterization of the HOE, (2) it provides insights into the many possible configurations for the system, and (3) it explains the existing results in a consistent manner.

An integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly

An algorithm that uses integer arithmetic is suggested. It transforms anm ×n matrix to a diagonal form (of the structure of Smith Normal Form). Then it computes a reflexive generalized inverse of the matrix exactly and hence solves a system of linear equations error-free.

Ordered Ports – a Language Concept for High-level Distributed Programming

A new language concept for high-level distributed programming is proposed. Programs are organised as a collection of concurrently executing processes. Some of these processes, referred to as liaison processes, have a monitor-like structure and contain ports which may be invoked by other processes for the purposes of synchronisation and communication. Synchronisation is achieved by conditional activation of ports and also through port control constructs which may directly specify the execution ordering of ports. These constructs implement a path-expression-like mechanism for synchronisation and are also equipped with options to provide conditional, non-deterministic and priority ordering of ports. The usefulness and expressive power of the proposed concepts are illustrated through solutions of several representative programming problems. Some implementation issues are also considered.

Brownian motion of spins; generalized spin Langevin equation

We derive the Langevin equations for a spin interacting with a heat bath, starting from a fully dynamical treatment. The obtained equations are non-Markovian with multiplicative fluctuations and concommitant dissipative terms obeying the fluctuation-dissipation theorem. In the Markovian limit our equations reduce to the phenomenological equations proposed by Kubo and Hashitsume. The perturbative treatment on our equations lead to Landau-Lifshitz equations and to other known results in the literature.

On duality in linear fractional programming

In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.

Existence Theorems for Generalized Hammerstein Equations

In this paper we obtain existence theorems for generalized Hammerstein-type equations K(u)Nu + u = 0, where for each u in the dual X* of a real reflexive Banach space X, K(u): X -- X* is a bounded linear map and N: X* - X is any map (possibly nonlinear). The method we adopt is totally different from the methods adopted so far in solving these equations. Our results in the reflexive spacegeneralize corresponding results of Petry and Schillings.

A functional style of programming with CSP-like communication mechanisms

This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.

An efficient algorithm for linear programming

A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.

Control of Agent Swarms using Generalized Centroidal Cyclic Pursuit Laws

One of the major tasks in swarm intelligence is to design decentralized but homogenoeus strategies to enable controlling the behaviour of swarms of agents. It has been shown in the literature that the point of convergence and motion of a swarm of autonomous mobile agents can be controlled by using cyclic pursuit laws. In cyclic pursuit, there exists a predefined cyclic connection between agents and each agent pursues the next agent in the cycle. In this paper we generalize this idea to a case where an agent pursues a point which is the weighted average of the positions of the remaining agents. This point correspond to a particular pursuit sequence. Using this concept of centroidal cyclic pursuit, the behavior of the agents is analyzed such that, by suitably selecting the agents' gain, the rendezvous point of the agents can be controlled, directed linear motion of the agents can be achieved, and the trajectories of the agents can be changed by switching between the pursuit sequences keeping some of the behaviors of the agents invariant. Simulation experiments are given to support the analytical proofs.

Missile battery placement for air defense: A dynamic programming approach

A procedure to evaluate surface-to-air missile battery placement patterns for air defense is presented. A measure of defense effectiveness is defined as a function of kill probability of the defense missiles and the nature of the surrounding terrain features. The concept of cumulative danger index is used to select the best path for a penetrating hostile aircraft for any given pattern of placement. The aircraft is assumed to be intelligent and well-informed. The path is generated using a dynamic programming methodology. The software package so developed can be used off-line to choose the best among a number of possible battery placement patterns.

Generalized State Parameter for Partly Saturated Soils

Studies on compressibility and shear strength aspects are the concern of many investigators concerned with partly saturated soils. In soil engineering connected with partly saturated soils, there are no approaches connecting soil states and stress conditions. The present investigation is essentially a step in this direction. A generalized state parameter, identified with regard to material states is shown to be related to the compressibility and shear strength. The involved parameters are simple and normally determined in routine investigations. The advantage of this approach is that changes in soil states due to external stress conditions and the associated changes in strength can be examined particularly when different types of soils are involved.

Measurement of complex optical flow with use of an augmented generalized gradient scheme

We present a method for measuring the local velocities and first-order variations in velocities in a timevarying image. The scheme is an extension of the generalized gradient model that encompasses the local variation of velocity within a local patch of the image. Motion within a patch is analyzed in parallel by 42 different spatiotemporal filters derived from 6 linearly independent spatiotemporal kernels. No constraints are imposed on the image structure, and there is no need for smoothness constraints on the velocity field. The aperture problem does not arise so long as there is some two-dimensional structure in the patch being analyzed. Among the advantages of the scheme is that there is no requirement to calculate second or higher derivatives of the image function. This makes the scheme robust in the presence of noise. The spatiotemporal kernels are of simple form, involving Gaussian functions, and are biologically plausible receptive fields. The validity of the scheme is demonstrated by application to both synthetic and real video images sequences and by direct comparison with another recently published scheme Biol. Cybern. 63, 185 (1990)] for the measurement of complex optical flow.