Related papers: Modular Arithmetic Expressions and Primality Testi…
We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all…
This paper addresses the problem of sequential submodular maximization: selecting and ranking items in a sequence to optimize some composite submodular function. In contrast to most of the previous works, which assume access to the utility…
Genetic Programming is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use Genetic Programming to develop surrogate models to mitigate…
The ability to compose code in a modular fashion is important to the construction of large programs. In the logic programming setting, it is desirable that such capabilities be realized through logic-based devices. We describe an approach…
Large protein complexes are assembled from protein subunits to form a specific structure. In our theoretic work, we propose that assembly into the correct structure could be reliably achieved through an assembly line with a specific…
With the progressive scale-down of semiconductor's feature size, people are looking forward to More Moore and More than Moore. In order to offer a possible alternative implementation process, people are trying to figure out a feasible…
Tile Automata is a recently defined model of self-assembly that borrows many concepts from cellular automata to create active self-assembling systems where changes may be occurring within an assembly without requiring attachment. This model…
Let $R$ be an $n\times n$ expanding matrix with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set $\mathcal{D}\subset\mathbb{Z}^n$ so that the integral self-affine set…
Experiments have reached a monumental capacity for designing and synthesizing microscopic particles for self-assembly, making it possible to precisely control particle concentrations, shapes, and interactions. However, more physical insight…
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…
We describe the generic modules in each component of the spaces of representations of certain string algebras. In so doing, we calculate the dimensions of higher self-extension groups for generic modules. This algorithm lends itself for use…
The operation of binary intermolecular recombination, originating in the theory of DNA computing, permits a natural generalization to n-ary operations which perform simultaneous recombination of n molecules. In the case n = 3, we use…
Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than…
We present assembly-theory, a Rust package for computing assembly indices of covalently bonded molecular structures. This is a key complexity measure of assembly theory, a recent theoretical framework quantifying selection across diverse…
We investigate general properties of non-deterministic self-assembly with asymmetric interactions, using a computational model and DNA tile assembly experiments. By contrasting symmetric and asymmetric interactions we show that the latter…
Self-assembly materials are traditionally designed so that molecular or meso-scale components form a single kind of large structure. Here, we propose a scheme to create "multifarious assembly mixtures", which self-assemble many different…
Machine-part cell formation is used in cellular manufacturing in order to process a large variety, quality, lower work in process levels, reducing manufacturing lead-time and customer response time while retaining flexibility for new…
Mutation testing is a widely recognized technique for assessing and enhancing the effectiveness of software test suites by introducing deliberate code mutations. However, its application often results in overly large test suites, as…
Self-assembly is one of the most promising strategies for making functional materials at the nanoscale, yet new design principles for making self-limiting architectures, rather than spatially unlimited periodic lattice structures, are…
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and…