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: skew polynomial rings</title> <meta name="description" content="Search results for: skew polynomial rings"> <meta name="keywords" content="skew polynomial rings"> <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="skew polynomial rings" 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="skew polynomial rings"> <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> 446</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: skew polynomial rings</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">446</span> Jacobson Semisimple Skew Inverse Laurent Series Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Moussavi">Ahmad Moussavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we are concerned with the Jacobson semisimple skew inverse Laurent series rings R((x−1; α, δ)) and the skew Laurent power series rings R[[x, x−1; α]], where R is an associative ring equipped with an automorphism α and an α-derivation δ. Examples to illustrate and delimit the theory are provided. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings" title="skew polynomial rings">skew polynomial rings</a>, <a href="https://publications.waset.org/abstracts/search?q=Laurent%20series" title=" Laurent series"> Laurent series</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20inverse%20Laurent%20series%20rings" title=" skew inverse Laurent series rings"> skew inverse Laurent series rings</a> </p> <a href="https://publications.waset.org/abstracts/128005/jacobson-semisimple-skew-inverse-laurent-series-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128005.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">165</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">445</span> Generalized π-Armendariz Authentication Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Areej%20M.%20Abduldaim">Areej M. Abduldaim</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadia%20M.%20G.%20Al-Saidi"> Nadia M. G. Al-Saidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebra is one of the important fields of mathematics. It concerns with the study and manipulation of mathematical symbols. It also concerns with the study of abstractions such as groups, rings, and fields. Due to the development of these abstractions, it is extended to consider other structures, such as vectors, matrices, and polynomials, which are non-numerical objects. Computer algebra is the implementation of algebraic methods as algorithms and computer programs. Recently, many algebraic cryptosystem protocols are based on non-commutative algebraic structures, such as authentication, key exchange, and encryption-decryption processes are adopted. Cryptography is the science that aimed at sending the information through public channels in such a way that only an authorized recipient can read it. Ring theory is the most attractive category of algebra in the area of cryptography. In this paper, we employ the algebraic structure called skew -Armendariz rings to design a neoteric algorithm for zero knowledge proof. The proposed protocol is established and illustrated through numerical example, and its soundness and completeness are proved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=identification" title=" identification"> identification</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20%CF%80-Armendariz%20rings" title=" skew π-Armendariz rings"> skew π-Armendariz rings</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings" title=" skew polynomial rings"> skew polynomial rings</a>, <a href="https://publications.waset.org/abstracts/search?q=zero%20knowledge%20protocol" title=" zero knowledge protocol"> zero knowledge protocol</a> </p> <a href="https://publications.waset.org/abstracts/75349/generalized-p-armendariz-authentication-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75349.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">217</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">444</span> A Characterization of Skew Cyclic Code with Complementary Dual</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eusebio%20Jr.%20Lina">Eusebio Jr. Lina</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20Nocon"> Ederlina Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cyclic codes are a fundamental subclass of linear codes that enjoy a very interesting algebraic structure. The class of skew cyclic codes (or θ-cyclic codes) is a generalization of the notion of cyclic codes. This a very large class of linear codes which can be used to systematically search for codes with good properties. A linear code with complementary dual (LCD code) is a linear code C satisfying C ∩ C^⊥ = {0}. This subclass of linear codes provides an optimum linear coding solution for a two-user binary adder channel and plays an important role in countermeasures to passive and active side-channel analyses on embedded cryptosystems. This paper aims to identify LCD codes from the class of skew cyclic codes. Let F_q be a finite field of order q, and θ be an automorphism of F_q. Some conditions for a skew cyclic code to be LCD were given. To this end, the properties of a noncommutative skew polynomial ring F_q[x, θ] of automorphism type were revisited, and the algebraic structure of skew cyclic code using its skew polynomial representation was examined. Using the result that skew cyclic codes are left ideals of the ring F_q[x, θ]/⟨x^n-1⟩, a characterization of a skew cyclic LCD code of length n was derived. A necessary condition for a skew cyclic code to be LCD was also given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LCD%20cyclic%20codes" title="LCD cyclic codes">LCD cyclic codes</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20LCD%20codes" title=" skew cyclic LCD codes"> skew cyclic LCD codes</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20complementary%20dual%20codes" title=" skew cyclic complementary dual codes"> skew cyclic complementary dual codes</a>, <a href="https://publications.waset.org/abstracts/search?q=theta-cyclic%20codes%20with%20complementary%20duals" title=" theta-cyclic codes with complementary duals"> theta-cyclic codes with complementary duals</a> </p> <a href="https://publications.waset.org/abstracts/56575/a-characterization-of-skew-cyclic-code-with-complementary-dual" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56575.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">345</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">443</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">442</span> Skew Cyclic Codes over Fq+uFq+…+uk-1Fq</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Li">Jing Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiuli%20Li"> Xiuli Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a special class of linear codes, called skew cyclic codes, over the ring <em>R</em>= <em>F<sub>q</sub></em>+<em>uF<sub>q</sub></em>+…+<em>u<sup>k-</sup></em><sup>1</sup><em>F<sub>q</sub></em>, where <em>q</em> is a prime power. A Gray map <em>ɸ</em> from <em>R</em> to <em>F<sub>q</sub></em> and a Gray map <em>ɸ'</em> from <em>R<sup>n</sup></em> to <em>F<sup>n</sup><sub>q</sub></em> are defined, as well as an automorphism <em>Θ</em> over <em>R</em>. It is proved that the images of skew cyclic codes over <em>R</em> under map <em>ɸ'</em> and <em>Θ</em> are cyclic codes over <em>F<sub>q</sub></em>, and they still keep the dual relation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20code" title="skew cyclic code">skew cyclic code</a>, <a href="https://publications.waset.org/abstracts/search?q=gray%20map" title=" gray map"> gray map</a>, <a href="https://publications.waset.org/abstracts/search?q=automorphism" title=" automorphism"> automorphism</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20code" title=" cyclic code"> cyclic code</a> </p> <a href="https://publications.waset.org/abstracts/70707/skew-cyclic-codes-over-fqufquk-1fq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70707.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">297</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">441</span> Some Properties in Jordan Ideal on 3-Prime Near-Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelkarim%20Boua">Abdelkarim Boua</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelhakim%20Chillali"> Abdelhakim Chillali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study of non-associative structures in algebraic structures has become a separate entity; for, in the case of groups, their corresponding non-associative structure i.e. loops is dealt with separately. Similarly there is vast amount of research on the nonassociative structures of semigroups i.e. groupoids and that of rings i.e. nonassociative rings. However it is unfortunate that we do not have a parallel notions or study of non-associative near-rings. In this work we shall attempt to generalize a few known results and study the commutativity of Jordan ideal in 3-prime near-rings satisfying certain identities involving the Jordan ideal. We study the derivations satisfying certain differential identities on Jordan ideals of 3-prime near-rings. Moreover, we provide examples to show that hypothesis of our results are necessary. We give some new results and examples concerning the existence of Jordan ideal and derivations in near-rings. These near-rings can be used to build a new codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3-prime%20near-rings" title="3-prime near-rings">3-prime near-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=near-rings" title=" near-rings"> near-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=Jordan%20ideal" title=" Jordan ideal"> Jordan ideal</a>, <a href="https://publications.waset.org/abstracts/search?q=derivations" title=" derivations"> derivations</a> </p> <a href="https://publications.waset.org/abstracts/52456/some-properties-in-jordan-ideal-on-3-prime-near-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52456.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">306</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">440</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">439</span> The Modality of Multivariate Skew Normal Mixture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bader%20Alruwaili">Bader Alruwaili</a>, <a href="https://publications.waset.org/abstracts/search?q=Surajit%20Ray"> Surajit Ray</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finite mixtures are a flexible and powerful tool that can be used for univariate and multivariate distributions, and a wide range of research analysis has been conducted based on the multivariate normal mixture and multivariate of a t-mixture. Determining the number of modes is an important activity that, in turn, allows one to determine the number of homogeneous groups in a population. Our work currently being carried out relates to the study of the modality of the skew normal distribution in the univariate and multivariate cases. For the skew normal distribution, the aims are associated with studying the modality of the skew normal distribution and providing the ridgeline, the ridgeline elevation function, the $\Pi$ function, and the curvature function, and this will be conducive to an exploration of the number and location of mode when mixing the two components of skew normal distribution. The subsequent objective is to apply these results to the application of real world data sets, such as flow cytometry data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mode" title="mode">mode</a>, <a href="https://publications.waset.org/abstracts/search?q=modality" title=" modality"> modality</a>, <a href="https://publications.waset.org/abstracts/search?q=multivariate%20skew%20normal" title=" multivariate skew normal"> multivariate skew normal</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20mixture" title=" finite mixture"> finite mixture</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20mode" title=" number of mode"> number of mode</a> </p> <a href="https://publications.waset.org/abstracts/68912/the-modality-of-multivariate-skew-normal-mixture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68912.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">488</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">438</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">437</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">436</span> Frobenius Manifolds Pairing and Invariant Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zainab%20Al-Maamari">Zainab Al-Maamari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yassir%20Dinar"> Yassir Dinar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The orbit space of an irreducible representation of a finite group is a variety with the ring of invariant polynomials as a coordinate ring. The invariant ring is a polynomial ring if and only if the representation is a reflection representation. Boris Dubrovin shows that the orbits spaces of irreducible real reflection representations acquire the structure of polynomial Frobenius manifolds. Dubrovin's method was also used to construct different examples of Frobenius manifolds on certain reflection representations. By successfully applying Dubrovin’s method on non-polynomial invariant rings of linear representations of dicyclic groups, it gives some results that magnify the relation between invariant theory and Frobenius manifolds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=invariant%20ring" title="invariant ring">invariant ring</a>, <a href="https://publications.waset.org/abstracts/search?q=Frobenius%20manifold" title=" Frobenius manifold"> Frobenius manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=inversion" title=" inversion"> inversion</a>, <a href="https://publications.waset.org/abstracts/search?q=representation%20theory" title=" representation theory"> representation theory</a> </p> <a href="https://publications.waset.org/abstracts/143099/frobenius-manifolds-pairing-and-invariant-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143099.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">98</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">435</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">434</span> A Study on Weddernburn – Artin Theorem for Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fahad%20Suleiman">Fahad Suleiman</a>, <a href="https://publications.waset.org/abstracts/search?q=Sammani%20Abdullahi"> Sammani Abdullahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study depicts that a Wedderburn Artin – theorem for rings is considered to be a semisimple ring R which is isomorphic to a product of finitely many mi by mi matrix rings over division rings Di, for some integers n_i, both of which are uniquely determined up to permutation of the index i. It has been concluded that when R is simple the Wedderburn – Artin theorem is known as Wedderburn’s theorem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Commutativity" title="Commutativity">Commutativity</a>, <a href="https://publications.waset.org/abstracts/search?q=Wedderburn%20theorem" title=" Wedderburn theorem"> Wedderburn theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=Semisimple%20ring" title=" Semisimple ring"> Semisimple ring</a>, <a href="https://publications.waset.org/abstracts/search?q=R%20module" title=" R module"> R module</a> </p> <a href="https://publications.waset.org/abstracts/115025/a-study-on-weddernburn-artin-theorem-for-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/115025.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">164</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">433</span> Contribution of Intermediate Diaphragms on LDFs of Straight and Skew Concrete Multicell Box-Girder Bridges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Iman%20Mohseni">Iman Mohseni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Current studies indicate that neglecting the effect of intermediate diaphragms might lead to highly conservative values for bending moment distribution factors and result in non-economic designs for skew bridges. This paper reports on a parametric study performed on 160 prototypes of straight and skew concrete multicell box-girder bridges. The obtained results were used to develop practical expressions to account for the diaphragm effects on American Association of State Highway and Transportation Officials formulas for live load distribution factors. It was observed that decks with internal transverse diaphragms perpendicular to the longitudinal webs are the best arrangement for load distribution in skew bridges. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=box%20bridges" title="box bridges">box bridges</a>, <a href="https://publications.waset.org/abstracts/search?q=truck" title=" truck"> truck</a>, <a href="https://publications.waset.org/abstracts/search?q=distribution%20factor" title=" distribution factor"> distribution factor</a>, <a href="https://publications.waset.org/abstracts/search?q=diaphragm" title=" diaphragm"> diaphragm</a> </p> <a href="https://publications.waset.org/abstracts/46711/contribution-of-intermediate-diaphragms-on-ldfs-of-straight-and-skew-concrete-multicell-box-girder-bridges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46711.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">380</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">432</span> Modelling of Induction Motor Including Skew Effect Using MWFA for Performance Improvement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Harir">M. Harir</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Bendiabdellah"> A. Bendiabdellah</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Chaouch"> A. Chaouch</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Benouzza"> N. Benouzza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the modelling and simulation of the squirrel cage induction motor by taking into account all space harmonic components, as well as the introduction of the bars skew, in the calculation of the linear evolution of the magnetomotive force (MMF) between the slots extremities. The model used is based on multiple coupled circuits and the modified winding function approach (MWFA). The effect of skewing is included in the calculation of motors inductances with an axial asymmetry in the rotor. The simulation results in both time and spectral domains show the effectiveness and merits of the model and the error that may be caused if the skew of the bars is neglected. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modeling" title="modeling">modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=MWFA" title=" MWFA"> MWFA</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20effect" title=" skew effect"> skew effect</a>, <a href="https://publications.waset.org/abstracts/search?q=squirrel%20cage%20induction%20motor" title=" squirrel cage induction motor"> squirrel cage induction motor</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20domain" title=" spectral domain"> spectral domain</a> </p> <a href="https://publications.waset.org/abstracts/1670/modelling-of-induction-motor-including-skew-effect-using-mwfa-for-performance-improvement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1670.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">431</span> Application of Soft Sets to Non-Associative Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Inayatur%20Rehman">Inayatur Rehman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Molodtstove developed the theory of soft sets which can be seen as an effective tool to deal with uncertainties. Since the introduction of this concept, the application of soft sets has been restricted to associative algebraic structures (groups, semi groups, associative rings, semi-rings etc.). Acceptably, though the study of soft sets, where the base set of parameters is a commutative structure, has attracted the attention of many researchers for more than one decade. But on the other hand there are many sets which are naturally endowed by two compatible binary operations forming a non-associative ring and we may dig out examples which investigate a non-associative structure in the context of soft sets. Thus it seems natural to apply the concept of soft sets to non-commutative and non-associative structures. In present paper, we make a new approach to apply Molodtsoves notion of soft sets to LA-ring (a class of non-associative ring). We extend the study of soft commutative rings from theoretical aspect. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=soft%20sets" title="soft sets">soft sets</a>, <a href="https://publications.waset.org/abstracts/search?q=LA-rings" title=" LA-rings"> LA-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=soft%20LA-rings" title=" soft LA-rings"> soft LA-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=soft%20ideals" title=" soft ideals"> soft ideals</a>, <a href="https://publications.waset.org/abstracts/search?q=soft%20prime%20ideals" title=" soft prime ideals"> soft prime ideals</a>, <a href="https://publications.waset.org/abstracts/search?q=idealistic%0D%0Asoft%20LA-rings" title=" idealistic soft LA-rings"> idealistic soft LA-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=LA-ring%20homomorphism" title=" LA-ring homomorphism "> LA-ring homomorphism </a> </p> <a href="https://publications.waset.org/abstracts/33475/application-of-soft-sets-to-non-associative-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33475.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">463</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">430</span> Extension and Closure of a Field for Engineering Purpose</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shouji%20Yujiro">Shouji Yujiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Memei%20Dukovic"> Memei Dukovic</a>, <a href="https://publications.waset.org/abstracts/search?q=Mist%20Yakubu"> Mist Yakubu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fields are important objects of study in algebra since they provide a useful generalization of many number systems, such as the rational numbers, real numbers, and complex numbers. In particular, the usual rules of associativity, commutativity and distributivity hold. Fields also appear in many other areas of mathematics; see the examples below. When abstract algebra was first being developed, the definition of a field usually did not include commutativity of multiplication, and what we today call a field would have been called either a commutative field or a rational domain. In contemporary usage, a field is always commutative. A structure which satisfies all the properties of a field except possibly for commutativity, is today called a division ring ordivision algebra or sometimes a skew field. Also non-commutative field is still widely used. In French, fields are called corps (literally, body), generally regardless of their commutativity. When necessary, a (commutative) field is called corps commutative and a skew field-corps gauche. The German word for body is Körper and this word is used to denote fields; hence the use of the blackboard bold to denote a field. The concept of fields was first (implicitly) used to prove that there is no general formula expressing in terms of radicals the roots of a polynomial with rational coefficients of degree 5 or higher. An extension of a field k is just a field K containing k as a subfield. One distinguishes between extensions having various qualities. For example, an extension K of a field k is called algebraic, if every element of K is a root of some polynomial with coefficients in k. Otherwise, the extension is called transcendental. The aim of Galois Theory is the study of algebraic extensions of a field. Given a field k, various kinds of closures of k may be introduced. For example, the algebraic closure, the separable closure, the cyclic closure et cetera. The idea is always the same: If P is a property of fields, then a P-closure of k is a field K containing k, having property, and which is minimal in the sense that no proper subfield of K that contains k has property P. For example if we take P (K) to be the property ‘every non-constant polynomial f in K[t] has a root in K’, then a P-closure of k is just an algebraic closure of k. In general, if P-closures exist for some property P and field k, they are all isomorphic. However, there is in general no preferable isomorphism between two closures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=field%20theory" title="field theory">field theory</a>, <a href="https://publications.waset.org/abstracts/search?q=mechanic%20maths" title=" mechanic maths"> mechanic maths</a>, <a href="https://publications.waset.org/abstracts/search?q=supertech" title=" supertech"> supertech</a>, <a href="https://publications.waset.org/abstracts/search?q=rolltech" title=" rolltech"> rolltech</a> </p> <a href="https://publications.waset.org/abstracts/6116/extension-and-closure-of-a-field-for-engineering-purpose" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6116.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">429</span> Adaptation of Hough Transform Algorithm for Text Document Skew Angle Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kayode%20A.%20Olaniyi">Kayode A. Olaniyi</a>, <a href="https://publications.waset.org/abstracts/search?q=Olabanji%20F.%20Omotoye"> Olabanji F. Omotoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Adeola%20A.%20Ogunleye"> Adeola A. Ogunleye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The skew detection and correction form an important part of digital document analysis. This is because uncompensated skew can deteriorate document features and can complicate further document image processing steps. Efficient text document analysis and digitization can rarely be achieved when a document is skewed even at a small angle. Once the documents have been digitized through the scanning system and binarization also achieved, document skew correction is required before further image analysis. Research efforts have been put in this area with algorithms developed to eliminate document skew. Skew angle correction algorithms can be compared based on performance criteria. Most important performance criteria are accuracy of skew angle detection, range of skew angle for detection, speed of processing the image, computational complexity and consequently memory space used. The standard Hough Transform has successfully been implemented for text documentation skew angle estimation application. However, the standard Hough Transform algorithm level of accuracy depends largely on how much fine the step size for the angle used. This consequently consumes more time and memory space for increase accuracy and, especially where number of pixels is considerable large. Whenever the Hough transform is used, there is always a tradeoff between accuracy and speed. So a more efficient solution is needed that optimizes space as well as time. In this paper, an improved Hough transform (HT) technique that optimizes space as well as time to robustly detect document skew is presented. The modified algorithm of Hough Transform presents solution to the contradiction between the memory space, running time and accuracy. Our algorithm starts with the first step of angle estimation accurate up to zero decimal place using the standard Hough Transform algorithm achieving minimal running time and space but lacks relative accuracy. Then to increase accuracy, suppose estimated angle found using the basic Hough algorithm is x degree, we then run again basic algorithm from range between ±x degrees with accuracy of one decimal place. Same process is iterated till level of desired accuracy is achieved. The procedure of our skew estimation and correction algorithm of text images is implemented using MATLAB. The memory space estimation and process time are also tabulated with skew angle assumption of within 00 and 450. The simulation results which is demonstrated in Matlab show the high performance of our algorithms with less computational time and memory space used in detecting document skew for a variety of documents with different levels of complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hough-transform" title="hough-transform">hough-transform</a>, <a href="https://publications.waset.org/abstracts/search?q=skew-detection" title=" skew-detection"> skew-detection</a>, <a href="https://publications.waset.org/abstracts/search?q=skew-angle" title=" skew-angle"> skew-angle</a>, <a href="https://publications.waset.org/abstracts/search?q=skew-correction" title=" skew-correction"> skew-correction</a>, <a href="https://publications.waset.org/abstracts/search?q=text-document" title=" text-document"> text-document</a> </p> <a href="https://publications.waset.org/abstracts/103263/adaptation-of-hough-transform-algorithm-for-text-document-skew-angle-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103263.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">158</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">428</span> Solution for Rider Ring Wear Problem in Boil off Gas Reciprocating Compressor: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hessam%20Mortezaei">Hessam Mortezaei</a>, <a href="https://publications.waset.org/abstracts/search?q=Saeid%20Joudakian"> Saeid Joudakian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the wear problem on rider rings of boil off gas compressor has been studied. This kind of oil free double acting compressor has free floating piston (FFP) technology and as a result of that it should have the lowest possible wear on its rider rings. But a design problem had caused a complete wear of rider rings after one month of continuous operation. In this case study, the source of this problem was recognized and solved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=piston%20rider" title="piston rider">piston rider</a>, <a href="https://publications.waset.org/abstracts/search?q=rings" title=" rings"> rings</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20distribution" title=" gas distribution"> gas distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=pressure%20wear" title=" pressure wear"> pressure wear</a> </p> <a href="https://publications.waset.org/abstracts/3024/solution-for-rider-ring-wear-problem-in-boil-off-gas-reciprocating-compressor-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3024.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">366</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">427</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">426</span> On Modules over Dedekind Prime Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elvira%20Kusniyanti">Elvira Kusniyanti</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanni%20Garminia"> Hanni Garminia</a>, <a href="https://publications.waset.org/abstracts/search?q=Pudji%20Astuti"> Pudji Astuti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research studies an interconnection between finitely generated uniform modules and Dedekind prime rings. The characterization of modules over Dedekind prime rings that will be investigated is an adoption of Noetherian and hereditary concept. Dedekind prime rings are Noetherian and hereditary rings. This property of Dedekind prime rings is a background of the idea of adopting arises. In Noetherian area, it was known that a ring R is Noetherian ring if and only if every finitely generated R-module is a Noetherian module. Similar to that result, a characterization of the hereditary ring is related to its projective modules. That is, a ring R is hereditary ring if and only if every projective R-module is a hereditary module. Due to the above two results, we suppose that characterization of a Dedekind prime ring can be analyzed from finitely generated modules over it. We propose a conjecture: a ring R is a Dedekind prime ring if and only if every finitely generated uniform R-module is a Dedekind module. In this article, we will generalize a concept of the Dedekind module for non-commutative ring case and present a part of the above conjecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dedekind%20domains" title="dedekind domains">dedekind domains</a>, <a href="https://publications.waset.org/abstracts/search?q=dedekind%20prime%20rings" title=" dedekind prime rings"> dedekind prime rings</a>, <a href="https://publications.waset.org/abstracts/search?q=dedekind%20modules" title=" dedekind modules"> dedekind modules</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20modules" title=" uniform modules"> uniform modules</a> </p> <a href="https://publications.waset.org/abstracts/32475/on-modules-over-dedekind-prime-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32475.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">441</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">425</span> Evaluation of Hydrocarbons in Tissues of Bivalve Mollusks from the Red Sea Coast</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Asma%20Ahmed%20Aljohani">Asma Ahmed Aljohani</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Orif"> Mohammed Orif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concentration of polycyclic aromatic hydrocarbons (PAH) in clam (A. glabrata) was examined in samples collected from Alseef Beach, 30 km south of Jeddah city. Gas chromatography-mass spectrometry (GC-MS) was used to analyse the 14 PAHs. The concentration of total PAHs was found to range from 11.521 to 40.149 ng/gdw with a mean concentration of 21.857 ng/gdw, which is lower compared to similar studies. The lower molecular weight PAHs with three rings comprised 18.14% of the total PAH concentrations in the clams, while the high molecular weight PAHs with four rings, five rings, and six rings account for 81.86%. Diagnostic ratios for PAH source distinction suggested pyrogenic or anthropogenic sources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bivalves" title="bivalves">bivalves</a>, <a href="https://publications.waset.org/abstracts/search?q=biomonitoring" title=" biomonitoring"> biomonitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=hydrocarbons" title=" hydrocarbons"> hydrocarbons</a>, <a href="https://publications.waset.org/abstracts/search?q=PAHs" title=" PAHs"> PAHs</a> </p> <a href="https://publications.waset.org/abstracts/159285/evaluation-of-hydrocarbons-in-tissues-of-bivalve-mollusks-from-the-red-sea-coast" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159285.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">98</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">424</span> Prime Graphs of Polynomials and Power Series Over Non-Commutative Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walaa%20Obaidallah%20Alqarafi">Walaa Obaidallah Alqarafi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wafaa%20Mohammed%20Fakieh"> Wafaa Mohammed Fakieh</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Abdallah%20Altassan"> Alaa Abdallah Altassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebraic graph theory is defined as a bridge between algebraic structures and graphs. It has several uses in many fields, including chemistry, physics, and computer science. The prime graph is a type of graph associated with a ring R, where the vertex set is the whole ring R, and two vertices x and y are adjacent if either xRy=0 or yRx=0. However, the investigation of the prime graph over rings remains relatively limited. The behavior of this graph in extended rings, like R[x] and R[[x]], where R is a non-commutative ring, deserves more attention because of the wider applicability in algebra and other mathematical fields. To study the prime graphs over polynomials and power series rings, we used a combination of ring-theoretic and graph-theoretic techniques. This paper focuses on two invariants: the diameter and the girth of these graphs. Furthermore, the work discusses how the graph structures change when passing from R to R[x] and R[[x]]. In our study, we found that the set of strong zero-divisors of ring R represents the set of vertices in prime graphs. Based on this discovery, we redefined the vertices of prime graphs using the definition of strong zero divisors. Additionally, our results show that although the prime graphs of R[x] and R[[x]] are comparable to the graph of R, they have different combinatorial characteristics since these extensions contain new strong zero-divisors. In particular, we find conditions in which the diameter and girth of the graphs, as they expand from R to R[x] and R[[x]], do not change or do change. In conclusion, this study shows how extending a non-commutative ring R to R[x] and R[[x]] affects the structure of their prime graphs, particularly in terms of diameter and girth. These findings enhance the understanding of the relationship between ring extensions and graph properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prime%20graph" title="prime graph">prime graph</a>, <a href="https://publications.waset.org/abstracts/search?q=diameter" title=" diameter"> diameter</a>, <a href="https://publications.waset.org/abstracts/search?q=girth" title=" girth"> girth</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20series%20ring" title=" power series ring"> power series ring</a> </p> <a href="https://publications.waset.org/abstracts/192430/prime-graphs-of-polynomials-and-power-series-over-non-commutative-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192430.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">18</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">423</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">422</span> The Extended Skew Gaussian Process for Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20T.%20Alodat">M. T. Alodat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a generalization to the Gaussian process regression(GPR) model called the extended skew Gaussian process for regression(ESGPr) model. The ESGPR model works better than the GPR model when the errors are skewed. We derive the predictive distribution for the ESGPR model at a new input. Also we apply the ESGPR model to FOREX data and we find that it fits the Forex data better than the GPR model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=extended%20skew%20normal%20distribution" title="extended skew normal distribution">extended skew normal distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20process%20for%20regression" title=" Gaussian process for regression"> Gaussian process for regression</a>, <a href="https://publications.waset.org/abstracts/search?q=predictive%20distribution" title=" predictive distribution"> predictive distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=ESGPr%20model" title=" ESGPr model"> ESGPr model</a> </p> <a href="https://publications.waset.org/abstracts/2233/the-extended-skew-gaussian-process-for-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2233.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">553</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">421</span> Skew Planar Wheel Antenna for First Person View of Unmanned Aerial Vehicle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raymond%20Yudhi%20Purba">Raymond Yudhi Purba</a>, <a href="https://publications.waset.org/abstracts/search?q=Levy%20Olivia%20Nur"> Levy Olivia Nur</a>, <a href="https://publications.waset.org/abstracts/search?q=Radial%20Anwar"> Radial Anwar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research presents the design and measurement of a skew planar wheel antenna that is used to visualize the first person view perspective of unmanned aerial vehicles. The antenna has been designed using CST Studio Suite 2019 to have voltage standing wave ratio (VSWR) ≤ 2, return loss ≤ -10 dB, bandwidth ≥ 100 MHz to covering outdoor access point band from 5.725 to 5.825 GHz, omnidirectional radiation pattern, and elliptical polarization. Dimensions of skew planar wheel antenna have been modified using parameter sweep technique to provide good performances. The simulation results provide VSWR 1.231, return loss -19.693 dB, bandwidth 828.8 MHz, gain 3.292 dB, and axial ratio 9.229 dB. Meanwhile, the measurement results provide VSWR 1.237, return loss -19.476 dB, bandwidth 790.5 MHz, gain 3.2034 dB, and axial ratio 4.12 dB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=skew%20planar%20wheel" title="skew planar wheel">skew planar wheel</a>, <a href="https://publications.waset.org/abstracts/search?q=cloverleaf" title=" cloverleaf"> cloverleaf</a>, <a href="https://publications.waset.org/abstracts/search?q=first-person%20view" title=" first-person view"> first-person view</a>, <a href="https://publications.waset.org/abstracts/search?q=unmanned%20aerial%20vehicle" title=" unmanned aerial vehicle"> unmanned aerial vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20sweep" title=" parameter sweep"> parameter sweep</a> </p> <a href="https://publications.waset.org/abstracts/139082/skew-planar-wheel-antenna-for-first-person-view-of-unmanned-aerial-vehicle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139082.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">216</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">420</span> Interaction between Unsteady Supersonic Jet and Vortex Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kazumasa%20Kitazono">Kazumasa Kitazono</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiroshi%20Fukuoka"> Hiroshi Fukuoka</a>, <a href="https://publications.waset.org/abstracts/search?q=Nao%20Kuniyoshi"> Nao Kuniyoshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Minoru%20Yaga"> Minoru Yaga</a>, <a href="https://publications.waset.org/abstracts/search?q=Eri%20Ueno"> Eri Ueno</a>, <a href="https://publications.waset.org/abstracts/search?q=Naoaki%20Fukuda"> Naoaki Fukuda</a>, <a href="https://publications.waset.org/abstracts/search?q=Toshio%20Takiya"> Toshio Takiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The unsteady supersonic jet formed by a shock tube with a small high-pressure chamber was used as a simple alternative model for pulsed laser ablation. Understanding the vortex ring formed by the shock wave is crucial in clarifying the behavior of unsteady supersonic jet discharged from an elliptical cell. Therefore, this study investigated the behavior of vortex rings and a jet. The experiment and numerical calculation were conducted using the schlieren method and by solving the axisymmetric two-dimensional compressible Navier–Stokes equations, respectively. In both, the calculation and the experiment, laser ablation is conducted for a certain duration, followed by discharge through the exit. Moreover, a parametric study was performed to demonstrate the effect of pressure ratio on the interaction among vortex rings and the supersonic jet. The interaction between the supersonic jet and the vortex rings increased the velocity of the supersonic jet up to the magnitude of the velocity at the center of the vortex rings. The interaction between the vortex rings increased the velocity at the center of the vortex ring. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computational%20fluid%20dynamics" title="computational fluid dynamics">computational fluid dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=shock-wave" title=" shock-wave"> shock-wave</a>, <a href="https://publications.waset.org/abstracts/search?q=unsteady%20jet" title=" unsteady jet"> unsteady jet</a>, <a href="https://publications.waset.org/abstracts/search?q=vortex%20ring" title=" vortex ring"> vortex ring</a> </p> <a href="https://publications.waset.org/abstracts/50911/interaction-between-unsteady-supersonic-jet-and-vortex-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50911.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">470</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">419</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">530</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">418</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">417</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">458</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=skew%20polynomial%20rings&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&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=skew%20polynomial%20rings&page=14">14</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&page=15">15</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings&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>