Feature selection environment for genomic applications

Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e., for dimensionality reduction). There are many genomic and proteomic applications that rely on feature selection to answer questions such as selecting signature genes which are informative about some biological state, e. g., normal tissues and several types of cancer; or inferring a prediction network among elements such as genes, proteins and external stimuli. In these applications, a recurrent problem is the lack of samples to perform an adequate estimate of the joint probabilities between element states. A myriad of feature selection algorithms and criterion functions have been proposed, although it is difficult to point the best solution for each application. Results: The intent of this work is to provide an open-source multiplataform graphical environment for bioinformatics problems, which supports many feature selection algorithms, criterion functions and graphic visualization tools such as scatterplots, parallel coordinates and graphs. A feature selection approach for growing genetic networks from seed genes ( targets or predictors) is also implemented in the system. Conclusion: The proposed feature selection environment allows data analysis using several algorithms, criterion functions and graphic visualization tools. Our experiments have shown the software effectiveness in two distinct types of biological problems. Besides, the environment can be used in different pattern recognition applications, although the main concern regards bioinformatics tasks.

POLLING SYSTEMS WITH PARAMETER REGENERATION, THE GENERAL CASE

We consider a polling model with multiple stations, each with Poisson arrivals and a queue of infinite capacity. The service regime is exhaustive and there is Jacksonian feedback of served customers. What is new here is that when the server comes to a station it chooses the service rate and the feedback parameters at random; these remain valid during the whole stay of the server at that station. We give criteria for recurrence, transience and existence of the sth moment of the return time to the empty state for this model. This paper generalizes the model, when only two stations accept arriving jobs, which was considered in [Ann. Appl. Probab. 17 (2007) 1447-1473]. Our results are stated in terms of Lyapunov exponents for random matrices. From the recurrence criteria it can be seen that the polling model with parameter regeneration can exhibit the unusual phenomenon of null recurrence over a thick region of parameter space.

COMPLETE ISOMORPHIC CLASSIFICATIONS OF SOME SPACES OF COMPACT OPERATORS

This paper is a continuation and a complement of our previous work on isomorphic classification of some spaces of compact operators. We improve the main result concerning extensions of the classical isomorphic classification of the Banach spaces of continuous functions on ordinals. As an application, fixing an ordinal a and denoting by X(xi), omega(alpha) <= xi < omega(alpha+1), the Banach space of all X-valued continuous functions defined in the interval of ordinals [0,xi] and equipped with the supremum, we provide complete isomorphic classifications of some Banach spaces K(X(xi),Y(eta)) of compact operators from X(xi) to Y(eta), eta >= omega. It is relatively consistent with ZFC (Zermelo-Fraenkel set theory with the axiom of choice) that these results include the following cases: 1.X* contains no copy of c(0) and has the Mazur property, and Y = c(0)(J) for every set J. 2. X = c(0)(I) and Y = l(q)(J) for any infinite sets I and J and 1 <= q < infinity. 3. X = l(p)(I) and Y = l(q)(J) for any infinite sets I and J and 1 <= q < p < infinity.

ON ISOMORPHIC CLASSIFICATIONS OF SPACES OF COMPACT OPERATORS

We prove an extension of the classical isomorphic classification of Banach spaces of continuous functions on ordinals. As a consequence, we give complete isomorphic classifications of some Banach spaces K(X,Y(n)), eta >= omega, of compact operators from X to Y(eta), the space of all continuous Y-valued functions defined in the interval of ordinals [1, eta] and equipped with the supremum norm. In particular, under the Continuum Hypothesis, we extend a recent result of C. Samuel by classifying, up to isomorphism, the spaces K(X(xi), c(0)(Gamma)(eta)), where omega <= xi < omega(1,) eta >= omega, Gamma is a countable set, X contains no complemented copy of l(1), X* has the Mazur property and the density character of X** is less than or equal to N(1).

POSITIVITY PROPERTIES OF THE FOURIER TRANSFORM AND THE STABILITY OF PERIODIC TRAVELLING-WAVE SOLUTIONS

