A winner determination algorithm for multi-unit combinatorial auctions with reserve prices

Combinatorial auction mechanisms have been used in many applications such as resource and task allocation, planning and time scheduling in multi-agent systems, in which the items to be allocated are complementary or substitutable. The winner determination in combinatorial auction itself is a NP-complete problem, and has attracted many attentions of researchers world wide. Some outstanding achievements have been made including CPLEX and CABOB algorithms on this topic. To our knowledge, the research into multi-unit combinatorial auctions with reserve prices considered is more or less ignored. To this end, we present a new algorithm for multi-unit combinatorial auctions with reserve prices, which is based on Sandholm's work. An efficient heuristic function is developed for the new algorithm. Experiments have been conducted. The experimental results show that auctioneer agent can find the optimal solution efficiently for a reasonable problem scale with our algorithm.

Combinatorial problem arising in chaotic control

An optimization problem arising in the analysis of controllability and stabilization of cycles in discrete time chaotic systems is considered.

Development of combinatorial RNAi transgenes targeting influenza virus

This research investigated the optimization of RNA interference against influenza A viruses. Results obtained in this study increase knowledge of the use of RNA interference in the context of creating antiviral transgenes capable of simultaneously targeting multiple viral genes and preventing the risk of viral escape.

Lingo: linearized grassmannian optimization for nuclear norm minimization

As a popular heuristic to the matrix rank minimization problem, nuclear norm minimization attracts intensive research attentions. Matrix factorization based algorithms can reduce the expensive computation cost of SVD for nuclear norm minimization. However, most matrix factorization based algorithms fail to provide the theoretical guarantee for convergence caused by their non-unique factorizations. This paper proposes an efficient and accurate Linearized Grass-mannian Optimization (Lingo) algorithm, which adopts matrix factorization and Grassmann manifold structure to alternatively minimize the subproblems. More specially, linearization strategy makes the auxiliary variables unnecessary and guarantees the close-form solution for low periteration complexity. Lingo then converts linearized objective function into a nuclear norm minimization over Grass-mannian manifold, which could remedy the non-unique of solution for the low-rank matrix factorization. Extensive comparison experiments demonstrate the accuracy and efficiency of Lingo algorithm. The global convergence of Lingo is guaranteed with theoretical proof, which also verifies the effectiveness of Lingo.

Combinatorial identities and quantum state densities of supersymmetric sigma models on N-folds

There is a remarkable connection between the number of quantum states of conformal theories and the sequence of dimensions of Lie algebras. In this paper, we explore this connection by computing the asymptotic expansion of the elliptic genus and the microscopic entropy of black holes associated with (supersymmetric) sigma models. The new features of these results are the appearance of correct prefactors in the state density expansion and in the coefficient of the logarithmic correction to the entropy.

Grassmannian and bosonic Thirring models with jump defects

In this paper we discuss the Lax formulation of the Grassmannian and Bosonic Thirring models in the presence of jump defects. For the Grassmannian case, the defect is described by Backlund transformation which is responsible for preserving the integrability of the model. We then propose an extension of the Backlund transformation for the Bosonic Thirring model which is verified by some Backlund transitions like vacuum-one soliton, one soliton-one soliton, one soliton-two solitons and two solitons-two solitons. The Lax formulation within the space split by the defect leads to the integrability of Bosonic Thirring model with jump defects.

Combinatorial synthesis and directed evolution applied to the production of alpha-helix forming antimicrobial peptides analogues

Antimicrobial peptides (AMPs) are effector molecules of innate immune systems found in different groups of organisms, including microorganisms, plants, insects, amphibians and humans. These peptides exhibit several structural motifs but the most abundant AMPs assume an amphipathic alpha-helical structure. The alpha-helix forming antimicrobial peptides are excellent candidates for protein engineering leading to an optimization of their biological activity and target specificity. Nowadays several approaches are available and this review deals with the use of combinatorial synthesis and directed evolution in order to provide a high-throughput source of antimicrobial peptides analogues with enhanced lytic activity and specificity.

A natural combinatorial chemistry strategy in acylpolyamine toxins from Nephilinae orb-web spiders

The present study shows how nature combined a small number of chemical building blocks to synthesize the acylpolyamine toxins in the venoms of Nephilinae orb-web spiders. Considering these structures in four parts, it was possible to rationalize a way to represent the natural combinatorial chemistry involved in the synthesis of these toxins: an aromatic moiety is connected through a linker amino acid to a polyamine chain, which in turn may be connected to an optional tail. The polyamine chains were classified into seven subtypes (from A to G) depending on the way the small chemical blocks are combined. These polyamine chains may be connected to one of the three possible chromophore moieties: 2,4-dihydroxyphenyl acetic acid, or 4-hydroxyindole acetic acid, or even with the indole acetic group. The connectivity between the aryl moiety and the polyamine chain is usually made through an asparagine residue; optionally a tail may be attached to the polyamine chain; nine different types of tails were identified among the 72 known acylpolyamine toxin structures. The combinations of three chromophores, two types of amino acid linkers, seven sub-types of polyamine backbone, and nine options of tails results in 378 different structural possibilities. However, we detected only 91 different toxin structures, which may represent the most successful structural trials in terms of efficiency of prey paralysis/death.