DOCSLIB.ORG

69 5. PENGUJIAN PROGRAM Bab Ini Membahas Tentang Pengujian Dari

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
69 5. PENGUJIAN PROGRAM Bab Ini Membahas Tentang Pengujian Dari 5. PENGUJIAN PROGRAM Bab ini membahas tentang pengujian dari sistem yang telah dibuat pada bab 4. Pengujian ini dilakukan dengan tujuan untuk mengetahui validitas program, kekurangan dan kelebihan aplikasi ini. Pengujian ini menggunakan sebagian data thread yang telah diambil dari www.stackoverflow.com. 5.1. Pengujian Validasi Sistem Pencarian Halaman yang pertama kali tampil saat memasuki website.User diharuskan untuk login terlebih dahulu untuk dapat memasuki forum dalam website. Jika tidak mempunyai username dan passworduser dapat sign up terlebih dahulu. 5.1.1. Halaman User Pada halaman home terdapat link untuk melakukan sign up bagi user yang belum memiliki username serta password pada forum ini. Gambar 5.1. menampilkan halaman sign up bagi user yangbelum memiliki username serta password. Dilakukan percobaan untuk menginputkan user baru. Gambar 5.1.Halaman Sign up 69 Universitas Kristen Petra Gambar 5.2. Berhasil Sign up Terlihat hasil dari sign up pada gambar 5.2.yang menunjukkan id yang dibuat pada gambar 5.1. sukses didaftarkan. Gambar 5.3. Data member masuk ke database Pada gambar 5.3.datamember yang didaftarkan pada gambar 5.1. tercatat kedalam database dan muncul dalam list member pada halaman administrator. Dalam halaman home terdapat 2 sub menu yaitu home dan forum, pada bagian home terdapat topik forum terakhir yang dibuat, sehingga user mengetahui topik forum apa yang terbaru. Dilakukan pengujian jika memasukkan username dan password keliru. Gambar 5.4. Halaman homeuntuk user 70 Universitas Kristen Petra Gambar 5.5. Halaman login gagal Dilakukan pengujian apabila seseorang salah memasukkan username dan password.Pada gambar 5.5.menunjukkan halaman apabila seseorang salah untuk memasukkan username serta password. Akan tampil halaman yang menandakan username tersebut belum terdaftar. Setelah menu forum dipilih, akan muncul list judul topik yang terdapat dalam website forum jika user telah login,seperti pada Gambar 5.6. Gambar 5.6. Halaman forum untuk user 71 Universitas Kristen Petra Judul topik yang telah dipilih oleh user, ditampilkan seperti pada Gambar 5.7. akan muncul judul topik, isi topik, link topik yang berkaitan, box comment untuk menulis comment, serta tombol untuk menampilkan isi comment. Pada halaman ini user dapat menambahkan comment pada sebuah judul topik forum dengan menuliskan comment pada box comment yang telah tersedia. Comment yang telah dituliskan akan segera ditampilkan dengan menekan tombol submit comment yang telah tersedia. Pengujian dilakukan dengan menuliskan kalimat pada box comment. Gambar 5.7. Halaman topik forum yang dipilih user Gambar 5.8. Menunjukkan hasil comment yang berhasil dimasukkan 72 Universitas Kristen Petra Pada Gambar 5.8. menunjukkan bahwa isi comment yang sebelumnya telah dimasukkan pada gambar 5.7. berhasil dimasukkan. Terlihat pada comment kata yang diinputkan di awal tercatat dengan benar, dan tertampilkan di halaman. Tampilan link-link yang berkaitan dengan judul topik yang sedang dipilih oleh user seperti pada Gambar 5.9. Pilihan topik forum di ranking dimulai dari yang memiliki kedekatan dengan topik yang sedang dibaca. Ditampilkan juga untuk nilai kedekatan sebuah topik forum dengan topik forum yang saat ini sedang dikunjungi. Nilai kedekatan merupakan hasil dari nilai perhitungan Vector Space Model. Gambar 5.9. Tampilan topik forum yang berkaitan 5.1.2. Halaman Administrator Pada halaman home awal saat menginputkan username dan password untuk administrator maka akan tersambung secara langsung pada halaman awal untuk administrator. Gambar 5.10. menunjukkanhalaman awal administrator. Pada halaman ini admin dapat melihat data-data user yang telah mendaftar pada forum. 73 Universitas Kristen Petra Gambar 5.10. Halaman awal untuk Administrator Pada halaman EditForum admin gambar 5.11. dapat menambahkan judul topik forum baru dalam website. Pengujian dilakukan dengan menuliskan judul topik, isi topik dan menekan tombol submit untuk memasukkan judul topik baru. Selain itu admin juga dapat melihat secara jelas judul topik forum yang telah ada dalam website serta comment yang diberikan user terhadap topik forum tersebut. Gambar 5.11. Halaman Edit Forum untuk administrator Pada Gambar 5.12. ditunjukkan bahwa hasil pengujian pada gambar 5.11. yang dilakukan penginputan baru dan berhasil masuk dan ditampilkan. Selain itu admin juga dapat untuk menghapus sebuah topik forum beserta commentnya dengan memilih langsung topik yang ingin dihapus dan menekan tombol delete. Sehingga memudahkan seorang admin untuk mengetahui secara detail dari sebuah 74 Universitas Kristen Petra topik forum tanpa harus bersusah mencari satu persatu judul topik dan comment yang ada didalamnya. Gambar 5.12. Halaman Edit Forum untuk melihat judul serta comment topik forum Gambar 5.13. menunjukkan halaman EditStop word yang berisi mengenai databasestop word yang dapat di insertedit dan delete ke dalam database. Insert dilakukan dengan menuliskan secara langsung kata yang ingin dimasukkan ke dalam databasestop word kemudian menekan tombol insert. Edit kata dalam database stop word dilakukan dengan memilih terlebih dahulu kata yang ingin di edit, kemudian dilanjutkan dengan menekan tombol edit disebelah Gambar 5.13. Halaman EditStop word kata yang ingin diedit. Secara otomatis kata akan muncul dalam textbox yang tersedia sehingga kata dapat diedit. Setelah melakukan edit diakhiri dengan menekan tombol update untuk mengupdate secara langsung ke dalam database stop word. Pengujian dilakukan dengan memasukkan kata “arc” ke dalam databasestop word. 75 Universitas Kristen Petra Gambar 5.14. Insert ke database stop word berhasil Pada gambar5.14.terlihat hasil pengujian adri sebelumnya yaitu dengan uji coba memasukkan kata “arc”. Terlihat pada gambar 5.14.kata “arc” berhasil dimasukkan dan ditampilkan pada halaman. Halaman Edit Kata Majemuk ditampilkan pada Gambar 5.15. berisi mengenai database kata majemuk dan juga database kata majemuk yang di sarankan oleh program untuk dimasukkan ke dalam database kata majemuk. Insert dilakukan dengan menuliskan secara langsung kata yang ingin dimasukkan ke dalam database kata majemuk kemudian menekan tombol insert.Untuk kata- kata majemuk yang disarankan oleh pogram, seorang admin hanya perlu menekan tombol insert untuk memasukkan kata tersebut ke dalam database kata majemuk. Percobaan dilakukan dengan menginputkan kata baru “safari extension” ke dalam database yang merupakan saran kata majemuk baru oleh program. Gambar 5.15. Halaman Edit Kata Majemuk 76 Universitas Kristen Petra Gambar 5.16. Kata “safari extension” berhasil dimasukkan dan dalam tabel kata majemuk baru juga terhapus Gambar 5.16.menunjukkan kata “safari extension”berhasil dimasukkan dan ditampilkan kedalam tabel kata majemuk. Dan kata tersebut secara otomatis dihapus pada tabel kata majemuk baru. Gambar 5.17. menampilkan halaman Edit Ontologi yang memungkinkan admin untuk memberikan link pada tag topik forum sehingga tag dapat memiliki makna yang didasarkan pada database ontologi. Insert dilakukan dengan menuliskan secara langsung kata yang ingin kemudian menekan tombol insert. Edit kata dalam database ontologi dilakukan dengan menekan tombol edit disebelah kata yang ingin diedit. Pada tabel tag dapat dilakukan edit untuk memberikan makna pada sebuah taglink, sehingga sebuah taglink memiliki hubungan dengan tabel ontologi. Pengujian dilakukan dengan melakukan editpada tabel taglink dengan merubah kata “exception-handling” yang memiliki taglink 1. Gambar 5.17. Halaman Edit Ontologi 77 Universitas Kristen Petra Gambar 5.18. link exception-handling berubah dari “1” menjadi “12345” Pada gambar 5.18.menunjukkan hasil uji coba yang dilakukan sebelumnya. Terlihat bahwa kata “exception-handling” yang sebelumnya memiliki taglink 1 berhasil diedit menjadi taglink 12345. 5.2. Pengujian Program Pengujian program ini dibagi menjadi 2 bagian, yang pertama yaitu pengujian kevalidan program dan pengujian kualitas program. Pengujian kevalidan program bertujuan untuk menguji program sesuai dengan metode. Sedangkan pengujian kualitas program(precision dan recall)bertujuan untuk mengetahui kualitas program berdasarkan hasil yang sudah diperoleh. 5.2.1. Pengujian kevalidan program Pengujian untuk Resource Description Framework (RDF) dilakukan dengan membandingkan hasil secara manual dengan hasil yang dilakukan oleh program. Perbandingan dilakukan dengan mengambil contoh id_thread = 5 c# - What event is raised when a user interacts with the DateTimePicker control?.Seperti yang terlihat pada gambar 5.19 terlihat pada id_thread = 5 terdapat keterangan berupa id_thread, jdl_thread, tgl_thread, dan isi_thread. Yang masing-masing berisi id_thread = ”5”, jdl_thread = “c# - What event is raised when a user interacts with the DateTimePicker control?”, tgl_thread = “2012-05- 08”, dan isi_thread = “I want to have the DateTimePicker in menu like "Generate report as on 10-Jan-11". Here I should be able to choose the date from the DateTimePicker and close the menu. I searched the Internet, but I could not find a way to do this. Thanks a lot.” 78 Universitas Kristen Petra Gambar 5.19. Data thread untuk id_thread = 5 Pada gambar 5.20. menampilkan taglink untuk id_thread 5 Serta tag = “c#, event, rais , user, interact, control, Cω, Spec sharp, Cobra, Polyphonic C sharp, Cω, Windows PowerShell, PHP, Java, F#, D, Objeck, Nemerle, Vala, Oxygene, Cobra, Fan, Object Pascal, C, Modula-3, C++, Haskell, Microsoft Silverlight, XAML, Eiffel, 2001, Microsoft, Anders Hejlsberg, Multi-paradigm programming language, Generic programming, Component-oriented
Load more

