Social interaction as a heuristic for combinatorial optimization problems

We investigate the performance of a variant of Axelrod's model for dissemination of culture-the Adaptive Culture Heuristic (ACH)-on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents' strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N(1/4) so that the number of agents must increase with the fourth power of the problem size, N proportional to F(4), to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F(6) which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Influence of memory in deterministic walks in random media: Analytical calculation within a mean-field approximation

Consider a random medium consisting of N points randomly distributed so that there is no correlation among the distances separating them. This is the random link model, which is the high dimensionality limit (mean-field approximation) for the Euclidean random point structure. In the random link model, at discrete time steps, a walker moves to the nearest point, which has not been visited in the last mu steps (memory), producing a deterministic partially self-avoiding walk (the tourist walk). We have analytically obtained the distribution of the number n of points explored by the walker with memory mu=2, as well as the transient and period joint distribution. This result enables us to explain the abrupt change in the exploratory behavior between the cases mu=1 (memoryless walker, driven by extreme value statistics) and mu=2 (walker with memory, driven by combinatorial statistics). In the mu=1 case, the mean newly visited points in the thermodynamic limit (N >> 1) is just < n >=e=2.72... while in the mu=2 case, the mean number < n > of visited points grows proportionally to N(1/2). Also, this result allows us to establish an equivalence between the random link model with mu=2 and random map (uncorrelated back and forth distances) with mu=0 and the abrupt change between the probabilities for null transient time and subsequent ones.

LIPSCHITZ CLASSIFICATION OF FUNCTIONS ON A HOLDER TRIANGLE

The problem of semialgebraic Lipschitz classification of quasihomogeneous polynomials on a Holder triangle is studied. For this problem, the ""moduli"" are described completely in certain combinatorial terms.

Extremal problems on sum-free sets and coverings in tridimensional spaces

Given a prime power q, define c (q) as the minimum cardinality of a subset H of F 3 q which satisfies the following property: every vector in this space di ff ers in at most 1 coordinate from a multiple of a vector in H. In this work, we introduce two extremal problems in combinatorial number theory aiming to discuss a known connection between the corresponding coverings and sum-free sets. Also, we provide several bounds on these maps which yield new classes of coverings, improving the previous upper bound on c (q)

Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing

This work deals with the problem of minimizing the waste of space that occurs on a rotational placement of a set of irregular bi-dimensional items inside a bi-dimensional container. This problem is approached with a heuristic based on Simulated Annealing (SA) with adaptive neighborhood. The objective function is evaluated in a constructive approach, where the items are placed sequentially. The placement is governed by three different types of parameters: sequence of placement, the rotation angle and the translation. The rotation applied and the translation of the polygon are cyclic continuous parameters, and the sequence of placement defines a combinatorial problem. This way, it is necessary to control cyclic continuous and discrete parameters. The approaches described in the literature deal with only type of parameter (sequence of placement or translation). In the proposed SA algorithm, the sensibility of each continuous parameter is evaluated at each iteration increasing the number of accepted solutions. The sensibility of each parameter is associated to its probability distribution in the definition of the next candidate.

Generation and Analysis of Interaction Energy Maps of p-Substituted Benzoic Acid [(5-Nitro-thiophen-2-yl)-methylene]-Hydrazides Active against MRSA

In this preliminary study eighteen p-substituted benzoic acid [(5-nitro-thiophen-2-yl)-methylene]-hydrazides with antimicrobial activity were evaluated against multidrug-resistant Staphylococcus aureus, correlating the three-dimensional characteristics of the ligands with their respective bioactivities. The computer programs Sybyl and CORINA were used, respectively, for the design and three-dimensional conversion of the ligands. Molecular interaction fields were calculated using GRID program. Calculations using Volsurf resulted in a statistically consistent model with 48 structural descriptors showing that hydrophobicity is a fundamental property in the analyzed biological response.

Novel and facile solution-phase synthesis of 2,5-diketopiperazines and O-glycosylated analogs

This work describes the synthesis in Solution of a series of related diketopiperazines with potential biological activities: cyclo(L-Pro-L-Ser), cyclo(L-Phe-L-Ser), cyclo(D-Phe-L-Ser) and the corresponding glycosylated analogs of the latter, cyclo[D-Phe-L-Ser(alpha GlcNAc)] and cyclo[D-Phe-L-Ser(beta GlcNAc)]. The synthetic approach involved coupling reactions of -OH or O-glycosylated serine benzyl esters with NFmoc-protected amino acids (Pro or Phe), followed by one-pot deprotection-cyclization reaction in the presence of 20% piperidine in DMF. (C) 2009 Elsevier Ltd. All rights reserved.

Characterization of proteinases from the midgut of Rhipicephalus (Boophilus) microplus involved in the generation of antimicrobial peptides

