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: optimal search</title> <meta name="description" content="Search results for: optimal search"> <meta name="keywords" content="optimal search"> <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="optimal search" 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="optimal search"> <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> 2362</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: optimal search</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2362</span> An Elbow Biomechanical Model and Its Coefficients Adjustment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jie%20Bai">Jie Bai</a>, <a href="https://publications.waset.org/abstracts/search?q=Yongsheng%20Gao"> Yongsheng Gao</a>, <a href="https://publications.waset.org/abstracts/search?q=Shengxin%20Wang"> Shengxin Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Zhao"> Jie Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Through the establishment of the elbow biomechanical model, it can provide theoretical guide for rehabilitation therapy on the upper limb of the human body. A biomechanical model of the elbow joint can be built by the connection of muscle force model and elbow dynamics. But there are many undetermined coefficients in the model like the optimal joint angle and optimal muscle force which are usually specified as the experimental parameters of other workers. Because of the individual differences, there is a certain deviation of the final result. To this end, the RMS value of the deviation between the actual angle and calculated angle is considered. A set of coefficients which lead to the minimum RMS value will be chosen to be the optimal parameters. The direct search method and the conjugacy search method are used to get the optimal parameters, thus the model can be more accurate and mode adaptability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=elbow%20biomechanical%20model" title="elbow biomechanical model">elbow biomechanical model</a>, <a href="https://publications.waset.org/abstracts/search?q=RMS" title=" RMS"> RMS</a>, <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=conjugacy%20search" title=" conjugacy search"> conjugacy search</a> </p> <a href="https://publications.waset.org/abstracts/7188/an-elbow-biomechanical-model-and-its-coefficients-adjustment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7188.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">548</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">2361</span> Optimized Algorithm for Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuzhang%20Zhao">Fuzhang Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization problems. Although some progress has been made to improve PSO algorithms over the last two decades, additional work is still needed to balance parameters to achieve better numerical properties of accuracy, efficiency, and stability. In the optimal PSO algorithm, the optimal weightings of (√ 5 − 1)/2 and (3 − √5)/2 are used for the cognitive factor and the social factor, respectively. By the same token, the same optimal weightings have been applied for intensification searches and diversification searches, respectively. Perturbation and constriction effects are optimally balanced. Simulations of the de Jong, the Rosenbrock, and the Griewank functions show that the optimal PSO algorithm indeed achieves better numerical properties and outperforms the canonical PSO algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=diversification%20search" title="diversification search">diversification search</a>, <a href="https://publications.waset.org/abstracts/search?q=intensification%20search" title=" intensification search"> intensification search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20weighting" title=" optimal weighting"> optimal weighting</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/36390/optimized-algorithm-for-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36390.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">581</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">2360</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">507</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">2359</span> Empirical Study on Factors Influencing SEO</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pakinee%20Aimmanee">Pakinee Aimmanee</a>, <a href="https://publications.waset.org/abstracts/search?q=Phoom%20Chokratsamesiri"> Phoom Chokratsamesiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Search engine has become an essential tool nowadays for people to search for their needed information on the internet. In this work, we evaluate the performance of the search engine from three factors: the keyword frequency, the number of inbound links, and the difficulty of the keyword. The evaluations are based on the ranking position and the number of days that Google has seen or detect the webpage. We find that the keyword frequency and the difficulty of the keyword do not affect the Google ranking where the number of inbound links gives remarkable improvement of the ranking position. The optimal number of inbound links found in the experiment is 10. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SEO" title="SEO">SEO</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title=" information retrieval"> information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20search" title=" web search"> web search</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20technologies" title=" knowledge technologies"> knowledge technologies</a> </p> <a href="https://publications.waset.org/abstracts/9414/empirical-study-on-factors-influencing-seo" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9414.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">283</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">2358</span> Finding the Optimal Meeting Point Based on Travel Plans in Road Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20H.%20Ahmadi">Mohammad H. Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Vahid%20Haghighatdoost"> Vahid Haghighatdoost</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given a set of source locations for a group of friends, and a set of trip plans for each group member as a sequence of Categories-of-Interests (COIs) (e.g., restaurant), and finally a specific COI as a common destination that all group members will gather together, in Meeting Point Based on Trip Plans (MPTPs) queries our goal is to find a Point-of-Interest (POI) from different COIs, such that the aggregate travel distance for the group is minimized. In this work, we considered two cases for aggregate function as Sum and Max. For solving this query, we propose an efficient pruning technique for shrinking the search space. Our approach contains three steps. In the first step, it prunes the search space around the source locations. In the second step, it prunes the search space around the centroid of source locations. Finally, we compute the intersection of all pruned areas as the final refined search space. We prove that the POIs beyond the refined area cannot be part of optimal answer set. The paper also covers an extensive performance study of the proposed technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=meeting%20point" title="meeting point">meeting point</a>, <a href="https://publications.waset.org/abstracts/search?q=trip%20plans" title=" trip plans"> trip plans</a>, <a href="https://publications.waset.org/abstracts/search?q=road%20networks" title=" road networks"> road networks</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20databases" title=" spatial databases"> spatial databases</a> </p> <a href="https://publications.waset.org/abstracts/72988/finding-the-optimal-meeting-point-based-on-travel-plans-in-road-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72988.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">185</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">2357</span> Enunciation on Complexities of Selected Tree Searching Algorithms </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Parag%20Bhalchandra">Parag Bhalchandra</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20D.%20Khamitkar"> S. D. Khamitkar </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Searching trees is a most interesting application of Artificial Intelligence. Over the period of time, many innovative methods have been evolved to better search trees with respect to computational complexities. Tree searches are difficult to understand due to the exponential growth of possibilities when increasing the number of nodes or levels in the tree. Usually it is understood when we traverse down in the tree, traverse down to greater depth, in the search of a solution or a goal. However, this does not happen in reality as explicit enumeration is not a very efficient method and there are many algorithmic speedups that will find the optimal solution without the burden of evaluating all possible trees. It was a common question before all researchers where they often wonder what algorithms will yield the best and fastest result The intention of this paper is two folds, one to review selected tree search algorithms and search strategies that can be applied to a problem space and the second objective is to stimulate to implement recent developments in the complexity behavior of search strategies. The algorithms discussed here apply in general to both brute force and heuristic searches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=trees%20search" title="trees search">trees search</a>, <a href="https://publications.waset.org/abstracts/search?q=asymptotic%20complexity" title=" asymptotic complexity"> asymptotic complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=brute%20force" title=" brute force"> brute force</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics%20algorithms" title=" heuristics algorithms"> heuristics algorithms</a> </p> <a href="https://publications.waset.org/abstracts/13407/enunciation-on-complexities-of-selected-tree-searching-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13407.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">304</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">2356</span> Optimal Voltage and Frequency Control of a Microgrid Using the Harmony Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Abbasi">Hossein Abbasi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The stability is an important topic to plan and manage the energy in the microgrids as the same as the conventional power systems. The voltage and frequency stability is one of the most important issues recently studied in microgrids. The objectives of this paper are the modelling and designing of the components and optimal controllers for the voltage and frequency control of the AC/DC hybrid microgrid under the different disturbances. Since the PI controllers have the advantages of simple structure and easy implementation, so they are designed and modeled in this paper. The harmony search (HS) algorithm is used to optimize the controllers’ parameters. According to the achieved results, the PI controllers have a good performance in voltage and frequency control of the microgrid. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20control" title="frequency control">frequency control</a>, <a href="https://publications.waset.org/abstracts/search?q=HS%20algorithm" title=" HS algorithm"> HS algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=microgrid" title=" microgrid"> microgrid</a>, <a href="https://publications.waset.org/abstracts/search?q=PI%20controller" title=" PI controller"> PI controller</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20control" title=" voltage control"> voltage control</a> </p> <a href="https://publications.waset.org/abstracts/42762/optimal-voltage-and-frequency-control-of-a-microgrid-using-the-harmony-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42762.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">391</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">2355</span> Optimal Bayesian Chart for Controlling Expected Number of Defects in Production Processes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20Makis">V. Makis</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Jafari"> L. Jafari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we develop an optimal Bayesian chart to control the expected number of defects per inspection unit in production processes with long production runs. We formulate this control problem in the optimal stopping framework. The objective is to determine the optimal stopping rule minimizing the long-run expected average cost per unit time considering partial information obtained from the process sampling at regular epochs. We prove the optimality of the control limit policy, i.e., the process is stopped and the search for assignable causes is initiated when the posterior probability that the process is out of control exceeds a control limit. An algorithm in the semi-Markov decision process framework is developed to calculate the optimal control limit and the corresponding average cost. Numerical examples are presented to illustrate the developed optimal control chart and to compare it with the traditional u-chart. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bayesian%20u-chart" title="Bayesian u-chart">Bayesian u-chart</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20design" title=" economic design"> economic design</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20stopping" title=" optimal stopping"> optimal stopping</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-Markov%20decision%20process" title=" semi-Markov decision process"> semi-Markov decision process</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20process%20control" title=" statistical process control"> statistical process control</a> </p> <a href="https://publications.waset.org/abstracts/62841/optimal-bayesian-chart-for-controlling-expected-number-of-defects-in-production-processes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62841.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">573</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">2354</span> Hybrid Genetic Approach for Solving Economic Dispatch Problems with Valve-Point Effect</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20I.%20Mahrous">Mohamed I. Mahrous</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20G.%20Ashmawy"> Mohamed G. Ashmawy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid genetic algorithm (HGA) is proposed in this paper to determine the economic scheduling of electric power generation over a fixed time period under various system and operational constraints. The proposed technique can outperform conventional genetic algorithms (CGAs) in the sense that HGA make it possible to improve both the quality of the solution and reduce the computing expenses. In contrast, any carefully designed GA is only able to balance the exploration and the exploitation of the search effort, which means that an increase in the accuracy of a solution can only occure at the sacrifice of convergent speed, and vice visa. It is unlikely that both of them can be improved simultaneously. The proposed hybrid scheme is developed in such a way that a simple GA is acting as a base level search, which makes a quick decision to direct the search towards the optimal region, and a local search method (pattern search technique) is next employed to do the fine tuning. The aim of the strategy is to achieve the cost reduction within a reasonable computing time. The effectiveness of the proposed hybrid technique is verified on two real public electricity supply systems with 13 and 40 generator units respectively. The simulation results obtained with the HGA for the two real systems are very encouraging with regard to the computational expenses and the cost reduction of power generation. <p class="card-text"><strong>Keywords:</strong> <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=economic%20dispatch" title=" economic dispatch"> economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20search" title=" pattern search"> pattern search</a> </p> <a href="https://publications.waset.org/abstracts/14138/hybrid-genetic-approach-for-solving-economic-dispatch-problems-with-valve-point-effect" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14138.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">444</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">2353</span> Ant System with Acoustic Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saad%20Bougrine">Saad Bougrine</a>, <a href="https://publications.waset.org/abstracts/search?q=Salma%20Ouchraa"> Salma Ouchraa</a>, <a href="https://publications.waset.org/abstracts/search?q=Belaid%20Ahiod"> Belaid Ahiod</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelhakim%20Ameur%20El%20Imrani"> Abdelhakim Ameur El Imrani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ant colony optimization is an ant algorithm framework that took inspiration from foraging behaviour of ant colonies. Indeed, ACO algorithms use a chemical communication, represented by pheromone trails, to build good solutions. However, ants involve different communication channels to interact. Thus, this paper introduces the acoustic communication between ants while they are foraging. This process allows fine and local exploration of search space and permits optimal solution to be improved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=acoustic%20communication" title="acoustic communication">acoustic communication</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title=" ant colony optimization"> ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a> </p> <a href="https://publications.waset.org/abstracts/7857/ant-system-with-acoustic-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7857.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">586</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">2352</span> An Improved Cuckoo Search Algorithm for Voltage Stability Enhancement in Power Transmission Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reza%20Sirjani">Reza Sirjani</a>, <a href="https://publications.waset.org/abstracts/search?q=Nobosse%20Tafem%20Bolan"> Nobosse Tafem Bolan </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many optimization techniques available in the literature have been developed in order to solve the problem of voltage stability enhancement in power systems. However, there are a number of drawbacks in the use of previous techniques aimed at determining the optimal location and size of reactive compensators in a network. In this paper, an Improved Cuckoo Search algorithm is applied as an appropriate optimization algorithm to determine the optimum location and size of a Static Var Compensator (SVC) in a transmission network. The main objectives are voltage stability improvement and total cost minimization. The results of the presented technique are then compared with other available optimization techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cuckoo%20search%20algorithm" title="cuckoo search algorithm">cuckoo search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</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=var%20compensators" title=" var compensators"> var compensators</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20stability" title=" voltage stability"> voltage stability</a> </p> <a href="https://publications.waset.org/abstracts/38354/an-improved-cuckoo-search-algorithm-for-voltage-stability-enhancement-in-power-transmission-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38354.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">2351</span> Elitist Self-Adaptive Step-Size Search in Optimum Sizing of Steel Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O%C4%9Fuzhan%20Hasan%C3%A7ebi">Oğuzhan Hasançebi</a>, <a href="https://publications.waset.org/abstracts/search?q=Saeid%20Kazemzadeh%20Azad"> Saeid Kazemzadeh Azad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <div>This paper covers application of an elitist selfadaptive</div> <div>step-size search (ESASS) to optimum design of steel</div> <div>skeletal structures. In the ESASS two approaches are considered for</div> <div>improving the convergence accuracy as well as the computational</div> <div>efficiency of the original technique namely the so called selfadaptive</div> <div>step-size search (SASS). Firstly, an additional randomness</div> <div>is incorporated into the sampling step of the technique to preserve</div> <div>exploration capability of the algorithm during the optimization.</div> <div>Moreover, an adaptive sampling scheme is introduced to improve the</div> <div>quality of final solutions. Secondly, computational efficiency of the</div> <div>technique is accelerated via avoiding unnecessary analyses during the</div> <div>optimization process using an upper bound strategy. The numerical</div> <div>results demonstrate the usefulness of the ESASS in the sizing</div> <div>optimization problems of steel truss and frame structures.</div> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=structural%20design%20optimization" title="structural design optimization">structural design optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20sizing" title=" optimal sizing"> optimal sizing</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=self-adaptive%20step-size%20search" title=" self-adaptive step-size search"> self-adaptive step-size search</a>, <a href="https://publications.waset.org/abstracts/search?q=steel%20trusses" title=" steel trusses"> steel trusses</a>, <a href="https://publications.waset.org/abstracts/search?q=steel%20frames" title=" steel frames"> steel frames</a> </p> <a href="https://publications.waset.org/abstracts/8724/elitist-self-adaptive-step-size-search-in-optimum-sizing-of-steel-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8724.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">2350</span> Digestion Optimization Algorithm: A Novel Bio-Inspired Intelligence for Global Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akintayo%20E.%20Akinsunmade">Akintayo E. Akinsunmade</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The digestion optimization algorithm is a novel biological-inspired metaheuristic method for solving complex optimization problems. The algorithm development was inspired by studying the human digestive system. The algorithm mimics the process of food ingestion, breakdown, absorption, and elimination to eﬀectively and eﬃciently search for optimal solutions. This algorithm was tested for optimal solutions on seven diﬀerent types of optimization benchmark functions. The algorithm produced optimal solutions with standard errors, which were compared with the exact solution of the test functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20algorithm" title="bio-inspired algorithm">bio-inspired algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=benchmark%20optimization%20functions" title=" benchmark optimization functions"> benchmark optimization functions</a>, <a href="https://publications.waset.org/abstracts/search?q=digestive%20system%20in%20human" title=" digestive system in human"> digestive system in human</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm%20development" title=" algorithm development"> algorithm development</a> </p> <a href="https://publications.waset.org/abstracts/194133/digestion-optimization-algorithm-a-novel-bio-inspired-intelligence-for-global-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194133.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">8</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">2349</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">2348</span> Solving Single Machine Total Weighted Tardiness Problem Using Gaussian Process Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wanatchapong%20Kongkaew">Wanatchapong Kongkaew</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local search based on simulated annealing scheme, called GPRISA algorithm. The results show that the proposed GPRISA method achieves a very good performance and a reasonable trade-off between solution quality and time consumption. Moreover, in the comparison of deviation from the best-known solution, the proposed mechanism noticeably outperforms the recently existing approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20process%20regression" title="Gaussian process regression">Gaussian process regression</a>, <a href="https://publications.waset.org/abstracts/search?q=iterated%20local%20search" title=" iterated local search"> iterated local search</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20total%20weighted%20tardiness" title=" single machine total weighted tardiness"> single machine total weighted tardiness</a> </p> <a href="https://publications.waset.org/abstracts/6433/solving-single-machine-total-weighted-tardiness-problem-using-gaussian-process-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6433.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">309</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">2347</span> Hexagonal Honeycomb Sandwich Plate Optimization Using Gravitational Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Boudjemai">A. Boudjemai</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Zafrane"> A. Zafrane</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Hocine"> R. Hocine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Honeycomb sandwich panels are increasingly used in the construction of space vehicles because of their outstanding strength, stiffness and light weight properties. However, the use of honeycomb sandwich plates comes with difficulties in the design process as a result of the large number of design variables involved, including composite material design, shape and geometry. Hence, this work deals with the presentation of an optimal design of hexagonal honeycomb sandwich structures subjected to space environment. The optimization process is performed using a set of algorithms including the gravitational search algorithm (GSA). Numerical results are obtained and presented for a set of algorithms. The results obtained by the GSA algorithm are much better compared to other algorithms used in this study. <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=gravitational%20search%20algorithm" title=" gravitational search algorithm"> gravitational search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=honeycomb%20plate" title=" honeycomb plate"> honeycomb plate</a> </p> <a href="https://publications.waset.org/abstracts/10421/hexagonal-honeycomb-sandwich-plate-optimization-using-gravitational-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10421.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">377</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">2346</span> Multi Objective Near-Optimal Trajectory Planning of Mobile Robot </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amar%20Khoukhi">Amar Khoukhi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shahab"> Mohamed Shahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the optimal control problem of mobile robot motion as a nonlinear programming problem (NLP) and solved using a direct method of numerical optimal control. The NLP is initialized with a B-Spline for which node locations are optimized using a genetic search. The system acceleration inputs and sampling periods are considered as optimization variables. Different scenarios with different objectives weights are implemented and investigated. Interesting results are found in terms of complying with the expected behavior of a mobile robot system and time-energy minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20control" title="multi-objective control">multi-objective control</a>, <a href="https://publications.waset.org/abstracts/search?q=non-holonomic%20systems" title=" non-holonomic systems"> non-holonomic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20robots" title=" mobile robots"> mobile robots</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title=" motion planning"> motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=B-spline" title=" B-spline"> B-spline</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/14286/multi-objective-near-optimal-trajectory-planning-of-mobile-robot" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14286.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">369</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">2345</span> User Modeling from the Perspective of Improvement in Search Results: A Survey of the State of the Art</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samira%20Karimi-Mansoub">Samira Karimi-Mansoub</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahem%20Abri"> Rahem Abri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Currently, users expect high quality and personalized information from search results. To satisfy user’s needs, personalized approaches to web search have been proposed. These approaches can provide the most appropriate answer for user’s needs by using user context and incorporating information about query provided by combining search technologies. To carry out personalized web search, there is a need to make different techniques on whole of user search process. There are the number of possible deployment of personalized approaches such as personalized web search, personalized recommendation, personalized summarization and filtering systems and etc. but the common feature of all approaches in various domains is that user modeling is utilized to provide personalized information from the Web. So the most important work in personalized approaches is user model mining. User modeling applications and technologies can be used in various domains depending on how the user collected information may be extracted. In addition to, the used techniques to create user model is also different in each of these applications. Since in the previous studies, there was not a complete survey in this field, our purpose is to present a survey on applications and techniques of user modeling from the viewpoint of improvement in search results by considering the existing literature and researches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=filtering%20systems" title="filtering systems">filtering systems</a>, <a href="https://publications.waset.org/abstracts/search?q=personalized%20web%20search" title=" personalized web search"> personalized web search</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20modeling" title=" user modeling"> user modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20search%20behavior" title=" user search behavior"> user search behavior</a> </p> <a href="https://publications.waset.org/abstracts/73551/user-modeling-from-the-perspective-of-improvement-in-search-results-a-survey-of-the-state-of-the-art" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73551.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">279</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">2344</span> Bi-Criteria Objective Network Design Model for Multi Period Multi Product Green Supply Chain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahul%20Hamid%20Khan">Shahul Hamid Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Santhosh"> S. Santhosh</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhinav%20Kumar%20Sharma"> Abhinav Kumar Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Environmental performance along with social performance is becoming vital factors for industries to achieve global standards. With a good environmental policy global industries are differentiating them from their competitors. This paper concentrates on multi stage, multi product and multi period manufacturing network. Bi-objective mathematical models for total cost and total emission for the entire forward supply chain are considered. Here five different problems are considered by varying the number of suppliers, manufacturers, and environmental levels, for illustrating the taken mathematical model. GA, and Random search are used for finding the optimal solution. The input parameters of the optimal solution are used to find the tradeoff between the initial investment by the industry and the long term benefit of the environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=closed%20loop%20supply%20chain" title="closed loop supply chain">closed loop supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</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=green%20supply%20chain" title=" green supply chain"> green supply chain</a> </p> <a href="https://publications.waset.org/abstracts/30982/bi-criteria-objective-network-design-model-for-multi-period-multi-product-green-supply-chain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30982.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2343</span> The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Alsheddy">Abdullah Alsheddy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the employment of Pareto optimality as a strategy to help (single-objective) local search escaping local optima. Instead of local search, Pareto local search is applied to solve the quadratic assignment problem which is multi-objectivized by adding a helper objective. The additional objective is defined as a function of the primary one with augmented penalties that are dynamically updated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pareto%20optimization" title="Pareto optimization">Pareto optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objectivization" title=" multi-objectivization"> multi-objectivization</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20assignment%20problem" title=" quadratic assignment problem"> quadratic assignment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a> </p> <a href="https://publications.waset.org/abstracts/9877/the-application-of-pareto-local-search-to-the-single-objective-quadratic-assignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9877.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">466</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">2342</span> Interactive, Topic-Oriented Search Support by a Centroid-Based Text Categorisation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mario%20Kubek">Mario Kubek</a>, <a href="https://publications.waset.org/abstracts/search?q=Herwig%20Unger"> Herwig Unger</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Centroid terms are single words that semantically and topically characterise text documents and so may serve as their very compact representation in automatic text processing. In the present paper, centroids are used to measure the relevance of text documents with respect to a given search query. Thus, a new graphbased paradigm for searching texts in large corpora is proposed and evaluated against keyword-based methods. The first, promising experimental results demonstrate the usefulness of the centroid-based search procedure. It is shown that especially the routing of search queries in interactive and decentralised search systems can be greatly improved by applying this approach. A detailed discussion on further fields of its application completes this contribution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=search%20algorithm" title="search algorithm">search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=centroid" title=" centroid"> centroid</a>, <a href="https://publications.waset.org/abstracts/search?q=query" title=" query"> query</a>, <a href="https://publications.waset.org/abstracts/search?q=keyword" title=" keyword"> keyword</a>, <a href="https://publications.waset.org/abstracts/search?q=co-occurrence" title=" co-occurrence"> co-occurrence</a>, <a href="https://publications.waset.org/abstracts/search?q=categorisation" title=" categorisation"> categorisation</a> </p> <a href="https://publications.waset.org/abstracts/82581/interactive-topic-oriented-search-support-by-a-centroid-based-text-categorisation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82581.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">282</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">2341</span> Discrete Group Search Optimizer for the Travelling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raed%20Alnajjar">Raed Alnajjar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Zakree"> Mohd Zakree</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Nazri"> Ahmad Nazri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we apply Discrete Group Search Optimizer (DGSO) for solving Traveling Salesman Problem (TSP). The DGSO is a nature inspired optimization algorithm that imitates the animal behavior, especially animal searching behavior. The proposed DGSO uses a vector representation and some discrete operators, such as destruction, construction, differential evolution, swap and insert. The TSP is a well-known hard combinatorial optimization problem, which seeks to find the shortest path among numbers of cities. The performance of the proposed DGSO is evaluated and tested on benchmark instances which listed in LIBTSP dataset. The experimental results show that the performance of the proposed DGSO is comparable with the other methods in the state of the art for some instances. The results show that DGSO outperform Ant Colony System (ACS) in some instances whilst outperform other metaheuristic in most instances. In addition to that, the new results obtained a number of optimal solutions and some best known results. DGSO was able to obtain feasible and good quality solution across all dataset. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20group%20search%20optimizer%20%28DGSO%29%3B%20Travelling%20salesman%20problem%20%28TSP%29%3B%20Variable%20neighborhood%20search%28VNS%29" title="discrete group search optimizer (DGSO); Travelling salesman problem (TSP); Variable neighborhood search(VNS)">discrete group search optimizer (DGSO); Travelling salesman problem (TSP); Variable neighborhood search(VNS)</a> </p> <a href="https://publications.waset.org/abstracts/36200/discrete-group-search-optimizer-for-the-travelling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36200.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">324</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">2340</span> On the Interactive Search with Web Documents </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mario%20Kubek">Mario Kubek</a>, <a href="https://publications.waset.org/abstracts/search?q=Herwig%20Unger"> Herwig Unger</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the large amount of information in the World Wide Web (WWW, web) and the lengthy and usually linearly ordered result lists of web search engines that do not indicate semantic relationships between their entries, the search for topically similar and related documents can become a tedious task. Especially, the process of formulating queries with proper terms representing specific information needs requires much effort from the user. This problem gets even bigger when the user's knowledge on a subject and its technical terms is not sufficient enough to do so. This article presents the new and interactive search application DocAnalyser that addresses this problem by enabling users to find similar and related web documents based on automatic query formulation and state-of-the-art search word extraction. Additionally, this tool can be used to track topics across semantically connected web documents <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DocAnalyser" title="DocAnalyser">DocAnalyser</a>, <a href="https://publications.waset.org/abstracts/search?q=interactive%20web%20search" title=" interactive web search"> interactive web search</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20word%20extraction" title=" search word extraction"> search word extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20formulation" title=" query formulation"> query formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=source%20topic%20detection" title=" source topic detection"> source topic detection</a>, <a href="https://publications.waset.org/abstracts/search?q=topic%20tracking" title=" topic tracking "> topic tracking </a> </p> <a href="https://publications.waset.org/abstracts/17687/on-the-interactive-search-with-web-documents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17687.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">2339</span> Metaheuristics to Solve Tasks Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Ziteuni">Rachid Ziteuni</a>, <a href="https://publications.waset.org/abstracts/search?q=Selt%20Omar"> Selt Omar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n tasks on m identical parallel machines with unavailability periods. This problem is NP-complete in the strong sens and finding an optimal solution appears unlikely. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote Pm/N-c/summs of (wjCj) is the weighted sum of the end dates of tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20identical%20machines" title=" parallel identical machines"> parallel identical machines</a>, <a href="https://publications.waset.org/abstracts/search?q=unavailability%20periods" title=" unavailability periods"> unavailability periods</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</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/5635/metaheuristics-to-solve-tasks-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5635.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">331</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">2338</span> Interactive Image Search for Mobile Devices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Komal%20V.%20Aher">Komal V. Aher</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20B.%20Waykar"> Sanjay B. Waykar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays every individual having mobile device with them. In both computer vision and information retrieval Image search is currently hot topic with many applications. The proposed intelligent image search system is fully utilizing multimodal and multi-touch functionalities of smart phones which allows search with Image, Voice, and Text on mobile phones. The system will be more useful for users who already have pictures in their minds but have no proper descriptions or names to address them. The paper gives system with ability to form composite visual query to express user’s intention more clearly which helps to give more precise or appropriate results to user. The proposed algorithm will considerably get better in different aspects. System also uses Context based Image retrieval scheme to give significant outcomes. So system is able to achieve gain in terms of search performance, accuracy and user satisfaction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=color%20space" title="color space">color space</a>, <a href="https://publications.waset.org/abstracts/search?q=histogram" title=" histogram"> histogram</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20device" title=" mobile device"> mobile device</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20visual%20search" title=" mobile visual search"> mobile visual search</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodal%20search" title=" multimodal search "> multimodal search </a> </p> <a href="https://publications.waset.org/abstracts/33265/interactive-image-search-for-mobile-devices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33265.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">367</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">2337</span> Information Extraction Based on Search Engine Results</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20R.%20Elkobaisi">Mohammed R. Elkobaisi</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelsalam%20Maatuk"> Abdelsalam Maatuk </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The search engines are the large scale information retrieval tools from the Web that are currently freely available to all. This paper explains how to convert the raw resulted number of search engines into useful information. This represents a new method for data gathering comparing with traditional methods. When a query is submitted for a multiple numbers of keywords, this take a long time and effort, hence we develop a user interface program to automatic search by taking multi-keywords at the same time and leave this program to collect wanted data automatically. The collected raw data is processed using mathematical and statistical theories to eliminate unwanted data and converting it to usable data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=search%20engines" title="search engines">search engines</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20extraction" title=" information extraction"> information extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=agent%20system" title=" agent system"> agent system</a> </p> <a href="https://publications.waset.org/abstracts/20378/information-extraction-based-on-search-engine-results" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20378.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">430</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">2336</span> A Comparative Study between Different Techniques of Off-Page and On-Page Search Engine Optimization </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Ishtiaq">Ahmed Ishtiaq</a>, <a href="https://publications.waset.org/abstracts/search?q=Maeeda%20Khalid"> Maeeda Khalid</a>, <a href="https://publications.waset.org/abstracts/search?q=Umair%20Sajjad"> Umair Sajjad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the fast-moving world, information is the key to success. If information is easily available, then it makes work easy. The Internet is the biggest collection and source of information nowadays, and with every single day, the data on internet increases, and it becomes difficult to find required data. Everyone wants to make his/her website at the top of search results. This can be possible when you have applied some techniques of SEO inside your application or outside your application, which are two types of SEO, onsite and offsite SEO. SEO is an abbreviation of Search Engine Optimization, and it is a set of techniques, methods to increase users of a website on World Wide Web or to rank up your website in search engine indexing. In this paper, we have compared different techniques of Onpage and Offpage SEO, and we have suggested many things that should be changed inside webpage, outside web page and mentioned some most powerful and search engine considerable elements and techniques in both types of SEO in order to gain high ranking on Search Engine. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auto-suggestion" title="auto-suggestion">auto-suggestion</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20engine%20optimization" title=" search engine optimization"> search engine optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=SEO" title=" SEO"> SEO</a>, <a href="https://publications.waset.org/abstracts/search?q=query" title=" query"> query</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20mining" title=" web mining"> web mining</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20crawler" title=" web crawler"> web crawler</a> </p> <a href="https://publications.waset.org/abstracts/128880/a-comparative-study-between-different-techniques-of-off-page-and-on-page-search-engine-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128880.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">149</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">2335</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">2334</span> Modeling Search-And-Rescue Operations by Autonomous Mobile Robots at Sea</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Kriheli">B. Kriheli</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Levner"> E. Levner</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20C.%20E.%20Cheng"> T. C. E. Cheng</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20T.%20Ng"> C. T. Ng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> During the last decades, research interest in planning, scheduling, and control of emergency response operations, especially people rescue and evacuation from the dangerous zone of marine accidents, has increased dramatically. Until the survivors (called ‘targets’) are found and saved, it may cause loss or damage whose extent depends on the location of the targets and the search duration. The problem is to efficiently search for and detect/rescue the targets as soon as possible with the help of intelligent mobile robots so as to maximize the number of saved people and/or minimize the search cost under restrictions on the amount of saved people within the allowable response time. We consider a special situation when the autonomous mobile robots (AMR), e.g., unmanned aerial vehicles and remote-controlled robo-ships have no operator on board as they are guided and completely controlled by on-board sensors and computer programs. We construct a mathematical model for the search process in an uncertain environment and provide a new fast algorithm for scheduling the activities of the autonomous robots during the search-and rescue missions after an accident at sea. We presume that in the unknown environments, the AMR’s search-and-rescue activity is subject to two types of error: (i) a 'false-negative' detection error where a target object is not discovered (‘overlooked') by the AMR’s sensors in spite that the AMR is in a close neighborhood of the latter and (ii) a 'false-positive' detection error, also known as ‘a false alarm’, in which a clean place or area is wrongly classified by the AMR’s sensors as a correct target. As the general resource-constrained discrete search problem is NP-hard, we restrict our study to finding local-optimal strategies. A specificity of the considered operational research problem in comparison with the traditional Kadane-De Groot-Stone search models is that in our model the probability of the successful search outcome depends not only on cost/time/probability parameters assigned to each individual location but, as well, on parameters characterizing the entire history of (unsuccessful) search before selecting any next location. We provide a fast approximation algorithm for finding the AMR route adopting a greedy search strategy in which, in each step, the on-board computer computes a current search effectiveness value for each location in the zone and sequentially searches for a location with the highest search effectiveness value. Extensive experiments with random and real-life data provide strong evidence in favor of the suggested operations research model and corresponding algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disaster%20management" title="disaster management">disaster management</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20robots" title=" intelligent robots"> intelligent robots</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=search-and-rescue%20at%20sea" title=" search-and-rescue at sea"> search-and-rescue at sea</a> </p> <a href="https://publications.waset.org/abstracts/79680/modeling-search-and-rescue-operations-by-autonomous-mobile-robots-at-sea" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79680.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">171</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">2333</span> Chaotic Search Optimal Design and Modeling of Permanent Magnet Synchronous Linear Motor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yang%20Yi-Fei">Yang Yi-Fei</a>, <a href="https://publications.waset.org/abstracts/search?q=Luo%20Min-Zhou"> Luo Min-Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Fu-Chun"> Zhang Fu-Chun</a>, <a href="https://publications.waset.org/abstracts/search?q=He%20Nai-Bao"> He Nai-Bao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xing%20Shao-Bang"> Xing Shao-Bang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an electromagnetic finite element model of permanent magnet synchronous linear motor and distortion rate of the air gap flux density waveform is analyzed in detail. By designing the sample space of the parameters, nonlinear regression modeling of the orthogonal experimental design is introduced. We put forward for possible air gap flux density waveform sine electromagnetic scheme. Parameters optimization of the permanent magnet synchronous linear motor is also introduced which is based on chaotic search and adaptation function. Simulation results prove that the pole shifting does not affect the motor back electromotive symmetry based on the structural parameters, it provides a novel way for the optimum design of permanent magnet synchronous linear motor and other engineering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=permanent%20magnet%20synchronous%20linear%20motor" title="permanent magnet synchronous linear motor">permanent magnet synchronous linear motor</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20analysis" title=" finite element analysis"> finite element analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=chaotic%20search" title=" chaotic search"> chaotic search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20design" title=" optimization design"> optimization design</a> </p> <a href="https://publications.waset.org/abstracts/48599/chaotic-search-optimal-design-and-modeling-of-permanent-magnet-synchronous-linear-motor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48599.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">417</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=optimal%20search&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&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=optimal%20search&page=78">78</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=79">79</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&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>