In this paper we establish a method to obtain the stability of periodic travelling-wave solutions for equations of Korteweg-de Vries-type u(t) + u(p)u(x) - Mu(x) = 0, with M being a general pseudodifferential operator and where p >= 1 is an integer. Our approach uses the theory of totally positive operators, the Poisson summation theorem, and the theory of Jacobi elliptic functions. In particular we obtain the stability of a family of periodic travelling waves solutions for the Benjamin Ono equation. The present technique gives a new way to obtain the existence and stability of cnoidal and dnoidal waves solutions associated with the Korteweg-de Vries and modified Korteweg-de Vries equations, respectively. The theory has prospects for the study of periodic travelling-wave solutions of other partial differential equations.

ON SPACES OF COMPACT OPERATORS ON C(K, X) SPACES

This paper concerns the spaces of compact operators kappa(E,F), where E and F are Banach spaces C([1, xi], X) of all continuous X-valued functions defined on the interval of ordinals [1, xi] and equipped with the supremun norm. We provide sufficient conditions on X, Y, alpha, beta, xi and eta, with omega <= alpha <= beta < omega 1 for the following equivalence: (a) kappa(C([1, xi], X), C([1, alpha], Y)) is isomorphic to kappa(C([1,eta], X), C([1, beta], Y)), (b) beta < alpha(omega). In this way, we unify and extend results due to Bessaga and Pelczynski (1960) and C. Samuel (2009). Our result covers the case of the classical spaces X = l(p) and Y = l(q) with 1 < p, q < infinity.

Can we make a Bohmian electron reach the speed of light, at least for one instant?

In Bohmian mechanics, a version of quantum mechanics that ascribes world lines to electrons, we can meaningfully ask about an electron's instantaneous speed relative to a given inertial frame. Interestingly, according to the relativistic version of Bohmian mechanics using the Dirac equation, a massive particle's speed is less than or equal to the speed of light, but not necessarily less. That is, there are situations in which the particle actually reaches the speed of light-a very nonclassical behavior. That leads us to the question of whether such situations can be arranged experimentally. We prove a theorem, Theorem 5, implying that for generic initial wave functions the probability that the particle ever reaches the speed of light, even if at only one point in time, is zero. We conclude that the answer to the question is no. Since a trajectory reaches the speed of light whenever the quantum probability current (psi) over bar gamma(mu)psi is a lightlike 4-vector, our analysis concerns the current vector field of a generic wave function and may thus be of interest also independently of Bohmian mechanics. The fact that the current is never spacelike has been used to argue against the possibility of faster-than-light tunneling through a barrier, a somewhat similar question. Theorem 5, as well as a more general version provided by Theorem 6, are also interesting in their own right. They concern a certain property of a function psi : R(4) -> C(4) that is crucial to the question of reaching the speed of light, namely being transverse to a certain submanifold of C(4) along a given compact subset of space-time. While it follows from the known transversality theorem of differential topology that this property is generic among smooth functions psi : R(4) -> C(4), Theorem 5 asserts that it is also generic among smooth solutions of the Dirac equation. (C) 2010 American Institute of Physics. [doi:10.1063/1.3520529]

Fuzzy pole placement based on piecewise Lyapunov functions

This paper presents a controller design method for fuzzy dynamic systems based on piecewise Lyapunov functions with constraints on the closed-loop pole location. The main idea is to use switched controllers to locate the poles of the system to obtain a satisfactory transient response. It is shown that the global fuzzy system satisfies the requirements for the design and that the control law can be obtained by solving a set of linear matrix inequalities, which can be efficiently solved with commercially available softwares. An example is given to illustrate the application of the proposed method. Copyright (C) 2009 John Wiley & Sons, Ltd.

Deterministic mathematical model for the prediction of the as-cast macrostructure

A multiphase deterministic mathematical model was implemented to predict the formation of the grain macrostructure during unidirectional solidification. The model consists of macroscopic equations of energy, mass, and species conservation coupled with dendritic growth models. A grain nucleation model based on a Gaussian distribution of nucleation undercoolings was also adopted. At some solidification conditions, the cooling curves calculated with the model showed oscillations (""wiggles""), which prevented the correct prediction of the average grain size along the structure. Numerous simulations were carried out at nucleation conditions where the oscillations are absent, enabling an assessment of the effect of the heat transfer coefficient on the average grain size and columnar-to-equiaxed transition.

