L2-Stability Of A Class Of Nonlinear-Systems

Sufficient conditions are given for the L2-stability of a class of feedback systems consisting of a linear operator G and a nonlinear gain function, either odd monotone or restricted by a power-law, in cascade, in a negative feedback loop. The criterion takes the form of a frequency-domain inequality, Re[1 + Z(jω)] G(jω) δ > 0 ω ε (−∞, +∞), where Z(jω) is given by, Z(jω) = β[Y1(jω) + Y2(jω)] + (1 − β)[Y3(jω) − Y3(−jω)], with 0 β 1 and the functions y1(·), y2(·) and y3(·) satisfying the time-domain inequalities, ∝−∞+∞¦y1(t) + y2(t)¦ dt 1 − ε, y1(·) = 0, t < 0, y2(·) = 0, t > 0 and ε > 0, and , c2 being a constant depending on the order of the power-law restricting the nonlinear function. The criterion is derived using Zames' passive operator theory and is shown to be more general than the existing criteria

Self-tuning control of a class of multivariable non-linear systems

Self-tuning is applied to the minimum variance control of non-linear multivariable systems which can be characterized by a ' multivariable Hammerstein model '. It is also shown that such systems are not amenable to self-tuning control if control costing is to be included in the performance criterion.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters II. Numerical performance

A very general and numerically quite robust algorithm has been proposed by Sastry and Gauvrit (1980) for system identification. The present paper takes it up and examines its performance on a real test example. The example considered is the lateral dynamics of an aircraft. This is used as a vehicle for demonstrating the performance of various aspects of the algorithm in several possible modes.

Dynamics of a class of social interaction systems

A mathematical model of social interaction in the form of two coupler! first-order non-linear differential equations, forms the topic of this study. This non-conservative model io representative of such varied social interaction problems as coexisting sub-populations of two different species, arms race between two rival countries and the like. Differential transformation techniques developed elsewhere in the literature are seen to be effective tools of dynamic analysis of this non-linear non-conservative mode! of social interaction process.

Ultraspherical polynomials approach to the study of third-order non-linear systems

In this study, the Krylov-Bogoliubov-Mitropolskii-Popov asymptotic method is used to determine the transient response of third-order non-linear systems. Instead of averaging the non-linear functions over a cycle, they are expanded in ultraspherical polynomials and the constant term is retained. The resulting equations are solved to obtain the approximate solution. A numerical example is considered and the approximate solution is compared with the digital solution. The results show that there is good agreement between the two values.

L_{2}- stability of a class of nonstationary feedback systems with dynamical nonlinear subsystems

A class of feedback systems, consisting of dynamical non-linear subsystems which arise in many diverse control applications, is analyzed for L2-stability. It is shown that, although a transformation of these systems to the familiar Lur'e configuration does not seem to be possible, a one-to-one correspondence may be effected between the stability properties of these and the Lur'e systems. Interesting stability criteria are developed by exploiting this characteristic.

A differential transformation technique for the analysis of a class of non-linear time varying systems

The scope of the differential transformation technique, developed earlier for the study of non-linear, time invariant systems, has been extended to the domain of time-varying systems by modifications to the differential transformation laws proposed therein. Equivalence of a class of second-order, non-linear, non-autonomous systems with a linear autonomous model of second order is established through these transformation laws. The feasibility of application of this technique in obtaining the response of such non-linear time-varying systems is discussed.

Construction of stability multipliers for non-linear feedback systems

This paper is concerned with the analysis of the absolute stability of a non-linear autonomous system which consists of a single non-linearity belonging to a particular class, in an otherwise linear feedback loop. It is motivated from the earlier Popovlike frequency-domain criteria using the ' multiplier ' eoncept and involves the construction of ' stability multipliers' with prescribed phase characteristics. A few computer-based methods by which this problem can be solved are indicated and it is shown that this constitutes a stop-by-step procedure for testing the stability properties of a given system.

Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems

An error-free computational approach is employed for finding the integer solution to a system of linear equations, using finite-field arithmetic. This approach is also extended to find the optimum solution for linear inequalities such as those arising in interval linear programming probloms.

On the positivity and stability of non-stationary systems

The positivity of operators in Hilbert spaces is an important concept finding wide application in various branches of Mathematical System Theory. A frequency- domain condition that ensures the positivity of time-varying operators in L2 with a state-space description, is derived in this paper by using certain newly developed inequalities concerning the input-state relation of such operators. As an interesting application of these results, an L2 stability criterion for time-varying feedback systems consisting of a finite-sector non-linearity is also developed.

Control aspects in proportionality Markov manpower systems

