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: polynomial regression</title> <meta name="description" content="Search results for: polynomial regression"> <meta name="keywords" content="polynomial regression"> <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="polynomial regression" 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="polynomial regression"> <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> 3438</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: polynomial regression</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3438</span> Segmentation of Piecewise Polynomial Regression Model by Using Reversible Jump MCMC Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suparman">Suparman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Piecewise polynomial regression model is very flexible model for modeling the data. If the piecewise polynomial regression model is matched against the data, its parameters are not generally known. This paper studies the parameter estimation problem of piecewise polynomial regression model. The method which is used to estimate the parameters of the piecewise polynomial regression model is Bayesian method. Unfortunately, the Bayes estimator cannot be found analytically. Reversible jump MCMC algorithm is proposed to solve this problem. Reversible jump MCMC algorithm generates the Markov chain that converges to the limit distribution of the posterior distribution of piecewise polynomial regression model parameter. The resulting Markov chain is used to calculate the Bayes estimator for the parameters of piecewise polynomial regression model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=piecewise%20regression" title="piecewise regression">piecewise regression</a>, <a href="https://publications.waset.org/abstracts/search?q=bayesian" title=" bayesian"> bayesian</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20jump%20MCMC" title=" reversible jump MCMC"> reversible jump MCMC</a>, <a href="https://publications.waset.org/abstracts/search?q=segmentation" title=" segmentation"> segmentation</a> </p> <a href="https://publications.waset.org/abstracts/46201/segmentation-of-piecewise-polynomial-regression-model-by-using-reversible-jump-mcmc-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46201.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">373</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">3437</span> A Comparative Study on Sampling Techniques of Polynomial Regression Model Based Stochastic Free Vibration of Composite Plates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Dey">S. Dey</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Mukhopadhyay"> T. Mukhopadhyay</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Adhikari"> S. Adhikari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an exhaustive comparative investigation on sampling techniques of polynomial regression model based stochastic natural frequency of composite plates. Both individual and combined variations of input parameters are considered to map the computational time and accuracy of each modelling techniques. The finite element formulation of composites is capable to deal with both correlated and uncorrelated random input variables such as fibre parameters and material properties. The results obtained by Polynomial regression (PR) using different sampling techniques are compared. Depending on the suitability of sampling techniques such as 2k Factorial designs, Central composite design, A-Optimal design, I-Optimal, D-Optimal, Taguchi’s orthogonal array design, Box-Behnken design, Latin hypercube sampling, sobol sequence are illustrated. Statistical analysis of the first three natural frequencies is presented to compare the results and its performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=composite%20plate" title="composite plate">composite plate</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20frequency" title=" natural frequency"> natural frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20regression%20model" title=" polynomial regression model"> polynomial regression model</a>, <a href="https://publications.waset.org/abstracts/search?q=sampling%20technique" title=" sampling technique"> sampling technique</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty%20quantification" title=" uncertainty quantification"> uncertainty quantification</a> </p> <a href="https://publications.waset.org/abstracts/24714/a-comparative-study-on-sampling-techniques-of-polynomial-regression-model-based-stochastic-free-vibration-of-composite-plates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24714.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">513</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">3436</span> Chebyshev Polynomials Relad with Fibonacci and Lucas Polynomials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vandana%20N.%20Purav">Vandana N. Purav</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fibonacci and Lucas polynomials are special cases of Chebyshev polynomial. There are two types of Chebyshev polynomials, a Chebyshev polynomial of first kind and a Chebyshev polynomial of second kind. Chebyshev polynomial of second kind can be derived from the Chebyshev polynomial of first kind. Chebyshev polynomial is a polynomial of degree n and satisfies a second order homogenous differential equation. We consider the difference equations which are related with Chebyshev, Fibonacci and Lucas polynomias. Thus Chebyshev polynomial of second kind play an important role in finding the recurrence relations with Fibonacci and Lucas polynomials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=" title=""></a> </p> <a href="https://publications.waset.org/abstracts/24133/chebyshev-polynomials-relad-with-fibonacci-and-lucas-polynomials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24133.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">368</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">3435</span> Transformations between Bivariate Polynomial Bases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitris%20Varsamis">Dimitris Varsamis</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicholas%20Karampetakis"> Nicholas Karampetakis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is well known that any interpolating polynomial P(x,y) on the vector space Pn,m of two-variable polynomials with degree less than n in terms of x and less than m in terms of y has various representations that depends on the basis of Pn,m that we select i.e. monomial, Newton and Lagrange basis etc. The aim of this paper is twofold: a) to present transformations between the coordinates of the polynomial P(x,y) in the aforementioned basis and b) to present transformations between these bases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bivariate%20interpolation%20polynomial" title="bivariate interpolation polynomial">bivariate interpolation polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20basis" title=" polynomial basis"> polynomial basis</a>, <a href="https://publications.waset.org/abstracts/search?q=transformations" title=" transformations"> transformations</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolating%20polynomial" title=" interpolating polynomial"> interpolating polynomial</a> </p> <a href="https://publications.waset.org/abstracts/14542/transformations-between-bivariate-polynomial-bases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14542.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">405</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3434</span> From Convexity in Graphs to Polynomial Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ladznar%20S.%20Laja">Ladznar S. Laja</a>, <a href="https://publications.waset.org/abstracts/search?q=Rosalio%20G.%20Artes"> Rosalio G. Artes</a>, <a href="https://publications.waset.org/abstracts/search?q=Jr."> Jr.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20subgraph" title="convex subgraph">convex subgraph</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20index" title=" convex index"> convex index</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20function" title=" generating function"> generating function</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a> </p> <a href="https://publications.waset.org/abstracts/9019/from-convexity-in-graphs-to-polynomial-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9019.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">215</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">3433</span> Introduction to Paired Domination Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Puttaswamy">Puttaswamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Anwar%20Alwardi"> Anwar Alwardi</a>, <a href="https://publications.waset.org/abstracts/search?q=Nayaka%20S.%20R."> Nayaka S. R.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=domination%20polynomial" title="domination polynomial">domination polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=paired%20dominating%20set" title=" paired dominating set"> paired dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=paired%20domination%20number" title=" paired domination number"> paired domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=paired%20domination%20polynomial" title=" paired domination polynomial"> paired domination polynomial</a> </p> <a href="https://publications.waset.org/abstracts/52964/introduction-to-paired-domination-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52964.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">232</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">3432</span> On the Zeros of the Degree Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20R.%20Nayaka">S. R. Nayaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Putta%20Swamy"> Putta Swamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20polynomial" title="degree polynomial">degree polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=regular%20graph" title=" regular graph"> regular graph</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20and%20maximum%20degree" title=" minimum and maximum degree"> minimum and maximum degree</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operations" title=" graph operations"> graph operations</a> </p> <a href="https://publications.waset.org/abstracts/56602/on-the-zeros-of-the-degree-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56602.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">249</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">3431</span> Generic Polynomial of Integers and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nidal%20Ali">Nidal Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Consider an algebraic number field K of degree n, A0 K is its ring of integers and a prime number p inert in K. Let F(u1, . . . , un, x) be the generic polynomial of integers of K. We will study in advance the stability of this polynomial and then, we will apply it in order to obtain all the monic irreducible polynomials in Fp[x] of degree d dividing n. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generic%20polynomial" title="generic polynomial">generic polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=irreducibility" title=" irreducibility"> irreducibility</a>, <a href="https://publications.waset.org/abstracts/search?q=iteration" title=" iteration"> iteration</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/abstracts/search?q=inert%20prime" title=" inert prime"> inert prime</a>, <a href="https://publications.waset.org/abstracts/search?q=totally%20ramified" title=" totally ramified"> totally ramified</a> </p> <a href="https://publications.waset.org/abstracts/16820/generic-polynomial-of-integers-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16820.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">346</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">3430</span> The K-Distance Neighborhood Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soner%20Nandappa%20D.">Soner Nandappa D.</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Mohammed%20Naji"> Ahmed Mohammed Naji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vertex%20degrees" title="vertex degrees">vertex degrees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20in%20graphs" title=" distance in graphs"> distance in graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operation" title=" graph operation"> graph operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Nk-polynomials" title=" Nk-polynomials"> Nk-polynomials</a> </p> <a href="https://publications.waset.org/abstracts/52946/the-k-distance-neighborhood-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52946.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">549</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">3429</span> Modeling Standpipe Pressure Using Multivariable Regression Analysis by Combining Drilling Parameters and a Herschel-Bulkley Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seydou%20Sinde">Seydou Sinde</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aims of this paper are to formulate mathematical expressions that can be used to estimate the standpipe pressure (SPP). The developed formulas take into account the main factors that, directly or indirectly, affect the behavior of SPP values. Fluid rheology and well hydraulics are some of these essential factors. Mud Plastic viscosity, yield point, flow power, consistency index, flow rate, drillstring, and annular geometries are represented by the frictional pressure (Pf), which is one of the input independent parameters and is calculated, in this paper, using Herschel-Bulkley rheological model. Other input independent parameters include the rate of penetration (ROP), applied load or weight on the bit (WOB), bit revolutions per minute (RPM), bit torque (TRQ), and hole inclination and direction coupled in the hole curvature or dogleg (DL). The technique of repeating parameters and Buckingham PI theorem are used to reduce the number of the input independent parameters into the dimensionless revolutions per minute (RPMd), the dimensionless torque (TRQd), and the dogleg, which is already in the dimensionless form of radians. Multivariable linear and polynomial regression technique using PTC Mathcad Prime 4.0 is used to analyze and determine the exact relationships between the dependent parameter, which is SPP, and the remaining three dimensionless groups. Three models proved sufficiently satisfactory to estimate the standpipe pressure: multivariable linear regression model 1 containing three regression coefficients for vertical wells; multivariable linear regression model 2 containing four regression coefficients for deviated wells; and multivariable polynomial quadratic regression model containing six regression coefficients for both vertical and deviated wells. Although that the linear regression model 2 (with four coefficients) is relatively more complex and contains an additional term over the linear regression model 1 (with three coefficients), the former did not really add significant improvements to the later except for some minor values. Thus, the effect of the hole curvature or dogleg is insignificant and can be omitted from the input independent parameters without significant losses of accuracy. The polynomial quadratic regression model is considered the most accurate model due to its relatively higher accuracy for most of the cases. Data of nine wells from the Middle East were used to run the developed models with satisfactory results provided by all of them, even if the multivariable polynomial quadratic regression model gave the best and most accurate results. Development of these models is useful not only to monitor and predict, with accuracy, the values of SPP but also to early control and check for the integrity of the well hydraulics as well as to take the corrective actions should any unexpected problems appear, such as pipe washouts, jet plugging, excessive mud losses, fluid gains, kicks, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=standpipe" title="standpipe">standpipe</a>, <a href="https://publications.waset.org/abstracts/search?q=pressure" title=" pressure"> pressure</a>, <a href="https://publications.waset.org/abstracts/search?q=hydraulics" title=" hydraulics"> hydraulics</a>, <a href="https://publications.waset.org/abstracts/search?q=nondimensionalization" title=" nondimensionalization"> nondimensionalization</a>, <a href="https://publications.waset.org/abstracts/search?q=parameters" title=" parameters"> parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=regression" title=" regression"> regression</a> </p> <a href="https://publications.waset.org/abstracts/157737/modeling-standpipe-pressure-using-multivariable-regression-analysis-by-combining-drilling-parameters-and-a-herschel-bulkley-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157737.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">3428</span> SVM-Based Modeling of Mass Transfer Potential of Multiple Plunging Jets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Surinder%20Deswal">Surinder Deswal</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahesh%20Pal"> Mahesh Pal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper investigates the potential of support vector machines based regression approach to model the mass transfer capacity of multiple plunging jets, both vertical (θ = 90°) and inclined (θ = 60°). The data set used in this study consists of four input parameters with a total of eighty eight cases. For testing, tenfold cross validation was used. Correlation coefficient values of 0.971 and 0.981 (root mean square error values of 0.0025 and 0.0020) were achieved by using polynomial and radial basis kernel functions based support vector regression respectively. Results suggest an improved performance by radial basis function in comparison to polynomial kernel based support vector machines. The estimated overall mass transfer coefficient, by both the kernel functions, is in good agreement with actual experimental values (within a scatter of ±15 %); thereby suggesting the utility of support vector machines based regression approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mass%20transfer" title="mass transfer">mass transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20plunging%20jets" title=" multiple plunging jets"> multiple plunging jets</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machines" title=" support vector machines"> support vector machines</a>, <a href="https://publications.waset.org/abstracts/search?q=ecological%20sciences" title=" ecological sciences"> ecological sciences</a> </p> <a href="https://publications.waset.org/abstracts/9906/svm-based-modeling-of-mass-transfer-potential-of-multiple-plunging-jets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9906.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">464</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">3427</span> Hosoya Polynomials of Zero-Divisor Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Jalil%20M.%20Khalaf">Abdul Jalil M. Khalaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Esraa%20M.%20Kadhim"> Esraa M. Kadhim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x= 1 is equal to the Wiener index and second derivative at x=1 is equal to the Hyper-Wiener index. In this paper we study the Hosoya polynomial of zero-divisor graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hosoya%20polynomial" title="Hosoya polynomial">Hosoya polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=wiener%20index" title=" wiener index"> wiener index</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyper-Wiener%20index" title=" Hyper-Wiener index"> Hyper-Wiener index</a>, <a href="https://publications.waset.org/abstracts/search?q=zero-divisor%20graphs" title=" zero-divisor graphs"> zero-divisor graphs</a> </p> <a href="https://publications.waset.org/abstracts/27159/hosoya-polynomials-of-zero-divisor-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27159.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">531</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">3426</span> Modeling Aeration of Sharp Crested Weirs by Using Support Vector Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arun%20Goel">Arun Goel </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present paper attempts to investigate the prediction of air entrainment rate and aeration efficiency of a free over-fall jets issuing from a triangular sharp crested weir by using regression based modelling. The empirical equations, support vector machine (polynomial and radial basis function) models and the linear regression techniques were applied on the triangular sharp crested weirs relating the air entrainment rate and the aeration efficiency to the input parameters namely drop height, discharge, and vertex angle. It was observed that there exists a good agreement between the measured values and the values obtained using empirical equations, support vector machine (Polynomial and rbf) models, and the linear regression techniques. The test results demonstrated that the SVM based (Poly & rbf) model also provided acceptable prediction of the measured values with reasonable accuracy along with empirical equations and linear regression techniques in modelling the air entrainment rate and the aeration efficiency of a free over-fall jets issuing from triangular sharp crested weir. Further sensitivity analysis has also been performed to study the impact of input parameter on the output in terms of air entrainment rate and aeration efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=air%20entrainment%20rate" title="air entrainment rate">air entrainment rate</a>, <a href="https://publications.waset.org/abstracts/search?q=dissolved%20oxygen" title=" dissolved oxygen"> dissolved oxygen</a>, <a href="https://publications.waset.org/abstracts/search?q=weir" title=" weir"> weir</a>, <a href="https://publications.waset.org/abstracts/search?q=SVM" title=" SVM"> SVM</a>, <a href="https://publications.waset.org/abstracts/search?q=regression" title=" regression"> regression</a> </p> <a href="https://publications.waset.org/abstracts/3752/modeling-aeration-of-sharp-crested-weirs-by-using-support-vector-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3752.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">436</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">3425</span> Optimization of Slider Crank Mechanism Using Design of Experiments and Multi-Linear Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Galal%20Elkobrosy">Galal Elkobrosy</a>, <a href="https://publications.waset.org/abstracts/search?q=Amr%20M.%20Abdelrazek"> Amr M. Abdelrazek</a>, <a href="https://publications.waset.org/abstracts/search?q=Bassuny%20M.%20Elsouhily"> Bassuny M. Elsouhily</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20E.%20Khidr"> Mohamed E. Khidr</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Crank shaft length, connecting rod length, crank angle, engine rpm, cylinder bore, mass of piston and compression ratio are the inputs that can control the performance of the slider crank mechanism and then its efficiency. Several combinations of these seven inputs are used and compared. The throughput engine torque predicted by the simulation is analyzed through two different regression models, with and without interaction terms, developed according to multi-linear regression using LU decomposition to solve system of algebraic equations. These models are validated. A regression model in seven inputs including their interaction terms lowered the polynomial degree from 3<sup>rd</sup> degree to 1<sup>st </sup>degree and suggested valid predictions and stable explanations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design%20of%20experiments" title="design of experiments">design of experiments</a>, <a href="https://publications.waset.org/abstracts/search?q=regression%20analysis" title=" regression analysis"> regression analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=SI%20engine" title=" SI engine"> SI engine</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20modeling" title=" statistical modeling"> statistical modeling</a> </p> <a href="https://publications.waset.org/abstracts/90228/optimization-of-slider-crank-mechanism-using-design-of-experiments-and-multi-linear-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/90228.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">186</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">3424</span> Modeling and Simulation of a CMOS-Based Analog Function Generator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Madina%20Hamiane">Madina Hamiane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modelling and simulation of an analogy function generator is presented based on a polynomial expansion model. The proposed function generator model is based on a 10th order polynomial approximation of any of the required functions. The polynomial approximations of these functions can then be implemented using basic CMOS circuit blocks. In this paper, a circuit model is proposed that can simultaneously generate many different mathematical functions. The circuit model is designed and simulated with HSPICE and its performance is demonstrated through the simulation of a number of non-linear functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modelling%20and%20simulation" title="modelling and simulation">modelling and simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=analog%20function%20generator" title=" analog function generator"> analog function generator</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20approximation" title=" polynomial approximation"> polynomial approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=CMOS%20transistors" title=" CMOS transistors"> CMOS transistors</a> </p> <a href="https://publications.waset.org/abstracts/7108/modeling-and-simulation-of-a-cmos-based-analog-function-generator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7108.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">459</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">3423</span> Image Compression Based on Regression SVM and Biorthogonal Wavelets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zikiou%20Nadia">Zikiou Nadia</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahdir%20Mourad"> Lahdir Mourad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ameur%20Soltane"> Ameur Soltane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an effective method for image compression based on SVM Regression (SVR), with three different kernels, and biorthogonal 2D Discrete Wavelet Transform. SVM regression could learn dependency from training data and compressed using fewer training points (support vectors) to represent the original data and eliminate the redundancy. Biorthogonal wavelet has been used to transform the image and the coefficients acquired are then trained with different kernels SVM (Gaussian, Polynomial, and Linear). Run-length and Arithmetic coders are used to encode the support vectors and its corresponding weights, obtained from the SVM regression. The peak signal noise ratio (PSNR) and their compression ratios of several test images, compressed with our algorithm, with different kernels are presented. Compared with other kernels, Gaussian kernel achieves better image quality. Experimental results show that the compression performance of our method gains much improvement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title="image compression">image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=2D%20discrete%20wavelet%20transform%20%28DWT-2D%29" title=" 2D discrete wavelet transform (DWT-2D)"> 2D discrete wavelet transform (DWT-2D)</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20regression%20%28SVR%29" title=" support vector regression (SVR)"> support vector regression (SVR)</a>, <a href="https://publications.waset.org/abstracts/search?q=SVM%20Kernels" title=" SVM Kernels"> SVM Kernels</a>, <a href="https://publications.waset.org/abstracts/search?q=run-length" title=" run-length"> run-length</a>, <a href="https://publications.waset.org/abstracts/search?q=arithmetic%20coding" title=" arithmetic coding"> arithmetic coding</a> </p> <a href="https://publications.waset.org/abstracts/17954/image-compression-based-on-regression-svm-and-biorthogonal-wavelets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17954.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">382</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">3422</span> Stabilization Control of the Nonlinear AIDS Model Based on the Theory of Polynomial Fuzzy Control Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahrokh%20Barati">Shahrokh Barati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduced AIDS disease at first, then proposed dynamic model illustrate its progress, after expression of a short history of nonlinear modeling by polynomial phasing systems, we considered the stability conditions of the systems, which contained a huge amount of researches in order to modeling and control of AIDS in dynamic nonlinear form, in this approach using a frame work of control any polynomial phasing modeling system which have been generalized by part of phasing model of T-S, in order to control the system in better way, the stability conditions were achieved based on polynomial functions, then we focused to design the appropriate controller, firstly we considered the equilibrium points of system and their conditions and in order to examine changes in the parameters, we presented polynomial phase model that was the generalized approach rather than previous Takagi Sugeno models, then with using case we evaluated the equations in both open loop and close loop and with helping the controlling feedback, the close loop equations of system were calculated, to simulate nonlinear model of AIDS disease, we used polynomial phasing controller output that was capable to make the parameters of a nonlinear system to follow a sustainable reference model properly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=polynomial%20fuzzy" title="polynomial fuzzy">polynomial fuzzy</a>, <a href="https://publications.waset.org/abstracts/search?q=AIDS" title=" AIDS"> AIDS</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20AIDS%20model" title=" nonlinear AIDS model"> nonlinear AIDS model</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20control%20systems" title=" fuzzy control systems"> fuzzy control systems</a> </p> <a href="https://publications.waset.org/abstracts/36231/stabilization-control-of-the-nonlinear-aids-model-based-on-the-theory-of-polynomial-fuzzy-control-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36231.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">468</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">3421</span> Incorporating Anomaly Detection in a Digital Twin Scenario Using Symbolic Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manuel%20Alves">Manuel Alves</a>, <a href="https://publications.waset.org/abstracts/search?q=Angelica%20Reis"> Angelica Reis</a>, <a href="https://publications.waset.org/abstracts/search?q=Armindo%20Lobo"> Armindo Lobo</a>, <a href="https://publications.waset.org/abstracts/search?q=Valdemar%20Leiras"> Valdemar Leiras</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In industry 4.0, it is common to have a lot of sensor data. In this deluge of data, hints of possible problems are difficult to spot. The digital twin concept aims to help answer this problem, but it is mainly used as a monitoring tool to handle the visualisation of data. Failure detection is of paramount importance in any industry, and it consumes a lot of resources. Any improvement in this regard is of tangible value to the organisation. The aim of this paper is to add the ability to forecast test failures, curtailing detection times. To achieve this, several anomaly detection algorithms were compared with a symbolic regression approach. To this end, Isolation Forest, One-Class SVM and an auto-encoder have been explored. For the symbolic regression PySR library was used. The first results show that this approach is valid and can be added to the tools available in this context as a low resource anomaly detection method since, after training, the only requirement is the calculation of a polynomial, a useful feature in the digital twin context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title="anomaly detection">anomaly detection</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20twin" title=" digital twin"> digital twin</a>, <a href="https://publications.waset.org/abstracts/search?q=industry%204.0" title=" industry 4.0"> industry 4.0</a>, <a href="https://publications.waset.org/abstracts/search?q=symbolic%20regression" title=" symbolic regression"> symbolic regression</a> </p> <a href="https://publications.waset.org/abstracts/151469/incorporating-anomaly-detection-in-a-digital-twin-scenario-using-symbolic-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151469.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">120</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3420</span> Nonparametric Truncated Spline Regression Model on the Data of Human Development Index in Indonesia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kornelius%20Ronald%20Demu">Kornelius Ronald Demu</a>, <a href="https://publications.waset.org/abstracts/search?q=Dewi%20Retno%20Sari%20Saputro"> Dewi Retno Sari Saputro</a>, <a href="https://publications.waset.org/abstracts/search?q=Purnami%20Widyaningsih"> Purnami Widyaningsih</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Human Development Index (HDI) is a standard measurement for a country's human development. Several factors may have influenced it, such as life expectancy, gross domestic product (GDP) based on the province's annual expenditure, the number of poor people, and the percentage of an illiterate people. The scatter plot between HDI and the influenced factors show that the plot does not follow a specific pattern or form. Therefore, the HDI's data in Indonesia can be applied with a nonparametric regression model. The estimation of the regression curve in the nonparametric regression model is flexible because it follows the shape of the data pattern. One of the nonparametric regression's method is a truncated spline. Truncated spline regression is one of the nonparametric approach, which is a modification of the segmented polynomial functions. The estimator of a truncated spline regression model was affected by the selection of the optimal knots point. Knot points is a focus point of spline truncated functions. The optimal knots point was determined by the minimum value of generalized cross validation (GCV). In this article were applied the data of Human Development Index with a truncated spline nonparametric regression model. The results of this research were obtained the best-truncated spline regression model to the HDI's data in Indonesia with the combination of optimal knots point 5-5-5-4. Life expectancy and the percentage of an illiterate people were the significant factors depend to the HDI in Indonesia. The coefficient of determination is 94.54%. This means the regression model is good enough to applied on the data of HDI in Indonesia. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20cross%20validation%20%28GCV%29" title="generalized cross validation (GCV)">generalized cross validation (GCV)</a>, <a href="https://publications.waset.org/abstracts/search?q=Human%20Development%20Index%20%28HDI%29" title=" Human Development Index (HDI)"> Human Development Index (HDI)</a>, <a href="https://publications.waset.org/abstracts/search?q=knots%20point" title=" knots point"> knots point</a>, <a href="https://publications.waset.org/abstracts/search?q=nonparametric%20regression" title=" nonparametric regression"> nonparametric regression</a>, <a href="https://publications.waset.org/abstracts/search?q=truncated%20spline" title=" truncated spline"> truncated spline</a> </p> <a href="https://publications.waset.org/abstracts/73701/nonparametric-truncated-spline-regression-model-on-the-data-of-human-development-index-in-indonesia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73701.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">339</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">3419</span> On CR-Structure and F-Structure Satisfying Polynomial Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manisha%20Kankarej">Manisha Kankarej</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to show a relation between CR structure and F-structure satisfying polynomial equation. In this paper, we have checked the significance of CR structure and F-structure on Integrability conditions and Nijenhuis tensor. It was proved that all the properties of Integrability conditions and Nijenhuis tensor are satisfied by CR structures and F-structure satisfying polynomial equation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CR-submainfolds" title="CR-submainfolds">CR-submainfolds</a>, <a href="https://publications.waset.org/abstracts/search?q=CR-structure" title=" CR-structure"> CR-structure</a>, <a href="https://publications.waset.org/abstracts/search?q=integrability%20condition" title=" integrability condition"> integrability condition</a>, <a href="https://publications.waset.org/abstracts/search?q=Nijenhuis%20tensor" title=" Nijenhuis tensor"> Nijenhuis tensor</a> </p> <a href="https://publications.waset.org/abstracts/63709/on-cr-structure-and-f-structure-satisfying-polynomial-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63709.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">526</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">3418</span> Stress Solitary Waves Generated by a Second-Order Polynomial Constitutive Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tsun-Hui%20Huang">Tsun-Hui Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shyue-Cheng%20Yang"> Shyue-Cheng Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chiou-Fen%20Shieha"> Chiou-Fen Shieha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a nonlinear constitutive law and a curve fitting, two relationships between the stress-strain and the shear stress-strain for sandstone material were used to obtain a second-order polynomial constitutive equation. Based on the established polynomial constitutive equations and Newton’s second law, a mathematical model of the non-homogeneous nonlinear wave equation under an external pressure was derived. The external pressure can be assumed as an impulse function to simulate a real earthquake source. A displacement response under nonlinear two-dimensional wave equation was determined by a numerical method and computer-aided software. The results show that a suit pressure in the sandstone generates the phenomenon of stress solitary waves. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=polynomial%20constitutive%20equation" title="polynomial constitutive equation">polynomial constitutive equation</a>, <a href="https://publications.waset.org/abstracts/search?q=solitary" title=" solitary"> solitary</a>, <a href="https://publications.waset.org/abstracts/search?q=stress%20solitary%20waves" title=" stress solitary waves"> stress solitary waves</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20constitutive%20law" title=" nonlinear constitutive law"> nonlinear constitutive law</a> </p> <a href="https://publications.waset.org/abstracts/10185/stress-solitary-waves-generated-by-a-second-order-polynomial-constitutive-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10185.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">497</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">3417</span> Explicit Chain Homotopic Function to Compute Hochschild Homology of the Polynomial Algebra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zuhier%20Altawallbeh">Zuhier Altawallbeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an explicit homotopic function is constructed to compute the Hochschild homology of a finite dimensional free k-module V. Because the polynomial algebra is of course fundamental in the computation of the Hochschild homology HH and the cyclic homology CH of commutative algebras, we concentrate our work to compute HH of the polynomial algebra.by providing certain homotopic function. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hochschild%20homology" title="hochschild homology">hochschild homology</a>, <a href="https://publications.waset.org/abstracts/search?q=homotopic%20function" title=" homotopic function"> homotopic function</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20and%20projective%20modules" title=" free and projective modules"> free and projective modules</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20resolution" title=" free resolution"> free resolution</a>, <a href="https://publications.waset.org/abstracts/search?q=exterior%20algebra" title=" exterior algebra"> exterior algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20algebra" title=" symmetric algebra"> symmetric algebra</a> </p> <a href="https://publications.waset.org/abstracts/20251/explicit-chain-homotopic-function-to-compute-hochschild-homology-of-the-polynomial-algebra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20251.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">405</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3416</span> Forward Stable Computation of Roots of Real Polynomials with Only Real Distinct Roots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nevena%20Jakov%C4%8Devi%C4%87%20Stor">Nevena Jakovčević Stor</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Slapni%C4%8Dar"> Ivan Slapničar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=roots%20of%20polynomials" title="roots of polynomials">roots of polynomials</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20decomposition" title=" eigenvalue decomposition"> eigenvalue decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=arrowhead%20matrix" title=" arrowhead matrix"> arrowhead matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20relative%20accuracy" title=" high relative accuracy"> high relative accuracy</a> </p> <a href="https://publications.waset.org/abstracts/40100/forward-stable-computation-of-roots-of-real-polynomials-with-only-real-distinct-roots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40100.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">418</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">3415</span> Identification of Nonlinear Systems Structured by Hammerstein-Wiener Model </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Brouri">A. Brouri</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Giri"> F. Giri</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Mkhida"> A. Mkhida</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Elkarkri"> A. Elkarkri</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20L.%20Chhibat"> M. L. Chhibat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Standard Hammerstein-Wiener models consist of a linear subsystem sandwiched by two memoryless nonlinearities. Presently, the linear subsystem is allowed to be parametric or not, continuous- or discrete-time. The input and output nonlinearities are polynomial and may be noninvertible. A two-stage identification method is developed such the parameters of all nonlinear elements are estimated first using the Kozen-Landau polynomial decomposition algorithm. The obtained estimates are then based upon in the identification of the linear subsystem, making use of suitable pre-ad post-compensators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20system%20identification" title="nonlinear system identification">nonlinear system identification</a>, <a href="https://publications.waset.org/abstracts/search?q=Hammerstein-Wiener%20systems" title=" Hammerstein-Wiener systems"> Hammerstein-Wiener systems</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20identification" title=" frequency identification"> frequency identification</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20decomposition" title=" polynomial decomposition"> polynomial decomposition</a> </p> <a href="https://publications.waset.org/abstracts/7969/identification-of-nonlinear-systems-structured-by-hammerstein-wiener-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7969.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">3414</span> Application of Chinese Remainder Theorem to Find The Messages Sent in Broadcast</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ayubi%20Wirara">Ayubi Wirara</a>, <a href="https://publications.waset.org/abstracts/search?q=Ardya%20Suryadinata"> Ardya Suryadinata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Improper application of the RSA algorithm scheme can cause vulnerability to attacks. The attack utilizes the relationship between broadcast messages sent to the user with some fixed polynomial functions that belong to each user. Scheme attacks carried out by applying the Chinese Remainder Theorem to obtain a general polynomial equation with the same modulus. The formation of the general polynomial becomes a first step to get back the original message. Furthermore, to solve these equations can use Coppersmith's theorem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RSA%20algorithm" title="RSA algorithm">RSA algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=broadcast%20message" title=" broadcast message"> broadcast message</a>, <a href="https://publications.waset.org/abstracts/search?q=Chinese%20Remainder%20Theorem" title=" Chinese Remainder Theorem"> Chinese Remainder Theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=Coppersmith%E2%80%99s%20theorem" title=" Coppersmith’s theorem"> Coppersmith’s theorem</a> </p> <a href="https://publications.waset.org/abstracts/9543/application-of-chinese-remainder-theorem-to-find-the-messages-sent-in-broadcast" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9543.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">341</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">3413</span> Behind Fuzzy Regression Approach: An Exploration Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lavinia%20B.%20Dulla">Lavinia B. Dulla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The exploration study of the fuzzy regression approach attempts to present that fuzzy regression can be used as a possible alternative to classical regression. It likewise seeks to assess the differences and characteristics of simple linear regression and fuzzy regression using the width of prediction interval, mean absolute deviation, and variance of residuals. Based on the simple linear regression model, the fuzzy regression approach is worth considering as an alternative to simple linear regression when the sample size is between 10 and 20. As the sample size increases, the fuzzy regression approach is not applicable to use since the assumption regarding large sample size is already operating within the framework of simple linear regression. Nonetheless, it can be suggested for a practical alternative when decisions often have to be made on the basis of small data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20regression%20approach" title="fuzzy regression approach">fuzzy regression approach</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20fuzziness%20criterion" title=" minimum fuzziness criterion"> minimum fuzziness criterion</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20regression" title=" interval regression"> interval regression</a>, <a href="https://publications.waset.org/abstracts/search?q=prediction%20interval" title=" prediction interval"> prediction interval</a> </p> <a href="https://publications.waset.org/abstracts/139364/behind-fuzzy-regression-approach-an-exploration-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139364.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">299</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">3412</span> Inverse Polynomial Numerical Scheme for the Solution of Initial Value Problems in Ordinary Differential Equations </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ogunrinde%20Roseline%20Bosede">Ogunrinde Roseline Bosede</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the development, analysis and implementation of an inverse polynomial numerical method which is well suitable for solving initial value problems in first order ordinary differential equations with applications to sample problems. We also present some basic concepts and fundamental theories which are vital to the analysis of the scheme. We analyzed the consistency, convergence, and stability properties of the scheme. Numerical experiments were carried out and the results compared with the theoretical or exact solution and the algorithm was later coded using MATLAB programming language. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=differential%20equations" title="differential equations">differential equations</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical" title=" numerical"> numerical</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial" title=" polynomial"> polynomial</a>, <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=differential%20equation" title=" differential equation"> differential equation</a> </p> <a href="https://publications.waset.org/abstracts/23505/inverse-polynomial-numerical-scheme-for-the-solution-of-initial-value-problems-in-ordinary-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23505.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">447</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">3411</span> Optimised Path Recommendation for a Real Time Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Likewin%20Thomas">Likewin Thomas</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20V.%20Manoj%20Kumar"> M. V. Manoj Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Annappa"> B. Annappa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditional execution process follows the path of execution drawn by the process analyst without observing the behaviour of resource and other real-time constraints. Identifying process model, predicting the behaviour of resource and recommending the optimal path of execution for a real time process is challenging. The proposed AlfyMiner: αyM iner gives a new dimension in process execution with the novel techniques Process Model Analyser: PMAMiner and Resource behaviour Analyser: RBAMiner for recommending the probable path of execution. PMAMiner discovers next probable activity for currently executing activity in an online process using variant matching technique to identify the set of next probable activity, among which the next probable activity is discovered using decision tree model. RBAMiner identifies the resource suitable for performing the discovered next probable activity and observe the behaviour based on; load and performance using polynomial regression model, and waiting time using queueing theory. Based on the observed behaviour αyM iner recommend the probable path of execution with; next probable activity and the best suitable resource for performing it. Experiments were conducted on process logs of CoSeLoG Project1 and 72% of accuracy is obtained in identifying and recommending next probable activity and the efficiency of resource performance was optimised by 59% by decreasing their load. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cross-organization%20process%20mining" title="cross-organization process mining">cross-organization process mining</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20behaviour" title=" process behaviour"> process behaviour</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20of%20execution" title=" path of execution"> path of execution</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20regression%20model" title=" polynomial regression model"> polynomial regression model</a> </p> <a href="https://publications.waset.org/abstracts/45002/optimised-path-recommendation-for-a-real-time-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45002.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">334</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">3410</span> On Chromaticity of Wheels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zainab%20Yasir%20Abed%20Al-Rekaby">Zainab Yasir Abed Al-Rekaby</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Jalil%20M.%20Khalaf"> Abdul Jalil M. Khalaf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W12 is chromatically unique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chromatic%20polynomial" title="chromatic polynomial">chromatic polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=chromatically%20equivalent" title=" chromatically equivalent"> chromatically equivalent</a>, <a href="https://publications.waset.org/abstracts/search?q=chromatically%20unique" title=" chromatically unique"> chromatically unique</a>, <a href="https://publications.waset.org/abstracts/search?q=wheel" title=" wheel"> wheel</a> </p> <a href="https://publications.waset.org/abstracts/12874/on-chromaticity-of-wheels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12874.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">431</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">3409</span> A Study of Chromatic Uniqueness of W14</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zainab%20Yasir%20Al-Rekaby">Zainab Yasir Al-Rekaby</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Jalil%20M.%20Khalaf"> Abdul Jalil M. Khalaf </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Coloring the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W14 is chromatically unique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chromatic%20polynomial" title="chromatic polynomial">chromatic polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=chromatically%20Equivalent" title=" chromatically Equivalent"> chromatically Equivalent</a>, <a href="https://publications.waset.org/abstracts/search?q=chromatically%20unique" title=" chromatically unique"> chromatically unique</a>, <a href="https://publications.waset.org/abstracts/search?q=wheel" title=" wheel"> wheel</a> </p> <a href="https://publications.waset.org/abstracts/20242/a-study-of-chromatic-uniqueness-of-w14" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20242.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">414</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=polynomial%20regression&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=114">114</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&page=115">115</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=polynomial%20regression&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>