DNA, as an excellent nano-engineering material, contributes to a new computing model, namely, DNA computing. This model is a type of biological computing, which takes advantage of the high density and high parallelism of molecules. One of the current methods of implementing DNA computing is to construct DNA circuits, among which the toehold-mediated DNA strand displacement technique is an important method. The hybridization of toehold domains provides the start position and accelerates the branch migration process. Toehold-based DNA combinatorial displacement is a practical method for designing and implementing DNA circuits. In this paper, we designed and simulated a multiplexer using the DNA combinatorial displacement mechanism to verify its practicability. Additionally, we improved and optimized the existing logic INHIBIT gate by leveraging the DNA combinatorial displacement mechanism so that the DNA strands in the entire chemical reaction network (CRN) system are capable of coexisting in large quantities. Moreover, we applied this improvement to the demultiplexer. Our method provides more capabilities to larger and more complicated DNA integrated circuits. INDEX TERMS Combinatorial strand displacement, logic gate, CRN, DNA computing.

Software transactional memory is an effective mechanism to avoid concurrency bugs in multithreaded programs. However, two problems hinder the adoption of such traditional systems in the wild world: high human cost for equipping programs with transaction functionality and low compatibility with I/O calls and conditional variables. This paper presents Convoider to solve these problems. By intercepting interthread operations and designating code among them as transactions in each thread, Convoider automatically transactionalizes target programs without any source code modification and recompiling. By saving/restoring stack frames and CPU registers on beginning/aborting a transaction, Convoider makes execution flow revocable. By turning threads into processes, leveraging virtual memory protection and customizing memory allocation/deallocation, Convoider makes memory manipulations revocable. By maintaining virtual file systems and redirecting I/O operations onto them, Convoider makes I/O effects revocable. By converting lock/unlock operations to no-ops, customizing signal/wait operations on condition variables, and committing memory changes transactionally, Convoider makes deadlocks, data races, and atomicity violations impossible. Experimental results show that Convoider succeeds in transparently transactionalizing twelve real-world applications with averagely incurring only 28% runtime overhead and perfectly avoid 94% of thirty-one concurrency bugs used in our experiments. This study can help efficiently transactionalize legacy multithreaded applications and effectively improve the runtime reliability of them.

In this paper, we establish some new Hermite–Hadamard-type inequalities involving ψ-Riemann–Liouville fractional integrals via s-convex functions in the second sense. Meanwhile, we present many useful estimates on these types of new Hermite–Hadamard-type inequalities. Finally, we give some applications to special means of real numbers.

No abstract

No abstract