DNA computing algorithm for recyclable waste paper sorting

Mohammad Osiur Rahman, Aini Hussain, Edgar Scavino, M. A. Hannan, Hassan Basri

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

© 2014 CRL Publishing Ltd. This article explores the applicability of DNA Computing in recyclable waste paper sorting. The primary challenge in the recycling of paper is to obtain raw material with the highest purity. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams will facilitate high quality end product, and save processing chemicals and energy. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over manual paper sorting systems in terms of fatigue, throughput, speed, and accuracy. In this research, a new DNA computing algorithm has been designed. It is based on the template matching technique for segregating recyclable waste paper according to its grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method for real time inspection. The algorithm is implemented using silicon-based computer to verify the success rate in paper grade identification.
Original languageEnglish
Pages (from-to)361-374
Number of pages323
JournalComputer Systems Science and Engineering
Publication statusPublished - 01 Jan 2014
Externally publishedYes

Fingerprint

Waste paper
DNA Computing
Sorting
sorting
DNA
Recycling
Template matching
Template Matching
recycling
Throughput
fatigue
Fatigue
silicon
Replication
Parallelism
Inspection
Silicon
Raw materials
waste paper
Fatigue of materials

All Science Journal Classification (ASJC) codes

  • Building and Construction
  • Energy(all)
  • Mechanical Engineering
  • Management, Monitoring, Policy and Law

Cite this

Rahman, Mohammad Osiur ; Hussain, Aini ; Scavino, Edgar ; Hannan, M. A. ; Basri, Hassan. / DNA computing algorithm for recyclable waste paper sorting. In: Computer Systems Science and Engineering. 2014 ; pp. 361-374.
@article{7620cc9ae678454a8c338bf412f6b5c6,
title = "DNA computing algorithm for recyclable waste paper sorting",
abstract = "{\circledC} 2014 CRL Publishing Ltd. This article explores the applicability of DNA Computing in recyclable waste paper sorting. The primary challenge in the recycling of paper is to obtain raw material with the highest purity. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams will facilitate high quality end product, and save processing chemicals and energy. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over manual paper sorting systems in terms of fatigue, throughput, speed, and accuracy. In this research, a new DNA computing algorithm has been designed. It is based on the template matching technique for segregating recyclable waste paper according to its grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method for real time inspection. The algorithm is implemented using silicon-based computer to verify the success rate in paper grade identification.",
author = "Rahman, {Mohammad Osiur} and Aini Hussain and Edgar Scavino and Hannan, {M. A.} and Hassan Basri",
year = "2014",
month = "1",
day = "1",
language = "English",
pages = "361--374",
journal = "Computer Systems Science and Engineering",
issn = "0267-6192",
publisher = "CRL Publishing",

}

DNA computing algorithm for recyclable waste paper sorting. / Rahman, Mohammad Osiur; Hussain, Aini; Scavino, Edgar; Hannan, M. A.; Basri, Hassan.

In: Computer Systems Science and Engineering, 01.01.2014, p. 361-374.

Research output: Contribution to journalArticle

TY - JOUR

T1 - DNA computing algorithm for recyclable waste paper sorting

AU - Rahman, Mohammad Osiur

AU - Hussain, Aini

AU - Scavino, Edgar

AU - Hannan, M. A.

AU - Basri, Hassan

PY - 2014/1/1

Y1 - 2014/1/1

N2 - © 2014 CRL Publishing Ltd. This article explores the applicability of DNA Computing in recyclable waste paper sorting. The primary challenge in the recycling of paper is to obtain raw material with the highest purity. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams will facilitate high quality end product, and save processing chemicals and energy. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over manual paper sorting systems in terms of fatigue, throughput, speed, and accuracy. In this research, a new DNA computing algorithm has been designed. It is based on the template matching technique for segregating recyclable waste paper according to its grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method for real time inspection. The algorithm is implemented using silicon-based computer to verify the success rate in paper grade identification.

AB - © 2014 CRL Publishing Ltd. This article explores the applicability of DNA Computing in recyclable waste paper sorting. The primary challenge in the recycling of paper is to obtain raw material with the highest purity. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams will facilitate high quality end product, and save processing chemicals and energy. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over manual paper sorting systems in terms of fatigue, throughput, speed, and accuracy. In this research, a new DNA computing algorithm has been designed. It is based on the template matching technique for segregating recyclable waste paper according to its grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method for real time inspection. The algorithm is implemented using silicon-based computer to verify the success rate in paper grade identification.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84913584740&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84913584740&origin=inward

M3 - Article

SP - 361

EP - 374

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

ER -