Recommended publications
  • Deborah Schiffrin Editor
    Meaning, Form, and Use in Context: Linguistic Applications Deborah Schiffrin editor Meaning, Form, and Use in Context: Linguistic Applications Deborah Schiffrin editor Georgetown University Press, Washington, D.C. 20057 BIBLIOGRAPHIC NOTICE Since this series has been variously and confusingly cited as: George- town University Monographic Series on Languages and Linguistics, Monograph Series on Languages and Linguistics, Reports of the Annual Round Table Meetings on Linguistics and Language Study, etc., beginning with the 1973 volume, the title of the series was changed. The new title of the series includes the year of a Round Table and omits both the monograph number and the meeting number, thus: Georgetown University Round Table on Languages and Linguistics 1984, with the regular abbreviation GURT '84. Full bibliographic references should show the form: Kempson, Ruth M. 1984. Pragmatics, anaphora, and logical form. In: Georgetown University Round Table on Languages and Linguistics 1984. Edited by Deborah Schiffrin. Washington, D.C.: Georgetown University Press. 1-10. Copyright (§) 1984 by Georgetown University Press All rights reserved Printed in the United States of America Library of Congress Catalog Number: 58-31607 ISBN 0-87840-119-9 ISSN 0196-7207 CONTENTS Welcoming Remarks James E. Alatis Dean, School of Languages and Linguistics vii Introduction Deborah Schiffrin Chair, Georgetown University Round Table on Languages and Linguistics 1984 ix Meaning and Use Ruth M. Kempson Pragmatics, anaphora, and logical form 1 Laurence R. Horn Toward a new taxonomy for pragmatic inference: Q-based and R-based implicature 11 William Labov Intensity 43 Michael L. Geis On semantic and pragmatic competence 71 Form and Function Sandra A.
    [Show full text]
  • Arís 2.1: Adapting Arís for Object Oriented Language
    Arís 2.1: Adapting Arís for Object Oriented Language Fahrurrozi Rahman Dissertation 2013 Erasmus Mundus MSc in Dependable Software Systems Department of Computer Science National University of Ireland, Maynooth Co.Kildare, Ireland A dissertation submitted in partial fulfillment of the requirements for the Erasmus Mundus Msc Dependable Software Systems Head of Department: Dr. Adam Winstangley Supervisors: Dr. Diarmuid O’Donoghue and Dr. Rosemary Monahan July 2014 Declaration I hereby certify that this material, which I now submit for assessment of the program of study leading to the award of Master of Science in Dependable Software Systems, is entirely my own work and has not been taken from the work of other save and to the extent that such work has been cited and acknowledged within the text of my work. Fahrurrozi Rahman 1 Acknowledgement I would like to thank my supervisors Dr. Diamuid O’Donoghue and Dr. Rosemary Monahan from the National University of Ireland, Maynooth for all their help, patience and support on the project. I would also like to thank The Executive Agency Education, Audiovisual and Culture (EACEA) for the funding and all the classmates who support me directly or indirectly while doing this research. 2 Abstract In the software development area, software verification is important such that it can guarantee the software fulfills its requirements. Despite its importance, verifying software is difficult to achieve. Additional knowledge and effort are needed to write specification especially if the software is complex and big in size. Nevertheless, there are some software that already have verified specifications. This project will focus on extending Arís (Analogical Reasoning for reuse of Implementation & Specification) which has been developed to increase verified software by reusing and transferring the specification from a similar implementation to a target code.
    [Show full text]
  • A Language for Concurrent Disributed Programming for Cluster and GRID
    Russian Academy of Sciences Program Systems Institute MC#: a Language for Concurrent Disributed Programming for Cluster and GRID Architectures Introduction Novel Constructs of MC#: Movable Methods, Channels, and Handlers MC# is a high-level object-oriented programming language based on the .NET platform created for developing complex industrial software systems Movable methods are the methods that can be scheduled for execution on intended for running on multiprocessor architectures. remote machines. Such methods in the code are labeled with the special In contrast with the wide-spread MPI (Message Passing Interface) appro- keyword movable; for example: ach in MC# programs there is no need to movable Compute( int x, double y ){ (a) explicitly manage the distribution of computational processes over // method body cluster nodes or GRID machines, and } There are two forms of calling movable methods: (b) manually program the serialization of complex objects (data) for send- ing them to another processors. ! object.method( arguments ) — in this case the node where movable method will be executed is scheduled by the runtime system, The MC# language is the adaptation of the base idea of the Polyphonic C# language (nowadays also known as Cw — Benton N., Cardelli L., Fournet ! [email protected]( arguments ) — explicit indication of node C., Microsoft Research Laboratory, Cambridge, UK) for the case of con- where this method must be executed. current distributed computations. Channels and handlers are tools for interaction among distributed obj- Asynchronous methods of Polyphonic C# in the MC# language can be ects. Typically, they are defined with the chord construct as in the follow- scheduled for execution on other machines in two ways: ing example where channel sendInt for sending single integers and cor- responding handler are declared: ! automatically (typically a machine with the least workload is taken); ! manually through explicit indication by a programmer.
    [Show full text]
  • New Doc 2018-11-09 13.48.56
    Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Seminar Nasional Informatika 2013 (semnasIF 2013) ISSN: 1979-2328 UPN ”Veteran” Yogyakarta, 18 Mei 2013 SISTEM PENCARIAN FORUM BERBASIS ONTOLOGI DAN LABEL Adi Wibowo1), Gregorius Satiabudhi2) , Yulius Pranata3) 1,2,3)Program Studi Teknik Informatika Universitas Kristen Petra Surabaya Jl. Siwalankerto 121-131 Surabaya Telp (031)-2983455 e-mail : 1) [email protected], 2) [email protected] Abstrak Salah satu kegiatan yang sering dilakukan pengguna internet adalah berdiskusi melalui sebuah forum. Setiap forum terbagi ke dalam beberapa kategori, dan setiap kategori memiliki beberapa percakapan (thread). Setiap percakapan dapat diberi label (tag) baik oleh pengguna yang membuka percakapan tersebut, atau peserta forum. Masalah yang muncul adalah bila sebuah forum telah menjadi besar mencari percakapan yang tepat yang sesuai kebutuhan pengguna menjadi lebih sulit. Penelitian ini bertujuan mengusulkan metode rekomendasi percakapan di sebuah forum internet yang menggunakan label dan didukung oleh ontologi yang sesuai dengan kategori percakapan.Penelitian ini mengkhususkan pada forum dengan kategori teknologi komputer. Forum tersebut adalah StackOverflow. Pada setiap percakapan pada forum tersebut terdapat label-label yang menjelaskan isi percakapan, misalnya C#, recursive, programming, dll. Label-label tersebut dikembangkan (diperbanyak) menggunakan ontologi komputer. Hasilnya adalah setiap percakapan akan diwakili oleh label- label asli dari StackOverflow, dan ditambah dengan label-label baru yang berasal dari ontologi. Label-label tersebut digunakan dalam proses pencarian berbasis Vector Space Model (VSM).Hasil penelitian menunjukkan bahwa penggunaan ontologi sebagai metode keyword extension meningkatkan nilai recall dari metode VSM tersebut.
    [Show full text]
  • Invariant Based Programming: Basic Approach and Teaching Experiences Ralph-Johan Back
    Invariant based programming: basic approach and teaching experiences Ralph-Johan Back To cite this version: Ralph-Johan Back. Invariant based programming: basic approach and teaching experiences. Formal Aspects of Computing, Springer Verlag, 2008, 21 (3), pp.227-244. 10.1007/s00165-008-0070-y. hal- 00477903 HAL Id: hal-00477903 https://hal.archives-ouvertes.fr/hal-00477903 Submitted on 30 Apr 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. DOI 10.1007/s00165-008-0070-y BCS © 2008 Formal Aspects Formal Aspects of Computing (2009) 21: 227–244 of Computing Invariant based programming: basic approach and teaching experiences Ralph-Johan Back Abo Akademi University, Turku, Finland. E-mail: backrj@abo.fi Abstract. Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verification an alternative to or a complement to testing. We describe here another approach to program construction, which we refer to as invariant based programming, where we start by formulating the specifications and the internal loop invariants for the program, before we write the program code itself.
    [Show full text]
  • Concurrency Expression in High-Level Languages, Best Practice and Amenability to H/W Compilation
    Concurrency expression in high-level languages, Best practice and amenability to h/w compilation. (povocative statements for BoF Panel Discussion !) David Greaves University of Cambridge Computer Laboratory [email protected] [email protected] Field Programmable Logic and Applications (FPL) 2nd September 2014, Munich. Parallel Programming Disciplines ➲ Hardware is parallel (massively). ➲ Software must go parallel owing to end of clock frequency growth. ➲ Hardware is software is hardware – we need (an) effective expression language(s) amenable to codesign. So: three classes of parallelism: ● 1. Embarrassingly parallel – no control or data interaction between strands. ● 2. Stream processing – pipelined parallelism – great if there are no control hazards. ● 3. General, fine-grained parallel programming! [email protected] Field Programmable Logic and Applications (FPL) 2nd September 2014, Munich. Eager versus Lazy Dichotomy ➲ Separating control and data flows often mooted: ● It is the key enabler for 'Spatial Computing' ● `A New Dataflow Compiler IR for Accelerating Control- Intensive Code in Spatial Hardware' A M Zaidi and DJ Greaves @ IPDPS'14. ● But why are people happier with OCAML than Haskell ? General purpose language must keep them quite close together – e.g. call-by-value in ML/Java/C etc.. [email protected] Field Programmable Logic and Applications (FPL) 2nd September 2014, Munich. Von Neumann Imperative Parallelism ➲ Shared-memory imperative programming is stupid – how have we got there? ➲ Using strongly typed C/C++/C# we can compile pointers and abstract data struc- tures quite safely. ➲ But aliasing problem restricts available par- allelism (w.r.t. critical ALU path) by: ● Factor of 100 by conservative static analysis ● Factor of < 10 in reality (Jonathan Mak's PhD).
    [Show full text]
  • Decision Procedures for Algebraic Data Types With
    Synthesis, Analysis, and Verification Lecture 01 Introduction, Overview, Logistics Lectures: Viktor Kuncak Exercises and Labs: Eva Darulová Giuliano Losa Monday, 21 February 2011 and 22 February 2011 Today Introduction and overview of topics – Analysis and Verification – Synthesis Course organization and grading SAV in One Slide We study how to build software analysis, verification, and synthesis tools that automatically answer questions about software systems. We cover theory and tool building through lectures, exercises, and labs. Grade is based on – quizzes – home works (theory and programming) – a mini project, presented in the class Steps in Developing Tools Modeling: establish precise mathematical meaning for: software, environment, and questions of interest – discrete mathematics, mathematical logic, algebra Formalization: formalize this meaning using appropriate representation of programming languages and specification languages – program analysis, compilers, theory of formal languages, formal methods Designing algorithms: derive algorithms that manipulate such formal objects - key technical step – algorithms, dataflow analysis, abstract interpretation, decision procedures, constraint solving (e.g. SAT), theorem proving Experimental evaluation: implement these algorithms and apply them to software systems – developing and using tools and infrastructures, learning lessons to improve and repeat previous steps Comparison to other Sciences Like science we model a part of reality (software systems and their environment) by introducing
    [Show full text]
  • Not) What Democracy Looks Like: How Ideology, Hierarchy and Inequality Shape Digital Activism By
    This is (Not) What Democracy Looks Like: How Ideology, Hierarchy and Inequality Shape Digital Activism By Jennifer Anne Schradie A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Sociology and the Designated Emphasis in New Media in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Kim Voss, Chair Professor Claude Fischer Professor Abigail DeKosnik Fall 2014 Abstract This is (Not) What Democracy Looks Like: How Ideology, Hierarchy and Inequality Shape Digital Activism by Jennifer Anne Schradie Doctor of Philosophy in Sociology University of California, Berkeley Professor Kim Voss, Chair This dissertation addresses longstanding sociological questions about organizational democracy in the context of contemporary advances in digital technology. To date, most of the scholarship on digital activism suggests that the Internet enables social movements to be less hierarchical, more participatory, and more egalitarian. However, such claims are weakened by researchers’ tendency to study only high levels of digital activism, rather than investigating digital practices across a range of organizations with differing levels of digital engagement. In contrast, I explore political, labor and social movement organizations across an entire political field. My units of analysis are the 34 groups in North Carolina active on both sides of a political issue: public employee collective bargaining rights. The organizations range from Tea Parties to rank-and-file labor unions and from conservative think tanks to progressive coalitions. I collected data on over 60,000 Tweets, Facebook posts and Web site metrics of the organizations. I then created an index to measure the extent of digital engagement of each group, and I developed a typology of online social movement activities and platforms.
    [Show full text]
  • Algorithmic Music Analysis: a Case Study of a Prelude from David Cope's
    ALGORITHMIC MUSIC ANALYSIS: A C ASE STUDY OF A PRELUDE FROM DAVID COPE’S “FROM DARKNESS, LIGHT” Reiner Krämer, B.M., M.M. Dissertation Prepar ed for the Degree of DOCTOR OF P HILOSOPHY UNIVERSITY OF NORTH TEXAS May 2015 APPROVED: David Bard-Schwarz, Major Professor Andrew May, Minor Professor Thomas Sovík, Committee Member Frank Heidlberger, Chair of the Department of Music History, Theory, and Ethnomusicology Benjamin Brand, Director of Graduate Studies James C. Scott, Dean of the College of Music Costas Tsatsoulis, Interim Dean of the Toulouse Graduate School Krämer, Reiner. Algorithmic Music Analysis: A Case Study of a Prelude from David Cope’s “From Darkness, Light.” Doctor of Philosophy (Music Theory), May 2015, 433 pp., 16 tables, 57 figures, 125 examples, bibliography, 278 titles. The use of algorithms in compositional practice has been in use for centuries. With the advent of computers, formalized procedures have become an important part of computer music. David Cope is an American composer that has pioneered systems that make use of artificial intelligence programming techniques. In this dissertation one of David Cope’s compositions that was generated with one of his processes is examined in detail. A general timeline of algorithmic compositional practice is outlined from a historical perspective, and realized in the Common Lisp programming language as a musicological tool. David Cope’s compositional output is summarized with an explanation of what types of systems he has utilized in the analyses of other composers’ music, and the composition of his own music. Twentieth century analyses techniques are formalized within Common Lisp as algorithmic analyses tools.
    [Show full text]
  • Towards Building Blocks for Agent-Oriented Programming Standardizing Interpreters, Environments and Tools
    Towards Building Blocks for Agent-Oriented Programming Standardizing Interpreters, Environments and Tools Doctoral Thesis (Dissertation) to be awarded the degree of Doctor rerum naturalium (Dr. rer. nat) submitted by Tristan Behrens from Osterode am Harz approved by Faculty of Mathematics/Computer Science and Mechanical Engineering Clausthal University of Technology Date of oral examination: February 1st 2012 Chief reviewer: Prof. Dr. rer. nat. habil. J¨urgenDix Reviewer: Prof. Dr. rer. nat. J¨org P. M¨uller External reviewer: Prof. Dr. Cees Witteveen 2 \Das Bedenklichste ist, dass wir noch nicht denken; immer noch nicht, ob- gleich der Weltzustand fortgesetzt bedenklicher wird. Dieser Vorgang scheint freilich eher zu fordern, dass der Mensch handelt und zwar ohne Verzug, statt in Konferenzen und auf Kongressen zu reden und sich im bloßen Vorstellen dessen zu bewegen, was sein sollte und wie es gemacht werden m¨usste.Somit fehlt es am Handeln und keineswegs am Denken." Martin Heidegger, Was heißt Denken? 5 Abstract The main concern of this thesis is multi-agent programming, which is preoccupied with the question how to practically distribute intelligence?, and thus belongs to the artificial intelligence branch of computer science. To be more precise, the focus of this thesis lies on BDI-based multi-agent programming. This means programming agents that have mental states (beliefs, desires and intentions) and capabilities (deliberation and means- end reasoning): A situation that resembles human cognition on an abstract level. We contribute to two aspects arising in this research field. The first one is the idea of using standardization in order to support modularity and reusability.
    [Show full text]
  • Chemical Foundations of Distributed Aspects
    Noname manuscript No. (will be inserted by the editor) Chemical Foundations of Distributed Aspects Nicolas Tabareau ⋅ Éric Tanter the date of receipt and acceptance should be inserted later Abstract Distributed applications are challenging to distributed aspect weaving architecture. Finally, we ex- program because they have to deal with a plethora tend the calculus so that aspects can intervene upon of concerns, including synchronization, locality, replica- migration of localities. tion, security and fault tolerance. Aspect-oriented pro- The semantics of the aspect join calculus is given by gramming (AOP) is a paradigm that promotes better a chemical operational semantics. We give a translation modularity by providing means to encapsulate cross- of the aspect join calculus into the core join calculus, cutting concerns in entities called aspects. Over the and prove this translation correct by a bisimilarity ar- last years, a number of distributed aspect-oriented pro- gument. This translation is used to implement Aspect gramming languages and systems have been proposed, JoCaml on top of JoCaml.1 illustrating the benefits of AOP in a distributed setting. Chemical calculi are particularly well-suited to for- mally specify the behavior of concurrent and distributed 1 Introduction systems. The join calculus is a functional name-passing calculus, with both distributed and object-oriented ex- Distributed applications are complex to develop be- tensions. It is used as the basis of concurrency and cause of a plethora of issues related to synchroniza- distribution features in several mainstream languages tion, distribution, and mobility of code and data across like C# (Polyphonic C#, now C!), OCaml (JoCaml), the network.
    [Show full text]
  • Sistem Pencarian Forum Berbasis Ontologi Dan Label
    Seminar Nasional Informatika 2013 (semnasIF 2013) ISSN: 1979-2328 UPN ”Veteran” Yogyakarta, 18 Mei 2013 SISTEM PENCARIAN FORUM BERBASIS ONTOLOGI DAN LABEL Adi Wibowo1), Gregorius Satiabudhi2) , Yulius Pranata3) 1,2,3)Program Studi Teknik Informatika Universitas Kristen Petra Surabaya Jl. Siwalankerto 121-131 Surabaya Telp (031)-2983455 e-mail : 1) [email protected], 2) [email protected] Abstrak Salah satu kegiatan yang sering dilakukan pengguna internet adalah berdiskusi melalui sebuah forum. Setiap forum terbagi ke dalam beberapa kategori, dan setiap kategori memiliki beberapa percakapan (thread). Setiap percakapan dapat diberi label (tag) baik oleh pengguna yang membuka percakapan tersebut, atau peserta forum. Masalah yang muncul adalah bila sebuah forum telah menjadi besar mencari percakapan yang tepat yang sesuai kebutuhan pengguna menjadi lebih sulit. Penelitian ini bertujuan mengusulkan metode rekomendasi percakapan di sebuah forum internet yang menggunakan label dan didukung oleh ontologi yang sesuai dengan kategori percakapan.Penelitian ini mengkhususkan pada forum dengan kategori teknologi komputer. Forum tersebut adalah StackOverflow. Pada setiap percakapan pada forum tersebut terdapat label-label yang menjelaskan isi percakapan, misalnya C#, recursive, programming, dll. Label-label tersebut dikembangkan (diperbanyak) menggunakan ontologi komputer. Hasilnya adalah setiap percakapan akan diwakili oleh label- label asli dari StackOverflow, dan ditambah dengan label-label baru yang berasal dari ontologi. Label-label tersebut digunakan dalam proses pencarian berbasis Vector Space Model (VSM).Hasil penelitian menunjukkan bahwa penggunaan ontologi sebagai metode keyword extension meningkatkan nilai recall dari metode VSM tersebut. Kata Kunci : Forum, Ontologi, Label, Search 1. PENDAHULUAN Forum menyediakan tempat bagi pengguna untuk saling berkomunikasi. Setiap pengguna dapat mengajukan pertanyaan, atau pendapat mengenai sebuah topik dalam sebuah percakapan (thread) antar pengguna.
    [Show full text]