Chatchawit Aporntewan

Learn More
We propose a hardware implementation of the Compact Genetic Algorithm (Compact GA). The design is realized using Verilog HDL, then fabricated on FPGA. Our design, though simple, runs about 1,000 times faster than the software executing on a workstation. An alternative hardware for linkage learning is also proposed in order to enhance the capability of(More)
Our previous work focused on the synthesis of sequential circuits based on a partial input/output sequence. As the behavioural description of the target circuit is not known the correctness of the result can not be verified. This paper proposes a method which increases the correctness percentage of the finite-state machine (FSM) synthesis using multiple(More)
In human cancers, the methylation of long interspersed nuclear element -1 (LINE-1 or L1) retrotransposons is reduced. This occurs within the context of genome wide hypomethylation, and although it is common, its role is poorly understood. L1s are widely distributed both inside and outside of genes, intragenic and intergenic, respectively. Interestingly, the(More)
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of solutions. In simple GA, crossover operator plays an important role in mixing BBs. However, the crossover probably disrupts the BBs because the cut point is chosen at random.(More)
We propose a BB identification by simultaneity matrix (BISM) algorithm. The input is a set of -bit solutions denoted by S. The number of solutions is denoted by n = |S|. The output is a partition of bit positions {0, . . . , − 1}. The BISM is composed of Simultaneity-Matrix-Construction and Fine-Valid-Partition algorithms. Algorithm SMC is outlined as(More)
The identification of several hundred genomic regions affecting disease risk has proven the ability of genome-wide association studies have proven their ability to identify genetic contributors to disease. Currently, single-nucleotide polymorphism (SNP) association analysis is the most widely used method of genome-wide association data, but recent research(More)
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i and j. To exploit the matrix, we partition {0, . . . , − 1} by putting i and j in the same partition subset if mij is significantly high. The partition represents the bit positions(More)
This work proposes the design of a 16-bit stackbased processor. It is aimed for a limited resource embedded system. The processor data path is simple. The instruction set is minimal. The proposed design has been realized on a FPGA device. The measurement on the required resource and performance based on the test suite aimed for the smart card applications(More)
Dynamic Programming (DP) plays an important role in solving a large number of computational problems. As the number of cores per processor is increasing rapidly, new software must be capable of exploiting the advantages of multicore architectures. A typical DP begins with constructing a matrix, and then calculating each element one by one. The standard(More)