Fuzzy Topological Games and Related Topics

The main purpose of study is to extend the concept of the topological game G(K, X) and some other kinds of games into fuzzy topological games and to obtain some results regarding them. Owing to the fact that topological games have plenty of applications in covering properties, it made an attempt to explore some inter relations of games and covering properties in fuzzy topological spaces. Even though the main focus is on fuzzy para-meta compact spaces and closure preserving shading families, some brief sketches regarding fuzzy P-spaces and Shading Dimension is also provided. In a topological game players choose some objects related to the topological structure of a space such as points, closed subsets, open covers etc. More over the condition on a play to be winning for a player may also include topological notions such as closure, convergence, etc. It turns out that topological games are related to the Baire property, Baire spaces, Completeness properties, Convergence properties, Separation properties, Covering and Base properties, Continuous images, Suslin sets, Singular spaces etc.

Analysis and Design of an Adaptive Polynomial Predistorter with the Loop Delay Estimator

Most adaptive linearization circuits for the nonlinear amplifier have a feedback loop that returns the output signal oj'tne eunplifier to the lineurizer. The loop delay of the linearizer most be controlled precisely so that the convergence of the linearizer should be assured lot this Letter a delay control circuit is presented. It is a delay lock loop (ULL) with it modified early-lute gate and can he easily applied to a DSP implementation. The proposed DLL circuit is applied to an adaptive linearizer with the use of a polynomial predistorter, and the simulalion for a 16-QAM signal is performed. The simulation results show that the proposed DLL eliminates the delay between the reference input signal and the delayed feedback signal of the linearizing circuit perfectly, so that the predistorter polynomial coefficients converge into the optimum value and a high degree of linearization is achieved

A Study on Aerosol Transport Dynamics over the Indian Landmass and the Adjoining Oceanic Regions Using Satellite Data

The present study brings out the influence of transport dynamics on the aerosol distribution over the Indian region at a few selected geographically distinct locations. Over the Bay of Bengal the dominant pathway of aerosol transport during the pre-monsoon period is through higher altitudes (~ 3 km); directed from the Indian main land. In contrast, the aerosol pathways over the Arabian Sea during the same period are quite complex. They are directed from geographically different environments around the ocean through different altitudes. However in general, the day-to-day variability of AOD at both these regions is significantly influenced by the features of atmospheric circulation especially, the wind convergence at higher altitudes (around 3 km). Over the Ganga Basin during the winter period, the wind convergence at lower altitudes (< I km) govems the shon term variations in AOD, while the mean AOD distribution at this location is mainly governed by the local anthropogenic sources.

Southern Hemispheric Features and their Teleconnection with Indian Summer Monsoon

This thesis entitled southern hemispheric features and their Teleconnection with indian summer monsoon.Southern hemisphere is entirely distinct from the northern hemisphere in many aspects, which is well reflected in atmospheric and oceanic properties.The thesis consists of eight chapters, in which the first chapter contains an overview of southern hemisphere. In this chapter, variability in southern hemisphere is described along with Indian summer monsoon and its teleconnection. The different types of data sets used and various methodologies adopted in the present thesis were described in Chapter 2. The period of climate shift and the magnitude of anomalies after the climate shift, which extended from troposphere to stratopause level, were investigated in detail and presented in chapter 3. Chapter 4 depicts the recent trend and variability in southern stratosphere. The higher order variability during various months and the frequency of extremity is included in this chapter.Climatology of divergence and convergence after the documented shift is reported in chapter 5.Southern extratropical connection to Indian summer monsoon through the modulation of SAM is presented in Chapter 6.Chapter 7 deals with the modulation of SAM‐Monsoon link through North Atlantic Oscillation.

On infinite graphs and related matrices

