Differential Games of Mixed Type with Control and Stopping Times

We study a zero sum differential game of mixed type where each player uses both control and stopping times. Under certain conditions we show that the value function for this problem exists and is the unique viscosity solution of the corresponding variational inequalities. We also show the existence of saddle point equilibrium for a special case of differential game.

Oscillation criteria for differential equations of second order

In this article, we give sufficient condition in the form of integral inequalities to establish the oscillatory nature of non linear homogeneous differential equations of the form where r, q, p, f and g are given data. We do this by separating the two cases f is monotonous and non monotonous.

The alpha method for solving differential algebraic inequality (DAI) systems

This paper describes an algorithm for ``direct numerical integration'' of the initial value Differential-Algebraic Inequalities (DAI) in a time stepping fashion using a sequential quadratic programming (SQP) method solver for detecting and satisfying active path constraints at each time step. The activation of a path constraint generally increases the condition number of the active discretized differential algebraic equation's (DAE) Jacobian and this difficulty is addressed by a regularization property of the alpha method. The algorithm is locally stable when index 1 and index 2 active path constraints and bounds are active. Subject to available regularization it is seen to be stable for active index 3 active path constraints in the numerical examples. For the high index active path constraints, the algorithm uses a user-selectable parameter to perturb the smaller singular values of the Jacobian with a view to reducing the condition number so that the simulation can proceed. The algorithm can be used as a relatively cheaper estimation tool for trajectory and control planning and in the context of model predictive control solutions. It can also be used to generate initial guess values of optimization variables used as input to inequality path constrained dynamic optimization problems. The method is illustrated with examples from space vehicle trajectory and robot path planning.

Existence of Value in Stochastic Differential Games of Mixed Type

In this article, we address stochastic differential games of mixed type with both control and stopping times. Under standard assumptions, we show that the value of the game can be characterized as the unique viscosity solution of corresponding Hamilton-Jacobi-Isaacs (HJI) variational inequalities.

Mycobacterium tuberculosis groE promoter controls the expression of the bicistronic groESL1 operon and shows differential regulation under stress conditions

Heat shock promoters of mycobacteria are strong promoters that become rapidly upregulated during macrophage infection and thus serve as valuable candidates for expressing foreign antigens in recombinant BCG vaccine. In the present study, a new heat shock promoter controlling the expression of the groESL1 operon was identified and characterized. Mycobacterium tuberculosis groESL1 operon codes for the immunodominant 10 kDa (Rv3418c, GroES/Cpn10/Hsp10) and 60 kDa (Rv3417c, GroEL1/Cpn60.1/Hsp60) heat shock proteins. The basal promoter region was 115 bp, while enhanced activity was seen only with a 277-bp fragment. No promoter element was seen in the groES-groEL1 intergenic region. This operon codes for a bicistronic mRNA transcript as determined by reverse transcriptase-PCR and Northern blot analysis. Primer extension analysis identified two transcriptional start sites (TSSs) TSS1 (-236) and TSS2 (-171), out of which one (TSS2) was heat inducible. The groE promoter was more active than the groEL2 promoter in Mycobacterium smegmatis. Further, it was found to be differentially regulated under stress conditions, while the groEL2 promoter was constitutive.

Stochastic differential games with multiple modes

We have studied two person stochastic differential games with multiple modes. For the zero-sum game we have established the existence of optimal strategies for both players. For the nonzero-sum case we have proved the existence of a Nash equilibrium.

The complementation of yeast with human or Plasmodium falciparum Hsp90 confers differential inhibitor sensitivities

Developing novel drugs against the unicellular parasite Plasmodium is complicated by the paucity of simple screening systems. Heat-shock proteins are an essential class of proteins for the parasite's cyclical life style between different cellular milieus and temperatures. The molecular chaperone Hsp90 assists a large variety of proteins, but its supporting functions for many proteins that are important for cancer have made it into a well-studied drug target. With a better understanding of the differences between Hsp90 of the malarial parasite and Hsp90 of its human host, new therapeutic options might become available. We have generated a set of isogenic strains of the budding yeast Saccharomyces cerevisiae where the essential yeast Hsp90 proteins have been replaced with either of the two human cytosolic isoforms Hsp90 alpha or Hsp90 beta, or with Hsp90 from Plasmodium falciparum (Pf). All strains express large amounts of the Flag-tagged Hsp90 proteins and are viable. Even though the strain with Pf Hsp90 grows more poorly, it provides a tool to reconstitute additional aspects of the parasite Hsp90 complex and its interactions with substrates in yeast as a living test tube. Upon exposure of the set of Hsp90 test strains to the two Hsp90 inhibitors radicicol (Rd) and geldanamycin (GA), we found that the strain with Pf Hsp90 is relatively more sensitive to GA than to Rd compared to the strains with human Hsp90's. This indicates that this set of yeast strains could be used to screen for new Pf Hsp90 inhibitors with a wider therapeutic window.

Oestrogenic regulation and differential expression of WNT4 in the bonnet monkey and rodent epididymis

