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: approximate/adaptive dynamic programming</title> <meta name="description" content="Search results for: approximate/adaptive dynamic programming"> <meta name="keywords" content="approximate/adaptive dynamic programming"> <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="approximate/adaptive dynamic programming" 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="approximate/adaptive dynamic programming"> <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> 5987</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: approximate/adaptive dynamic programming</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5987</span> Adaptive Optimal Controller for Uncertain Inverted Pendulum System: A Dynamic Programming Approach for Continuous Time System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dao%20Phuong%20Nam">Dao Phuong Nam</a>, <a href="https://publications.waset.org/abstracts/search?q=Tran%20Van%20Tuyen"> Tran Van Tuyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Do%20Trong%20Tan"> Do Trong Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Bui%20Minh%20Dinh"> Bui Minh Dinh</a>, <a href="https://publications.waset.org/abstracts/search?q=Nguyen%20Van%20Huong"> Nguyen Van Huong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the adaptive optimal control law for continuous-time systems with input disturbances and unknown parameters. This paper extends previous works to obtain the robust control law of uncertain systems. Through theoretical analysis, an adaptive dynamic programming (ADP) based optimal control is proposed to stabilize the closed-loop system and ensure the convergence properties of proposed iterative algorithm. Moreover, the global asymptotic stability (GAS) for closed system is also analyzed. The theoretical analysis for continuous-time systems and simulation results demonstrate the performance of the proposed algorithm for an inverted pendulum system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming" title="approximate/adaptive dynamic programming">approximate/adaptive dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=ADP" title=" ADP"> ADP</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20optimal%20control%20law" title=" adaptive optimal control law"> adaptive optimal control law</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20state%20stability" title=" input state stability"> input state stability</a>, <a href="https://publications.waset.org/abstracts/search?q=ISS" title=" ISS"> ISS</a>, <a href="https://publications.waset.org/abstracts/search?q=inverted%20pendulum" title=" inverted pendulum"> inverted pendulum</a> </p> <a href="https://publications.waset.org/abstracts/80356/adaptive-optimal-controller-for-uncertain-inverted-pendulum-system-a-dynamic-programming-approach-for-continuous-time-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80356.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">194</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">5986</span> A New Sign Subband Adaptive Filter Based on Dynamic Selection of Subbands</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Shams%20Esfand%20Abadi">Mohammad Shams Esfand Abadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehrdad%20Zalaghi"> Mehrdad Zalaghi</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20ebrahimpour"> Reza ebrahimpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a sign adaptive filter algorithm with the ability of dynamic selection of subband filters which leads to low computational complexity compared with conventional sign subband adaptive filter (SSAF) algorithm. Dynamic selection criterion is based on largest reduction of the mean square deviation at each adaption. We demonstrate that this simple proposed algorithm has the same performance of the conventional SSAF and somewhat faster than it. In the presence of impulsive interferences robustness of the simple proposed algorithm as well as the conventional SSAF and outperform the conventional normalized subband adaptive filter (NSAF) algorithm. Therefore, it is preferred for environments under impulsive interferences. Simulation results are presented to verify these above considerations very well have been achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=acoustic%20echo%20cancellation%20%28AEC%29" title="acoustic echo cancellation (AEC)">acoustic echo cancellation (AEC)</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20subband%20adaptive%20filter%20%28NSAF%29" title=" normalized subband adaptive filter (NSAF)"> normalized subband adaptive filter (NSAF)</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20selection%20subband%20adaptive%20filter%20%28DS-NSAF%29" title=" dynamic selection subband adaptive filter (DS-NSAF)"> dynamic selection subband adaptive filter (DS-NSAF)</a>, <a href="https://publications.waset.org/abstracts/search?q=sign%20subband%20adaptive%20filter%20%28SSAF%29" title=" sign subband adaptive filter (SSAF)"> sign subband adaptive filter (SSAF)</a>, <a href="https://publications.waset.org/abstracts/search?q=impulsive%20noise" title=" impulsive noise"> impulsive noise</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20filtering" title=" robust filtering"> robust filtering</a> </p> <a href="https://publications.waset.org/abstracts/20230/a-new-sign-subband-adaptive-filter-based-on-dynamic-selection-of-subbands" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20230.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">599</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">5985</span> A New Approach for Generalized First Derivative of Nonsmooth Functions Using Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Mehdi%20Mazarei">Mohammad Mehdi Mazarei</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Asghar%20Behroozpoor"> Ali Asghar Behroozpoor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we define an optimization problem corresponding to smooth and nonsmooth functions which its optimal solution is the first derivative of these functions in a domain. For this purpose, a linear programming problem corresponding to optimization problem is obtained. The optimal solution of this linear programming problem is the approximate generalized first derivative. In fact, we approximate generalized first derivative of nonsmooth functions as tailor series. We show the efficiency of our approach by some smooth and nonsmooth functions in some examples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=general%20derivative" title="general derivative">general derivative</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20problem" title=" optimization problem"> optimization problem</a>, <a href="https://publications.waset.org/abstracts/search?q=smooth%20and%20nonsmooth%20functions" title=" smooth and nonsmooth functions"> smooth and nonsmooth functions</a> </p> <a href="https://publications.waset.org/abstracts/19425/a-new-approach-for-generalized-first-derivative-of-nonsmooth-functions-using-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19425.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">557</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5984</span> Approximate Solution of Some Mixed Boundary Value Problems of the Generalized Theory of Couple-Stress Thermo-Elasticity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manana%20Chumburidze">Manana Chumburidze</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Lekveishvili"> David Lekveishvili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We have considered the harmonic oscillations and general dynamic (pseudo oscillations) systems of theory generalized Green-Lindsay of couple-stress thermo-elasticity for isotropic, homogeneous elastic media. Approximate solution of some mixed boundary value problems for finite domain, bounded by the some closed surface are constructed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=the%20couple-stress%20thermoelasticity" title="the couple-stress thermoelasticity">the couple-stress thermoelasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=boundary%20value%20problems" title=" boundary value problems"> boundary value problems</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20problems" title=" dynamic problems"> dynamic problems</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20solution" title=" approximate solution"> approximate solution</a> </p> <a href="https://publications.waset.org/abstracts/9383/approximate-solution-of-some-mixed-boundary-value-problems-of-the-generalized-theory-of-couple-stress-thermo-elasticity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9383.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">506</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5983</span> Dynamic Process Monitoring of an Ammonia Synthesis Fixed-Bed Reactor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bothinah%20Altaf">Bothinah Altaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Gary%20Montague"> Gary Montague</a>, <a href="https://publications.waset.org/abstracts/search?q=Elaine%20B.%20Martin"> Elaine B. Martin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study involves the modeling and monitoring of an ammonia synthesis fixed-bed reactor using partial least squares (PLS) and its variants. The process exhibits complex dynamic behavior due to the presence of heat recycling and feed quench. One limitation of static PLS model in this situation is that it does not take account of the process dynamics and hence dynamic PLS was used. Although it showed, superior performance to static PLS in terms of prediction, the monitoring scheme was inappropriate hence adaptive PLS was considered. A limitation of adaptive PLS is that non-conforming observations also contribute to the model, therefore, a new adaptive approach was developed, robust adaptive dynamic PLS. This approach updates a dynamic PLS model and is robust to non-representative data. The developed methodology showed a clear improvement over existing approaches in terms of the modeling of the reactor and the detection of faults. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ammonia%20synthesis%20fixed-bed%20reactor" title="ammonia synthesis fixed-bed reactor">ammonia synthesis fixed-bed reactor</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20partial%20least%20squares%20modeling" title=" dynamic partial least squares modeling"> dynamic partial least squares modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20partial%20least%20squares" title=" recursive partial least squares"> recursive partial least squares</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20modeling" title=" robust modeling"> robust modeling</a> </p> <a href="https://publications.waset.org/abstracts/37994/dynamic-process-monitoring-of-an-ammonia-synthesis-fixed-bed-reactor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37994.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">5982</span> A Study of Using Multiple Subproblems in Dantzig-Wolfe Decomposition of Linear Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=William%20Chung">William Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is to study the use of multiple subproblems in Dantzig-Wolfe decomposition of linear programming (DW-LP). Traditionally, the decomposed LP consists of one LP master problem and one LP subproblem. The master problem and the subproblem is solved alternatively by exchanging the dual prices of the master problem and the proposals of the subproblem until the LP is solved. It is well known that convergence is slow with a long tail of near-optimal solutions (asymptotic convergence). Hence, the performance of DW-LP highly depends upon the number of decomposition steps. If the decomposition steps can be greatly reduced, the performance of DW-LP can be improved significantly. To reduce the number of decomposition steps, one of the methods is to increase the number of proposals from the subproblem to the master problem. To do so, we propose to add a quadratic approximation function to the LP subproblem in order to develop a set of approximate-LP subproblems (multiple subproblems). Consequently, in each decomposition step, multiple subproblems are solved for providing multiple proposals to the master problem. The number of decomposition steps can be reduced greatly. Note that each approximate-LP subproblem is nonlinear programming, and solving the LP subproblem must faster than solving the nonlinear multiple subproblems. Hence, using multiple subproblems in DW-LP is the tradeoff between the number of approximate-LP subproblems being formed and the decomposition steps. In this paper, we derive the corresponding algorithms and provide some simple computational results. Some properties of the resulting algorithms are also given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20subproblem" title="approximate subproblem">approximate subproblem</a>, <a href="https://publications.waset.org/abstracts/search?q=Dantzig-Wolfe%20decomposition" title=" Dantzig-Wolfe decomposition"> Dantzig-Wolfe decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=large-scale%20models" title=" large-scale models"> large-scale models</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20subproblems" title=" multiple subproblems"> multiple subproblems</a> </p> <a href="https://publications.waset.org/abstracts/110435/a-study-of-using-multiple-subproblems-in-dantzig-wolfe-decomposition-of-linear-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110435.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">166</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5981</span> Dynamic Store Procedures in Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammet%20Dursun%20Kaya">Muhammet Dursun Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Asil"> Hasan Asil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, different methods have been proposed to optimize question processing in database. Although different methods have been proposed to optimize the query, but the problem which exists here is that most of these methods destroy the query execution plan after executing the query. This research attempts to solve the above problem by using a combination of methods of communicating with the database (the present questions in the programming code and using store procedures) and making query processing adaptive in database, and proposing a new approach for optimization of query processing by introducing the idea of dynamic store procedures. This research creates dynamic store procedures in the database according to the proposed algorithm. This method has been tested on applied software and results shows a significant improvement in reducing the query processing time and also reducing the workload of DBMS. Other advantages of this algorithm include: making the programming environment a single environment, eliminating the parametric limitations of the stored procedures in the database, making the stored procedures in the database dynamic, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title="relational database">relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=agent" title=" agent"> agent</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20processing" title=" query processing"> query processing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptable" title=" adaptable"> adaptable</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20with%20the%20database" title=" communication with the database"> communication with the database</a> </p> <a href="https://publications.waset.org/abstracts/35023/dynamic-store-procedures-in-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35023.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">372</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">5980</span> On Optimum Stratification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan">M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20D.%20Prasad"> V. D. Prasad</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao"> D. K. Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20variable" title="auxiliary variable">auxiliary variable</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20problem" title=" nonlinear programming problem"> nonlinear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20stratification" title=" optimum stratification"> optimum stratification</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20distribution" title=" uniform distribution"> uniform distribution</a> </p> <a href="https://publications.waset.org/abstracts/6677/on-optimum-stratification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6677.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">5979</span> Optimum Stratiﬁcation of a Skewed Population</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao">D. K. Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan"> M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20G.%20Reddy"> K. G. Reddy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The focus of this paper is to develop a technique of solving a combined problem of determining Optimum Strata Boundaries (OSB) and Optimum Sample Size (OSS) of each stratum, when the population understudy is skewed and the study variable has a Pareto frequency distribution. The problem of determining the OSB is formulated as a Mathematical Programming Problem (MPP) which is then solved by dynamic programming technique. A numerical example is presented to illustrate the computational details of the proposed method. The proposed technique is useful to obtain OSB and OSS for a Pareto type skewed population, which minimizes the variance of the estimate of population mean. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=strati%EF%AC%81ed%20sampling" title="stratiﬁed sampling">stratiﬁed sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20strata%20boundaries" title=" optimum strata boundaries"> optimum strata boundaries</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20sample%20size" title=" optimum sample size"> optimum sample size</a>, <a href="https://publications.waset.org/abstracts/search?q=pareto%20distribution" title=" pareto distribution"> pareto distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming%20problem" title=" mathematical programming problem"> mathematical programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a> </p> <a href="https://publications.waset.org/abstracts/5894/optimum-stratification-of-a-skewed-population" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5894.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">455</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">5978</span> Estimation of Rare and Clustered Population Mean Using Two Auxiliary Variables in Adaptive Cluster Sampling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Nouman%20Qureshi">Muhammad Nouman Qureshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Hanif"> Muhammad Hanif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Adaptive cluster sampling (ACS) is specifically developed for the estimation of highly clumped populations and applied to a wide range of situations like animals of rare and endangered species, uneven minerals, HIV patients and drug users. In this paper, we proposed a generalized semi-exponential estimator with two auxiliary variables under the framework of ACS design. The expressions of approximate bias and mean square error (MSE) of the proposed estimator are derived. Theoretical comparisons of the proposed estimator have been made with existing estimators. A numerical study is conducted on real and artificial populations to demonstrate and compare the efficiencies of the proposed estimator. The results indicate that the proposed generalized semi-exponential estimator performed considerably better than all the adaptive and non-adaptive estimators considered in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20information" title="auxiliary information">auxiliary information</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20cluster%20sampling" title=" adaptive cluster sampling"> adaptive cluster sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=clustered%20populations" title=" clustered populations"> clustered populations</a>, <a href="https://publications.waset.org/abstracts/search?q=Hansen-Hurwitz%20estimation" title=" Hansen-Hurwitz estimation"> Hansen-Hurwitz estimation</a> </p> <a href="https://publications.waset.org/abstracts/98047/estimation-of-rare-and-clustered-population-mean-using-two-auxiliary-variables-in-adaptive-cluster-sampling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98047.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">238</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">5977</span> Designing Intelligent Adaptive Controller for Nonlinear Pendulum Dynamical System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Ghasemi">R. Ghasemi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Rahimi%20Khoygani"> M. R. Rahimi Khoygani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes the designing direct adaptive neural controller to apply for a class of a nonlinear pendulum dynamic system. The radial basis function (RBF) neural adaptive controller is robust in presence of external and internal uncertainties. Both the effectiveness of the controller and robustness against disturbances are importance of this paper. The simulation results show the promising performance of the proposed controller. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20neural%20controller" title="adaptive neural controller">adaptive neural controller</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20dynamical" title=" nonlinear dynamical"> nonlinear dynamical</a>, <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=RBF" title=" RBF"> RBF</a>, <a href="https://publications.waset.org/abstracts/search?q=driven%20pendulum" title=" driven pendulum"> driven pendulum</a>, <a href="https://publications.waset.org/abstracts/search?q=position%20control" title=" position control "> position control </a> </p> <a href="https://publications.waset.org/abstracts/13745/designing-intelligent-adaptive-controller-for-nonlinear-pendulum-dynamical-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13745.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">482</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">5976</span> Optimal Management of Forest Stands under Wind Risk in Czech Republic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zohreh%20Mohammadi">Zohreh Mohammadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Jan%20Kaspar"> Jan Kaspar</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Lohmander"> Peter Lohmander</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20Marusak"> Robert Marusak</a>, <a href="https://publications.waset.org/abstracts/search?q=Harald%20Vacik"> Harald Vacik</a>, <a href="https://publications.waset.org/abstracts/search?q=Ljusk%20Ola%20%20Eriksson"> Ljusk Ola Eriksson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Storms are important damaging agents in European forest ecosystems. In the latest decades, significant economic losses in European forestry occurred due to storms. This study investigates the problem of optimal harvest planning when forest stands risk to be felled by storms. One of the most applicable mathematical methods which are being used to optimize forest management is stochastic dynamic programming (SDP). This method belongs to the adaptive optimization class. Sequential decisions, such as harvest decisions, can be optimized based on sequential information about events that cannot be perfectly predicted, such as the future storms and the future states of wind protection from other forest stands. In this paper, stochastic dynamic programming is used to maximize the expected present value of the profits from an area consisting of several forest stands. The region of analysis is the Czech Republic. The harvest decisions, in a particular time period, should be simultaneously taken in all neighbor stands. The reason is that different stands protect each other from possible winds. The optimal harvest age of a particular stand is a function of wind speed and different wind protection effects. The optimal harvest age often decreases with wind speed, but it cannot be determined for one stand at a time. When we consider a particular stand, this stand also protects other stands. Furthermore, the particular stand is protected by neighbor stands. In some forest stands, it may even be rational to increase the harvest age under the influence of stronger winds, in order to protect more valuable stands in the neighborhood. It is important to integrate wind risk in forestry decision-making. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Czech%20republic" title="Czech republic">Czech republic</a>, <a href="https://publications.waset.org/abstracts/search?q=forest%20stands" title=" forest stands"> forest stands</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20dynamic%20programming" title=" stochastic dynamic programming"> stochastic dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=wind%20risk" title=" wind risk"> wind risk</a> </p> <a href="https://publications.waset.org/abstracts/126598/optimal-management-of-forest-stands-under-wind-risk-in-czech-republic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126598.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">147</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">5975</span> Iterative Dynamic Programming for 4D Flight Trajectory Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kawser%20Ahmed">Kawser Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Bousson"> K. Bousson</a>, <a href="https://publications.waset.org/abstracts/search?q=Milca%20F.%20Coelho"> Milca F. Coelho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> 4D flight trajectory optimization is one of the key ingredients to improve flight efficiency and to enhance the air traffic capacity in the current air traffic management (ATM). The present paper explores the iterative dynamic programming (IDP) as a potential numerical optimization method for 4D flight trajectory optimization. IDP is an iterative version of the Dynamic programming (DP) method. Due to the numerical framework, DP is very suitable to deal with nonlinear discrete dynamic systems. The 4D waypoint representation of the flight trajectory is similar to the discretization by a grid system; thus DP is a natural method to deal with the 4D flight trajectory optimization. However, the computational time and space complexity demanded by the DP is enormous due to the immense number of grid points required to find the optimum, which prevents the use of the DP in many practical high dimension problems. On the other hand, the IDP has shown potentials to deal successfully with high dimension optimal control problems even with a few numbers of grid points at each stage, which reduces the computational effort over the traditional DP approach. Although the IDP has been applied successfully in chemical engineering problems, IDP is yet to be validated in 4D flight trajectory optimization problems. In this paper, the IDP has been successfully used to generate minimum length 4D optimal trajectory avoiding any obstacle in its path, such as a no-fly zone or residential areas when flying in low altitude to reduce noise pollution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=4D%20waypoint%20navigation" title="4D waypoint navigation">4D waypoint navigation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming" title=" iterative dynamic programming"> iterative dynamic programming</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=trajectory%20optimization" title=" trajectory optimization"> trajectory optimization</a> </p> <a href="https://publications.waset.org/abstracts/106496/iterative-dynamic-programming-for-4d-flight-trajectory-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106496.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">162</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">5974</span> Neural Adaptive Controller for a Class of Nonlinear Pendulum Dynamical System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Reza%20Rahimi%20Khoygani">Mohammad Reza Rahimi Khoygani</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Ghasemi"> Reza Ghasemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, designing direct adaptive neural controller is applied for a class of a nonlinear pendulum dynamic system. The radial basis function (RBF) is used for the Neural network (NN). The adaptive neural controller is robust in presence of external and internal uncertainties. Both the effectiveness of the controller and robustness against disturbances are the merits of this paper. The promising performance of the proposed controllers investigates in simulation results. <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=pendulum%20dynamical%20system" title=" pendulum dynamical system"> pendulum dynamical system</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20control" title=" nonlinear control"> nonlinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20neural%20controller" title=" adaptive neural controller"> adaptive neural controller</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20dynamical" title=" nonlinear dynamical"> nonlinear dynamical</a>, <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=RBF" title=" RBF"> RBF</a>, <a href="https://publications.waset.org/abstracts/search?q=driven%20pendulum" title=" driven pendulum"> driven pendulum</a>, <a href="https://publications.waset.org/abstracts/search?q=position%20control" title=" position control "> position control </a> </p> <a href="https://publications.waset.org/abstracts/13649/neural-adaptive-controller-for-a-class-of-nonlinear-pendulum-dynamical-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13649.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">670</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">5973</span> Adaptive Programming for Indigenous Early Learning: The Early Years Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rachel%20Buchanan">Rachel Buchanan</a>, <a href="https://publications.waset.org/abstracts/search?q=Rebecca%20LaRiviere"> Rebecca LaRiviere</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Context: The ongoing effects of colonialism continue to be experienced through paternalistic policies and funding processes that cause disjuncture between and across Indigenous early childhood programming on-reserve and in urban and Northern settings in Canada. While various educational organizations and social service providers have risen to address these challenges in the short, medium and long term, there continues to be a lack in nation-wide cohesive, culturally grounded, and meaningful early learning programming for Indigenous children in Canada. Indigenous-centered early learning programs tend to face one of two scaling dilemmas: their program goals are too prescriptive to enable the program to be meaningfully replicated in different cultural/ community settings, or their program goals are too broad to be meaningfully adapted to the unique cultural and contextual needs and desires of Indigenous communities (the “franchise approach”). There are over 600 First Nations communities in Canada representing more than 50 Nations and languages. Consequently, Indigenous early learning programming cannot be applied with a universal or “one size fits all” approach. Sustainable and comprehensive programming must be responsive to each community context, building upon existing strengths and assets to avoid program duplication and irrelevance. Thesis: Community-driven and culturally adapted early childhood programming is critical but cannot be achieved on a large scale within traditional program models that are constrained by prescriptive overarching program goals. Principles, rather than goals, are an effective way to navigate and evaluate complex and dynamic systems. Principles guide an intervention to be adaptable, flexible and scalable. The Martin Family Initiative (MFI) ’s Early Years program engages a principles-based approach to programming. As will be discussed in this paper, this approach enables the program to catalyze existing community-based strengths and organizational assets toward bridging gaps across and disjuncture between Indigenous early learning programs, as well as to scale programming in sustainable, context-responsive and dynamic ways. This paper argues that using a principles-driven and adaptive scaling approach, the Early Years model establishes important learnings for culturally adapted Indigenous early learning programming in Canada. Methodology: The Early Years has leveraged this approach to develop an array of programming with partner organizations and communities across the country. The Early Years began as a singular pilot project in one First Nation. In just three years, it has expanded to five different regions and community organizations. In each context, the program supports the partner organization through different means and to different ends, the extent to which is determined in partnership with each community-based organization: in some cases, this means supporting the organization to build home visiting programming from the ground-up; in others, it means offering organization-specific culturally adapted early learning resources to support the programming that already exists in communities. Principles underpin but do not define the practices of the program in each of these relationships. This paper will explore numerous examples of principles-based adaptability with the context of the Early Years, concluding that the program model offers theadaptability and dynamism necessary to respond to unique and ever-evolving community contexts and needs of Indigenous children today. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=culturally%20adapted%20programming" title="culturally adapted programming">culturally adapted programming</a>, <a href="https://publications.waset.org/abstracts/search?q=indigenous%20early%20learning" title=" indigenous early learning"> indigenous early learning</a>, <a href="https://publications.waset.org/abstracts/search?q=principles-based%20approach" title=" principles-based approach"> principles-based approach</a>, <a href="https://publications.waset.org/abstracts/search?q=program%20scaling" title=" program scaling"> program scaling</a> </p> <a href="https://publications.waset.org/abstracts/143007/adaptive-programming-for-indigenous-early-learning-the-early-years-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143007.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">186</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5972</span> A Dynamic Software Product Line Approach to Self-Adaptive Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelghani%20Alidra">Abdelghani Alidra</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Tahar%20Kimour"> Mohamed Tahar Kimour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithm must adapt themselves at design time to cope with the search problem specific requirements and at runtime to balance exploration and convergence objectives. In a previous article, we have shown that modeling and implementing Genetic Algorithms (GA) using the software product line (SPL) paradigm is very appreciable because they constitute a product family sharing a common base of code. In the present article we propose to extend the use of the feature model of the genetic algorithms family to model the potential states of the GA in what is called a Dynamic Software Product Line. The objective of this paper is the systematic generation of a reconfigurable architecture that supports the dynamic of the GA and which is easily deduced from the feature model. The resultant GA is able to perform dynamic reconfiguration autonomously to fasten the convergence process while producing better solutions. Another important advantage of our approach is the exploitation of recent advances in the domain of dynamic SPLs to enhance the performance of the GAs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=self-adaptive%20genetic%20algorithms" title="self-adaptive genetic algorithms">self-adaptive genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20engineering" title=" software engineering"> software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20software%20product%20lines" title=" dynamic software product lines"> dynamic software product lines</a>, <a href="https://publications.waset.org/abstracts/search?q=reconfigurable%20architecture" title=" reconfigurable architecture"> reconfigurable architecture</a> </p> <a href="https://publications.waset.org/abstracts/37396/a-dynamic-software-product-line-approach-to-self-adaptive-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37396.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">5971</span> Shape-Changing Structure: A Prototype for the Study of a Dynamic and Modular Structure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Annarita%20Zarrillo">Annarita Zarrillo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research is part of adaptive architecture, reflecting the evolution that the world of architectural design is going through. Today's architecture is no longer seen as a static system but, conversely, as a dynamic system that changes in response to the environment and the needs of users. One of the major forms of adaptivity is represented by kinetic structures. This study aims to underline the importance of experimentation on physical scale models for the study of dynamic structures and to present the case study of a modular kinetic structure designed through the use of parametric design software and created as a prototype in the laboratories of the Royal Danish Academy in Copenhagen. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20architecture" title="adaptive architecture">adaptive architecture</a>, <a href="https://publications.waset.org/abstracts/search?q=architectural%20application" title=" architectural application"> architectural application</a>, <a href="https://publications.waset.org/abstracts/search?q=kinetic%20structures" title=" kinetic structures"> kinetic structures</a>, <a href="https://publications.waset.org/abstracts/search?q=modular%20prototype" title=" modular prototype"> modular prototype</a> </p> <a href="https://publications.waset.org/abstracts/125135/shape-changing-structure-a-prototype-for-the-study-of-a-dynamic-and-modular-structure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125135.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">137</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">5970</span> Dynamic Economic Load Dispatch Using Quadratic Programming: Application to Algerian Electrical Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Graa">A. Graa</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Ziane"> I. Ziane</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Benhamida"> F. Benhamida</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Souag"> S. Souag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a comparative analysis study of an efficient and reliable quadratic programming (QP) to solve economic load dispatch (ELD) problem with considering transmission losses in a power system. The proposed QP method takes care of different unit and system constraints to find optimal solution. To validate the effectiveness of the proposed QP solution, simulations have been performed using Algerian test system. Results obtained with the QP method have been compared with other existing relevant approaches available in literatures. Experimental results show a proficiency of the QP method over other existing techniques in terms of robustness and its optimal search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title="economic dispatch">economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20programming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Algerian%20network" title=" Algerian network"> Algerian network</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20load" title=" dynamic load"> dynamic load</a> </p> <a href="https://publications.waset.org/abstracts/23032/dynamic-economic-load-dispatch-using-quadratic-programming-application-to-algerian-electrical-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23032.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">565</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">5969</span> Application of the Piloting Law Based on Adaptive Differentiators via Second Order Sliding Mode for a Fixed Wing Aircraft </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaouche%20Mohammed">Zaouche Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Amini%20Mohammed"> Amini Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Foughali%20Khaled"> Foughali Khaled</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamissi%20Aicha"> Hamissi Aicha</a>, <a href="https://publications.waset.org/abstracts/search?q=Aktouf%20Mohand%20Arezki"> Aktouf Mohand Arezki</a>, <a href="https://publications.waset.org/abstracts/search?q=Boureghda%20Ilyes"> Boureghda Ilyes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a piloting law based on the adaptive differentiators via high order sliding mode controller, by using an aircraft in virtual simulated environment. To deal with the design of an autopilot controller, we propose a framework based on Software in the Loop (SIL) methodology and we use Microsoft<sup>TM</sup> Flight Simulator (FS-2004) as the environment for plane simulation. The aircraft dynamic model is nonlinear, Multi-Input Multi-Output (MIMO) and tightly coupled. The nonlinearity resides in the dynamic equations and also in the aerodynamic coefficients' variability. In our case, two (02) aircrafts are used in the flight tests, the Zlin-142 and MQ-1 Predator. For both aircrafts and in a very low altitude flight, we send the piloting control inputs to the aircraft which has stalled due to a command disconnection. Then, we present the aircraft’s dynamic behavior analysis while reestablishing the command transmission. Finally, a comparative study between the two aircraft’s dynamic behaviors is presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20differentiators" title="adaptive differentiators">adaptive differentiators</a>, <a href="https://publications.waset.org/abstracts/search?q=second%20order%20sliding%20modes" title=" second order sliding modes"> second order sliding modes</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20adaptation%20of%20the%20gains" title=" dynamic adaptation of the gains"> dynamic adaptation of the gains</a>, <a href="https://publications.waset.org/abstracts/search?q=microsoft%20flight%20simulator" title=" microsoft flight simulator"> microsoft flight simulator</a>, <a href="https://publications.waset.org/abstracts/search?q=Zlin-142" title=" Zlin-142"> Zlin-142</a>, <a href="https://publications.waset.org/abstracts/search?q=MQ-1%20predator" title=" MQ-1 predator"> MQ-1 predator</a> </p> <a href="https://publications.waset.org/abstracts/44435/application-of-the-piloting-law-based-on-adaptive-differentiators-via-second-order-sliding-mode-for-a-fixed-wing-aircraft" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44435.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">5968</span> Speed Control of Hybrid Stepper Motor by Using Adaptive Neuro-Fuzzy Controller</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Talha%20Ali%20Khan">Talha Ali Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an adaptive neuro-fuzzy interference system (ANFIS), which is applied to a hybrid stepper motor (HSM) to regulate its speed. The dynamic response of the HSM with the ANFIS controller is studied during the starting process and under different load disturbance. The effectiveness of the proposed controller is compared with that of the conventional PI controller. The proposed method solves the problem of nonlinearities and load changes of the HSM drives. The proposed controller ensures fast and precise dynamic response with an excellent steady state performance. Matlab/Simulink program is used for this dynamic simulation study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stepper%20motor" title="stepper motor">stepper motor</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid" title=" hybrid"> hybrid</a>, <a href="https://publications.waset.org/abstracts/search?q=ANFIS" title=" ANFIS"> ANFIS</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20control" title=" speed control"> speed control</a> </p> <a href="https://publications.waset.org/abstracts/15484/speed-control-of-hybrid-stepper-motor-by-using-adaptive-neuro-fuzzy-controller" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15484.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">551</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">5967</span> A Common Automated Programming Platform for Knowledge Based Software Engineering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Stanev">Ivan Stanev</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Koleva"> Maria Koleva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A common platform for automated programming (CPAP) is defined in details. Two versions of CPAP are described: Cloud-based (including the set of components for classic programming, and the set of components for combined programming) and KBASE based (including the set of components for automated programming, and the set of components for ontology programming). Four KBASE products (module for automated programming of robots, intelligent product manual, intelligent document display, and intelligent form generator) are analyzed and CPAP contributions to automated programming are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automated%20programming" title="automated programming">automated programming</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20based%20software%20engineering" title=" knowledge based software engineering"> knowledge based software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20oriented%20architecture" title=" service oriented architecture"> service oriented architecture</a> </p> <a href="https://publications.waset.org/abstracts/40829/a-common-automated-programming-platform-for-knowledge-based-software-engineering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40829.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">344</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">5966</span> Using Adaptive Pole Placement Control Strategy for Active Steering Safety System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hadi%20Adibi-Asl">Hadi Adibi-Asl</a>, <a href="https://publications.waset.org/abstracts/search?q=Alireza%20Doosthosseini"> Alireza Doosthosseini</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Taghavipour"> Amir Taghavipour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies the design of an adaptive control strategy to tune an active steering system for better drivability and maneuverability. In the first step, adaptive control strategy is applied to estimate the uncertain parameters on-line (e.g. cornering stiffness), then the estimated parameters are fed into the pole placement controller to generate corrective feedback gain to improve the steering system dynamic’s characteristics. The simulations are evaluated for three types of road conditions (dry, wet, and icy), and the performance of the adaptive pole placement control (APPC) are compared with pole placement control (PPC) and a passive system. The results show that the APPC strategy significantly improves the yaw rate and side slip angle of a bicycle plant model. <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=active%20steering" title=" active steering"> active steering</a>, <a href="https://publications.waset.org/abstracts/search?q=pole%20placement" title=" pole placement"> pole placement</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20dynamics" title=" vehicle dynamics"> vehicle dynamics</a> </p> <a href="https://publications.waset.org/abstracts/59941/using-adaptive-pole-placement-control-strategy-for-active-steering-safety-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59941.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">467</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">5965</span> A Literature Review of the Trend towards Indoor Dynamic Thermal Comfort</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=James%20Katungyi">James Katungyi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Steady State thermal comfort model which dominates thermal comfort practice and which posits the ideal thermal conditions in a narrow range of thermal conditions does not deliver the expected comfort levels among occupants. Furthermore, the buildings where this model is applied consume a lot of energy in conditioning. This paper reviews significant literature about thermal comfort in dynamic indoor conditions including the adaptive thermal comfort model and alliesthesia. A major finding of the paper is that the adaptive thermal comfort model is part of a trend from static to dynamic indoor environments in aspects such as lighting, views, sounds and ventilation. Alliesthesia or thermal delight is consistent with this trend towards dynamic thermal conditions. It is within this trend that the two fold goal of increased thermal comfort and reduced energy consumption lies. At the heart of this trend is a rediscovery of the link between the natural environment and human well-being, a link that was partially severed by over-reliance on mechanically dominated artificial indoor environments. The paper concludes by advocating thermal conditioning solutions that integrate mechanical with natural thermal conditioning in a balanced manner in order to meet occupant thermal needs without endangering the environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20thermal%20comfort" title="adaptive thermal comfort">adaptive thermal comfort</a>, <a href="https://publications.waset.org/abstracts/search?q=alliesthesia" title=" alliesthesia"> alliesthesia</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20environment" title=" natural environment"> natural environment</a> </p> <a href="https://publications.waset.org/abstracts/93485/a-literature-review-of-the-trend-towards-indoor-dynamic-thermal-comfort" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93485.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">219</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">5964</span> A Survey of Grammar-Based Genetic Programming and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthew%20T.%20Wilson">Matthew T. Wilson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper covers a selection of research utilizing grammar-based genetic programming, and illustrates how context-free grammar can be used to constrain genetic programming. It focuses heavily on grammatical evolution, one of the most popular variants of grammar-based genetic programming, and the way its operators and terminals are specialized and modified from those in genetic programming. A variety of implementations of grammatical evolution for general use are covered, as well as research each focused on using grammatical evolution or grammar-based genetic programming on a single application, or to solve a specific problem, including some of the classically considered genetic programming problems, such as the Santa Fe Trail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context-free%20grammar" title="context-free grammar">context-free grammar</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20programming" title=" genetic programming"> genetic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=grammatical%20evolution" title=" grammatical evolution"> grammatical evolution</a> </p> <a href="https://publications.waset.org/abstracts/120249/a-survey-of-grammar-based-genetic-programming-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5963</span> Identifying the Gap between Adaptive Clothing Consumers and Brands</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lucky%20Farha">Lucky Farha</a>, <a href="https://publications.waset.org/abstracts/search?q=Martha%20L.%20Hall"> Martha L. Hall</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The current adaptive clothing brands are limited in numbers and specific categories. This study explores clothing challenges for children with Down syndrome and factors that influence their perception of adaptive clothing brands. Another aim of this study was to explore brands' challenges in the adaptive business and factors that influence their perceptions towards the adaptive market. In order to determine the market barriers affecting adaptive target market needs, the researcher applied Technology Acceptance Model. After interviewing and surveying parents/caregivers having children with Down syndrome and current adaptive brands, the results found education as the significant gap in the adaptive clothing market yet to be overcome. Based on the finding, several recommendations were suggested to improve the current barriers in the adaptive clothing market. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20fashion" title="adaptive fashion">adaptive fashion</a>, <a href="https://publications.waset.org/abstracts/search?q=disability" title=" disability"> disability</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20clothing" title=" functional clothing"> functional clothing</a>, <a href="https://publications.waset.org/abstracts/search?q=clothing%20needs%20assessment" title=" clothing needs assessment"> clothing needs assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=down%20syndrome" title=" down syndrome"> down syndrome</a>, <a href="https://publications.waset.org/abstracts/search?q=clothing%20challenge" title=" clothing challenge"> clothing challenge</a> </p> <a href="https://publications.waset.org/abstracts/150986/identifying-the-gap-between-adaptive-clothing-consumers-and-brands" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150986.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">144</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">5962</span> Approximation of Convex Set by Compactly Semidefinite Representable Set</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anusuya%20Ghosh">Anusuya Ghosh</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Narayanan"> Vishnu Narayanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximation of convex set by semidefinite representable set plays an important role in semidefinite programming, especially in modern convex optimization. To optimize a linear function over a convex set is a hard problem. But optimizing the linear function over the semidefinite representable set which approximates the convex set is easy to solve as there exists numerous efficient algorithms to solve semidefinite programming problems. So, our approximation technique is significant in optimization. We develop a technique to approximate any closed convex set, say K by compactly semidefinite representable set. Further we prove that there exists a sequence of compactly semidefinite representable sets which give tighter approximation of the closed convex set, K gradually. We discuss about the convergence of the sequence of compactly semidefinite representable sets to closed convex set K. The recession cone of K and the recession cone of the compactly semidefinite representable set are equal. So, we say that the sequence of compactly semidefinite representable sets converge strongly to the closed convex set. Thus, this approximation technique is very useful development in semidefinite programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20representable%20set" title=" semidefinite representable set"> semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=compactly%20semidefinite%20representable%20set" title=" compactly semidefinite representable set"> compactly semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a> </p> <a href="https://publications.waset.org/abstracts/36914/approximation-of-convex-set-by-compactly-semidefinite-representable-set" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36914.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">386</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">5961</span> Apply Commitment Method in Power System to Minimize the Fuel Cost</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shaban">Mohamed Shaban</a>, <a href="https://publications.waset.org/abstracts/search?q=Adel%20Yahya"> Adel Yahya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this paper study is to schedule the power generation units to minimize fuel consumption cost based on a model that solves unit commitment problems. This can be done by utilizing forward dynamic programming method to determine the most economic scheduling of generating units. The model was applied to a power station, which consists of four generating units. The obtained results show that the applications of forward dynamic programming method offer a substantial reduction in fuel consumption cost. The fuel consumption cost has been reduced from $116,326 to $102,181 within a 24-hour period. This means saving about 12.16 % of fuel consumption cost. The study emphasizes the importance of applying modeling schedule programs to the operation of power generation units. As a consequence less consumption of fuel, less loss of power and less pollution <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unit%20commitment" title="unit commitment">unit commitment</a>, <a href="https://publications.waset.org/abstracts/search?q=forward%20dynamic" title=" forward dynamic"> forward dynamic</a>, <a href="https://publications.waset.org/abstracts/search?q=fuel%20cost" title=" fuel cost"> fuel cost</a>, <a href="https://publications.waset.org/abstracts/search?q=programming" title=" programming"> programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generation%20scheduling" title=" generation scheduling"> generation scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=operation%20cost" title=" operation cost"> operation cost</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20system" title=" power system"> power system</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20units" title=" generating units"> generating units</a> </p> <a href="https://publications.waset.org/abstracts/33870/apply-commitment-method-in-power-system-to-minimize-the-fuel-cost" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33870.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">5960</span> An Adaptive Opportunistic Transmission for Unlicensed Spectrum Sharing in Heterogeneous Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daehyoung%20Kim">Daehyoung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Pervez%20Khan"> Pervez Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoon%20Kim"> Hoon Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Efficient utilization of spectrum resources is a fundamental issue of wireless communications due to its scarcity. To improve the efficiency of spectrum utilization, the spectrum sharing for unlicensed bands is being regarded as one of key technologies in the next generation wireless networks. A number of schemes such as Listen-Before-Talk(LBT) and carrier sensor adaptive transmission (CSAT) have been suggested from this aspect, but more efficient sharing schemes are required for improving spectrum utilization efficiency. This work considers an opportunistic transmission approach and a dynamic Contention Window (CW) adjustment scheme for LTE-U users sharing the unlicensed spectrum with Wi-Fi, in order to enhance the overall system throughput. The decision criteria for the dynamic adjustment of CW are based on the collision evaluation, derived from the collision probability of the system. The overall performance can be improved due to the adaptive adjustment of the CW. Simulation results show that our proposed scheme outperforms the Distributed Coordination Function (DCF) mechanism of IEEE 802.11 MAC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spectrum%20sharing" title="spectrum sharing">spectrum sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20opportunistic%20transmission" title=" adaptive opportunistic transmission"> adaptive opportunistic transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=unlicensed%20bands" title=" unlicensed bands"> unlicensed bands</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20networks" title=" heterogeneous networks"> heterogeneous networks</a> </p> <a href="https://publications.waset.org/abstracts/51830/an-adaptive-opportunistic-transmission-for-unlicensed-spectrum-sharing-in-heterogeneous-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51830.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">350</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">5959</span> Cutting Plane Methods for Integer Programming: NAZ Cut and Its Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bari">A. Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integer programming is a branch of mathematical programming techniques in operations research in which some or all of the variables are required to be integer valued. Various cuts have been used to solve these problems. We have also developed cuts known as NAZ cut & A-T cut to solve the integer programming problems. These cuts are used to reduce the feasible region and then reaching the optimal solution in minimum number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Integer%20Programming" title="Integer Programming">Integer Programming</a>, <a href="https://publications.waset.org/abstracts/search?q=NAZ%20cut" title=" NAZ cut"> NAZ cut</a>, <a href="https://publications.waset.org/abstracts/search?q=A-T%20cut" title=" A-T cut"> A-T cut</a>, <a href="https://publications.waset.org/abstracts/search?q=Cutting%20plane%20method" title=" Cutting plane method"> Cutting plane method</a> </p> <a href="https://publications.waset.org/abstracts/8763/cutting-plane-methods-for-integer-programming-naz-cut-and-its-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8763.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">5958</span> Optimization of Agricultural Water Demand Using a Hybrid Model of Dynamic Programming and Neural Networks: A Case Study of Algeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Boudjerda">M. Boudjerda</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Touaibia"> B. Touaibia</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Mihoubi"> M. K. Mihoubi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Algeria agricultural irrigation is the primary water consuming sector followed by the domestic and industrial sectors. Economic development in the last decade has weighed heavily on water resources which are relatively limited and gradually decreasing to the detriment of agriculture. The research presented in this paper focuses on the optimization of irrigation water demand. Dynamic Programming-Neural Network (DPNN) method is applied to investigate reservoir optimization. The optimal operation rule is formulated to minimize the gap between water release and water irrigation demand. As a case study, Foum El-Gherza dam’s reservoir system in south of Algeria has been selected to examine our proposed optimization model. The application of DPNN method allowed increasing the satisfaction rate (SR) from 12.32% to 55%. In addition, the operation rule generated showed more reliable and resilience operation for the examined case study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=water%20management" title="water management">water management</a>, <a href="https://publications.waset.org/abstracts/search?q=agricultural%20demand" title=" agricultural demand"> agricultural demand</a>, <a href="https://publications.waset.org/abstracts/search?q=dam%20and%20reservoir%20operation" title=" dam and reservoir operation"> dam and reservoir operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Foum%20el-Gherza%20dam" title=" Foum el-Gherza dam"> Foum el-Gherza dam</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20network" title=" artificial neural network"> artificial neural network</a> </p> <a href="https://publications.waset.org/abstracts/117003/optimization-of-agricultural-water-demand-using-a-hybrid-model-of-dynamic-programming-and-neural-networks-a-case-study-of-algeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/117003.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">115</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=approximate%2Fadaptive%20dynamic%20programming&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&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=approximate%2Fadaptive%20dynamic%20programming&page=199">199</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&page=200">200</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming&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>