Background: Hemoglobin is a rich source of biologically active peptides, some of which are potent antimicrobials (hemocidins). A few hemocidins have been purified from the midgut contents of ticks. Nonetheless, how antimicrobials are generated in the tick midgut and their role in immunity is still poorly understood. Here we report, for the first time, the contribution of two midgut proteinases to the generation of hemocidins. Results: An aspartic proteinase, designated BmAP, was isolated from the midgut of Rhipicephalus (Boophilus) microplus using three chromatographic steps. Reverse transcription-quantitative polymerase chain reaction revealed that BmAP is restricted to the midgut. The other enzyme is a previously characterized midgut cathepsin L-like cysteine proteinase designated BmCL1. Substrate specificities of native BmAP and recombinant BmCL1 were mapped using a synthetic combinatorial peptide library and bovine hemoglobin. BmCL1 preferred substrates containing non-polar residues at P2 subsite and polar residues at P1, whereas BmAP hydrolysed substrates containing non-polar amino acids at P1 and P1`. Conclusions: BmAP and BmCL1 generate hemocidins from hemoglobin alpha and beta chains in vitro. We postulate that hemocidins may be important for the control of tick pathogens and midgut flora.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Density profiles in the raise and peel model with and without a wall; physics and combinatorics

We consider the raise and peel model of a one-dimensional fluctuating interface in the presence of an attractive wall. The model can also describe a pair annihilation process in disordered unquenched media with a source at one end of the system. For the stationary states, several density profiles are studied using Monte Carlo simulations. We point out a deep connection between some profiles seen in the presence of the wall and in its absence. Our results are discussed in the context of conformal invariance ( c = 0 theory). We discover some unexpected values for the critical exponents, which are obtained using combinatorial methods. We have solved known ( Pascal`s hexagon) and new (split-hexagon) bilinear recurrence relations. The solutions of these equations are interesting in their own right since they give information on certain classes of alternating sign matrices.

Fragment-Based QSAR and Molecular Modeling Studies on a Series of Discodermolide Analogs as Microtubule-Stabilizing Anticancer Agents

Inhibition of microtubule function is an attractive rational approach to anticancer therapy. Although taxanes are the most prominent among the microtubule-stabilizers, their clinical toxicity, poor pharmacokinetic properties, and resistance have stimulated the search for new antitumor agents having the same mechanism of action. Discodermolide is an example of nontaxane natural product that has the same mechanism of action, demonstrating superior antitumor efficacy and therapeutic index. The extraordinary chemical and biological properties have qualified discodermolide as a lead structure for the design of novel anticancer agents with optimized therapeutic properties. In the present work, we have employed a specialized fragment-based method to develop robust quantitative structure - activity relationship models for a series of synthetic discodermolide analogs. The generated molecular recognition patterns were combined with three-dimensional molecular modeling studies as a fundamental step on the path to understanding the molecular basis of drug-receptor interactions within this important series of potent antitumoral agents.

Classical and hologram QSAR studies on a series of inhibitors of trypanosomatid Glyceraldehyde-3-Phosphate Dehydrogenase

Leishmaniasis and trypanosomiasis are major causes of morbidity and mortality in both tropical and subtropical regions of the world. The current available drugs are limited, ineffective, and require long treatment regimens. Due to the high dependence of trypanosomatids on glycolysis as a source of energy, some glycolytic enzymes have been identified as attractive targets for drug design. In the present work, classical Two-Dimensional Quantitative Structure -Activity Relationships (2D QSAR) and Hologram QSAR (HQSAR) studies were performed on a series of adenosine derivatives as inhibitors of Leishmania mexicana Glyceraldehyde-3-Phosphate Dehydrogenase (LmGAPDH). Significant correlation coefficients (classical QSAR, r(2)=0.83 and q(2) =0.81; HQSAR, r(2)=0.91 and q(2) =0.86) were obtained for the 56 training set compounds, indicating the potential of the models for untested compounds. The models were then externally validated using a test set of 14 structurally related compounds and the predicted values were in good agreement with the experimental results (classical QSAR, r(pred)(2) = 0.94; HQSAR, r(pred)(2) = 0.92).

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

Testing permutation properties through subpermutations

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said to be testable if it can be estimated accurately in this way. The algorithmic appeal is evident, as, conditional on sampling, this leads to reliable constant-time randomized estimators. Our paper addresses property testing and parameter testing for permutations in a subpermutation perspective; more precisely, we investigate permutation properties and parameters that can be well approximated based on a randomly chosen subpermutation of much smaller size. In this context, we use a theory of convergence of permutation sequences developed by the present authors [C. Hoppen, Y. Kohayakawa, C.G. Moreira, R.M. Sampaio, Limits of permutation sequences through permutation regularity, Manuscript, 2010, 34pp.] to characterize testable permutation parameters along the lines of the work of Borgs et al. [C. Borgs, J. Chayes, L Lovasz, V.T. Sos, B. Szegedy, K. Vesztergombi, Graph limits and parameter testing, in: STOC`06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261-270.] in the case of graphs. Moreover, we obtain a permutation result in the direction of a famous result of Alon and Shapira [N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput. 37 (6) (2008) 1703-1727.] stating that every hereditary graph property is testable. (C) 2011 Elsevier B.V. All rights reserved.