We present a new random array format together with a decoding scheme for targeted multiplex digital molecular analyses. DNA samples are analyzed using multiplex sets of padlock or selector probes that create circular DNA molecules upon target recognition. The circularized DNA molecules are amplified through rolling-circle amplification (RCA) to generate amplified single molecules (ASMs). A rand...

Considering the engineering problem of electric energy meter automatic verification and scheduling, this paper proposes a novel scheduling scheme based on an improved Q-learning algorithm. First, by introducing state variables behavior variables, ranking combinatorial optimization is transformed into sequential decision problem. Then, reward function proposed to evaluate pros cons different str...

Abstract Squeezed vacuum state of light is an important concept quantum optics which has uncertainty reduction in a specific quadrature compared to the coherent state. The Ising machines (CIMs) based on squeezed are capable searching ground model, can be used solve combinatorial optimization problems and have been experimentally demonstrated excellent computational performance. This review intr...

Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in ...

Clonal heterogeneity and selection underpin many biological processes including development and tumor progression. Combinatorial fluorescent protein expression in germline cells has proven its utility for tracking the formation and regeneration of different organ systems. Such cell populations encoded by combinatorial fluorescent proteins are also attractive tools for understanding clonal expan...

Combinatorial designs are powerful mathematical tools with comprehensive and simple algebraic structures. Recently, many researchers have used combinatorial designs as key predistribution schemes in wireless sensor networks (WSNs). Previous studies on security of WSNs are mainly concentrated on those networks containing nodes with the same capabilities. Further, investigations reveal that high ...

This paper presents a combinatorial polynomial-time algorithm for minimizing submod-ular set functions. The algorithm employs a scaling scheme that uses a ow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the largest length of the functio...

A parsimonious parameterization scheme is proposed to model the sparse Volterra filter so that the number of Volterra kernels to be estimated is greatly reduced. Representing the Volterra filter using a linear vector equation, the genetic algorithm is applied to search the significant terms among all possible candidate vectors. As the significant terms are detected, the associated Volterra kern...

Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...

Taking into account the supplier involvement in the new product development (NPD), this article focuses on the synthesis evaluation, and selection of the part design scheme in part deployment process. The concepts of performance indicator (PI) and integrated performance indicators (IPI) are introduced to measure the performance of the part design scheme and product design scheme respectively. A...