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: modified backtracking search algorithm</title> <meta name="description" content="Search results for: modified backtracking search algorithm"> <meta name="keywords" content="modified backtracking search algorithm"> <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="modified backtracking search algorithm" 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="modified backtracking search algorithm"> <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> 7420</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: modified backtracking search algorithm</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7420</span> A Mixture Vine Copula Structures Model for Dependence Wind Speed among Wind Farms and Its Application in Reactive Power Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yibin%20Qiu">Yibin Qiu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yubo%20Ouyang"> Yubo Ouyang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shihan%20Li"> Shihan Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Guorui%20Zhang"> Guorui Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Qi%20Li"> Qi Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Weirong%20Chen"> Weirong Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims at exploring the impacts of high dimensional dependencies of wind speed among wind farms on probabilistic optimal power flow. To obtain the reactive power optimization faster and more accurately, a mixture vine Copula structure model combining the K-means clustering, C vine copula and D vine copula is proposed in this paper, through which a more accurate correlation model can be obtained. Moreover, a Modified Backtracking Search Algorithm (MBSA), the three-point estimate method is applied to probabilistic optimal power flow. The validity of the mixture vine copula structure model and the MBSA are respectively tested in IEEE30 node system with measured data of 3 adjacent wind farms in a certain area, and the results indicate effectiveness of these methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mixture%20vine%20copula%20structure%20model" title="mixture vine copula structure model">mixture vine copula structure model</a>, <a href="https://publications.waset.org/abstracts/search?q=three-point%20estimate%20method" title=" three-point estimate method"> three-point estimate method</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20probability%20integral%20transform" title=" the probability integral transform"> the probability integral transform</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm" title=" modified backtracking search algorithm"> modified backtracking search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20power%20optimization" title=" reactive power optimization"> reactive power optimization</a> </p> <a href="https://publications.waset.org/abstracts/66356/a-mixture-vine-copula-structures-model-for-dependence-wind-speed-among-wind-farms-and-its-application-in-reactive-power-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66356.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">248</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">7419</span> Modified Active (MA) Algorithm to Generate Semantic Web Related Clustered Hierarchy for Keyword Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Leena%20Giri">G. Leena Giri</a>, <a href="https://publications.waset.org/abstracts/search?q=Archana%20Mathur"> Archana Mathur</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Manjula"> S. H. Manjula</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20R.%20Venugopal"> K. R. Venugopal</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20M.%20Patnaik"> L. M. Patnaik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Keyword search in XML documents is based on the notion of lowest common ancestors in the labelled trees model of XML documents and has recently gained a lot of research interest in the database community. In this paper, we propose the Modified Active (MA) algorithm which is an improvement over the active clustering algorithm by taking into consideration the entity aspect of the nodes to find the level of the node pertaining to a particular keyword input by the user. A portion of the bibliography database is used to experimentally evaluate the modified active algorithm and results show that it performs better than the active algorithm. Our modification improves the response time of the system and thereby increases the efficiency of the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=keyword%20matching%20patterns" title="keyword matching patterns">keyword matching patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=MA%20algorithm" title=" MA algorithm"> MA algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20search" title=" semantic search"> semantic search</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20management" title=" knowledge management"> knowledge management</a> </p> <a href="https://publications.waset.org/abstracts/6608/modified-active-ma-algorithm-to-generate-semantic-web-related-clustered-hierarchy-for-keyword-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6608.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">413</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">7418</span> Control of Stability for PV and Battery Hybrid System in Partial Shading</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Weiying%20Wang">Weiying Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Qi%20Li"> Qi Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Huiwen%20Deng"> Huiwen Deng</a>, <a href="https://publications.waset.org/abstracts/search?q=Weirong%20Chen"> Weirong Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The abrupt light change and uneven illumination will make the PV system get rid of constant output power, which will affect the efficiency of the grid connected inverter as well as the stability of the system. To solve this problem, this paper presents a strategy to control the stability of photovoltaic power system under the condition of partial shading of PV array, leading to constant power output, improving the capacity of resisting interferences. Firstly, a photovoltaic cell model considering the partial shading is established, and the backtracking search algorithm is used as the maximum power point to track algorithm under complex illumination. Then, the energy storage system based on the constant power control strategy is used to achieve constant power output. Finally, the effectiveness and correctness of the proposed control method are verified by the joint simulation of MATLAB/Simulink and RTLAB simulation platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=backtracking%20search%20algorithm" title="backtracking search algorithm">backtracking search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=constant%20power%20control" title=" constant power control"> constant power control</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20system" title=" hybrid system"> hybrid system</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20shading" title=" partial shading"> partial shading</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a> </p> <a href="https://publications.waset.org/abstracts/66215/control-of-stability-for-pv-and-battery-hybrid-system-in-partial-shading" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66215.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">297</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7417</span> Sparse Signal Restoration Algorithm Based on Piecewise Adaptive Backtracking Orthogonal Least Squares</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Linyu%20Wang">Linyu Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiahui%20Ma"> Jiahui Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianhong%20Xiang"> Jianhong Xiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanyu%20Jiang"> Hanyu Jiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> the traditional greedy compressed sensing algorithm needs to know the signal sparsity when recovering the signal, but the signal sparsity in the practical application can not be obtained as a priori information, and the recovery accuracy is low, which does not meet the needs of practical application. To solve this problem, this paper puts forward Piecewise adaptive backtracking orthogonal least squares algorithm. The algorithm is divided into two stages. In the first stage, the sparsity pre-estimation strategy is adopted, which can quickly approach the real sparsity and reduce time consumption. In the second stage iteration, the correction strategy and adaptive step size are used to accurately estimate the sparsity, and the backtracking idea is introduced to improve the accuracy of signal recovery. Through experimental simulation, the algorithm can accurately recover the estimated signal with fewer iterations when the sparsity is unknown. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=compressed%20sensing" title="compressed sensing">compressed sensing</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20algorithm" title=" greedy algorithm"> greedy algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20square%20method" title=" least square method"> least square method</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20reconstruction" title=" adaptive reconstruction"> adaptive reconstruction</a> </p> <a href="https://publications.waset.org/abstracts/161616/sparse-signal-restoration-algorithm-based-on-piecewise-adaptive-backtracking-orthogonal-least-squares" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161616.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">148</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">7416</span> Multiple Fault Diagnosis in Digital Circuits using Critical Path Tracing and Enhanced Deduction Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Mahmoud">Mohamed Mahmoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper has developed an effect-cause analysis technique for fault diagnosis in digital circuits. The main algorithm of our technique is based on the Enhanced Deduction Algorithm, which processes the real response of the CUT to the applied test T to deduce the values of the internal lines. An experimental version of the algorithm has been implemented in C++. The code takes about 7592 lines. The internal values are determined based on the logic values under the permanent stuck-fault model. Using a backtracking strategy guarantees that the actual values are covered by at least one solution, or no solution is found. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=enhanced%20deduction%20algorithm" title="enhanced deduction algorithm">enhanced deduction algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=backtracking%20strategy" title=" backtracking strategy"> backtracking strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20test%20equipment" title=" automatic test equipment"> automatic test equipment</a>, <a href="https://publications.waset.org/abstracts/search?q=verfication" title=" verfication"> verfication</a> </p> <a href="https://publications.waset.org/abstracts/144580/multiple-fault-diagnosis-in-digital-circuits-using-critical-path-tracing-and-enhanced-deduction-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144580.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">120</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7415</span> Global Convergence of a Modified Three-Term Conjugate Gradient Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Belloufi%20Mohammed">Belloufi Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Sellami%20Badreddine"> Sellami Badreddine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with a new nonlinear modified three-term conjugate gradient algorithm for solving large-scale unstrained optimization problems. The search direction of the algorithms from this class has three terms and is computed as modifications of the classical conjugate gradient algorithms to satisfy both the descent and the conjugacy conditions. An example of three-term conjugate gradient algorithm from this class, as modifications of the classical and well known Hestenes and Stiefel or of the CG_DESCENT by Hager and Zhang conjugate gradient algorithms, satisfying both the descent and the conjugacy conditions is presented. Under mild conditions, we prove that the modified three-term conjugate gradient algorithm with Wolfe type line search is globally convergent. Preliminary numerical results show the proposed method is very promising. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=three-term%20conjugate%20gradient" title=" three-term conjugate gradient"> three-term conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search" title=" line search"> line search</a> </p> <a href="https://publications.waset.org/abstracts/41727/global-convergence-of-a-modified-three-term-conjugate-gradient-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41727.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">375</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">7414</span> Hyperspectral Image Classification Using Tree Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shreya%20Pare">Shreya Pare</a>, <a href="https://publications.waset.org/abstracts/search?q=Parvin%20Akhter"> Parvin Akhter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Remotely sensing image classification becomes a very challenging task owing to the high dimensionality of hyperspectral images. The pixel-wise classification methods fail to take the spatial structure information of an image. Therefore, to improve the performance of classification, spatial information can be integrated into the classification process. In this paper, the multilevel thresholding algorithm based on a modified fuzzy entropy function is used to perform the segmentation of hyperspectral images. The fuzzy parameters of the MFE function have been optimized by using a new meta-heuristic algorithm based on the Tree-Search algorithm. The segmented image is classified by a large distribution machine (LDM) classifier. Experimental results are shown on a hyperspectral image dataset. The experimental outputs indicate that the proposed technique (MFE-TSA-LDM) achieves much higher classification accuracy for hyperspectral images when compared to state-of-art classification techniques. The proposed algorithm provides accurate segmentation and classification maps, thus becoming more suitable for image classification with large spatial structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20images" title=" hyperspectral images"> hyperspectral images</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20distribution%20margin" title=" large distribution margin"> large distribution margin</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20fuzzy%20entropy%20function" title=" modified fuzzy entropy function"> modified fuzzy entropy function</a>, <a href="https://publications.waset.org/abstracts/search?q=multilevel%20thresholding" title=" multilevel thresholding"> multilevel thresholding</a>, <a href="https://publications.waset.org/abstracts/search?q=tree%20search%20algorithm" title=" tree search algorithm"> tree search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20image%20classification%20using%20tree%20search%20algorithm" title=" hyperspectral image classification using tree search algorithm"> hyperspectral image classification using tree search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/143284/hyperspectral-image-classification-using-tree-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143284.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">177</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">7413</span> Modified Bat Algorithm for Economic Load Dispatch Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daljinder%20Singh">Daljinder Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=J.S.Dhillon"> J.S.Dhillon</a>, <a href="https://publications.waset.org/abstracts/search?q=Balraj%20Singh"> Balraj Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to no free lunch theorem, a single search technique cannot perform best in all conditions. Optimization method can be attractive choice to solve optimization problem that may have exclusive advantages like robust and reliable performance, global search capability, little information requirement, ease of implementation, parallelism, no requirement of differentiable and continuous objective function. In order to synergize between exploration and exploitation and to further enhance the performance of Bat algorithm, the paper proposed a modified bat algorithm that adds additional search procedure based on bat’s previous experience. The proposed algorithm is used for solving the economic load dispatch (ELD) problem. The practical constraint such valve-point loading along with power balance constraints and generator limit are undertaken. To take care of power demand constraint variable elimination method is exploited. The proposed algorithm is tested on various ELD problems. The results obtained show that the proposed algorithm is capable of performing better in majority of ELD problems considered and is at par with existing algorithms for some of problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bat%20algorithm" title="bat algorithm">bat algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20load%20dispatch" title=" economic load dispatch"> economic load dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=penalty%20method" title=" penalty method"> penalty method</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20elimination%20method" title=" variable elimination method"> variable elimination method</a> </p> <a href="https://publications.waset.org/abstracts/34397/modified-bat-algorithm-for-economic-load-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34397.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">459</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7412</span> Search for APN Permutations in Rings ℤ_2×ℤ_2^k</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Panario">Daniel Panario</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Santana%20de%20Freitas"> Daniel Santana de Freitas</a>, <a href="https://publications.waset.org/abstracts/search?q=Brett%20Stevens"> Brett Stevens</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Almost Perfect Nonlinear (APN) permutations with optimal resistance against differential cryptanalysis can be found in several domains. The permutation used in the standard for symmetric cryptography (the AES), for example, is based on a special kind of inversion in GF(28). Although very close to APN (2-uniform), this permutation still contains one number 4 in its differential spectrum, which means that, rigorously, it must be classified as 4-uniform. This fact motivates the search for fully APN permutations in other domains of definition. The extremely high complexity associated to this kind of problem precludes an exhaustive search for an APN permutation with 256 elements to be performed without the support of a suitable mathematical structure. On the other hand, in principle, there is nothing to indicate which mathematically structured domains can effectively help the search, and it is necessary to test several domains. In this work, the search for APN permutations in rings ℤ2×ℤ2k is investigated. After a full, exhaustive search with k=2 and k=3, all possible APN permutations in those rings were recorded, together with their differential profiles. Some very promising heuristics in these cases were collected so that, when used as a basis to prune backtracking for the same search in ℤ2×ℤ8 (search space with size 16! ≅244), just a few tenths of a second were enough to produce an APN permutation in a single CPU. Those heuristics were empirically extrapolated so that they could be applied to a backtracking search for APNs over ℤ2×ℤ16 (search space with size 32! ≅2117). The best permutations found in this search were further refined through Simulated Annealing, with a definition of neighbors suitable to this domain. The best result produced with this scheme was a 3-uniform permutation over ℤ2×ℤ16 with only 24 values equal to 3 in the differential spectrum (all the other 968 values were less than or equal 2, as it should be the case for an APN permutation). Although far from being fully APN, this result is technically better than a 4-uniform permutation and demanded only a few seconds in a single CPU. This is a strong indication that the use of mathematically structured domains, like the rings described in this work, together with heuristics based on smaller cases, can lead to dramatic cuts in the computational resources involved in the complexity of the search for APN permutations in extremely large domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=APN%20permutations" title="APN permutations">APN permutations</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20searches" title=" heuristic searches"> heuristic searches</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20cryptography" title=" symmetric cryptography"> symmetric cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=S-box%20design" title=" S-box design"> S-box design</a> </p> <a href="https://publications.waset.org/abstracts/145556/search-for-apn-permutations-in-rings-2-2k" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145556.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">159</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">7411</span> Pattern Recognition Search: An Advancement Over Interpolation Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahpar%20Yilmaz">Shahpar Yilmaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Yasir%20Nadeem"> Yasir Nadeem</a>, <a href="https://publications.waset.org/abstracts/search?q=Syed%20A.%20Mehdi"> Syed A. Mehdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Searching for a record in a dataset is always a frequent task for any data structure-related application. Hence, a fast and efficient algorithm for the approach has its importance in yielding the quickest results and enhancing the overall productivity of the company. Interpolation search is one such technique used to search through a sorted set of elements. This paper proposes a new algorithm, an advancement over interpolation search for the application of search over a sorted array. Pattern Recognition Search or PR Search (PRS), like interpolation search, is a pattern-based divide and conquer algorithm whose objective is to reduce the sample size in order to quicken the process and it does so by treating the array as a perfect arithmetic progression series and thereby deducing the key element’s position. We look to highlight some of the key drawbacks of interpolation search, which are accounted for in the Pattern Recognition Search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=array" title="array">array</a>, <a href="https://publications.waset.org/abstracts/search?q=complexity" title=" complexity"> complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=index" title=" index"> index</a>, <a href="https://publications.waset.org/abstracts/search?q=sorting" title=" sorting"> sorting</a>, <a href="https://publications.waset.org/abstracts/search?q=space" title=" space"> space</a>, <a href="https://publications.waset.org/abstracts/search?q=time" title=" time"> time</a> </p> <a href="https://publications.waset.org/abstracts/142819/pattern-recognition-search-an-advancement-over-interpolation-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142819.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">243</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7410</span> On the convergence of the Mixed Integer Randomized Pattern Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebert%20Brea">Ebert Brea</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a novel direct search algorithm for identifying at least a local minimum of mixed integer nonlinear unconstrained optimization problems. The Mixed Integer Randomized Pattern Search Algorithm (MIRPSA), so-called by the author, is based on a randomized pattern search, which is modified by the MIRPSA for finding at least a local minimum of our problem. The MIRPSA has two main operations over the randomized pattern search: moving operation and shrinking operation. Each operation is carried out by the algorithm when a set of conditions is held. The convergence properties of the MIRPSA is analyzed using a Markov chain approach, which is represented by an infinite countable set of state space λ, where each state d(q) is defined by a measure of the qth randomized pattern search Hq, for all q in N. According to the algorithm, when a moving operation is carried out on the qth randomized pattern search Hq, the MIRPSA holds its state. Meanwhile, if the MIRPSA carries out a shrinking operation over the qth randomized pattern search Hq, the algorithm will visit the next state, this is, a shrinking operation at the qth state causes a changing of the qth state into (q+1)th state. It is worthwhile pointing out that the MIRPSA never goes back to any visited states because the MIRPSA only visits any qth by shrinking operations. In this article, we describe the MIRPSA for mixed integer nonlinear unconstrained optimization problems for doing a deep study of its convergence properties using Markov chain viewpoint. We herein include a low dimension case for showing more details of the MIRPSA, when the algorithm is used for identifying the minimum of a mixed integer quadratic function. Besides, numerical examples are also shown in order to measure the performance of the MIRPSA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=direct%20search" title="direct search">direct search</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20optimization" title=" mixed integer optimization"> mixed integer optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20search" title=" random search"> random search</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20chain" title=" Markov chain"> Markov chain</a> </p> <a href="https://publications.waset.org/abstracts/33175/on-the-convergence-of-the-mixed-integer-randomized-pattern-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33175.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">470</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7409</span> Quick Sequential Search Algorithm Used to Decode High-Frequency Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20M.%20Siddeq">Mohammed M. Siddeq</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20H.%20Rasheed"> Mohammed H. Rasheed</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20M.%20Salih"> Omar M. Salih</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcos%20A.%20Rodrigues"> Marcos A. Rodrigues</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research proposes a data encoding and decoding method based on the Matrix Minimization algorithm. This algorithm is applied to high-frequency coefficients for compression/encoding. The algorithm starts by converting every three coefficients to a single value; this is accomplished based on three different keys. The decoding/decompression uses a search method called QSS (Quick Sequential Search) Decoding Algorithm presented in this research based on the sequential search to recover the exact coefficients. In the next step, the decoded data are saved in an auxiliary array. The basic idea behind the auxiliary array is to save all possible decoded coefficients; this is because another algorithm, such as conventional sequential search, could retrieve encoded/compressed data independently from the proposed algorithm. The experimental results showed that our proposed decoding algorithm retrieves original data faster than conventional sequential search algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20minimization%20algorithm" title="matrix minimization algorithm">matrix minimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=decoding%20sequential%20search%20algorithm" title=" decoding sequential search algorithm"> decoding sequential search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title=" image compression"> image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=DWT" title=" DWT"> DWT</a> </p> <a href="https://publications.waset.org/abstracts/151394/quick-sequential-search-algorithm-used-to-decode-high-frequency-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151394.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">150</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">7408</span> Tabu Random Algorithm for Guiding Mobile Robots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kevin%20Worrall">Kevin Worrall</a>, <a href="https://publications.waset.org/abstracts/search?q=Euan%20McGookin"> Euan McGookin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of optimization algorithms is common across a large number of diverse fields. This work presents the use of a hybrid optimization algorithm applied to a mobile robot tasked with carrying out a search of an unknown environment. The algorithm is then applied to the multiple robots case, which results in a reduction in the time taken to carry out the search. The hybrid algorithm is a Random Search Algorithm fused with a Tabu mechanism. The work shows that the algorithm locates the desired points in a quicker time than a brute force search. The Tabu Random algorithm is shown to work within a simulated environment using a validated mathematical model. The simulation was run using three different environments with varying numbers of targets. As an algorithm, the Tabu Random is small, clear and can be implemented with minimal resources. The power of the algorithm is the speed at which it locates points of interest and the robustness to the number of robots involved. The number of robots can vary with no changes to the algorithm resulting in a flexible algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithms" title="algorithms">algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=control" title=" control"> control</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent" title=" multi-agent"> multi-agent</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20and%20rescue" title=" search and rescue"> search and rescue</a> </p> <a href="https://publications.waset.org/abstracts/92647/tabu-random-algorithm-for-guiding-mobile-robots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92647.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">239</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">7407</span> Block Based Imperial Competitive Algorithm with Greedy Search for Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meng-Hui%20Chen">Meng-Hui Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Chiao-Wei%20Yu"> Chiao-Wei Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Pei-Chann%20Chang"> Pei-Chann Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title="traveling salesman problem">traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20chromosomes" title=" artificial chromosomes"> artificial chromosomes</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20search" title=" greedy search"> greedy search</a>, <a href="https://publications.waset.org/abstracts/search?q=imperial%20competitive%20algorithm" title=" imperial competitive algorithm"> imperial competitive algorithm</a> </p> <a href="https://publications.waset.org/abstracts/10392/block-based-imperial-competitive-algorithm-with-greedy-search-for-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10392.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">458</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7406</span> Computational Aerodynamic Shape Optimisation Using a Concept of Control Nodes and Modified Cuckoo Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Naumann">D. S. Naumann</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20J.%20Evans"> B. J. Evans</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20Hassan"> O. Hassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper outlines the development of an automated aerodynamic optimisation algorithm using a novel method of parameterising a computational mesh by employing user–defined control nodes. The shape boundary movement is coupled to the movement of the novel concept of the control nodes via a quasi-1D-linear deformation. Additionally, a second order smoothing step has been integrated to act on the boundary during the mesh movement based on the change in its second derivative. This allows for both linear and non-linear shape transformations dependent on the preference of the user. The domain mesh movement is then coupled to the shape boundary movement via a Delaunay graph mapping. A Modified Cuckoo Search (MCS) algorithm is used for optimisation within the prescribed design space defined by the allowed range of control node displacement. A finite volume compressible NavierStokes solver is used for aerodynamic modelling to predict aerodynamic design fitness. The resulting coupled algorithm is applied to a range of test cases in two dimensions including the design of a subsonic, transonic and supersonic intake and the optimisation approach is compared with more conventional optimisation strategies. Ultimately, the algorithm is tested on a three dimensional wing optimisation case. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mesh%20movement" title="mesh movement">mesh movement</a>, <a href="https://publications.waset.org/abstracts/search?q=aerodynamic%20shape%20optimization" title=" aerodynamic shape optimization"> aerodynamic shape optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=cuckoo%20search" title=" cuckoo search"> cuckoo search</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20parameterisation" title=" shape parameterisation"> shape parameterisation</a> </p> <a href="https://publications.waset.org/abstracts/42527/computational-aerodynamic-shape-optimisation-using-a-concept-of-control-nodes-and-modified-cuckoo-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42527.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">337</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">7405</span> A Hybrid Tabu Search Algorithm for the Multi-Objective Job Shop Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a hybrid Tabu Search (TS) algorithm is suggested for the multi-objective job shop scheduling problems (MO-JSSPs). The algorithm integrates several shifting bottleneck based neighborhood structures with the Giffler & Thompson algorithm, which improve efficiency of the search. Diversification and intensification are provided with local and global left shift algorithms application and also new semi-active, active, and non-delay schedules creation. The suggested algorithm is tested in the MO-JSSPs benchmarks from the literature based on the Pareto optimality concept. Different performances criteria are used for the multi-objective algorithm evaluation. The proposed algorithm is able to find the Pareto solutions of the test problems in shorter time than other algorithm of the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title="tabu search">tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Pareto%20optimality" title=" Pareto optimality"> Pareto optimality</a> </p> <a href="https://publications.waset.org/abstracts/71920/a-hybrid-tabu-search-algorithm-for-the-multi-objective-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71920.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">443</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">7404</span> An Enhanced Harmony Search (ENHS) Algorithm for Solving Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Talha%20A.%20Taj">Talha A. Taj</a>, <a href="https://publications.waset.org/abstracts/search?q=Talha%20A.%20Khan"> Talha A. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Imran%20Khalid"> M. Imran Khalid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimization techniques attract researchers to formulate a problem and determine its optimum solution. This paper presents an Enhanced Harmony Search (ENHS) algorithm for solving optimization problems. The proposed algorithm increases the convergence and is more efficient than the standard Harmony Search (HS) algorithm. The paper discusses the novel techniques in detail and also provides the strategy for tuning the decisive parameters that affects the efficiency of the ENHS algorithm. The algorithm is tested on various benchmark functions, a real world optimization problem and a constrained objective function. Also, the results of ENHS are compared to standard HS, and various other optimization algorithms. The ENHS algorithms prove to be significantly better and more efficient than other algorithms. The simulation and testing of the algorithms is performed in MATLAB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=harmony%20search%20algorithm" title=" harmony search algorithm"> harmony search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=MATLAB" title=" MATLAB"> MATLAB</a>, <a href="https://publications.waset.org/abstracts/search?q=electronic" title=" electronic"> electronic</a> </p> <a href="https://publications.waset.org/abstracts/3244/an-enhanced-harmony-search-enhs-algorithm-for-solving-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3244.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">463</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7403</span> Cuckoo Search (CS) Optimization Algorithm for Solving Constrained Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sait%20Ali%20Uymaz">Sait Ali Uymaz</a>, <a href="https://publications.waset.org/abstracts/search?q=G%C3%BClay%20Tezel"> Gülay Tezel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the comparison results on the performance of the Cuckoo Search (CS) algorithm for constrained optimization problems. For constraint handling, CS algorithm uses penalty method. CS algorithm is tested on thirteen well-known test problems and the results obtained are compared to Particle Swarm Optimization (PSO) algorithm. Mean, best, median and worst values were employed for the analyses of performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cuckoo%20search" title="cuckoo search">cuckoo search</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20optimization%20problems" title=" constrained optimization problems"> constrained optimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=penalty%20method" title=" penalty method"> penalty method</a> </p> <a href="https://publications.waset.org/abstracts/13991/cuckoo-search-cs-optimization-algorithm-for-solving-constrained-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13991.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">558</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">7402</span> A Context-Sensitive Algorithm for Media Similarity Search </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guang-Ho%20Cha">Guang-Ho Cha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a context-sensitive media similarity search algorithm. One of the central problems regarding media search is the semantic gap between the low-level features computed automatically from media data and the human interpretation of them. This is because the notion of similarity is usually based on high-level abstraction but the low-level features do not sometimes reflect the human perception. Many media search algorithms have used the Minkowski metric to measure similarity between image pairs. However those functions cannot adequately capture the aspects of the characteristics of the human visual system as well as the nonlinear relationships in contextual information given by images in a collection. Our search algorithm tackles this problem by employing a similarity measure and a ranking strategy that reflect the nonlinearity of human perception and contextual information in a dataset. Similarity search in an image database based on this contextual information shows encouraging experimental results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context-sensitive%20search" title="context-sensitive search">context-sensitive search</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20search" title=" image search"> image search</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20ranking" title=" similarity ranking"> similarity ranking</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20search" title=" similarity search"> similarity search</a> </p> <a href="https://publications.waset.org/abstracts/65150/a-context-sensitive-algorithm-for-media-similarity-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65150.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">365</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7401</span> An Improved Many Worlds Quantum Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Dan">Li Dan</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Junsuo"> Zhao Junsuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Wenjun"> Zhang Wenjun </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20genetic%20algorithm" title="quantum genetic algorithm">quantum genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=many%20worlds" title=" many worlds"> many worlds</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20training%20operator" title=" quantum training operator"> quantum training operator</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization%20operator" title=" combinatorial optimization operator"> combinatorial optimization operator</a> </p> <a href="https://publications.waset.org/abstracts/16842/an-improved-many-worlds-quantum-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16842.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">745</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">7400</span> A Research and Application of Feature Selection Based on IWO and Tabu Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laicheng%20Cao">Laicheng Cao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiangqian%20Su"> Xiangqian Su</a>, <a href="https://publications.waset.org/abstracts/search?q=Youxiao%20Wu"> Youxiao Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Feature selection is one of the important problems in network security, pattern recognition, data mining and other fields. In order to remove redundant features, effectively improve the detection speed of intrusion detection system, proposes a new feature selection method, which is based on the invasive weed optimization (IWO) algorithm and tabu search algorithm(TS). Use IWO as a global search, tabu search algorithm for local search, to improve the results of IWO algorithm. The experimental results show that the feature selection method can effectively remove the redundant features of network data information in feature selection, reduction time, and to guarantee accurate detection rate, effectively improve the speed of detection system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intrusion%20detection" title="intrusion detection">intrusion detection</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20selection" title=" feature selection"> feature selection</a>, <a href="https://publications.waset.org/abstracts/search?q=iwo" title=" iwo"> iwo</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a> </p> <a href="https://publications.waset.org/abstracts/28884/a-research-and-application-of-feature-selection-based-on-iwo-and-tabu-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28884.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">530</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7399</span> A Modified NSGA-II Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a>, <a href="https://publications.waset.org/abstracts/search?q=Ozan%20Bahadir"> Ozan Bahadir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> NSGA-II is one of the most well-known and most widely used evolutionary algorithms. In addition to its new versions, such as NSGA-III, there are several modified types of this algorithm in the literature. In this paper, a hybrid NSGA-II algorithm has been suggested for solving the multi-objective flexible job shop scheduling problem. For a better search, new neighborhood-based crossover and mutation operators are defined. To create new generations, the neighbors of the selected individuals by the tournament selection are constructed. Also, at the end of each iteration, before sorting, neighbors of a certain number of good solutions are derived, except for solutions protected by elitism. The neighbors are generated using a constraint-based neural network that uses various constructs. The non-dominated sorting and crowding distance operators are same as the classic NSGA-II. A comparison based on some multi-objective benchmarks from the literature shows the efficiency of the algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop%20scheduling%20problem" title="flexible job shop scheduling problem">flexible job shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=NSGA-II%20algorithm" title=" NSGA-II algorithm"> NSGA-II algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=neighborhood%20structures" title=" neighborhood structures"> neighborhood structures</a> </p> <a href="https://publications.waset.org/abstracts/96824/a-modified-nsga-ii-algorithm-for-solving-multi-objective-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96824.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">229</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">7398</span> Improved Artificial Bee Colony Algorithm for Non-Convex Economic Power Dispatch Problem </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Badr%20M.%20Alshammari">Badr M. Alshammari</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Guesmi"> T. Guesmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a modified version of the artificial bee colony (ABC) algorithm by including a local search technique for solving the non-convex economic power dispatch problem. The local search step is incorporated at the end of each iteration. Total system losses, valve-point loading effects and prohibited operating zones have been incorporated in the problem formulation. Thus, the problem becomes highly nonlinear and with discontinuous objective function. The proposed technique is validated using an IEEE benchmark system with ten thermal units. Simulation results demonstrate that the proposed optimization algorithm has better convergence characteristics in comparison with the original ABC algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20power%20dispatch" title="economic power dispatch">economic power dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony" title=" artificial bee colony"> artificial bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=valve-point%20loading%20effects" title=" valve-point loading effects"> valve-point loading effects</a>, <a href="https://publications.waset.org/abstracts/search?q=prohibited%20operating%20zones" title=" prohibited operating zones"> prohibited operating zones</a> </p> <a href="https://publications.waset.org/abstracts/89937/improved-artificial-bee-colony-algorithm-for-non-convex-economic-power-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89937.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">258</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">7397</span> An IM-COH Algorithm Neural Network Optimization with Cuckoo Search Algorithm for Time Series Samples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wullapa%20Wongsinlatam">Wullapa Wongsinlatam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Back propagation algorithm (BP) is a widely used technique in artificial neural network and has been used as a tool for solving the time series problems, such as decreasing training time, maximizing the ability to fall into local minima, and optimizing sensitivity of the initial weights and bias. This paper proposes an improvement of a BP technique which is called IM-COH algorithm (IM-COH). By combining IM-COH algorithm with cuckoo search algorithm (CS), the result is cuckoo search improved control output hidden layer algorithm (CS-IM-COH). This new algorithm has a better ability in optimizing sensitivity of the initial weights and bias than the original BP algorithm. In this research, the algorithm of CS-IM-COH is compared with the original BP, the IM-COH, and the original BP with CS (CS-BP). Furthermore, the selected benchmarks, four time series samples, are shown in this research for illustration. The research shows that the CS-IM-COH algorithm give the best forecasting results compared with the selected samples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20networks" title="artificial neural networks">artificial neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=back%20propagation%20algorithm" title=" back propagation algorithm"> back propagation algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20series" title=" time series"> time series</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem" title=" local minima problem"> local minima problem</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic%20optimization" title=" metaheuristic optimization"> metaheuristic optimization</a> </p> <a href="https://publications.waset.org/abstracts/100995/an-im-coh-algorithm-neural-network-optimization-with-cuckoo-search-algorithm-for-time-series-samples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100995.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">152</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">7396</span> A Modified Nonlinear Conjugate Gradient Algorithm for Large Scale Unconstrained Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tsegay%20Giday%20Woldu">Tsegay Giday Woldu</a>, <a href="https://publications.waset.org/abstracts/search?q=Haibin%20Zhang"> Haibin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xin%20Zhang"> Xin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yemane%20Hailu%20Fissuh"> Yemane Hailu Fissuh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is well known that nonlinear conjugate gradient method is one of the widely used first order methods to solve large scale unconstrained smooth optimization problems. Because of the low memory requirement, attractive theoretical features, practical computational efficiency and nice convergence properties, nonlinear conjugate gradient methods have a special role for solving large scale unconstrained optimization problems. Large scale optimization problems are with important applications in practical and scientific world. However, nonlinear conjugate gradient methods have restricted information about the curvature of the objective function and they are likely less efficient and robust compared to some second order algorithms. To overcome these drawbacks, the new modified nonlinear conjugate gradient method is presented. The noticeable features of our work are that the new search direction possesses the sufficient descent property independent of any line search and it belongs to a trust region. Under mild assumptions and standard Wolfe line search technique, the global convergence property of the proposed algorithm is established. Furthermore, to test the practical computational performance of our new algorithm, numerical experiments are provided and implemented on the set of some large dimensional unconstrained problems. The numerical results show that the proposed algorithm is an efficient and robust compared with other similar algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title="conjugate gradient method">conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20scale%20optimization" title=" large scale optimization"> large scale optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a> </p> <a href="https://publications.waset.org/abstracts/102625/a-modified-nonlinear-conjugate-gradient-algorithm-for-large-scale-unconstrained-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102625.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">206</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7395</span> Penguins Search Optimization Algorithm for Chaotic Synchronization System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sofiane%20Bououden">Sofiane Bououden</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilyes%20Boulkaibet"> Ilyes Boulkaibet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In terms of security of the information signal, the meta-heuristic Penguins Search Optimization Algorithm (PeSOA) is applied to synchronize chaotic encryption communications in the case of sensitive dependence on initial conditions in chaotic generator oscillator. The objective of this paper is the use of the PeSOA algorithm to exploring search space with random and iterative processes for synchronization of symmetric keys in both transmission and reception. Simulation results show the effectiveness of the PeSOA algorithm in generating symmetric keys of the encryption process and synchronizing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic" title="meta-heuristic">meta-heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=PeSOA" title=" PeSOA"> PeSOA</a>, <a href="https://publications.waset.org/abstracts/search?q=chaotic%20systems" title=" chaotic systems"> chaotic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization%20optimization" title=" synchronization optimization"> synchronization optimization</a> </p> <a href="https://publications.waset.org/abstracts/141318/penguins-search-optimization-algorithm-for-chaotic-synchronization-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141318.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">195</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">7394</span> Optimal Placement of Phasor Measurement Units Using Gravitational Search Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Satyendra%20Pratap%20Singh">Satyendra Pratap Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20P.%20Singh"> S. P. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a methodology using Gravitational Search Algorithm for optimal placement of Phasor Measurement Units (PMUs) in order to achieve complete observability of the power system. The objective of proposed algorithm is to minimize the total number of PMUs at the power system buses, which in turn minimize installation cost of the PMUs. In this algorithm, the searcher agents are collection of masses which interact with each other using Newton’s laws of gravity and motion. This new Gravitational Search Algorithm based method has been applied to the IEEE 14-bus, IEEE 30-bus and IEEE 118-bus test systems. Case studies reveal optimal number of PMUs with better observability by proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gravitational%20search%20algorithm%20%28GSA%29" title="gravitational search algorithm (GSA)">gravitational search algorithm (GSA)</a>, <a href="https://publications.waset.org/abstracts/search?q=law%20of%20motion" title=" law of motion"> law of motion</a>, <a href="https://publications.waset.org/abstracts/search?q=law%20of%20gravity" title=" law of gravity"> law of gravity</a>, <a href="https://publications.waset.org/abstracts/search?q=observability" title=" observability"> observability</a>, <a href="https://publications.waset.org/abstracts/search?q=phasor%20measurement%20unit" title=" phasor measurement unit"> phasor measurement unit</a> </p> <a href="https://publications.waset.org/abstracts/24189/optimal-placement-of-phasor-measurement-units-using-gravitational-search-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24189.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">508</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">7393</span> Metaheuristic to Align Multiple Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lamiche%20Chaabane">Lamiche Chaabane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, a new method for solving sequence alignment problem is proposed, which is named ITS (Improved Tabu Search). This algorithm is based on the classical Tabu Search (TS). ITS is implemented in order to obtain results of multiple sequence alignment. Several ideas concerning neighbourhood generation, move selection mechanisms and intensification/diversification strategies for our proposed ITS is investigated. ITS have generated high-quality results in terms of measure of scores in comparison with the classical TS and simple iterative search algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20sequence%20alignment" title="multiple sequence alignment">multiple sequence alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=improved%20tabu%20search" title=" improved tabu search"> improved tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=neighbourhood%20generation" title=" neighbourhood generation"> neighbourhood generation</a>, <a href="https://publications.waset.org/abstracts/search?q=selection%20mechanisms" title=" selection mechanisms"> selection mechanisms</a> </p> <a href="https://publications.waset.org/abstracts/6147/metaheuristic-to-align-multiple-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6147.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">305</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">7392</span> Efficient Motion Estimation by Fast Three Step Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20M.%20Kulkarni">S. M. Kulkarni</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Bormane"> D. S. Bormane</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20L.%20Nalbalwar"> S. L. Nalbalwar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid development in the technology have dramatic impact on the medical health care field. Medical data base obtained with latest machines like CT Machine, MRI scanner requires large amount of memory storage and also it requires large bandwidth for transmission of data in telemedicine applications. Thus, there is need for video compression. As the database of medical images contain number of frames (slices), hence while coding of these images there is need of motion estimation. Motion estimation finds out movement of objects in an image sequence and gets motion vectors which represents estimated motion of object in the frame. In order to reduce temporal redundancy between successive frames of video sequence, motion compensation is preformed. In this paper three step search (TSS) block matching algorithm is implemented on different types of video sequences. It is shown that three step search algorithm produces better quality performance and less computational time compared with exhaustive full search algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20matching" title="block matching">block matching</a>, <a href="https://publications.waset.org/abstracts/search?q=exhaustive%20search%20motion%20estimation" title=" exhaustive search motion estimation"> exhaustive search motion estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20step%20search" title=" three step search"> three step search</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20compression" title=" video compression"> video compression</a> </p> <a href="https://publications.waset.org/abstracts/23746/efficient-motion-estimation-by-fast-three-step-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23746.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">491</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">7391</span> Harmony Search-Based K-Coverage Enhancement in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaimaa%20M.%20Mohamed">Shaimaa M. Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=Haitham%20S.%20Hamza"> Haitham S. Hamza</a>, <a href="https://publications.waset.org/abstracts/search?q=Imane%20A.%20Saroit"> Imane A. Saroit</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many wireless sensor network applications require K-coverage of the monitored area. In this paper, we propose a scalable harmony search based algorithm in terms of execution time, K-Coverage Enhancement Algorithm (KCEA), it attempts to enhance initial coverage, and achieve the required K-coverage degree for a specific application efficiently. Simulation results show that the proposed algorithm achieves coverage improvement of 5.34% compared to K-Coverage Rate Deployment (K-CRD), which achieves 1.31% when deploying one additional sensor. Moreover, the proposed algorithm is more time efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wireless%20Sensor%20Networks%20%28WSN%29" title="Wireless Sensor Networks (WSN)">Wireless Sensor Networks (WSN)</a>, <a href="https://publications.waset.org/abstracts/search?q=harmony%20search%20algorithms" title=" harmony search algorithms"> harmony search algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=K-Coverage" title=" K-Coverage"> K-Coverage</a>, <a href="https://publications.waset.org/abstracts/search?q=Mobile%20WSN" title=" Mobile WSN"> Mobile WSN</a> </p> <a href="https://publications.waset.org/abstracts/19924/harmony-search-based-k-coverage-enhancement-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19924.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">526</span> </span> </div> </div> <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=modified%20backtracking%20search%20algorithm&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&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=modified%20backtracking%20search%20algorithm&page=247">247</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&page=248">248</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20backtracking%20search%20algorithm&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>