Practical methods of tracking of nonstationary time series applied to real-world data

In this paper, we discuss some practical implications for implementing adaptable network algorithms applied to non-stationary time series problems. Two real world data sets, containing electricity load demands and foreign exchange market prices, are used to test several different methods, ranging from linear models with fixed parameters, to non-linear models which adapt both parameters and model order on-line. Training with the extended Kalman filter, we demonstrate that the dynamic model-order increment procedure of the resource allocating RBF network (RAN) is highly sensitive to the parameters of the novelty criterion. We investigate the use of system noise for increasing the plasticity of the Kalman filter training algorithm, and discuss the consequences for on-line model order selection. The results of our experiments show that there are advantages to be gained in tracking real world non-stationary data through the use of more complex adaptive models.

Oscillation Theorems for Second Order Sublinear Ordinary Differential Equations

Oscillation criteria are given for the second order sublinear non-autonomous differential equation. (r(t) (x)x′(t))′ + q(t)g(x(t)) = (t). These criteria extends and improves earlier oscillation criteria of Kamenev, Kura, Philos and Wong. Oscillation criteria are also given for second order sublinear damped non-autonomous differential equations.

Remarks on blow up time for solutions of a nonlinear diffusion system with time dependent coefficients

2000 Mathematics Subject Classification: 35K55, 35K60.

Transgenic Expression of Endothelin Receptor-B Rescues the Aganglionosis Phenotype of Piebald Lethal Mice

Neural crest cells (NCC) are a unique population of cells in vertebrates that arise between the presumptive epidermis and the dorsal most region of the neural tube. During neurulation, NCC migrate to many regions of the body to give rise to a wide variety of cell types. NCC that originate from the neural tube at the levels of somite 1-7 colonize the gut and give rise to the enteric ganglia. The endothelin signaling pathway has been shown to be crucial for proper development of some neural crest derivatives. Mice and humans with mutations in the Endothelin receptor b (Ednrb) gene exhibit similar phenotypes characterized by hypopigmentation, hearing loss, and megacolon. Thesephenotypes are due to lack of melanocytes in the skin, inner ear and enteric ganglia in the distal portion of the colon, respectively. It is well established that Ednrb is required early during the embryonic development for normal innervation of the gut. However, it is not clear if Ednrb acts on enteric neuron precursor cells or in pre-committed NC precursors. Additionally, it is controversial whether the action of Ednrb is cell autonomous or non- autonomous. We generated transgenic mice that express Ednrb under the control of the Nestin second intron enhancer (Nes) which drives expression to pre-migrating NCC. These mice were crosses to the spontaneous mouse mutant piebald lethal, which carriers a null mutation in Ednrb and exhibits enteric aganglionosis. The Nes-Ednrb was capable of rescuing the aganglianosis phenotype of piebald lethal mutants demonstrating that expression of Ednrb in pre-committed precursors is sufficient for normal enteric ganglia development. This study provides insight in early embryonic development of NCC and could eventually have potential use in cellular therapies for Hirschsprung's disease.

Ordering induced by chemical, thermal and mechanical constraints at solid interfaces

We know that classical thermodynamics even out of equilibrium always leads to stable situation which means degradation and consequently d sorder. Many experimental evidences in different fields show that gradation and order (symmetry breaking) during time and space evolution may appear when maintaining the system far from equilibrium. Order through fluctuations, stochastic processes which occur around critical points and dissipative structures are the fundamental background of the Prigogine-Glansdorff and Nicolis theory. The thermodynamics of macroscopic fluctuations to stochastic approach as well as the kinetic deterministic laws allow a better understanding of the peculiar fascinating behavior of organized matter. The reason for the occurence of this situation is directly related to intrinsic non linearities of the different mechanisms responsible for the evolution of the system. Moreover, when dealing with interfaces separating two immiscible phases (liquid - gas, liquid -liquid, liquid - solid, solid - solid), the situation is rather more complicated. Indeed coupling terms playing the major role in the conditions of instability arise from the peculiar singular static and dynamic properties of the surface and of its vicinity. In other words, the non linearities are not only intrinsic to classical steps involving feedbacks, but they may be imbedded with the non-autonomous character of the surface properties. In order to illustrate our goal we discuss three examples of ordering in far from equilibrium conditions: i) formation of chemical structures during the oxidation of metals and alloys; ii) formation of mechanical structures during the oxidation of metals iii) formation of patterns at a solid-liquid moving interface due to supercooling condition in a melt of alloy. © 1984, Walter de Gruyter. All rights reserved.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.

