Computational hardness of spin-glass problems with tile-planted solutions.

We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into edge-disjoint subgraphs and planting frustrated, elementary subproblems that share a common local ground state, which guarantees that the ground state of the entire problem is known a priori. Using population annealing Monte Carlo, we compare the typical hardness of problem classes over a large region of the multidimensional tuning parameter space.

From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems.

We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model defined on a cubic lattice, where subproblems, whose couplers are restricted to the two values {-1,+1}, are specified on unit cubes and are parametrized by their local degeneracy. The construction is shown to be equivalent to a type of three-dimensional constraint-satisfaction problem known as the tiling puzzle.

Inhibitory effect of live-attenuated Listeria monocytogenes-based vaccines expressing MIA gene on malignant melanoma.

Listeria monocytogenes (LM), a Gram-positive facultative intracellular bacterium, can be used as an effective exogenous antigen expression vector in tumor-target therapy. But for successful clinical application, it is necessary to construct attenuated LM stain that is safe yet retains the potency of LM based on the full virulent pathogen. In this study, attenuated LM and recombinants of LM expressing melanoma inhibitory activity (MIA) were constructed successfully.