This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any system involving a binary relation. The theory is intimately related to many other branches of Mathematics including Matrix Theory Group theory. Probability. Topology and Combinatorics . and has applications in many other disciplines..Any sort of study on infinite graphs naturally involves an attempt to extend the well known results on the much familiar finite graphs. A graph is completely determined by either its adjacencies or its incidences. A matrix can convey this information completely. This makes a proper labelling of the vertices. edges and any other elements considered, an inevitable process. Many types of labelling of finite graphs as Cordial labelling, Egyptian labelling, Arithmetic labeling and Magical labelling are available in the literature. The number of matrices associated with a finite graph are too many For a study ofthis type to be exhaustive. A large number of theorems have been established by various authors for finite matrices. The extension of these results to infinite matrices associated with infinite graphs is neither obvious nor always possible due to convergence problems. In this thesis our attempt is to obtain theorems of a similar nature on infinite graphs and infinite matrices. We consider the three most commonly used matrices or operators, namely, the adjacency matrix

Anomalous crossover between thermal and shot noise in macroscopic diffusive conductors

We predict the existence of an anomalous crossover between thermal and shot noise in macroscopic diffusive conductors. We first show that, besides thermal noise, these systems may also exhibit shot noise due to fluctuations of the total number of carriers in the system. Then we show that at increasing currents the crossover between the two noise behaviors is anomalous, in the sense that the low-frequency current spectral density displays a region with a superlinear dependence on the current up to a cubic law. The anomaly is due to the nontrivial coupling in the presence of the long-range Coulomb interaction among the three time scales relevant to the phenomenon, namely, diffusion, transit, and dielectric relaxation time.

Inter- State Variations in Productivity trends and Technological Change in Indian industry

The present study entitled ‘Inter-State Variations in Manufacturing Productivity and Technological Changes in India’ covers a period of 38 years from l960 tol998-99. The study is mainly based on ASI data. The study starts with a discussion of the major facilitating factors of industrialization, namely, historical forces, public policy and infrastructure facilities. These are discussed in greater details in the context of our discussion on Perrox’s (1998) ‘growth pole’ and ‘development pole’, Hirschman’s (1958) ‘industrial centers’ and Myrdal’s ‘spread effect’ Most of the existing literature more or less agrees that the process of industrialization has not been unifonn in all Indian states. There has been a decline in inter-state industrial disparities over time. This aspect is dealt at some length in the third chapter. An important element that deserves detailed attention is the intra-regional differences in industrialisation. Regional industrialisation implies the emergence of a few focal points and industrial regions. Calcutta, Bombay and Madras were the initial focal points. Later other centers like Bangalore, Amritsar, Ahemedabad etc. emerged as nodal points in other states. All major states account for focal points. The analysis made in the third chapter shows that industrial activities generally converge to one or two focal points and industrial regions have emerged out of the focal points in almost all states. One of the general features of these complexes and regions is that they approximately accommodate 50 to 75 percent of the total industrial units and workers in the state. Such convergence is seen hands in glow with urbanization. It was further seen that intra-regional industrial disparity comes down in industrial states like Maharashtra, Gujarat and Uttar Pradesh.

POST-MONSOON SEA SURFACE TEMPERATURE AND CONVECTION ANOMALIES OVER INDIAN AND PACIFIC OCEANS

We have studied sea surface temperature (SST) anomalies over the Indian and Pacific Oceans (domain 25 °S to 25°N and 40 °E to 160 °W) during the three seasons following the Indian summer monsoon for wet monsoons and also for dry monsoons accompanied or not by El Ni˜no. A dry monsoon is followed by positive SST anomalies in the longitude belt 40 to 120 °E, negative anomalies in 120 to 160 °E and again positive anomalies east of 160 °E. In dry monsoons accompanied by El Ni˜no the anomalies have the same sign, but are much stronger. Wet monsoons have weak anomalies of opposite sign in all three of the longitude belts. Thus El Ni˜no and a dry monsoon have the same types of association with the Indian and Pacific Ocean SSTs. In the sector 40 to 120 °E SST anomalies first appear over the western part of the Indian Ocean (June to September) followed by the same sign of anomalies over its eastern part and China Sea (October to March). By March after a dry monsoon or El Ni˜no the Indian Ocean between 10 °N and 10 °S has a spatially large warm SST anomaly. Anomalies in deep convection tend to follow the SST anomalies, with warm SST anomalies producing positive convection anomalies around the seasonal location of the intertropical convergence zone

Approximate approximations for the Poisson and the Stokes equations