Dissecting signaling pathways that control glia migration in the developing Drosophila retina

The function of a complex nervous system relies on an intricate interaction between neurons and glial cells. However, as glial cells are generally born distant from the place where they settle, molecular cues are important to direct their migration. Glial cell migration is important in both normal development and disease, thus current research in the laboratory has been focused on dissecting regulatory events underlying that crucial process. With this purpose, the Drosophila eye imaginal disc has been used as a model. In response to neuronal photoreceptor differentiation, glial cells migrate from the CNS into the eye disc where they act to correctly wrap axons. To ensure proper development, attractive and repulsive signals must coordinate glial cell migration. Importantly, one of these signals is Bnl, a Fibroblast Growth Factor (FGF) ligand expressed by retinal progenitor cells that was suggested to act as a non-autonomous negative regulator of excessive glial cell migration (overmigration) by binding and activating the Btl receptor expressed by glial cells. Through the experimental results described in chapter 3 we gained a detailed insight into the function of bnl in eye disc growth, photoreceptor development, and glia migration. Interestingly, we did not find a direct correlation between the defects on the ongoing photoreceptors and the glia overmigration phenotype; however, bnl knockdown caused apoptosis of eye progenitor cells what was strongly correlated with glia migration defects. Glia overmigration due to Bnl down-regulation in eye progenitor cells was rescued by inhibiting the pro-apoptotic genes or caspases activity, as well as, by depleting JNK or Dp53 function in retinal progenitor cells. Thus, we suggest a cross-talk between those developmental signals in the control of glia migration at a distance. Importantly, these results suggest that Bnl does not control glial migration in the eye disc exclusively through its ability to bind and activate its receptor Btl in glial cells. We also discuss possible biological roles for the glia overmigration in the bnl knockdown background. Previous results in the lab showed an interaction between dMyc, a master regulator of tissue growth, and Dpp, a Transforming Growth Factor-β important for retinal patterning and for accurate glia migration into the eye disc. Thus, we became interested in understanding putative relationships between Bnl and dMyc. In chapter 4, we show that they positively cooperate in order to ensure proper development of the eye disc. This work highlights the importance of the FGF signaling in eye disc development and reveals a signaling network where a range of extra- and intra-cellular signals cooperate to non-autonomously control glial cell migration. Therefore, such inter-relations could be important in other Drosophila cellular contexts, as well as in vertebrate tissue development.

Non-cell autonomous neuroprotective effect of carbon monoxide : microglia-to-neuron communication

