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: formal verification</title> <meta name="description" content="Search results for: formal verification"> <meta name="keywords" content="formal verification"> <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="formal verification" 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="formal verification"> <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> 1400</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: formal verification</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1400</span> Novel Formal Verification Based Coverage Augmentation Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Surinder%20Sood">Surinder Sood</a>, <a href="https://publications.waset.org/abstracts/search?q=Debajyoti%20Mukherjee"> Debajyoti Mukherjee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Formal verification techniques have become widely popular in pre-silicon verification as an alternate to constrain random simulation based techniques. This paper proposed a novel formal verification-based coverage augmentation technique in verifying complex RTL functional verification faster. The proposed approach relies on augmenting coverage analysis coming from simulation and formal verification. Besides this, the functional qualification framework not only helps in improving the coverage at a faster pace but also aids in maturing and qualifying the formal verification infrastructure. The proposed technique has helped to achieve faster verification sign-off, resulting in faster time-to-market. The design picked had a complex control and data path and had many configurable options to meet multiple specification needs. The flow is generic, and tool independent, thereby leveraging across the projects and design will be much easier <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=COI%20%28cone%20of%20influence%29" title="COI (cone of influence)">COI (cone of influence)</a>, <a href="https://publications.waset.org/abstracts/search?q=coverage" title=" coverage"> coverage</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20injection" title=" fault injection"> fault injection</a> </p> <a href="https://publications.waset.org/abstracts/159250/novel-formal-verification-based-coverage-augmentation-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159250.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">124</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">1399</span> Formal Verification of Cache System Using a Novel Cache Memory Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guowei%20Hou">Guowei Hou</a>, <a href="https://publications.waset.org/abstracts/search?q=Lixin%20Yu"> Lixin Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei%20Zhuang"> Wei Zhuang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hui%20Qin"> Hui Qin</a>, <a href="https://publications.waset.org/abstracts/search?q=Xue%20Yang"> Xue Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Formal verification is proposed to ensure the correctness of the design and make functional verification more efficient. As cache plays a vital role in the design of System on Chip (SoC), and cache with Memory Management Unit (MMU) and cache memory unit makes the state space too large for simulation to verify, then a formal verification is presented for such system design. In the paper, a formal model checking verification flow is suggested and a new cache memory model which is called “exhaustive search model” is proposed. Instead of using large size ram to denote the whole cache memory, exhaustive search model employs just two cache blocks. For cache system contains data cache (Dcache) and instruction cache (Icache), Dcache memory model and Icache memory model are established separately using the same mechanism. At last, the novel model is employed to the verification of a cache which is module of a custom-built SoC system that has been applied in practical, and the result shows that the cache system is verified correctly using the exhaustive search model, and it makes the verification much more manageable and flexible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cache%20system" title="cache system">cache system</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/abstracts/search?q=novel%20model" title=" novel model"> novel model</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20on%20chip%20%28SoC%29" title=" system on chip (SoC)"> system on chip (SoC)</a> </p> <a href="https://publications.waset.org/abstracts/26581/formal-verification-of-cache-system-using-a-novel-cache-memory-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26581.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">496</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">1398</span> Formal Verification for Ethereum Smart Contract Using Coq</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xia%20Yang">Xia Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Zheng%20Yang"> Zheng Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Haiyong%20Sun"> Haiyong Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Fang"> Yan Fang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jingyu%20Liu"> Jingyu Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jia%20Song"> Jia Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The smart contract in Ethereum is a unique program deployed on the Ethereum Virtual Machine (EVM) to help manage cryptocurrency. The security of this smart contract is critical to Ethereum’s operation and highly sensitive. In this paper, we present a formal model for smart contract, using the separated term-obligation (STO) strategy to formalize and verify the smart contract. We use the IBM smart sponsor contract (SSC) as an example to elaborate the detail of the formalizing process. We also propose a formal smart sponsor contract model (FSSCM) and verify SSC’s security properties with an interactive theorem prover Coq. We found the 'Unchecked-Send' vulnerability in the SSC, using our formal model and verification method. Finally, we demonstrate how we can formalize and verify other smart contracts with this approach, and our work indicates that this formal verification can effectively verify the correctness and security of smart contracts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=smart%20contract" title="smart contract">smart contract</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/abstracts/search?q=Ethereum" title=" Ethereum"> Ethereum</a>, <a href="https://publications.waset.org/abstracts/search?q=Coq" title=" Coq"> Coq</a> </p> <a href="https://publications.waset.org/abstracts/85595/formal-verification-for-ethereum-smart-contract-using-coq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85595.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">691</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">1397</span> Cloud-Based Dynamic Routing with Feedback in Formal Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jawid%20Ahmad%20Baktash">Jawid Ahmad Baktash</a>, <a href="https://publications.waset.org/abstracts/search?q=Mursal%20Dawodi"> Mursal Dawodi</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomokazu%20Nagata"> Tomokazu Nagata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the rapid growth of Cloud Computing, Formal Methods became a good choice for the refinement of message specification and verification for Dynamic Routing in Cloud Computing. Cloud-based Dynamic Routing is becoming increasingly popular. We propose feedback in Formal Methods for Dynamic Routing and Cloud Computing; the model and topologies show how to send messages from index zero to all others formally. The responsibility of proper verification becomes crucial with Dynamic Routing in the cloud. Formal Methods can play an essential role in the routing and development of Networks, and the testing of distributed systems. Event-B is a formal technique that consists of describing the problem rigorously and introduces solutions or details in the refinement steps. Event-B is a variant of B, designed for developing distributed systems and message passing of the dynamic routing. In Event-B and formal methods, the events consist of guarded actions occurring spontaneously rather than being invoked. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud" title="cloud">cloud</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20routing" title=" dynamic routing"> dynamic routing</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20method" title=" formal method"> formal method</a>, <a href="https://publications.waset.org/abstracts/search?q=Pro-B" title=" Pro-B"> Pro-B</a>, <a href="https://publications.waset.org/abstracts/search?q=event-B" title=" event-B"> event-B</a> </p> <a href="https://publications.waset.org/abstracts/49044/cloud-based-dynamic-routing-with-feedback-in-formal-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49044.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">423</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">1396</span> Failure Analysis and Verification Using an Integrated Method for Automotive Electric/Electronic Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lei%20Chen">Lei Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Jian%20Jiao"> Jian Jiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Tingdi%20Zhao"> Tingdi Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Failures of automotive electric/electronic systems, which are universally considered to be safety-critical and software-intensive, may cause catastrophic accidents. Analysis and verification of failures in these kinds of systems is a big challenge with increasing system complexity. Model-checking is often employed to allow formal verification by ensuring that the system model conforms to specified safety properties. The system-level effects of failures are established, and the effects on system behavior are observed through the formal verification. A hazard analysis technique, called Systems-Theoretic Process Analysis, is capable of identifying design flaws which may cause potential failure hazardous, including software and system design errors and unsafe interactions among multiple system components. This paper provides a concept on how to use model-checking integrated with Systems-Theoretic Process Analysis to perform failure analysis and verification of automotive electric/electronic systems. As a result, safety requirements are optimized, and failure propagation paths are found. Finally, an automotive electric/electronic system case study is used to verify the effectiveness and practicability of the method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=failure%20analysis%20and%20verification" title="failure analysis and verification">failure analysis and verification</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20checking" title=" model checking"> model checking</a>, <a href="https://publications.waset.org/abstracts/search?q=system-theoretic%20process%20analysis" title=" system-theoretic process analysis"> system-theoretic process analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=automotive%20electric%2Felectronic%20system" title=" automotive electric/electronic system"> automotive electric/electronic system</a> </p> <a href="https://publications.waset.org/abstracts/112321/failure-analysis-and-verification-using-an-integrated-method-for-automotive-electricelectronic-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112321.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">121</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">1395</span> A Formal Verification Approach for Linux Kernel Designing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zi%20Wang">Zi Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinlei%20He"> Xinlei He</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianghua%20Lv"> Jianghua Lv</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuqing%20Lan"> Yuqing Lan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Kernel though widely used, is complicated. Errors caused by some bugs are often costly. Statically, more than half of the mistakes occur in the design phase. Thus, we introduce a modeling method, KMVM (Linux Kernel Modeling and verification Method), based on type theory for proper designation and correct exploitation of the Kernel. In the model, the Kernel is separated into six levels: subsystem, dentry, file, struct, func, and base. Each level is treated as a type. The types are specified in the structure and relationship. At the same time, we use a demanding path to express the function to be implemented. The correctness of the design is verified by recursively checking the type relationship and type existence. The method has been applied to verify the OPEN business of VFS (virtual file system) in Linux Kernel. Also, we have designed and developed a set of security communication mechanisms in the Kernel with verification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=formal%20approach" title="formal approach">formal approach</a>, <a href="https://publications.waset.org/abstracts/search?q=type%20theory" title=" type theory"> type theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Linux%20Kernel" title=" Linux Kernel"> Linux Kernel</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20program" title=" software program"> software program</a> </p> <a href="https://publications.waset.org/abstracts/155062/a-formal-verification-approach-for-linux-kernel-designing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155062.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">137</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">1394</span> Petra: Simplified, Scalable Verification Using an Object-Oriented, Compositional Process Calculus</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aran%20Hakki">Aran Hakki</a>, <a href="https://publications.waset.org/abstracts/search?q=Corina%20Cirstea"> Corina Cirstea</a>, <a href="https://publications.waset.org/abstracts/search?q=Julian%20Rathke"> Julian Rathke</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Formal methods are yet to be utilized in mainstream software development due to issues in scaling and implementation costs. This work is about developing a scalable, simplified, pragmatic, formal software development method with strong correctness properties and guarantees that are easy prove. The method aims to be easy to learn, use and apply without extensive training and experience in formal methods. Petra is proposed as an object-oriented, process calculus with composable data types and sequential/parallel processes. Petra has a simple denotational semantics, which includes a definition of Correct by Construction. The aim is for Petra is to be standard which can be implemented to execute on various mainstream programming platforms such as Java. Work towards an implementation of Petra as a Java EDSL (Embedded Domain Specific Language) is also discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=compositionality" title="compositionality">compositionality</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20method" title=" formal method"> formal method</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20verification" title=" software verification"> software verification</a>, <a href="https://publications.waset.org/abstracts/search?q=Java" title=" Java"> Java</a>, <a href="https://publications.waset.org/abstracts/search?q=denotational%20semantics" title=" denotational semantics"> denotational semantics</a>, <a href="https://publications.waset.org/abstracts/search?q=rewriting%20systems" title=" rewriting systems"> rewriting systems</a>, <a href="https://publications.waset.org/abstracts/search?q=rewriting%20semantics" title=" rewriting semantics"> rewriting semantics</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20processing" title=" parallel processing"> parallel processing</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=OOP" title=" OOP"> OOP</a>, <a href="https://publications.waset.org/abstracts/search?q=programming%20language" title=" programming language"> programming language</a>, <a href="https://publications.waset.org/abstracts/search?q=correct%20by%20construction" title=" correct by construction"> correct by construction</a> </p> <a href="https://publications.waset.org/abstracts/152577/petra-simplified-scalable-verification-using-an-object-oriented-compositional-process-calculus" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152577.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">144</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">1393</span> A Formal Property Verification for Aspect-Oriented Programs in Software Development</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moustapha%20Bande">Moustapha Bande</a>, <a href="https://publications.waset.org/abstracts/search?q=Hakima%20Ould-Slimane"> Hakima Ould-Slimane</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanifa%20Boucheneb"> Hanifa Boucheneb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software development for complex systems requires efficient and automatic tools that can be used to verify the satisfiability of some critical properties such as security ones. With the emergence of Aspect-Oriented Programming (AOP), considerable work has been done in order to better modularize the separation of concerns in the software design and implementation. The goal is to prevent the cross-cutting concerns to be scattered across the multiple modules of the program and tangled with other modules. One of the key challenges in the aspect-oriented programs is to be sure that all the pieces put together at the weaving time ensure the satisfiability of the overall system requirements. Our paper focuses on this problem and proposes a formal property verification approach for a given property from the woven program. The approach is based on the control flow graph (CFG) of the woven program, and the use of a satisfiability modulo theories (SMT) solver to check whether each property (represented par one aspect) is satisfied or not once the weaving is done. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aspect-oriented%20programming" title="aspect-oriented programming">aspect-oriented programming</a>, <a href="https://publications.waset.org/abstracts/search?q=control%20flow%20graph" title=" control flow graph"> control flow graph</a>, <a href="https://publications.waset.org/abstracts/search?q=property%20verification" title=" property verification"> property verification</a>, <a href="https://publications.waset.org/abstracts/search?q=satisfiability%20modulo%20theories" title=" satisfiability modulo theories"> satisfiability modulo theories</a> </p> <a href="https://publications.waset.org/abstracts/97503/a-formal-property-verification-for-aspect-oriented-programs-in-software-development" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97503.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">176</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">1392</span> Validation of the Formal Model of Web Services Applications for Digital Reference Service of Library Information System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zainab%20Magaji%20Musa">Zainab Magaji Musa</a>, <a href="https://publications.waset.org/abstracts/search?q=Nordin%20M.%20A.%20Rahman"> Nordin M. A. Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=Julaily%20Aida%20Jusoh"> Julaily Aida Jusoh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The web services applications for digital reference service (WSDRS) of LIS model is an informal model that claims to reduce the problems of digital reference services in libraries. It uses web services technology to provide efficient way of satisfying users’ needs in the reference section of libraries. The formal WSDRS model consists of the Z specifications of all the informal specifications of the model. This paper discusses the formal validation of the Z specifications of WSDRS model. The authors formally verify and thus validate the properties of the model using Z/EVES theorem prover. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=validation" title="validation">validation</a>, <a href="https://publications.waset.org/abstracts/search?q=verification" title=" verification"> verification</a>, <a href="https://publications.waset.org/abstracts/search?q=formal" title=" formal"> formal</a>, <a href="https://publications.waset.org/abstracts/search?q=theorem%20prover" title=" theorem prover"> theorem prover</a> </p> <a href="https://publications.waset.org/abstracts/34902/validation-of-the-formal-model-of-web-services-applications-for-digital-reference-service-of-library-information-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34902.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">516</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">1391</span> Urban Rail Transit CBTC Computer Interlocking Subsystem Relying on Multi-Template Pen Point Tracking Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xinli%20Chen">Xinli Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Xue%20Su"> Xue Su</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the urban rail transit CBTC system, interlocking is considered one of the most basic sys-tems, which has the characteristics of logical complexity and high-security requirements. The development and verification of traditional interlocking subsystems are entirely manual pro-cesses and rely too much on the designer, which often hides many uncertain factors. In order to solve this problem, this article is based on the multi-template nib tracking algorithm for model construction and verification, achieving the main safety attributes and using SCADE for formal verification. Experimental results show that this method helps to improve the quality and efficiency of interlocking software. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20interlocking%20subsystem" title="computer interlocking subsystem">computer interlocking subsystem</a>, <a href="https://publications.waset.org/abstracts/search?q=penpoint%20tracking" title=" penpoint tracking"> penpoint tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=communication-based%20train%20control%20system" title=" communication-based train control system"> communication-based train control system</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-template%20tip%20tracking" title=" multi-template tip tracking"> multi-template tip tracking</a> </p> <a href="https://publications.waset.org/abstracts/140081/urban-rail-transit-cbtc-computer-interlocking-subsystem-relying-on-multi-template-pen-point-tracking-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140081.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">160</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">1390</span> Effect of Clinical Depression on Automatic Speaker Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sheeraz%20Memon">Sheeraz Memon</a>, <a href="https://publications.waset.org/abstracts/search?q=Namunu%20C.%20Maddage"> Namunu C. Maddage</a>, <a href="https://publications.waset.org/abstracts/search?q=Margaret%20Lech"> Margaret Lech</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicholas%20Allen"> Nicholas Allen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The effect of a clinical environment on the accuracy of the speaker verification was tested. The speaker verification tests were performed within homogeneous environments containing clinically depressed speakers only, and non-depresses speakers only, as well as within mixed environments containing different mixtures of both climatically depressed and non-depressed speakers. The speaker verification framework included the MFCCs features and the GMM modeling and classification method. The speaker verification experiments within homogeneous environments showed 5.1% increase of the EER within the clinically depressed environment when compared to the non-depressed environment. It indicated that the clinical depression increases the intra-speaker variability and makes the speaker verification task more challenging. Experiments with mixed environments indicated that the increase of the percentage of the depressed individuals within a mixed environment increases the speaker verification equal error rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=speaker%20verification" title="speaker verification">speaker verification</a>, <a href="https://publications.waset.org/abstracts/search?q=GMM" title=" GMM"> GMM</a>, <a href="https://publications.waset.org/abstracts/search?q=EM" title=" EM"> EM</a>, <a href="https://publications.waset.org/abstracts/search?q=clinical%20environment" title=" clinical environment"> clinical environment</a>, <a href="https://publications.waset.org/abstracts/search?q=clinical%20depression" title=" clinical depression"> clinical depression</a> </p> <a href="https://publications.waset.org/abstracts/39436/effect-of-clinical-depression-on-automatic-speaker-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39436.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">375</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">1389</span> Modeling and Analyzing the WAP Class 2 Wireless Transaction Protocol Using Event-B </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajaa%20Filali">Rajaa Filali</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Bouhdadi"> Mohamed Bouhdadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an incremental formal development of the Wireless Transaction Protocol (WTP) in Event-B. WTP is part of the Wireless Application Protocol (WAP) architectures and provides a reliable request-response service. To model and verify the protocol, we use the formal technique Event-B which provides an accessible and rigorous development method. This interaction between modelling and proving reduces the complexity and helps to eliminate misunderstandings, inconsistencies, and specification gaps. As result, verification of WTP allows us to find some deficiencies in the current specification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=event-B" title="event-B">event-B</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20transaction%20protocol" title=" wireless transaction protocol"> wireless transaction protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=proof%20obligation" title=" proof obligation"> proof obligation</a>, <a href="https://publications.waset.org/abstracts/search?q=refinement" title=" refinement"> refinement</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodin" title=" Rodin"> Rodin</a>, <a href="https://publications.waset.org/abstracts/search?q=ProB" title=" ProB"> ProB</a> </p> <a href="https://publications.waset.org/abstracts/73221/modeling-and-analyzing-the-wap-class-2-wireless-transaction-protocol-using-event-b" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73221.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">1388</span> VeriFy: A Solution to Implement Autonomy Safely and According to the Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Naderhirn">Michael Naderhirn</a>, <a href="https://publications.waset.org/abstracts/search?q=Marco%20Pavone"> Marco Pavone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Problem statement, motivation, and aim of work: So far, the development of control algorithms was done by control engineers in a way that the controller would fit a specification by testing. When it comes to the certification of an autonomous car in highly complex scenarios, the challenge is much higher since such a controller must mathematically guarantee to implement the rules of the road while on the other side guarantee aspects like safety and real time executability. What if it becomes reality to solve this demanding problem by combining Formal Verification and System Theory? The aim of this work is to present a workflow to solve the above mentioned problem. Summary of the presented results / main outcomes: We show the usage of an English like language to transform the rules of the road into system specification for an autonomous car. The language based specifications are used to define system functions and interfaces. Based on that a formal model is developed which formally correctly models the specifications. On the other side, a mathematical model describing the systems dynamics is used to calculate the systems reachability set which is further used to determine the system input boundaries. Then a motion planning algorithm is applied inside the system boundaries to find an optimized trajectory in combination with the formal specification model while satisfying the specifications. The result is a control strategy which can be applied in real time independent of the scenario with a mathematical guarantee to satisfy a predefined specification. We demonstrate the applicability of the method in simulation driving scenarios and a potential certification. Originality, significance, and benefit: To the authors’ best knowledge, it is the first time that it is possible to show an automated workflow which combines a specification in an English like language and a mathematical model in a mathematical formal verified way to synthesizes a controller for potential real time applications like autonomous driving. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=formal%20system%20verification" title="formal system verification">formal system verification</a>, <a href="https://publications.waset.org/abstracts/search?q=reachability" title=" reachability"> reachability</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20time%20controller" title=" real time controller"> real time controller</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20system" title=" hybrid system"> hybrid system</a> </p> <a href="https://publications.waset.org/abstracts/43669/verify-a-solution-to-implement-autonomy-safely-and-according-to-the-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43669.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">241</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">1387</span> Formal Implementation of Routing Information Protocol Using Event-B</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jawid%20Ahmad%20Baktash">Jawid Ahmad Baktash</a>, <a href="https://publications.waset.org/abstracts/search?q=Tadashi%20Shiroma"> Tadashi Shiroma</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomokazu%20Nagata"> Tomokazu Nagata</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuji%20Taniguchi"> Yuji Taniguchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Morikazu%20Nakamura"> Morikazu Nakamura</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this paper is to explore the use of formal methods for Dynamic Routing, The purpose of network communication with dynamic routing is sending a massage from one node to others by using pacific protocols. In dynamic routing connections are possible based on protocols of Distance vector (Routing Information Protocol, Border Gateway protocol), Link State (Open Shortest Path First, Intermediate system Intermediate System), Hybrid (Enhanced Interior Gateway Routing Protocol). The responsibility for proper verification becomes crucial with Dynamic Routing. Formal methods can play an essential role in the Routing, development of Networks and testing of distributed systems. Event-B is a formal technique consists of describing rigorously the problem; introduce solutions or details in the refinement steps to obtain more concrete specification, and verifying that proposed solutions are correct. The system is modeled in terms of an abstract state space using variables with set theoretic types and the events that modify state variables. Event-B is a variant of B, was designed for developing distributed systems. In Event-B, the events consist of guarded actions occurring spontaneously rather than being invoked. The invariant state properties must be satisfied by the variables and maintained by the activation of the events. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20rout%20RIP" title="dynamic rout RIP">dynamic rout RIP</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20method" title=" formal method"> formal method</a>, <a href="https://publications.waset.org/abstracts/search?q=event-B" title=" event-B"> event-B</a>, <a href="https://publications.waset.org/abstracts/search?q=pro-B" title=" pro-B"> pro-B</a> </p> <a href="https://publications.waset.org/abstracts/38499/formal-implementation-of-routing-information-protocol-using-event-b" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38499.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">401</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">1386</span> Functional and Stimuli Implementation and Verification of Programmable Peripheral Interface (PPI) Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20N.%20Joshi">N. N. Joshi</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20K.%20Singh"> G. K. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present the stimuli implementation and verification of a Programmable Peripheral Interface (PPI) 8255. It involves a designing and verification of configurable intellectual property (IP) module of PPI protocol using Verilog HDL for implementation part and System Verilog for verification. The overview of the PPI-8255 presented then the design specification implemented for the work following the functional description and pin configuration of PPI-8255. The coverage report of design shows that our design and verification environment covered 100% functionality in accordance with the design specification generated by the Questa Sim 10.0b. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Programmable%20Peripheral%20Interface%20%28PPI%29" title="Programmable Peripheral Interface (PPI)">Programmable Peripheral Interface (PPI)</a>, <a href="https://publications.waset.org/abstracts/search?q=verilog%20HDL" title=" verilog HDL"> verilog HDL</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20verilog" title=" system verilog"> system verilog</a>, <a href="https://publications.waset.org/abstracts/search?q=questa%20sim" title=" questa sim "> questa sim </a> </p> <a href="https://publications.waset.org/abstracts/21194/functional-and-stimuli-implementation-and-verification-of-programmable-peripheral-interface-ppi-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21194.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">522</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">1385</span> Signature Verification System for a Banking Business Process Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Rahaf">A. Rahaf</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Liyakathunsia"> S. Liyakathunsia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In today’s world, unprecedented operational pressure is faced by banks that test the efficiency, effectiveness, and agility of their business processes. In a typical banking process, a person’s authorization is usually based on his signature on most all of the transactions. Signature verification is considered as one of the highly significant information needed for any bank document processing. Banks usually use Signature Verification to authenticate the identity of individuals. In this paper, a business process model has been proposed in order to increase the quality of the verification process and to reduce time and needed resources. In order to understand the current process, a survey has been conducted and distributed among bank employees. After analyzing the survey, a process model has been created using Bizagi modeler which helps in simulating the process after assigning time and cost of it. The outcomes show that the automation of signature verification process is highly recommended for a banking business process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20process%20management" title="business process management">business process management</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20modeling" title=" process modeling"> process modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=quality" title=" quality"> quality</a>, <a href="https://publications.waset.org/abstracts/search?q=Signature%20Verification" title=" Signature Verification"> Signature Verification</a> </p> <a href="https://publications.waset.org/abstracts/67664/signature-verification-system-for-a-banking-business-process-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67664.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">427</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">1384</span> The Experiences of Secondary School Students in History Lessons in Distance and Formal Education</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Osman%20Okumu%C5%9F">Osman Okumuş</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The pandemic has significantly affected every aspect of life. Especially in recenttimes, as a result of this effect, we have come closer to technology. Distance education has taken the place of formal education rather than supporting formal education. Thiscreatednewexperiencesforbothteachersandstudents. This research focused on revealing the experiences of the same students in distance and formal education, especially in history lessons. In the study, which was designed as a case study, 20 students were interviewed through a semi-structured interview form prepared by the researcher. The results show that both learning environments provide students with important experiences. However, despite the fact that the students developed their digital competencies and experienced different learning environments, they focused on formal education in the name of socialization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=history%20lessons" title="history lessons">history lessons</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20education" title=" distance education"> distance education</a>, <a href="https://publications.waset.org/abstracts/search?q=pandemic." title=" pandemic."> pandemic.</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20education" title=" formal education"> formal education</a> </p> <a href="https://publications.waset.org/abstracts/156204/the-experiences-of-secondary-school-students-in-history-lessons-in-distance-and-formal-education" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156204.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">100</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">1383</span> An Encapsulation of a Navigable Tree Position: Theory, Specification, and Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nicodemus%20M.%20J.%20Mbwambo">Nicodemus M. J. Mbwambo</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu-Shan%20Sun"> Yu-Shan Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Murali%20Sitaraman"> Murali Sitaraman</a>, <a href="https://publications.waset.org/abstracts/search?q=Joan%20Krone"> Joan Krone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a generic data abstraction that captures a navigable tree position. The mathematical modeling of the abstraction encapsulates the current tree position, which can be used to navigate and modify the tree. The encapsulation of the tree position in the data abstraction specification avoids the use of explicit references and aliasing, thereby simplifying verification of (imperative) client code that uses the data abstraction. To ease the tasks of such specification and verification, a general tree theory, rich with mathematical notations and results, has been developed. The paper contains an example to illustrate automated verification ramifications. With sufficient tree theory development, automated proving seems plausible even in the absence of a special-purpose tree solver. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automation" title="automation">automation</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20abstraction" title=" data abstraction"> data abstraction</a>, <a href="https://publications.waset.org/abstracts/search?q=maps" title=" maps"> maps</a>, <a href="https://publications.waset.org/abstracts/search?q=specification" title=" specification"> specification</a>, <a href="https://publications.waset.org/abstracts/search?q=tree" title=" tree"> tree</a>, <a href="https://publications.waset.org/abstracts/search?q=verification" title=" verification"> verification</a> </p> <a href="https://publications.waset.org/abstracts/131080/an-encapsulation-of-a-navigable-tree-position-theory-specification-and-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131080.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">166</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">1382</span> Pyramid Binary Pattern for Age Invariant Face Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saroj%20Bijarnia">Saroj Bijarnia</a>, <a href="https://publications.waset.org/abstracts/search?q=Preety%20Singh"> Preety Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a simple and effective biometrics system based on face verification across aging using a new variant of texture feature, Pyramid Binary Pattern. This employs Local Binary Pattern along with its hierarchical information. Dimension reduction of generated texture feature vector is done using Principal Component Analysis. Support Vector Machine is used for classification. Our proposed method achieves an accuracy of 92:24% and can be used in an automated age-invariant face verification system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biometrics" title="biometrics">biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=age%20invariant" title=" age invariant"> age invariant</a>, <a href="https://publications.waset.org/abstracts/search?q=verification" title=" verification"> verification</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machine" title=" support vector machine"> support vector machine</a> </p> <a href="https://publications.waset.org/abstracts/64435/pyramid-binary-pattern-for-age-invariant-face-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64435.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">353</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">1381</span> Adult and Non Formal Education for the Attainment of Enterprenuerial Skills in Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zulaiha%20Maluma%20Ahmad">Zulaiha Maluma Ahmad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper attempted to examine adult and non formal education for the attainment of entrepreneurial skills in empowering the citizens with entrepreneurial skills, for Nigeria’s socioeconomic development. This paper highlighted the meaning of education in the context of skill acquisition, entrepreneurial education, adult and non formal education. It also examined the objectives, issues and challenges as well as prospects of this type of education. It further discussed the role of adult and non formal education for the attainment of socioeconomic development of a growing nation like Nigeria. The paper equally proffered some recommendations and eventually concluded that adult and non formal education can indeed make self reliance, personal satisfaction and the attainment of entrepreneurial education for the socioeconomic development of any nation, possible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=entrepreneurial%20education" title="entrepreneurial education">entrepreneurial education</a>, <a href="https://publications.waset.org/abstracts/search?q=adult%20education" title=" adult education"> adult education</a>, <a href="https://publications.waset.org/abstracts/search?q=non%20formal%20education%20skills" title=" non formal education skills"> non formal education skills</a>, <a href="https://publications.waset.org/abstracts/search?q=Nigeria" title=" Nigeria"> Nigeria</a> </p> <a href="https://publications.waset.org/abstracts/24131/adult-and-non-formal-education-for-the-attainment-of-enterprenuerial-skills-in-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24131.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">597</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">1380</span> Opacity Synthesis with Orwellian Observers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moez%20Yeddes">Moez Yeddes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The property of opacity is widely used in the formal verification of security in computer systems and protocols. Opacity is a general language-theoretic scheme of many security properties of systems. Opacity is parametrized with framework in which several security properties of a system can be expressed. A secret behaviour of a system is opaque if a passive attacker can never deduce its occurrence from the system observation. Instead of considering the case of static observability where the set of observable events is fixed off-line or dynamic observability where the set of observable events changes over time depending on the history of the trace, we introduce Orwellian partial observability where unobservable events are not revealed provided that downgrading events never occurs in the future of the trace. Orwellian partial observability is needed to model intransitive information flow. This Orwellian observability is knwon as ipurge function. We show in previous work how to verify opacity for regular secret is opaque for a regular language L w.r.t. an Orwellian projection is PSPACE-complete while it has been proved undecidable even for a regular language L w.r.t. a general Orwellian observation function. In this paper, we address two problems of opacification of a regular secret ϕ for a regular language L w.r.t. an Orwellian projection: Given L and a secret ϕ ∈ L, the first problem consist to compute some minimal regular super-language M of L, if it exists, such that ϕ is opaque for M and the second consists to compute the supremal sub-language M′ of L such that ϕ is opaque for M′. We derive both language-theoretic characterizations and algorithms to solve these two dual problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=security%20policies" title="security policies">security policies</a>, <a href="https://publications.waset.org/abstracts/search?q=opacity" title=" opacity"> opacity</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/abstracts/search?q=orwellian%0D%0Aobservation" title=" orwellian observation"> orwellian observation</a> </p> <a href="https://publications.waset.org/abstracts/41268/opacity-synthesis-with-orwellian-observers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41268.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">225</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">1379</span> Physical Verification Flow on Multiple Foundries</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rohaya%20Abdul%20Wahab">Rohaya Abdul Wahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Raja%20Mohd%20Fuad%20Tengku%20Aziz"> Raja Mohd Fuad Tengku Aziz</a>, <a href="https://publications.waset.org/abstracts/search?q=Nazaliza%20Othman"> Nazaliza Othman</a>, <a href="https://publications.waset.org/abstracts/search?q=Sharifah%20Saleh"> Sharifah Saleh</a>, <a href="https://publications.waset.org/abstracts/search?q=Nabihah%20Razali"> Nabihah Razali</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Al%20Baqir%20Zinal%20Abidin"> Muhammad Al Baqir Zinal Abidin</a>, <a href="https://publications.waset.org/abstracts/search?q=Md%20Hanif%20Md%20Nasir"> Md Hanif Md Nasir </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper will discuss how we optimize our physical verification flow in our IC Design Department having various rule decks from multiple foundries. Our ultimate goal is to achieve faster time to tape-out and avoid schedule delay. Currently the physical verification runtimes and memory usage have drastically increased with the increasing number of design rules, design complexity and the size of the chips to be verified. To manage design violations, we use a number of solutions to reduce the amount of violations needed to be checked by physical verification engineers. The most important functions in physical verifications are DRC (design rule check), LVS (layout vs. schematic) and XRC (extraction). Since we have a multiple number of foundries for our design tape-outs, we need a flow that improve the overall turnaround time and ease of use of the physical verification process. The demand for fast turnaround time is even more critical since the physical design is the last stage before sending the layout to the foundries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=physical%20verification" title="physical verification">physical verification</a>, <a href="https://publications.waset.org/abstracts/search?q=DRC" title=" DRC"> DRC</a>, <a href="https://publications.waset.org/abstracts/search?q=LVS" title=" LVS"> LVS</a>, <a href="https://publications.waset.org/abstracts/search?q=XRC" title=" XRC"> XRC</a>, <a href="https://publications.waset.org/abstracts/search?q=flow" title=" flow"> flow</a>, <a href="https://publications.waset.org/abstracts/search?q=foundry" title=" foundry"> foundry</a>, <a href="https://publications.waset.org/abstracts/search?q=runset" title=" runset"> runset</a> </p> <a href="https://publications.waset.org/abstracts/29033/physical-verification-flow-on-multiple-foundries" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29033.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">654</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">1378</span> The Analogue of a Property of Pisot Numbers in Fields of Formal Power Series</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wiem%20Gadri">Wiem Gadri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study delves into the intriguing properties of Pisot and Salem numbers within the framework of formal Laurent series over finite fields, a domain where these numbers’ spectral charac-teristics, Λm(β) and lm(β), have yet to be fully explored. Utilizing a methodological approach that combines algebraic number theory with the analysis of power series, we extend the foundational work of Erdos, Joo, and Komornik to this new setting. Our research uncovers bounds for lm(β), revealing how these depend on the degree of the minimal polynomial of β and thus offering a novel characterization of Pisot and Salem formal power series. The findings significantly contribute to our understanding of these numbers, highlighting their distribution and properties in the context of formal power series. This investigation not only bridges number theory with formal power series analysis but also sets the stage for further interdisciplinary research in these areas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pisot%20numbers" title="Pisot numbers">Pisot numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=Salem%20numbers" title=" Salem numbers"> Salem numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20power%20series" title=" formal power series"> formal power series</a>, <a href="https://publications.waset.org/abstracts/search?q=over%20a%20finite%20field" title=" over a finite field"> over a finite field</a> </p> <a href="https://publications.waset.org/abstracts/147057/the-analogue-of-a-property-of-pisot-numbers-in-fields-of-formal-power-series" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147057.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">51</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">1377</span> A Reduced Distributed Sate Space for Modular Petri Nets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sawsen%20Khlifa">Sawsen Khlifa</a>, <a href="https://publications.waset.org/abstracts/search?q=Chiheb%20AMeur%20Abid"> Chiheb AMeur Abid</a>, <a href="https://publications.waset.org/abstracts/search?q=Belhassan%20Zouari"> Belhassan Zouari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modular verification approaches have been widely attempted to cope with the well known state explosion problem. This paper deals with the modular verification of modular Petri nets. We propose a reduced version for the modular state space of a given modular Petri net. The new structure allows the creation of smaller modular graphs. Each one draws the behavior of the corresponding module and outlines some global information. Hence, this version helps to overcome the explosion problem and to use less memory space. In this condensed structure, the verification of some generic properties concerning one module is limited to the exploration of its associated graph. <p class="card-text"><strong>Keywords:</strong> <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=modular%20verification" title=" modular verification"> modular verification</a>, <a href="https://publications.waset.org/abstracts/search?q=petri%20nets" title=" petri nets"> petri nets</a>, <a href="https://publications.waset.org/abstracts/search?q=state%20space%20explosition" title=" state space explosition"> state space explosition</a> </p> <a href="https://publications.waset.org/abstracts/148880/a-reduced-distributed-sate-space-for-modular-petri-nets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148880.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">115</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">1376</span> Formal Thai National Costume in the Reign of King Bhumibol Adulyadej</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chanoknart%20Mayusoh">Chanoknart Mayusoh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research about Formal Thai National Costume in the reign of King Bhumibol Adulyadej is an applied research that aimed to study the accurate knowledge concerning to Thai national costume in the reign of King Rama IX, also to study origin of all costumes in the reign of King Rama IX and to study the style, material used, and using accasion. This research methodology which are collect quanlitative data through observation, document, and photograph from key informant of costume in the reign of King Rama IX and from another who related to this field. The formal Thai national costume of the reign of King Bhumibol Adulyadej originated from the visit of His Majesty the King to Europe and America in 1960. Since Thailand had no traditional national costume; Her Majesty the Queen initiated the idea to create formal Thai national costumes. In 1964, Her Majesty the Queen selected 8 styles of formal Thai national costume. Later, Her Majesty the Queen confered another 3 formal Thai national costume for men. There are 8 styles of formal Thai national costume for women: Thai Ruean Ton, Thai Chit Lada, Thai Amarin, Thai Borom Phiman, Thai Siwalia, Thai Chakkri, Thai Dusit, and Thai Chakkraphat. There are 3 styles of formal Thai national costume for men: short-sleeve shirt, long-sleeve shirt, and long-sleeve shirt with breechcloth. The costume is widely used in formal ceremony such as greeting ceremony for official foreign visitors, wedding ceremony, or other auspicious ceremonies. Now a day, they are always used as a bridal gown as well. The formal Thai national costume is valuable art that shows Thai identity and, should be preserved for the next generation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=formal%20Thai%20national%20costume%20for%20women" title="formal Thai national costume for women">formal Thai national costume for women</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20Thai%20national%20costume%20for%20men" title=" formal Thai national costume for men"> formal Thai national costume for men</a>, <a href="https://publications.waset.org/abstracts/search?q=His%20Majesty%20King%20Bhumibol%20Adulyadej%20the%20Great%20King%20Rama%20IX" title=" His Majesty King Bhumibol Adulyadej the Great King Rama IX"> His Majesty King Bhumibol Adulyadej the Great King Rama IX</a>, <a href="https://publications.waset.org/abstracts/search?q=Her%20Majesty%20Queen%20Sirikit%20Queen" title=" Her Majesty Queen Sirikit Queen"> Her Majesty Queen Sirikit Queen</a> </p> <a href="https://publications.waset.org/abstracts/10856/formal-thai-national-costume-in-the-reign-of-king-bhumibol-adulyadej" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10856.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">257</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">1375</span> The Interrelationship between Formal and Informal Institutions and Its Impacts on the Autonomy of Public Service Delivery Units: The Case of Vietnam </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Minh%20Thi%20Hai%20Vo">Minh Thi Hai Vo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article draws on in-depth interviews with state employees at public hospitals and universities in its institutional analysis of the autonomy practices of public service delivery units in Vietnam. Unlike many empirical and theoretical studies that view formal and informal institutions as complements or substitutes, this article finds no evidence of complementary or substitutive relationships. Instead, the article finds that formal institutions accommodate informal ones and that informal institutions tend to compete and interfere, with the existing and ineffective formal institutions. The result of such conflicting relationship is that the actual autonomy of public service delivery units is, in most cases, perceived to be greater than the formal autonomy they are given. In the condition of poor regulation, the informal autonomy may result in unethical practices including rent-seeking and corruption. The implication of the study finding is policy-makers need to redesign and reorganize the autonomisation of public service delivery units to make informal institutions support and reinforce formal ones in a complementary manner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomy" title="autonomy">autonomy</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20institutions" title=" formal institutions"> formal institutions</a>, <a href="https://publications.waset.org/abstracts/search?q=informal%20institutions" title=" informal institutions"> informal institutions</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20service%20delivery%20units" title=" public service delivery units"> public service delivery units</a>, <a href="https://publications.waset.org/abstracts/search?q=Vietnam" title=" Vietnam"> Vietnam</a> </p> <a href="https://publications.waset.org/abstracts/89830/the-interrelationship-between-formal-and-informal-institutions-and-its-impacts-on-the-autonomy-of-public-service-delivery-units-the-case-of-vietnam" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89830.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">1374</span> The Effects of Three Leadership Styles on Individual Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leilei%20Liang">Leilei Liang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Leadership is commonly classified as formal leadership and informal leadership, which ignores and neglects the effects of 3rd type leadership. The emergence of 3rd type of leadership is closely related to special relations. To figure out the mechanism and effects of 3rd type leadership as well as the impacts of formal leadership and informal leadership on employee performance, this study collects data from 350 participants through a survey and proposes three hypotheses respectively from the perspective of expectation theory. The analytical results provide strong evidence for two of the three hypotheses, which demonstrate the positive correlation between formal leadership and individual performance and the negative relationship between 3rd type leadership and individual performance. This study contributes to leadership literature by putting forward the concept of the 3rd type of leadership. In addition, the effects of formal leadership, informal leadership, and 3rd type leadership on individual performance are discussed respectively in this study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=formal%20leadership" title="formal leadership">formal leadership</a>, <a href="https://publications.waset.org/abstracts/search?q=informal%20leadership" title=" informal leadership"> informal leadership</a>, <a href="https://publications.waset.org/abstracts/search?q=3rd%20leadership" title=" 3rd leadership"> 3rd leadership</a>, <a href="https://publications.waset.org/abstracts/search?q=individual%20performance" title=" individual performance"> individual performance</a>, <a href="https://publications.waset.org/abstracts/search?q=expectation%20theory" title=" expectation theory"> expectation theory</a> </p> <a href="https://publications.waset.org/abstracts/138223/the-effects-of-three-leadership-styles-on-individual-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138223.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">242</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">1373</span> Automatic Verification Technology of Virtual Machine Software Patch on IaaS Cloud</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yoji%20Yamato">Yoji Yamato</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an automatic verification technology of software patches for user virtual environments on IaaS Cloud to decrease verification costs of patches. In these days, IaaS services have been spread and many users can customize virtual machines on IaaS Cloud like their own private servers. Regarding to software patches of OS or middleware installed on virtual machines, users need to adopt and verify these patches by themselves. This task increases operation costs of users. Our proposed method replicates user virtual environments, extracts verification test cases for user virtual environments from test case DB, distributes patches to virtual machines on replicated environments and conducts those test cases automatically on replicated environments. We have implemented the proposed method on OpenStack using Jenkins and confirmed the feasibility. Using the implementation, we confirmed the effectiveness of test case creation efforts by our proposed idea of 2-tier abstraction of software functions and test cases. We also evaluated the automatic verification performance of environment replications, test cases extractions and test cases conductions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OpenStack" title="OpenStack">OpenStack</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=automatic%20verification" title=" automatic verification"> automatic verification</a>, <a href="https://publications.waset.org/abstracts/search?q=jenkins" title=" jenkins"> jenkins</a> </p> <a href="https://publications.waset.org/abstracts/17257/automatic-verification-technology-of-virtual-machine-software-patch-on-iaas-cloud" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17257.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">489</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">1372</span> Investigating Factors Influencing Online Formal and Informal Learning Satisfaction of College Students</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lei%20Zhang">Lei Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Ji"> Li Ji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Formal learning and informal learning represent two distinct learning styles: one is systematic and organized, another is causal and unstructured. Although there are many factors influencing online learning satisfaction, including self-regulation, self-efficacy, and interaction, factors influencing online formal learning and informal learning satisfaction may differ from each other. This paper investigated and compared influential factors of online formal and informal learning. Two questionnaires were created based on previous studies to explore factors influencing online formal learning and online informal learning satisfaction, respectively. A sample of 105 college students from different departments in a university located in the eastern part of China was selected to participate in this study. They all had an online learning experience and agreed to fill out questionnaires. Correlation analysis, variance analysis, and regression analysis were employed in this study. In addition, five participants were chosen for interviews. The study found that student-content, interaction, self-regulation, and self-efficacy related positively to both online formal learning and informal learning satisfaction. In addition, compared to online formal learning, student-content interaction in informal learning was the most influential factor for online learning satisfaction, perhaps that online informal learning was more goal-oriented and learners paid attention to the quality of content. In addition, results also revealed that interactions among students or teachers had little impact on online informal learning satisfaction. This study compared influential factors in online formal and informal learning satisfaction helped to add discussions to online learning satisfaction and contributed to further practices of online learning. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=learning%20satisfaction" title="learning satisfaction">learning satisfaction</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20learning" title=" formal learning"> formal learning</a>, <a href="https://publications.waset.org/abstracts/search?q=informal%20learning" title=" informal learning"> informal learning</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20learning" title=" online learning"> online learning</a> </p> <a href="https://publications.waset.org/abstracts/119904/investigating-factors-influencing-online-formal-and-informal-learning-satisfaction-of-college-students" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119904.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">164</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">1371</span> Identity Verification Using k-NN Classifiers and Autistic Genetic Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuad%20M.%20Alkoot">Fuad M. Alkoot</a> </p> <p class="card-text"><strong>Abstract:</strong></p> DNA data have been used in forensics for decades. However, current research looks at using the DNA as a biometric identity verification modality. The goal is to improve the speed of identification. We aim at using gene data that was initially used for autism detection to find if and how accurate is this data for identification applications. Mainly our goal is to find if our data preprocessing technique yields data useful as a biometric identification tool. We experiment with using the nearest neighbor classifier to identify subjects. Results show that optimal classification rate is achieved when the test set is corrupted by normally distributed noise with zero mean and standard deviation of 1. The classification rate is close to optimal at higher noise standard deviation reaching 3. This shows that the data can be used for identity verification with high accuracy using a simple classifier such as the k-nearest neighbor (k-NN).  <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biometrics" title="biometrics">biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20data" title=" genetic data"> genetic data</a>, <a href="https://publications.waset.org/abstracts/search?q=identity%20verification" title=" identity verification"> identity verification</a>, <a href="https://publications.waset.org/abstracts/search?q=k%20nearest%20neighbor" title=" k nearest neighbor"> k nearest neighbor</a> </p> <a href="https://publications.waset.org/abstracts/75552/identity-verification-using-k-nn-classifiers-and-autistic-genetic-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75552.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">258</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=formal%20verification&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&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=formal%20verification&page=46">46</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&page=47">47</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=formal%20verification&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>