CINXE.COM

Search results for: stochastic arithmetic

<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: stochastic arithmetic</title> <meta name="description" content="Search results for: stochastic arithmetic"> <meta name="keywords" content="stochastic arithmetic"> <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="stochastic arithmetic" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/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="stochastic arithmetic"> <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> 375</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: stochastic arithmetic</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">375</span> Stepsize Control of the Finite Difference Method for Solving Ordinary Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Davod%20Khojasteh%20Salkuyeh">Davod Khojasteh Salkuyeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An important task in solving second order linear ordinary differential equations by the finite difference is to choose a suitable stepsize h. In this paper, by using the stochastic arithmetic, the CESTAC method and the CADNA library we present a procedure to estimate the optimal stepsize hopt, the stepsize which minimizes the global error consisting of truncation and round-off error.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ordinary%20differential%20equations" title="Ordinary differential equations">Ordinary differential equations</a>, <a href="https://publications.waset.org/search?q=optimal%20stepsize" title=" optimal stepsize"> optimal stepsize</a>, <a href="https://publications.waset.org/search?q=error" title=" error"> error</a>, <a href="https://publications.waset.org/search?q=stochastic%20arithmetic" title=" stochastic arithmetic"> stochastic arithmetic</a>, <a href="https://publications.waset.org/search?q=CESTAC" title=" CESTAC"> CESTAC</a>, <a href="https://publications.waset.org/search?q=CADNA." title=" CADNA."> CADNA.</a> </p> <a href="https://publications.waset.org/11434/stepsize-control-of-the-finite-difference-method-for-solving-ordinary-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11434/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11434/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11434/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11434/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11434/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11434/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11434/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11434/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11434/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11434/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11434.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">1363</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">374</span> Two Different Computing Methods of the Smith Arithmetic Determinant</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xing-Jian%20Li">Xing-Jian Li</a>, <a href="https://publications.waset.org/search?q=Shen%20Qu"> Shen Qu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Smith arithmetic determinant is investigated in this paper. By using two different methods, we derive the explicit formula for the Smith arithmetic determinant.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Elementary%20row%20transformation" title="Elementary row transformation">Elementary row transformation</a>, <a href="https://publications.waset.org/search?q=Euler%20function" title=" Euler function"> Euler function</a>, <a href="https://publications.waset.org/search?q=Matrix%20decomposition" title=" Matrix decomposition"> Matrix decomposition</a>, <a href="https://publications.waset.org/search?q=Smith%20arithmetic%20determinant." title=" Smith arithmetic determinant."> Smith arithmetic determinant.</a> </p> <a href="https://publications.waset.org/9996770/two-different-computing-methods-of-the-smith-arithmetic-determinant" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9996770/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9996770/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9996770/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9996770/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9996770/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9996770/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9996770/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9996770/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9996770/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9996770/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9996770.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">2638</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">373</span> A Processor with Dynamically Reconfigurable Circuit for Floating-Point Arithmetic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yukinari%20Minagi">Yukinari Minagi </a>, <a href="https://publications.waset.org/search?q=Akinori%20Kanasugi"> Akinori Kanasugi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes about dynamic reconfiguration to miniaturize arithmetic circuits in general-purpose processor. Dynamic reconfiguration is a technique to realize required functions by changing hardware construction during operation. The proposed arithmetic circuit performs floating-point arithmetic which is frequently used in science and technology. The data format is floating-point based on IEEE754. The proposed circuit is designed using VHDL, and verified the correct operation by simulations and experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=dynamic%20reconfiguration" title="dynamic reconfiguration">dynamic reconfiguration</a>, <a href="https://publications.waset.org/search?q=floating-point%20arithmetic" title=" floating-point arithmetic"> floating-point arithmetic</a>, <a href="https://publications.waset.org/search?q=double%20precision" title="double precision">double precision</a>, <a href="https://publications.waset.org/search?q=FPGA" title=" FPGA"> FPGA</a> </p> <a href="https://publications.waset.org/13110/a-processor-with-dynamically-reconfigurable-circuit-for-floating-point-arithmetic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13110/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13110/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13110/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13110/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13110/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13110/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13110/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13110/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13110/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13110/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13110.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">1517</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">372</span> On Some Properties of Interval Matrices </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Ganesan">K. Ganesan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> By using a new set of arithmetic operations on interval numbers, we discuss some arithmetic properties of interval matrices which intern helps us to compute the powers of interval matrices and to solve the system of interval linear equations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Interval%20arithmetic" title="Interval arithmetic">Interval arithmetic</a>, <a href="https://publications.waset.org/search?q=Interval%20matrix" title=" Interval matrix"> Interval matrix</a>, <a href="https://publications.waset.org/search?q=linear%20equations." title=" linear equations."> linear equations.</a> </p> <a href="https://publications.waset.org/8101/on-some-properties-of-interval-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8101/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8101/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8101/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8101/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8101/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8101/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8101/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8101/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8101/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8101/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8101.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">2055</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">371</span> A Dynamically Reconfigurable Arithmetic Circuit for Complex Number and Double Precision Number</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Haruo%20Shimada">Haruo Shimada</a>, <a href="https://publications.waset.org/search?q=Akinori%20Kanasugi"> Akinori Kanasugi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an architecture of dynamically reconfigurable arithmetic circuit. Dynamic reconfiguration is a technique to realize required functions by changing hardware construction during operations. The proposed circuit is based on a complex number multiply-accumulation circuit which is used frequently in the field of digital signal processing. In addition, the proposed circuit performs real number double precision arithmetic operations. The data formats are single and double precision floating point number based on IEEE754. The proposed circuit is designed using VHDL, and verified the correct operation by simulations and experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=arithmetic%20circuit" title="arithmetic circuit">arithmetic circuit</a>, <a href="https://publications.waset.org/search?q=complex%20number" title=" complex number"> complex number</a>, <a href="https://publications.waset.org/search?q=double%20precision" title=" double precision"> double precision</a>, <a href="https://publications.waset.org/search?q=dynamic%20reconfiguration" title="dynamic reconfiguration">dynamic reconfiguration</a> </p> <a href="https://publications.waset.org/8858/a-dynamically-reconfigurable-arithmetic-circuit-for-complex-number-and-double-precision-number" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8858/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8858/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8858/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8858/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8858/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8858/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8858/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8858/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8858/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8858/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8858.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">1562</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">370</span> Calculation of Reorder Point Level under Stochastic Parameters: A Case Study in Healthcare Area</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Serap%20Akcan">Serap Akcan</a>, <a href="https://publications.waset.org/search?q=Ali%20Kokangul"> Ali Kokangul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider a single-echelon, single-item inventory system where both demand and lead-time are stochastic. Continuous review policy is used to control the inventory system. The objective is to calculate the reorder point level under stochastic parameters. A case study is presented in Neonatal Intensive Care Unit. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Inventory%20control%20system" title="Inventory control system">Inventory control system</a>, <a href="https://publications.waset.org/search?q=reorder%20point%20level" title=" reorder point level"> reorder point level</a>, <a href="https://publications.waset.org/search?q=stochastic%20demand" title=" stochastic demand"> stochastic demand</a>, <a href="https://publications.waset.org/search?q=stochastic%20lead%20time" title=" stochastic lead time"> stochastic lead time</a> </p> <a href="https://publications.waset.org/9483/calculation-of-reorder-point-level-under-stochastic-parameters-a-case-study-in-healthcare-area" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9483/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9483/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9483/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9483/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9483/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9483/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9483/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9483/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9483/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9483/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9483.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">3534</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">369</span> Non-Stationary Stochastic Optimization of an Oscillating Water Column</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mar%C3%ADa%20L.%20Jal%C3%B3n">Mar铆a L. Jal贸n</a>, <a href="https://publications.waset.org/search?q=Feargal%20Brennan"> Feargal Brennan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A non-stationary stochastic optimization methodology is applied to an OWC (oscillating water column) to find the design that maximizes the wave energy extraction. Different temporal cycles are considered to represent the long-term variability of the wave climate at the site in the optimization problem. The results of the non-stationary stochastic optimization problem are compared against those obtained by a stationary stochastic optimization problem. The comparative analysis reveals that the proposed non-stationary optimization provides designs with a better fit to reality. However, the stationarity assumption can be adequate when looking at averaged system response. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Non-stationary%20stochastic%20optimization" title="Non-stationary stochastic optimization">Non-stationary stochastic optimization</a>, <a href="https://publications.waset.org/search?q=oscillating%0D%0Awater%20column" title=" oscillating water column"> oscillating water column</a>, <a href="https://publications.waset.org/search?q=temporal%20variability" title=" temporal variability"> temporal variability</a>, <a href="https://publications.waset.org/search?q=wave%20energy." title=" wave energy."> wave energy.</a> </p> <a href="https://publications.waset.org/10007489/non-stationary-stochastic-optimization-of-an-oscillating-water-column" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007489/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007489/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007489/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007489/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007489/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007489/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007489/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007489/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007489/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007489/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007489.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">1379</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">368</span> Dynamic Slope Scaling Procedure for Stochastic Integer Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Takayuki%20Shiina">Takayuki Shiina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mathematical programming has been applied to various problems. For many actual problems, the assumption that the parameters involved are deterministic known data is often unjustified. In such cases, these data contain uncertainty and are thus represented as random variables, since they represent information about the future. Decision-making under uncertainty involves potential risk. Stochastic programming is a commonly used method for optimization under uncertainty. A stochastic programming problem with recourse is referred to as a two-stage stochastic problem. In this study, we consider a stochastic programming problem with simple integer recourse in which the value of the recourse variable is restricted to a multiple of a nonnegative integer. The algorithm of a dynamic slope scaling procedure for solving this problem is developed by using a property of the expected recourse function. Numerical experiments demonstrate that the proposed algorithm is quite efficient. The stochastic programming model defined in this paper is quite useful for a variety of design and operational problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=stochastic%20programming%20problem%20with%20recourse" title="stochastic programming problem with recourse">stochastic programming problem with recourse</a>, <a href="https://publications.waset.org/search?q=simple%0Ainteger%20recourse" title=" simple integer recourse"> simple integer recourse</a>, <a href="https://publications.waset.org/search?q=dynamic%20slope%20scaling%20procedure" title=" dynamic slope scaling procedure"> dynamic slope scaling procedure</a> </p> <a href="https://publications.waset.org/7142/dynamic-slope-scaling-procedure-for-stochastic-integer-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7142/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7142/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7142/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7142/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7142/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7142/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7142/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7142/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7142/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7142/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7142.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">1616</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">367</span> Improved Segmentation of Speckled Images Using an Arithmetic-to-Geometric Mean Ratio Kernel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J.%20Daba">J. Daba</a>, <a href="https://publications.waset.org/search?q=J.%20Dubois"> J. Dubois</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we improve a previously developed segmentation scheme aimed at extracting edge information from speckled images using a maximum likelihood edge detector. The scheme was based on finding a threshold for the probability density function of a new kernel defined as the arithmetic mean-to-geometric mean ratio field over a circular neighborhood set and, in a general context, is founded on a likelihood random field model (LRFM). The segmentation algorithm was applied to discriminated speckle areas obtained using simple elliptic discriminant functions based on measures of the signal-to-noise ratio with fractional order moments. A rigorous stochastic analysis was used to derive an exact expression for the cumulative density function of the probability density function of the random field. Based on this, an accurate probability of error was derived and the performance of the scheme was analysed. The improved segmentation scheme performed well for both simulated and real images and showed superior results to those previously obtained using the original LRFM scheme and standard edge detection methods. In particular, the false alarm probability was markedly lower than that of the original LRFM method with oversegmentation artifacts virtually eliminated. The importance of this work lies in the development of a stochastic-based segmentation, allowing an accurate quantification of the probability of false detection. Non visual quantification and misclassification in medical ultrasound speckled images is relatively new and is of interest to clinicians. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Discriminant%20function" title="Discriminant function">Discriminant function</a>, <a href="https://publications.waset.org/search?q=false%20alarm" title=" false alarm"> false alarm</a>, <a href="https://publications.waset.org/search?q=segmentation" title=" segmentation"> segmentation</a>, <a href="https://publications.waset.org/search?q=signal-to-noise%20ratio" title="signal-to-noise ratio">signal-to-noise ratio</a>, <a href="https://publications.waset.org/search?q=skewness" title=" skewness"> skewness</a>, <a href="https://publications.waset.org/search?q=speckle." title=" speckle."> speckle.</a> </p> <a href="https://publications.waset.org/396/improved-segmentation-of-speckled-images-using-an-arithmetic-to-geometric-mean-ratio-kernel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/396/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/396/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/396/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/396/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/396/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/396/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/396/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/396/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/396/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/396/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/396.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">1655</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">366</span> Stochastic Estimation of Cavity Flowfield</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yin%20Yin%20Pey">Yin Yin Pey</a>, <a href="https://publications.waset.org/search?q=Leok%20Poh%20Chua"> Leok Poh Chua</a>, <a href="https://publications.waset.org/search?q=Wei%20Long%20Siauw"> Wei Long Siauw</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Linear stochastic estimation and quadratic stochastic estimation techniques were applied to estimate the entire velocity flow-field of an open cavity with a length to depth ratio of 2. The estimations were done through the use of instantaneous velocity magnitude as estimators. These measurements were obtained by Particle Image Velocimetry. The predicted flow was compared against the original flow-field in terms of the Reynolds stresses and turbulent kinetic energy. Quadratic stochastic estimation proved to be more superior than linear stochastic estimation in resolving the shear layer flow. When the velocity fluctuations were scaled up in the quadratic estimate, both the time-averaged quantities and the instantaneous cavity flow can be predicted to a rather accurate extent. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Open%20cavity" title="Open cavity">Open cavity</a>, <a href="https://publications.waset.org/search?q=Particle%20Image%20Velocimetry" title=" Particle Image Velocimetry"> Particle Image Velocimetry</a>, <a href="https://publications.waset.org/search?q=Stochastic%0Aestimation" title=" Stochastic estimation"> Stochastic estimation</a>, <a href="https://publications.waset.org/search?q=Turbulent%20kinetic%20energy." title=" Turbulent kinetic energy."> Turbulent kinetic energy.</a> </p> <a href="https://publications.waset.org/11681/stochastic-estimation-of-cavity-flowfield" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11681/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11681/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11681/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11681/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11681/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11681/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11681/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11681/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11681/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11681/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11681.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">1714</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">365</span> Stochastic Programming Model for Power Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Takayuki%20Shiina">Takayuki Shiina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider power system expansion planning under uncertainty. In our approach, integer programming and stochastic programming provide a basic framework. We develop a multistage stochastic programming model in which some of the variables are restricted to integer values. By utilizing the special property of the problem, called block separable recourse, the problem is transformed into a two-stage stochastic program with recourse. The electric power capacity expansion problem is reformulated as the problem with first stage integer variables and continuous second stage variables. The L-shaped algorithm to solve the problem is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=electric%20power%20capacity%20expansion%20problem" title="electric power capacity expansion problem">electric power capacity expansion problem</a>, <a href="https://publications.waset.org/search?q=integerprogramming" title=" integerprogramming"> integerprogramming</a>, <a href="https://publications.waset.org/search?q=L-shaped%20method" title=" L-shaped method"> L-shaped method</a>, <a href="https://publications.waset.org/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a> </p> <a href="https://publications.waset.org/15305/stochastic-programming-model-for-power-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15305/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15305/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15305/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15305/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15305/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15305/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15305/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15305/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15305/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15305/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15305.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">1825</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">364</span> A Reduced-Bit Multiplication Algorithm for Digital Arithmetic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Harpreet%20Singh%20Dhillon">Harpreet Singh Dhillon</a>, <a href="https://publications.waset.org/search?q=Abhijit%20Mitra"> Abhijit Mitra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A reduced-bit multiplication algorithm based on the ancient Vedic multiplication formulae is proposed in this paper. Both the Vedic multiplication formulae, Urdhva tiryakbhyam and Nikhilam, are first discussed in detail. Urdhva tiryakbhyam, being a general multiplication formula, is equally applicable to all cases of multiplication. It is applied to the digital arithmetic and is shown to yield a multiplier architecture which is very similar to the popular array multiplier. Due to its structure, it leads to a high carry propagation delay in case of multiplication of large numbers. Nikhilam Sutra, on the other hand, is more efficient in the multiplication of large numbers as it reduces the multiplication of two large numbers to that of two smaller numbers. The framework of the proposed algorithm is taken from this Sutra and is further optimized by use of some general arithmetic operations such as expansion and bit-shifting to take advantage of bit-reduction in multiplication. We illustrate the proposed algorithm by reducing a general 4x4-bit multiplication to a single 2 x 2-bit multiplication operation.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiplication" title="Multiplication">Multiplication</a>, <a href="https://publications.waset.org/search?q=algorithm" title=" algorithm"> algorithm</a>, <a href="https://publications.waset.org/search?q=Vedic%20mathematics" title=" Vedic mathematics"> Vedic mathematics</a>, <a href="https://publications.waset.org/search?q=digital%0D%0Aarithmetic" title=" digital arithmetic"> digital arithmetic</a>, <a href="https://publications.waset.org/search?q=reduced-bit." title=" reduced-bit."> reduced-bit.</a> </p> <a href="https://publications.waset.org/3669/a-reduced-bit-multiplication-algorithm-for-digital-arithmetic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3669/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3669/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3669/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3669/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3669/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3669/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3669/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3669/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3669/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3669/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3669.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">3454</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">363</span> Stochastic Scheduling to Minimize Expected Lateness in Multiple Identical Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ghulam%20Zakria">Ghulam Zakria</a>, <a href="https://publications.waset.org/search?q=Zailin%20Guan"> Zailin Guan </a>, <a href="https://publications.waset.org/search?q=Yasser%20Riaz%20Awan">Yasser Riaz Awan</a>, <a href="https://publications.waset.org/search?q=Wan%20Lizhi"> Wan Lizhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are many real world problems in which parameters like the arrival time of new jobs, failure of resources, and completion time of jobs change continuously. This paper tackles the problem of scheduling jobs with random due dates on multiple identical machines in a stochastic environment. First to assign jobs to different machine centers LPT scheduling methods have been used, after that the particular sequence of jobs to be processed on the machine have been found using simple stochastic techniques. The performance parameter under consideration has been the maximum lateness concerning the stochastic due dates which are independent and exponentially distributed. At the end a relevant problem has been solved using the techniques in the paper.. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quantity%20Production%20Flow%20Shop" title="Quantity Production Flow Shop">Quantity Production Flow Shop</a>, <a href="https://publications.waset.org/search?q=LPT%20Scheduling" title=" LPT Scheduling"> LPT Scheduling</a>, <a href="https://publications.waset.org/search?q=Stochastic%20Scheduling" title="Stochastic Scheduling">Stochastic Scheduling</a>, <a href="https://publications.waset.org/search?q=Maximum%20Lateness" title=" Maximum Lateness"> Maximum Lateness</a>, <a href="https://publications.waset.org/search?q=Random%20Due%20Dates" title=" Random Due Dates"> Random Due Dates</a> </p> <a href="https://publications.waset.org/3970/stochastic-scheduling-to-minimize-expected-lateness-in-multiple-identical-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3970/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3970/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3970/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3970/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3970/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3970/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3970/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3970/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3970/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3970/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3970.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">1393</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">362</span> Comparison of Reliability Systems Based Uncertainty</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Aissani">A. Aissani</a>, <a href="https://publications.waset.org/search?q=H.%20Benaoudia"> H. Benaoudia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Stochastic comparison has been an important direction of research in various area. This can be done by the use of the notion of stochastic ordering which gives qualitatitive rather than purely quantitative estimation of the system under study. In this paper we present applications of comparison based uncertainty related to entropy in Reliability analysis, for example to design better systems. These results can be used as a priori information in simulation studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Uncertainty" title="Uncertainty">Uncertainty</a>, <a href="https://publications.waset.org/search?q=Stochastic%20comparison" title=" Stochastic comparison"> Stochastic comparison</a>, <a href="https://publications.waset.org/search?q=Reliability" title=" Reliability"> Reliability</a>, <a href="https://publications.waset.org/search?q=serie%27s%20system" title="serie&#039;s system">serie&#039;s system</a>, <a href="https://publications.waset.org/search?q=imperfect%20repair." title=" imperfect repair."> imperfect repair.</a> </p> <a href="https://publications.waset.org/13700/comparison-of-reliability-systems-based-uncertainty" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13700/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13700/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13700/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13700/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13700/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13700/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13700/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13700/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13700/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13700/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13700.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">1252</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">361</span> On Diffusion Approximation of Discrete Markov Dynamical Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jevgenijs%20Carkovs">Jevgenijs Carkovs</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper is devoted to stochastic analysis of finite dimensional difference equation with dependent on ergodic Markov chain increments, which are proportional to small parameter ". A point-form solution of this difference equation may be represented as vertexes of a time-dependent continuous broken line given on the segment [0,1] with "-dependent scaling of intervals between vertexes. Tending " to zero one may apply stochastic averaging and diffusion approximation procedures and construct continuous approximation of the initial stochastic iterations as an ordinary or stochastic Ito differential equation. The paper proves that for sufficiently small " these equations may be successfully applied not only to approximate finite number of iterations but also for asymptotic analysis of iterations, when number of iterations tends to infinity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Markov%20dynamical%20system" title="Markov dynamical system">Markov dynamical system</a>, <a href="https://publications.waset.org/search?q=diffusion%20approximation" title=" diffusion approximation"> diffusion approximation</a>, <a href="https://publications.waset.org/search?q=equilibrium%20stochastic%20stability." title="equilibrium stochastic stability.">equilibrium stochastic stability.</a> </p> <a href="https://publications.waset.org/4982/on-diffusion-approximation-of-discrete-markov-dynamical-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4982/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4982/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4982/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4982/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4982/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4982/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4982/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4982/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4982/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4982/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4982.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">1578</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">360</span> The Strict Stability of Impulsive Stochastic Functional Differential Equations with Markovian Switching</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dezhi%20Liu%20Guiyuan%20Yang%20Wei%20Zhang">Dezhi Liu Guiyuan Yang Wei Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Strict stability can present the rate of decay of the solution, so more and more investigators are beginning to study the topic and some results have been obtained. However, there are few results about strict stability of stochastic differential equations. In this paper, using Lyapunov functions and Razumikhin technique, we have gotten some criteria for the strict stability of impulsive stochastic functional differential equations with markovian switching. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Impulsive%3B%20Stochastic%20functional%20differential%20equation%3B%20Strict%20stability%3B%20Razumikhin%20technique." title="Impulsive; Stochastic functional differential equation; Strict stability; Razumikhin technique.">Impulsive; Stochastic functional differential equation; Strict stability; Razumikhin technique.</a> </p> <a href="https://publications.waset.org/15649/the-strict-stability-of-impulsive-stochastic-functional-differential-equations-with-markovian-switching" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15649/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15649/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15649/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15649/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15649/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15649/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15649/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15649/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15649/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15649/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15649.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">1287</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">359</span> Mean Square Stability of Impulsive Stochastic Delay Differential Equations with Markovian Switching and Poisson Jumps</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dezhi%20Liu">Dezhi Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In the paper, based on stochastic analysis theory and Lyapunov functional method, we discuss the mean square stability of impulsive stochastic delay differential equations with markovian switching and poisson jumps, and the sufficient conditions of mean square stability have been obtained. One example illustrates the main results. Furthermore, some well-known results are improved and generalized in the remarks.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Impulsive" title="Impulsive">Impulsive</a>, <a href="https://publications.waset.org/search?q=stochastic" title=" stochastic"> stochastic</a>, <a href="https://publications.waset.org/search?q=delay" title=" delay"> delay</a>, <a href="https://publications.waset.org/search?q=Markovian%20switching" title=" Markovian switching"> Markovian switching</a>, <a href="https://publications.waset.org/search?q=Poisson%20jumps" title=" Poisson jumps"> Poisson jumps</a>, <a href="https://publications.waset.org/search?q=mean%20square%20stability." title=" mean square stability."> mean square stability.</a> </p> <a href="https://publications.waset.org/6075/mean-square-stability-of-impulsive-stochastic-delay-differential-equations-with-markovian-switching-and-poisson-jumps" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6075/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6075/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6075/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6075/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6075/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6075/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6075/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6075/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6075/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6075/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6075.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">1559</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">358</span> Segmentation of Noisy Digital Images with Stochastic Gradient Kernel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abhishek%20Neogi">Abhishek Neogi</a>, <a href="https://publications.waset.org/search?q=Jayesh%20Verma"> Jayesh Verma</a>, <a href="https://publications.waset.org/search?q=Pinaki%20Pratim%20Acharjya"> Pinaki Pratim Acharjya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image segmentation and edge detection is a fundamental section in image processing. In case of noisy images Edge Detection is very less effective if we use conventional Spatial Filters like Sobel, Prewitt, LOG, Laplacian etc. To overcome this problem we have proposed the use of Stochastic Gradient Mask instead of Spatial Filters for generating gradient images. The present study has shown that the resultant images obtained by applying Stochastic Gradient Masks appear to be much clearer and sharper as per Edge detection is considered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20segmentation" title="Image segmentation">Image segmentation</a>, <a href="https://publications.waset.org/search?q=edge%20Detection" title=" edge Detection"> edge Detection</a>, <a href="https://publications.waset.org/search?q=noisy%20images" title=" noisy images"> noisy images</a>, <a href="https://publications.waset.org/search?q=spatialfilters" title=" spatialfilters"> spatialfilters</a>, <a href="https://publications.waset.org/search?q=stochastic%20gradient%20kernel." title=" stochastic gradient kernel."> stochastic gradient kernel.</a> </p> <a href="https://publications.waset.org/10001671/segmentation-of-noisy-digital-images-with-stochastic-gradient-kernel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001671/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001671/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001671/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001671/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001671/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001671/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001671/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001671/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001671/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001671/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001671.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">1520</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">357</span> Noise Analysis of Single-Ended Input Differential Amplifier using Stochastic Differential Equation </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tarun%20Kumar%20Rawat">Tarun Kumar Rawat</a>, <a href="https://publications.waset.org/search?q=Abhirup%20Lahiri"> Abhirup Lahiri</a>, <a href="https://publications.waset.org/search?q=Ashish%20Gupta"> Ashish Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we analyze the effect of noise in a single- ended input differential amplifier working at high frequencies. Both extrinsic and intrinsic noise are analyzed using time domain method employing techniques from stochastic calculus. Stochastic differential equations are used to obtain autocorrelation functions of the output noise voltage and other solution statistics like mean and variance. The analysis leads to important design implications and suggests changes in the device parameters for improved noise characteristics of the differential amplifier.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Single-ended%20input%20differential%20amplifier" title="Single-ended input differential amplifier">Single-ended input differential amplifier</a>, <a href="https://publications.waset.org/search?q=Noise" title=" Noise"> Noise</a>, <a href="https://publications.waset.org/search?q=stochastic%20differential%20equation" title=" stochastic differential equation"> stochastic differential equation</a>, <a href="https://publications.waset.org/search?q=mean%20and%20variance." title=" mean and variance."> mean and variance.</a> </p> <a href="https://publications.waset.org/8383/noise-analysis-of-single-ended-input-differential-amplifier-using-stochastic-differential-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8383/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8383/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8383/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8383/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8383/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8383/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8383/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8383/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8383/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8383/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8383.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">1722</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">356</span> Membership Surface and Arithmetic Operations of Imprecise Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dhruba%20Das">Dhruba Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a method has been developed to construct the membership surfaces of row and column vectors and arithmetic operations of imprecise matrix. A matrix with imprecise elements would be called an imprecise matrix. The membership surface of imprecise vector has been already shown based on Randomness-Impreciseness Consistency Principle. The Randomness- Impreciseness Consistency Principle leads to defining a normal law of impreciseness using two different laws of randomness. In this paper, the author has shown row and column membership surfaces and arithmetic operations of imprecise matrix and demonstrated with the help of numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Imprecise%20number" title="Imprecise number">Imprecise number</a>, <a href="https://publications.waset.org/search?q=Imprecise%20vector" title=" Imprecise vector"> Imprecise vector</a>, <a href="https://publications.waset.org/search?q=Membership%0D%0Asurface" title=" Membership surface"> Membership surface</a>, <a href="https://publications.waset.org/search?q=Imprecise%20matrix." title=" Imprecise matrix."> Imprecise matrix.</a> </p> <a href="https://publications.waset.org/10003419/membership-surface-and-arithmetic-operations-of-imprecise-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003419/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003419/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003419/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003419/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003419/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003419/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003419/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003419/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003419/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003419/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003419.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">1799</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">355</span> A Scenario-Based Approach for the Air Traffic Flow Management Problem with Stochastic Capacities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Soumia%20Ichoua"> Soumia Ichoua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we investigate the strategic stochastic air traffic flow management problem which seeks to balance airspace capacity and demand under weather disruptions. The goal is to reduce the need for myopic tactical decisions that do not account for probabilistic knowledge about the NAS near-future states. We present and discuss a scenario-based modeling approach based on a time-space stochastic process to depict weather disruption occurrences in the NAS. A solution framework is also proposed along with a distributed implementation aimed at overcoming scalability problems. Issues related to this implementation are also discussed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Air%20traffic%20management" title=" Air traffic management"> Air traffic management</a>, <a href="https://publications.waset.org/search?q=sample%20average%20approximation" title=" sample average approximation"> sample average approximation</a>, <a href="https://publications.waset.org/search?q=scenario-based%20approach" title=" scenario-based approach"> scenario-based approach</a>, <a href="https://publications.waset.org/search?q=stochastic%20capacity." title=" stochastic capacity."> stochastic capacity.</a> </p> <a href="https://publications.waset.org/16059/a-scenario-based-approach-for-the-air-traffic-flow-management-problem-with-stochastic-capacities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16059/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16059/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16059/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16059/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16059/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16059/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16059/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16059/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16059/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16059/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16059.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">2085</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">354</span> PTH Moment Exponential Stability of Stochastic Recurrent Neural Networks with Distributed Delays</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zixin%20Liu">Zixin Liu</a>, <a href="https://publications.waset.org/search?q=Jianjun%20Jiao%20Wanping%20Bai"> Jianjun Jiao Wanping Bai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, the issue of pth moment exponential stability of stochastic recurrent neural network with distributed time delays is investigated. By using the method of variation parameters, inequality techniques, and stochastic analysis, some sufficient conditions ensuring pth moment exponential stability are obtained. The method used in this paper does not resort to any Lyapunov function, and the results derived in this paper generalize some earlier criteria reported in the literature. One numerical example is given to illustrate the main results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Stochastic%20recurrent%20neural%20networks" title="Stochastic recurrent neural networks">Stochastic recurrent neural networks</a>, <a href="https://publications.waset.org/search?q=pth%20moment%20exponential%20stability" title=" pth moment exponential stability"> pth moment exponential stability</a>, <a href="https://publications.waset.org/search?q=distributed%20time%20delays." title=" distributed time delays."> distributed time delays.</a> </p> <a href="https://publications.waset.org/2489/pth-moment-exponential-stability-of-stochastic-recurrent-neural-networks-with-distributed-delays" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2489/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2489/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2489/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2489/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2489/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2489/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2489/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2489/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2489/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2489/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2489.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">1254</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">353</span> Implementation and Analysis of Elliptic Curve Cryptosystems over Polynomial basis and ONB</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yong-Je%20Choi">Yong-Je Choi</a>, <a href="https://publications.waset.org/search?q=Moo-Seop%20Kim"> Moo-Seop Kim</a>, <a href="https://publications.waset.org/search?q=Hang-Rok%20Lee"> Hang-Rok Lee</a>, <a href="https://publications.waset.org/search?q=Ho-Won%20Kim"> Ho-Won Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Polynomial bases and normal bases are both used for elliptic curve cryptosystems, but field arithmetic operations such as multiplication, inversion and doubling for each basis are implemented by different methods. In general, it is said that normal bases, especially optimal normal bases (ONB) which are special cases on normal bases, are efficient for the implementation in hardware in comparison with polynomial bases. However there seems to be more examined by implementing and analyzing these systems under similar condition. In this paper, we designed field arithmetic operators for each basis over GF(2233), which field has a polynomial basis recommended by SEC2 and a type-II ONB both, and analyzed these implementation results. And, in addition, we predicted the efficiency of two elliptic curve cryptosystems using these field arithmetic operators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Elliptic%20Curve%20Cryptosystem" title="Elliptic Curve Cryptosystem">Elliptic Curve Cryptosystem</a>, <a href="https://publications.waset.org/search?q=Crypto%20Algorithm" title=" Crypto Algorithm"> Crypto Algorithm</a>, <a href="https://publications.waset.org/search?q=Polynomial%20Basis" title="Polynomial Basis">Polynomial Basis</a>, <a href="https://publications.waset.org/search?q=Optimal%20Normal%20Basis" title=" Optimal Normal Basis"> Optimal Normal Basis</a>, <a href="https://publications.waset.org/search?q=Security." title=" Security."> Security.</a> </p> <a href="https://publications.waset.org/3467/implementation-and-analysis-of-elliptic-curve-cryptosystems-over-polynomial-basis-and-onb" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3467/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3467/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3467/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3467/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3467/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3467/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3467/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3467/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3467/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3467/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3467.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">2088</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">352</span> A Computational Stochastic Modeling Formalism for Biological Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Werner%20Sandmann">Werner Sandmann</a>, <a href="https://publications.waset.org/search?q=Verena%20Wolf"> Verena Wolf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Stochastic models of biological networks are well established in systems biology, where the computational treatment of such models is often focused on the solution of the so-called chemical master equation via stochastic simulation algorithms. In contrast to this, the development of storage-efficient model representations that are directly suitable for computer implementation has received significantly less attention. Instead, a model is usually described in terms of a stochastic process or a &quot;higher-level paradigm&quot; with graphical representation such as e.g. a stochastic Petri net. A serious problem then arises due to the exponential growth of the model-s state space which is in fact a main reason for the popularity of stochastic simulation since simulation suffers less from the state space explosion than non-simulative numerical solution techniques. In this paper we present transition class models for the representation of biological network models, a compact mathematical formalism that circumvents state space explosion. Transition class models can also serve as an interface between different higher level modeling paradigms, stochastic processes and the implementation coded in a programming language. Besides, the compact model representation provides the opportunity to apply non-simulative solution techniques thereby preserving the possible use of stochastic simulation. Illustrative examples of transition class representations are given for an enzyme-catalyzed substrate conversion and a part of the bacteriophage &lambda;&nbsp;lysis/lysogeny pathway.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Computational%20Modeling" title="Computational Modeling">Computational Modeling</a>, <a href="https://publications.waset.org/search?q=Biological%20Networks" title=" Biological Networks"> Biological Networks</a>, <a href="https://publications.waset.org/search?q=Stochastic%20Models" title="Stochastic Models">Stochastic Models</a>, <a href="https://publications.waset.org/search?q=Markov%20Chains" title=" Markov Chains"> Markov Chains</a>, <a href="https://publications.waset.org/search?q=Transition%20Class%20Models." title=" Transition Class Models."> Transition Class Models.</a> </p> <a href="https://publications.waset.org/5322/a-computational-stochastic-modeling-formalism-for-biological-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5322/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5322/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5322/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5322/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5322/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5322/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5322/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5322/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5322/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5322/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5322.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">1579</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">351</span> OWA Operators in Generalized Distances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jos%C3%A9%20M.%20Merig%C3%B3">Jos茅 M. Merig贸</a>, <a href="https://publications.waset.org/search?q=Anna%20M.%20Gil-Lafuente"> Anna M. Gil-Lafuente</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Different types of aggregation operators such as the ordered weighted quasi-arithmetic mean (Quasi-OWA) operator and the normalized Hamming distance are studied. We introduce the use of the OWA operator in generalized distances such as the quasiarithmetic distance. We will call these new distance aggregation the ordered weighted quasi-arithmetic distance (Quasi-OWAD) operator. We develop a general overview of this type of generalization and study some of their main properties such as the distinction between descending and ascending orders. We also consider different families of Quasi-OWAD operators such as the Minkowski ordered weighted averaging distance (MOWAD) operator, the ordered weighted averaging distance (OWAD) operator, the Euclidean ordered weighted averaging distance (EOWAD) operator, the normalized quasi-arithmetic distance, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aggregation%20operators" title="Aggregation operators">Aggregation operators</a>, <a href="https://publications.waset.org/search?q=Distance%20measures" title=" Distance measures"> Distance measures</a>, <a href="https://publications.waset.org/search?q=Quasi-%20OWA%20operator." title=" Quasi- OWA operator."> Quasi- OWA operator.</a> </p> <a href="https://publications.waset.org/15590/owa-operators-in-generalized-distances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15590/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15590/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15590/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15590/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15590/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15590/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15590/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15590/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15590/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15590/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15590.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">1661</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">350</span> Passivity Analysis of Stochastic Neural Networks With Multiple Time Delays</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Biao%20Qin">Biao Qin</a>, <a href="https://publications.waset.org/search?q=Jin%20Huang"> Jin Huang</a>, <a href="https://publications.waset.org/search?q=Jiaojiao%20Ren"> Jiaojiao Ren</a>, <a href="https://publications.waset.org/search?q=Wei%20Kang"> Wei Kang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper deals with the problem of passivity analysis for stochastic neural networks with leakage, discrete and distributed delays. By using delay partitioning technique, free weighting matrix method and stochastic analysis technique, several sufficient conditions for the passivity of the addressed neural networks are established in terms of linear matrix inequalities (LMIs), in which both the time-delay and its time derivative can be fully considered. A numerical example is given to show the usefulness and effectiveness of the obtained results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Passivity" title="Passivity">Passivity</a>, <a href="https://publications.waset.org/search?q=Stochastic%20neural%20networks" title=" Stochastic neural networks"> Stochastic neural networks</a>, <a href="https://publications.waset.org/search?q=Multiple%20time%0D%0Adelays" title=" Multiple time delays"> Multiple time delays</a>, <a href="https://publications.waset.org/search?q=Linear%20matrix%20inequalities%20%28LMIs%29." title=" Linear matrix inequalities (LMIs)."> Linear matrix inequalities (LMIs).</a> </p> <a href="https://publications.waset.org/9999569/passivity-analysis-of-stochastic-neural-networks-with-multiple-time-delays" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999569/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999569/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999569/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999569/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999569/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999569/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999569/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999569/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999569/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999569/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999569.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">1703</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">349</span> Existence of Solution of Nonlinear Second Order Neutral Stochastic Differential Inclusions with Infinite Delay</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yong%20Li">Yong Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The paper is concerned with the existence of solution of nonlinear second order neutral stochastic differential inclusions with infinite delay in a Hilbert Space. Sufficient conditions for the existence are obtained by using a fixed point theorem for condensing maps.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mild%20solution" title="Mild solution">Mild solution</a>, <a href="https://publications.waset.org/search?q=Convex%20multivalued%20map" title=" Convex multivalued map"> Convex multivalued map</a>, <a href="https://publications.waset.org/search?q=Neutral%0D%0Astochastic%20differential%20inclusions." title=" Neutral stochastic differential inclusions."> Neutral stochastic differential inclusions.</a> </p> <a href="https://publications.waset.org/9999324/existence-of-solution-of-nonlinear-second-order-neutral-stochastic-differential-inclusions-with-infinite-delay" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999324/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999324/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999324/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999324/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999324/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999324/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999324/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999324/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999324/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999324/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999324.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">1604</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">348</span> Formulating the Stochastic Finite Elements for Free Vibration Analysis of Plates with Variable Elastic Modulus</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mojtaba%20Aghamiri%20Esfahani">Mojtaba Aghamiri Esfahani</a>, <a href="https://publications.waset.org/search?q=Mohammad%20Karkon"> Mohammad Karkon</a>, <a href="https://publications.waset.org/search?q=Seyed%20Majid%20Hosseini%20Nezhad"> Seyed Majid Hosseini Nezhad</a>, <a href="https://publications.waset.org/search?q=Reza%20Hosseini-Ara"> Reza Hosseini-Ara </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this study, the effect of uncertainty in elastic modulus of a plate on free vibration response is investigated. For this purpose, the elastic modulus of the plate is modeled as stochastic variable with normal distribution. Moreover, the distance autocorrelation function is used for stochastic field. Then, by applying the finite element method and Monte Carlo simulation, stochastic finite element relations are extracted. Finally, with a numerical test, the effect of uncertainty in the elastic modulus on free vibration response of a plate is studied. The results show that the effect of uncertainty in elastic modulus of the plate cannot play an important role on the free vibration response.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Stochastic%20finite%20elements" title="Stochastic finite elements">Stochastic finite elements</a>, <a href="https://publications.waset.org/search?q=plate%20bending" title=" plate bending"> plate bending</a>, <a href="https://publications.waset.org/search?q=free%20vibration" title=" free vibration"> free vibration</a>, <a href="https://publications.waset.org/search?q=Monte%20Carlo" title=" Monte Carlo"> Monte Carlo</a>, <a href="https://publications.waset.org/search?q=Neumann%20expansion%20method." title=" Neumann expansion method."> Neumann expansion method.</a> </p> <a href="https://publications.waset.org/10004213/formulating-the-stochastic-finite-elements-for-free-vibration-analysis-of-plates-with-variable-elastic-modulus" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004213/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004213/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004213/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004213/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004213/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004213/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004213/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004213/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004213/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004213/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004213.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">1692</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">347</span> Stochastic Comparisons of Heterogeneous Samples with Homogeneous Exponential Samples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nitin%20Gupta">Nitin Gupta</a>, <a href="https://publications.waset.org/search?q=Rakesh%20Kumar%20Bajaj"> Rakesh Kumar Bajaj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present communication, stochastic comparison of a series (parallel) system having heterogeneous components with random lifetimes and series (parallel) system having homogeneous exponential components with random lifetimes has been studied. Further, conditions under which such a comparison is possible has been established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Exponential%20distribution" title="Exponential distribution">Exponential distribution</a>, <a href="https://publications.waset.org/search?q=Order%20statistics" title=" Order statistics"> Order statistics</a>, <a href="https://publications.waset.org/search?q=Star%20ordering" title=" Star ordering"> Star ordering</a>, <a href="https://publications.waset.org/search?q=Stochastic%20ordering." title=" Stochastic ordering."> Stochastic ordering.</a> </p> <a href="https://publications.waset.org/8260/stochastic-comparisons-of-heterogeneous-samples-with-homogeneous-exponential-samples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8260/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8260/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8260/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8260/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8260/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8260/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8260/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8260/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8260/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8260/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8260.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">1564</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">346</span> Stability Analysis of Impulsive Stochastic Fuzzy Cellular Neural Networks with Time-varying Delays and Reaction-diffusion Terms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xinhua%20Zhang">Xinhua Zhang</a>, <a href="https://publications.waset.org/search?q=Kelin%20Li"> Kelin Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, the problem of stability analysis for a class of impulsive stochastic fuzzy neural networks with timevarying delays and reaction-diffusion is considered. By utilizing suitable Lyapunov-Krasovskii funcational, the inequality technique and stochastic analysis technique, some sufficient conditions ensuring global exponential stability of equilibrium point for impulsive stochastic fuzzy cellular neural networks with time-varying delays and diffusion are obtained. In particular, the estimate of the exponential convergence rate is also provided, which depends on system parameters, diffusion effect and impulsive disturbed intention. It is believed that these results are significant and useful for the design and applications of fuzzy neural networks. An example is given to show the effectiveness of the obtained results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Exponential%20stability" title="Exponential stability">Exponential stability</a>, <a href="https://publications.waset.org/search?q=stochastic%20fuzzy%20cellular%20neural%20networks" title=" stochastic fuzzy cellular neural networks"> stochastic fuzzy cellular neural networks</a>, <a href="https://publications.waset.org/search?q=time-varying%20delays" title=" time-varying delays"> time-varying delays</a>, <a href="https://publications.waset.org/search?q=impulses" title=" impulses"> impulses</a>, <a href="https://publications.waset.org/search?q=reaction-diffusion%20terms." title=" reaction-diffusion terms."> reaction-diffusion terms.</a> </p> <a href="https://publications.waset.org/4717/stability-analysis-of-impulsive-stochastic-fuzzy-cellular-neural-networks-with-time-varying-delays-and-reaction-diffusion-terms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4717/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4717/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4717/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4717/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4717/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4717/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4717/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4717/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4717/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4717/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4717.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">1382</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/search?q=stochastic%20arithmetic&amp;page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;page=13">13</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=stochastic%20arithmetic&amp;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">&copy; 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">&times;</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>

Pages: 1 2 3 4 5 6 7 8 9 10