On the solubility of proteins as a function of pH: Mathematical development and application

Thermodynamic relations between the solubility of a protein and the solution pH are presented in this work. The hypotheses behind the development are that the protein chemical potential in liquid phase can be described by Henry`s law and that the solid-liquid equilibrium is established only between neutral molecules. The mathematical development results in an analytical expression of the solubility curve, as a function of the ionization equilibrium constants, the pH and the solubility at the isoelectric point. It is shown that the same equation can be obtained either by directly calculating the fraction of neutral protein molecules or by integrating the curve of the protein average charge. The methodology was successfully applied to the description of the solubility of porcine insulin as a function of pH at three different temperatures and of bovine beta-lactoglobulin at four different ionic strengths. (C) 2011 Elsevier B.V. All rights reserved.

Galerkin Method and Weighting Functions Applied to Nonlinear H(infinity) Control with Output Feedback

This paper considers two aspects of the nonlinear H(infinity) control problem: the use of weighting functions for performance and robustness improvement, as in the linear case, and the development of a successive Galerkin approximation method for the solution of the Hamilton-Jacobi-Isaacs equation that arises in the output-feedback case. Design of nonlinear H(infinity) controllers obtained by the well-established Taylor approximation and by the proposed Galerkin approximation method applied to a magnetic levitation system are presented for comparison purposes.

A mathematical view of biological complexity

This essay is a trial on giving some mathematical ideas about the concept of biological complexity, trying to explore four different attributes considered to be essential to characterize a complex system in a biological context: decomposition, heterogeneous assembly, self-organization, and adequacy. It is a theoretical and speculative approach, opening some possibilities to further numerical and experimental work, illustrated by references to several researches that applied the concepts presented here. (C) 2008 Elsevier B.V. All rights reserved.

A calibration approach based on Takagi-Sugeno fuzzy inference system for digital electronic compasses

Recently, the development of industrial processes brought on the outbreak of technologically complex systems. This development generated the necessity of research relative to the mathematical techniques that have the capacity to deal with project complexities and validation. Fuzzy models have been receiving particular attention in the area of nonlinear systems identification and analysis due to it is capacity to approximate nonlinear behavior and deal with uncertainty. A fuzzy rule-based model suitable for the approximation of many systems and functions is the Takagi-Sugeno (TS) fuzzy model. IS fuzzy models are nonlinear systems described by a set of if then rules which gives local linear representations of an underlying system. Such models can approximate a wide class of nonlinear systems. In this paper a performance analysis of a system based on IS fuzzy inference system for the calibration of electronic compass devices is considered. The contribution of the evaluated IS fuzzy inference system is to reduce the error obtained in data acquisition from a digital electronic compass. For the reliable operation of the TS fuzzy inference system, adequate error measurements must be taken. The error noise must be filtered before the application of the IS fuzzy inference system. The proposed method demonstrated an effectiveness of 57% at reducing the total error based on considered tests. (C) 2011 Elsevier Ltd. All rights reserved.

Extensions of discrete triangular distributions and boundary bias in kernel estimation for discrete functions

Asymmetric discrete triangular distributions are introduced in order to extend the symmetric ones serving for discrete associated kernels in the nonparametric estimation for discrete functions. The extension from one to two orders around the mode provides a large family of discrete distributions having a finite support. Establishing a bridge between Dirac and discrete uniform distributions, some different shapes are also obtained and their properties are investigated. In particular, the mean and variance are pointed out. Applications to discrete kernel estimators are given with a solution to a boundary bias problem. (C) 2010 Elsevier B.V. All rights reserved.

SELF-SIMILARITY AND LAMPERTI CONVERGENCE FOR FAMILIES OF STOCHASTIC PROCESSES

We define a new type of self-similarity for one-parameter families of stochastic processes, which applies to certain important families of processes that are not self-similar in the conventional sense. This includes Hougaard Levy processes such as the Poisson processes, Brownian motions with drift and the inverse Gaussian processes, and some new fractional Hougaard motions defined as moving averages of Hougaard Levy process. Such families have many properties in common with ordinary self-similar processes, including the form of their covariance functions, and the fact that they appear as limits in a Lamperti-type limit theorem for families of stochastic processes.