RESUMO: A isquémia cerebral é uma das doenças mais predominantes a nivel mundial, sendo uma das principais causas de mortalidade e invalidez. Parte da propagação de dano no cérebro é causado por inflamação descontrolada, causada principalmente por disfunção da microglia. Desta forma, existe a necessidade de tentar desenvolver estratégias para melhor compreender e modular as acções destas células. O monóxido de carbono (CO), é uma molécula endógena com provas dadas como anti-neuroinflamatório em vários modelos. Assim, o principal objectivo do trabalho foi o estudo do CO como um modulador da acção da microglia, com principal foco dado à comunicação entre estas células e neurónios, tentando entender se existe um efeito neuroprotector por inibição da inflamação. Um protocolo de meio condicionado foi estabelecido usando as linhas celulares BV2 e SH-SY5Y, de microglia e neurónio. A molécula CORM-A1, que liberta expontaniamente CO, foi usada como método de entrega da molécula às celulas. Demonstrámos que o pre-tratamento de células BV2 com CORM-A1 gera neuroprotecção já que reduz a morte celular de neurónios SH-SY5Y quando são incubados com meio condicionado de microglia activada em conjunto com o pró-oxidante t-BHP (tert-butil hidroperóxido). Assim, considerámos que o CO promove neuroprotecção ao inibir as acções inflamatórias da microglia. O papel anti-inflamatório da molécula CORM-A1 foi confirmado quando se verificou que pré-tratamento desta molécula em microglia BV2 limita a secreção de TNF-α mas estimula a secreção de IL-10. Por último, a CORM-A1 induziu a expressão do receptor da microglia CD200R1, molécula que participa na comunicação neurónio-microglia e fundamental para a modulação das acções inflamatórias destas últimas. Em suma, o nosso trabalho reforçou as propriedades anti-neuroinflamatórias do CO e uma capacidade de modular viabilidade neuronal através do seu efeito a nível de comunicação célula-célula. ---------------------------- ABSTRACT: Brain ischemia is a widespread disease worldwide, being one of the main causes of mortality and permanent disability. A portion of the damage that ensues following the ischemic event is caused by unrestrained inflammation, which is mainly orchestrated by exacerbated microglial activity. Hence, developing strategies for modulating microglial inflammation is a major concern nowadays. The endogenous molecule carbon monoxide (CO) has been shown to possess anti-neuroinflammatory properties using in vitro and in vivo approaches. Thus, our objective was to study CO as modulator of microglial activity, in particular in what concerns their communication with neurons, by promoting neuronal viability and limiting inflammatory output of activated microglia. A conditioned media strategy was established with BV2 microglia and SH-SY5Y neurons as cell models. CO-releasing molecule A1 (CORM-A1), a compound that releases CO spontaneously, was used as method of CO delivery to cells. We found that CORM-A1 pre-treatment in BV2 cells yields neuroprotective results, as it limits cell death when SH-SY5Y neurons are challenged with conditioned media from LPS-activated microglia and the pro-oxidant t-BHP (tert-butyl-hydroperoxide). Thus, we assumed carbon monoxide promotes neuroprotection via inhibition of microglial inflammation, displaying a non-cell autonomous role. CORM-A1 pre-treatment limited inflammation by inhibiting BV2 secretion of TNF-α and stimulating IL-10 production. These results reinforce that CO’s anti-inflammatory role confers neuroprotection, as the alterations in these cytokines occur concurrently with the increase in SH-SY5Y viability. Finally, we showed for the first time that carbon monoxide promotes the expression of CD200R1, a microglial receptor involved in neuron-glia communication and modulation of microglia inflammation. Further studies are necessary to clarify this role. Altogether, other than just highlighting CO as an anti-inflammatory and neuroprotective molecule, this work set the foundation for disclosing its involvement in cell-to-cell communication.

A non-extensive maximum entropy based regulations method for bad conditioned inverse problems

A regularization method based on the non-extensive maximum entropy principle is devised. Special emphasis is given to the q=1/2 case. We show that, when the residual principle is considered as constraint, the q=1/2 generalized distribution of Tsallis yields a regularized solution for bad-conditioned problems. The so devised regularized distribution is endowed with a component which corresponds to the well known regularized solution of Tikhonov (1977).

Agency problems with non-smooth decision profiles: the case of monopoly under product quality

A method for dealing with monotonicity constraints in optimal control problems is used to generalize some results in the context of monopoly theory, also extending the generalization to a large family of principal-agent programs. Our main conclusion is that many results on diverse economic topics, achieved under assumptions of continuity and piecewise differentiability in connection with the endogenous variables of the problem, still remain valid after replacing such assumptions by two minimal requirements.

Automates à contraintes semilinéaires = Automata with a semilinear constraint

