Loading…
Solving the Curriculum Sequencing Problem with DNA Computing Approach
In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the gene...
Saved in:
Published in: | International journal of distance education technologies 2014-10, Vol.12 (4), p.1-18 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43 |
---|---|
cites | cdi_FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43 |
container_end_page | 18 |
container_issue | 4 |
container_start_page | 1 |
container_title | International journal of distance education technologies |
container_volume | 12 |
creator | Debbah, Amina Ben Ali, Yamina Mohamed |
description | In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the generation of a personalized learning path for each learner according to one's learner profile. This last one includes one's knowledge and preferences. In fact the CS problem is considered as NP hard problem, so many heuristics and meta-heuristics have been used to approximate its solutions. Therefore the results have shown their efficiency to solve such a problem. This work presents a DNA computing approach that aims to solve the CS problem. |
doi_str_mv | 10.4018/ijdet.2014100101 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1654666941</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ericid>EJ1050340</ericid><sourcerecordid>2931899030</sourcerecordid><originalsourceid>FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43</originalsourceid><addsrcrecordid>eNqNkctLAzEQhxdR8Hn3Iix48VKdSbLZ5FhqfSEqVM8hzSbtln2Z3VX8702ttCAKnhKYb2Z-wxdFxwjnDFBc5IvMducEkCEAAm5Fe5hQOaCIcnv9B9iN9tt2AUBQMroXjSd18ZZXs7ib23jUe5-bvujLeGJfe1uZZeXJ19PClvF73s3jy4dhPKrLpu-WpWHT-Fqb-WG043TR2qPv9yB6uRo_j24G94_Xt6Ph_cAwIbuBJSlkzCKRWuA0A02QojHEcueMSBM91ZoLio4DQyEymxHHHXM2JVMgjtGD6Gw1N6wN-dpOlXlrbFHoytZ9q5DzVFKBafIfFIBRzsg_0IRxziXDgJ7-QBd176twsyKSopASKAQKVpTxddt661Tj81L7D4WglrbUly21sRVaTlYtNhhY4-M7hAQog03GfJZvdv4co5rMBfT6N7SaqeBYbRyrleO_IiGhnwcxtbw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2931899030</pqid></control><display><type>article</type><title>Solving the Curriculum Sequencing Problem with DNA Computing Approach</title><source>ABI/INFORM global</source><source>Library & Information Science Abstracts (LISA)</source><source>Social Science Premium Collection</source><source>Library & Information Science Collection</source><source>ERIC</source><source>Education Collection</source><creator>Debbah, Amina ; Ben Ali, Yamina Mohamed</creator><creatorcontrib>Debbah, Amina ; Ben Ali, Yamina Mohamed</creatorcontrib><description>In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the generation of a personalized learning path for each learner according to one's learner profile. This last one includes one's knowledge and preferences. In fact the CS problem is considered as NP hard problem, so many heuristics and meta-heuristics have been used to approximate its solutions. Therefore the results have shown their efficiency to solve such a problem. This work presents a DNA computing approach that aims to solve the CS problem.</description><identifier>ISSN: 1539-3100</identifier><identifier>EISSN: 1539-3119</identifier><identifier>DOI: 10.4018/ijdet.2014100101</identifier><language>eng</language><publisher>Hershey: IGI Global</publisher><subject>Approximation ; Computation ; Computer System Design ; Curricula ; Curriculum ; Customization ; Deoxyribonucleic acid ; Distance education ; Distance learning ; Efficiency ; Electronic Learning ; Gene sequencing ; Heuristics ; Knowledge Management ; Learning ; Methods ; Personalized ; Scaling ; Sequencing</subject><ispartof>International journal of distance education technologies, 2014-10, Vol.12 (4), p.1-18</ispartof><rights>Copyright © 2014, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43</citedby><cites>FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2931899030/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2931899030?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,11666,21356,21359,21372,27281,27900,27901,33587,33588,33853,33854,33882,33883,34111,34112,36036,36037,43708,43855,43867,44338,74191,74366,74378,74864</link.rule.ids><backlink>$$Uhttp://eric.ed.gov/ERICWebPortal/detail?accno=EJ1050340$$DView record in ERIC$$Hfree_for_read</backlink></links><search><creatorcontrib>Debbah, Amina</creatorcontrib><creatorcontrib>Ben Ali, Yamina Mohamed</creatorcontrib><title>Solving the Curriculum Sequencing Problem with DNA Computing Approach</title><title>International journal of distance education technologies</title><description>In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the generation of a personalized learning path for each learner according to one's learner profile. This last one includes one's knowledge and preferences. In fact the CS problem is considered as NP hard problem, so many heuristics and meta-heuristics have been used to approximate its solutions. Therefore the results have shown their efficiency to solve such a problem. This work presents a DNA computing approach that aims to solve the CS problem.</description><subject>Approximation</subject><subject>Computation</subject><subject>Computer System Design</subject><subject>Curricula</subject><subject>Curriculum</subject><subject>Customization</subject><subject>Deoxyribonucleic acid</subject><subject>Distance education</subject><subject>Distance learning</subject><subject>Efficiency</subject><subject>Electronic Learning</subject><subject>Gene sequencing</subject><subject>Heuristics</subject><subject>Knowledge Management</subject><subject>Learning</subject><subject>Methods</subject><subject>Personalized</subject><subject>Scaling</subject><subject>Sequencing</subject><issn>1539-3100</issn><issn>1539-3119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>7SW</sourceid><sourceid>ALSLI</sourceid><sourceid>CJNVE</sourceid><sourceid>CNYFK</sourceid><sourceid>F2A</sourceid><sourceid>M0C</sourceid><sourceid>M0P</sourceid><sourceid>M1O</sourceid><recordid>eNqNkctLAzEQhxdR8Hn3Iix48VKdSbLZ5FhqfSEqVM8hzSbtln2Z3VX8702ttCAKnhKYb2Z-wxdFxwjnDFBc5IvMducEkCEAAm5Fe5hQOaCIcnv9B9iN9tt2AUBQMroXjSd18ZZXs7ib23jUe5-bvujLeGJfe1uZZeXJ19PClvF73s3jy4dhPKrLpu-WpWHT-Fqb-WG043TR2qPv9yB6uRo_j24G94_Xt6Ph_cAwIbuBJSlkzCKRWuA0A02QojHEcueMSBM91ZoLio4DQyEymxHHHXM2JVMgjtGD6Gw1N6wN-dpOlXlrbFHoytZ9q5DzVFKBafIfFIBRzsg_0IRxziXDgJ7-QBd176twsyKSopASKAQKVpTxddt661Tj81L7D4WglrbUly21sRVaTlYtNhhY4-M7hAQog03GfJZvdv4co5rMBfT6N7SaqeBYbRyrleO_IiGhnwcxtbw</recordid><startdate>20141001</startdate><enddate>20141001</enddate><creator>Debbah, Amina</creator><creator>Ben Ali, Yamina Mohamed</creator><general>IGI Global</general><scope>7SW</scope><scope>BJH</scope><scope>BNH</scope><scope>BNI</scope><scope>BNJ</scope><scope>BNO</scope><scope>ERI</scope><scope>PET</scope><scope>REK</scope><scope>WWN</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0-V</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88B</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CJNVE</scope><scope>CNYFK</scope><scope>DWQXO</scope><scope>E3H</scope><scope>F2A</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0P</scope><scope>M1O</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PKEHL</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEDU</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PRQQA</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7TM</scope><scope>8BP</scope></search><sort><creationdate>20141001</creationdate><title>Solving the Curriculum Sequencing Problem with DNA Computing Approach</title><author>Debbah, Amina ; Ben Ali, Yamina Mohamed</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Approximation</topic><topic>Computation</topic><topic>Computer System Design</topic><topic>Curricula</topic><topic>Curriculum</topic><topic>Customization</topic><topic>Deoxyribonucleic acid</topic><topic>Distance education</topic><topic>Distance learning</topic><topic>Efficiency</topic><topic>Electronic Learning</topic><topic>Gene sequencing</topic><topic>Heuristics</topic><topic>Knowledge Management</topic><topic>Learning</topic><topic>Methods</topic><topic>Personalized</topic><topic>Scaling</topic><topic>Sequencing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Debbah, Amina</creatorcontrib><creatorcontrib>Ben Ali, Yamina Mohamed</creatorcontrib><collection>ERIC</collection><collection>ERIC (Ovid)</collection><collection>ERIC</collection><collection>ERIC</collection><collection>ERIC (Legacy Platform)</collection><collection>ERIC( SilverPlatter )</collection><collection>ERIC</collection><collection>ERIC PlusText (Legacy Platform)</collection><collection>Education Resources Information Center (ERIC)</collection><collection>ERIC</collection><collection>CrossRef</collection><collection>ProQuest Social Sciences Premium Collection【Remote access available】</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Education Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Social Science Premium Collection</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Education Collection</collection><collection>Library & Information Science Collection</collection><collection>ProQuest Central</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM global</collection><collection>Education Database (ProQuest)</collection><collection>Library Science Database</collection><collection>Engineering Database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Education</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest One Social Sciences</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><collection>Nucleic Acids Abstracts</collection><collection>Library & Information Sciences Abstracts (LISA) - CILIP Edition</collection><jtitle>International journal of distance education technologies</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Debbah, Amina</au><au>Ben Ali, Yamina Mohamed</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><ericid>EJ1050340</ericid><atitle>Solving the Curriculum Sequencing Problem with DNA Computing Approach</atitle><jtitle>International journal of distance education technologies</jtitle><date>2014-10-01</date><risdate>2014</risdate><volume>12</volume><issue>4</issue><spage>1</spage><epage>18</epage><pages>1-18</pages><issn>1539-3100</issn><eissn>1539-3119</eissn><abstract>In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the generation of a personalized learning path for each learner according to one's learner profile. This last one includes one's knowledge and preferences. In fact the CS problem is considered as NP hard problem, so many heuristics and meta-heuristics have been used to approximate its solutions. Therefore the results have shown their efficiency to solve such a problem. This work presents a DNA computing approach that aims to solve the CS problem.</abstract><cop>Hershey</cop><pub>IGI Global</pub><doi>10.4018/ijdet.2014100101</doi><tpages>18</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1539-3100 |
ispartof | International journal of distance education technologies, 2014-10, Vol.12 (4), p.1-18 |
issn | 1539-3100 1539-3119 |
language | eng |
recordid | cdi_proquest_miscellaneous_1654666941 |
source | ABI/INFORM global; Library & Information Science Abstracts (LISA); Social Science Premium Collection; Library & Information Science Collection; ERIC; Education Collection |
subjects | Approximation Computation Computer System Design Curricula Curriculum Customization Deoxyribonucleic acid Distance education Distance learning Efficiency Electronic Learning Gene sequencing Heuristics Knowledge Management Learning Methods Personalized Scaling Sequencing |
title | Solving the Curriculum Sequencing Problem with DNA Computing Approach |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-25T12%3A23%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Solving%20the%20Curriculum%20Sequencing%20Problem%20with%20DNA%20Computing%20Approach&rft.jtitle=International%20journal%20of%20distance%20education%20technologies&rft.au=Debbah,%20Amina&rft.date=2014-10-01&rft.volume=12&rft.issue=4&rft.spage=1&rft.epage=18&rft.pages=1-18&rft.issn=1539-3100&rft.eissn=1539-3119&rft_id=info:doi/10.4018/ijdet.2014100101&rft_dat=%3Cproquest_cross%3E2931899030%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c489t-e270d4e129a81bd0a2131cc2e6ffc875abaa6831f604188ded2f6f4fe72b02f43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2931899030&rft_id=info:pmid/&rft_ericid=EJ1050340&rfr_iscdi=true |