A role for oestrogen in regulating fluid reabsorption in the monkey epididymis was recently demonstrated. Here, these Studies are extended to identify potential oestrogen-regulated proteins in the cauda region of monkey epididymis treated with vehicle and oestrogen receptor antagonist (ICI 182780). Two-dimensional electrophoretic analysis was used to identify the proteins. The results indicated down-regulation of WNT4 in the ICI-182780-treated monkey cauda. In addition. the Wnt4f mRNA concentration was also reduced in the caput regions of ICI-182780-treated rats and oestrogen receptor knockout mice. WNT4 is a key regulator of gonadal differentiation in humans and mice and plays a pivotal role in early mouse embryogenesis. The results of the present Study establish the presence of WNT4 in the monkey epididymis and its regulation by oestrogen, and Suggest a role for WNT4 in maintaining epididymal homeostasis.

An algebraic theory of functional and multivalued dependencies in relational databases

Computation of the dependency basis is the fundamental step in solving the membership problem for functional dependencies (FDs) and multivalued dependencies (MVDs) in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of a dependency-lattice and develop an algebraic characterization of inference basis using simple notions from lattice theory. We also establish several interesting properties of dependency-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a): computing the inference basis of a given set M of MVDs; (b): computing the dependency basis of a given attribute set w.r.t. M; and (c): solving the membership problem for MVDs. We also show that our results naturally extend to incorporate FDs also in a way that enables the solution of the membership problem for both FDs and MVDs put together. We finally show that our algorithms are more efficient than existing ones, when used to solve what we term the ‘generalized membership problem’.

The Implication Problem for Functional and Multivalued Dependencies

Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.

Low-intensity differential photocapacitance of MOS structures

Some new observations on the phenomenon of photocapacitane on n-type silicon MOS structures under low intensities of illumination are reported. The difference between the illuminated and dark C---characteristics is automatically followed as a function of the applied bias thereby obtaining the differential photocapacitance and the resulting characteristics has been termed as the Low Intensity Differential Photocapacitance (LIDP). For an MOS capacitor, the LIDP characteristics is seen to go through a well defined maximum. The phenomenon has been investigated under different ambient conditions like light intensity, temperature, dependance of the frequency of the light etc. and it has been found that the phenomenon is due to a band excband excitation. In this connection, a novel sensitive technique for the measurement of the capacitance based upon following the frequency changes of a tank circuit is also described in some detail. It is also shown that the phenomenon can be understood by a simple theoretical model.

Split-Freedom And Mvd-Intersection - A New Characterization Of Multivalued Dependencies Having Conflict-Free Covers

Sets of multivalued dependencies (MVDs) having conflict-free covers are important to the theory and design of relational databases [2,12,15,16]. Their desirable properties motivate the problem of testing a set M of MVDs for the existence of a confiict-free cover. In [8] Goodman and Tay have proposed an approach based on the possible equivalence of M to a single (acyclic) join dependency (JD). We remark that their characterization does not lend an insight into the nature of such sets of MVDs. Here, we use notions that are intrinsic to MVDs to develop a new characterization. Our approach proceeds in two stages. In the first stage, we use the notion of “split-free” sets of MVDs and obtain a characterization of sets M of MVDs having split-free covers. In the second, we use the notion of “intersection” of MVDs to arrive at a necessary and sufficient condition for a split-free set of MVDs to be conflict-free. Based on our characterizations, we also give polynomial-time algorithms for testing whether M has split-free and conflict-free covers. The highlight of our approach is the clear insight it provides into the nature of sets of MVDs having conflict-free covers. Less emphasis is given in this paper to the actual efficiency of the algorthms. Finally, as a bonus, we derive a desirable property of split-free sets of MVDs,thereby showing that they are interesting in their own right.

A multi-microprocessor architecture for solving partial differential equations

This paper presents the architecture of a fault-tolerant, special-purpose multi-microprocessor system for solving Partial Differential Equations (PDEs). The modular nature of the architecture allows the use of hundreds of Processing Elements (PEs) for high throughput. Its performance is evaluated by both analytical and simulation methods. The results indicate that the system can achieve high operation rates and is not sensitive to inter-processor communication delay.

Application of Haar functions for transmission line and transformer differential protection

The development of algorithms, based on Haar functions, for extracting the desired frequency components from transient power-system relaying signals is presented. The applications of these algorithms to impedance detection in transmission line protection and to harmonic restraint in transformer differential protection are discussed. For transmission line protection, three modes of application of the Haar algorithms are described: a full-cycle window algorithm, an approximate full-cycle window algorithm, and a half-cycle window algorithm. For power transformer differential protection, the combined second and fifth harmonic magnitude of the differential current is compared with that of fundamental to arrive at a trip decision. The proposed line protection algorithms are evaluated, under different fault conditions, using realistic relaying signals obtained from transient analysis conducted on a model 400 kV, 3-phase system. The transformer differential protection algorithms are also evaluated using a variety of simulated inrush and internal fault signals.

An Online Implementable Differential Evolution Tuned Optimal Guidance Law

This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engagement is minimised using differential evolution. The difficulty of solving it by existing conventional techniques in optimal control theory is caused by the nonlinearity of the dynamic constraint equation, inequality constraint on the control input and inequality constraint on another parameter that enters problem indirectly. The optimal control problem of finding the minimum miss distance has an analytical solution subject to several simplifying assumptions. In the approach proposed in this paper, the initial population is generated around the seed value given by this analytical solution. Thereafter, the algorithm progresses to an acceptable final solution within a few generations, satisfying the constraints at every iteration. Since this solution or the control input has to be obtained in real time to be of any use in practice, the feasibility of online implementation is also illustrated.