Cette thèse présente une étude dans divers domaines de l'informatique théorique de modèles de calculs combinant automates finis et contraintes arithmétiques. Nous nous intéressons aux questions de décidabilité, d'expressivité et de clôture, tout en ouvrant l'étude à la complexité, la logique, l'algèbre et aux applications. Cette étude est présentée au travers de quatre articles de recherche. Le premier article, Affine Parikh Automata, poursuit l'étude de Klaedtke et Ruess des automates de Parikh et en définit des généralisations et restrictions. L'automate de Parikh est un point de départ de cette thèse; nous montrons que ce modèle de calcul est équivalent à l'automate contraint que nous définissons comme un automate qui n'accepte un mot que si le nombre de fois que chaque transition est empruntée répond à une contrainte arithmétique. Ce modèle est naturellement étendu à l'automate de Parikh affine qui effectue une opération affine sur un ensemble de registres lors du franchissement d'une transition. Nous étudions aussi l'automate de Parikh sur lettres: un automate qui n'accepte un mot que si le nombre de fois que chaque lettre y apparaît répond à une contrainte arithmétique. Le deuxième article, Bounded Parikh Automata, étudie les langages bornés des automates de Parikh. Un langage est borné s'il existe des mots w_1, w_2, ..., w_k tels que chaque mot du langage peut s'écrire w_1...w_1w_2...w_2...w_k...w_k. Ces langages sont importants dans des domaines applicatifs et présentent usuellement de bonnes propriétés théoriques. Nous montrons que dans le contexte des langages bornés, le déterminisme n'influence pas l'expressivité des automates de Parikh. Le troisième article, Unambiguous Constrained Automata, introduit les automates contraints non ambigus, c'est-à-dire pour lesquels il n'existe qu'un chemin acceptant par mot reconnu par l'automate. Nous montrons qu'il s'agit d'un modèle combinant une meilleure expressivité et de meilleures propriétés de clôture que l'automate contraint déterministe. Le problème de déterminer si le langage d'un automate contraint non ambigu est régulier est montré décidable. Le quatrième article, Algebra and Complexity Meet Contrained Automata, présente une étude des représentations algébriques qu'admettent les automates contraints et les automates de Parikh affines. Nous déduisons de ces caractérisations des résultats d'expressivité et de complexité. Nous montrons aussi que certaines hypothèses classiques en complexité computationelle sont reliées à des résultats de séparation et de non clôture dans les automates de Parikh affines. La thèse est conclue par une ouverture à un possible approfondissement, au travers d'un certain nombre de problèmes ouverts.

Studies on magnetic monopole solutions of non-abelian gauge theories and related problems

In 1931 Dirac studied the motion of an electron in the field of a magnetic monopole and found that the quantization of electric charge can be explained by postulating the mere existence of a magnetic monopole. Since 1974 there has been a resurgence of interest in magnetic monopole due to the work of ‘t’ Hooft and Polyakov who independently observed that monopoles can exist as finite energy topologically stable solutions to certain spontaneously broken gauge theories. The thesis, “Studies on Magnetic Monopole Solutions of Non-abelian Gauge Theories and Related Problems”, reports a systematic investigation of classical solutions of non-abelian gauge theories with special emphasis on magnetic monopoles and dyons which possess both electric and magnetic charges. The formation of bound states of a dyon with fermions and bosons is also studied in detail. The thesis opens with an account of a new derivation of a relationship between the magnetic charge of a dyon and the topology of the gauge fields associated with it. Although this formula has been reported earlier in the literature, the present method has two distinct advantages. In the first place, it does not depend either on the mechanism of symmetry breaking or on the nature of the residual symmetry group. Secondly, the results can be generalized to finite temperature monopoles.

Some non- linear problems in theoretical physics

An immense variety of problems in theoretical physics are of the non-linear type. Non~linear partial differential equations (NPDE) have almost become the rule rather than an exception in diverse branches of physics such as fluid mechanics, field theory, particle physics, statistical physics and optics, and the construction of exact solutions of these equations constitutes one of the most vigorous activities in theoretical physics today. The thesis entitled ‘Some Non-linear Problems in Theoretical Physics’ addresses various aspects of this problem at the classical level. For obtaining exact solutions we have used mathematical tools like the bilinear operator method, base equation technique and similarity method with emphasis on its group theoretical aspects. The thesis deals with certain methods of finding exact solutions of a number of non-linear partial differential equations of importance to theoretical physics. Some of these new solutions are of relevance from the applications point of view in diverse branches such as elementary particle physics, field theory, solid state physics and non-linear optics and give some insight into the stable or unstable behavior of dynamical Systems The thesis consists of six chapters.