Boosted feature selectors: a case study on prediction P-gp inhibitors and substrates

Feature selection is commonly used as a preprocessing step to machine learning for improving learning performance, lowering computational complexity and facilitating model interpretation. This paper proposes the application of boosting feature selection to improve the classification performance of standard feature selection algorithms evaluated for the prediction of P-gp inhibitors and substrates. Two well-known classification algorithms, decision trees and support vector machines, were used to classify the chemical compounds. The experimental results showed better performance for boosting feature selection with respect to the standard feature selection algorithms while maintaining the capability for feature reduction.     

Existence,nonexistence and multiplicity results for nonlocal Dirichlet problems

In this paper we establish various existence, nonexistence and multiplicity results for fully nonlinear Dirichlet problems associated to nonlocal Hamilton–Jacobi equations. This study is accomplished by a careful analysis of the principal eigenvalues of the elliptic operator. Resonance phenomena and anti maximum principles are also established.     

Macro‐hybrid mixed variational two‐phase flow through fractured porous media

Macro‐hybrid mixed variational models of two‐phase flow, through fractured porous media, are analyzed at the mesoscopic and macroscopic levels. The mesoscopic models are treated in terms of nonoverlapping domain decompositions, in such a manner that the porous rock matrix system and the fracture network interact across rock–rock, rock–fracture, and fracture–fracture interfaces, with flux transmission conditions dualized. Alternatively, the models are scaled to a macroscopic level via an asymptotic process, where the width of the fractures tends to zero, and the fracture network turns out to be an interface system of one less spatial dimension, with variable high permeability. The two‐phase flow is characterized by a fractional flow dual mixed variational model. Augmented two‐field and three‐field variational reformulations are presented for regularization, internal approximations, and macro‐hybrid mixed finite element implementation. Also abstract proximal‐point penalty‐duality algorithms are derived and analyzed for parallel computing. Copyright © 2016 John Wiley & Sons, Ltd.     

On the Ramsey number of the triangle and the cube

The Ramsey number r(K ₃,Q _n ) is the smallest integer N such that every red-blue colouring of the edges of the complete graph K _N contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erd?s conjectured that r(K ₃,Q _n )=2 ⁿ⁺¹?1 for every n∈?, but the first non-trivial upper bound was obtained only recently, by Conlon, Fox, Lee and Sudakov, who proved that r(K ₃,Q _n )?7000·2 ⁿ . Here we show that r(K ₃,Q _n )=(1+o(1))2 ⁿ⁺¹ as n→∞.     

Practical aspects associated with location planning for maternal and perinatal assistance in Brazil

A study has been carried out aimed at reducing perinatal mortality in the municipality of Rio de Janeiro through a better distribution of health care facilities. The algorithmic aspects are detailed elsewhere and here the emphasis is on practical issues and difficulties encountered. A 3-level hierarchical model was developed. Both uncapacitated and capacitated versions are briefly described together with some results based on actual data. The project brought to light many contradictions between OR theory and practice in developing countries and, unfortunately, the models developed were not implemented by the municipality health authorities. Possible reasons for this outcome are analysed.     

Purely infinite simple Leavitt path algebras

We give necessary and sufficient conditions on a row-finite graph E so that the Leavitt path algebra L(E) is purely infinite simple. This result provides the algebraic analog to the corresponding result for the Cuntz-Krieger C^∗-algebra C^∗(E) given in [T. Bates, D. Pask, I. Raeburn, W. Szymański, The C^∗-algebras of row-finite graphs, New York J. Math. 6 (2000) 307-324].     

The derivatives of equilibrium states

We find some estimates for the derivatives of equilibrium states of subshifts of finite type. We prove the differentiability (with respect to the potential) of integrals of certain discontinuous functions for the equilibrium state of a potential.research supported by CNPq, Brazil     

Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.