Generative and accumulative recursion made fun for beginners
In a programming classroom for beginners, a delicate balance must be struck between teaching the design, implementation, and testing fundamentals of programming and the need for students to find their first programming course enjoyable. A course that focuses solely on the fundamentals is not likely...
Gespeichert in:
| Veröffentlicht in: | Computer languages, systems & structures Jg. 44; S. 181 - 197 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Ltd
01.12.2015
|
| Schlagworte: | |
| ISSN: | 1477-8424, 1873-6866 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In a programming classroom for beginners, a delicate balance must be struck between teaching the design, implementation, and testing fundamentals of programming and the need for students to find their first programming course enjoyable. A course that focuses solely on the fundamentals is not likely to nourish the excitement a student may have for Computer Science. A course that focuses solely in making programming fun is not likely to have students walk away with a solid grasp of the fundamentals. A very successful approach to strike this balance uses functional video games to motivate the need to learn principles of program design and Computer Science in a context that is of interest and fun for most students. Such an approach has successfully engaged students to learn design and implementation principles using primitive data, finite compound data, structural recursion for compound data of arbitrary size, and abstraction. This article explores how to use a functional video game approach to engage beginning students in problem solving that employs generative and accumulative recursion while at the same time reinforcing the lessons on structural recursion and abstraction. In addition to these two new forms of recursion, beginning students are also introduced to depth-first searching, breadth-first searching, heuristic-based searching, and the use of randomness. The article uses the N-puzzle problem to illustrate how all these topics are seamlessly addressed in the beginner׳s classroom while keeping student enthusiasm high as evidenced by student feedback.
•Teaching generative and accumulative recursion to beginners is effective and fun.•Beginners learn depth-first, breadth-first, and heuristic-based searching.•Functional video games motivate students to learn principles of Computer Science.•Functional video games help close the Computer Science gender gap.•Beginners are introduced to the perils and benefits of randomness. |
|---|---|
| AbstractList | In a programming classroom for beginners, a delicate balance must be struck between teaching the design, implementation, and testing fundamentals of programming and the need for students to find their first programming course enjoyable. A course that focuses solely on the fundamentals is not likely to nourish the excitement a student may have for Computer Science. A course that focuses solely in making programming fun is not likely to have students walk away with a solid grasp of the fundamentals. A very successful approach to strike this balance uses functional video games to motivate the need to learn principles of program design and Computer Science in a context that is of interest and fun for most students. Such an approach has successfully engaged students to learn design and implementation principles using primitive data, finite compound data, structural recursion for compound data of arbitrary size, and abstraction. This article explores how to use a functional video game approach to engage beginning students in problem solving that employs generative and accumulative recursion while at the same time reinforcing the lessons on structural recursion and abstraction. In addition to these two new forms of recursion, beginning students are also introduced to depth-first searching, breadth-first searching, heuristic-based searching, and the use of randomness. The article uses the N-puzzle problem to illustrate how all these topics are seamlessly addressed in the beginner׳s classroom while keeping student enthusiasm high as evidenced by student feedback.
•Teaching generative and accumulative recursion to beginners is effective and fun.•Beginners learn depth-first, breadth-first, and heuristic-based searching.•Functional video games motivate students to learn principles of Computer Science.•Functional video games help close the Computer Science gender gap.•Beginners are introduced to the perils and benefits of randomness. In a programming classroom for beginners, a delicate balance must be struck between teaching the design, implementation, and testing fundamentals of programming and the need for students to find their first programming course enjoyable. A course that focuses solely on the fundamentals is not likely to nourish the excitement a student may have for Computer Science. A course that focuses solely in making programming fun is not likely to have students walk away with a solid grasp of the fundamentals. A very successful approach to strike this balance uses functional video games to motivate the need to learn principles of program design and Computer Science in a context that is of interest and fun for most students. Such an approach has successfully engaged students to learn design and implementation principles using primitive data, finite compound data, structural recursion for compound data of arbitrary size, and abstraction. This article explores how to use a functional video game approach to engage beginning students in problem solving that employs generative and accumulative recursion while at the same time reinforcing the lessons on structural recursion and abstraction. In addition to these two new forms of recursion, beginning students are also introduced to depth-first searching, breadth-first searching, heuristic-based searching, and the use of randomness. The article uses the N-puzzle problem to illustrate how all these topics are seamlessly addressed in the beginner super(3)s classroom while keeping student enthusiasm high as evidenced by student feedback. |
| Author | Morazán, Marco T. |
| Author_xml | – sequence: 1 givenname: Marco surname: Morazan middlename: T fullname: Morazan, Marco T |
| BookMark | eNp1kD1PwzAQhi1UJNrCzpiRJeEuThwHsaAKClIlFpgtxzkjV4lT7KQS_55UZWW6D73PSfes2MIPnhi7RcgQUNzvM9NlOWCZgcwA8IItUVY8FVKIxdwXVZXKIi-u2CrGPUAOsiiX7HFLnoIe3ZES7dtEGzP1U3deBDJTiG7wSa9bSuzkEzuEpKEv52cqXrNLq7tIN391zT5fnj82r-nuffu2edqlhpcwplJqQQYr5HmV19IIU9t5JGksb6SVBUCDRnPdSMKaIwhpOLa21qhtqTlfs7vz3UMYvieKo-pdNNR12tMwRYWVFDmKPD9F4Rw1YYgxkFWH4HodfhSCOolSe2U6dRKlQKpZ1Iw8nBGaXzg6CioaR95Q62YBo2oH9z_8C55qcVI |
| Cites_doi | 10.1145/507758.377507 10.1007/978-3-642-45340-3_10 10.1145/2597959.2597966 10.1109/FIE.2006.322457 10.1007/978-3-642-22941-1_11 10.1017/S0956796801004208 10.1007/978-3-642-32037-8_10 10.1145/209849.209850 10.1145/2676723.2677227 10.1145/7885.315712 10.1145/285070.285085 10.1145/273133.274315 10.1145/191029.191131 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd |
| Copyright_xml | – notice: 2015 Elsevier Ltd |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cl.2015.08.001 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6866 |
| EndPage | 197 |
| ExternalDocumentID | 10_1016_j_cl_2015_08_001 S1477842415000524 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 RIG ROL RPZ SDF SDG SDP SES SEW SPC SSV SSZ T5K TN5 XFK YYM ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c350t-88a6ec171327298c6c9fc17e8cf3b8f8400b1ca3ab8e1931068c31df9a1af5a33 |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366778500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1477-8424 |
| IngestDate | Wed Oct 01 12:21:52 EDT 2025 Sat Nov 29 01:36:51 EST 2025 Fri Feb 23 02:17:32 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Generative recursion Functional video games Heuristic search strategies Accumulative recursion Computer Science education |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c350t-88a6ec171327298c6c9fc17e8cf3b8f8400b1ca3ab8e1931068c31df9a1af5a33 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1786216223 |
| PQPubID | 23500 |
| PageCount | 17 |
| ParticipantIDs | proquest_miscellaneous_1786216223 crossref_primary_10_1016_j_cl_2015_08_001 elsevier_sciencedirect_doi_10_1016_j_cl_2015_08_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-12-01 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 2015-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computer languages, systems & structures |
| PublicationYear | 2015 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Findler, Clements, Flanagan, Flatt, Krishnamurthi, Steckler (bib7) 2002; 12 Morazán Marco T. Functional video games in CS1 II. In: Peña Ricardo, Page Rex L, editors. Trends in functional programming, 12th international symposium, TFP 2011, Madrid, Spain, May 16–18, 2011, Revised selected papers. Lecture notes in computer science, vol. 7193. Berlin, Germany: Springer; 2011. p. 146–62. Markov Z, Russell I, Neller T, Zlatareva N. Pedagogical possibilities for the N-puzzle problem. In: Proceedings of the frontiers in education conference, November 2006. p. S2F1–6. Rich, Knight (bib16) 1991 Dann, Cooper, Pausch (bib4) 2001; 33 Bice, DeMaio, Florence, Mimi Lin, Lindeman, Nussbaum (bib2) 2013 Astrachan Owen. Self-reference is an illustrative essential. In: Proceedings of the twenty-fifth SIGCSE symposium on computer science education. SIGCSE ׳94. New York, NY, USA: ACM; 1994. p. 238–42. Felleisen Matthias, Findler Robert Bruce, Fisler Kathi, Flatt Matthew, Krishnamurthi Shriram. How to design worlds. Gal-Ezer, Harel (bib8) 1998; 41 Russell, Norvig (bib17) 2014 Wirth Michael. The canny skipper—a puzzle for demonstrating data structures and recursion. In: Proceedings of the Western Canadian conference on computing education. WCCCE ׳14. New York, NY, USA: ACM; 2014. p. 16:1–4. Morazán Marco T. Functional video games in the CS1 classroom. In: Page Rex, Horvath Zoltan, Zsók Viktória, editors. Revised selected papers of 11th international symposium on trends in functional programming (TFP 2010). Lecture notes in computer science, vol. 6456. Berlin, Germany: Springer Verlag; 2011. p. 196–213. Haynes (bib9) 1995; 27 Wu Cheng-Chih, Dale Nell B, Bethel Lowell J. Conceptual models and cognitive learning styles in teaching recursion. In Proceedings of the twenty-ninth SIGCSE technical symposium on computer science education. SIGCSE ׳98. New York, NY, USA: ACM; 1998. p. 292–6. McCauley Renee, Hanks Brian, Fitzgerald Sue, Murphy Laurie. Recursion vs. iteration: an empirical study of comprehension revisited. In: Proceedings of the 46th ACM technical symposium on computer science education. SIGCSE ׳15. New York, NY, USA: ACM. 2015. p. 350–5. Cooper, Weaver (bib3) 2003 Felleisen, Findler, Flatt, Krishnamurthi (bib6) 2001 McCracken (bib12) 1987; 30 2008. Morazán Marco T. Functional video games in CS1 III—distributed programming for beginners. In McCarthy Jay, editor. Trends in functional programming - 14th international symposium, TFP 2013, Provo, UT, USA, May 14–16, 2013, Revised selected papers. Lecture notes in computer science, vol. 8322. Berlin, Germany: Springer; 2013. p. 149–67. Cooper (10.1016/j.cl.2015.08.001_bib3) 2003 Haynes (10.1016/j.cl.2015.08.001_bib9) 1995; 27 McCracken (10.1016/j.cl.2015.08.001_bib12) 1987; 30 Felleisen (10.1016/j.cl.2015.08.001_bib6) 2001 Gal-Ezer (10.1016/j.cl.2015.08.001_bib8) 1998; 41 10.1016/j.cl.2015.08.001_bib11 10.1016/j.cl.2015.08.001_bib10 10.1016/j.cl.2015.08.001_bib5 Bice (10.1016/j.cl.2015.08.001_bib2) 2013 10.1016/j.cl.2015.08.001_bib1 10.1016/j.cl.2015.08.001_bib19 10.1016/j.cl.2015.08.001_bib18 Findler (10.1016/j.cl.2015.08.001_bib7) 2002; 12 Dann (10.1016/j.cl.2015.08.001_bib4) 2001; 33 10.1016/j.cl.2015.08.001_bib15 10.1016/j.cl.2015.08.001_bib14 10.1016/j.cl.2015.08.001_bib13 Rich (10.1016/j.cl.2015.08.001_bib16) 1991 Russell (10.1016/j.cl.2015.08.001_bib17) 2014 |
| References_xml | – volume: 33 start-page: 109 year: 2001 end-page: 112 ident: bib4 article-title: Using visualization to teach novices recursion publication-title: SIGCSE Bull – reference: Felleisen Matthias, Findler Robert Bruce, Fisler Kathi, Flatt Matthew, Krishnamurthi Shriram. How to design worlds. 〈 – reference: Astrachan Owen. Self-reference is an illustrative essential. In: Proceedings of the twenty-fifth SIGCSE symposium on computer science education. SIGCSE ׳94. New York, NY, USA: ACM; 1994. p. 238–42. – reference: Wu Cheng-Chih, Dale Nell B, Bethel Lowell J. Conceptual models and cognitive learning styles in teaching recursion. In Proceedings of the twenty-ninth SIGCSE technical symposium on computer science education. SIGCSE ׳98. New York, NY, USA: ACM; 1998. p. 292–6. – reference: Morazán Marco T. Functional video games in CS1 II. In: Peña Ricardo, Page Rex L, editors. Trends in functional programming, 12th international symposium, TFP 2011, Madrid, Spain, May 16–18, 2011, Revised selected papers. Lecture notes in computer science, vol. 7193. Berlin, Germany: Springer; 2011. p. 146–62. – year: 1991 ident: bib16 article-title: Artificial intelligence – reference: Wirth Michael. The canny skipper—a puzzle for demonstrating data structures and recursion. In: Proceedings of the Western Canadian conference on computing education. WCCCE ׳14. New York, NY, USA: ACM; 2014. p. 16:1–4. – reference: McCauley Renee, Hanks Brian, Fitzgerald Sue, Murphy Laurie. Recursion vs. iteration: an empirical study of comprehension revisited. In: Proceedings of the 46th ACM technical symposium on computer science education. SIGCSE ׳15. New York, NY, USA: ACM. 2015. p. 350–5. – reference: Morazán Marco T. Functional video games in CS1 III—distributed programming for beginners. In McCarthy Jay, editor. Trends in functional programming - 14th international symposium, TFP 2013, Provo, UT, USA, May 14–16, 2013, Revised selected papers. Lecture notes in computer science, vol. 8322. Berlin, Germany: Springer; 2013. p. 149–67. – volume: 30 start-page: 3 year: 1987 end-page: 5 ident: bib12 article-title: Viewpoint: ruminations on computer science curricula publication-title: Commun ACM – volume: 12 start-page: 159 year: 2002 end-page: 182 ident: bib7 article-title: DrScheme publication-title: J Funct Program – year: 2003 ident: bib3 article-title: Gender and computers: understanding the digital divide – volume: 41 start-page: 77 year: 1998 end-page: 84 ident: bib8 article-title: What (else) should cs educators know? publication-title: Commun ACM – volume: 27 start-page: 3 year: 1995 end-page: 6 ident: bib9 article-title: Explaining recursion to the unsophisticated publication-title: SIGCSE Bull – reference: Morazán Marco T. Functional video games in the CS1 classroom. In: Page Rex, Horvath Zoltan, Zsók Viktória, editors. Revised selected papers of 11th international symposium on trends in functional programming (TFP 2010). Lecture notes in computer science, vol. 6456. Berlin, Germany: Springer Verlag; 2011. p. 196–213. – year: 2001 ident: bib6 article-title: How to design programs: an introduction to programming and computing – year: 2014 ident: bib17 article-title: Artificial intelligence: a modern approach – reference: 〉; 2008. – reference: Markov Z, Russell I, Neller T, Zlatareva N. Pedagogical possibilities for the N-puzzle problem. In: Proceedings of the frontiers in education conference, November 2006. p. S2F1–6. – year: 2013 ident: bib2 article-title: Realm of racket – volume: 33 start-page: 109 issue: June (3) year: 2001 ident: 10.1016/j.cl.2015.08.001_bib4 article-title: Using visualization to teach novices recursion publication-title: SIGCSE Bull doi: 10.1145/507758.377507 – year: 1991 ident: 10.1016/j.cl.2015.08.001_bib16 – ident: 10.1016/j.cl.2015.08.001_bib15 doi: 10.1007/978-3-642-45340-3_10 – year: 2001 ident: 10.1016/j.cl.2015.08.001_bib6 – ident: 10.1016/j.cl.2015.08.001_bib18 doi: 10.1145/2597959.2597966 – ident: 10.1016/j.cl.2015.08.001_bib10 doi: 10.1109/FIE.2006.322457 – ident: 10.1016/j.cl.2015.08.001_bib5 – ident: 10.1016/j.cl.2015.08.001_bib14 doi: 10.1007/978-3-642-22941-1_11 – volume: 12 start-page: 159 issue: 2 year: 2002 ident: 10.1016/j.cl.2015.08.001_bib7 article-title: DrScheme publication-title: J Funct Program doi: 10.1017/S0956796801004208 – ident: 10.1016/j.cl.2015.08.001_bib13 doi: 10.1007/978-3-642-32037-8_10 – volume: 27 start-page: 3 issue: September (3) year: 1995 ident: 10.1016/j.cl.2015.08.001_bib9 article-title: Explaining recursion to the unsophisticated publication-title: SIGCSE Bull doi: 10.1145/209849.209850 – ident: 10.1016/j.cl.2015.08.001_bib11 doi: 10.1145/2676723.2677227 – volume: 30 start-page: 3 issue: January (1) year: 1987 ident: 10.1016/j.cl.2015.08.001_bib12 article-title: Viewpoint: ruminations on computer science curricula publication-title: Commun ACM doi: 10.1145/7885.315712 – volume: 41 start-page: 77 issue: September (9) year: 1998 ident: 10.1016/j.cl.2015.08.001_bib8 article-title: What (else) should cs educators know? publication-title: Commun ACM doi: 10.1145/285070.285085 – ident: 10.1016/j.cl.2015.08.001_bib19 doi: 10.1145/273133.274315 – year: 2003 ident: 10.1016/j.cl.2015.08.001_bib3 – ident: 10.1016/j.cl.2015.08.001_bib1 doi: 10.1145/191029.191131 – year: 2013 ident: 10.1016/j.cl.2015.08.001_bib2 – year: 2014 ident: 10.1016/j.cl.2015.08.001_bib17 |
| SSID | ssj0020845 |
| Score | 2.0420706 |
| Snippet | In a programming classroom for beginners, a delicate balance must be struck between teaching the design, implementation, and testing fundamentals of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 181 |
| SubjectTerms | Accumulative recursion Balancing Classrooms Computer Science education Design engineering Electronic & video games Functional video games Generative recursion Heuristic search strategies Programming Recursion Searching Students |
| Title | Generative and accumulative recursion made fun for beginners |
| URI | https://dx.doi.org/10.1016/j.cl.2015.08.001 https://www.proquest.com/docview/1786216223 |
| Volume | 44 |
| WOSCitedRecordID | wos000366778500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6866 dateEnd: 20181231 omitProxy: false ssIdentifier: ssj0020845 issn: 1477-8424 databaseCode: AIEXJ dateStart: 20020401 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ3LT9tAEIdXbeihF6Avlae2UjlUyJXX68euxAVBoraClEOQclutJ2sJVJxACEL89cw-7AQQFT30YiVWYlv7rWZnZsfzI-RrBqmpjCkinfBRlMqyjCR6BlFRmhgpVxkYcGITRb8vhkN5EgTvpk5OoKhrcXsrJ_8VNZ5D2PbV2X_A3V4UT-BnhI5HxI7HF4H3jaRdRZBrxAowu3AaXTdWIQVmLj-2e6FHZhcXNV-uadUZ6lAL3_YtCHoPbUrTEfedn6duxvjes7OreRniMU6oO59SPcZhHYcS7JBVYNlChYY3hGmBq1fq329uLGWaLpg65qVWwqrJfJXtE4PscwPn38Fu87DMtUsN93nQ-7r_W_VOj47UoDsc7PDe5DKywmB2A32HH3pIr8lSUmRSdMjS_s_u8FcbV8fCaVG3jxx2o30Z38MbP-d9PFqHnXMxWCXLISqg-57mO_LK1O_JSkOABgP8gezN4VKESxfh0hYutXApwqUIl7ZwP5LTXndw8CMK-hcR8Cy-joTQuQFWMJ5gCCQgB1nhVyOg4qWoMDSPSwaa61IY9MMxuBfA2aiSmukq05x_Ip16XJvPhOa5HlWlsVdhtoOezFPBIcXgN9FlIpM18q0ZFzXxbU5UU_93ruCPsmOorGBpzNYIbwZOBTfNu18Kof_lX1-aMVZowey2lK7NeDZVrMComuXop66_4Dcb5O18vm6SDs50s0XewM312fRqO0yNezFGZ_I |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Generative+and+accumulative+recursion+made+fun+for+beginners&rft.jtitle=Computer+languages%2C+systems+%26+structures&rft.au=Morazan%2C+Marco+T&rft.date=2015-12-01&rft.issn=1477-8424&rft.volume=44&rft.spage=181&rft.epage=197&rft_id=info:doi/10.1016%2Fj.cl.2015.08.001&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1477-8424&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1477-8424&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1477-8424&client=summon |