CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: systems programming</title> <meta name="description" content="Search results for: systems programming"> <meta name="keywords" content="systems programming"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="systems programming" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="systems programming"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 10098</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: systems programming</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10098</span> The Primitive Code-Level Design Patterns for Distributed Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bing%20Li">Bing Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The primitive code-level design patterns (PDP) are the rudimentary programming elements to develop any distributed systems in the generic distributed programming environment, GreatFree. The PDP works with the primitive distributed application programming interfaces (PDA), the distributed modeling, and the distributed concurrency for scaling-up. They not only hide developers from underlying technical details but also support sufficient adaptability to a variety of distributed computing environments. Programming with them, the simplest distributed system, the lightweight messaging two-node client/server (TNCS) system, is constructed rapidly with straightforward and repeatable behaviors, copy-paste-replace (CPR). As any distributed systems are made up of the simplest ones, those PDAs, as well as the PDP, are generic for distributed programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=primitive%20APIs" title="primitive APIs">primitive APIs</a>, <a href="https://publications.waset.org/abstracts/search?q=primitive%20code-level%20design%20patterns" title=" primitive code-level design patterns"> primitive code-level design patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=generic%20distributed%20programming" title=" generic distributed programming"> generic distributed programming</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title=" distributed systems"> distributed systems</a>, <a href="https://publications.waset.org/abstracts/search?q=highly%20patterned%20development%20environment" title=" highly patterned development environment"> highly patterned development environment</a>, <a href="https://publications.waset.org/abstracts/search?q=messaging" title=" messaging"> messaging</a> </p> <a href="https://publications.waset.org/abstracts/135687/the-primitive-code-level-design-patterns-for-distributed-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/135687.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">191</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10097</span> Review of Currently Adopted Intelligent Programming Tutors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rita%20Garcia">Rita Garcia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intelligent Programming Tutors, IPTs, are supplemental educational devices that assist in teaching software development. These systems provide customized learning allowing the user to select the presentation pace, pedagogical strategy, and to recall previous and additional teaching materials reinforcing learning objectives. In addition, IPTs automatically records individual’s progress, providing feedback to the instructor and student. These tutoring systems have an advantage over Tutoring Systems because Intelligent Programming Tutors are not limited to one teaching strategy and can adjust when it detects the user struggling with a concept. The Intelligent Programming Tutor is a category of Intelligent Tutoring Systems, ITS. ITS are available for many fields in education, supporting different learning objectives and integrate into other learning tools, improving the student's learning experience. This study provides a comparison of the IPTs currently adopted by the educational community and will focus on the different teaching methodologies and programming languages. The study also includes the ability to integrate the IPT into other educational technologies, such as massive open online courses, MOOCs. The intention of this evaluation is to determine one system that would best serve in a larger ongoing research project and provide findings for other institutions looking to adopt an Intelligent Programming Tutor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20education%20tools" title="computer education tools">computer education tools</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated%20software%20development%20assistance" title=" integrated software development assistance"> integrated software development assistance</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20programming%20tutors" title=" intelligent programming tutors"> intelligent programming tutors</a>, <a href="https://publications.waset.org/abstracts/search?q=tutoring%20systems" title=" tutoring systems"> tutoring systems</a> </p> <a href="https://publications.waset.org/abstracts/66918/review-of-currently-adopted-intelligent-programming-tutors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">317</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10096</span> A Common Automated Programming Platform for Knowledge Based Software Engineering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Stanev">Ivan Stanev</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Koleva"> Maria Koleva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A common platform for automated programming (CPAP) is defined in details. Two versions of CPAP are described: Cloud-based (including the set of components for classic programming, and the set of components for combined programming) and KBASE based (including the set of components for automated programming, and the set of components for ontology programming). Four KBASE products (module for automated programming of robots, intelligent product manual, intelligent document display, and intelligent form generator) are analyzed and CPAP contributions to automated programming are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automated%20programming" title="automated programming">automated programming</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20based%20software%20engineering" title=" knowledge based software engineering"> knowledge based software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20oriented%20architecture" title=" service oriented architecture"> service oriented architecture</a> </p> <a href="https://publications.waset.org/abstracts/40829/a-common-automated-programming-platform-for-knowledge-based-software-engineering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10095</span> Implementation of a Serializer to Represent PHP Objects in the Extensible Markup Language</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lidia%20N.%20Hern%C3%A1ndez-Pi%C3%B1a">Lidia N. Hernández-Piña</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlos%20R.%20Jaimez-Gonz%C3%A1lez"> Carlos R. Jaimez-González</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Interoperability in distributed systems is an important feature that refers to the communication of two applications written in different programming languages. This paper presents a serializer and a de-serializer of PHP objects to and from XML, which is an independent library written in the PHP programming language. The XML generated by this serializer is independent of the programming language, and can be used by other existing Web Objects in XML (WOX) serializers and de-serializers, which allow interoperability with other object-oriented programming languages. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interoperability" title="interoperability">interoperability</a>, <a href="https://publications.waset.org/abstracts/search?q=PHP%20object%20serialization" title=" PHP object serialization"> PHP object serialization</a>, <a href="https://publications.waset.org/abstracts/search?q=PHP%20to%20XML" title=" PHP to XML"> PHP to XML</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20objects%20in%20XML" title=" web objects in XML"> web objects in XML</a>, <a href="https://publications.waset.org/abstracts/search?q=WOX" title=" WOX"> WOX</a> </p> <a href="https://publications.waset.org/abstracts/79264/implementation-of-a-serializer-to-represent-php-objects-in-the-extensible-markup-language" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79264.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">236</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10094</span> A Survey of Grammar-Based Genetic Programming and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthew%20T.%20Wilson">Matthew T. Wilson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper covers a selection of research utilizing grammar-based genetic programming, and illustrates how context-free grammar can be used to constrain genetic programming. It focuses heavily on grammatical evolution, one of the most popular variants of grammar-based genetic programming, and the way its operators and terminals are specialized and modified from those in genetic programming. A variety of implementations of grammatical evolution for general use are covered, as well as research each focused on using grammatical evolution or grammar-based genetic programming on a single application, or to solve a specific problem, including some of the classically considered genetic programming problems, such as the Santa Fe Trail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context-free%20grammar" title="context-free grammar">context-free grammar</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20programming" title=" genetic programming"> genetic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=grammatical%20evolution" title=" grammatical evolution"> grammatical evolution</a> </p> <a href="https://publications.waset.org/abstracts/120249/a-survey-of-grammar-based-genetic-programming-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10093</span> Cutting Plane Methods for Integer Programming: NAZ Cut and Its Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bari">A. Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integer programming is a branch of mathematical programming techniques in operations research in which some or all of the variables are required to be integer valued. Various cuts have been used to solve these problems. We have also developed cuts known as NAZ cut & A-T cut to solve the integer programming problems. These cuts are used to reduce the feasible region and then reaching the optimal solution in minimum number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Integer%20Programming" title="Integer Programming">Integer Programming</a>, <a href="https://publications.waset.org/abstracts/search?q=NAZ%20cut" title=" NAZ cut"> NAZ cut</a>, <a href="https://publications.waset.org/abstracts/search?q=A-T%20cut" title=" A-T cut"> A-T cut</a>, <a href="https://publications.waset.org/abstracts/search?q=Cutting%20plane%20method" title=" Cutting plane method"> Cutting plane method</a> </p> <a href="https://publications.waset.org/abstracts/8763/cutting-plane-methods-for-integer-programming-naz-cut-and-its-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8763.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">364</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10092</span> An Architectural Model of Multi-Agent Systems for Student Evaluation in Collaborative Game Software</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Monica%20Hoeldtke%20Pietruchinski">Monica Hoeldtke Pietruchinski</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrey%20Ricardo%20Pimentel"> Andrey Ricardo Pimentel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The teaching of computer programming for beginners has been presented to the community as a not simple or trivial task. Several methodologies and research tools have been developed; however, the problem still remains. This paper aims to present multi-agent system architecture to be incorporated to the educational collaborative game software for teaching programming that monitors, evaluates and encourages collaboration by the participants. A literature review has been made on the concepts of Collaborative Learning, Multi-agents systems, collaborative games and techniques to teach programming using these concepts simultaneously. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=architecture%20of%20multi-agent%20systems" title="architecture of multi-agent systems">architecture of multi-agent systems</a>, <a href="https://publications.waset.org/abstracts/search?q=collaborative%20evaluation" title=" collaborative evaluation"> collaborative evaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=collaboration%20assessment" title=" collaboration assessment"> collaboration assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=gamifying%20educational%20software" title=" gamifying educational software"> gamifying educational software</a> </p> <a href="https://publications.waset.org/abstracts/35668/an-architectural-model-of-multi-agent-systems-for-student-evaluation-in-collaborative-game-software" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35668.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">463</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10091</span> Solving Linear Systems Involved in Convex Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yixun%20Shi">Yixun Shi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many interior point methods for convex programming solve an (n+m)x(n+m)linear system in each iteration. Many implementations solve this system in each iteration by considering an equivalent mXm system (4) as listed in the paper, and thus the job is reduced into solving the system (4). However, the system(4) has to be solved exactly since otherwise the error would be entirely passed onto the last m equations of the original system. Often the Cholesky factorization is computed to obtain the exact solution of (4). One Cholesky factorization is to be done in every iteration, resulting in higher computational costs. In this paper, two iterative methods for solving linear systems using vector division are combined together and embedded into interior point methods. Instead of computing one Cholesky factorization in each iteration, it requires only one Cholesky factorization in the entire procedure, thus significantly reduces the amount of computation needed for solving the problem. Based on that, a hybrid algorithm for solving convex programming problems is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title="convex programming">convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20systems" title=" linear systems"> linear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20division" title=" vector division"> vector division</a> </p> <a href="https://publications.waset.org/abstracts/39573/solving-linear-systems-involved-in-convex-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39573.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">402</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10090</span> Examining Relationship between Programming Performance, Programming Self Efficacy and Math Success </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Ekici">Mustafa Ekici</a>, <a href="https://publications.waset.org/abstracts/search?q=Sacide%20G%C3%BCzin%20Mazman"> Sacide Güzin Mazman </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Programming is the one of ability in computer science fields which is generally perceived difficult by students and various individual differences have been implicated in that ability success. Although several factors that affect programming ability have been identified over the years, there is not still a full understanding of why some students learn to program easily and quickly while others find it complex and difficult. Programming self-efficacy and mathematic success are two of those essential individual differences which are handled as having important effect on the programming success. This study aimed to identify the relationship between programming performance, programming self efficacy and mathematics success. The study group is consisted of 96 undergraduates from Department of Econometrics of Uşak University. 38 (39,58%) of the participants are female while 58 (60,41%) of them are male. Study was conducted in the programming-I course during 2014-2015 fall term. Data collection tools are comprised of programming course final grades, programming self efficacy scale and a mathematics achievement test. Data was analyzed through correlation analysis. The result of study will be reported in the full text of the study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=programming%20performance" title="programming performance">programming performance</a>, <a href="https://publications.waset.org/abstracts/search?q=self%20efficacy" title=" self efficacy"> self efficacy</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematic%20success" title=" mathematic success"> mathematic success</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20science" title=" computer science"> computer science</a> </p> <a href="https://publications.waset.org/abstracts/18162/examining-relationship-between-programming-performance-programming-self-efficacy-and-math-success" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18162.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">502</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10089</span> Lego Mindstorms as a Simulation of Robotic Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Miroslav%20Popelka">Miroslav Popelka</a>, <a href="https://publications.waset.org/abstracts/search?q=Jakub%20No%C5%BEi%C4%8Dka"> Jakub Nožička</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we deal with using Lego Mindstorms in simulation of robotic systems with respect to cost reduction. Lego Mindstorms kit contains broad variety of hardware components which are required to simulate, program and test the robotics systems in practice. Algorithm programming went in development environment supplied together with Lego kit as in programming language C# as well. Algorithm following the line, which we dealt with in this paper, uses theoretical findings from area of controlling circuits. PID controller has been chosen as controlling circuit whose individual components were experimentally adjusted for optimal motion of robot tracking the line. Data which are determined to process by algorithm are collected by sensors which scan the interface between black and white surfaces followed by robot. Based on discovered facts Lego Mindstorms can be considered for low-cost and capable kit to simulate real robotics systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LEGO%20Mindstorms" title="LEGO Mindstorms">LEGO Mindstorms</a>, <a href="https://publications.waset.org/abstracts/search?q=PID%20controller" title=" PID controller"> PID controller</a>, <a href="https://publications.waset.org/abstracts/search?q=low-cost%20robotics%20systems" title=" low-cost robotics systems"> low-cost robotics systems</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20follower" title=" line follower"> line follower</a>, <a href="https://publications.waset.org/abstracts/search?q=sensors" title=" sensors"> sensors</a>, <a href="https://publications.waset.org/abstracts/search?q=programming%20language%20C%23" title=" programming language C#"> programming language C#</a>, <a href="https://publications.waset.org/abstracts/search?q=EV3%20Home%20Edition%20Software" title=" EV3 Home Edition Software"> EV3 Home Edition Software</a> </p> <a href="https://publications.waset.org/abstracts/10889/lego-mindstorms-as-a-simulation-of-robotic-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10889.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">374</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10088</span> Application of De Novo Programming Approach for Optimizing the Business Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Z.%20Babic">Z. Babic</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Veza"> I. Veza</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Balic"> A. Balic</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Crnjac"> M. Crnjac</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The linear programming model is sometimes difficult to apply in real business situations due to its assumption of proportionality. This paper shows an example of how to use De Novo programming approach instead of linear programming. In the De Novo programming, resources are not fixed like in linear programming but resource quantities depend only on available budget. Budget is a new, important element of the De Novo approach. Two different production situations are presented: increasing costs and quantity discounts of raw materials. The focus of this paper is on advantages of the De Novo approach in the optimization of production plan for production company which produces souvenirs made from famous stone from the island of Brac, one of the greatest islands from Croatia. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20process" title="business process">business process</a>, <a href="https://publications.waset.org/abstracts/search?q=De%20Novo%20programming" title=" De Novo programming"> De Novo programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimizing" title=" optimizing"> optimizing</a>, <a href="https://publications.waset.org/abstracts/search?q=production" title=" production"> production</a> </p> <a href="https://publications.waset.org/abstracts/80556/application-of-de-novo-programming-approach-for-optimizing-the-business-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80556.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10087</span> A Fuzzy Programming Approach for Solving Intuitionistic Fuzzy Linear Fractional Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sujeet%20Kumar%20Singh">Sujeet Kumar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiv%20Prasad%20Yadav"> Shiv Prasad Yadav</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops an approach for solving intuitionistic fuzzy linear fractional programming (IFLFP) problem where the cost of the objective function, the resources, and the technological coefficients are triangular intuitionistic fuzzy numbers. Here, the IFLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using fuzzy mathematical programming approach the transformed MOLFP problem is reduced into a single objective linear programming (LP) problem. The proposed procedure is illustrated through a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=triangular%20intuitionistic%20fuzzy%20number" title="triangular intuitionistic fuzzy number">triangular intuitionistic fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming%20problem" title=" linear programming problem"> linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20objective%20linear%20programming%20problem" title=" multi objective linear programming problem"> multi objective linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20mathematical%20programming" title=" fuzzy mathematical programming"> fuzzy mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a> </p> <a href="https://publications.waset.org/abstracts/16411/a-fuzzy-programming-approach-for-solving-intuitionistic-fuzzy-linear-fractional-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16411.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">566</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10086</span> Sensitivity Analysis in Fuzzy Linear Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Nasseri">S. H. Nasseri</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Ebrahimnejad"> A. Ebrahimnejad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy set theory has been applied to many fields, such as operations research, control theory, and management sciences. In this paper, we consider two classes of fuzzy linear programming (FLP) problems: Fuzzy number linear programming and linear programming with trapezoidal fuzzy variables problems. We state our recently established results and develop fuzzy primal simplex algorithms for solving these problems. Finally, we give illustrative examples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20linear%20programming" title="fuzzy linear programming">fuzzy linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20numbers" title=" fuzzy numbers"> fuzzy numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=duality" title=" duality"> duality</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/16916/sensitivity-analysis-in-fuzzy-linear-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16916.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">565</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10085</span> Programming Systems in Implementation of Process Safety at Chemical Process Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Shayan">Maryam Shayan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Programming frameworks have been utilized as a part of chemical industry process safety operation and configuration to enhance its effectiveness. This paper gives a brief survey and investigation of the best in class and effects of programming frameworks in process security. A study was completed by talking staff accountable for procedure wellbeing practices in the Iranian chemical process industry and diving into writing of innovation for procedure security. This article investigates the useful and operational attributes of programming frameworks for security and endeavors to sort the product as indicated by its level of effect in the administration chain of importance. The study adds to better comprehension of the parts of Information Communication Technology in procedure security, the future patterns and conceivable gaps for innovative work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=programming%20frameworks" title="programming frameworks">programming frameworks</a>, <a href="https://publications.waset.org/abstracts/search?q=chemical%20industry%20process" title=" chemical industry process"> chemical industry process</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20security" title=" process security"> process security</a>, <a href="https://publications.waset.org/abstracts/search?q=administration%20chain" title=" administration chain"> administration chain</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20communication%20technology" title=" information communication technology"> information communication technology</a> </p> <a href="https://publications.waset.org/abstracts/32709/programming-systems-in-implementation-of-process-safety-at-chemical-process-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32709.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">372</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10084</span> A Hybrid Model of Goal, Integer and Constraint Programming for Single Machine Scheduling Problem with Sequence Dependent Setup Times: A Case Study in Aerospace Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Didem%20Can">Didem Can</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling problems are one of the most fundamental issues of production systems. Many different approaches and models have been developed according to the production processes of the parts and the main purpose of the problem. In this study, one of the bottleneck stations of a company serving in the aerospace industry is analyzed and considered as a single machine scheduling problem with sequence-dependent setup times. The objective of the problem is assigning a large number of similar parts to the same shift -to reduce chemical waste- while minimizing the number of tardy jobs. The goal programming method will be used to achieve two different objectives simultaneously. The assignment of parts to the shift will be expressed using the integer programming method. Finally, the constraint programming method will be used as it provides a way to find a result in a short time by avoiding worse resulting feasible solutions with the defined variables set. The model to be established will be tested and evaluated with real data in the application part. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=goal%20programming" title=" goal programming"> goal programming</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title=" integer programming"> integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence-dependent%20setup" title="sequence-dependent setup">sequence-dependent setup</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20scheduling" title=" single machine scheduling"> single machine scheduling</a> </p> <a href="https://publications.waset.org/abstracts/144504/a-hybrid-model-of-goal-integer-and-constraint-programming-for-single-machine-scheduling-problem-with-sequence-dependent-setup-times-a-case-study-in-aerospace-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144504.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">237</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10083</span> Attitudes toward Programming Languages Based on Characteristics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Shokoohi-Yekta">Mohammad Shokoohi-Yekta</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamid%20Mirebrahim"> Hamid Mirebrahim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A body of research has been devoted to investigating the preferences of computer programmers. These researches used various questionnaires to find out what programming language is most popular among programmers. The problem with such research is that the programmers are usually familiar with only a few languages; therefore, disregarding a number of other languages which might have characteristics that match their preferences more closely. To overcome such a problem, we decided to investigate the preferences of programmers in regards to the characteristics of languages, which help us to discover the languages that include the most characteristics preferred by the users. We conducted a user study to measure the preferences of programmers on different characteristics of programming languages and then tried to compare existing languages in the areas of application, Web and system programming. Overall, the results of our study indicated that the Ruby programming language has the highest preference score in the two areas of application and Web, and C++ has the highest score in the system area. The results of our study can also help programming language designers know the characteristics they should consider when developing new programming languages in order to attract more programmers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=object%20orientation" title="object orientation">object orientation</a>, <a href="https://publications.waset.org/abstracts/search?q=programming%20language%20design" title=" programming language design"> programming language design</a>, <a href="https://publications.waset.org/abstracts/search?q=programmers%27%20preferences" title=" programmers' preferences"> programmers' preferences</a>, <a href="https://publications.waset.org/abstracts/search?q=characteristic" title=" characteristic"> characteristic</a> </p> <a href="https://publications.waset.org/abstracts/22779/attitudes-toward-programming-languages-based-on-characteristics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22779.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">498</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10082</span> Mathematical Programming Models for Portfolio Optimization Problem: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mazura%20Mokhtar">Mazura Mokhtar</a>, <a href="https://publications.waset.org/abstracts/search?q=Adibah%20Shuib"> Adibah Shuib</a>, <a href="https://publications.waset.org/abstracts/search?q=Daud%20Mohamad"> Daud Mohamad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Portfolio optimization problem has received a lot of attention from both researchers and practitioners over the last six decades. This paper provides an overview of the current state of research in portfolio optimization with the support of mathematical programming techniques. On top of that, this paper also surveys the solution algorithms for solving portfolio optimization models classifying them according to their nature in heuristic and exact methods. To serve these purposes, 40 related articles appearing in the international journal from 2003 to 2013 have been gathered and analyzed. Based on the literature review, it has been observed that stochastic programming and goal programming constitute the highest number of mathematical programming techniques employed to tackle the portfolio optimization problem. It is hoped that the paper can meet the needs of researchers and practitioners for easy references of portfolio optimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=portfolio%20optimization" title="portfolio optimization">portfolio optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming" title=" mathematical programming"> mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20programming" title=" multi-objective programming"> multi-objective programming</a>, <a href="https://publications.waset.org/abstracts/search?q=solution%20approaches" title=" solution approaches"> solution approaches</a> </p> <a href="https://publications.waset.org/abstracts/2654/mathematical-programming-models-for-portfolio-optimization-problem-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2654.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">348</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10081</span> Understanding the Programming Techniques Using a Complex Case Study to Teach Advanced Object-Oriented Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Al-Jepoori">M. Al-Jepoori</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Bennett"> D. Bennett</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Teaching Object-Oriented Programming (OOP) as part of a Computing-related university degree is a very difficult task; the road to ensuring that students are actually learning object oriented concepts is unclear, as students often find it difficult to understand the concept of objects and their behavior. This problem is especially obvious in advanced programming modules where Design Pattern and advanced programming features such as Multi-threading and animated GUI are introduced. Looking at the students’ performance at their final year on a university course, it was obvious that the level of students’ understanding of OOP varies to a high degree from one student to another. Students who aim at the production of Games do very well in the advanced programming module. However, the students’ assessment results of the last few years were relatively low; for example, in 2016-2017, the first quartile of marks were as low as 24.5 and the third quartile was 63.5. It is obvious that many students were not confident or competent enough in their programming skills. In this paper, the reasons behind poor performance in Advanced OOP modules are investigated, and a suggested practice for teaching OOP based on a complex case study is described and evaluated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complex%20programming%20case%20study" title="complex programming case study">complex programming case study</a>, <a href="https://publications.waset.org/abstracts/search?q=design%20pattern" title=" design pattern"> design pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20advanced%20programming" title=" learning advanced programming"> learning advanced programming</a>, <a href="https://publications.waset.org/abstracts/search?q=object%20oriented%20programming" title=" object oriented programming"> object oriented programming</a> </p> <a href="https://publications.waset.org/abstracts/91354/understanding-the-programming-techniques-using-a-complex-case-study-to-teach-advanced-object-oriented-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91354.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">221</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10080</span> Adaptive Optimal Controller for Uncertain Inverted Pendulum System: A Dynamic Programming Approach for Continuous Time System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dao%20Phuong%20Nam">Dao Phuong Nam</a>, <a href="https://publications.waset.org/abstracts/search?q=Tran%20Van%20Tuyen"> Tran Van Tuyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Do%20Trong%20Tan"> Do Trong Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Bui%20Minh%20Dinh"> Bui Minh Dinh</a>, <a href="https://publications.waset.org/abstracts/search?q=Nguyen%20Van%20Huong"> Nguyen Van Huong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the adaptive optimal control law for continuous-time systems with input disturbances and unknown parameters. This paper extends previous works to obtain the robust control law of uncertain systems. Through theoretical analysis, an adaptive dynamic programming (ADP) based optimal control is proposed to stabilize the closed-loop system and ensure the convergence properties of proposed iterative algorithm. Moreover, the global asymptotic stability (GAS) for closed system is also analyzed. The theoretical analysis for continuous-time systems and simulation results demonstrate the performance of the proposed algorithm for an inverted pendulum system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming" title="approximate/adaptive dynamic programming">approximate/adaptive dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=ADP" title=" ADP"> ADP</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20optimal%20control%20law" title=" adaptive optimal control law"> adaptive optimal control law</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20state%20stability" title=" input state stability"> input state stability</a>, <a href="https://publications.waset.org/abstracts/search?q=ISS" title=" ISS"> ISS</a>, <a href="https://publications.waset.org/abstracts/search?q=inverted%20pendulum" title=" inverted pendulum"> inverted pendulum</a> </p> <a href="https://publications.waset.org/abstracts/80356/adaptive-optimal-controller-for-uncertain-inverted-pendulum-system-a-dynamic-programming-approach-for-continuous-time-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80356.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">194</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10079</span> Understanding of the Impact of Technology in Collaborative Programming for Children</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nadia%20Selene%20Molina-Moreno">Nadia Selene Molina-Moreno</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Susana%20Avila-Garcia"> Maria Susana Avila-Garcia</a>, <a href="https://publications.waset.org/abstracts/search?q=Marco%20Bianchetti"> Marco Bianchetti</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcelina%20Pantoja-Flores"> Marcelina Pantoja-Flores</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Visual Programming Tools available are a great tool for introducing children to programming and to develop a skill set for algorithmic thinking. On the other hand, collaborative learning and pair programming within the context of programming activities, has demonstrated to have social and learning benefits. However, some of the online tools available for programming for children are not designed to allow simultaneous and equitable participation of the team members since they allow only for a single control point. In this paper, a report the work conducted with children playing a user role is presented. A preliminary study to cull ideas, insights, and design considerations for a formal programming course for children aged 8-10 using collaborative learning as a pedagogical approach was conducted. Three setups were provided: 1) lo-fi prototype, 2) PC, 3) a 46' multi-touch single display groupware limited by the application to a single touch entry. Children were interviewed at the end of the sessions in order to know their opinions about teamwork and the different setups defined. Results are mixed regarding the setup, but they agree to like teamwork. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=children" title="children">children</a>, <a href="https://publications.waset.org/abstracts/search?q=collaborative%20programming" title=" collaborative programming"> collaborative programming</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20programming" title=" visual programming"> visual programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-touch%20tabletop" title=" multi-touch tabletop"> multi-touch tabletop</a>, <a href="https://publications.waset.org/abstracts/search?q=lo-fi%20prototype" title=" lo-fi prototype"> lo-fi prototype</a> </p> <a href="https://publications.waset.org/abstracts/71685/understanding-of-the-impact-of-technology-in-collaborative-programming-for-children" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71685.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">308</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10078</span> Spatial Interpolation Technique for the Optimisation of Geometric Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debjani%20Chakraborty">Debjani Chakraborty</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhijit%20Chatterjee"> Abhijit Chatterjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Aishwaryaprajna"> Aishwaryaprajna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Posynomials, a special type of polynomials, having singularities, pose difficulties while solving geometric programming problems. In this paper, a methodology has been proposed and used to obtain extreme values for geometric programming problems by nth degree polynomial interpolation technique. Here the main idea to optimise the posynomial is to fit a best polynomial which has continuous gradient values throughout the range of the function. The approximating polynomial is smoothened to remove the discontinuities present in the feasible region and the objective function. This spatial interpolation method is capable to optimise univariate and multivariate geometric programming problems. An example is solved to explain the robustness of the methodology by considering a bivariate nonlinear geometric programming problem. This method is also applicable for signomial programming problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geometric%20programming%20problem" title="geometric programming problem">geometric programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multivariate%20optimisation%20technique" title=" multivariate optimisation technique"> multivariate optimisation technique</a>, <a href="https://publications.waset.org/abstracts/search?q=posynomial" title=" posynomial"> posynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20interpolation" title=" spatial interpolation"> spatial interpolation</a> </p> <a href="https://publications.waset.org/abstracts/70385/spatial-interpolation-technique-for-the-optimisation-of-geometric-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70385.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">371</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10077</span> Fuzzy Linear Programming Approach for Determining the Production Amounts in Food Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20G%C3%BCney">B. Güney</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%87.%20Teke"> Ç. Teke</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, rapid and correct decision making is crucial for both people and enterprises. However, uncertainty makes decision-making difficult. Fuzzy logic is used for coping with this situation. Thus, fuzzy linear programming models are developed in order to handle uncertainty in objective function and the constraints. In this study, a problem of a factory in food industry is investigated, required data is obtained and the problem is figured out as a fuzzy linear programming model. The model is solved using Zimmerman approach which is one of the approaches for fuzzy linear programming. As a result, the solution gives the amount of production for each product type in order to gain maximum profit. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=food%20industry" title="food industry">food industry</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20linear%20programming" title=" fuzzy linear programming"> fuzzy linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming "> linear programming </a> </p> <a href="https://publications.waset.org/abstracts/27880/fuzzy-linear-programming-approach-for-determining-the-production-amounts-in-food-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27880.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">650</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10076</span> Exploration and Reform of Fundamentals of Program Design Based on Application Ability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiaqi%20Yin">Jiaqi Yin</a>, <a href="https://publications.waset.org/abstracts/search?q=Baofeng%20Liang"> Baofeng Liang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid development in the fields of computer science and information technology presents new challenges and opportunities for foundational programming education. Traditional programming courses often focus heavily on theoretical knowledge while neglecting students’ practical programming and problem-solving abilities. This paper delves into the significance of programming education based on application abilities and provides a detailed explanation of a reform approach that incorporates project-driven teaching to nurture students with more comprehensive computer science skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fundamentals%20of%20programming" title="fundamentals of programming">fundamentals of programming</a>, <a href="https://publications.waset.org/abstracts/search?q=application%20abilities" title=" application abilities"> application abilities</a>, <a href="https://publications.waset.org/abstracts/search?q=pedagogical%20reform" title=" pedagogical reform"> pedagogical reform</a>, <a href="https://publications.waset.org/abstracts/search?q=program%20design" title=" program design"> program design</a> </p> <a href="https://publications.waset.org/abstracts/175754/exploration-and-reform-of-fundamentals-of-program-design-based-on-application-ability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/175754.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">76</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10075</span> Generalized Central Paths for Convex Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li-Zhi%20Liao">Li-Zhi Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The central path has played the key role in the interior point method. However, the convergence of the central path may not be true even in some convex programming problems with linear constraints. In this paper, the generalized central paths are introduced for convex programming. One advantage of the generalized central paths is that the paths will always converge to some optimal solutions of the convex programming problem for any initial interior point. Some additional theoretical properties for the generalized central paths will be also reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20path" title="central path">central path</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title=" convex programming"> convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path" title=" generalized central path"> generalized central path</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a> </p> <a href="https://publications.waset.org/abstracts/58039/generalized-central-paths-for-convex-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58039.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">327</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10074</span> Use of Linear Programming for Optimal Production in a Production Line in Saudi Food Co.</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qasim%20M.%20Kriri">Qasim M. Kriri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Few Saudi Arabia production companies face financial profit issues until this moment. This work presents a linear integer programming model that solves a production problem of a Saudi Food Company in Saudi Arabia. An optimal solution to the above-mentioned problem is a Linear Programming solution. In this regard, the main purpose of this project is to maximize profit. Linear Programming Technique has been used to derive the maximum profit from production of natural juice at Saudi Food Co. The operations of production of the company were formulated and optimal results are found out by using Lindo Software that employed Sensitivity Analysis and Parametric linear programming in order develop Linear Programming. In addition, the parameter values are increased, then the values of the objective function will be increased. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parameter%20linear%20programming" title="parameter linear programming">parameter linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20function" title=" objective function"> objective function</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=optimize%20profit" title=" optimize profit"> optimize profit</a> </p> <a href="https://publications.waset.org/abstracts/86104/use-of-linear-programming-for-optimal-production-in-a-production-line-in-saudi-food-co" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86104.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">205</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10073</span> Three-Stage Multivariate Stratified Sample Surveys with Probabilistic Cost Constraint and Random Variance </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanam%20Haseen">Sanam Haseen</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Bari"> Abdul Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a three stage multivariate programming problem with random survey cost and variances as random variables has been formulated as a non-linear stochastic programming problem. The problem has been converted into an equivalent deterministic form using chance constraint programming and modified E-modeling. An empirical study of the problem has been done at the end of the paper using R-simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chance%20constraint%20programming" title="chance constraint programming">chance constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20E-model" title=" modified E-model"> modified E-model</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20sample%20surveys" title=" stratified sample surveys"> stratified sample surveys</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20stage%20sample%20surveys" title=" three stage sample surveys"> three stage sample surveys</a> </p> <a href="https://publications.waset.org/abstracts/14515/three-stage-multivariate-stratified-sample-surveys-with-probabilistic-cost-constraint-and-random-variance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14515.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">457</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10072</span> A Multi-criteria Decision Support System for Migrating Legacies into Open Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nasser%20Almonawer">Nasser Almonawer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Timely reaction to an evolving global business environment and volatile market conditions necessitates system and process flexibility, which in turn demands agile and adaptable architecture and a steady infusion of affordable new technologies. On the contrary, a large number of organizations utilize systems characterized by inflexible and obsolete legacy architectures. To effectively respond to the dynamic contemporary business environments, such architectures must be migrated to robust and modular open architectures. To this end, this paper proposes an integrated decision support system for a seamless migration to open systems. The proposed decision support system (DSS) integrates three well-established quantitative and qualitative decision-making models—namely, the Delphi method, Analytic Hierarchy Process (AHP) and Goal Programming (GP) to (1) assess risks and establish evaluation criteria; (2) formulate migration strategy and rank candidate systems; and (3) allocate resources among the selected systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decision%20support%20systems" title="decision support systems">decision support systems</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20systems%20architecture" title=" open systems architecture"> open systems architecture</a>, <a href="https://publications.waset.org/abstracts/search?q=analytic%20hierarchy%20process%20%28AHP%29" title=" analytic hierarchy process (AHP)"> analytic hierarchy process (AHP)</a>, <a href="https://publications.waset.org/abstracts/search?q=goal%20programming%20%28GP%29" title=" goal programming (GP)"> goal programming (GP)</a>, <a href="https://publications.waset.org/abstracts/search?q=delphi%20method" title=" delphi method"> delphi method</a> </p> <a href="https://publications.waset.org/abstracts/187670/a-multi-criteria-decision-support-system-for-migrating-legacies-into-open-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187670.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">47</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10071</span> Production Plan and Technological Variants Optimization by Goal Programming Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tunjo%20Peri%C4%87">Tunjo Perić</a>, <a href="https://publications.waset.org/abstracts/search?q=Franjo%20Brati%C4%87"> Franjo Bratić</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper the goal programming methodology for solving multiple objective problem of the technological variants and production plan optimization has been applied. The optimization criteria are determined and the multiple objective linear programming model for solving a problem of the technological variants and production plan optimization is formed and solved. Then the obtained results are analysed. The obtained results point out to the possibility of efficient application of the goal programming methodology in solving the problem of the technological variants and production plan optimization. The paper points out on the advantages of the application of the goal programming methodolohy compare to the Surrogat Worth Trade-off method in solving this problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=goal%20programming" title="goal programming">goal programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20objective%20programming" title=" multi objective programming"> multi objective programming</a>, <a href="https://publications.waset.org/abstracts/search?q=production%20plan" title=" production plan"> production plan</a>, <a href="https://publications.waset.org/abstracts/search?q=SWT%20method" title=" SWT method"> SWT method</a>, <a href="https://publications.waset.org/abstracts/search?q=technological%20variants" title=" technological variants"> technological variants</a> </p> <a href="https://publications.waset.org/abstracts/31123/production-plan-and-technological-variants-optimization-by-goal-programming-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31123.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">379</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10070</span> The Interplay of Factors Affecting Learning of Introductory Programming: A Comparative Study of an Australian and an Indian University</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ritu%20Sharma">Ritu Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Haifeng%20Shen"> Haifeng Shen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Teaching introductory programming is a challenging task in tertiary education and various factors are believed to have influence on students’ learning of programming. However, these factors were largely studied independently in a chosen context. This paper aims to investigate whether interrelationships exist among the factors and whether the interrelationships are context-dependent. In this empirical study, two universities were chosen from two continents, which represent different cultures, teaching methodologies, assessment criteria and languages used to teach programming in west and east worlds respectively. The results reveal that some interrelationships are common across the two different contexts, while others appear context-dependent. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=introductory%20programming" title="introductory programming">introductory programming</a>, <a href="https://publications.waset.org/abstracts/search?q=tertiary%20education" title=" tertiary education"> tertiary education</a>, <a href="https://publications.waset.org/abstracts/search?q=factors" title=" factors"> factors</a>, <a href="https://publications.waset.org/abstracts/search?q=interrelationships" title=" interrelationships"> interrelationships</a>, <a href="https://publications.waset.org/abstracts/search?q=context" title=" context"> context</a>, <a href="https://publications.waset.org/abstracts/search?q=empirical%20study" title=" empirical study"> empirical study</a> </p> <a href="https://publications.waset.org/abstracts/85668/the-interplay-of-factors-affecting-learning-of-introductory-programming-a-comparative-study-of-an-australian-and-an-indian-university" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85668.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10069</span> Programming without Code: An Approach and Environment to Conditions-On-Data Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Philippe%20Larvet">Philippe Larvet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the concept of an object-based programming language where tests (if... then... else) and control structures (while, repeat, for...) disappear and are replaced by conditions on data. According to the object paradigm, by using this concept, data are still embedded inside objects, as variable-value couples, but object methods are expressed into the form of logical propositions (‘conditions on data’ or COD).For instance : variable1 = value1 AND variable2 > value2 => variable3 = value3. Implementing this approach, a central inference engine turns and examines objects one after another, collecting all CODs of each object. CODs are considered as rules in a rule-based system: the left part of each proposition (left side of the ‘=>‘ sign) is the premise and the right part is the conclusion. So, premises are evaluated and conclusions are fired. Conclusions modify the variable-value couples of the object and the engine goes to examine the next object. The paper develops the principles of writing CODs instead of complex algorithms. Through samples, the paper also presents several hints for implementing a simple mechanism able to process this ‘COD language’. The proposed approach can be used within the context of simulation, process control, industrial systems validation, etc. By writing simple and rigorous conditions on data, instead of using classical and long-to-learn languages, engineers and specialists can easily simulate and validate the functioning of complex systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conditions%20on%20data" title="conditions on data">conditions on data</a>, <a href="https://publications.waset.org/abstracts/search?q=logical%20proposition" title=" logical proposition"> logical proposition</a>, <a href="https://publications.waset.org/abstracts/search?q=programming%20without%20code" title=" programming without code"> programming without code</a>, <a href="https://publications.waset.org/abstracts/search?q=object-oriented%20programming" title=" object-oriented programming"> object-oriented programming</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20simulation" title=" system simulation"> system simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20validation" title=" system validation"> system validation</a> </p> <a href="https://publications.waset.org/abstracts/74464/programming-without-code-an-approach-and-environment-to-conditions-on-data-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74464.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">221</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=336">336</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=337">337</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=systems%20programming&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>