A note on a practical relationship between filter coefficients and scaling and wavelet functions of Discrete Wavelet Transforms

In this paper, the relationship between the filter coefficients and the scaling and wavelet functions of the Discrete Wavelet Transform is presented and exemplified from a practical point-of-view. The explanations complement the wavelet theory, that is well documented in the literature, being important for researchers who work with this tool for time-frequency analysis. (c) 2011 Elsevier Ltd. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

On the Hamilton-Jacobi equation in the framework of generalized functions

In this work we study, in the framework of Colombeau`s generalized functions, the Hamilton-Jacobi equation with a given initial condition. We have obtained theorems on existence of solutions and in some cases uniqueness. Our technique is adapted from the classical method of characteristics with a wide use of generalized functions. We were led also to obtain some general results on invertibility and also on ordinary differential equations of such generalized functions. (C) 2011 Elsevier Inc. All rights reserved.

An indecomposable Banach space of continuous functions which has small density

Using the method of forcing we construct a model for ZFC where CH does not hold and where there exists a connected compact topological space K of weight omega(1) < 2(omega) such that every operator on the Banach space of continuous functions on K is multiplication by a continuous function plus a weakly compact operator. In particular, the Banach space of continuous functions on K is indecomposable.

ALGEBRAIC AND GEOMETRIC THEORY OF THE TOPOLOGICAL RING OF COLOMBEAU GENERALIZED FUNCTIONS

We continue the investigation of the algebraic and topological structure of the algebra of Colombeau generalized functions with the aim of building up the algebraic basis for the theory of these functions. This was started in a previous work of Aragona and Juriaans, where the algebraic and topological structure of the Colombeau generalized numbers were studied. Here, among other important things, we determine completely the minimal primes of (K) over bar and introduce several invariants of the ideals of 9(Q). The main tools we use are the algebraic results obtained by Aragona and Juriaans and the theory of differential calculus on generalized manifolds developed by Aragona and co-workers. The main achievement of the differential calculus is that all classical objects, such as distributions, become Cl-functions. Our purpose is to build an independent and intrinsic theory for Colombeau generalized functions and place them in a wider context.

On E-functions of semisimple Lie groups

We develop and describe continuous and discrete transforms of class functions on a compact semisimple, but not simple, Lie group G as their expansions into series of special functions that are invariant under the action of the even subgroup of the Weyl group of G. We distinguish two cases of even Weyl groups-one is the direct product of even Weyl groups of simple components of G and the second is the full even Weyl group of G. The problem is rather simple in two dimensions. It is much richer in dimensions greater than two-we describe in detail E-transforms of semisimple Lie groups of rank 3.

Generalized solutions of a nonlinear parabolic equation with generalized functions as initial data

In [H. Brezis, A. Friedman, Nonlinear parabolic equations involving measures as initial conditions, J. Math. Pure Appl. (9) (1983) 73-97.] Brezis and Friedman prove that certain nonlinear parabolic equations, with the delta-measure as initial data, have no solution. However in [J.F. Colombeau, M. Langlais, Generalized solutions of nonlinear parabolic equations with distributions as initial conditions, J. Math. Anal. Appl (1990) 186-196.] Colombeau and Langlais prove that these equations have a unique solution even if the delta-measure is substituted by any Colombeau generalized function of compact support. Here we generalize Colombeau and Langlais` result proving that we may take any generalized function as the initial data. Our approach relies on recent algebraic and topological developments of the theory of Colombeau generalized functions and results from [J. Aragona, Colombeau generalized functions on quasi-regular sets, Publ. Math. Debrecen (2006) 371-399.]. (C) 2009 Elsevier Ltd. All rights reserved.

Asymmetric Ramsey Properties of Random Graphs Involving Cliques

Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009

The mitochondrial transcription factor A functions in mitochondrial base excision repair

Mitochondrial transcription factor A (TFAM) is an essential component of mitochondrial nucleoids TFAM plays an important role in mitochondrial transcription and replication TFAM has been previously reported to inhibit nucleotide excision repair (NER) in vitro but NER has not yet been detected in mitochondria, whereas base excision repair (BER) has been comprehensively characterized in these organelles The BER proteins are associated with the inner membrane in mitochondria and thus with the mitochondrial nucleoid, where TFAM is also situated However, a function for TFAM in BER has not yet been investigated This study examines the role of TFAM in BER In vitro studies with purified recombinant TFAM indicate that it preferentially binds to DNA containing 8-oxoguanines, but not to abasic sites, uracils, or a gap in the sequence TFAM inhibited the in vitro incision activity of 8-oxoguanine DNA glycosylase (OGG1), uracil-DNA glycosylase (UDG), apurinic endonuclease 1 (APE1), and nucleotide incorporation by DNA polymerase gamma (pol gamma) On the other hand, a DNA binding-defective TFAM mutant, L58A, showed less inhibition of BER in vitro Characterization of TFAM knockdown (KD) cells revealed that these lysates had higher 8oxoG incision activity without changes in alpha OGG1 protein levels TFAM KD cells had mild resistance to menadione and increased damage accumulation in the mtDNA when compared to the control cells In addition, we found that the tumor suppressor p53, which has been shown to interact with and alter the DNA binding activity of TFAM, alleviates TFAM-Induced inhibition of BER proteins Together, the results suggest that TFAM modulates BER in mitochondria by virtue of its DNA binding activity and protein interactions Published by Elsevier B V

Designing Novel Antitrypanosomal Agents from a Mixed Graph-Theoretical Substructural Approach

Chagas disease is nowadays the most serious parasitic health problem. This disease is caused by Trypanosoma cruzi. The great number of deaths and the insufficient effectiveness of drugs against this parasite have alarmed the scientific community worldwide. In an attempt to overcome this problem, a model for the design and prediction of new antitrypanosomal agents was obtained. This used a mixed approach, containing simple descriptors based on fragments and topological substructural molecular design descriptors. A data set was made up of 188 compounds, 99 of them characterized an antitrypanosomal activity and 88 compounds that belong to other pharmaceutical categories. The model showed sensitivity, specificity and accuracy values above 85%. Quantitative fragmental contributions were also calculated. Then, and to confirm the quality of the model, 15 structures of molecules tested as antitrypanosomal compounds (that we did not include in this study) were predicted, taking into account the information on the abovementioned calculated fragmental contributions. The model showed an accuracy of 100% which means that the ""in silico"" methodology developed by our team is promising for the rational design of new antitrypanosomal drugs. (C) 2009 Wiley Periodicals, Inc. J Comput Chem 31: 882-894. 2010

Design of novel antituberculosis compounds using graph-theoretical and substructural approaches

The increasing resistance of Mycobacterium tuberculosis to the existing drugs has alarmed the worldwide scientific community. In an attempt to overcome this problem, two models for the design and prediction of new antituberculosis agents were obtained. The first used a mixed approach, containing descriptors based on fragments and the topological substructural molecular design approach (TOPS-MODE) descriptors. The other model used a combination of two-dimensional (2D) and three-dimensional (3D) descriptors. A data set of 167 compounds with great structural variability, 72 of them antituberculosis agents and 95 compounds belonging to other pharmaceutical categories, was analyzed. The first model showed sensitivity, specificity, and accuracy values above 80% and the second one showed values higher than 75% for these statistical indices. Subsequently, 12 structures of imidazoles not included in this study were designed, taking into account the two models. In both cases accuracy was 100%, showing that the methodology in silico developed by us is promising for the rational design of antituberculosis drugs.

Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.