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>   <script> var _paq = window._paq = window._paq || []; /* tracker methods like "setCustomDimension" should be called before "trackPageView" */ _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u="//matomo.waset.org/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setSiteId', '2']); var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script>  <title>Search results for: sequential method</title> <meta name="description" content="Search results for: sequential method"> <meta name="keywords" content="sequential method"> <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="sequential method" 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 2025/2026/2027">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="sequential method"> <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> 19473</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: sequential method</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">19473</span> Quick Sequential Search Algorithm Used to Decode High-Frequency Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20M.%20Siddeq">Mohammed M. Siddeq</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20H.%20Rasheed"> Mohammed H. Rasheed</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20M.%20Salih"> Omar M. Salih</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcos%20A.%20Rodrigues"> Marcos A. Rodrigues</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research proposes a data encoding and decoding method based on the Matrix Minimization algorithm. This algorithm is applied to high-frequency coefficients for compression/encoding. The algorithm starts by converting every three coefficients to a single value; this is accomplished based on three different keys. The decoding/decompression uses a search method called QSS (Quick Sequential Search) Decoding Algorithm presented in this research based on the sequential search to recover the exact coefficients. In the next step, the decoded data are saved in an auxiliary array. The basic idea behind the auxiliary array is to save all possible decoded coefficients; this is because another algorithm, such as conventional sequential search, could retrieve encoded/compressed data independently from the proposed algorithm. The experimental results showed that our proposed decoding algorithm retrieves original data faster than conventional sequential search algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20minimization%20algorithm" title="matrix minimization algorithm">matrix minimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=decoding%20sequential%20search%20algorithm" title=" decoding sequential search algorithm"> decoding sequential search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title=" image compression"> image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=DWT" title=" DWT"> DWT</a> </p> <a href="https://publications.waset.org/abstracts/151394/quick-sequential-search-algorithm-used-to-decode-high-frequency-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151394.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">159</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">19472</span> Sequential Covering Algorithm for Nondifferentiable Global Optimization Problem and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Rahal">Mohamed Rahal</a>, <a href="https://publications.waset.org/abstracts/search?q=Djaouida%20Guetta"> Djaouida Guetta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the one-dimensional unconstrained global optimization problem of continuous functions satifying a Hölder condition is considered. We extend the algorithm of sequential covering SCA for Lipschitz functions to a large class of Hölder functions. The convergence of the method is studied and the algorithm can be applied to systems of nonlinear equations. Finally, some numerical examples are presented and illustrate the efficiency of the present approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title="global optimization">global optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%B6lder%20functions" title=" Hölder functions"> Hölder functions</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20covering%20method" title=" sequential covering method"> sequential covering method</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20of%20nonlinear%20equations" title=" systems of nonlinear equations"> systems of nonlinear equations</a> </p> <a href="https://publications.waset.org/abstracts/6507/sequential-covering-algorithm-for-nondifferentiable-global-optimization-problem-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6507.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">376</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">19471</span> An Analysis of Sequential Pattern Mining on Databases Using Approximate Sequential Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Suneetha">J. Suneetha</a>, <a href="https://publications.waset.org/abstracts/search?q=Vijayalaxmi"> Vijayalaxmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sequential Pattern Mining involves applying data mining methods to large data repositories to extract usage patterns. Sequential pattern mining methodologies used to analyze the data and identify patterns. The patterns have been used to implement efficient systems can recommend on previously observed patterns, in making predictions, improve usability of systems, detecting events, and in general help in making strategic product decisions. In this paper, identified performance of approximate sequential pattern mining defines as identifying patterns approximately shared with many sequences. Approximate sequential patterns can effectively summarize and represent the databases by identifying the underlying trends in the data. Conducting an extensive and systematic performance over synthetic and real data. The results demonstrate that ApproxMAP effective and scalable in mining large sequences databases with long patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20data" title="multiple data">multiple data</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20analysis" title=" performance analysis"> performance analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern" title=" sequential pattern"> sequential pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20database%20scalability" title=" sequence database scalability"> sequence database scalability</a> </p> <a href="https://publications.waset.org/abstracts/46782/an-analysis-of-sequential-pattern-mining-on-databases-using-approximate-sequential-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46782.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">19470</span> Conditions for Fault Recovery of Interconnected Asynchronous Sequential Machines with State Feedback</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jung%E2%80%93Min%20Yang">Jung–Min Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, fault recovery for parallel interconnected asynchronous sequential machines is studied. An adversarial input can infiltrate into one of two submachines comprising parallel composition of the considered asynchronous sequential machine, causing an unauthorized state transition. The control objective is to elucidate the condition for the existence of a corrective controller that makes the closed-loop system immune against any occurrence of adversarial inputs. In particular, an efficient existence condition is presented that does not need the complete modeling of the interconnected asynchronous sequential machine. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20sequential%20machines" title="asynchronous sequential machines">asynchronous sequential machines</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20composi-tion" title=" parallel composi-tion"> parallel composi-tion</a>, <a href="https://publications.waset.org/abstracts/search?q=corrective%20control" title=" corrective control"> corrective control</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a> </p> <a href="https://publications.waset.org/abstracts/81893/conditions-for-fault-recovery-of-interconnected-asynchronous-sequential-machines-with-state-feedback" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81893.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">237</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">19469</span> Sequential Pattern Mining from Data of Medical Record with Sequential Pattern Discovery Using Equivalent Classes (SPADE) Algorithm (A Case Study : Bolo Primary Health Care, Bima)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rezky%20Rifaini">Rezky Rifaini</a>, <a href="https://publications.waset.org/abstracts/search?q=Raden%20Bagus%20Fajriya%20Hakim"> Raden Bagus Fajriya Hakim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research was conducted at the Bolo primary health Care in Bima Regency. The purpose of the research is to find out the association pattern that is formed of medical record database from Bolo Primary health care’s patient. The data used is secondary data from medical records database PHC. Sequential pattern mining technique is the method that used to analysis. Transaction data generated from Patient_ID, Check_Date and diagnosis. Sequential Pattern Discovery Algorithms Using Equivalent Classes (SPADE) is one of the algorithm in sequential pattern mining, this algorithm find frequent sequences of data transaction, using vertical database and sequence join process. Results of the SPADE algorithm is frequent sequences that then used to form a rule. It technique is used to find the association pattern between items combination. Based on association rules sequential analysis with SPADE algorithm for minimum support 0,03 and minimum confidence 0,75 is gotten 3 association sequential pattern based on the sequence of patient_ID, check_Date and diagnosis data in the Bolo PHC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=diagnosis" title="diagnosis">diagnosis</a>, <a href="https://publications.waset.org/abstracts/search?q=primary%20health%20care" title=" primary health care"> primary health care</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20record" title=" medical record"> medical record</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=SPADE%20algorithm" title=" SPADE algorithm"> SPADE algorithm</a> </p> <a href="https://publications.waset.org/abstracts/46321/sequential-pattern-mining-from-data-of-medical-record-with-sequential-pattern-discovery-using-equivalent-classes-spade-algorithm-a-case-study-bolo-primary-health-care-bima" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46321.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">408</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">19468</span> Predicting Medical Check-Up Patient Re-Coming Using Sequential Pattern Mining and Association Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rizka%20Aisha%20Rahmi%20Hariadi">Rizka Aisha Rahmi Hariadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Chao%20Ou-Yang"> Chao Ou-Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Han-Cheng%20Wang"> Han-Cheng Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajesri%20Govindaraju"> Rajesri Govindaraju</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the increasing of medical check-up popularity, there are a huge number of medical check-up data stored in database and have not been useful. These data actually can be very useful for future strategic planning if we mine it correctly. In other side, a lot of patients come with unpredictable coming and also limited available facilities make medical check-up service offered by hospital not maximal. To solve that problem, this study used those medical check-up data to predict patient re-coming. Sequential pattern mining (SPM) and association rules method were chosen because these methods are suitable for predicting patient re-coming using sequential data. First, based on patient personal information the data was grouped into … groups then discriminant analysis was done to check significant of the grouping. Second, for each group some frequent patterns were generated using SPM method. Third, based on frequent patterns of each group, pairs of variable can be extracted using association rules to get general pattern of re-coming patient. Last, discussion and conclusion was done to give some implications of the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=patient%20re-coming" title="patient re-coming">patient re-coming</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20check-up" title=" medical check-up"> medical check-up</a>, <a href="https://publications.waset.org/abstracts/search?q=health%20examination" title=" health examination"> health examination</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=discriminant%20analysis" title=" discriminant analysis"> discriminant analysis</a> </p> <a href="https://publications.waset.org/abstracts/27462/predicting-medical-check-up-patient-re-coming-using-sequential-pattern-mining-and-association-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27462.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">646</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">19467</span> Tolerating Input Faults in Asynchronous Sequential Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jung-Min%20Yang">Jung-Min Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A method of tolerating input faults for input/state asynchronous sequential machines is proposed. A corrective controller is placed in front of the considered asynchronous machine to realize model matching with a reference model. The value of the external input transmitted to the closed-loop system may change by fault. We address the existence condition for the controller that can counteract adverse effects of any input fault while maintaining the objective of model matching. A design procedure for constructing the controller is outlined. The proposed reachability condition for the controller design is validated in an illustrative example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20sequential%20machines" title="asynchronous sequential machines">asynchronous sequential machines</a>, <a href="https://publications.waset.org/abstracts/search?q=corrective%20control" title=" corrective control"> corrective control</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20faults" title=" input faults"> input faults</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20matching" title=" model matching"> model matching</a> </p> <a href="https://publications.waset.org/abstracts/41919/tolerating-input-faults-in-asynchronous-sequential-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41919.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">430</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">19466</span> Design and Implementation of Testable Reversible Sequential Circuits Optimized Power</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Manikandan">B. Manikandan</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Vijayaprabhu"> A. Vijayaprabhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The conservative reversible gates are used to designed reversible sequential circuits. The sequential circuits are flip-flops and latches. The conservative logic gates are Feynman, Toffoli, and Fredkin. The design of two vectors testable sequential circuits based on conservative logic gates. All sequential circuit based on conservative logic gates can be tested for classical unidirectional stuck-at faults using only two test vectors. The two test vectors are all 1s, and all 0s. The designs of two vectors testable latches, master-slave flip-flops and double edge triggered (DET) flip-flops are presented. We also showed the application of the proposed approach toward 100% fault coverage for single missing/additional cell defect in the quantum- dot cellular automata (QCA) layout of the Fredkin gate. The conservative logic gates are in terms of complexity, speed, and area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DET" title="DET">DET</a>, <a href="https://publications.waset.org/abstracts/search?q=QCA" title=" QCA"> QCA</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20logic%20gates" title=" reversible logic gates"> reversible logic gates</a>, <a href="https://publications.waset.org/abstracts/search?q=POS" title=" POS"> POS</a>, <a href="https://publications.waset.org/abstracts/search?q=SOP" title=" SOP"> SOP</a>, <a href="https://publications.waset.org/abstracts/search?q=latches" title=" latches"> latches</a>, <a href="https://publications.waset.org/abstracts/search?q=flip%20flops" title=" flip flops"> flip flops</a> </p> <a href="https://publications.waset.org/abstracts/42418/design-and-implementation-of-testable-reversible-sequential-circuits-optimized-power" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42418.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">310</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">19465</span> The Parallelization of Algorithm Based on Partition Principle for Association Rules Discovery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khadidja%20Belbachir">Khadidja Belbachir</a>, <a href="https://publications.waset.org/abstracts/search?q=Hafida%20Belbachir"> Hafida Belbachir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> subsequently the expansion of the physical supports storage and the needs ceaseless to accumulate several data, the sequential algorithms of associations’ rules research proved to be ineffective. Thus the introduction of the new parallel versions is imperative. We propose in this paper, a parallel version of a sequential algorithm “Partition”. This last is fundamentally different from the other sequential algorithms, because it scans the data base only twice to generate the significant association rules. By consequence, the parallel approach does not require much communication between the sites. The proposed approach was implemented for an experimental study. The obtained results, shows a great reduction in execution time compared to the sequential version and Count Distributed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining" title=" distributed data mining"> distributed data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=partition" title=" partition"> partition</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20algorithms" title=" parallel algorithms"> parallel algorithms</a> </p> <a href="https://publications.waset.org/abstracts/34591/the-parallelization-of-algorithm-based-on-partition-principle-for-association-rules-discovery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34591.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">428</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">19464</span> Elucidation of the Sequential Transcriptional Activity in Escherichia coli Using Time-Series RNA-Seq Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pui%20Shan%20Wong">Pui Shan Wong</a>, <a href="https://publications.waset.org/abstracts/search?q=Kosuke%20Tashiro"> Kosuke Tashiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Satoru%20Kuhara"> Satoru Kuhara</a>, <a href="https://publications.waset.org/abstracts/search?q=Sachiyo%20Aburatani"> Sachiyo Aburatani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Functional genomics and gene regulation inference has readily expanded our knowledge and understanding of gene interactions with regards to expression regulation. With the advancement of transcriptome sequencing in time-series comes the ability to study the sequential changes of the transcriptome. This method presented here works to augment existing regulation networks accumulated in literature with transcriptome data gathered from time-series experiments to construct a sequential representation of transcription factor activity. This method is applied on a time-series RNA-Seq data set from Escherichia coli as it transitions from growth to stationary phase over five hours. Investigations are conducted on the various metabolic activities in gene regulation processes by taking advantage of the correlation between regulatory gene pairs to examine their activity on a dynamic network. Especially, the changes in metabolic activity during phase transition are analyzed with focus on the pagP gene as well as other associated transcription factors. The visualization of the sequential transcriptional activity is used to describe the change in metabolic pathway activity originating from the pagP transcription factor, phoP. The results show a shift from amino acid and nucleic acid metabolism, to energy metabolism during the transition to stationary phase in E. coli. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Escherichia%20coli" title="Escherichia coli">Escherichia coli</a>, <a href="https://publications.waset.org/abstracts/search?q=gene%20regulation" title=" gene regulation"> gene regulation</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a>, <a href="https://publications.waset.org/abstracts/search?q=time-series" title=" time-series"> time-series</a> </p> <a href="https://publications.waset.org/abstracts/65272/elucidation-of-the-sequential-transcriptional-activity-in-escherichia-coli-using-time-series-rna-seq-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65272.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">378</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">19463</span> Brainbow Image Segmentation Using Bayesian Sequential Partitioning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yayun%20Hsu">Yayun Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Henry%20Horng-Shing%20Lu"> Henry Horng-Shing Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a data-driven, biology-inspired neural segmentation method of 3D drosophila Brainbow images. We use Bayesian Sequential Partitioning algorithm for probabilistic modeling, which can be used to detect somas and to eliminate cross talk effects. This work attempts to develop an automatic methodology for neuron image segmentation, which nowadays still lacks a complete solution due to the complexity of the image. The proposed method does not need any predetermined, risk-prone thresholds since biological information is inherently included in the image processing procedure. Therefore, it is less sensitive to variations in neuron morphology; meanwhile, its flexibility would be beneficial for tracing the intertwining structure of neurons. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=brainbow" title="brainbow">brainbow</a>, <a href="https://publications.waset.org/abstracts/search?q=3D%20imaging" title=" 3D imaging"> 3D imaging</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20segmentation" title=" image segmentation"> image segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=neuron%20morphology" title=" neuron morphology"> neuron morphology</a>, <a href="https://publications.waset.org/abstracts/search?q=biological%20data%20mining" title=" biological data mining"> biological data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=non-parametric%20learning" title=" non-parametric learning"> non-parametric learning</a> </p> <a href="https://publications.waset.org/abstracts/2189/brainbow-image-segmentation-using-bayesian-sequential-partitioning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2189.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">492</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">19462</span> Method of Parameter Calibration for Error Term in Stochastic User Equilibrium Traffic Assignment Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xiang%20Zhang">Xiang Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Rey"> David Rey</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Travis%20Waller"> S. Travis Waller</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Stochastic User Equilibrium (SUE) model is a widely used traffic assignment model in transportation planning, which is regarded more advanced than Deterministic User Equilibrium (DUE) model. However, a problem exists that the performance of the SUE model depends on its error term parameter. The objective of this paper is to propose a systematic method of determining the appropriate error term parameter value for the SUE model. First, the significance of the parameter is explored through a numerical example. Second, the parameter calibration method is developed based on the Logit-based route choice model. The calibration process is realized through multiple nonlinear regression, using sequential quadratic programming combined with least square method. Finally, case analysis is conducted to demonstrate the application of the calibration process and validate the better performance of the SUE model calibrated by the proposed method compared to the SUE models under other parameter values and the DUE model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parameter%20calibration" title="parameter calibration">parameter calibration</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20quadratic%20programming" title=" sequential quadratic programming"> sequential quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20user%20equilibrium" title=" stochastic user equilibrium"> stochastic user equilibrium</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20assignment" title=" traffic assignment"> traffic assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20planning" title=" transportation planning"> transportation planning</a> </p> <a href="https://publications.waset.org/abstracts/17091/method-of-parameter-calibration-for-error-term-in-stochastic-user-equilibrium-traffic-assignment-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17091.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">308</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">19461</span> Development of an Automatic Sequential Extraction Device for Pu and Am Isotopes in Radioactive Waste Samples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Myung%20Ho%20Lee">Myung Ho Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Hee%20Seung%20Lim"> Hee Seung Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Young%20Jae%20Maeng"> Young Jae Maeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Hoon%20Lee"> Chang Hoon Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents an automatic sequential extraction device for Pu and Am isotopes in radioactive waste samples from the nuclear power plant with anion exchange resin and TRU resin. After radionuclides were leached from the radioactive waste samples with concentrated HCl and HNO₃, the sample was allowed to evaporate to dryness after filtering the leaching solution with 0.45 micron filter. The Pu isotopes were separated in HNO₃ medium with anion exchange resin. For leaching solution passed through the anion exchange column, the Am isotopes were sequentially separated with TRU resin. Automatic sequential extraction device built-in software information of separation for Pu and Am isotopes was developed. The purified Pu and Am isotopes were measured by alpha spectrometer, respectively, after the micro-precipitation of neodymium. The data of Pu and Am isotopes in radioactive waste with an automatic sequential extraction device developed in this study were validated with the ICP-MS system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automatic%20sequential%20extraction%20device" title="automatic sequential extraction device">automatic sequential extraction device</a>, <a href="https://publications.waset.org/abstracts/search?q=Pu%20isotopes" title=" Pu isotopes"> Pu isotopes</a>, <a href="https://publications.waset.org/abstracts/search?q=Am%20isotopes" title=" Am isotopes"> Am isotopes</a>, <a href="https://publications.waset.org/abstracts/search?q=alpha%20spectrometer" title=" alpha spectrometer"> alpha spectrometer</a>, <a href="https://publications.waset.org/abstracts/search?q=radioactive%20waste%20samples" title=" radioactive waste samples"> radioactive waste samples</a>, <a href="https://publications.waset.org/abstracts/search?q=ICP-MS%20system" title=" ICP-MS system"> ICP-MS system</a> </p> <a href="https://publications.waset.org/abstracts/180385/development-of-an-automatic-sequential-extraction-device-for-pu-and-am-isotopes-in-radioactive-waste-samples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/180385.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">83</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">19460</span> Conditions for Model Matching of Switched Asynchronous Sequential Machines with Output Feedback</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jung%E2%80%93Min%20Yang">Jung–Min Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solvability of the model matching problem for input/output switched asynchronous sequential machines is discussed in this paper. The control objective is to determine the existence condition and design algorithm for a corrective controller that can match the stable-state behavior of the closed-loop system to that of a reference model. Switching operations and correction procedures are incorporated using output feedback so that the controlled switched machine can show the desired input/output behavior. A matrix expression is presented to address reachability of switched asynchronous sequential machines with output equivalence with respect to a model. The presented reachability condition for the controller design is validated in a simple example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20sequential%20machines" title="asynchronous sequential machines">asynchronous sequential machines</a>, <a href="https://publications.waset.org/abstracts/search?q=corrective%20control" title=" corrective control"> corrective control</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20matching" title=" model matching"> model matching</a>, <a href="https://publications.waset.org/abstracts/search?q=input%2Foutput%20control" title=" input/output control"> input/output control</a> </p> <a href="https://publications.waset.org/abstracts/62600/conditions-for-model-matching-of-switched-asynchronous-sequential-machines-with-output-feedback" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62600.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">347</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">19459</span> The Generalized Pareto Distribution as a Model for Sequential Order Statistics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahdy%20%E2%80%8EEsmailian">Mahdy ‎Esmailian</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20%E2%80%8EDoostparast"> Mahdi ‎Doostparast</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20%E2%80%8EParsian"> Ahmad ‎Parsian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> ‎In this article‎, ‎sequential order statistics (SOS) censoring type II samples coming from the generalized Pareto distribution are considered‎. ‎Maximum likelihood (ML) estimators of the unknown parameters are derived on the basis of the available multiple SOS data‎. ‎Necessary conditions for existence and uniqueness of the derived ML estimates are given‎. Due to complexity in the proposed likelihood function‎, ‎a useful re-parametrization is suggested‎. ‎For illustrative purposes‎, ‎a Monte Carlo simulation study is conducted and an illustrative example is analysed‎. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bayesian%20estimation%E2%80%8E" title="bayesian estimation‎">bayesian estimation‎</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20pareto%20distribution%E2%80%8E" title=" generalized pareto distribution‎"> generalized pareto distribution‎</a>, <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8Emaximum%20likelihood%20%20estimation%E2%80%8E" title=" ‎maximum likelihood estimation‎"> ‎maximum likelihood estimation‎</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20order%20statistics" title=" sequential order statistics"> sequential order statistics</a> </p> <a href="https://publications.waset.org/abstracts/26988/the-generalized-pareto-distribution-as-a-model-for-sequential-order-statistics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26988.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">517</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">19458</span> Zonal and Sequential Extraction Design for Large Flat Space to Achieve Perpetual Tenability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mingjun%20Xu">Mingjun Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Man%20Pun%20Wan"> Man Pun Wan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study proposed an effective smoke control strategy for the large flat space with a low ceiling to achieve the requirement of perpetual tenability. For the large flat space with a low ceiling, the depth of the smoke reservoir is very shallow, and it is difficult to perpetually constrain the smoke within a limited space. A series of numerical tests were conducted to determine the smoke strategy. A zonal design i.e., the fire zone and two adjacent zones was proposed and validated to be effective in controlling smoke. Once a fire happens in a compartment space, the Engineered Smoke Control (ESC) system will be activated in three zones i.e., the fire zone, in which the fire happened, and two adjacent zones. The smoke can be perpetually constrained within the three smoke zones. To further improve the extraction efficiency, sequential activation of the ESC system within the 3 zones turned out to be more efficient than simultaneous activation. Additionally, the proposed zonal and sequential extraction design can reduce the mechanical extraction flow rate by up to 40.7 % as compared to the conventional method, which is much more economical than that of the conventional method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=performance-based%20design" title="performance-based design">performance-based design</a>, <a href="https://publications.waset.org/abstracts/search?q=perpetual%20tenability" title=" perpetual tenability"> perpetual tenability</a>, <a href="https://publications.waset.org/abstracts/search?q=smoke%20control" title=" smoke control"> smoke control</a>, <a href="https://publications.waset.org/abstracts/search?q=fire%20plume" title=" fire plume"> fire plume</a> </p> <a href="https://publications.waset.org/abstracts/172186/zonal-and-sequential-extraction-design-for-large-flat-space-to-achieve-perpetual-tenability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172186.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">78</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">19457</span> A Comparison of Sequential Quadratic Programming, Genetic Algorithm, Simulated Annealing, Particle Swarm Optimization for the Design and Optimization of a Beam Column</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nima%20Khosravi">Nima Khosravi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes an integrated optimization technique with concurrent use of sequential quadratic programming, genetic algorithm, and simulated annealing particle swarm optimization for the design and optimization of a beam column. In this research, the comparison between 4 different types of optimization methods. The comparison is done and it is found out that all the methods meet the required constraints and the lowest value of the objective function is achieved by SQP, which was also the fastest optimizer to produce the results. SQP is a gradient based optimizer hence its results are usually the same after every run. The only thing which affects the results is the initial conditions given. The initial conditions given in the various test run were very large as compared. Hence, the value converged at a different point. Rest of the methods is a heuristic method which provides different values for different runs even if every parameter is kept constant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=beam%20column" title="beam column">beam column</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20quadratic%20programming" title=" sequential quadratic programming"> sequential quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a> </p> <a href="https://publications.waset.org/abstracts/58973/a-comparison-of-sequential-quadratic-programming-genetic-algorithm-simulated-annealing-particle-swarm-optimization-for-the-design-and-optimization-of-a-beam-column" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58973.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">390</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">19456</span> Contrastive Learning for Unsupervised Object Segmentation in Sequential Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tian%20Zhang">Tian Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Unsupervised object segmentation aims at segmenting objects in sequential images and obtaining the mask of each object without any manual intervention. Unsupervised segmentation remains a challenging task due to the lack of prior knowledge about these objects. Previous methods often require manually specifying the action of each object, which is often difficult to obtain. Instead, this paper does not need action information of objects and automatically learns the actions and relations among objects from the structured environment. To obtain the object segmentation of sequential images, the relationships between objects and images are extracted to infer the action and interaction of objects based on the multi-head attention mechanism. Three types of objects’ relationships in the object segmentation task are proposed: the relationship between objects in the same frame, the relationship between objects in two frames, and the relationship between objects and historical information. Based on these relationships, the proposed model (1) is effective in multiple objects segmentation tasks, (2) just needs images as input, and (3) produces better segmentation results as more relationships are considered. The experimental results on multiple datasets show that this paper’s method achieves state-of-art performance. The quantitative and qualitative analyses of the result are conducted. The proposed method could be easily extended to other similar applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unsupervised%20object%20segmentation" title="unsupervised object segmentation">unsupervised object segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=attention%20mechanism" title=" attention mechanism"> attention mechanism</a>, <a href="https://publications.waset.org/abstracts/search?q=contrastive%20learning" title=" contrastive learning"> contrastive learning</a>, <a href="https://publications.waset.org/abstracts/search?q=structured%20environment" title=" structured environment"> structured environment</a> </p> <a href="https://publications.waset.org/abstracts/148401/contrastive-learning-for-unsupervised-object-segmentation-in-sequential-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148401.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">114</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">19455</span> A Comparative Study of GTC and PSP Algorithms for Mining Sequential Patterns Embedded in Database with Time Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safa%20Adi">Safa Adi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper will consider the problem of sequential mining patterns embedded in a database by handling the time constraints as defined in the GSP algorithm (level wise algorithms). We will compare two previous approaches GTC and PSP, that resumes the general principles of GSP. Furthermore this paper will discuss PG-hybrid algorithm, that using PSP and GTC. The results show that PSP and GTC are more efficient than GSP. On the other hand, the GTC algorithm performs better than PSP. The PG-hybrid algorithm use PSP algorithm for the two first passes on the database, and GTC approach for the following scans. Experiments show that the hybrid approach is very efficient for short, frequent sequences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=database" title="database">database</a>, <a href="https://publications.waset.org/abstracts/search?q=GTC%20algorithm" title=" GTC algorithm"> GTC algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=PSP%20algorithm" title=" PSP algorithm"> PSP algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20patterns" title=" sequential patterns"> sequential patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20constraints" title=" time constraints"> time constraints</a> </p> <a href="https://publications.waset.org/abstracts/97812/a-comparative-study-of-gtc-and-psp-algorithms-for-mining-sequential-patterns-embedded-in-database-with-time-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97812.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">395</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">19454</span> Asynchronous Sequential Machines with Fault Detectors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seong%20Woo%20Kwak">Seong Woo Kwak</a>, <a href="https://publications.waset.org/abstracts/search?q=Jung-Min%20Yang"> Jung-Min Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A strategy of fault diagnosis and tolerance for asynchronous sequential machines is discussed in this paper. With no synchronizing clock, it is difficult to diagnose an occurrence of permanent or stuck-in faults in the operation of asynchronous machines. In this paper, we present a fault detector comprised of a timer and a set of static functions to determine the occurrence of faults. In order to realize immediate fault tolerance, corrective control theory is applied to designing a dynamic feedback controller. Existence conditions for an appropriate controller and its construction algorithm are presented in terms of reachability of the machine and the feature of fault occurrences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20sequential%20machines" title="asynchronous sequential machines">asynchronous sequential machines</a>, <a href="https://publications.waset.org/abstracts/search?q=corrective%20control" title=" corrective control"> corrective control</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20diagnosis%20and%20tolerance" title=" fault diagnosis and tolerance"> fault diagnosis and tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detector" title=" fault detector"> fault detector</a> </p> <a href="https://publications.waset.org/abstracts/53634/asynchronous-sequential-machines-with-fault-detectors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53634.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">357</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">19453</span> Group Sequential Covariate-Adjusted Response Adaptive Designs for Survival Outcomes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yaxian%20Chen">Yaxian Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yeonhee%20Park"> Yeonhee Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Driven by evolving FDA recommendations, modern clinical trials demand innovative designs that strike a balance between statistical rigor and ethical considerations. Covariate-adjusted response-adaptive (CARA) designs bridge this gap by utilizing patient attributes and responses to skew treatment allocation in favor of the treatment that is best for an individual patient’s profile. However, existing CARA designs for survival outcomes often hinge on specific parametric models, constraining their applicability in clinical practice. In this article, we address this limitation by introducing a CARA design for survival outcomes (CARAS) based on the Cox model and a variance estimator. This method addresses issues of model misspecification and enhances the flexibility of the design. We also propose a group sequential overlapweighted log-rank test to preserve type I error rate in the context of group sequential trials using extensive simulation studies to demonstrate the clinical benefit, statistical efficiency, and robustness to model misspecification of the proposed method compared to traditional randomized controlled trial designs and response-adaptive randomization designs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cox%20model" title="cox model">cox model</a>, <a href="https://publications.waset.org/abstracts/search?q=log-rank%20test" title=" log-rank test"> log-rank test</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20allocation%20ratio" title=" optimal allocation ratio"> optimal allocation ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=overlap%20weight" title=" overlap weight"> overlap weight</a>, <a href="https://publications.waset.org/abstracts/search?q=survival%20outcome" title=" survival outcome"> survival outcome</a> </p> <a href="https://publications.waset.org/abstracts/183302/group-sequential-covariate-adjusted-response-adaptive-designs-for-survival-outcomes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183302.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">71</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">19452</span> The Sequential Estimation of the Seismoacoustic Source Energy in C-OTDR Monitoring Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrey%20V.%20Timofeev">Andrey V. Timofeev</a>, <a href="https://publications.waset.org/abstracts/search?q=Dmitry%20V.%20Egorov"> Dmitry V. Egorov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The practical efficient approach is suggested for estimation of the seismoacoustic sources energy in C-OTDR monitoring systems. This approach represents the sequential plan for confidence estimation both the seismoacoustic sources energy, as well the absorption coefficient of the soil. The sequential plan delivers the non-asymptotic guaranteed accuracy of obtained estimates in the form of non-asymptotic confidence regions with prescribed sizes. These confidence regions are valid for a finite sample size when the distributions of the observations are unknown. Thus, suggested estimates are non-asymptotic and nonparametric, and also these estimates guarantee the prescribed estimation accuracy in the form of the prior prescribed size of confidence regions, and prescribed confidence coefficient value. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonparametric%20estimation" title="nonparametric estimation">nonparametric estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20confidence%20estimation" title=" sequential confidence estimation"> sequential confidence estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=multichannel%20monitoring%20systems" title=" multichannel monitoring systems"> multichannel monitoring systems</a>, <a href="https://publications.waset.org/abstracts/search?q=C-OTDR-system" title=" C-OTDR-system"> C-OTDR-system</a>, <a href="https://publications.waset.org/abstracts/search?q=non-lineary%20regression" title=" non-lineary regression"> non-lineary regression</a> </p> <a href="https://publications.waset.org/abstracts/35690/the-sequential-estimation-of-the-seismoacoustic-source-energy-in-c-otdr-monitoring-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35690.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">19451</span> Single and Sequential Extraction for Potassium Fractionation and Nano-Clay Flocculation Structure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chakkrit%20Poonpakdee">Chakkrit Poonpakdee</a>, <a href="https://publications.waset.org/abstracts/search?q=Jing-Hua%20Tzen"> Jing-Hua Tzen</a>, <a href="https://publications.waset.org/abstracts/search?q=Ya-Zhen%20Huang"> Ya-Zhen Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yao-Tung%20Lin"> Yao-Tung Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Potassium (K) is a known macro nutrient and essential element for plant growth. Single leaching and modified sequential extraction schemes have been developed to estimate the relative phase associations of soil samples. The sequential extraction process is a step in analyzing the partitioning of metals affected by environmental conditions, but it is not a tool for estimation of K bioavailability. While, traditional single leaching method has been used to classify K speciation for a long time, it depend on its availability to the plants and use for potash fertilizer recommendation rate. Clay mineral in soil is a factor for controlling soil fertility. The change of the micro-structure of clay minerals during various environment (i.e. swelling or shrinking) is characterized using Transmission X-Ray Microscopy (TXM). The objective of this study are to 1) compare the distribution of K speciation between single leaching and sequential extraction process 2) determined clay particle flocculation structure before/after suspension with K+ using TXM. Four tropical soil samples: farming without K fertilizer (10 years), long term applied K fertilizer (10 years; 168-240 kg K2O ha-1 year-1), red soil (450-500 kg K2O ha-1 year-1) and forest soil were selected. The results showed that the amount of K speciation by single leaching method were high in mineral K, HNO3 K, Non-exchangeable K, NH4OAc K, exchangeable K and water soluble K respectively. Sequential extraction process indicated that most K speciations in soil were associated with residual, organic matter, Fe or Mn oxide and exchangeable fractions and K associate fraction with carbonate was not detected in tropical soil samples. In farming long term applied K fertilizer and red soil were higher exchangeable K than farming long term without K fertilizer and forest soil. The results indicated that one way to increase the available K (water soluble K and exchangeable K) should apply K fertilizer and organic fertilizer for providing available K. The two-dimension of TXM image of clay particles suspension with K+ shows that the aggregation structure of clay mineral closed-void cellular networks. The porous cellular structure of soil aggregates in 1 M KCl solution had large and very larger empty voids than in 0.025 M KCl and deionized water respectively. TXM nanotomography is a new technique can be useful in the field as a tool for better understanding of clay mineral micro-structure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=potassium" title="potassium">potassium</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20extraction%20process" title=" sequential extraction process"> sequential extraction process</a>, <a href="https://publications.waset.org/abstracts/search?q=clay%20mineral" title=" clay mineral"> clay mineral</a>, <a href="https://publications.waset.org/abstracts/search?q=TXM" title=" TXM"> TXM</a> </p> <a href="https://publications.waset.org/abstracts/43853/single-and-sequential-extraction-for-potassium-fractionation-and-nano-clay-flocculation-structure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43853.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">293</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">19450</span> Propane Dehydrogenation with Better Stability by a Modified Pt-Based Catalyst</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Napat%20Hataivichian">Napat Hataivichian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The effect of transition metal doping on Pt/Al2O3 catalyst used in propane dehydrogenation reaction at 500˚C was studied. The preparation methods investigated were sequential impregnation (Pt followed by the 2nd metal or the 2nd metal followed by Pt) and co-impregnation. The metal contents of these catalysts were fixed as the weight ratio of Pt per the 2nd metal of around 0.075. These catalysts were characterized by N2-physisorption, TPR, CO-chemisorption and NH3-TPD. It was found that the impregnated 2nd metal had an effect upon reducibility of Pt due to its interaction with transition metal-containing structure. This was in agreement with the CO-chemisorption result that the presence of Pt metal, which is a result from Pt species reduction, was decreased. The total acidity of bimetallic catalysts is decreased but the strong acidity is slightly increased. It was found that the stability of bimetallic catalysts prepared by co-impregnation and sequential impregnation where the 2nd metal was impregnated before Pt were better than that of monometallic catalyst (undoped Pt one) due to the forming of Pt sites located on the transition metal-oxide modified surface. Among all preparation methods, the sequential impregnation method- having Pt impregnated before the 2nd metal gave the worst stability because this catalyst lacked the modified Pt sites and some fraction of Pt sites was covered by the 2nd metal. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alumina" title="alumina">alumina</a>, <a href="https://publications.waset.org/abstracts/search?q=dehydrogenation" title=" dehydrogenation"> dehydrogenation</a>, <a href="https://publications.waset.org/abstracts/search?q=platinum" title=" platinum"> platinum</a>, <a href="https://publications.waset.org/abstracts/search?q=transition%20metal" title=" transition metal"> transition metal</a> </p> <a href="https://publications.waset.org/abstracts/25499/propane-dehydrogenation-with-better-stability-by-a-modified-pt-based-catalyst" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25499.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">319</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">19449</span> Globally Convergent Sequential Linear Programming for Multi-Material Topology Optimization Using Ordered Solid Isotropic Material with Penalization Interpolation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Darwin%20Castillo%20Huaman%C3%AD">Darwin Castillo Huamaní</a>, <a href="https://publications.waset.org/abstracts/search?q=Francisco%20A.%20M.%20Gomes"> Francisco A. M. Gomes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of the multi-material topology optimization (MTO) is to obtain the optimal topology of structures composed by many materials, according to a given set of constraints and cost criteria. In this work, we seek the optimal distribution of materials in a domain, such that the flexibility of the structure is minimized, under certain boundary conditions and the intervention of external forces. In the case we have only one material, each point of the discretized domain is represented by two values from a function, where the value of the function is 1 if the element belongs to the structure or 0 if the element is empty. A common way to avoid the high computational cost of solving integer variable optimization problems is to adopt the Solid Isotropic Material with Penalization (SIMP) method. This method relies on the continuous interpolation function, power function, where the base variable represents a pseudo density at each point of domain. For proper exponent values, the SIMP method reduces intermediate densities, since values other than 0 or 1 usually does not have a physical meaning for the problem. Several extension of the SIMP method were proposed for the multi-material case. The one that we explore here is the ordered SIMP method, that has the advantage of not being based on the addition of variables to represent material selection, so the computational cost is independent of the number of materials considered. Although the number of variables is not increased by this algorithm, the optimization subproblems that are generated at each iteration cannot be solved by methods that rely on second derivatives, due to the cost of calculating the second derivatives. To overcome this, we apply a globally convergent version of the sequential linear programming method, which solves a linear approximation sequence of optimization problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=globally%20convergence" title="globally convergence">globally convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-material%20design%20ordered%20simp" title=" multi-material design ordered simp"> multi-material design ordered simp</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20linear%20programming" title=" sequential linear programming"> sequential linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=topology%20optimization" title=" topology optimization"> topology optimization</a> </p> <a href="https://publications.waset.org/abstracts/67066/globally-convergent-sequential-linear-programming-for-multi-material-topology-optimization-using-ordered-solid-isotropic-material-with-penalization-interpolation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67066.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">320</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">19448</span> Sequential Padding: A Method to Improve the Impact Resistance in Body Armor Materials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ankita%20Srivastava">Ankita Srivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=Bhupendra%20S.%20Butola"> Bhupendra S. Butola</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhijit%20Majumdar"> Abhijit Majumdar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Application of shear thickening fluid (STF) has been proved to increase the impact resistance performance of the textile structures to further use it as a body armor material. In the present research, STF was applied on Kevlar woven fabric to make the structure lightweight and flexible while improving its impact resistance performance. It was observed that getting a fair amount of add-on of STF on Kevlar fabric is difficult as Kevlar fabric comes with a pre-coating of PTFE which hinders its absorbency. Hence, a method termed as sequential padding is developed in the present study to improve the add-on of STF on Kevlar fabric. Contrary to the conventional process, where Kevlar fabric is treated with STF once using any one pressure, in sequential padding method, the Kevlar fabrics were treated twice in a sequential manner using combination of two pressures together in a sample. 200 GSM Kevlar fabrics were used in the present study. STF was prepared by adding PEG with 70% (w/w) nano-silica concentration. Ethanol was added with the STF at a fixed ratio to reduce viscosity. A high-speed homogenizer was used to make the dispersion. Total nine STF treated Kevlar fabric samples were prepared by using varying combinations and sequences of three levels of padding pressure {0.5, 1.0 and 2.0 bar). The fabrics were dried at 80°C for 40 minutes in a hot air oven to evaporate ethanol. Untreated and STF treated fabrics were tested for add-on%. Impact resistance performance of samples was also tested on dynamic impact tester at a fixed velocity of 6 m/s. Further, to observe the impact resistance performance in actual condition, low velocity ballistic test with 165 m/s velocity was also performed to confirm the results of impact resistance test. It was observed that both add-on% and impact energy absorption of Kevlar fabrics increases significantly with sequential padding process as compared to untreated as well as single stage padding process. It was also determined that impact energy absorption is significantly better in STF treated Kevlar fabrics when 1st padding pressure is higher, and 2nd padding pressure is lower. It is also observed that impact energy absorption of sequentially padded Kevlar fabric shows almost 125% increase in ballistic impact energy absorption (40.62 J) as compared to untreated fabric (18.07 J).The results are owing to the fact that the treatment of fabrics at high pressure during the first padding is responsible for uniform distribution of STF within the fabric structures. While padding with second lower pressure ensures the high add-on of STF for over-all improvement in the impact resistance performance of the fabric. Therefore, it is concluded that sequential padding process may help to improve the impact performance of body armor materials based on STF treated Kevlar fabrics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=body%20armor" title="body armor">body armor</a>, <a href="https://publications.waset.org/abstracts/search?q=impact%20resistance" title=" impact resistance"> impact resistance</a>, <a href="https://publications.waset.org/abstracts/search?q=Kevlar" title=" Kevlar"> Kevlar</a>, <a href="https://publications.waset.org/abstracts/search?q=shear%20thickening%20fluid" title=" shear thickening fluid"> shear thickening fluid</a> </p> <a href="https://publications.waset.org/abstracts/92928/sequential-padding-a-method-to-improve-the-impact-resistance-in-body-armor-materials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92928.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">246</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">19447</span> On Fault Diagnosis of Asynchronous Sequential Machines with Parallel Composition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jung-Min%20Yang">Jung-Min Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fault diagnosis of composite asynchronous sequential machines with parallel composition is addressed in this paper. An adversarial input can infiltrate one of two submachines comprising the composite asynchronous machine, causing an unauthorized state transition. The objective is to characterize the condition under which the controller can diagnose any fault occurrence. Two control configurations, state feedback and output feedback, are considered in this paper. In the case of output feedback, the exact estimation of the state is impossible since the current state is inaccessible and the output feedback is given as the form of burst. A simple example is provided to demonstrate the proposed methodology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20sequential%20machines" title="asynchronous sequential machines">asynchronous sequential machines</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20composition" title=" parallel composition"> parallel composition</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20diagnosis" title=" fault diagnosis"> fault diagnosis</a>, <a href="https://publications.waset.org/abstracts/search?q=corrective%20control" title=" corrective control"> corrective control</a> </p> <a href="https://publications.waset.org/abstracts/76606/on-fault-diagnosis-of-asynchronous-sequential-machines-with-parallel-composition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76606.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">301</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">19446</span> Book Recommendation Using Query Expansion and Information Retrieval Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ritesh%20Kumar">Ritesh Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajendra%20Pamula"> Rajendra Pamula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present our contribution for book recommendation. In our experiment, we combine the results of Sequential Dependence Model (SDM) and exploitation of book information such as reviews, tags and ratings. This social information is assigned by users. For this, we used CLEF-2016 Social Book Search Track Suggestion task. Finally, our proposed method extensively evaluated on CLEF -2015 Social Book Search datasets, and has better performance (nDCG@10) compared to other state-of-the-art systems. Recently we got the good performance in CLEF-2016. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sequential%20dependence%20model" title="sequential dependence model">sequential dependence model</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20information" title=" social information"> social information</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20book%20search" title=" social book search"> social book search</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20expansion" title=" query expansion"> query expansion</a> </p> <a href="https://publications.waset.org/abstracts/68130/book-recommendation-using-query-expansion-and-information-retrieval-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68130.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">293</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">19445</span> Applying Sequential Pattern Mining to Generate Block for Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meng-Hui%20Chen">Meng-Hui Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen-Yu%20Kao"> Chen-Yu Kao</a>, <a href="https://publications.waset.org/abstracts/search?q=Chia-Yu%20Hsu"> Chia-Yu Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Pei-Chann%20Chang"> Pei-Chann Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main idea in this paper is using sequential pattern mining to find the information which is helpful for finding high performance solutions. By combining this information, it is defined as blocks. Using the blocks to generate artificial chromosomes (ACs) could improve the structure of solutions. Estimation of Distribution Algorithms (EDAs) is adapted to solve the combinatorial problems. Nevertheless many of these approaches are advantageous for this application, but only some of them are used to enhance the efficiency of application. Generating ACs uses patterns and EDAs could increase the diversity. According to the experimental result, the algorithm which we proposed has a better performance to solve the permutation flow-shop problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20problems" title="combinatorial problems">combinatorial problems</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=estimationof%20distribution%20algorithms" title=" estimationof distribution algorithms"> estimationof distribution algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20chromosomes" title=" artificial chromosomes"> artificial chromosomes</a> </p> <a href="https://publications.waset.org/abstracts/10391/applying-sequential-pattern-mining-to-generate-block-for-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10391.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">619</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">19444</span> A Sequential Approach for Random-Effects Meta-Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samson%20Henry%20Dogo">Samson Henry Dogo</a>, <a href="https://publications.waset.org/abstracts/search?q=Allan%20Clark"> Allan Clark</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20Kulinskaya"> Elena Kulinskaya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective in meta-analysis is to combine results from several independent studies in order to create generalization and provide evidence based for decision making. But recent studies show that the magnitude of effect size estimates reported in many areas of research finding changed with year publication and this can impair the results and conclusions of meta-analysis. A number of sequential methods have been proposed for monitoring the effect size estimates in meta-analysis. However they are based on statistical theory applicable to fixed effect model (FEM). For random-effects model (REM), the analysis incorporates the heterogeneity variance, tau-squared and its estimation create complications. In this paper proposed the use of Gombay and Serbian (2005) truncated CUSUM-type test with asymptotically valid critical values for sequential monitoring of REM. Simulation results show that the test does not control the Type I error well, and is not recommended. Further work required to derive an appropriate test in this important area of application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=meta-analysis" title="meta-analysis">meta-analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=random-effects%20model" title=" random-effects model"> random-effects model</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20test" title=" sequential test"> sequential test</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20changes%20in%20effect%20sizes" title=" temporal changes in effect sizes"> temporal changes in effect sizes</a> </p> <a href="https://publications.waset.org/abstracts/20044/a-sequential-approach-for-random-effects-meta-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20044.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">472</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=sequential%20method&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&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=sequential%20method&page=649">649</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&page=650">650</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=sequential%20method&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">© 2025 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>