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: global convergence</title> <meta name="description" content="Search results for: global convergence"> <meta name="keywords" content="global convergence"> <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="global convergence" 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="global convergence"> <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> 5792</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: global convergence</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5792</span> A New Modification of Nonlinear Conjugate Gradient Coefficients with Global Convergence Properties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Alhawarat">Ahmad Alhawarat</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Mamat"> Mustafa Mamat</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Rivaie"> Mohd Rivaie</a>, <a href="https://publications.waset.org/abstracts/search?q=Ismail%20Mohd"> Ismail Mohd</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient method has been enormously used to solve large scale unconstrained optimization problems due to the number of iteration, memory, CPU time, and convergence property, in this paper we find a new class of nonlinear conjugate gradient coefficient with global convergence properties proved by exact line search. The numerical results for our new βK give a good result when it compared with well-known formulas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title="conjugate gradient method">conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20coefficient" title=" conjugate gradient coefficient"> conjugate gradient coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a> </p> <a href="https://publications.waset.org/abstracts/1392/a-new-modification-of-nonlinear-conjugate-gradient-coefficients-with-global-convergence-properties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1392.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">464</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5791</span> Formation of Convergence Culture in the Framework of Conventional Media and New Media</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Berkay%20Bulu%C5%9F">Berkay Buluş</a>, <a href="https://publications.waset.org/abstracts/search?q=Aytekin%20%C4%B0%C5%9Fman"> Aytekin İşman</a>, <a href="https://publications.waset.org/abstracts/search?q=K%C3%BCbra%20Y%C3%BCz%C3%BCnc%C3%BCy%C4%B1l"> Kübra Yüzüncüyıl</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Developments in media and communication technologies have changed the way we use media. The importance of convergence culture has been increasing day by day within the framework of these developments. With new media, it is possible to say that social networks are the most powerful platforms that are integrated to this digitalization process. Although social networks seem like the place that people can socialize, they can also be utilized as places of production. On the other hand, audience has become users within the framework of transformation from national to global broadcasting. User generated contents make conventional media and new media collide. In this study, these communication platforms will be examined not as platforms that replace one another but mediums that unify each other. In the light of this information, information that is produced by users regarding new media platforms and all new media use practices are called convergence culture. In other words, convergence culture means intersections of conventional and new media. In this study, examples of convergence culture will be analyzed in detail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=new%20media" title="new media">new media</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20culture" title=" convergence culture"> convergence culture</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=use%20of%20new%20media" title=" use of new media"> use of new media</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20generated%20content" title=" user generated content"> user generated content</a> </p> <a href="https://publications.waset.org/abstracts/76579/formation-of-convergence-culture-in-the-framework-of-conventional-media-and-new-media" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76579.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">271</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">5790</span> A Research Analysis on the Source Technology and Convergence Types</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kwounghee%20Choi">Kwounghee Choi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Technological convergence between the various sectors is expected to have a very large impact on future industrial and economy. This study attempts to do empirical approach between specific technologies’ classification. For technological convergence classification, it is necessary to set the target technology to be analyzed. This study selected target technology from national research and development plan. At first we found a source technology for analysis. Depending on the weight of source technology, NT-based, BT-based, IT-based, ET-based, CS-based convergence types were classified. This study aims to empirically show the concept of convergence technology and convergence types. If we use the source technology to classify convergence type, it will be useful to make practical strategies of convergence technology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=technology%20convergence" title="technology convergence">technology convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=source%20technology" title=" source technology"> source technology</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20type" title=" convergence type"> convergence type</a>, <a href="https://publications.waset.org/abstracts/search?q=R%26D%20strategy" title=" R&D strategy"> R&D strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=technology%20classification" title=" technology classification"> technology classification</a> </p> <a href="https://publications.waset.org/abstracts/37117/a-research-analysis-on-the-source-technology-and-convergence-types" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37117.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">485</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">5789</span> L1-Convergence of Modified Trigonometric Sums</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sandeep%20Kaur%20Chouhan">Sandeep Kaur Chouhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jatinderdeep%20Kaur"> Jatinderdeep Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Bhatia"> S. S. Bhatia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The existence of sine and cosine series as a Fourier series, their L1-convergence seems to be one of the difficult question in theory of convergence of trigonometric series in L1-metric norm. In the literature so far available, various authors have studied the L1-convergence of cosine and sine trigonometric series with special coefficients. In this paper, we present a modified cosine and sine sums and criterion for L1-convergence of these modified sums is obtained. Also, a necessary and sufficient condition for the L1-convergence of the cosine and sine series is deduced as corollaries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20Dirichlet%20kernel" title="conjugate Dirichlet kernel">conjugate Dirichlet kernel</a>, <a href="https://publications.waset.org/abstracts/search?q=Dirichlet%20kernel" title=" Dirichlet kernel"> Dirichlet kernel</a>, <a href="https://publications.waset.org/abstracts/search?q=L1-convergence" title=" L1-convergence"> L1-convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20sums" title=" modified sums"> modified sums</a> </p> <a href="https://publications.waset.org/abstracts/44182/l1-convergence-of-modified-trigonometric-sums" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44182.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">355</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">5788</span> The World in the 21st Century and Beyound: Convergence or Invariance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saleh%20Maina">Saleh Maina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There is an on-going debate among intellectuals and scholars of international relations and world politics over the direction which the world is heading particularly in the current era of globalization. On the one hand are adherents to the convergence thesis which is premised on the assumption that global social order is tending toward universalism which could translate into the possible end of the classical state system and the unification of world societies under a single and common ideological dispensation. The convergence thesis is hinged on the globalization process which is gradually reducing world societies into a 'global village'. On the other hand are intellectuals who hold the view that despite advances made in communication technology which appear to threaten the survival of the classical state system. Invariance, as expressed in the survival of the existing state system and the diverse social traditions in world societies, remain a realistic possibility contrary to the conclusions of the convergence thesis. The invariance thesis has been advanced by scholars like Samuel P. Huntington whose work on clash of civilizations suggests that world peace can only be sustained through the co-habitation of diverse civilizations across the world. The purpose of this paper is to examine both sides of the debate with the aim of making a realistic assessment on where world societies are headed, between convergence and invariance. Using the realist theory of international relations as our theoretical premise the paper argues that while there is sufficient ground to predict the future direction of world societies as headed towards some form of convergence, invariance as expressed in the co-existence of diverse civilizations will for a long time remain a major feature of the international system. <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=invariance" title=" invariance"> invariance</a>, <a href="https://publications.waset.org/abstracts/search?q=clash%20of%20civilization" title=" clash of civilization"> clash of civilization</a>, <a href="https://publications.waset.org/abstracts/search?q=classical%20state%20system" title=" classical state system"> classical state system</a>, <a href="https://publications.waset.org/abstracts/search?q=universalism" title=" universalism"> universalism</a> </p> <a href="https://publications.waset.org/abstracts/37539/the-world-in-the-21st-century-and-beyound-convergence-or-invariance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37539.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">308</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">5787</span> Statistical Convergence of the Szasz-Mirakjan-Kantorovich-Type Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rishikesh%20Yadav">Rishikesh Yadav</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramakanta%20Meher"> Ramakanta Meher</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Narayan%20Mishra"> Vishnu Narayan Mishra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main aim of this article is to investigate the statistical convergence of the summation of integral type operators and to obtain the weighted statistical convergence. The rate of statistical convergence by means of modulus of continuity and function belonging to the Lipschitz class are also studied. We discuss the convergence of the defined operators by graphical representation and put a better rate of convergence than the Szasz-Mirakjan-Kantorovich operators. In the last section, we extend said operators into bivariate operators to study about the rate of convergence in sense of modulus of continuity and by means of Lipschitz class by using function of two variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=The%20Szasz-Mirakjan-Kantorovich%20operators" title="The Szasz-Mirakjan-Kantorovich operators">The Szasz-Mirakjan-Kantorovich operators</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20convergence" title=" statistical convergence"> statistical convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=modulus%20of%20continuity" title=" modulus of continuity"> modulus of continuity</a>, <a href="https://publications.waset.org/abstracts/search?q=Peeters%20K-functional" title=" Peeters K-functional"> Peeters K-functional</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20modulus%20of%20continuity" title=" weighted modulus of continuity"> weighted modulus of continuity</a> </p> <a href="https://publications.waset.org/abstracts/96045/statistical-convergence-of-the-szasz-mirakjan-kantorovich-type-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96045.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">212</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">5786</span> Relaxing Convergence Constraints in Local Priority Hysteresis Switching Logic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mubarak%20Alhajri">Mubarak Alhajri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses certain inherent limitations of local priority hysteresis switching logic. Our main result establishes that under persistent excitation assumption, it is possible to relax constraints requiring strict positivity of local priority and hysteresis switching constants. Relaxing these constraints allows the adaptive system to reach optimality which implies the performance improvement. The unconstrained local priority hysteresis switching logic is examined and conditions for global convergence are derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20control" title="adaptive control">adaptive control</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=hysteresis%20constant" title=" hysteresis constant"> hysteresis constant</a>, <a href="https://publications.waset.org/abstracts/search?q=hysteresis%20switching" title=" hysteresis switching"> hysteresis switching</a> </p> <a href="https://publications.waset.org/abstracts/61209/relaxing-convergence-constraints-in-local-priority-hysteresis-switching-logic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61209.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">393</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">5785</span> Numerical Studies for Standard Bi-Conjugate Gradient Stabilized Method and the Parallel Variants for Solving Linear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kuniyoshi%20Abe">Kuniyoshi Abe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear equations Ax = b, for x, where A is a given n-by-n matrix, and b is a given n-vector. Typically, the dimension of the linear equation is high and the matrix is sparse. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG stabilized (Bi-CGSTAB), BiCGStab2, and BiCGstab(l) have been developed to improve the convergence of Bi-CG. Bi-CGSTAB has been most often used for efficiently solving the linear equation, but we have seen the convergence behavior with a long stagnation phase. In such cases, it is important to have Bi-CG coefficients that are as accurate as possible, and the stabilization strategy, which stabilizes the computation of the Bi-CG coefficients, has been proposed. It may avoid stagnation and lead to faster computation. Motivated by a large number of processors in present petascale high-performance computing hardware, the scalability of Krylov subspace methods on parallel computers has recently become increasingly prominent. The main bottleneck for efficient parallelization is the inner products which require a global reduction. The resulting global synchronization phases cause communication overhead on parallel computers. The parallel variants of Krylov subspace methods reducing the number of global communication phases and hiding the communication latency have been proposed. However, the numerical stability, specifically, the convergence speed of the parallel variants of Bi-CGSTAB may become worse than that of the standard Bi-CGSTAB. In this paper, therefore, we compare the convergence speed between the standard Bi-CGSTAB and the parallel variants by numerical experiments and show that the convergence speed of the standard Bi-CGSTAB is faster than the parallel variants. Moreover, we propose the stabilization strategy for the parallel variants. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bi-conjugate%20gradient%20stabilized%20method" title="bi-conjugate gradient stabilized method">bi-conjugate gradient stabilized method</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20speed" title=" convergence speed"> convergence speed</a>, <a href="https://publications.waset.org/abstracts/search?q=Krylov%20subspace%20methods" title=" Krylov subspace methods"> Krylov subspace methods</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20equations" title=" linear equations"> linear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20variant" title=" parallel variant"> parallel variant</a> </p> <a href="https://publications.waset.org/abstracts/96373/numerical-studies-for-standard-bi-conjugate-gradient-stabilized-method-and-the-parallel-variants-for-solving-linear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96373.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">5784</span> Effect of Structural Change on Productivity Convergence: A Panel Unit Root Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amjad%20Naveed">Amjad Naveed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study analysed the role of structural change in the process of labour productivity convergence at country and regional levels. Many forms of structural changes occurred within the European Union (EU) countries i.e. variation in sectoral employment share, changes in demand for products, variations in trade patterns and advancement in technology which may have an influence on the process of convergence. Earlier studies on convergence have neglected the role of structural changes which can have resulted in different conclusion on the nature of convergence. The contribution of this study is to examine the role of structural change in testing labour productivity convergence at various levels. For the empirical purpose, the data of 19 EU countries, 259 regions and 6 industries is used for the period of 1991-2009. The results indicate that convergence varies across regional and country levels for different industries when considered the role of structural change. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=labor%20produvitivty" title="labor produvitivty">labor produvitivty</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20change" title=" structural change"> structural change</a>, <a href="https://publications.waset.org/abstracts/search?q=panel%20unit%20root" title=" panel unit root"> panel unit root</a> </p> <a href="https://publications.waset.org/abstracts/59813/effect-of-structural-change-on-productivity-convergence-a-panel-unit-root-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59813.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">285</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">5783</span> Lambda-Levelwise Statistical Convergence of a Sequence of Fuzzy Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=F.%20Berna%20Benli">F. Berna Benli</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%96zg%C3%BCr%20Keskin"> Özgür Keskin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lately, many mathematicians have been studied the statistical convergence of a sequence of fuzzy numbers. We know that Lambda-statistically convergence is a kind of convergence between ordinary convergence and statistical convergence. In this paper, we will introduce the new kind of convergence such as λ-levelwise statistical convergence. Then, we will define the concept of the λ-levelwise statistical cluster and limit points of a sequence of fuzzy numbers. Also, we will discuss the relations between the sets of λ-levelwise statistical cluster points and λ-levelwise statistical limit points of sequences of fuzzy numbers. This work has been extended in this paper, where some relations have been considered such that when lambda-statistical limit inferior and lambda-statistical limit superior for lambda-statistically convergent sequences of fuzzy numbers are equal. Furthermore, lambda-statistical boundedness condition for different sequences of fuzzy numbers has been studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20number" title="fuzzy number">fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-levelwise%20statistical%20cluster%20points" title=" λ-levelwise statistical cluster points"> λ-levelwise statistical cluster points</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-levelwise%20statistical%20convergence" title=" λ-levelwise statistical convergence"> λ-levelwise statistical convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-levelwise%20statistical%20limit%20points" title=" λ-levelwise statistical limit points"> λ-levelwise statistical limit points</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-statistical%20cluster%20points" title=" λ-statistical cluster points"> λ-statistical cluster points</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-statistical%20convergence" title=" λ-statistical convergence"> λ-statistical convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-statistical%20limit%20%20points" title=" λ-statistical limit points"> λ-statistical limit points</a> </p> <a href="https://publications.waset.org/abstracts/20755/lambda-levelwise-statistical-convergence-of-a-sequence-of-fuzzy-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20755.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">477</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">5782</span> Statistical Convergence for the Approximation of Linear Positive Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Neha%20Bhardwaj">Neha Bhardwaj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider positive linear operators and study the Voronovskaya type result of the operator then obtain an error estimate in terms of the higher order modulus of continuity of the function being approximated and its A-statistical convergence. Also, we compute the corresponding rate of A-statistical convergence for the linear positive operators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Poisson%20distribution" title="Poisson distribution">Poisson distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=Voronovskaya" title=" Voronovskaya"> Voronovskaya</a>, <a href="https://publications.waset.org/abstracts/search?q=modulus%20of%20continuity" title=" modulus of continuity"> modulus of continuity</a>, <a href="https://publications.waset.org/abstracts/search?q=a-statistical%20convergence" title=" a-statistical convergence"> a-statistical convergence</a> </p> <a href="https://publications.waset.org/abstracts/70017/statistical-convergence-for-the-approximation-of-linear-positive-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70017.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">333</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">5781</span> A Conjugate Gradient Method for Large Scale Unconstrained Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Belloufi">Mohammed Belloufi</a>, <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Benzine"> Rachid Benzine</a>, <a href="https://publications.waset.org/abstracts/search?q=Badreddine%20Sellami"> Badreddine Sellami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient methods is useful for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. It is well known that the search direction plays a main role in the line search method. In this paper, we propose a search direction with the Wolfe line search technique for solving unconstrained optimization problems. Under the above line searches and some assumptions, the global convergence properties of the given methods are discussed. Numerical results and comparisons with other CG methods are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title=" conjugate gradient method"> conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20Wolfe%20line%20search" title=" strong Wolfe line search"> strong Wolfe line search</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a> </p> <a href="https://publications.waset.org/abstracts/40028/a-conjugate-gradient-method-for-large-scale-unconstrained-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40028.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">423</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">5780</span> An Iterative Family for Solution of System of Nonlinear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Sonia">Sonia Sonia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a family of iterative scheme for solving nonlinear systems of equations which have wide application in sciences and engineering. The proposed iterative family is based upon some parameters which generates many different iterative schemes. This family is completely derivative free and uses first of divided difference operator. Moreover some numerical experiments are performed and compared with existing methods. Analysis of convergence shows that the presented family has fourth-order of convergence. The dynamical behaviour of proposed family and local convergence have also been discussed. The numerical performance and convergence region comparison demonstrates that proposed family is efficient. <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=divided%20difference%20operator" title=" divided difference operator"> divided difference operator</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20system" title=" nonlinear system"> nonlinear system</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton%27s%20method" title=" Newton's method"> Newton's method</a> </p> <a href="https://publications.waset.org/abstracts/80719/an-iterative-family-for-solution-of-system-of-nonlinear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80719.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">236</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">5779</span> A Family of Distributions on Learnable Problems without Uniform Convergence</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C%C3%A9sar%20Garza">César Garza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In supervised binary classification and regression problems, it is well-known that learnability is equivalent to a uniform convergence of the hypothesis class, and if a problem is learnable, it is learnable by empirical risk minimization. For the general learning setting of unsupervised learning tasks, there are non-trivial learning problems where uniform convergence does not hold. We present here the task of learning centers of mass with an extra feature that “activates” some of the coordinates over the unit ball in a Hilbert space. We show that the learning problem is learnable under a stable RLM rule. We introduce a family of distributions over the domain space with some mild restrictions for which the sample complexity of uniform convergence for these problems must grow logarithmically with the dimension of the Hilbert space. If we take this dimension to infinity, we obtain a learnable problem for which the uniform convergence property fails for a vast family of distributions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=statistical%20learning%20theory" title="statistical learning theory">statistical learning theory</a>, <a href="https://publications.waset.org/abstracts/search?q=learnability" title=" learnability"> learnability</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20convergence" title=" uniform convergence"> uniform convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/abstracts/search?q=regularized%20loss%20minimization" title=" regularized loss minimization"> regularized loss minimization</a> </p> <a href="https://publications.waset.org/abstracts/151038/a-family-of-distributions-on-learnable-problems-without-uniform-convergence" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151038.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">131</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">5778</span> Semilocal Convergence of a Three Step Fifth Order Iterative Method under Hölder Continuity Condition in Banach Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramandeep%20Behl">Ramandeep Behl</a>, <a href="https://publications.waset.org/abstracts/search?q=Prashanth%20Maroju"> Prashanth Maroju</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Motsa"> S. S. Motsa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we study the semilocal convergence of a fifth order iterative method using recurrence relation under the assumption that first order Fréchet derivative satisfies the Hölder condition. Also, we calculate the R-order of convergence and provide some a priori error bounds. Based on this, we give existence and uniqueness region of the solution for a nonlinear Hammerstein integral equation of the second kind. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Holder%20continuity%20condition" title="Holder continuity condition">Holder continuity condition</a>, <a href="https://publications.waset.org/abstracts/search?q=Frechet%20derivative" title=" Frechet derivative"> Frechet derivative</a>, <a href="https://publications.waset.org/abstracts/search?q=fifth%20order%20convergence" title=" fifth order convergence"> fifth order convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=recurrence%20relations" title=" recurrence relations"> recurrence relations</a> </p> <a href="https://publications.waset.org/abstracts/57605/semilocal-convergence-of-a-three-step-fifth-order-iterative-method-under-holder-continuity-condition-in-banach-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57605.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">612</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">5777</span> Maxwell’s Economic Demon Hypothesis and the Impossibility of Economic Convergence of Developing Economies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Firano%20Zakaria">Firano Zakaria</a>, <a href="https://publications.waset.org/abstracts/search?q=Filali%20Adib%20Fatine"> Filali Adib Fatine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The issue f convergence in theoretical models (classical or Keynesian) has been widely discussed. The results of the work affirm that most countries are seeking to get as close as possible to a steady state in order to catch up with developed countries. In this paper, we have retested this question whether it is absolute or conditional. The results affirm that the degree of convergence of countries like Morocco is very low and income is still far from its equilibrium state. Moreover, the analysis of financial convergence, of the countries in our panel, states that the pace in this sector is more intense: countries are converging more rapidly in financial terms. The question arises as to why, with a fairly convergent financial system, growth does not respond, yet the financial system should facilitate this economic convergence. Our results confirm that the degree of information exchange between the financial system and the economic system did not change significantly between 1985 and 2017. This leads to the hypothesis that the financial system is failing to serve its role as a creator of information in developing countries despite all the reforms undertaken, thus making the existence of an economic demon in the Maxwell prevail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20convergence" title="economic convergence">economic convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20convergence" title=" financial convergence"> financial convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20system" title=" financial system"> financial system</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy" title=" entropy"> entropy</a> </p> <a href="https://publications.waset.org/abstracts/158839/maxwells-economic-demon-hypothesis-and-the-impossibility-of-economic-convergence-of-developing-economies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158839.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">91</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">5776</span> Localized Meshfree Methods for Solving 3D-Helmholtz Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reza%20Mollapourasl">Reza Mollapourasl</a>, <a href="https://publications.waset.org/abstracts/search?q=Majid%20Haghi"> Majid Haghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we develop local meshfree methods known as radial basis function-generated finite difference (RBF-FD) method and Hermite finite difference (RBF-HFD) method to design stencil weights and spatial discretization for Helmholtz equation. The convergence and stability of schemes are investigated numerically in three dimensions with irregular shaped domain. These localized meshless methods incorporate the advantages of the RBF method, finite difference and Hermite finite difference methods to handle the ill-conditioning issue that often destroys the convergence rate of global RBF methods. Moreover, numerical illustrations show that the proposed localized RBF type methods are efficient and applicable for problems with complex geometries. The convergence and accuracy of both schemes are compared by solving a test problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=radial%20basis%20functions" title="radial basis functions">radial basis functions</a>, <a href="https://publications.waset.org/abstracts/search?q=Hermite%20finite%20difference" title=" Hermite finite difference"> Hermite finite difference</a>, <a href="https://publications.waset.org/abstracts/search?q=Helmholtz%20equation" title=" Helmholtz equation"> Helmholtz equation</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a> </p> <a href="https://publications.waset.org/abstracts/168736/localized-meshfree-methods-for-solving-3d-helmholtz-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168736.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">99</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">5775</span> Non-Pharmacological Approach to the Improvement and Maintenance of the Convergence Parameter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andreas%20Aceranti">Andreas Aceranti</a>, <a href="https://publications.waset.org/abstracts/search?q=Guido%20Bighiani"> Guido Bighiani</a>, <a href="https://publications.waset.org/abstracts/search?q=Francesca%20Crotto"> Francesca Crotto</a>, <a href="https://publications.waset.org/abstracts/search?q=Marco%20Colorato"> Marco Colorato</a>, <a href="https://publications.waset.org/abstracts/search?q=Stefania%20Zaghi"> Stefania Zaghi</a>, <a href="https://publications.waset.org/abstracts/search?q=Marino%20Zanetti"> Marino Zanetti</a>, <a href="https://publications.waset.org/abstracts/search?q=Simonetta%20Vernocchi"> Simonetta Vernocchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The management of eye parameters such as convergence, accommodation, and miosis is very complex; in fact, both the neurovegetative system and the complex Oculocephalgiria system come into play. We have found the effectiveness of the "highvelocity low amplitude" technique directed on C7-T1 (where the cilio-spinal nucleus of the budge is located) in improving the convergence parameter through the measurement of the point of maximum convergence. With this research, we set out to investigate whether the improvement obtained through the High Velocity Low Amplitude maneuver lasts over time, carrying out a pre-manipulation measurement, one immediately after manipulation and one month after manipulation. We took a population of 30 subjects with both refractive and non-refractive problems. Of the 30 patients tested, 27 gave a positive result after the High Velocity Low Amplitude maneuver, giving an improvement in the point of maximum convergence. After a month, we retested all 27 subjects: some further improved the result, others kept, and three subjects slightly lost the gain obtained. None of the re-tested patients returned to the point of maximum convergence starting pre-manipulation. This result opens the door to a multidisciplinary approach between ophthalmologists and osteopaths with the aim of addressing oculomotricity and convergence deficits that increasingly afflict our society due to the massive use of devices and for the conduct of life in closed and restricted environments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=point%20of%20maximum%20convergence" title="point of maximum convergence">point of maximum convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=HVLA" title=" HVLA"> HVLA</a>, <a href="https://publications.waset.org/abstracts/search?q=improvement%20in%20PPC" title=" improvement in PPC"> improvement in PPC</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a> </p> <a href="https://publications.waset.org/abstracts/160010/non-pharmacological-approach-to-the-improvement-and-maintenance-of-the-convergence-parameter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160010.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">78</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">5774</span> Sequential Covering Algorithm for Nondifferentiable Global Optimization Problem and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Rahal">Mohamed Rahal</a>, <a href="https://publications.waset.org/abstracts/search?q=Djaouida%20Guetta"> Djaouida Guetta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the one-dimensional unconstrained global optimization problem of continuous functions satifying a Hölder condition is considered. We extend the algorithm of sequential covering SCA for Lipschitz functions to a large class of Hölder functions. The convergence of the method is studied and the algorithm can be applied to systems of nonlinear equations. Finally, some numerical examples are presented and illustrate the efficiency of the present approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title="global optimization">global optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%B6lder%20functions" title=" Hölder functions"> Hölder functions</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20covering%20method" title=" sequential covering method"> sequential covering method</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20of%20nonlinear%20equations" title=" systems of nonlinear equations"> systems of nonlinear equations</a> </p> <a href="https://publications.waset.org/abstracts/6507/sequential-covering-algorithm-for-nondifferentiable-global-optimization-problem-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6507.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">370</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">5773</span> A Case Study on the Long-Term Stability Monitoring of Underground Powerhouse Complex Using Geotechnical Instrumentation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sudhakar%20Kadiyala">Sudhakar Kadiyala</a>, <a href="https://publications.waset.org/abstracts/search?q=Sripad%20R.%20Naik"> Sripad R. Naik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Large cavern in Bhutan Himalayas is being monitored since the construction period. The behavior of the cavern is being monitored for last 16 years. Instrumentation includes measurement of convergence of high walls by geodetic monitoring, load on the support systems with load cells and instrumented bolts. Analysis of the results of instrumentation showed that during the construction period of the cavern, the convergence of the cavern varied from 181 - 233 mm in the unit bay area with maximum convergence rate of 2.80mm/day. Whereas during the operational period the total convergence observed was in the range of 21 to 45 mm during a period of 11.30 years with convergence rate of 0.005 to 0.011 mm/day. During the last five years, there were no instances of high tensile stress recorded by the instrumented bolts. Load on the rock bolts have shown stabilization trend at most of the locations. This paper discusses in detail the results of long-term monitoring using the geotechnical instruments and how the data is being used in 3D numerical model to confirm the stability of the cavern. <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=displacements" title=" displacements"> displacements</a>, <a href="https://publications.waset.org/abstracts/search?q=geodetic%20monitoring" title=" geodetic monitoring"> geodetic monitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=long-term%20stability" title=" long-term stability "> long-term stability </a> </p> <a href="https://publications.waset.org/abstracts/96431/a-case-study-on-the-long-term-stability-monitoring-of-underground-powerhouse-complex-using-geotechnical-instrumentation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96431.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">180</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">5772</span> Evaluation of Quasi-Newton Strategy for Algorithmic Acceleration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Martini">T. Martini</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20M.%20Mart%C3%ADnez"> J. M. Martínez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An algorithmic acceleration strategy based on quasi-Newton (or secant) methods is displayed for address the practical problem of accelerating the convergence of the Newton-Lagrange method in the case of convergence to critical multipliers. Since the Newton-Lagrange iteration converges locally at a linear rate, it is natural to conjecture that quasi-Newton methods based on the so called secant equation and some minimal variation principle, could converge superlinearly, thus restoring the convergence properties of Newton's method. This strategy can also be applied to accelerate the convergence of algorithms applied to fixed-points problems. Computational experience is reported illustrating the efficiency of this strategy to solve fixed-point problems with linear convergence rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithmic%20acceleration" title="algorithmic acceleration">algorithmic acceleration</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed-point%20problems" title=" fixed-point problems"> fixed-point problems</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi-newton%20method" title=" quasi-newton method"> quasi-newton method</a> </p> <a href="https://publications.waset.org/abstracts/35723/evaluation-of-quasi-newton-strategy-for-algorithmic-acceleration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35723.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">489</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">5771</span> Random Walks and Option Pricing for European and American Options</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guillaume%20Leduc">Guillaume Leduc</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we describe a broad setting under which the error of the approximation can be quantified, controlled, and for which convergence occurs at a speed of n⁻¹ for European and American options. We describe how knowledge of the error allows for arbitrarily fast acceleration of the convergence. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=random%20walk%20approximation" title="random walk approximation">random walk approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=European%20and%20American%20options" title=" European and American options"> European and American options</a>, <a href="https://publications.waset.org/abstracts/search?q=rate%20of%20convergence" title=" rate of convergence"> rate of convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=option%20pricing" title=" option pricing"> option pricing</a> </p> <a href="https://publications.waset.org/abstracts/23942/random-walks-and-option-pricing-for-european-and-american-options" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23942.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">5770</span> Harmonization in International Trade Law</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pouria%20Ghidi">Pouria Ghidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Creating convergence in trade is very important, but in practice, this seems out of reach due to the conflict of interests and views of countries. The most important mission of UNCITRAL is to standardize and modernize international trade law through legislative and non-legislative tools on various issues of international trade law between governments. Unfortunately, the performance of governments has shown that, except in some cases, unity is not welcomed. Therefore, although unification is envisaged as a goal, it is more practical to create convergence between countries. In a variety of ways, UNCITRAL seeks to create a kind of common ground between influential actors in the international trade law system that approaches a degree of convergence of views. Accordingly, this realization seeks to find these mechanisms and their impact on creating convergence among actors in the field of international trade. In other words, this study seeks to address the question of what tools the UN Commission on International Trade Law uses to develop the convergence of rules and regulations in this area, which groups it targets, and at what levels they work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=UNCITRAL" title="UNCITRAL">UNCITRAL</a>, <a href="https://publications.waset.org/abstracts/search?q=harmonization" title=" harmonization"> harmonization</a>, <a href="https://publications.waset.org/abstracts/search?q=unification%20in%20interpretation" title=" unification in interpretation"> unification in interpretation</a>, <a href="https://publications.waset.org/abstracts/search?q=international%20trade%20law" title=" international trade law"> international trade law</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20laws" title=" model laws"> model laws</a> </p> <a href="https://publications.waset.org/abstracts/188310/harmonization-in-international-trade-law" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/188310.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">35</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">5769</span> Convergence Analysis of Training Two-Hidden-Layer Partially Over-Parameterized ReLU Networks via Gradient Descent</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhifeng%20Kong">Zhifeng Kong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over-parameterized neural networks have attracted a great deal of attention in recent deep learning theory research, as they challenge the classic perspective of over-fitting when the model has excessive parameters and have gained empirical success in various settings. While a number of theoretical works have been presented to demystify properties of such models, the convergence properties of such models are still far from being thoroughly understood. In this work, we study the convergence properties of training two-hidden-layer partially over-parameterized fully connected networks with the Rectified Linear Unit activation via gradient descent. To our knowledge, this is the first theoretical work to understand convergence properties of deep over-parameterized networks without the equally-wide-hidden-layer assumption and other unrealistic assumptions. We provide a probabilistic lower bound of the widths of hidden layers and proved linear convergence rate of gradient descent. We also conducted experiments on synthetic and real-world datasets to validate our theory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=over-parameterization" title="over-parameterization">over-parameterization</a>, <a href="https://publications.waset.org/abstracts/search?q=rectified%20linear%20units%20ReLU" title=" rectified linear units ReLU"> rectified linear units ReLU</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=gradient%20descent" title=" gradient descent"> gradient descent</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a> </p> <a href="https://publications.waset.org/abstracts/118561/convergence-analysis-of-training-two-hidden-layer-partially-over-parameterized-relu-networks-via-gradient-descent" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118561.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">142</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">5768</span> CFD Study for Normal and Rifled Tube with a Convergence Check</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sharfi%20Dirar">Sharfi Dirar</a>, <a href="https://publications.waset.org/abstracts/search?q=Shihab%20Elhaj"> Shihab Elhaj</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20El%20Fatih"> Ahmed El Fatih</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computational fluid dynamics were used to simulate and study the heated water boiler tube for both normal and rifled tube with a refinement of the mesh to check the convergence. The operation condition was taken from GARRI power station and used in a boundary condition accordingly. The result indicates the rifled tube has higher heat transfer efficiency than the normal tube. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=boiler%20tube" title="boiler tube">boiler tube</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20check" title=" convergence check"> convergence check</a>, <a href="https://publications.waset.org/abstracts/search?q=normal%20tube" title=" normal tube"> normal tube</a>, <a href="https://publications.waset.org/abstracts/search?q=rifled%20tube" title=" rifled tube"> rifled tube</a> </p> <a href="https://publications.waset.org/abstracts/37253/cfd-study-for-normal-and-rifled-tube-with-a-convergence-check" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37253.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">334</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5767</span> Improving the Performance of Back-Propagation Training Algorithm by Using ANN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Pratap%20Singh%20Kirar">Vishnu Pratap Singh Kirar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Artificial Neural Network (ANN) can be trained using backpropagation (BP). It is the most widely used algorithm for supervised learning with multi-layered feed-forward networks. Efficient learning by the BP algorithm is required for many practical applications. The BP algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a two-term algorithm consisting of a learning rate (LR) and a momentum factor (MF). The major drawbacks of the two-term BP learning algorithm are the problems of local minima and slow convergence speeds, which limit the scope for real-time applications. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and criteria for evaluating convergence are required to facilitate the application of the three terms BP algorithm. Although these two seem to be closely related, as described later, we summarize various improvements to overcome the drawbacks. Here we compare the different methods of convergence of the new three-term BP algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title="neural network">neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=backpropagation" title=" backpropagation"> backpropagation</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20minima" title=" local minima"> local minima</a>, <a href="https://publications.waset.org/abstracts/search?q=fast%20convergence%20rate" title=" fast convergence rate"> fast convergence rate</a> </p> <a href="https://publications.waset.org/abstracts/22746/improving-the-performance-of-back-propagation-training-algorithm-by-using-ann" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22746.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">498</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">5766</span> Divergence of Innovation Capabilities within the EU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vishal%20Jaunky">Vishal Jaunky</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonas%20Grafstr%C3%B6m"> Jonas Grafström</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development of the European Union’s (EU) single economic market and rapid technological change has resulted in major structural changes in EU’s member states economies. The general liberalization process that the countries has undergone together has convinced the governments of the member states of need to upgrade their economic and training systems in order to be able to face the economic globalization. Several signs of economic convergence have been found but less is known about the knowledge production. This paper addresses the convergence pattern of technological innovation in 13 European Union (EU) states over the time period 1990-2011 by means of parametric and non-parametric techniques. Parametric approaches revolve around the neoclassical convergence theories. This paper reveals divergence of both the β and σ types. Further, we found evidence of stochastic divergence and non-parametric convergence approach such as distribution dynamics shows a tendency towards divergence. This result is supported with the occurrence of γ-divergence. The policies of the EU to reduce technological gap among its member states seem to be missing its target, something that can have negative long run consequences for the market. <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=patents" title=" patents"> patents</a>, <a href="https://publications.waset.org/abstracts/search?q=panel%20data" title=" panel data"> panel data</a>, <a href="https://publications.waset.org/abstracts/search?q=European%20union" title=" European union"> European union</a> </p> <a href="https://publications.waset.org/abstracts/7910/divergence-of-innovation-capabilities-within-the-eu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7910.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">289</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">5765</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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5764</span> A Modified Nonlinear Conjugate Gradient Algorithm for Large Scale Unconstrained Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tsegay%20Giday%20Woldu">Tsegay Giday Woldu</a>, <a href="https://publications.waset.org/abstracts/search?q=Haibin%20Zhang"> Haibin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xin%20Zhang"> Xin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yemane%20Hailu%20Fissuh"> Yemane Hailu Fissuh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is well known that nonlinear conjugate gradient method is one of the widely used first order methods to solve large scale unconstrained smooth optimization problems. Because of the low memory requirement, attractive theoretical features, practical computational efficiency and nice convergence properties, nonlinear conjugate gradient methods have a special role for solving large scale unconstrained optimization problems. Large scale optimization problems are with important applications in practical and scientific world. However, nonlinear conjugate gradient methods have restricted information about the curvature of the objective function and they are likely less efficient and robust compared to some second order algorithms. To overcome these drawbacks, the new modified nonlinear conjugate gradient method is presented. The noticeable features of our work are that the new search direction possesses the sufficient descent property independent of any line search and it belongs to a trust region. Under mild assumptions and standard Wolfe line search technique, the global convergence property of the proposed algorithm is established. Furthermore, to test the practical computational performance of our new algorithm, numerical experiments are provided and implemented on the set of some large dimensional unconstrained problems. The numerical results show that the proposed algorithm is an efficient and robust compared with other similar algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title="conjugate gradient method">conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20scale%20optimization" title=" large scale optimization"> large scale optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a> </p> <a href="https://publications.waset.org/abstracts/102625/a-modified-nonlinear-conjugate-gradient-algorithm-for-large-scale-unconstrained-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102625.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">206</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">5763</span> A Fast Convergence Subband BSS Structure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salah%20Al-Din%20I.%20Badran">Salah Al-Din I. Badran</a>, <a href="https://publications.waset.org/abstracts/search?q=Samad%20Ahmadi"> Samad Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ismail%20Shahin"> Ismail Shahin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A blind source separation method is proposed; in this method we use a non-uniform filter bank and a novel normalisation. This method provides a reduced computational complexity and increased convergence speed comparing to the full-band algorithm. Recently, adaptive sub-band scheme has been recommended to solve two problems: reduction of computational complexity and increase the convergence speed of the adaptive algorithm for correlated input signals. In this work the reduction in computational complexity is achieved with the use of adaptive filters of orders less than the full-band adaptive filters, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full bandwidth, and can promote better rates of convergence. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blind%20source%20separation" title="blind source separation">blind source separation</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20complexity" title=" computational complexity"> computational complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=subband" title=" subband"> subband</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20speed" title=" convergence speed"> convergence speed</a>, <a href="https://publications.waset.org/abstracts/search?q=mixture" title=" mixture"> mixture</a> </p> <a href="https://publications.waset.org/abstracts/33150/a-fast-convergence-subband-bss-structure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33150.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">555</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=global%20convergence&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&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=global%20convergence&page=193">193</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&page=194">194</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=global%20convergence&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>