DNA computing algorithm for recyclable waste paper sorting

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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 pages14
JournalComputer Systems Science and Engineering
Volume29
Issue number5
Publication statusPublished - 1 Sep 2014

Fingerprint

Waste paper
DNA Computing
Sorting
DNA
Recycling
Template matching
Template Matching
Throughput
Fatigue
Replication
Parallelism
Inspection
Silicon
Raw materials
Fatigue of materials
Verify
Processing
Energy

Keywords

  • DNA computing
  • Riper grade
  • Template matching
  • Waste paper sorting

ASJC Scopus subject areas

  • Computer Science(all)
  • Control and Systems Engineering
  • Theoretical Computer Science

Cite this

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

In: Computer Systems Science and Engineering, Vol. 29, No. 5, 01.09.2014, p. 361-374.

Research output: Contribution to journalArticle

@article{44cf50ceb6a4441180258146f7a44d42,
title = "DNA computing algorithm for recyclable waste paper sorting",
abstract = "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.",
keywords = "DNA computing, Riper grade, Template matching, Waste paper sorting",
author = "Rahman, {Mohammad Osiur} and Aini Hussain and Edgar Scavino and {M A}, Hannan and Hassan Basri",
year = "2014",
month = "9",
day = "1",
language = "English",
volume = "29",
pages = "361--374",
journal = "Computer Systems Science and Engineering",
issn = "0267-6192",
publisher = "CRL Publishing",
number = "5",

}

TY - JOUR

T1 - DNA computing algorithm for recyclable waste paper sorting

AU - Rahman, Mohammad Osiur

AU - Hussain, Aini

AU - Scavino, Edgar

AU - M A, Hannan

AU - Basri, Hassan

PY - 2014/9/1

Y1 - 2014/9/1

N2 - 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 - 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.

KW - DNA computing

KW - Riper grade

KW - Template matching

KW - Waste paper sorting

UR - http://www.scopus.com/inward/record.url?scp=84913584740&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84913584740&partnerID=8YFLogxK

M3 - Article

VL - 29

SP - 361

EP - 374

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 5

ER -