Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
... Zuwairie Ibrahim, Mohd Saufee Muhammad, Yusei Tsuboi, Osamu Ono Institute of Applied DNA Computing (IADC) Meiji University Kanagawa, Japan (zuwairie, tsuboi ... 20 µl 10x T4 Kinase Buffer (TOYOBO, Japan), 1 µl Kinase (TOYOBO, Japan),... more
... Zuwairie Ibrahim, Mohd Saufee Muhammad, Yusei Tsuboi, Osamu Ono Institute of Applied DNA Computing (IADC) Meiji University Kanagawa, Japan (zuwairie, tsuboi ... 20 µl 10x T4 Kinase Buffer (TOYOBO, Japan), 1 µl Kinase (TOYOBO, Japan), and 57 µl H20 (Maxim Biotech). ...
... Ibrahim et al. ... Note that all possible end paths of elevator A are joined with the start path of elevator B. Similarly, all possible end paths of elevator B are joined with the start path of elevator C. This is done in order that... more
... Ibrahim et al. ... Note that all possible end paths of elevator A are joined with the start path of elevator B. Similarly, all possible end paths of elevator B are joined with the start path of elevator C. This is done in order that the total output of the graph G (A, B ... 1188 MS Muhammad et al. ...
... of Electronic and Bioinformatics Meiji University Kanagawa, Japan e-mail: khairul.hamimah@ yahoo.com , ono@isc.meiji.ac.jp A ... Due to the increasing amount of registered images (mid-profiles and left and right profiles), we... more
... of Electronic and Bioinformatics Meiji University Kanagawa, Japan e-mail: khairul.hamimah@ yahoo.com , ono@isc.meiji.ac.jp A ... Due to the increasing amount of registered images (mid-profiles and left and right profiles), we introduce a customized yet simple pose estimator. ...
We propose a new DNA-based semantic model, constructed of DNA molecules, called a semantic model based on molecular computing (SMC). It is structured as a graph formed by the set of all (attribute, attribute value) pairs contained in the... more
We propose a new DNA-based semantic model, constructed of DNA molecules, called a semantic model based on molecular computing (SMC). It is structured as a graph formed by the set of all (attribute, attribute value) pairs contained in the set of represented objects, plus a tag node for each object. Each path in the network, from an initial object-representing tag node to the terminal node, represents the object named on the tag. Inputting a set of input strands the forms object-representing dsDNAs via parallel self-assembly from encoded ssDNAs representing both attributes and attribute values (nodes), as directed by ssDNA splitting strands representing relations (edges) in the network. The success of experiments in constructing a small test model demonstrates that our proposed model suitably represents knowledge to storing vast amounts of information at high density.
This paper presents the implementation of moment invariants; with respect to centroid point obtained from frontal mugshot images, for thermal-based face identification system. Initially, seeded region growing method is applied for... more
This paper presents the implementation of moment invariants; with respect to centroid point obtained from frontal mugshot images, for thermal-based face identification system. Initially, seeded region growing method is applied for background filtering. Sequentially, the system decomposes a background filtered thermal image into 4 thermal regions via 3-valued threshold method. Region with the lowest thermal value is omitted from further
ABSTRACT
ABSTRACT
In this paper, a new infrared-based face identification system based on an input image decomposition is presented. The proposed image decomposition is a novel approach to transform an infrared image into a multilayer infrared image based... more
In this paper, a new infrared-based face identification system based on an input image decomposition is presented. The proposed image decomposition is a novel approach to transform an infrared image into a multilayer infrared image based on energy levels. Image decomposition is done by firstly applying false-color palette to the input image which will then be decomposed according to each
Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing... more
Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing approach. However, by using this approach, the minimum weight of edges that can be encoded is limited. Hence, in this paper, the lower bound, in term of minimum weight that
DNA computing methods based on complementary characteristics and massive parallelism facilitate the solution of complex large-scale problems such as NP-complete problems. In this paper, we design a computer simulation system that... more
DNA computing methods based on complementary characteristics and massive parallelism facilitate the solution of complex large-scale problems such as NP-complete problems. In this paper, we design a computer simulation system that corresponds to a basic DNA computing algorithm using list processing. Using the proposed simulation system we are able to predict a scale problem of biochemical calculations. The simulation system
DNA computing approach has gained wide interest in recent years since Adleman shows that the technique can be used to solve the Hamiltonian Path Problem (HPP). Since then there has been many research results showing how DNA computing is... more
DNA computing approach has gained wide interest in recent years since Adleman shows that the technique can be used to solve the Hamiltonian Path Problem (HPP). Since then there has been many research results showing how DNA computing is used to solve a variety of similar combinatorial problems which is mainly in the realm of computer science. However, the application
In this paper, we introduce an adaptive DNA computing algorithm by using polymerase chain reaction (PCR) and restriction enzyme. The adaptive algorithm is designed based on Adleman-Lipton paradigm[3] of DNA computing. In this work,... more
In this paper, we introduce an adaptive DNA computing algorithm by using polymerase chain reaction (PCR) and restriction enzyme. The adaptive algorithm is designed based on Adleman-Lipton paradigm[3] of DNA computing. In this work, however, unlike the Adleman- Lipton architecture a cutting operation has been introduced to the algorithm and the mechanism in which the molecules used by computation were feedback to the next cycle devised. Moreover, the amplification by PCR is performed in the molecule used by feedback and the difference concentration arisen in the base sequence can be used again. By this operation the molecules which serve as a solution candidate can be reduced down and the optimal solution is carried out in the shortest path problem. The validity of the proposed adaptive algorithm is considered with the logical simulation and finally we go on to propose applying adaptive algorithm to the chemical experiment which used the actual DNA molecules for solving an optimal network problem.
... 214 Z. Ibrahim et al. ... in a 25 µl solution containing 7.842 µl oligos (Proligo Primers & Probes, USA), 2.5 µl dNTP (TOYOBO, Japan), 2.5 µl 10x KOD dash buffer (TOYOBO, Japan), 0.125 µl KOD dash (TOYOBO, Japan), and 12.033... more
... 214 Z. Ibrahim et al. ... in a 25 µl solution containing 7.842 µl oligos (Proligo Primers & Probes, USA), 2.5 µl dNTP (TOYOBO, Japan), 2.5 µl 10x KOD dash buffer (TOYOBO, Japan), 0.125 µl KOD dash (TOYOBO, Japan), and 12.033 µl double distilled water (ddH20) (Maxim Biotech ...
... Zuwairie Ibrahim, Mohd Saufee Muhammad, Yusei Tsuboi, Osamu Ono Institute of Applied DNA Computing (IADC) Meiji University Kanagawa, Japan (zuwairie, tsuboi ... 20 µl 10x T4 Kinase Buffer (TOYOBO, Japan), 1 µl Kinase (TOYOBO, Japan),... more
... Zuwairie Ibrahim, Mohd Saufee Muhammad, Yusei Tsuboi, Osamu Ono Institute of Applied DNA Computing (IADC) Meiji University Kanagawa, Japan (zuwairie, tsuboi ... 20 µl 10x T4 Kinase Buffer (TOYOBO, Japan), 1 µl Kinase (TOYOBO, Japan), and 57 µl H20 (Maxim Biotech). ...

And 96 more