CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: Moreau-Yosida approximate</title> <meta name="description" content="Search results for: Moreau-Yosida approximate"> <meta name="keywords" content="Moreau-Yosida approximate"> <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="Moreau-Yosida approximate" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Moreau-Yosida approximate"> <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> 348</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Moreau-Yosida approximate</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">348</span> Optimization of Fourth Order Discrete-Approximation Inclusions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elimhan%20N.%20Mahmudov">Elimhan N. Mahmudov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper concerns the necessary and sufficient conditions of optimality for Cauchy problem of fourth order discrete (PD) and discrete-approximate (PDA) inclusions. The main problem is formulation of the fourth order adjoint discrete and discrete-approximate inclusions and transversality conditions, which are peculiar to problems including fourth order derivatives and approximate derivatives. Thus the necessary and sufficient conditions of optimality are obtained incorporating the Euler-Lagrange and Hamiltonian forms of inclusions. Derivation of optimality conditions are based on the apparatus of locally adjoint mapping (LAM). Moreover in the application of these results we consider the fourth order linear discrete and discrete-approximate inclusions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=difference" title="difference">difference</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=fourth" title=" fourth"> fourth</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=transversality" title=" transversality"> transversality</a> </p> <a href="https://publications.waset.org/abstracts/25199/optimization-of-fourth-order-discrete-approximation-inclusions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25199.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">374</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">347</span> A Study on Approximate Controllability of Impulsive Integrodifferential Systems with Non Local Conditions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anandhi%20Santhosh">Anandhi Santhosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to describe various real-world problems in physical and engineering sciences subject to abrupt changes at certain instants during the evolution process, impulsive differential equations has been used to describe the system model. In this article, the problem of approximate controllability for nonlinear impulsive integrodifferential equations with state-dependent delay is investigated. We study the approximate controllability for nonlinear impulsive integrodifferential system under the assumption that the corresponding linear control system is approximately controllable. Using methods of functional analysis and semigroup theory, sufficient conditions are formulated and proved. Finally, an example is provided to illustrate the proposed theory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20controllability" title="approximate controllability">approximate controllability</a>, <a href="https://publications.waset.org/abstracts/search?q=impulsive%20differential%20system" title=" impulsive differential system"> impulsive differential system</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point%20theorem" title=" fixed point theorem"> fixed point theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=state-dependent%20delay" title=" state-dependent delay"> state-dependent delay</a> </p> <a href="https://publications.waset.org/abstracts/34723/a-study-on-approximate-controllability-of-impulsive-integrodifferential-systems-with-non-local-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34723.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">383</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">346</span> APPLE: Providing Absolute and Proportional Throughput Guarantees in Wireless LANs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhijie%20Ma">Zhijie Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Qinglin%20Zhao"> Qinglin Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Hongning%20Dai"> Hongning Dai</a>, <a href="https://publications.waset.org/abstracts/search?q=Huan%20Zhang"> Huan Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an APPLE scheme that aims at providing absolute and proportional throughput guarantees, and maximizing system throughput simultaneously for wireless LANs with homogeneous and heterogenous traffic. We formulate our objectives as an optimization problem, present its exact and approximate solutions, and prove the existence and uniqueness of the approximate solution. Simulations validate that APPLE scheme is accurate, and the approximate solution can well achieve the desired objectives already. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=IEEE%20802.11e" title="IEEE 802.11e">IEEE 802.11e</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput%20guarantee" title=" throughput guarantee"> throughput guarantee</a>, <a href="https://publications.waset.org/abstracts/search?q=priority" title=" priority"> priority</a>, <a href="https://publications.waset.org/abstracts/search?q=WLANs" title=" WLANs"> WLANs</a> </p> <a href="https://publications.waset.org/abstracts/42503/apple-providing-absolute-and-proportional-throughput-guarantees-in-wireless-lans" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">345</span> The Different Improvement of Numerical Magnitude and Spatial Representation of Numbers to Symbolic Approximate Arithmetic: A Training Study of Preschooler</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu%20Liang">Yu Liang</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei%20Wei"> Wei Wei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Spatial representation of numbers and numerical magnitude are important for preschoolers’ mathematical ability. Mental number line, a typical index to measure numbers spatial representation, and numerical comparison are both related to arithmetic obviously. However, they seem to rely on different mechanisms and probably influence arithmetic through different mechanisms. In line with this idea, preschool children were trained with two tasks to investigate which one is more important for approximate arithmetic. The training of numerical processing and number line estimation were proved to be effective. They both improved the ability of approximate arithmetic. When the difficulty of approximate arithmetic was taken into account, the performance in number line training group was not significantly different among three levels. However, two harder levels achieved significance in numerical comparison training group. Thus, comparing spatial representation ability, symbolic approximation arithmetic relies more on numerical magnitude. Educational implications of the study were discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20arithmetic" title="approximate arithmetic">approximate arithmetic</a>, <a href="https://publications.waset.org/abstracts/search?q=mental%20number%20line" title=" mental number line"> mental number line</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20magnitude" title=" numerical magnitude"> numerical magnitude</a>, <a href="https://publications.waset.org/abstracts/search?q=preschooler" title=" preschooler"> preschooler</a> </p> <a href="https://publications.waset.org/abstracts/72817/the-different-improvement-of-numerical-magnitude-and-spatial-representation-of-numbers-to-symbolic-approximate-arithmetic-a-training-study-of-preschooler" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72817.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">251</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">344</span> A Near-Optimal Domain Independent Approach for Detecting Approximate Duplicates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelaziz%20Fellah">Abdelaziz Fellah</a>, <a href="https://publications.waset.org/abstracts/search?q=Allaoua%20Maamir"> Allaoua Maamir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a domain-independent merging-cluster filter approach complemented with a set of algorithms for identifying approximate duplicate entities efficiently and accurately within a single and across multiple data sources. The near-optimal merging-cluster filter (MCF) approach is based on the Monge-Elkan well-tuned algorithm and extended with an affine variant of the Smith-Waterman similarity measure. Then we present constant, variable, and function threshold algorithms that work conceptually in a divide-merge filtering fashion for detecting near duplicates as hierarchical clusters along with their corresponding representatives. The algorithms take recursive refinement approaches in the spirit of filtering, merging, and updating, cluster representatives to detect approximate duplicates at each level of the cluster tree. Experiments show a high effectiveness and accuracy of the MCF approach in detecting approximate duplicates by outperforming the seminal Monge-Elkan’s algorithm on several real-world benchmarks and generated datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20cleaning" title=" data cleaning"> data cleaning</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20duplicates" title=" approximate duplicates"> approximate duplicates</a>, <a href="https://publications.waset.org/abstracts/search?q=near-duplicates%20detection" title=" near-duplicates detection"> near-duplicates detection</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining%20applications%20and%20discovery" title=" data mining applications and discovery"> data mining applications and discovery</a> </p> <a href="https://publications.waset.org/abstracts/64998/a-near-optimal-domain-independent-approach-for-detecting-approximate-duplicates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64998.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">387</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">343</span> Analysis of EEG Signals Using Wavelet Entropy and Approximate Entropy: A Case Study on Depression Patients</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Subha%20D.%20Puthankattil">Subha D. Puthankattil</a>, <a href="https://publications.waset.org/abstracts/search?q=Paul%20K.%20Joseph"> Paul K. Joseph</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Analyzing brain signals of the patients suffering from the state of depression may lead to interesting observations in the signal parameters that is quite different from a normal control. The present study adopts two different methods: Time frequency domain and nonlinear method for the analysis of EEG signals acquired from depression patients and age and sex matched normal controls. The time frequency domain analysis is realized using wavelet entropy and approximate entropy is employed for the nonlinear method of analysis. The ability of the signal processing technique and the nonlinear method in differentiating the physiological aspects of the brain state are revealed using Wavelet entropy and Approximate entropy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=EEG" title="EEG">EEG</a>, <a href="https://publications.waset.org/abstracts/search?q=depression" title=" depression"> depression</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20entropy" title=" wavelet entropy"> wavelet entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20entropy" title=" approximate entropy"> approximate entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=relative%20wavelet%20energy" title=" relative wavelet energy"> relative wavelet energy</a>, <a href="https://publications.waset.org/abstracts/search?q=multiresolution%20decomposition" title=" multiresolution decomposition"> multiresolution decomposition</a> </p> <a href="https://publications.waset.org/abstracts/11836/analysis-of-eeg-signals-using-wavelet-entropy-and-approximate-entropy-a-case-study-on-depression-patients" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11836.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">332</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">342</span> Approximate Solution of Some Mixed Boundary Value Problems of the Generalized Theory of Couple-Stress Thermo-Elasticity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manana%20Chumburidze">Manana Chumburidze</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Lekveishvili"> David Lekveishvili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We have considered the harmonic oscillations and general dynamic (pseudo oscillations) systems of theory generalized Green-Lindsay of couple-stress thermo-elasticity for isotropic, homogeneous elastic media. Approximate solution of some mixed boundary value problems for finite domain, bounded by the some closed surface are constructed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=the%20couple-stress%20thermoelasticity" title="the couple-stress thermoelasticity">the couple-stress thermoelasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=boundary%20value%20problems" title=" boundary value problems"> boundary value problems</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20problems" title=" dynamic problems"> dynamic problems</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20solution" title=" approximate solution"> approximate solution</a> </p> <a href="https://publications.waset.org/abstracts/9383/approximate-solution-of-some-mixed-boundary-value-problems-of-the-generalized-theory-of-couple-stress-thermo-elasticity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9383.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">506</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">341</span> Convective Brinkman-Forchiemer Extended Flow through Channel Filled with Porous Material: An Approximate Analytical Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Basant%20K.%20Jha">Basant K. Jha</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20L.%20Kaurangini"> M. L. Kaurangini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An approximate analytical solution is presented for convective flow in a horizontal channel filled with porous material. The Brinkman-Forchheimer extension of Darcy equation is utilized to model the fluid flow while the energy equation is utilized to model temperature distribution in the channel. The solutions were obtained utilizing the newly suggested technique and compared with those obtained from an implicit finite-difference solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20analytical" title="approximate analytical">approximate analytical</a>, <a href="https://publications.waset.org/abstracts/search?q=convective%20flow" title=" convective flow"> convective flow</a>, <a href="https://publications.waset.org/abstracts/search?q=porous%20material" title=" porous material"> porous material</a>, <a href="https://publications.waset.org/abstracts/search?q=Brinkman-Forchiemer" title=" Brinkman-Forchiemer"> Brinkman-Forchiemer</a> </p> <a href="https://publications.waset.org/abstracts/17934/convective-brinkman-forchiemer-extended-flow-through-channel-filled-with-porous-material-an-approximate-analytical-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17934.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">397</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">340</span> Exact and Approximate Controllability of Nuclear Dynamics Using Bilinear Controls</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramdas%20Sonawane">Ramdas Sonawane</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahaveer%20Gadiya"> Mahaveer Gadiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The control problem associated with nuclear dynamics is represented by nonlinear integro-differential equation with additive controls. To control chain reaction, certain amount of neutrons is added into (or withdrawn out of) chamber as and when required. It is not realistic. So, we can think of controlling the reactor dynamics by bilinear control, which enters the system as coefficient of state. In this paper, we study the approximate and exact controllability of parabolic integro-differential equation controlled by bilinear control with non-homogeneous boundary conditions in bounded domain. We prove the existence of control and propose an explicit control strategy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20control" title="approximate control">approximate control</a>, <a href="https://publications.waset.org/abstracts/search?q=exact%20control" title=" exact control"> exact control</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20control" title=" bilinear control"> bilinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=nuclear%20dynamics" title=" nuclear dynamics"> nuclear dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=integro-differential%20equations" title=" integro-differential equations"> integro-differential equations</a> </p> <a href="https://publications.waset.org/abstracts/58619/exact-and-approximate-controllability-of-nuclear-dynamics-using-bilinear-controls" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58619.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">444</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">339</span> Hybrid Approximate Structural-Semantic Frequent Subgraph Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Montaceur%20Zaghdoud">Montaceur Zaghdoud</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Moussaoui"> Mohamed Moussaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Jalel%20Akaichi"> Jalel Akaichi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Frequent subgraph mining refers usually to graph matching and it is widely used in when analyzing big data with large graphs. A lot of research works dealt with structural exact or inexact graph matching but a little attention is paid to semantic matching when graph vertices and/or edges are attributed and typed. Therefore, it seems very interesting to integrate background knowledge into the analysis and that extracted frequent subgraphs should become more pruned by applying a new semantic filter instead of using only structural similarity in graph matching process. Consequently, this paper focuses on developing a new hybrid approximate structuralsemantic graph matching to discover a set of frequent subgraphs. It uses simultaneously an approximate structural similarity function based on graph edit distance function and a possibilistic vertices similarity function based on affinity function. Both structural and semantic filters contribute together to prune extracted frequent set. Indeed, new hybrid structural-semantic frequent subgraph mining approach searches will be suitable to be applied to several application such as community detection in social networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20graph%20matching" title="approximate graph matching">approximate graph matching</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20frequent%20subgraph%20mining" title=" hybrid frequent subgraph mining"> hybrid frequent subgraph mining</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20mining" title=" graph mining"> graph mining</a>, <a href="https://publications.waset.org/abstracts/search?q=possibility%20theory" title=" possibility theory"> possibility theory</a> </p> <a href="https://publications.waset.org/abstracts/34195/hybrid-approximate-structural-semantic-frequent-subgraph-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34195.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">403</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">338</span> An Approximation of Daily Rainfall by Using a Pixel Value Data Approach </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sarisa%20Pinkham">Sarisa Pinkham</a>, <a href="https://publications.waset.org/abstracts/search?q=Kanyarat%20Bussaban"> Kanyarat Bussaban</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research aims to approximate the amount of daily rainfall by using a pixel value data approach. The daily rainfall maps from the Thailand Meteorological Department in period of time from January to December 2013 were the data used in this study. The results showed that this approach can approximate the amount of daily rainfall with RMSE=3.343. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=daily%20rainfall" title="daily rainfall">daily rainfall</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20value%20data" title=" pixel value data"> pixel value data</a> </p> <a href="https://publications.waset.org/abstracts/9889/an-approximation-of-daily-rainfall-by-using-a-pixel-value-data-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9889.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">387</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">337</span> An Analysis of Sequential Pattern Mining on Databases Using Approximate Sequential Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Suneetha">J. Suneetha</a>, <a href="https://publications.waset.org/abstracts/search?q=Vijayalaxmi"> Vijayalaxmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sequential Pattern Mining involves applying data mining methods to large data repositories to extract usage patterns. Sequential pattern mining methodologies used to analyze the data and identify patterns. The patterns have been used to implement efficient systems can recommend on previously observed patterns, in making predictions, improve usability of systems, detecting events, and in general help in making strategic product decisions. In this paper, identified performance of approximate sequential pattern mining defines as identifying patterns approximately shared with many sequences. Approximate sequential patterns can effectively summarize and represent the databases by identifying the underlying trends in the data. Conducting an extensive and systematic performance over synthetic and real data. The results demonstrate that ApproxMAP effective and scalable in mining large sequences databases with long patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20data" title="multiple data">multiple data</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20analysis" title=" performance analysis"> performance analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern" title=" sequential pattern"> sequential pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20database%20scalability" title=" sequence database scalability"> sequence database scalability</a> </p> <a href="https://publications.waset.org/abstracts/46782/an-analysis-of-sequential-pattern-mining-on-databases-using-approximate-sequential-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46782.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">342</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">336</span> Heat Transfer of an Impinging Jet on a Plane Surface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian-Jun%20Shu">Jian-Jun Shu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A cold, thin film of liquid impinging on an isothermal hot, horizontal surface has been investigated. An approximate solution for the velocity and temperature distributions in the flow along the horizontal surface is developed, which exploits the hydrodynamic similarity solution for thin film flow. The approximate solution may provide a valuable basis for assessing flow and heat transfer in more complex settings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flux" title="flux">flux</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20impinging%20jet" title=" free impinging jet"> free impinging jet</a>, <a href="https://publications.waset.org/abstracts/search?q=solid-surface" title=" solid-surface"> solid-surface</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20wall%20temperature" title=" uniform wall temperature"> uniform wall temperature</a> </p> <a href="https://publications.waset.org/abstracts/20862/heat-transfer-of-an-impinging-jet-on-a-plane-surface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20862.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">479</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">335</span> A Study of Using Multiple Subproblems in Dantzig-Wolfe Decomposition of Linear Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=William%20Chung">William Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is to study the use of multiple subproblems in Dantzig-Wolfe decomposition of linear programming (DW-LP). Traditionally, the decomposed LP consists of one LP master problem and one LP subproblem. The master problem and the subproblem is solved alternatively by exchanging the dual prices of the master problem and the proposals of the subproblem until the LP is solved. It is well known that convergence is slow with a long tail of near-optimal solutions (asymptotic convergence). Hence, the performance of DW-LP highly depends upon the number of decomposition steps. If the decomposition steps can be greatly reduced, the performance of DW-LP can be improved significantly. To reduce the number of decomposition steps, one of the methods is to increase the number of proposals from the subproblem to the master problem. To do so, we propose to add a quadratic approximation function to the LP subproblem in order to develop a set of approximate-LP subproblems (multiple subproblems). Consequently, in each decomposition step, multiple subproblems are solved for providing multiple proposals to the master problem. The number of decomposition steps can be reduced greatly. Note that each approximate-LP subproblem is nonlinear programming, and solving the LP subproblem must faster than solving the nonlinear multiple subproblems. Hence, using multiple subproblems in DW-LP is the tradeoff between the number of approximate-LP subproblems being formed and the decomposition steps. In this paper, we derive the corresponding algorithms and provide some simple computational results. Some properties of the resulting algorithms are also given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20subproblem" title="approximate subproblem">approximate subproblem</a>, <a href="https://publications.waset.org/abstracts/search?q=Dantzig-Wolfe%20decomposition" title=" Dantzig-Wolfe decomposition"> Dantzig-Wolfe decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=large-scale%20models" title=" large-scale models"> large-scale models</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20subproblems" title=" multiple subproblems"> multiple subproblems</a> </p> <a href="https://publications.waset.org/abstracts/110435/a-study-of-using-multiple-subproblems-in-dantzig-wolfe-decomposition-of-linear-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110435.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">166</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">334</span> Solution of Hybrid Fuzzy Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahmood%20Otadi">Mahmood Otadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Mosleh"> Maryam Mosleh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The hybrid differential equations have a wide range of applications in science and engineering. In this paper, the homotopy analysis method (HAM) is applied to obtain the series solution of the hybrid differential equations. Using the homotopy analysis method, it is possible to find the exact solution or an approximate solution of the problem. Comparisons are made between improved predictor-corrector method, homotopy analysis method and the exact solution. Finally, we illustrate our approach by some numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20number" title="fuzzy number">fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20ODE" title=" fuzzy ODE"> fuzzy ODE</a>, <a href="https://publications.waset.org/abstracts/search?q=HAM" title=" HAM"> HAM</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20method" title=" approximate method"> approximate method</a> </p> <a href="https://publications.waset.org/abstracts/31754/solution-of-hybrid-fuzzy-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31754.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">511</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">333</span> A Framework Based on Dempster-Shafer Theory of Evidence Algorithm for the Analysis of the TV-Viewers’ Behaviors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamdi%20Amroun">Hamdi Amroun</a>, <a href="https://publications.waset.org/abstracts/search?q=Yacine%20Benziani"> Yacine Benziani</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehdi%20Ammi"> Mehdi Ammi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an approach of detecting the behavior of the viewers of a TV program in a non-controlled environment. The experiment we propose is based on the use of three types of connected objects (smartphone, smart watch, and a connected remote control). 23 participants were observed while watching their TV programs during three phases: before, during and after watching a TV program. Their behaviors were detected using an approach based on The Dempster Shafer Theory (DST) in two phases. The first phase is to approximate dynamically the mass functions using an approach based on the correlation coefficient. The second phase is to calculate the approximate mass functions. To approximate the mass functions, two approaches have been tested: the first approach was to divide each features data space into cells; each one has a specific probability distribution over the behaviors. The probability distributions were computed statistically (estimated by empirical distribution). The second approach was to predict the TV-viewing behaviors through the use of classifiers algorithms and add uncertainty to the prediction based on the uncertainty of the model. Results showed that mixing the fusion rule with the computation of the initial approximate mass functions using a classifier led to an overall of 96%, 95% and 96% success rate for the first, second and third TV-viewing phase respectively. The results were also compared to those found in the literature. This study aims to anticipate certain actions in order to maintain the attention of TV viewers towards the proposed TV programs with usual connected objects, taking into account the various uncertainties that can be generated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Iot" title="Iot">Iot</a>, <a href="https://publications.waset.org/abstracts/search?q=TV-viewing%20behaviors%20identification" title=" TV-viewing behaviors identification"> TV-viewing behaviors identification</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20classification" title=" automatic classification"> automatic classification</a>, <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20environment" title=" unconstrained environment"> unconstrained environment</a> </p> <a href="https://publications.waset.org/abstracts/89964/a-framework-based-on-dempster-shafer-theory-of-evidence-algorithm-for-the-analysis-of-the-tv-viewers-behaviors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89964.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">229</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">332</span> An Application of Sinc Function to Approximate Quadrature Integrals in Generalized Linear Mixed Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Altaf%20H.%20Khan">Altaf H. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Frank%20Stenger"> Frank Stenger</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20A.%20Hussein"> Mohammed A. Hussein</a>, <a href="https://publications.waset.org/abstracts/search?q=Reaz%20A.%20Chaudhuri"> Reaz A. Chaudhuri</a>, <a href="https://publications.waset.org/abstracts/search?q=Sameera%20Asif"> Sameera Asif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a novel approach to approximate quadrature integrals that arise in the estimation of likelihood parameters for the generalized linear mixed models (GLMM) as well as Bayesian methodology also requires computation of multidimensional integrals with respect to the posterior distributions in which computation are not only tedious and cumbersome rather in some situations impossible to find solutions because of singularities, irregular domains, etc. An attempt has been made in this work to apply Sinc function based quadrature rules to approximate intractable integrals, as there are several advantages of using Sinc based methods, for example: order of convergence is exponential, works very well in the neighborhood of singularities, in general quite stable and provide high accurate and double precisions estimates. The Sinc function based approach seems to be utilized first time in statistical domain to our knowledge, and it's viability and future scopes have been discussed to apply in the estimation of parameters for GLMM models as well as some other statistical areas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20linear%20mixed%20model" title="generalized linear mixed model">generalized linear mixed model</a>, <a href="https://publications.waset.org/abstracts/search?q=likelihood%20parameters" title=" likelihood parameters"> likelihood parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=qudarature" title=" qudarature"> qudarature</a>, <a href="https://publications.waset.org/abstracts/search?q=Sinc%20function" title=" Sinc function"> Sinc function</a> </p> <a href="https://publications.waset.org/abstracts/39637/an-application-of-sinc-function-to-approximate-quadrature-integrals-in-generalized-linear-mixed-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39637.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">395</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">331</span> Formulating Rough Approximations in Information Tables with Possibilistic Information</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michinori%20Nakata">Michinori Nakata</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiroshi%20Sakai"> Hiroshi Sakai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A rough set, which consists of lower and upper approximations, is formulated in information tables containing possibilistic information. First, lower and upper approximations on the basis of possible world semantics in the same way as Lipski did in the field of incomplete databases are shown in order to clarify fundamentals of rough sets under possibilistic information. Possibility and necessity measures are used, as is done in possibilistic databases. As a result, each object has certain and possible membership degrees to lower and upper approximations, which degrees are the lower and upper bounds. Therefore, the degree that the object belongs to lower and upper approximations is expressed by an interval value. And the complementary property linked with the lower and upper approximations holds, as is valid under complete information. Second, the approach based on indiscernibility relations, which is proposed by Dubois and Prade, are extended in three cases. The first case is that objects used to approximate a set of objects are characterized by possibilistic information. The second case is that objects used to approximate a set of objects with possibilistic information are characterized by complete information. The third case is that objects that are characterized by possibilistic information approximate a set of objects with possibilistic information. The extended approach create the same results as the approach based on possible world semantics. This justifies our extension. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rough%20sets" title="rough sets">rough sets</a>, <a href="https://publications.waset.org/abstracts/search?q=possibilistic%20information" title=" possibilistic information"> possibilistic information</a>, <a href="https://publications.waset.org/abstracts/search?q=possible%20world%20semantics" title=" possible world semantics"> possible world semantics</a>, <a href="https://publications.waset.org/abstracts/search?q=indiscernibility%20relations" title=" indiscernibility relations"> indiscernibility relations</a>, <a href="https://publications.waset.org/abstracts/search?q=lower%20approximations" title=" lower approximations"> lower approximations</a>, <a href="https://publications.waset.org/abstracts/search?q=upper%20approximations" title=" upper approximations"> upper approximations</a> </p> <a href="https://publications.waset.org/abstracts/27554/formulating-rough-approximations-in-information-tables-with-possibilistic-information" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27554.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">321</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">330</span> Approximate Solution to Non-Linear Schrödinger Equation with Harmonic Oscillator by Elzaki Decomposition Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emad%20K.%20Jaradat">Emad K. Jaradat</a>, <a href="https://publications.waset.org/abstracts/search?q=Ala%E2%80%99a%20Al-Faqih"> Ala’a Al-Faqih</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nonlinear Schrödinger equations are regularly experienced in numerous parts of science and designing. Varieties of analytical methods have been proposed for solving these equations. In this work, we construct an approximate solution for the nonlinear Schrodinger equations, with harmonic oscillator potential, by Elzaki Decomposition Method (EDM). To illustrate the effects of harmonic oscillator on the behavior wave function, nonlinear Schrodinger equation in one and two dimensions is provided. The results show that, it is more perfectly convenient and easy to apply the EDM in one- and two-dimensional Schrodinger equation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-linear%20Schrodinger%20equation" title="non-linear Schrodinger equation">non-linear Schrodinger equation</a>, <a href="https://publications.waset.org/abstracts/search?q=Elzaki%20decomposition%20method" title=" Elzaki decomposition method"> Elzaki decomposition method</a>, <a href="https://publications.waset.org/abstracts/search?q=harmonic%20oscillator" title=" harmonic oscillator"> harmonic oscillator</a>, <a href="https://publications.waset.org/abstracts/search?q=one%20and%20two-dimensional%20Schrodinger%20equation" title=" one and two-dimensional Schrodinger equation"> one and two-dimensional Schrodinger equation</a> </p> <a href="https://publications.waset.org/abstracts/102537/approximate-solution-to-non-linear-schrodinger-equation-with-harmonic-oscillator-by-elzaki-decomposition-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102537.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">329</span> A New Approach for Generalized First Derivative of Nonsmooth Functions Using Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Mehdi%20Mazarei">Mohammad Mehdi Mazarei</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Asghar%20Behroozpoor"> Ali Asghar Behroozpoor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we define an optimization problem corresponding to smooth and nonsmooth functions which its optimal solution is the first derivative of these functions in a domain. For this purpose, a linear programming problem corresponding to optimization problem is obtained. The optimal solution of this linear programming problem is the approximate generalized first derivative. In fact, we approximate generalized first derivative of nonsmooth functions as tailor series. We show the efficiency of our approach by some smooth and nonsmooth functions in some examples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=general%20derivative" title="general derivative">general derivative</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20problem" title=" optimization problem"> optimization problem</a>, <a href="https://publications.waset.org/abstracts/search?q=smooth%20and%20nonsmooth%20functions" title=" smooth and nonsmooth functions"> smooth and nonsmooth functions</a> </p> <a href="https://publications.waset.org/abstracts/19425/a-new-approach-for-generalized-first-derivative-of-nonsmooth-functions-using-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19425.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">557</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">328</span> A New Approach for Solving Fractional Coupled Pdes </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prashant%20Pandey">Prashant Pandey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present article, an eﬀective Laguerre collocation method is used to obtain the approximate solution of a system of coupled fractional-order non-linear reaction-advection-diﬀusion equation with prescribed initial and boundary conditions. In the proposed scheme, Laguerre polynomials are used together with an operational matrix and collocation method to obtain approximate solutions of the coupled system, so that our proposed model is converted into a system of algebraic equations which can be solved employing the Newton method. The solution proﬁles of the coupled system are presented graphically for diﬀerent particular cases. The salient feature of the present article is ﬁnding the stability analysis of the proposed method and also the demonstration of the lower variation of solute concentrations with respect to the column length in the fractional-order system compared to the integer-order system. To show the higher eﬃciency, reliability, and accuracy of the proposed scheme, a comparison between the numerical results of Burger’s coupled system and its existing analytical result is reported. There are high compatibility and consistency between the approximate solution and its exact solution to a higher order of accuracy. The exhibition of error analysis for each case through tables and graphs conﬁrms the super-linearly convergence rate of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20coupled%20PDE" title="fractional coupled PDE">fractional coupled PDE</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20and%20convergence%20analysis" title=" stability and convergence analysis"> stability and convergence analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=diffusion%20equation" title=" diffusion equation"> diffusion equation</a>, <a href="https://publications.waset.org/abstracts/search?q=Laguerre%20polynomials" title=" Laguerre polynomials"> Laguerre polynomials</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20method" title=" spectral method"> spectral method</a> </p> <a href="https://publications.waset.org/abstracts/125320/a-new-approach-for-solving-fractional-coupled-pdes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125320.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">145</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">327</span> Multi-Scale Control Model for Network Group Behavior</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuyuan%20Ma">Fuyuan Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Wang"> Ying Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xin%20Wang"> Xin Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Social networks have become breeding grounds for the rapid spread of rumors and malicious information, posing threats to societal stability and causing significant public harm. Existing research focuses on simulating the spread of information and its impact on users through propagation dynamics and applies methods such as greedy approximation strategies to approximate the optimal control solution at the global scale. However, the greedy strategy at the global scale may fall into locally optimal solutions, and the approximate simulation of information spread may accumulate more errors. Therefore, we propose a multi-scale control model for network group behavior, introducing individual and group scales on top of the greedy strategy’s global scale. At the individual scale, we calculate the propagation influence of nodes based on their structural attributes to alleviate the issue of local optimality. At the group scale, we conduct precise propagation simulations to avoid introducing cumulative errors from approximate calculations without increasing computational costs. Experimental results on three real-world datasets demonstrate the effectiveness of our proposed multi-scale model in controlling network group behavior. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=influence%20blocking%20maximization" title="influence blocking maximization">influence blocking maximization</a>, <a href="https://publications.waset.org/abstracts/search?q=competitive%20linear%20threshold%20model" title=" competitive linear threshold model"> competitive linear threshold model</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20networks" title=" social networks"> social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20group%20behavior" title=" network group behavior"> network group behavior</a> </p> <a href="https://publications.waset.org/abstracts/191264/multi-scale-control-model-for-network-group-behavior" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191264.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">21</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">326</span> Implicit Off-Grid Block Method for Solving Fourth and Fifth Order Ordinary Differential Equations Directly</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Olusola%20Ezekiel%20Abolarin">Olusola Ezekiel Abolarin</a>, <a href="https://publications.waset.org/abstracts/search?q=Gift%20E.%20Noah"> Gift E. Noah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research work considered an innovative procedure to numerically approximate higher-order Initial value problems (IVP) of ordinary differential equations (ODE) using the Legendre polynomial as the basis function. The proposed method is a half-step, self-starting Block integrator employed to approximate fourth and fifth order IVPs without reduction to lower order. The method was developed through a collocation and interpolation approach. The basic properties of the method, such as convergence, consistency and stability, were well investigated. Several test problems were considered, and the results compared favorably with both exact solutions and other existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=initial%20value%20problem" title="initial value problem">initial value problem</a>, <a href="https://publications.waset.org/abstracts/search?q=ordinary%20differential%20equation" title=" ordinary differential equation"> ordinary differential equation</a>, <a href="https://publications.waset.org/abstracts/search?q=implicit%20off-grid%20block%20method" title=" implicit off-grid block method"> implicit off-grid block method</a>, <a href="https://publications.waset.org/abstracts/search?q=collocation" title=" collocation"> collocation</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation" title=" interpolation"> interpolation</a> </p> <a href="https://publications.waset.org/abstracts/171485/implicit-off-grid-block-method-for-solving-fourth-and-fifth-order-ordinary-differential-equations-directly" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171485.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">84</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">325</span> Starting Order Eight Method Accurately for the Solution of First Order Initial Value Problems of Ordinary Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=James%20Adewale">James Adewale</a>, <a href="https://publications.waset.org/abstracts/search?q=Joshua%20Sunday"> Joshua Sunday</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we developed a linear multistep method, which is implemented in predictor corrector-method. The corrector is developed by method of collocation and interpretation of power series approximate solutions at some selected grid points, to give a continuous linear multistep method, which is evaluated at some selected grid points to give a discrete linear multistep method. The predictors were also developed by method of collocation and interpolation of power series approximate solution, to give a continuous linear multistep method. The continuous linear multistep method is then solved for the independent solution to give a continuous block formula, which is evaluated at some selected grid point to give discrete block method. Basic properties of the corrector were investigated and found to be zero stable, consistent and convergent. The efficiency of the method was tested on some linear, non-learn, oscillatory and stiff problems of first order, initial value problems of ordinary differential equations. The results were found to be better in terms of computer time and error bound when compared with the existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=predictor" title="predictor">predictor</a>, <a href="https://publications.waset.org/abstracts/search?q=corrector" title=" corrector"> corrector</a>, <a href="https://publications.waset.org/abstracts/search?q=collocation" title=" collocation"> collocation</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation" title=" interpolation"> interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20solution" title=" approximate solution"> approximate solution</a>, <a href="https://publications.waset.org/abstracts/search?q=independent%20solution" title=" independent solution"> independent solution</a>, <a href="https://publications.waset.org/abstracts/search?q=zero%20stable" title=" zero stable"> zero stable</a>, <a href="https://publications.waset.org/abstracts/search?q=consistent" title=" consistent"> consistent</a>, <a href="https://publications.waset.org/abstracts/search?q=convergent" title=" convergent"> convergent</a> </p> <a href="https://publications.waset.org/abstracts/17775/starting-order-eight-method-accurately-for-the-solution-of-first-order-initial-value-problems-of-ordinary-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17775.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">501</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">324</span> Nonlinear Analysis in Investigating the Complexity of Neurophysiological Data during Reflex Behavior</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Juliana%20A.%20Knocikova">Juliana A. Knocikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Methods of nonlinear signal analysis are based on finding that random behavior can arise in deterministic nonlinear systems with a few degrees of freedom. Considering the dynamical systems, entropy is usually understood as a rate of information production. Changes in temporal dynamics of physiological data are indicating evolving of system in time, thus a level of new signal pattern generation. During last decades, many algorithms were introduced to assess some patterns of physiological responses to external stimulus. However, the reflex responses are usually characterized by short periods of time. This characteristic represents a great limitation for usual methods of nonlinear analysis. To solve the problems of short recordings, parameter of approximate entropy has been introduced as a measure of system complexity. Low value of this parameter is reflecting regularity and predictability in analyzed time series. On the other side, increasing of this parameter means unpredictability and a random behavior, hence a higher system complexity. Reduced neurophysiological data complexity has been observed repeatedly when analyzing electroneurogram and electromyogram activities during defence reflex responses. Quantitative phrenic neurogram changes are also obvious during severe hypoxia, as well as during airway reflex episodes. Concluding, the approximate entropy parameter serves as a convenient tool for analysis of reflex behavior characterized by short lasting time series. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20entropy" title="approximate entropy">approximate entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=neurophysiological%20data" title=" neurophysiological data"> neurophysiological data</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20dynamics" title=" nonlinear dynamics"> nonlinear dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=reflex" title=" reflex"> reflex</a> </p> <a href="https://publications.waset.org/abstracts/13247/nonlinear-analysis-in-investigating-the-complexity-of-neurophysiological-data-during-reflex-behavior" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13247.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">300</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">323</span> The Complete Modal Derivatives</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sebastian%20Andersen">Sebastian Andersen</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20N.%20Poulsen"> Peter N. Poulsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of basis projection in the structural dynamic analysis is frequently applied. The purpose of the method is to improve the computational efficiency, while maintaining a high solution accuracy, by projection the governing equations onto a small set of carefully selected basis vectors. The present work considers basis projection in kinematic nonlinear systems with a focus on two widely used basis vectors; the system mode shapes and their modal derivatives. Particularly the latter basis vectors are given special attention since only approximate modal derivatives have been used until now. In the present work the complete modal derivatives, derived from perturbation methods, are presented and compared to the previously applied approximate modal derivatives. The correctness of the complete modal derivatives is illustrated by use of an example of a harmonically loaded kinematic nonlinear structure modeled by beam elements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=basis%20projection" title="basis projection">basis projection</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=kinematic%20nonlinearities" title=" kinematic nonlinearities"> kinematic nonlinearities</a>, <a href="https://publications.waset.org/abstracts/search?q=modal%20derivatives" title=" modal derivatives"> modal derivatives</a> </p> <a href="https://publications.waset.org/abstracts/92260/the-complete-modal-derivatives" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92260.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">237</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">322</span> Upon One Smoothing Problem in Project Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitri%20Golenko-Ginzburg">Dimitri Golenko-Ginzburg</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A CPM network project with deterministic activity durations, in which activities require homogenous resources with fixed capacities, is considered. The problem is to determine the optimal schedule of starting times for all network activities within their maximal allowable limits (in order not to exceed the network's critical time) to minimize the maximum required resources for the project at any point in time. In case when a non-critical activity may start only at discrete moments with the pregiven time span, the problem becomes NP-complete and an optimal solution may be obtained via a look-over algorithm. For the case when a look-over requires much computational time an approximate algorithm is suggested. The algorithm's performance ratio, i.e., the relative accuracy error, is determined. Experimentation has been undertaken to verify the suggested algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=resource%20smoothing%20problem" title="resource smoothing problem">resource smoothing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=CPM%20network" title=" CPM network"> CPM network</a>, <a href="https://publications.waset.org/abstracts/search?q=lookover%20algorithm" title=" lookover algorithm"> lookover algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=lexicographical%20order" title=" lexicographical order"> lexicographical order</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20algorithm" title=" approximate algorithm"> approximate algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=accuracy%20estimate" title=" accuracy estimate"> accuracy estimate</a> </p> <a href="https://publications.waset.org/abstracts/15779/upon-one-smoothing-problem-in-project-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15779.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">302</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">321</span> The Construction of the Semigroup Which Is Chernoff Equivalent to Statistical Mixture of Quantizations for the Case of the Harmonic Oscillator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leonid%20Borisov">Leonid Borisov</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuri%20Orlov"> Yuri Orlov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We obtain explicit formulas of finitely multiple approximations of the equilibrium density matrix for the case of the harmonic oscillator using Chernoff's theorem and the notion of semigroup which is Chernoff equivalent to average semigroup. Also we found explicit formulas for the corresponding approximate Wigner functions and average values of the observable. We consider a superposition of τ -quantizations representing a wide class of linear quantizations. We show that the convergence of the approximations of the average values of the observable is not uniform with respect to the Gibbs parameter. This does not allow to represent approximate expression as the sum of the exact limits and small deviations evenly throughout the temperature range with a given order of approximation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chernoff%20theorem" title="Chernoff theorem">Chernoff theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=Feynman%20formulas" title=" Feynman formulas"> Feynman formulas</a>, <a href="https://publications.waset.org/abstracts/search?q=finitely%20multiple%20approximation" title=" finitely multiple approximation"> finitely multiple approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=harmonic%20oscillator" title=" harmonic oscillator"> harmonic oscillator</a>, <a href="https://publications.waset.org/abstracts/search?q=Wigner%20function" title=" Wigner function"> Wigner function</a> </p> <a href="https://publications.waset.org/abstracts/23625/the-construction-of-the-semigroup-which-is-chernoff-equivalent-to-statistical-mixture-of-quantizations-for-the-case-of-the-harmonic-oscillator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23625.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">439</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">320</span> Constant Order Predictor Corrector Method for the Solution of Modeled Problems of First Order IVPs of ODEs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20James">A. A. James</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20O.%20Adesanya"> A. O. Adesanya</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Odekunle"> M. R. Odekunle</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20G.%20Yakubu"> D. G. Yakubu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the development of one step, five hybrid point method for the solution of first order initial value problems. We adopted the method of collocation and interpolation of power series approximate solution to generate a continuous linear multistep method. The continuous linear multistep method was evaluated at selected grid points to give the discrete linear multistep method. The method was implemented using a constant order predictor of order seven over an overlapping interval. The basic properties of the derived corrector was investigated and found to be zero stable, consistent and convergent. The region of absolute stability was also investigated. The method was tested on some numerical experiments and found to compete favorably with the existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interpolation" title="interpolation">interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20solution" title=" approximate solution"> approximate solution</a>, <a href="https://publications.waset.org/abstracts/search?q=collocation" title=" collocation"> collocation</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20system" title=" differential system"> differential system</a>, <a href="https://publications.waset.org/abstracts/search?q=half%20step" title=" half step"> half step</a>, <a href="https://publications.waset.org/abstracts/search?q=converges" title=" converges"> converges</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20method" title=" block method"> block method</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency" title=" efficiency"> efficiency</a> </p> <a href="https://publications.waset.org/abstracts/1645/constant-order-predictor-corrector-method-for-the-solution-of-modeled-problems-of-first-order-ivps-of-odes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1645.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">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">319</span> Variable-Fidelity Surrogate Modelling with Kriging</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Selvakumar%20Ulaganathan">Selvakumar Ulaganathan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivo%20Couckuyt"> Ivo Couckuyt</a>, <a href="https://publications.waset.org/abstracts/search?q=Francesco%20Ferranti"> Francesco Ferranti</a>, <a href="https://publications.waset.org/abstracts/search?q=Tom%20Dhaene"> Tom Dhaene</a>, <a href="https://publications.waset.org/abstracts/search?q=Eric%20Laermans"> Eric Laermans</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Variable-fidelity surrogate modelling offers an efficient way to approximate function data available in multiple degrees of accuracy each with varying computational cost. In this paper, a Kriging-based variable-fidelity surrogate modelling approach is introduced to approximate such deterministic data. Initially, individual Kriging surrogate models, which are enhanced with gradient data of different degrees of accuracy, are constructed. Then these Gradient enhanced Kriging surrogate models are strategically coupled using a recursive CoKriging formulation to provide an accurate surrogate model for the highest fidelity data. While, intuitively, gradient data is useful to enhance the accuracy of surrogate models, the primary motivation behind this work is to investigate if it is also worthwhile incorporating gradient data of varying degrees of accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kriging" title="Kriging">Kriging</a>, <a href="https://publications.waset.org/abstracts/search?q=CoKriging" title=" CoKriging"> CoKriging</a>, <a href="https://publications.waset.org/abstracts/search?q=Surrogate%20modelling" title=" Surrogate modelling"> Surrogate modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=Variable-%20fidelity%20modelling" title=" Variable- fidelity modelling"> Variable- fidelity modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=Gradients" title=" Gradients"> Gradients</a> </p> <a href="https://publications.waset.org/abstracts/19031/variable-fidelity-surrogate-modelling-with-kriging" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19031.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">558</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>