The method of approximate approximations is based on generating functions representing an approximate partition of the unity, only. In the present paper this method is used for the numerical solution of the Poisson equation and the Stokes system in R^n (n = 2, 3). The corresponding approximate volume potentials will be computed explicitly in these cases, containing a one-dimensional integral, only. Numerical simulations show the efficiency of the method and confirm the expected convergence of essentially second order, depending on the smoothness of the data.

Approximate solutions and error estimates for a Stokes boundary value problem

The aim of this paper is the numerical treatment of a boundary value problem for the system of Stokes' equations. For this we extend the method of approximate approximations to boundary value problems. This method was introduced by V. Maz'ya in 1991 and has been used until now for the approximation of smooth functions defined on the whole space and for the approximation of volume potentials. In the present paper we develop an approximation procedure for the solution of the interior Dirichlet problem for the system of Stokes' equations in two dimensions. The procedure is based on potential theoretical considerations in connection with a boundary integral equations method and consists of three approximation steps as follows. In a first step the unknown source density in the potential representation of the solution is replaced by approximate approximations. In a second step the decay behavior of the generating functions is used to gain a suitable approximation for the potential kernel, and in a third step Nyström's method leads to a linear algebraic system for the approximate source density. For every step a convergence analysis is established and corresponding error estimates are given.

Semantic web mining and the representation, analysis, and evolution of web space

Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. This survey analyzes the convergence of trends from both areas: Growing numbers of researchers work on improving the results of Web Mining by exploiting semantic structures in the Web, and they use Web Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The second aim of this paper is to use these concepts to circumscribe what Web space is, what it represents and how it can be represented and analyzed. This is used to sketch the role that Semantic Web Mining and the software agents and human agents involved in it can play in the evolution of Web space.

Protein Folding Simulations: Confinement, External Fields and Sequence Design

The present Thesis looks at the problem of protein folding using Monte Carlo and Langevin simulations, three topics in protein folding have been studied: 1) the effect of confining potential barriers, 2) the effect of a static external field and 3) the design of amino acid sequences which fold in a short time and which have a stable native state (global minimum). Regarding the first topic, we studied the confinement of a small protein of 16 amino acids known as 1NJ0 (PDB code) which has a beta-sheet structure as a native state. The confinement of proteins occurs frequently in the cell environment. Some molecules called Chaperones, present in the cytoplasm, capture the unfolded proteins in their interior and avoid the formation of aggregates and misfolded proteins. This mechanism of confinement mediated by Chaperones is not yet well understood. In the present work we considered two kinds of potential barriers which try to mimic the confinement induced by a Chaperon molecule. The first kind of potential was a purely repulsive barrier whose only effect is to create a cavity where the protein folds up correctly. The second kind of potential was a barrier which includes both attractive and repulsive effects. We performed Wang-Landau simulations to calculate the thermodynamical properties of 1NJ0. From the free energy landscape plot we found that 1NJ0 has two intermediate states in the bulk (without confinement) which are clearly separated from the native and the unfolded states. For the case of the purely repulsive barrier we found that the intermediate states get closer to each other in the free energy landscape plot and eventually they collapse into a single intermediate state. The unfolded state is more compact, compared to that in the bulk, as the size of the barrier decreases. For an attractive barrier modifications of the states (native, unfolded and intermediates) are observed depending on the degree of attraction between the protein and the walls of the barrier. The strength of the attraction is measured by the parameter $\epsilon$. A purely repulsive barrier is obtained for $\epsilon=0$ and a purely attractive barrier for $\epsilon=1$. The states are changed slightly for magnitudes of the attraction up to $\epsilon=0.4$. The disappearance of the intermediate states of 1NJ0 is already observed for $\epsilon =0.6$. A very high attractive barrier ($\epsilon \sim 1.0$) produces a completely denatured state. In the second topic of this Thesis we dealt with the interaction of a protein with an external electric field. We demonstrated by means of computer simulations, specifically by using the Wang-Landau algorithm, that the folded, unfolded, and intermediate states can be modified by means of a field. We have found that an external field can induce several modifications in the thermodynamics of these states: for relatively low magnitudes of the field ($<2.06 \times 10^8$ V/m) no major changes in the states are observed. However, for higher magnitudes than ($6.19 \times 10^8$ V/m) one observes the appearance of a new native state which exhibits a helix-like structure. In contrast, the original native state is a $\beta$-sheet structure. In the new native state all the dipoles in the backbone structure are aligned parallel to the field. The design of amino acid sequences constitutes the third topic of the present work. We have tested the Rate of Convergence criterion proposed by D. Gridnev and M. Garcia ({\it work unpublished}). We applied it to the study of off-lattice models. The Rate of Convergence criterion is used to decide if a certain sequence will fold up correctly within a relatively short time. Before the present work, the common way to decide if a certain sequence was a good/bad folder was by performing the whole dynamics until the sequence got its native state (if it existed), or by studying the curvature of the potential energy surface. There are some difficulties in the last two approaches. In the first approach, performing the complete dynamics for hundreds of sequences is a rather challenging task because of the CPU time needed. In the second approach, calculating the curvature of the potential energy surface is possible only for very smooth surfaces. The Rate of Convergence criterion seems to avoid the previous difficulties. With this criterion one does not need to perform the complete dynamics to find the good and bad sequences. Also, the criterion does not depend on the kind of force field used and therefore it can be used even for very rugged energy surfaces.

