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: optimality verification</title> <meta name="description" content="Search results for: optimality verification"> <meta name="keywords" content="optimality 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="optimality 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="optimality 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> 619</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: optimality verification</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">619</span> BIASS in the Estimation of Covariance Matrices and Optimality Criteria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Juan%20M.%20Rodriguez-Diaz">Juan M. Rodriguez-Diaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The precision of parameter estimators in the Gaussian linear model is traditionally accounted by the variance-covariance matrix of the asymptotic distribution. However, this measure can underestimate the true variance, specially for small samples. Traditionally, optimal design theory pays attention to this variance through its relationship with the model's information matrix. For this reason it seems convenient, at least in some cases, adapt the optimality criteria in order to get the best designs for the actual variance structure, otherwise the loss in efficiency of the designs obtained with the traditional approach may be very important. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlated%20observations" title="correlated observations">correlated observations</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20matrix" title=" information matrix"> information matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20criteria" title=" optimality criteria"> optimality criteria</a>, <a href="https://publications.waset.org/abstracts/search?q=variance-covariance%20matrix" title=" variance-covariance matrix "> variance-covariance matrix </a> </p> <a href="https://publications.waset.org/abstracts/31104/biass-in-the-estimation-of-covariance-matrices-and-optimality-criteria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31104.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">443</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">618</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">617</span> On Multiobjective Optimization to Improve the Scalability of Fog Application Deployments Using Fogtorch</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suleiman%20Aliyu">Suleiman Aliyu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integrating IoT applications with Fog systems presents challenges in optimization due to diverse environments and conflicting objectives. This study explores achieving Pareto optimal deployments for Fog-based IoT systems to address growing QoS demands. We introduce Pareto optimality to balance competing performance metrics. Using the FogTorch optimization framework, we propose a hybrid approach (Backtracking search with branch and bound) for scalable IoT deployments. Our research highlights the advantages of Pareto optimality over single-objective methods and emphasizes the role of FogTorch in this context. Initial results show improvements in IoT deployment cost in Fog systems, promoting resource-efficient strategies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pareto%20optimality" title="pareto optimality">pareto optimality</a>, <a href="https://publications.waset.org/abstracts/search?q=fog%20application%20deployment" title=" fog application deployment"> fog application deployment</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20of%20things" title=" internet of things"> internet of things</a> </p> <a href="https://publications.waset.org/abstracts/175224/on-multiobjective-optimization-to-improve-the-scalability-of-fog-application-deployments-using-fogtorch" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/175224.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">88</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">616</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">615</span> Optimization of Fourth Order Discrete-Approximation Inclusions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elimhan%20N.%20Mahmudov">Elimhan N. Mahmudov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper concerns the necessary and sufficient conditions of optimality for Cauchy problem of fourth order discrete (PD) and discrete-approximate (PDA) inclusions. The main problem is formulation of the fourth order adjoint discrete and discrete-approximate inclusions and transversality conditions, which are peculiar to problems including fourth order derivatives and approximate derivatives. Thus the necessary and sufficient conditions of optimality are obtained incorporating the Euler-Lagrange and Hamiltonian forms of inclusions. Derivation of optimality conditions are based on the apparatus of locally adjoint mapping (LAM). Moreover in the application of these results we consider the fourth order linear discrete and discrete-approximate inclusions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=difference" title="difference">difference</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=fourth" title=" fourth"> fourth</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=transversality" title=" transversality"> transversality</a> </p> <a href="https://publications.waset.org/abstracts/25199/optimization-of-fourth-order-discrete-approximation-inclusions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25199.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">374</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">614</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">613</span> Optimality Conditions and Duality for Semi-Inﬁnite Mathematical Programming Problems with Equilibrium Constraints, Using Convexiﬁcators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shashi%20Kant%20Mishra">Shashi Kant Mishra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider semi-inﬁnite mathematical programming problems with equilibrium constraints (SIMPEC). We establish necessary and suﬃcient optimality conditions for the SIMPEC, using convexiﬁcators. We study the Wolfe type dual problem for the SIMPEC under the ∂∗convexity assumptions. A Mond-Weir type dual problem is also formulated and studied for the SIMPEC under the ∂∗-convexity, ∂∗-pseudoconvexity and ∂∗quasiconvexity assumptions. Weak duality theorems are established to relate the SIMPEC and two dual programs in the framework of convexiﬁcators. Further, strong duality theorems are obtained under generalized standard Abadie constraint qualiﬁcation (GS-ACQ). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming%20problems%20with%20equilibrium%20constraints" title="mathematical programming problems with equilibrium constraints">mathematical programming problems with equilibrium constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20conditions" title=" optimality conditions"> optimality conditions</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-in%EF%AC%81nite%20programming" title=" semi-inﬁnite programming"> semi-inﬁnite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=convexi%EF%AC%81cators" title=" convexiﬁcators"> convexiﬁcators</a> </p> <a href="https://publications.waset.org/abstracts/61644/optimality-conditions-and-duality-for-semi-infinite-mathematical-programming-problems-with-equilibrium-constraints-using-convexificators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61644.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">328</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">612</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">611</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">425</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">610</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">609</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">352</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">608</span> Optimality Theoretic Account of Indian Loanwords in Hadhrami Arabic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Saleh%20Lahmdi">Mohammed Saleh Lahmdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Obeid%20Alfadly"> Hassan Obeid Alfadly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study explores an optimality-theoretic account of Indian loanwords in Hadhrami Arabic (henceforth HA), a variety of Arabic spoken in Hadhramout Province in the coastal areas and Hadhramout Valley. The purpose of this paper is to find out how the phonological forms of Indian loanwords can be accounted for from an OT standpoint. To achieve this purpose, two main instruments were implemented: participant observation and interview. The sample of this study was selected carefully with certain characteristics by judgment sampling consisting of eleven informants. An ethnographic qualitative approach was employed to find out the phonological articulations that the researcher encountered during the implementation. Many phonological processes are used and several markedness and faithfulness constraints have been interacted in conflict in order to choose the optimal form of Hadhrami realisations. The findings of the study confirm that the Hadhrami syllable structure prevails over the donor language, i.e., the Indian (mainly Urdu) language. Specifically, markedness constraints dominate faithfulness ones when most of the Indian loanwords are incorporated into HA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linguistic%20borrowing" title="linguistic borrowing">linguistic borrowing</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20theory" title=" optimality theory"> optimality theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadhrami%20Arabic" title=" Hadhrami Arabic"> Hadhrami Arabic</a>, <a href="https://publications.waset.org/abstracts/search?q=loanword" title=" loanword"> loanword</a>, <a href="https://publications.waset.org/abstracts/search?q=phonological%20processes" title=" phonological processes"> phonological processes</a> </p> <a href="https://publications.waset.org/abstracts/185465/optimality-theoretic-account-of-indian-loanwords-in-hadhrami-arabic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185465.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">44</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">607</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">606</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">605</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">488</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">604</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">603</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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">602</span> Proposal of Optimality Evaluation for Quantum Secure Communication Protocols by Taking the Average of the Main Protocol Parameters: Efficiency, Security and Practicality</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Georgi%20Bebrov">Georgi Bebrov</a>, <a href="https://publications.waset.org/abstracts/search?q=Rozalina%20Dimova"> Rozalina Dimova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the field of quantum secure communication, there is no evaluation that characterizes quantum secure communication (QSC) protocols in a complete, general manner. The current paper addresses the problem concerning the lack of such an evaluation for QSC protocols by introducing an optimality evaluation, which is expressed as the average over the three main parameters of QSC protocols: efficiency, security, and practicality. For the efficiency evaluation, the common expression of this parameter is used, which incorporates all the classical and quantum resources (bits and qubits) utilized for transferring a certain amount of information (bits) in a secure manner. By using criteria approach whether or not certain criteria are met, an expression for the practicality evaluation is presented, which accounts for the complexity of the QSC practical realization. Based on the error rates that the common quantum attacks (Measurement and resend, Intercept and resend, probe attack, and entanglement swapping attack) induce, the security evaluation for a QSC protocol is proposed as the minimum function taken over the error rates of the mentioned quantum attacks. For the sake of clarity, an example is presented in order to show how the optimality is calculated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20cryptography" title="quantum cryptography">quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20communcation" title=" quantum secure communcation"> quantum secure communcation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20direct%20communcation%20security" title=" quantum secure direct communcation security"> quantum secure direct communcation security</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20direct%20communcation%20efficiency" title=" quantum secure direct communcation efficiency"> quantum secure direct communcation efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20direct%20communcation%20practicality" title=" quantum secure direct communcation practicality"> quantum secure direct communcation practicality</a> </p> <a href="https://publications.waset.org/abstracts/104501/proposal-of-optimality-evaluation-for-quantum-secure-communication-protocols-by-taking-the-average-of-the-main-protocol-parameters-efficiency-security-and-practicality" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104501.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">184</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">601</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">120</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">600</span> On the Design of Robust Governors of Steam Power Systems Using Polynomial and State-Space Based H∞ Techniques: A Comparative Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rami%20A.%20Maher">Rami A. Maher</a>, <a href="https://publications.waset.org/abstracts/search?q=Ibraheem%20K.%20Ibraheem"> Ibraheem K. Ibraheem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work presents a comparison study between the state-space and polynomial methods for the design of the robust governor for load frequency control of steam turbine power systems. The robust governor is synthesized using the two approaches and the comparison is extended to include time and frequency domains performance, controller order, and uncertainty representation, weighting filters, optimality and sub-optimality. The obtained results are represented through tables and curves with reasons of similarities and dissimilarities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=robust%20control" title="robust control">robust control</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20frequency%20control" title=" load frequency control"> load frequency control</a>, <a href="https://publications.waset.org/abstracts/search?q=steam%20turbine" title=" steam turbine"> steam turbine</a>, <a href="https://publications.waset.org/abstracts/search?q=H%E2%88%9E-norm" title=" H∞-norm"> H∞-norm</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20uncertainty" title=" system uncertainty"> system uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20disturbance" title=" load disturbance"> load disturbance</a> </p> <a href="https://publications.waset.org/abstracts/14319/on-the-design-of-robust-governors-of-steam-power-systems-using-polynomial-and-state-space-based-h-techniques-a-comparative-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14319.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">407</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">599</span> Online Authenticity Verification of a Biometric Signature Using Dynamic Time Warping Method and Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ga%C5%82ka%20Aleksandra">Gałka Aleksandra</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeli%C5%84ska%20Justyna"> Jelińska Justyna</a>, <a href="https://publications.waset.org/abstracts/search?q=Masiak%20Albert"> Masiak Albert</a>, <a href="https://publications.waset.org/abstracts/search?q=Walentukiewicz%20Krzysztof"> Walentukiewicz Krzysztof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An offline signature is well-known however not the safest way to verify identity. Nowadays, to ensure proper authentication, i.e. in banking systems, multimodal verification is more widely used. In this paper the online signature analysis based on dynamic time warping (DTW) coupled with machine learning approaches has been presented. In our research signatures made with biometric pens were gathered. Signature features as well as their forgeries have been described. For verification of authenticity various methods were used including convolutional neural networks using DTW matrix and multilayer perceptron using sums of DTW matrix paths. System efficiency has been evaluated on signatures and signature forgeries collected on the same day. Results are presented and discussed in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20time%20warping" title="dynamic time warping">dynamic time warping</a>, <a href="https://publications.waset.org/abstracts/search?q=handwritten%20signature%20verification" title=" handwritten signature verification"> handwritten signature verification</a>, <a href="https://publications.waset.org/abstracts/search?q=feature-based%20recognition" title=" feature-based recognition"> feature-based recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20signature" title=" online signature"> online signature</a> </p> <a href="https://publications.waset.org/abstracts/153364/online-authenticity-verification-of-a-biometric-signature-using-dynamic-time-warping-method-and-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153364.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">175</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">598</span> Satellite Technology Usage for Greenhouse Gas Emissions Monitoring and Verification: Policy Considerations for an International System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Timiebi%20Aganaba-Jeanty">Timiebi Aganaba-Jeanty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Accurate and transparent monitoring, reporting and verification of Greenhouse Gas (GHG) emissions and removals is a requirement of the United Nations Framework Convention on Climate Change (UNFCCC). Several countries are obligated to prepare and submit an annual national greenhouse gas inventory covering anthropogenic emissions by sources and removals by sinks, subject to a review conducted by an international team of experts. However, the process is not without flaws. The self-reporting varies enormously in thoroughness, frequency and accuracy including inconsistency in the way such reporting occurs. The world’s space agencies are calling for a new generation of satellites that would be precise enough to map greenhouse gas emissions from individual nations. The plan is delicate politically because the global system could verify or cast doubt on emission reports from the member states of the UNFCCC. A level playing field is required and an idea that an international system should be perceived as an instrument to facilitate fairness and equality rather than to spy on or punish. This change of perspective is required to get buy in for an international verification system. The research proposes the viability of a satellite system that provides independent access to data regarding greenhouse gas emissions and the policy and governance implications of its potential use as a monitoring and verification system for the Paris Agreement. It assesses the foundations of the reporting monitoring and verification system as proposed in Paris and analyzes this in light of a proposed satellite system. The use of remote sensing technology has been debated for verification purposes and as evidence in courts but this is not without controversy. Lessons can be learned from its use in this context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=greenhouse%20gas%20emissions" title="greenhouse gas emissions">greenhouse gas emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=reporting" title=" reporting"> reporting</a>, <a href="https://publications.waset.org/abstracts/search?q=monitoring%20and%20verification" title=" monitoring and verification"> monitoring and verification</a>, <a href="https://publications.waset.org/abstracts/search?q=satellite" title=" satellite"> satellite</a>, <a href="https://publications.waset.org/abstracts/search?q=UNFCCC" title=" UNFCCC"> UNFCCC</a> </p> <a href="https://publications.waset.org/abstracts/57507/satellite-technology-usage-for-greenhouse-gas-emissions-monitoring-and-verification-policy-considerations-for-an-international-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57507.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">286</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">597</span> The Co-Simulation Interface SystemC/Matlab Applied in JPEG and SDR Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walid%20Hassairi">Walid Hassairi</a>, <a href="https://publications.waset.org/abstracts/search?q=Moncef%20Bousselmi"> Moncef Bousselmi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Abid"> Mohamed Abid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Functional verification is a major part of today’s system design task. Several approaches are available for verification on a high abstraction level, where designs are often modeled using MATLAB/Simulink. However, different approaches are a barrier to a unified verification flow. In this paper, we propose a co-simulation interface between SystemC and MATLAB and Simulink to enable functional verification of multi-abstraction levels designs. The resulting verification flow is tested on JPEG compression algorithm. The required synchronization of both simulation environments, as well as data type conversion is solved using the proposed co-simulation flow. We divided into two encoder jpeg parts. First implemented in SystemC which is the DCT is representing the HW part. Second, consisted of quantization and entropy encoding which is implemented in Matlab is the SW part. For communication and synchronization between these two parts we use S-Function and engine in Simulink matlab. With this research premise, this study introduces a new implementation of a Hardware SystemC of DCT. We compare the result of our simulation compared to SW / SW. We observe a reduction in simulation time you have 88.15% in JPEG and the design efficiency of the supply design is 90% in SDR. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hardware%2Fsoftware" title="hardware/software">hardware/software</a>, <a href="https://publications.waset.org/abstracts/search?q=co-design" title=" co-design"> co-design</a>, <a href="https://publications.waset.org/abstracts/search?q=co-simulation" title=" co-simulation"> co-simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=systemc" title=" systemc"> systemc</a>, <a href="https://publications.waset.org/abstracts/search?q=matlab" title=" matlab"> matlab</a>, <a href="https://publications.waset.org/abstracts/search?q=s-function" title=" s-function"> s-function</a>, <a href="https://publications.waset.org/abstracts/search?q=communication" title=" communication"> communication</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization" title=" synchronization"> synchronization</a> </p> <a href="https://publications.waset.org/abstracts/39414/the-co-simulation-interface-systemcmatlab-applied-in-jpeg-and-sdr-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39414.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">405</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">596</span> A Hybrid Tabu Search Algorithm for the Multi-Objective Job Shop Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a hybrid Tabu Search (TS) algorithm is suggested for the multi-objective job shop scheduling problems (MO-JSSPs). The algorithm integrates several shifting bottleneck based neighborhood structures with the Giffler & Thompson algorithm, which improve efficiency of the search. Diversification and intensification are provided with local and global left shift algorithms application and also new semi-active, active, and non-delay schedules creation. The suggested algorithm is tested in the MO-JSSPs benchmarks from the literature based on the Pareto optimality concept. Different performances criteria are used for the multi-objective algorithm evaluation. The proposed algorithm is able to find the Pareto solutions of the test problems in shorter time than other algorithm of the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title="tabu search">tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Pareto%20optimality" title=" Pareto optimality"> Pareto optimality</a> </p> <a href="https://publications.waset.org/abstracts/71920/a-hybrid-tabu-search-algorithm-for-the-multi-objective-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71920.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">443</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">595</span> Controlled Chemotherapy Strategy Applied to HIV Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shohel%20Ahmed">Shohel Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Md.%20Abdul%20Alim"> Md. Abdul Alim</a>, <a href="https://publications.waset.org/abstracts/search?q=Sumaiya%20Rahman"> Sumaiya Rahman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimal control can be helpful to test and compare different vaccination strategies of a certain disease. The mathematical model of HIV we consider here is a set of ordinary differential equations (ODEs) describing the interactions of CD4+T cells of the immune system with the human immunodeficiency virus (HIV). As an early treatment setting, we investigate an optimal chemotherapy strategy where control represents the percentage of effect the chemotherapy has on the system. The aim is to obtain a new optimal chemotherapeutic strategy where an isoperimetric constraint on the chemotherapy supply plays a crucial role. We outline the steps in formulating an optimal control problem, derive optimality conditions and demonstrate numerical results of an optimal control for the model. Numerical results illustrate how such a constraint alters the optimal vaccination schedule and its effect on cell-virus interactions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemotherapy%20of%20HIV" title="chemotherapy of HIV">chemotherapy of HIV</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control%20involving%20ODEs" title=" optimal control involving ODEs"> optimal control involving ODEs</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20conditions" title=" optimality conditions"> optimality conditions</a>, <a href="https://publications.waset.org/abstracts/search?q=Pontryagin%E2%80%99s%20maximum%20principle" title=" Pontryagin’s maximum principle"> Pontryagin’s maximum principle</a> </p> <a href="https://publications.waset.org/abstracts/65162/controlled-chemotherapy-strategy-applied-to-hiv-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65162.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">330</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">594</span> A Proposal for Systematic Mapping Study of Software Security Testing, Verification and Validation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adriano%20Bessa%20Albuquerque">Adriano Bessa Albuquerque</a>, <a href="https://publications.waset.org/abstracts/search?q=Francisco%20Jose%20Barreto%20Nunes"> Francisco Jose Barreto Nunes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software vulnerabilities are increasing and not only impact services and processes availability as well as information confidentiality, integrity and privacy, but also cause changes that interfere in the development process. Security test could be a solution to reduce vulnerabilities. However, the variety of test techniques with the lack of real case studies of applying tests focusing on software development life cycle compromise its effective use. This paper offers an overview of how a Systematic Mapping Study (MS) about security verification, validation and test (VVT) was performed, besides presenting general results about this study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=software%20test" title="software test">software test</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20security%20verification%20validation%20and%20test" title=" software security verification validation and test"> software security verification validation and test</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20test%20institutionalization" title=" security test institutionalization"> security test institutionalization</a>, <a href="https://publications.waset.org/abstracts/search?q=systematic%20mapping%20study" title=" systematic mapping study"> systematic mapping study</a> </p> <a href="https://publications.waset.org/abstracts/43751/a-proposal-for-systematic-mapping-study-of-software-security-testing-verification-and-validation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43751.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">409</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">593</span> Biometric Identification with Latitude and Longitude Fingerprint Verification for Attendance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Fezan%20Afzal">Muhammad Fezan Afzal</a>, <a href="https://publications.waset.org/abstracts/search?q=Imran%20Khan"> Imran Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Salma%20Imtiaz"> Salma Imtiaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The need for human verification and identification requires from centuries for authentication. Since it is being used in big institutes like financial, government and crime departments, a continued struggle is important to make this system more efficient to prevent security breaches. Therefore, multiple devices are used to authenticate the biometric for each individual. A large number of devices are required to cover a large number of users. As the number of devices increases, cost will automatically increase. Furthermore, it is time-consuming for biometrics due to the devices being insufficient and are not available at every door. In this paper, we propose the framework and algorithm where the mobile of each individual can also perform the biometric authentication of attendance and security. Every mobile has a biometric authentication system that is used in different mobile applications for security purposes. Therefore, each individual can use the biometric system mobile without moving from one place to another. Moreover, by using the biometrics mobile, the cost of biometric systems can be removed that are mostly deployed in different organizations for the attendance of students, employees and for other security purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fingerprint" title="fingerprint">fingerprint</a>, <a href="https://publications.waset.org/abstracts/search?q=fingerprint%20authentication" title=" fingerprint authentication"> fingerprint authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20verification" title=" mobile verification"> mobile verification</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20biometric%20verification" title=" mobile biometric verification"> mobile biometric verification</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20fingerprint%20sensor" title=" mobile fingerprint sensor"> mobile fingerprint sensor</a> </p> <a href="https://publications.waset.org/abstracts/171752/biometric-identification-with-latitude-and-longitude-fingerprint-verification-for-attendance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171752.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">69</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">592</span> On the Optimality of Blocked Main Effects Plans</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rita%20SahaRay">Rita SahaRay</a>, <a href="https://publications.waset.org/abstracts/search?q=Ganesh%20Dutta"> Ganesh Dutta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, experimental situations are considered where a main effects plan is to be used to study m two-level factors using n runs which are partitioned into b blocks, not necessarily of same size. Assuming the block sizes to be even for all blocks, for the case n &equiv; 2 (mod 4), optimal designs are obtained with respect to type 1 and type 2 optimality criteria in the class of designs providing estimation of all main effects orthogonal to the block effects. In practice, such orthogonal estimation of main effects is often a desirable condition. In the wider class of all available m two level even sized blocked main effects plans, where the factors do not occur at high and low levels equally often in each block, E-optimal designs are also characterized. Simple construction methods based on Hadamard matrices and Kronecker product for these optimal designs are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design%20matrix" title="design matrix">design matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadamard%20matrix" title=" Hadamard matrix"> Hadamard matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=Kronecker%20product" title=" Kronecker product"> Kronecker product</a>, <a href="https://publications.waset.org/abstracts/search?q=type%201%20criteria" title=" type 1 criteria"> type 1 criteria</a>, <a href="https://publications.waset.org/abstracts/search?q=type%202%20criteria" title=" type 2 criteria"> type 2 criteria</a> </p> <a href="https://publications.waset.org/abstracts/55584/on-the-optimality-of-blocked-main-effects-plans" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55584.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">366</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">591</span> Automation Test Method and HILS Environment Configuration for Hydrogen Storage System Management Unit Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaejeogn%20Kim">Jaejeogn Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeongmin%20Hong"> Jeongmin Hong</a>, <a href="https://publications.waset.org/abstracts/search?q=Jungin%20Lee"> Jungin Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Hydrogen Storage System Management Unit (HMU) is a controller that manages hydrogen charging and storage. It detects hydrogen leaks and tank pressure and temperature, calculates the charging concentration and remaining amount, and controls the opening and closing of the hydrogen tank valve. Since this role is an important part of the vehicle behavior and stability of Fuel Cell Electric Vehicles (FCEV), verifying the HMU controller is an essential part. To perform verification under various conditions, it is necessary to increase time efficiency based on an automated verification environment and increase the reliability of the controller by applying numerous test cases. To this end, we introduce the HMU controller automation verification method by applying the HILS environment and an automation test program with the ASAM XIL standard. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=HILS" title="HILS">HILS</a>, <a href="https://publications.waset.org/abstracts/search?q=ASAM" title=" ASAM"> ASAM</a>, <a href="https://publications.waset.org/abstracts/search?q=fuel%20cell%20electric%20vehicle" title=" fuel cell electric vehicle"> fuel cell electric vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=automation%20test" title=" automation test"> automation test</a>, <a href="https://publications.waset.org/abstracts/search?q=hydrogen%20storage%20system" title=" hydrogen storage system"> hydrogen storage system</a> </p> <a href="https://publications.waset.org/abstracts/184315/automation-test-method-and-hils-environment-configuration-for-hydrogen-storage-system-management-unit-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184315.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">70</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">590</span> Leveraging Hyperledger Iroha for the Issuance and Verification of Higher-Education Certificates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vasiliki%20Vlachou">Vasiliki Vlachou</a>, <a href="https://publications.waset.org/abstracts/search?q=Christos%20Kontzinos"> Christos Kontzinos</a>, <a href="https://publications.waset.org/abstracts/search?q=Ourania%20Markaki"> Ourania Markaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Panagiotis%20Kokkinakos"> Panagiotis Kokkinakos</a>, <a href="https://publications.waset.org/abstracts/search?q=Vagelis%20Karakolis"> Vagelis Karakolis</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Psarras"> John Psarras</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Higher Education is resisting the pull of technology, especially as this concerns the issuance and verification of degrees and certificates. It is widely known that education certificates are largely produced in paper form making them vulnerable to damage while holders of such certificates are dependent on the universities and other issuing organisations. QualiChain is an EU Horizon 2020 (H2020) research project aiming to transform and revolutionise the domain of public education and its ties with the job market by leveraging blockchain, analytics and decision support to develop a platform for the verification and sharing of education certificates. Blockchain plays an integral part in the QualiChain solution in providing a trustworthy environment to store, share and manage such accreditations. Under the context of this paper, three prominent blockchain platforms (Ethereum, Hyperledger Fabric, Hyperledger Iroha) were considered as a means of experimentation for creating a system with the basic functionalities that will be needed for trustworthy degree verification. The methodology and respective system developed and presented in this paper used Hyperledger Iroha and proved that this specific platform can be used to easily develop decentralize applications. Future papers will attempt to further experiment with other blockchain platforms and assess which has the best potential. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blockchain" title="blockchain">blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20verification" title=" degree verification"> degree verification</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education%20certificates" title=" higher education certificates"> higher education certificates</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyperledger%20Iroha" title=" Hyperledger Iroha"> Hyperledger Iroha</a> </p> <a href="https://publications.waset.org/abstracts/127503/leveraging-hyperledger-iroha-for-the-issuance-and-verification-of-higher-education-certificates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127503.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">141</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=optimality%20verification&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%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=optimality%20verification&page=20">20</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%20verification&page=21">21</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimality%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>