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: generalized central path</title> <meta name="description" content="Search results for: generalized central path"> <meta name="keywords" content="generalized central path"> <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="generalized central path" 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="generalized central path"> <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> 4769</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: generalized central path</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4769</span> Generalized Central Paths for Convex Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li-Zhi%20Liao">Li-Zhi Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The central path has played the key role in the interior point method. However, the convergence of the central path may not be true even in some convex programming problems with linear constraints. In this paper, the generalized central paths are introduced for convex programming. One advantage of the generalized central paths is that the paths will always converge to some optimal solutions of the convex programming problem for any initial interior point. Some additional theoretical properties for the generalized central paths will be also reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20path" title="central path">central path</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title=" convex programming"> convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path" title=" generalized central path"> generalized central path</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a> </p> <a href="https://publications.waset.org/abstracts/58039/generalized-central-paths-for-convex-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58039.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">327</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">4768</span> Specification and Unification of All Fundamental Forces Exist in Universe in the Theoretical Perspective – The Universal Mechanics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Surendra%20Mund">Surendra Mund</a> </p> <p class="card-text"><strong>Abstract:</strong></p> At the beginning, the physical entity force was defined mathematically by Sir Isaac Newton in his Principia Mathematica as F ⃗=(dp ⃗)/dt in form of his second law of motion. Newton also defines his Universal law of Gravitational force exist in same outstanding book, but at the end of 20th century and beginning of 21st century, we have tried a lot to specify and unify four or five Fundamental forces or Interaction exist in universe, but we failed every time. Usually, Gravity creates problems in this unification every single time, but in my previous papers and presentations, I defined and derived Field and force equations for Gravitational like Interactions for each and every kind of central systems. This force is named as Variational Force by me, and this force is generated by variation in the scalar field density around the body. In this particular paper, at first, I am specifying which type of Interactions are Fundamental in Universal sense (or in all type of central systems or bodies predicted by my N-time Inflationary Model of Universe) and then unify them in Universal framework (defined and derived by me as Universal Mechanics in a separate paper) as well. This will also be valid in Universal dynamical sense which includes inflations and deflations of universe, central system relativity, Universal relativity, ϕ-ψ transformation and transformation of spin, physical perception principle, Generalized Fundamental Dynamical Law and many other important Generalized Principles of Generalized Quantum Mechanics (GQM) and Central System Theory (CST). So, In this article, at first, I am Generalizing some Fundamental Principles, and then Unifying Variational Forces (General form of Gravitation like Interactions) and Flow Generated Force (General form of EM like Interactions), and then Unify all Fundamental Forces by specifying Weak and Strong Interactions in form of more basic terms - Variational, Flow Generated and Transformational Interactions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Central%20System%20Force" title="Central System Force">Central System Force</a>, <a href="https://publications.waset.org/abstracts/search?q=Disturbance%20Force" title=" Disturbance Force"> Disturbance Force</a>, <a href="https://publications.waset.org/abstracts/search?q=Flow%20Generated%20Forces" title=" Flow Generated Forces"> Flow Generated Forces</a>, <a href="https://publications.waset.org/abstracts/search?q=Generalized%20Nuclear%20Force" title=" Generalized Nuclear Force"> Generalized Nuclear Force</a>, <a href="https://publications.waset.org/abstracts/search?q=Generalized%20Weak%20Interactions" title=" Generalized Weak Interactions"> Generalized Weak Interactions</a>, <a href="https://publications.waset.org/abstracts/search?q=Generalized%20EM-Like%20Interactions" title=" Generalized EM-Like Interactions"> Generalized EM-Like Interactions</a>, <a href="https://publications.waset.org/abstracts/search?q=Imbalance%20Force" title=" Imbalance Force"> Imbalance Force</a>, <a href="https://publications.waset.org/abstracts/search?q=Spin%20Generated%20Forces" title=" Spin Generated Forces"> Spin Generated Forces</a>, <a href="https://publications.waset.org/abstracts/search?q=Transformation%20Generated%20Force" title=" Transformation Generated Force"> Transformation Generated Force</a>, <a href="https://publications.waset.org/abstracts/search?q=Unified%20Force" title=" Unified Force"> Unified Force</a>, <a href="https://publications.waset.org/abstracts/search?q=Universal%20Mechanics" title=" Universal Mechanics"> Universal Mechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=Uniform%20And%20Non-Uniform%20Variational%20Interactions" title=" Uniform And Non-Uniform Variational Interactions"> Uniform And Non-Uniform Variational Interactions</a>, <a href="https://publications.waset.org/abstracts/search?q=Variational%20Interactions" title=" Variational Interactions"> Variational Interactions</a> </p> <a href="https://publications.waset.org/abstracts/169765/specification-and-unification-of-all-fundamental-forces-exist-in-universe-in-the-theoretical-perspective-the-universal-mechanics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/169765.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">50</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">4767</span> On the Fractional Integration of Generalized Mittag-Leffler Type Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christian%20Lavault">Christian Lavault</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the generalized fractional integral operators of two generalized Mittag-Leffler type functions are investigated. The special cases of interest involve the generalized M-series and K-function, both introduced by Sharma. The two pairs of theorems established herein generalize recent results about left- and right-sided generalized fractional integration operators applied here to the M-series and the K-function. The note also results in important applications in physics and mathematical engineering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fox%E2%80%93Wright%20Psi%20function" title="Fox–Wright Psi function">Fox–Wright Psi function</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20hypergeometric%20function" title=" generalized hypergeometric function"> generalized hypergeometric function</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Riemann%E2%80%93%20Liouville%20and%20Erd%C3%A9lyi%E2%80%93Kober%20fractional%20integral%20operators" title=" generalized Riemann– Liouville and Erdélyi–Kober fractional integral operators"> generalized Riemann– Liouville and Erdélyi–Kober fractional integral operators</a>, <a href="https://publications.waset.org/abstracts/search?q=Saigo%27s%20generalized%20fractional%20calculus" title=" Saigo's generalized fractional calculus"> Saigo's generalized fractional calculus</a>, <a href="https://publications.waset.org/abstracts/search?q=Sharma%27s%20M-series%20and%20K-function" title=" Sharma's M-series and K-function"> Sharma's M-series and K-function</a> </p> <a href="https://publications.waset.org/abstracts/60662/on-the-fractional-integration-of-generalized-mittag-leffler-type-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60662.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">440</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">4766</span> The Normal-Generalized Hyperbolic Secant Distribution: Properties and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hazem%20M.%20Al-Mofleh">Hazem M. Al-Mofleh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new four-parameter univariate continuous distribution called the Normal-Generalized Hyperbolic Secant Distribution (NGHS) is defined and studied. Some general and structural distributional properties are investigated and discussed, including: central and non-central n-th moments and incomplete moments, quantile and generating functions, hazard function, Rényi and Shannon entropies, shapes: skewed right, skewed left, and symmetric, modality regions: unimodal and bimodal, maximum likelihood (MLE) estimators for the parameters. Finally, two real data sets are used to demonstrate empirically its flexibility and prove the strength of the new distribution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bimodality" title="bimodality">bimodality</a>, <a href="https://publications.waset.org/abstracts/search?q=estimation" title=" estimation"> estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=hazard%20function" title=" hazard function"> hazard function</a>, <a href="https://publications.waset.org/abstracts/search?q=moments" title=" moments"> moments</a>, <a href="https://publications.waset.org/abstracts/search?q=Shannon%E2%80%99s%20entropy" title=" Shannon’s entropy"> Shannon’s entropy</a> </p> <a href="https://publications.waset.org/abstracts/62567/the-normal-generalized-hyperbolic-secant-distribution-properties-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62567.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">348</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">4765</span> When Sex Matters: A Comparative Generalized Structural Equation Model (GSEM) for the Determinants of Stunting Amongst Under-fives in Uganda</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vallence%20Ngabo%20M.">Vallence Ngabo M.</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonard%20Atuhaire"> Leonard Atuhaire</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Clever%20Rutayisire"> Peter Clever Rutayisire</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main aim of this study was to establish the differences in both the determinants of stunting and the causal mechanism through which the identified determinants influence stunting amongst male and female under-fives in Uganda. Literature shows that male children below the age of five years are at a higher risk of being stunted than their female counterparts. Specifically, studies in Uganda indicate that being a male child is positively associated with stunting, while being a female is negatively associated with stunting. Data for 904 males and 829 females under-fives was extracted form UDHS-2016 survey dataset. Key variables for this study were identified and used in generating relevant models and paths. Structural equation modeling techniques were used in their generalized form (GSEM). The generalized nature necessitated specifying both the family and link functions for each response variable in the system of the model. The sex of the child (b4) was used as a grouping factor and the height for age (HAZ) scores were used to construct the status for stunting of under-fives. The estimated models and path clearly indicated that the set of underlying factors that influence male and female under-fives respectively was different and the path through which they influence stunting was different. However, some of the determinants that influenced stunting amongst male under-fives also influenced stunting amongst the female under-fives. To reduce the stunting problem to the desirable state, it is important to consider the multifaceted and complex nature of the risk factors that influence stunting amongst the under-fives but, more importantly, consider the different sex-specific factors and their causal mechanism or paths through which they influence stunting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stunting" title="stunting">stunting</a>, <a href="https://publications.waset.org/abstracts/search?q=underfives" title=" underfives"> underfives</a>, <a href="https://publications.waset.org/abstracts/search?q=sex%20of%20the%20child" title=" sex of the child"> sex of the child</a>, <a href="https://publications.waset.org/abstracts/search?q=GSEM" title=" GSEM"> GSEM</a>, <a href="https://publications.waset.org/abstracts/search?q=causal%20mechanism" title=" causal mechanism"> causal mechanism</a> </p> <a href="https://publications.waset.org/abstracts/149264/when-sex-matters-a-comparative-generalized-structural-equation-model-gsem-for-the-determinants-of-stunting-amongst-under-fives-in-uganda" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/149264.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">140</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">4764</span> The Impact of Socialization Preferences on Perceptions of Generalized Social Trust in China</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Menghzheng%20Yao">Menghzheng Yao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Generalized social trust among Chinese has been declining in the past few decades, making the search for its causes necessary. Drawing on the symbolic interaction theory and the 2012 Chinese General Social Survey data, this research investigated the impact of people’s socialization preferences and frequencies on their perceptions of generalized social trust in China. This research also took a preliminary step towards understanding the spatial differences of the generalized social trust using the ArcGIS software. The results show that respondents who interacted with their neighbors more frequently were more likely to have higher levels of perceptions of generalized social trust. Several demographics were also significantly related to perception of generalized social trust. Elderly and better educated Chinese and people with higher self-perceived social status were associated with greater levels of generalized social trust perception, while urban dwellers and religious respondents expressed lower levels of such perception. Implications for future research and policy are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=China" title="China">China</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20social%20trust" title=" generalized social trust"> generalized social trust</a>, <a href="https://publications.waset.org/abstracts/search?q=symbolic%20interaction" title=" symbolic interaction"> symbolic interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=ArcGIS" title=" ArcGIS"> ArcGIS</a> </p> <a href="https://publications.waset.org/abstracts/70818/the-impact-of-socialization-preferences-on-perceptions-of-generalized-social-trust-in-china" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70818.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">376</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4763</span> Nano Generalized Topology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Y.%20Bakeir">M. Y. Bakeir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Rough set theory is a recent approach for reasoning about data. It has achieved a large amount of applications in various real-life fields. The main idea of rough sets corresponds to the lower and upper set approximations. These two approximations are exactly the interior and the closure of the set with respect to a certain topology on a collection U of imprecise data acquired from any real-life field. The base of the topology is formed by equivalence classes of an equivalence relation E defined on U using the available information about data. The theory of generalized topology was studied by Cs´asz´ar. It is well known that generalized topology in the sense of Cs´asz´ar is a generalization of the topology on a set. On the other hand, many important collections of sets related with the topology on a set form a generalized topology. The notion of Nano topology was introduced by Lellis Thivagar, which was defined in terms of approximations and boundary region of a subset of an universe using an equivalence relation on it. The purpose of this paper is to introduce a new generalized topology in terms of rough set called nano generalized topology <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rough%20sets" title="rough sets">rough sets</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20space" title=" topological space"> topological space</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20topology" title=" generalized topology"> generalized topology</a>, <a href="https://publications.waset.org/abstracts/search?q=nano%20topology" title=" nano topology "> nano topology </a> </p> <a href="https://publications.waset.org/abstracts/28088/nano-generalized-topology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28088.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">4762</span> Application of a Generalized Additive Model to Reveal the Relations between the Density of Zooplankton with Other Variables in the West Daya Bay, China</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Weiwen%20Li">Weiwen Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Hao%20Huang"> Hao Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chengmao%20You"> Chengmao You</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianji%20Liao"> Jianji Liao</a>, <a href="https://publications.waset.org/abstracts/search?q=Lei%20Wang"> Lei Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Lina%20An"> Lina An</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Zooplankton are a central issue in the ecology which makes a great contribution to maintaining the balance of an ecosystem. It is critical in promoting the material cycle and energy flow within the ecosystems. A generalized additive model (GAM) was applied to analyze the relationships between the density (individuals per m³) of zooplankton and other variables in West Daya Bay. All data used in this analysis (the survey month, survey station (longitude and latitude), the depth of the water column, the superficial concentration of chlorophyll a, the benthonic concentration of chlorophyll a, the number of zooplankton species and the number of zooplankton species) were collected through monthly scientific surveys during January to December 2016. GLM model (generalized linear model) was used to choose the significant variables’ impact on the density of zooplankton, and the GAM was employed to analyze the relationship between the density of zooplankton and the significant variables. The results showed that the density of zooplankton increased with an increase of the benthonic concentration of chlorophyll a, but decreased with a decrease in the depth of the water column. Both high numbers of zooplankton species and the overall total number of zooplankton individuals led to a higher density of zooplankton. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=density" title="density">density</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20linear%20model" title=" generalized linear model"> generalized linear model</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20additive%20model" title=" generalized additive model"> generalized additive model</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20West%20Daya%20Bay" title=" the West Daya Bay"> the West Daya Bay</a>, <a href="https://publications.waset.org/abstracts/search?q=zooplankton" title=" zooplankton"> zooplankton</a> </p> <a href="https://publications.waset.org/abstracts/103582/application-of-a-generalized-additive-model-to-reveal-the-relations-between-the-density-of-zooplankton-with-other-variables-in-the-west-daya-bay-china" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103582.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">151</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">4761</span> Derivatives Formulas Involving I-Functions of Two Variables and Generalized M-Series</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gebreegziabher%20Hailu%20Gebrecherkos">Gebreegziabher Hailu Gebrecherkos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study explores the derivatives of functions defined by I-functions of two variables and their connections to generalized M-series. We begin by defining I-functions, which are generalized functions that encompass various special functions, and analyze their properties. By employing advanced calculus techniques, we derive new formulas for the first and higher-order derivatives of I-functions with respect to their variables; we establish some derivative formulae of the I-function of two variables involving generalized M-series. The special cases of our derivatives yield interesting results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=I-function" title="I-function">I-function</a>, <a href="https://publications.waset.org/abstracts/search?q=Mellin-Barners%20control%20integral" title=" Mellin-Barners control integral"> Mellin-Barners control integral</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20M-series" title=" generalized M-series"> generalized M-series</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20order%20derivative" title=" higher order derivative"> higher order derivative</a> </p> <a href="https://publications.waset.org/abstracts/192292/derivatives-formulas-involving-i-functions-of-two-variables-and-generalized-m-series" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192292.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">16</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">4760</span> Upper Bound of the Generalized P-Value for the Difference between Two Future Population Means</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rada%20Somkhuean">Rada Somkhuean</a>, <a href="https://publications.waset.org/abstracts/search?q=Sa-aat%20Niwitpong"> Sa-aat Niwitpong</a>, <a href="https://publications.waset.org/abstracts/search?q=Suparat%20Niwitpong"> Suparat Niwitpong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the generalized p-values for testing the difference between two future population means when the variances are unknown, in both cases for when the variances are equal and unequal. We also derive a closed form expression of the upper bound of the proposed generalized p-value. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20p-value" title="generalized p-value">generalized p-value</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20future%20population%20means" title=" two future population means"> two future population means</a>, <a href="https://publications.waset.org/abstracts/search?q=upper%20bound" title=" upper bound"> upper bound</a>, <a href="https://publications.waset.org/abstracts/search?q=variances" title=" variances"> variances</a> </p> <a href="https://publications.waset.org/abstracts/12128/upper-bound-of-the-generalized-p-value-for-the-difference-between-two-future-population-means" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12128.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">384</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">4759</span> Generalized Chaplygin Gas and Varying Bulk Viscosity in Lyra Geometry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20K.%20Sethi">A. K. Sethi</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20N.%20Patra"> R. N. Patra</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Nayak"> B. Nayak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have considered Friedmann-Robertson-Walker (FRW) metric with generalized Chaplygin gas which has viscosity in the context of Lyra geometry. The viscosity is considered in two different ways (i.e. zero viscosity, non-constant <em>r</em> (rho)-dependent bulk viscosity) using constant deceleration parameter which concluded that, for a special case, the viscous generalized Chaplygin gas reduces to modified Chaplygin gas. The represented model indicates on the presence of Chaplygin gas in the Universe. Observational constraints are applied and discussed on the physical and geometrical nature of the Universe. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bulk%20viscosity" title="bulk viscosity">bulk viscosity</a>, <a href="https://publications.waset.org/abstracts/search?q=lyra%20geometry" title=" lyra geometry"> lyra geometry</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20chaplygin%20gas" title=" generalized chaplygin gas"> generalized chaplygin gas</a>, <a href="https://publications.waset.org/abstracts/search?q=cosmology" title=" cosmology"> cosmology</a> </p> <a href="https://publications.waset.org/abstracts/105557/generalized-chaplygin-gas-and-varying-bulk-viscosity-in-lyra-geometry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105557.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">176</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">4758</span> Top-K Shortest Distance as a Similarity Measure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrey%20Lebedev">Andrey Lebedev</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilya%20Dmitrenok"> Ilya Dmitrenok</a>, <a href="https://publications.waset.org/abstracts/search?q=JooYoung%20Lee"> JooYoung Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonard%20Johard"> Leonard Johard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network. However, in many real world networks, whose diameters are small, top-k shortest path is more interesting as it contains more information about the network topology. Many variations to compute top-k shortest paths have been studied. In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Then, we also propose a top-k distance based graph matching algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20matching" title="graph matching">graph matching</a>, <a href="https://publications.waset.org/abstracts/search?q=link%20prediction" title=" link prediction"> link prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=shortest%20path" title=" shortest path"> shortest path</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a> </p> <a href="https://publications.waset.org/abstracts/63488/top-k-shortest-distance-as-a-similarity-measure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63488.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">358</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">4757</span> Weyl Type Theorem and the Fuglede Property</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20M.%20Rashid">M. H. M. Rashid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given H a Hilbert space and B(H) the algebra of bounded linear operator in H, let δAB denote the generalized derivation defined by A and B. The main objective of this article is to study Weyl type theorems for generalized derivation for (A,B) satisfying a couple of Fuglede. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuglede%20Property" title="Fuglede Property">Fuglede Property</a>, <a href="https://publications.waset.org/abstracts/search?q=Weyl%E2%80%99s%20theorem" title=" Weyl’s theorem"> Weyl’s theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20derivation" title=" generalized derivation"> generalized derivation</a>, <a href="https://publications.waset.org/abstracts/search?q=Aluthge%20transform" title=" Aluthge transform"> Aluthge transform</a> </p> <a href="https://publications.waset.org/abstracts/113531/weyl-type-theorem-and-the-fuglede-property" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/113531.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">128</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">4756</span> A Review on Comparative Analysis of Path Planning and Collision Avoidance Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divya%20Agarwal">Divya Agarwal</a>, <a href="https://publications.waset.org/abstracts/search?q=Pushpendra%20S.%20Bharti"> Pushpendra S. Bharti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title="path planning">path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=autonomous%20mobile%20robots" title=" autonomous mobile robots"> autonomous mobile robots</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithms" title=" algorithms"> algorithms</a> </p> <a href="https://publications.waset.org/abstracts/93693/a-review-on-comparative-analysis-of-path-planning-and-collision-avoidance-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93693.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">4755</span> Local Homology Modules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fatemeh%20Mohammadi%20Aghjeh%20Mashhad">Fatemeh Mohammadi Aghjeh Mashhad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we give several ways for computing generalized local homology modules by using Gorenstein flat resolutions. Also, we find some bounds for vanishing of generalized local homology modules. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=a-adic%20completion%20functor" title="a-adic completion functor">a-adic completion functor</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20local%20homology%20modules" title=" generalized local homology modules"> generalized local homology modules</a>, <a href="https://publications.waset.org/abstracts/search?q=Gorenstein%20flat%20modules" title=" Gorenstein flat modules"> Gorenstein flat modules</a> </p> <a href="https://publications.waset.org/abstracts/23188/local-homology-modules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23188.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">419</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">4754</span> On the Analysis of Strategies of Buechi Games</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Termimi%20Ab%20Ghani">Ahmad Termimi Ab Ghani</a>, <a href="https://publications.waset.org/abstracts/search?q=Kojiro%20Higuchi"> Kojiro Higuchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present some results of simultaneous infinite games. We mainly work with generalized reachability games and Buechi games. These games are two-player concurrent games where each player chooses simultaneously their moves at each step. Our goal is to give simple expressions of values for each game. Moreover, we are interested in the question of what type of optimal (ε-optimal) strategy exists for both players depending on the type of games. We first show the determinacy (optimal value) and optimal (ε-optimal) strategies in generalized reachability games. We provide a simple expressions of value of this game and prove the existence of memoryless randomized ε-optimal strategy for Player I in any generalized reachability games. We then observe games with more complex objectives, games with Buechi objectives. We present how to compute an ε-optimal strategies and approximate a value of game in some way. Specifically, the results of generalized reachability games are used to show the value of Buechi games can be approximated as values of some generalized reachability games. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20Strategies" title="optimal Strategies">optimal Strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20reachability%20games" title=" generalized reachability games"> generalized reachability games</a>, <a href="https://publications.waset.org/abstracts/search?q=Buechi%20games" title=" Buechi games"> Buechi games</a> </p> <a href="https://publications.waset.org/abstracts/23287/on-the-analysis-of-strategies-of-buechi-games" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23287.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">593</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">4753</span> On Fourier Type Integral Transform for a Class of Generalized Quotients</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20S.%20Issa">A. S. Issa</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20K.%20Q.%20AL-Omari"> S. K. Q. AL-Omari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate certain spaces of generalized functions for the Fourier and Fourier type integral transforms. We discuss convolution theorems and establish certain spaces of distributions for the considered integrals. The new Fourier type integral is well-defined, linear, one-to-one and continuous with respect to certain types of convergences. Many properties and an inverse problem are also discussed in some details. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boehmian" title="Boehmian">Boehmian</a>, <a href="https://publications.waset.org/abstracts/search?q=Fourier%20integral" title=" Fourier integral"> Fourier integral</a>, <a href="https://publications.waset.org/abstracts/search?q=Fourier%20type%20integral" title=" Fourier type integral"> Fourier type integral</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20quotient" title=" generalized quotient"> generalized quotient</a> </p> <a href="https://publications.waset.org/abstracts/45947/on-fourier-type-integral-transform-for-a-class-of-generalized-quotients" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45947.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">365</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">4752</span> Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lana%20Dalawr%20Jalal">Lana Dalawr Jalal </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses the problem of ofﬂine path planning for Unmanned Aerial Vehicles (UAVs) in complex three-dimensional environment with obstacles, which is modelled by 3D Cartesian grid system. Path planning for UAVs require the computational intelligence methods to move aerial vehicles along the flight path effectively to target while avoiding obstacles. In this paper Modified Particle Swarm Optimization (MPSO) algorithm is applied to generate the optimal collision free 3D flight path for UAV. The simulations results clearly demonstrate effectiveness of the proposed algorithm in guiding UAV to the final destination by providing optimal feasible path quickly and effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title="obstacle avoidance">obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=three-dimensional%20path%20planning%20unmanned%20aerial%20vehicles" title=" three-dimensional path planning unmanned aerial vehicles"> three-dimensional path planning unmanned aerial vehicles</a> </p> <a href="https://publications.waset.org/abstracts/26160/three-dimensional-off-line-path-planning-for-unmanned-aerial-vehicle-using-modified-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26160.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">410</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">4751</span> Genetic Algorithm for In-Theatre Military Logistics Search-and-Delivery Path Planning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jean%20Berger">Jean Berger</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Barkaoui"> Mohamed Barkaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Discrete search path planning in time-constrained uncertain environment relying upon imperfect sensors is known to be hard, and current problem-solving techniques proposed so far to compute near real-time efficient path plans are mainly bounded to provide a few move solutions. A new information-theoretic –based open-loop decision model explicitly incorporating false alarm sensor readings, to solve a single agent military logistics search-and-delivery path planning problem with anticipated feedback is presented. The decision model consists in minimizing expected entropy considering anticipated possible observation outcomes over a given time horizon. The model captures uncertainty associated with observation events for all possible scenarios. Entropy represents a measure of uncertainty about the searched target location. Feedback information resulting from possible sensor observations outcomes along the projected path plan is exploited to update anticipated unit target occupancy beliefs. For the first time, a compact belief update formulation is generalized to explicitly include false positive observation events that may occur during plan execution. A novel genetic algorithm is then proposed to efficiently solve search path planning, providing near-optimal solutions for practical realistic problem instances. Given the run-time performance of the algorithm, natural extension to a closed-loop environment to progressively integrate real visit outcomes on a rolling time horizon can be easily envisioned. Computational results show the value of the approach in comparison to alternate heuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=search%20path%20planning" title="search path planning">search path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=false%20alarm" title=" false alarm"> false alarm</a>, <a href="https://publications.waset.org/abstracts/search?q=search-and-delivery" title=" search-and-delivery"> search-and-delivery</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/2263/genetic-algorithm-for-in-theatre-military-logistics-search-and-delivery-path-planning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2263.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">360</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">4750</span> Joint Path and Push Planning among Moveable Obstacles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Victor%20Emeli">Victor Emeli</a>, <a href="https://publications.waset.org/abstracts/search?q=Akansel%20Cosgun"> Akansel Cosgun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper explores the navigation among movable obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a planning algorithm for selecting a path and the obstacles to be pushed, where a rapidly-exploring random tree (RRT)-based heuristic is employed to calculate a minimal collision path. When it is necessary to apply a pushing force to slide an obstacle out of the way, the planners leverage means-end analysis through a dynamic physics simulation to determine the sequence of linear pushes to clear the necessary space. Simulation experiments show that our approach finds solutions in higher clutter percentages (up to 49%) compared to the straight-line push planner (37%) and RRT without pushing (18%). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title="motion planning">motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=push%20planning" title=" push planning"> push planning</a>, <a href="https://publications.waset.org/abstracts/search?q=robot%20navigation" title=" robot navigation"> robot navigation</a> </p> <a href="https://publications.waset.org/abstracts/128403/joint-path-and-push-planning-among-moveable-obstacles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128403.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">4749</span> Durrmeyer Type Modification of q-Generalized Bernstein Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ruchi">Ruchi</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Acu"> A. M. Acu</a>, <a href="https://publications.waset.org/abstracts/search?q=Purshottam%20N.%20Agrawal"> Purshottam N. Agrawal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper to introduce the Durrmeyer type modification of q-generalized-Bernstein operators which include the Bernstein polynomials in the particular α = 0. We investigate the rate of convergence by means of the Lipschitz class and the Peetre’s K-functional. Also, we define the bivariate case of Durrmeyer type modification of q-generalized-Bernstein operators and study the degree of approximation with the aid of the partial modulus of continuity and the Peetre’s K-functional. Finally, we introduce the GBS (Generalized Boolean Sum) of the Durrmeyer type modification of q- generalized-Bernstein operators and investigate the approximation of the Bögel continuous and Bögel differentiable functions with the aid of the Lipschitz class and the mixed modulus of smoothness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=B%C3%B6gel%20continuous" title="Bögel continuous">Bögel continuous</a>, <a href="https://publications.waset.org/abstracts/search?q=B%C3%B6gel%20differentiable" title=" Bögel differentiable"> Bögel differentiable</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Boolean%20sum" title=" generalized Boolean sum"> generalized Boolean sum</a>, <a href="https://publications.waset.org/abstracts/search?q=Peetre%E2%80%99s%20K-functional" title=" Peetre’s K-functional"> Peetre’s K-functional</a>, <a href="https://publications.waset.org/abstracts/search?q=Lipschitz%20class" title=" Lipschitz class"> Lipschitz class</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20modulus%20of%20smoothness" title=" mixed modulus of smoothness"> mixed modulus of smoothness</a> </p> <a href="https://publications.waset.org/abstracts/79175/durrmeyer-type-modification-of-q-generalized-bernstein-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79175.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">213</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">4748</span> Spectral Clustering from the Discrepancy View and Generalized Quasirandomness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marianna%20Bolla">Marianna Bolla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to compare spectral, discrepancy, and degree properties of expanding graph sequences. As we can prove equivalences and implications between them and the definition of the generalized (multiclass) quasirandomness of Lovasz–Sos (2008), they can be regarded as generalized quasirandom properties akin to the equivalent quasirandom properties of the seminal Chung-Graham-Wilson paper (1989) in the one-class scenario. Since these properties are valid for deterministic graph sequences, irrespective of stochastic models, the partial implications also justify for low-dimensional embedding of large-scale graphs and for discrepancy minimizing spectral clustering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20random%20graphs" title="generalized random graphs">generalized random graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=multiway%20discrepancy" title=" multiway discrepancy"> multiway discrepancy</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20modularity%20spectra" title=" normalized modularity spectra"> normalized modularity spectra</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20clustering" title=" spectral clustering"> spectral clustering</a> </p> <a href="https://publications.waset.org/abstracts/95238/spectral-clustering-from-the-discrepancy-view-and-generalized-quasirandomness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95238.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">197</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">4747</span> Point Estimation for the Type II Generalized Logistic Distribution Based on Progressively Censored Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rana%20Rimawi">Rana Rimawi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayman%20Baklizi"> Ayman Baklizi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Skewed distributions are important models that are frequently used in applications. Generalized distributions form a class of skewed distributions and gain widespread use in applications because of their flexibility in data analysis. More specifically, the Generalized Logistic Distribution with its different types has received considerable attention recently. In this study, based on progressively type-II censored data, we will consider point estimation in type II Generalized Logistic Distribution (Type II GLD). We will develop several estimators for its unknown parameters, including maximum likelihood estimators (MLE), Bayes estimators and linear estimators (BLUE). The estimators will be compared using simulation based on the criteria of bias and Mean square error (MSE). An illustrative example of a real data set will be given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=point%20estimation" title="point estimation">point estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=type%20II%20generalized%20logistic%20distribution" title=" type II generalized logistic distribution"> type II generalized logistic distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=progressive%20censoring" title=" progressive censoring"> progressive censoring</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20likelihood%20estimation" title=" maximum likelihood estimation"> maximum likelihood estimation</a> </p> <a href="https://publications.waset.org/abstracts/142979/point-estimation-for-the-type-ii-generalized-logistic-distribution-based-on-progressively-censored-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142979.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">198</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">4746</span> An Extension of the Generalized Extreme Value Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Serge%20Provost">Serge Provost</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdous%20Saboor"> Abdous Saboor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A q-analogue of the generalized extreme value distribution which includes the Gumbel distribution is introduced. The additional parameter q allows for increased modeling flexibility. The resulting distribution can have a finite, semi-infinite or infinite support. It can also produce several types of hazard rate functions. The model parameters are determined by making use of the method of maximum likelihood. It will be shown that it compares favourably to three related distributions in connection with the modeling of a certain hydrological data set. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=extreme%20value%20theory" title="extreme value theory">extreme value theory</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20extreme%20value%20distribution" title=" generalized extreme value distribution"> generalized extreme value distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=goodness-of-fit%20statistics" title=" goodness-of-fit statistics"> goodness-of-fit statistics</a>, <a href="https://publications.waset.org/abstracts/search?q=Gumbel%20distribution" title=" Gumbel distribution"> Gumbel distribution</a> </p> <a href="https://publications.waset.org/abstracts/72656/an-extension-of-the-generalized-extreme-value-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72656.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">349</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">4745</span> Unveiling Karst Features in Miocene Carbonate Reservoirs of Central Luconia-Malaysia: Case Study of F23 Field's Karstification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abd%20Al-Salam%20Al-Masgari">Abd Al-Salam Al-Masgari</a>, <a href="https://publications.waset.org/abstracts/search?q=Haylay%20Tsegab"> Haylay Tsegab</a>, <a href="https://publications.waset.org/abstracts/search?q=Ismailalwali%20Babikir"> Ismailalwali Babikir</a>, <a href="https://publications.waset.org/abstracts/search?q=Monera%20A.%20Shoieb"> Monera A. Shoieb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a study of Malaysia's Central Luconia region, which is an essential deposit of Miocene carbonate reservoirs. This study aims to identify and map areas of selected carbonate platforms, develop high-resolution statistical karst models, and generate comprehensive karst geobody models for selected carbonate fields. This study uses seismic characterization and advanced geophysical surveys to identify karst signatures in Miocene carbonate reservoirs. The results highlight the use of variance, RMS, RGB colour blending, and 3D visualization Prop seismic sequence stratigraphy seismic attributes to visualize the karstified areas across the F23 field of Central Luconia. The offshore karst model serves as a powerful visualization tool to reveal the karstization of carbonate sediments of interest. The results of this study contribute to a better understanding of the karst distribution of Miocene carbonate reservoirs in Central Luconia, which are essential for hydrocarbon exploration and production. This is because these features significantly impact the reservoir geometry, flow path and characteristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=karst" title="karst">karst</a>, <a href="https://publications.waset.org/abstracts/search?q=central%20Luconia" title=" central Luconia"> central Luconia</a>, <a href="https://publications.waset.org/abstracts/search?q=seismic%20attributes" title=" seismic attributes"> seismic attributes</a>, <a href="https://publications.waset.org/abstracts/search?q=Miocene%20carbonate%20build-ups" title=" Miocene carbonate build-ups"> Miocene carbonate build-ups</a> </p> <a href="https://publications.waset.org/abstracts/166084/unveiling-karst-features-in-miocene-carbonate-reservoirs-of-central-luconia-malaysia-case-study-of-f23-fields-karstification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166084.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">71</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4744</span> Path Planning for Orchard Robot Using Occupancy Grid Map in 2D Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Satyam%20Raikwar">Satyam Raikwar</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Herlitzius"> Thomas Herlitzius</a>, <a href="https://publications.waset.org/abstracts/search?q=Jens%20Fehrmann"> Jens Fehrmann</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, the autonomous navigation of orchard and field robots is an emerging technology of the mobile robotics in agriculture. One of the core aspects of autonomous navigation builds upon path planning, which is still a crucial issue. Generally, for simple representation, the path planning for a mobile robot is performed in a two-dimensional space, which creates a path between the start and goal point. This paper presents the automatic path planning approach for robots used in orchards and vineyards using occupancy grid maps with field consideration. The orchards and vineyards are usually structured environment and their topology is assumed to be constant over time; therefore, in this approach, an RGB image of a field is used as a working environment. These images undergone different image processing operations and then discretized into two-dimensional grid matrices. The individual grid or cell of these grid matrices represents the occupancy of the space, whether it is free or occupied. The grid matrix represents the robot workspace for motion and path planning. After the grid matrix is described, a probabilistic roadmap (PRM) path algorithm is used to create the obstacle-free path over these occupancy grids. The path created by this method was successfully verified in the test area. Furthermore, this approach is used in the navigation of the orchard robot. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=orchard%20robots" title="orchard robots">orchard robots</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20path%20planning" title=" automatic path planning"> automatic path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=occupancy%20grid" title=" occupancy grid"> occupancy grid</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20roadmap" title=" probabilistic roadmap"> probabilistic roadmap</a> </p> <a href="https://publications.waset.org/abstracts/110023/path-planning-for-orchard-robot-using-occupancy-grid-map-in-2d-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110023.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">155</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">4743</span> Generalized Rough Sets Applied to Graphs Related to Urban Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mihai%20Rebenciuc">Mihai Rebenciuc</a>, <a href="https://publications.waset.org/abstracts/search?q=Simona%20Mihaela%20Bibic"> Simona Mihaela Bibic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Branch of modern mathematics, graphs represent instruments for optimization and solving practical applications in various fields such as economic networks, engineering, network optimization, the geometry of social action, generally, complex systems including contemporary urban problems (path or transport efficiencies, biourbanism, & c.). In this paper is studied the interconnection of some urban network, which can lead to a simulation problem of a digraph through another digraph. The simulation is made univoc or more general multivoc. The concepts of fragment and atom are very useful in the study of connectivity in the digraph that is simulation - including an alternative evaluation of k- connectivity. Rough set approach in (bi)digraph which is proposed in premier in this paper contribute to improved significantly the evaluation of k-connectivity. This rough set approach is based on generalized rough sets - basic facts are presented in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=%28bi%29digraphs" title="(bi)digraphs">(bi)digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=rough%20set%20theory" title=" rough set theory"> rough set theory</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20of%20interacting%20agents" title=" systems of interacting agents"> systems of interacting agents</a>, <a href="https://publications.waset.org/abstracts/search?q=complex%20systems" title=" complex systems"> complex systems</a> </p> <a href="https://publications.waset.org/abstracts/77919/generalized-rough-sets-applied-to-graphs-related-to-urban-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77919.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">243</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">4742</span> The Relationship between Central Bank Independence and Inflation: Evidence from Africa</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Bhattu%20Babajee">R. Bhattu Babajee</a>, <a href="https://publications.waset.org/abstracts/search?q=Marie%20Sandrine%20Estelle%20Benoit"> Marie Sandrine Estelle Benoit </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The past decades have witnessed a considerable institutional shift towards Central Bank Independence across economies of the world. The motivation behind such a change is the acceptance that increased central bank autonomy has the power of alleviating inflation bias. Hence, studying whether Central Bank Independence acts as a significant factor behind the price stability in the African economies or whether this macroeconomic aim in these countries result from other economic, political or social factors is a pertinent issue. The main research objective of this paper is to assess the relationship between central bank autonomy and inflation in African economies where inflation has proved to be a serious problem. In this optic, we shall measure the degree of CBI in Africa by computing the turnover rates of central banks governors thereby studying whether decisions made by African central banks are affected by external forces. The purpose of this study is to investigate empirically the association between Central Bank Independence (CBI) and inflation for 10 African economies over a period of 17 years, from 1995 to 2012. The sample includes Botswana, Egypt, Ghana, Kenya, Madagascar, Mauritius, Mozambique, Nigeria, South Africa, and Uganda. In contrast to empirical research, we have not been using the usual static panel model for it is associated with potential mis specification arising from the absence of dynamics. To this issue a dynamic panel data model which integrates several control variables has been used. Firstly, the analysis includes dynamic terms to explain the tenacity of inflation. Given the confirmation of inflation inertia, that is very likely in African countries there exists the need for including lagged inflation in the empirical model. Secondly, due to known reverse causality between Central Bank Independence and inflation, the system generalized method of moments (GMM) is employed. With GMM estimators, the presence of unknown forms of heteroskedasticity is admissible as well as auto correlation in the error term. Thirdly, control variables have been used to enhance the efficiency of the model. The main finding of this paper is that central bank independence is negatively associated with inflation even after including control variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20bank%20independence" title="central bank independence">central bank independence</a>, <a href="https://publications.waset.org/abstracts/search?q=inflation" title=" inflation"> inflation</a>, <a href="https://publications.waset.org/abstracts/search?q=macroeconomic%20variables" title=" macroeconomic variables"> macroeconomic variables</a>, <a href="https://publications.waset.org/abstracts/search?q=price%20stability" title=" price stability"> price stability</a> </p> <a href="https://publications.waset.org/abstracts/16918/the-relationship-between-central-bank-independence-and-inflation-evidence-from-africa" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16918.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">364</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">4741</span> Independence and Path Independence on Cayley Digraphs of Left Groups and Right Groups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nuttawoot%20Nupo">Nuttawoot Nupo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cayley%20digraphs" title="Cayley digraphs">Cayley digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=independence%20number" title=" independence number"> independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=left%20groups" title=" left groups"> left groups</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20independence%20number" title=" path independence number"> path independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20groups" title=" right groups"> right groups</a> </p> <a href="https://publications.waset.org/abstracts/59306/independence-and-path-independence-on-cayley-digraphs-of-left-groups-and-right-groups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59306.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">233</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">4740</span> Convergence of Generalized Jacobi, Gauss-Seidel and Successive Overrelaxation Methods for Various Classes of Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manideepa%20Saha">Manideepa Saha</a>, <a href="https://publications.waset.org/abstracts/search?q=Jahnavi%20Chakrabarty"> Jahnavi Chakrabarty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Generalized Jacobi (GJ) and Generalized Gauss-Seidel (GGS) methods are most effective than conventional Jacobi and Gauss-Seidel methods for solving linear system of equations. It is known that GJ and GGS methods converge for strictly diagonally dominant (SDD) and for M-matrices. In this paper, we study the convergence of GJ and GGS converge for symmetric positive definite (SPD) matrices, L-matrices and H-matrices. We introduce a generalization of successive overrelaxation (SOR) method for solving linear systems and discuss its convergence for the classes of SDD matrices, SPD matrices, M-matrices, L-matrices and for H-matrices. Advantages of generalized SOR method are established through numerical experiments over GJ, GGS, and SOR methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergence" title="convergence">convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=Gauss-Seidel" title=" Gauss-Seidel"> Gauss-Seidel</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacobi" title=" Jacobi"> Jacobi</a>, <a href="https://publications.waset.org/abstracts/search?q=SOR" title=" SOR"> SOR</a> </p> <a href="https://publications.waset.org/abstracts/97280/convergence-of-generalized-jacobi-gauss-seidel-and-successive-overrelaxation-methods-for-various-classes-of-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97280.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">189</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=generalized%20central%20path&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&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=generalized%20central%20path&page=158">158</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&page=159">159</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path&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>