In this paper, the control aspects of a hierarchical organization under the influence of "proportionality" policies are analyzed. Proportionality policies are those that restrict the recruitment to every level of the hierarchy (except the bottom most level or base level) to be in strict proportion to the promotions into that level. Both long term and short term control analysis have been discussed. In long term control the specific roles of the parameters of the system with regard to control of the shape and size of the system have been analyzed and yield suitable control strategies. In short term control, the attainability of a target or goal structure within a specific time from a given initial structure has been analyzed and yields the required recruitment strategies. The theoretical analyses have been illustrated with computational examples and also with real world data. The control of such proportionality systems is then compared with that of the general systems (which do not follow such policies) with some significant conclusions. The control relations of such proportionality systems are found to be simpler and more practically feasible than those of general Markov systems, which do not have such restrictions. Such proportionality systems thus not only retain and match the flexibility of general Markov systems but also have the added advantage of simpler and more practically feasible controls. The proportionality policies hence act as an alternative and more practicably feasible means of control. (C) 2004 Elsevier Inc. All rights reserved.

Chemical Aspects of the Synergistic Hypergolic Ignition in Hybrid Systems with N2O4 as Oxidizer

Synergistic hypergolic ignition with nitrogen tetroxide ( N2O4) as oxidizer has been observed in hybrid systems comprising of a mixture of magnesium and Schiff bases as fuels. The ignition delays (IDs) measured using a modified device, have been compared with those of magnesium-Schiff base-WFNA systems under identical conditions. The ID has been found to vary with the nature of the substitution in both the benzene rings. A linear relationship emerges when the ignition delays are plotted against the Hammett substitution constants (σ). The preignition products of the reaction of N2O4 with magnesium and benzylidineaniline have been analysed to be Mg(NO3)2, benzenediazonium salt and benzaldehyde. Based on the preignition products isolated, a probable reaction mechanism has been proposed. The previously proposed preignition mechanism for the Schiff base-magnesium-WFNA system has been further supported from the present ignition delay data.

A survey of indian logic from the point of view of computer science

Indian logic has a long history. It somewhat covers the domains of two of the six schools (darsanas) of Indian philosophy, namely, Nyaya and Vaisesika. The generally accepted definition of Indian logic over the ages is the science which ascertains valid knowledge either by means of six senses or by means of the five members of the syllogism. In other words, perception and inference constitute the subject matter of logic. The science of logic evolved in India through three ages: the ancient, the medieval and the modern, spanning almost thirty centuries. Advances in Computer Science, in particular, in Artificial Intelligence have got researchers in these areas interested in the basic problems of language, logic and cognition in the past three decades. In the 1980s, Artificial Intelligence has evolved into knowledge-based and intelligent system design, and the knowledge base and inference engine have become standard subsystems of an intelligent system. One of the important issues in the design of such systems is knowledge acquisition from humans who are experts in a branch of learning (such as medicine or law) and transferring that knowledge to a computing system. The second important issue in such systems is the validation of the knowledge base of the system i.e. ensuring that the knowledge is complete and consistent. It is in this context that comparative study of Indian logic with recent theories of logic, language and knowledge engineering will help the computer scientist understand the deeper implications of the terms and concepts he is currently using and attempting to develop.

Learning automata in feedforward connectionist systems

This paper analyses the behaviour of a general class of learning automata algorithms for feedforward connectionist systems in an associative reinforcement learning environment. The type of connectionist system considered is also fairly general. The associative reinforcement learning task is first posed as a constrained maximization problem. The algorithm is approximated hy an ordinary differential equation using weak convergence techniques. The equilibrium points of the ordinary differential equation are then compared with the solutions to the constrained maximization problem to show that the algorithm does behave as desired.

Discovery of Application Workloads from Network File Traces

An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level helps in designing efficient storage systems. Second, it helps create benchmarks that mimic realistic application behavior closely. Third, it enables autonomic systems as the information obtained can be used to adapt the system in a closed loop.All these use cases require the ability to extract the application-level semantics of I/O operations. Methods such as modifying application code to associate I/O operations with semantic tags are intrusive. It is well known that network file system traces are an important source of information that can be obtained non-intrusively and analyzed either online or offline. These traces are a sequence of primitive file system operations and their parameters. Simple counting, statistical analysis or deterministic search techniques are inadequate for discovering application-level semantics in the general case, because of the inherent variation and noise in realistic traces.In this paper, we describe a trace analysis methodology based on Profile Hidden Markov Models. We show that the methodology has powerful discriminatory capabilities that enable it to recognize applications based on the patterns in the traces, and to mark out regions in a long trace that encapsulate sets of primitive operations that represent higher-level application actions. It is robust enough that it can work around discrepancies between training and target traces such as in length and interleaving with other operations. We demonstrate the feasibility of recognizing patterns based on a small sampling of the trace, enabling faster trace analysis. Preliminary experiments show that the method is capable of learning accurate profile models on live traces in an online setting. We present a detailed evaluation of this methodology in a UNIX environment using NFS traces of selected commonly used applications such as compilations as well as on industrial strength benchmarks such as TPC-C and Postmark, and discuss its capabilities and limitations in the context of the use cases mentioned above.