Time Discretization of the SST-generalized Navier-Stokes Equations: Positive and Negative Results

In the theory of the Navier-Stokes equations, the proofs of some basic known results, like for example the uniqueness of solutions to the stationary Navier-Stokes equations under smallness assumptions on the data or the stability of certain time discretization schemes, actually only use a small range of properties and are therefore valid in a more general context. This observation leads us to introduce the concept of SST spaces, a generalization of the functional setting for the Navier-Stokes equations. It allows us to prove (by means of counterexamples) that several uniqueness and stability conjectures that are still open in the case of the Navier-Stokes equations have a negative answer in the larger class of SST spaces, thereby showing that proof strategies used for a number of classical results are not sufficient to affirmatively answer these open questions. More precisely, in the larger class of SST spaces, non-uniqueness phenomena can be observed for the implicit Euler scheme, for two nonlinear versions of the Crank-Nicolson scheme, for the fractional step theta scheme, and for the SST-generalized stationary Navier-Stokes equations. As far as stability is concerned, a linear version of the Euler scheme, a nonlinear version of the Crank-Nicolson scheme, and the fractional step theta scheme turn out to be non-stable in the class of SST spaces. The positive results established in this thesis include the generalization of classical uniqueness and stability results to SST spaces, the uniqueness of solutions (under smallness assumptions) to two nonlinear versions of the Euler scheme, two nonlinear versions of the Crank-Nicolson scheme, and the fractional step theta scheme for general SST spaces, the second order convergence of a version of the Crank-Nicolson scheme, and a new proof of the first order convergence of the implicit Euler scheme for the Navier-Stokes equations. For each convergence result, we provide conditions on the data that guarantee the existence of nonstationary solutions satisfying the regularity assumptions needed for the corresponding convergence theorem. In the case of the Crank-Nicolson scheme, this involves a compatibility condition at the corner of the space-time cylinder, which can be satisfied via a suitable prescription of the initial acceleration.

On Convergence Properties of the EM Algorithm for Gaussian Mixtures

"Expectation-Maximization'' (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a projection matrix $P$, and we provide an explicit expression for the matrix. We then analyze the convergence of EM in terms of special properties of $P$ and provide new results analyzing the effect that $P$ has on the likelihood surface. Based on these mathematical results, we present a comparative discussion of the advantages and disadvantages of EM and other algorithms for the learning of Gaussian mixture models.

On the Convergence of Stochastic Iterative Dynamic Programming Algorithms

Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms, including the TD(lambda) algorithm of Sutton (1988) and the Q-learning algorithm of Watkins (1989), can be motivated heuristically as approximations to dynamic programming (DP). In this paper we provide a rigorous proof of convergence of these DP-based learning algorithms by relating them to the powerful techniques of stochastic approximation theory via a new convergence theorem. The theorem establishes a general class of convergent algorithms to which both TD(lambda) and Q-learning belong.