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> 4821</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">4641</span> Hydro-Mechanical Behavior of Calcareous Soils in Arid Region </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20Goual">I. Goual</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20S.%20Goual"> M. S. Goual</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Gueddouda"> M. K. Gueddouda</a>, <a href="https://publications.waset.org/abstracts/search?q=Ta%C3%AFbi%20Sa%C3%AFd"> Taïbi Saïd</a>, <a href="https://publications.waset.org/abstracts/search?q=Abou-Bekr%20Nabil"> Abou-Bekr Nabil</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Ferhat"> A. Ferhat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the study of hydro mechanical behavior of this optimal mixture. A first experimental phase was carried out in order to find the optimal mixture. This showed that the material composed of 80% tuff and 20% calcareous sand provides the maximum mechanical strength. The second experimental phase concerns the study of the drying- wetting behavior of the optimal mixture was carried out on slurry samples and compacted samples at the MPO. Experimental results let to deduce the parameters necessary for the prediction of the hydro-mechanical behavior of pavement formulated from tuff and calcareous sand mixtures, related to moisture. This optimal mixture satisfies the regulation rules and hence constitutes a good local eco-material, abundantly available, for the conception of pavements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tuff" title="tuff">tuff</a>, <a href="https://publications.waset.org/abstracts/search?q=sandy%20calcareous" title=" sandy calcareous"> sandy calcareous</a>, <a href="https://publications.waset.org/abstracts/search?q=road%20engineering" title=" road engineering"> road engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=hydro%20mechanical%20behaviour" title=" hydro mechanical behaviour"> hydro mechanical behaviour</a>, <a href="https://publications.waset.org/abstracts/search?q=suction" title=" suction"> suction</a> </p> <a href="https://publications.waset.org/abstracts/15411/hydro-mechanical-behavior-of-calcareous-soils-in-arid-region" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15411.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">4640</span> Satellite Imagery Classification Based on Deep Convolution Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhong%20Ma">Zhong Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhuping%20Wang"> Zhuping Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Congxin%20Liu"> Congxin Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiangzeng%20Liu"> Xiangzeng Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Satellite imagery classification is a challenging problem with many practical applications. In this paper, we designed a deep convolution neural network (DCNN) to classify the satellite imagery. The contributions of this paper are twofold — First, to cope with the large-scale variance in the satellite image, we introduced the inception module, which has multiple filters with different size at the same level, as the building block to build our DCNN model. Second, we proposed a genetic algorithm based method to efficiently search the best hyper-parameters of the DCNN in a large search space. The proposed method is evaluated on the benchmark database. The results of the proposed hyper-parameters search method show it will guide the search towards better regions of the parameter space. Based on the found hyper-parameters, we built our DCNN models, and evaluated its performance on satellite imagery classification, the results show the classification accuracy of proposed models outperform the state of the art method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=satellite%20imagery%20classification" title="satellite imagery classification">satellite imagery classification</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20convolution%20network" title=" deep convolution network"> deep convolution network</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=hyper-parameter%20optimization" title=" hyper-parameter optimization"> hyper-parameter optimization</a> </p> <a href="https://publications.waset.org/abstracts/44963/satellite-imagery-classification-based-on-deep-convolution-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44963.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">300</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">4639</span> Searchable Encryption in Cloud Storage</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ren%20Junn%20Hwang">Ren Junn Hwang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chung-Chien%20Lu"> Chung-Chien Lu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jain-Shing%20Wu"> Jain-Shing Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud outsource storage is one of important services in cloud computing. Cloud users upload data to cloud servers to reduce the cost of managing data and maintaining hardware and software. To ensure data confidentiality, users can encrypt their files before uploading them to a cloud system. However, retrieving the target file from the encrypted files exactly is difficult for cloud server. This study proposes a protocol for performing multikeyword searches for encrypted cloud data by applying k-nearest neighbor technology. The protocol ranks the relevance scores of encrypted files and keywords, and prevents cloud servers from learning search keywords submitted by a cloud user. To reduce the costs of file transfer communication, the cloud server returns encrypted files in order of relevance. Moreover, when a cloud user inputs an incorrect keyword and the number of wrong alphabet does not exceed a given threshold; the user still can retrieve the target files from cloud server. In addition, the proposed scheme satisfies security requirements for outsourced data storage. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fault-tolerance%20search" title="fault-tolerance search">fault-tolerance search</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-keywords%20search" title=" multi-keywords search"> multi-keywords search</a>, <a href="https://publications.waset.org/abstracts/search?q=outsource%20storage" title=" outsource storage"> outsource storage</a>, <a href="https://publications.waset.org/abstracts/search?q=ranked%20search" title=" ranked search"> ranked search</a>, <a href="https://publications.waset.org/abstracts/search?q=searchable%20encryption" title=" searchable encryption"> searchable encryption</a> </p> <a href="https://publications.waset.org/abstracts/8979/searchable-encryption-in-cloud-storage" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8979.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">383</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">4638</span> Joint Optimal Pricing and Lot-Sizing Decisions for an Advance Sales System under Stochastic Conditions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Ghoreishi">Maryam Ghoreishi</a>, <a href="https://publications.waset.org/abstracts/search?q=Christian%20Larsen"> Christian Larsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the effect of stochastic inputs on problem of joint optimal pricing and lot-sizing decisions where the inventory cycle is divided into advance and spot sales periods. During the advance sales period, customer can make reservations while customer with reservations can cancel their order. However, during the spot sales period customers receive the order as soon as the order is placed, but they cannot make any reservation or cancellation during that period. We assume that the inter arrival times during the advance sales and spot sales period are exponentially distributed where the arrival rate is decreasing function of price. Moreover, we assume that the number of cancelled reservations is binomially distributed. In addition, we assume that deterioration process follows an exponential distribution. We investigate two cases. First, we consider two-state case where we find the optimal price during the spot sales period and the optimal price during the advance sales period. Next, we develop a generalized case where we extend two-state case also to allow dynamic prices during the spot sales period. We apply the Markov decision theory in order to find the optimal solutions. In addition, for the generalized case, we apply the policy iteration algorithm in order to find the optimal prices, the optimal lot-size and maximum advance sales amount. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=inventory%20control" title="inventory control">inventory control</a>, <a href="https://publications.waset.org/abstracts/search?q=pricing" title=" pricing"> pricing</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20decision%20theory" title=" Markov decision theory"> Markov decision theory</a>, <a href="https://publications.waset.org/abstracts/search?q=advance%20sales%20system" title=" advance sales system"> advance sales system</a> </p> <a href="https://publications.waset.org/abstracts/83282/joint-optimal-pricing-and-lot-sizing-decisions-for-an-advance-sales-system-under-stochastic-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83282.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">323</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">4637</span> MIOM: A Mixed-Initiative Operational Model for Robots in Urban Search and Rescue</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mario%20Gianni">Mario Gianni</a>, <a href="https://publications.waset.org/abstracts/search?q=Federico%20Nardi"> Federico Nardi</a>, <a href="https://publications.waset.org/abstracts/search?q=Federico%20Ferri"> Federico Ferri</a>, <a href="https://publications.waset.org/abstracts/search?q=Filippo%20Cantucci"> Filippo Cantucci</a>, <a href="https://publications.waset.org/abstracts/search?q=Manuel%20A.%20Ruiz%20Garcia"> Manuel A. Ruiz Garcia</a>, <a href="https://publications.waset.org/abstracts/search?q=Karthik%20Pushparaj"> Karthik Pushparaj</a>, <a href="https://publications.waset.org/abstracts/search?q=Fiora%20Pirri"> Fiora Pirri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we describe a Mixed-Initiative Operational Model (MIOM) which directly intervenes on the state of the functionalities embedded into a robot for Urban Search&Rescue (USAR) domain applications. MIOM extends the reasoning capabilities of the vehicle, i.e. mapping, path planning, visual perception and trajectory tracking, with operator knowledge. Especially in USAR scenarios, this coupled initiative has the main advantage of enhancing the overall performance of a rescue mission. In-field experiments with rescue responders have been carried out to evaluate the effectiveness of this operational model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mixed-initiative%20planning%20and%20control" title="mixed-initiative planning and control">mixed-initiative planning and control</a>, <a href="https://publications.waset.org/abstracts/search?q=operator%20control%20interfaces%20for%20rescue%20robotics" title=" operator control interfaces for rescue robotics"> operator control interfaces for rescue robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=situation%20awareness" title=" situation awareness"> situation awareness</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20search" title=" urban search"> urban search</a>, <a href="https://publications.waset.org/abstracts/search?q=rescue%20robotics" title=" rescue robotics"> rescue robotics</a> </p> <a href="https://publications.waset.org/abstracts/45032/miom-a-mixed-initiative-operational-model-for-robots-in-urban-search-and-rescue" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45032.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">374</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">4636</span> An Enhanced Particle Swarm Optimization Algorithm for Multiobjective Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Houda%20Abadlia">Houda Abadlia</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadia%20Smairi"> Nadia Smairi</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Ghedira"> Khaled Ghedira</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multiobjective Particle Swarm Optimization (MOPSO) has shown an effective performance for solving test functions and real-world optimization problems. However, this method has a premature convergence problem, which may lead to lack of diversity. In order to improve its performance, this paper presents a hybrid approach which embedded the MOPSO into the island model and integrated a local search technique, Variable Neighborhood Search, to enhance the diversity into the swarm. Experiments on two series of test functions have shown the effectiveness of the proposed approach. A comparison with other evolutionary algorithms shows that the proposed approach presented a good performance in solving multiobjective optimization problems. <p class="card-text"><strong>Keywords:</strong> <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=migration" title=" migration"> migration</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a>, <a href="https://publications.waset.org/abstracts/search?q=multiobjective%20optimization" title=" multiobjective optimization"> multiobjective optimization</a> </p> <a href="https://publications.waset.org/abstracts/99544/an-enhanced-particle-swarm-optimization-algorithm-for-multiobjective-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99544.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">167</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">4635</span> Companies and Transplant Tourists to China</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pavel%20Porubiak">Pavel Porubiak</a>, <a href="https://publications.waset.org/abstracts/search?q=Lukas%20Kudlacek"> Lukas Kudlacek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction Transplant tourism is a controversial method of obtaining an organ, and that goes all the more for a country such as China, where sources of evidence point out to the possibility of organs being harvested illegally. This research aimed at listing the individual countries these tourists come from, or which medical companies sell transplant related products in there, with China being used as an example. Materials and methods The methodology of scoping study was used for both parts of the research. The countries from which transplant tourists come to China were identified by a search through existing medical studies in the NCBI PubMed database, listed under the keyword ‘transplantation in China’. The search was not limited by any other criteria, but only the studies available for free – directly on PubMed or a linked source – were used. Other research studies on this topic were considered as well. The companies were identified through multiple methods. The first was an online search focused on medical companies and their products. The Bloomberg Service, used by stock brokers worldwide, was then used to identify the revenue of these companies in individual countries – if data were available – as well as their business presence in China. A search through the U.S. Securities and Exchange Commission was done in the same way. Also a search on the Chinese internet was done, and to obtain more results, a second online search was done as well. The results and discussion The extensive search has identified 14 countries with transplant tourists to China. The search for a similar studies or reports resulted in finding additional six countries. The companies identified by our research also amounted to 20. Eight of them are sourcing China with organ preservation products – of which one is just trying to enter the Chinese market, six with immunosuppressive drugs, four with transplant diagnostics, one with medical robots which Chinese doctors use for transplantation as well, and another one trying to enter the Chinese market with a consumable-type product also related to transplantation. The conclusion The question of the ethicality of transplant tourism may be very pressing, since as the research shows, just the sheer amount of participating countries, sourcing transplant tourists to another one, amounts to 20. The identified companies are facing risks due to the nature of transplantation business in China, as officially executed prisoners are used as sources, and widely cited pieces of evidence point out to illegal organ harvesting. Similar risks and ethical questions are also relevant to the countries sourcing the transplant tourists to China. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=China" title="China">China</a>, <a href="https://publications.waset.org/abstracts/search?q=illegal%20organ%20harvesting" title=" illegal organ harvesting"> illegal organ harvesting</a>, <a href="https://publications.waset.org/abstracts/search?q=transplant%20tourism" title=" transplant tourism"> transplant tourism</a>, <a href="https://publications.waset.org/abstracts/search?q=organ%20harvesting%20technology" title=" organ harvesting technology"> organ harvesting technology</a> </p> <a href="https://publications.waset.org/abstracts/125240/companies-and-transplant-tourists-to-china" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125240.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">134</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">4634</span> A Constrained Neural Network Based Variable Neighborhood Search for the Multi-Objective Dynamic Flexible 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>, <a href="https://publications.waset.org/abstracts/search?q=Ozan%20Bahadir"> Ozan Bahadir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new neural network based variable neighborhood search is proposed for the multi-objective dynamic, flexible job shop scheduling problems. The neural network controls the problems' constraints to prevent infeasible solutions, while the Variable Neighborhood Search (VNS) applies moves, based on the critical block concept to improve the solutions. Two approaches are used for managing the constraints, in the first approach, infeasible solutions are modified according to the constraints, after the moves application, while in the second one, infeasible moves are prevented. Several neighborhood structures from the literature with some modifications, also new structures are used in the VNS. The suggested neighborhoods are more systematically defined and easy to implement. Comparison is done based on a multi-objective flexible job shop scheduling problem that is dynamic because of the jobs different release time and machines breakdowns. The results show that the presented method has better performance than the compared VNSs selected from the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constrained%20optimization" title="constrained optimization">constrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop%20scheduling" title=" flexible job shop scheduling"> flexible job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20multi-objective%20optimization" title=" dynamic multi-objective optimization"> dynamic multi-objective optimization</a> </p> <a href="https://publications.waset.org/abstracts/71919/a-constrained-neural-network-based-variable-neighborhood-search-for-the-multi-objective-dynamic-flexible-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71919.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">346</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">4633</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">4632</span> Optimal Design of Submersible Permanent Magnet Linear Synchronous Motor Based Design of Experiment and Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xiao%20Zhang">Xiao Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Wensheng%20Xiao"> Wensheng Xiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Junguo%20Cui"> Junguo Cui</a>, <a href="https://publications.waset.org/abstracts/search?q=Hongmin%20Wang"> Hongmin Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Submersible permanent magnet linear synchronous motors (SPMLSMs) are electromagnetic devices, which can directly drive plunger pump to obtain the crude oil. Those motors have been gradually applied in oil fields due to high thrust force density and high efficiency. Since the force performance closely depends on the concrete structural parameters, the seven different structural parameters are investigated in detail. This paper presents an optimum design of an SPMLSM to minimize the detent force and maximize the thrust by using design of experiment (DOE) and genetic algorithm (GA). The three significant structural parameters (air-gap length, slot width, pole-arc coefficient) are separately screened using 27 1/16 fractional factorial design (FFD) to investigate the significant effect of seven parameters used in this research on the force performance. Response surface methodology (RSM) is well adapted to make analytical model of thrust and detent force with constraints of corresponding significant parameters and enable objective function to be easily created, respectively. GA is performed as a searching tool to search for the Pareto-optimal solutions. By finite element analysis, the proposed PMLSM shows merits in improving thrust and reducing the detent force dramatically. <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=force%20performance" title=" force performance"> force performance</a>, <a href="https://publications.waset.org/abstracts/search?q=design%20of%20experiment%20%28DOE%29" title=" design of experiment (DOE)"> design of experiment (DOE)</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm%20%28GA%29" title=" genetic algorithm (GA)"> genetic algorithm (GA)</a> </p> <a href="https://publications.waset.org/abstracts/72951/optimal-design-of-submersible-permanent-magnet-linear-synchronous-motor-based-design-of-experiment-and-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72951.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">290</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">4631</span> Synthesis of Dispersion-Compensating Triangular Lattice Index-Guiding Photonic Crystal Fibers Using the Directed Tabu Search Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=F.%20Karim">F. Karim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, triangular lattice index-guiding photonic crystal fibers (PCFs) are synthesized to compensate the chromatic dispersion of a single mode fiber (SMF-28) for an 80 km optical link operating at 1.55 µm, by using the directed tabu search algorithm. Hole-to-hole distance, circular air-hole diameter, solid-core diameter, ring number and PCF length parameters are optimized for this purpose. Three Synthesized PCFs with different physical parameters are compared in terms of their objective functions values, residual dispersions and compensation ratios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=triangular%20lattice%20index-guiding%20photonic%20crystal%20fiber" title="triangular lattice index-guiding photonic crystal fiber">triangular lattice index-guiding photonic crystal fiber</a>, <a href="https://publications.waset.org/abstracts/search?q=dispersion%20compensation" title=" dispersion compensation"> dispersion compensation</a>, <a href="https://publications.waset.org/abstracts/search?q=directed%20tabu%20search" title=" directed tabu search"> directed tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=synthesis" title=" synthesis"> synthesis</a> </p> <a href="https://publications.waset.org/abstracts/39125/synthesis-of-dispersion-compensating-triangular-lattice-index-guiding-photonic-crystal-fibers-using-the-directed-tabu-search-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39125.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">432</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">4630</span> Selection of Optimal Reduced Feature Sets of Brain Signal Analysis Using Heuristically Optimized Deep Autoencoder</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Souvik%20Phadikar">Souvik Phadikar</a>, <a href="https://publications.waset.org/abstracts/search?q=Nidul%20Sinha"> Nidul Sinha</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajdeep%20Ghosh"> Rajdeep Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In brainwaves research using electroencephalogram (EEG) signals, finding the most relevant and effective feature set for identification of activities in the human brain is a big challenge till today because of the random nature of the signals. The feature extraction method is a key issue to solve this problem. Finding those features that prove to give distinctive pictures for different activities and similar for the same activities is very difficult, especially for the number of activities. The performance of a classifier accuracy depends on this quality of feature set. Further, more number of features result in high computational complexity and less number of features compromise with the lower performance. In this paper, a novel idea of the selection of optimal feature set using a heuristically optimized deep autoencoder is presented. Using various feature extraction methods, a vast number of features are extracted from the EEG signals and fed to the autoencoder deep neural network. The autoencoder encodes the input features into a small set of codes. To avoid the gradient vanish problem and normalization of the dataset, a meta-heuristic search algorithm is used to minimize the mean square error (MSE) between encoder input and decoder output. To reduce the feature set into a smaller one, 4 hidden layers are considered in the autoencoder network; hence it is called Heuristically Optimized Deep Autoencoder (HO-DAE). In this method, no features are rejected; all the features are combined into the response of responses of the hidden layer. The results reveal that higher accuracy can be achieved using optimal reduced features. The proposed HO-DAE is also compared with the regular autoencoder to test the performance of both. The performance of the proposed method is validated and compared with the other two methods recently reported in the literature, which reveals that the proposed method is far better than the other two methods in terms of classification accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autoencoder" title="autoencoder">autoencoder</a>, <a href="https://publications.waset.org/abstracts/search?q=brainwave%20signal%20analysis" title=" brainwave signal analysis"> brainwave signal analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=electroencephalogram" title=" electroencephalogram"> electroencephalogram</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20extraction" title=" feature extraction"> feature extraction</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=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/118906/selection-of-optimal-reduced-feature-sets-of-brain-signal-analysis-using-heuristically-optimized-deep-autoencoder" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118906.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">114</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">4629</span> A Polynomial Time Clustering Algorithm for Solving the Assignment Problem in the Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lydia%20Wahid">Lydia Wahid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mona%20F.%20Ahmed"> Mona F. Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Nevin%20Darwish"> Nevin Darwish</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vehicle routing problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two subproblems: The first subproblem is an assignment problem where the number of vehicles that will be used as well as the customers assigned to each vehicle are determined. The second subproblem is the routing problem in which for each vehicle having a number of customers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles, as well as optimal total distance, should be achieved. In this paper, an approach for solving the first subproblem (the assignment problem) is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. Finding the optimal number of clusters is NP-hard. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters and solving the assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problems" title="vehicle routing problems">vehicle routing problems</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Clarke%20and%20Wright%20Saving%20Method" title=" Clarke and Wright Saving Method"> Clarke and Wright Saving Method</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/85552/a-polynomial-time-clustering-algorithm-for-solving-the-assignment-problem-in-the-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85552.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">4628</span> Optimal Path Motion of Positional Electric Drive</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Grigoryev">M. A. Grigoryev</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Shishkov"> A. N. Shishkov</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20V.%20Savosteenko"> N. V. Savosteenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article identifies optimal path motion of positional electric drive, for example, the feed of cold pilgering mill. It is shown that triangle is the optimum shape of the speed curve, and the ratio of its sides depends on the type of load diagram, in particular from the influence of the main drive of pilgering mill, and is not dependent on the presence of backlash and elasticity in the system. This thesis is proved analytically, and confirmed the results are obtained by a mathematical model that take into account the influence of the main drive-to-drive feed. By statistical analysis of oscillograph traces obtained on the real object allowed to give recommendations on the optimal control of the electric drive feed cold pilgering mill 450. Based on the data that the load torque depends on by hit the pipe in rolls of pilgering mill, occurs in the interval (0,6…0,75) tc, the recommended ratio of start time to the braking time is 2:1. Optimized path motion allowed get up to 25% more RMS torque for the cycle that allowed increased the productivity of the mill. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20curve%20speed" title="optimal curve speed">optimal curve speed</a>, <a href="https://publications.waset.org/abstracts/search?q=positional%20electric%20drive" title=" positional electric drive"> positional electric drive</a>, <a href="https://publications.waset.org/abstracts/search?q=cold%20pilgering%20mill%20450" title=" cold pilgering mill 450"> cold pilgering mill 450</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion" title=" optimal path motion"> optimal path motion</a> </p> <a href="https://publications.waset.org/abstracts/46141/optimal-path-motion-of-positional-electric-drive" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46141.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">318</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">4627</span> Particle Filter State Estimation Algorithm Based on Improved Artificial Bee Colony Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guangyuan%20Zhao">Guangyuan Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Nan%20Huang"> Nan Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xuesong%20Han"> Xuesong Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Xu%20Huang"> Xu Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to solve the problem of sample dilution in the traditional particle filter algorithm and achieve accurate state estimation in a nonlinear system, a particle filter method based on an improved artificial bee colony (ABC) algorithm was proposed. The algorithm simulated the process of bee foraging and optimization and made the high likelihood region of the backward probability of particles moving to improve the rationality of particle distribution. The opposition-based learning (OBL) strategy is introduced to optimize the initial population of the artificial bee colony algorithm. The convergence factor is introduced into the neighborhood search strategy to limit the search range and improve the convergence speed. Finally, the crossover and mutation operations of the genetic algorithm are introduced into the search mechanism of the following bee, which makes the algorithm jump out of the local extreme value quickly and continue to search the global extreme value to improve its optimization ability. The simulation results show that the improved method can improve the estimation accuracy of particle filters, ensure the diversity of particles, and improve the rationality of particle distribution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=particle%20filter" title="particle filter">particle filter</a>, <a href="https://publications.waset.org/abstracts/search?q=impoverishment" title=" impoverishment"> impoverishment</a>, <a href="https://publications.waset.org/abstracts/search?q=state%20estimation" title=" state estimation"> state estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony%20algorithm" title=" artificial bee colony algorithm"> artificial bee colony algorithm</a> </p> <a href="https://publications.waset.org/abstracts/174985/particle-filter-state-estimation-algorithm-based-on-improved-artificial-bee-colony-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/174985.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">151</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4626</span> Licensing in a Hotelling Model with Quadratic Transportation Costs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fehmi%20Bouguezzi">Fehmi Bouguezzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies optimal licensing regimes in a linear Hotelling model where firms are located at the end points of the city and where the transportation cost is not linear but quadratic. We study for that a more general cost function and we try to compare the findings with the results of the linear cost. We find the same optimal licensing regimes. A per unit royalty is optimal when innovation is not drastic and no licensing is better when innovation is drastic. We also find that no licensing is always better than fixed fee licensing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hotelling%20model" title="Hotelling model">Hotelling model</a>, <a href="https://publications.waset.org/abstracts/search?q=technology%20transfer" title=" technology transfer"> technology transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=patent%20licensing" title=" patent licensing"> patent licensing</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20transportation%20cost" title=" quadratic transportation cost"> quadratic transportation cost</a> </p> <a href="https://publications.waset.org/abstracts/15248/licensing-in-a-hotelling-model-with-quadratic-transportation-costs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15248.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4625</span> A Proposed Optimized and Efficient Intrusion Detection System for Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulaziz%20Alsadhan">Abdulaziz Alsadhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Naveed%20Khan"> Naveed Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years intrusions on computer network are the major security threat. Hence, it is important to impede such intrusions. The hindrance of such intrusions entirely relies on its detection, which is primary concern of any security tool like Intrusion Detection System (IDS). Therefore, it is imperative to accurately detect network attack. Numerous intrusion detection techniques are available but the main issue is their performance. The performance of IDS can be improved by increasing the accurate detection rate and reducing false positive. The existing intrusion detection techniques have the limitation of usage of raw data set for classification. The classifier may get jumble due to redundancy, which results incorrect classification. To minimize this problem, Principle Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Local Binary Pattern (LBP) can be applied to transform raw features into principle features space and select the features based on their sensitivity. Eigen values can be used to determine the sensitivity. To further classify, the selected features greedy search, back elimination, and Particle Swarm Optimization (PSO) can be used to obtain a subset of features with optimal sensitivity and highest discriminatory power. These optimal feature subset used to perform classification. For classification purpose, Support Vector Machine (SVM) and Multilayer Perceptron (MLP) used due to its proven ability in classification. The Knowledge Discovery and Data mining (KDD’99) cup dataset was considered as a benchmark for evaluating security detection mechanisms. The proposed approach can provide an optimal intrusion detection mechanism that outperforms the existing approaches and has the capability to minimize the number of features and maximize the detection rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Particle%20Swarm%20Optimization%20%28PSO%29" title="Particle Swarm Optimization (PSO)">Particle Swarm Optimization (PSO)</a>, <a href="https://publications.waset.org/abstracts/search?q=Principle%20Component%20Analysis%20%28PCA%29" title=" Principle Component Analysis (PCA)"> Principle Component Analysis (PCA)</a>, <a href="https://publications.waset.org/abstracts/search?q=Linear%20Discriminant%20Analysis%20%28LDA%29" title=" Linear Discriminant Analysis (LDA)"> Linear Discriminant Analysis (LDA)</a>, <a href="https://publications.waset.org/abstracts/search?q=Local%20Binary%20Pattern%20%28LBP%29" title=" Local Binary Pattern (LBP)"> Local Binary Pattern (LBP)</a>, <a href="https://publications.waset.org/abstracts/search?q=Support%20Vector%20Machine%20%28SVM%29" title=" Support Vector Machine (SVM)"> Support Vector Machine (SVM)</a>, <a href="https://publications.waset.org/abstracts/search?q=Multilayer%20Perceptron%20%28MLP%29" title=" Multilayer Perceptron (MLP)"> Multilayer Perceptron (MLP)</a> </p> <a href="https://publications.waset.org/abstracts/1787/a-proposed-optimized-and-efficient-intrusion-detection-system-for-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1787.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">4624</span> Convergence Analysis of a Gibbs Sampling Based Mix Design Optimization Approach for High Compressive Strength Pervious Concrete</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiaqi%20Huang">Jiaqi Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Lu%20Jin"> Lu Jin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pervious concrete features with high water permeability rate. However, due to the lack of fine aggregates, the compressive strength is usually lower than other conventional concrete products. Optimization of pervious concrete mix design has long been recognized as an effective mechanism to achieve high compressive strength while maintaining desired permeability rate. In this paper, a Gibbs Sampling based algorithm is proposed to approximate the optimal mix design to achieve a high compressive strength of pervious concrete. We prove that the proposed algorithm efficiently converges to the set of global optimal solutions. The convergence rate and accuracy depend on a control parameter employed in the proposed algorithm. The simulation results show that, by using the proposed approach, the system converges to the optimal solution quickly and the derived optimal mix design achieves the maximum compressive strength while maintaining the desired permeability rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergence" title="convergence">convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=Gibbs%20Sampling" title=" Gibbs Sampling"> Gibbs Sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20compressive%20strength" title=" high compressive strength"> high compressive strength</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20mix%20design" title=" optimal mix design"> optimal mix design</a>, <a href="https://publications.waset.org/abstracts/search?q=pervious%20concrete" title=" pervious concrete"> pervious concrete</a> </p> <a href="https://publications.waset.org/abstracts/88245/convergence-analysis-of-a-gibbs-sampling-based-mix-design-optimization-approach-for-high-compressive-strength-pervious-concrete" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88245.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">181</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">4623</span> Recovery of Chromium(III) from Tannery Wastewater by Nanoparticles and Whiskers of Chitosan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=El%20Montassir%20Dahmane">El Montassir Dahmane</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadia%20Eladlani"> Nadia Eladlani</a>, <a href="https://publications.waset.org/abstracts/search?q=Aziz%20Ouahrouch"> Aziz Ouahrouch</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Rhazi"> Mohammed Rhazi</a>, <a href="https://publications.waset.org/abstracts/search?q=Moha%20Taourirte"> Moha Taourirte</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study was aimed to approximate the optimal conditions to chromium recovery from wastewater by nanoparticles and whiskers of chitosan. Chitosan with an average molecular weight of 63 kDa and a 96% deacetylation degree was prepared according to our previous study. Chromium recovery is influenced by different parameters. In our search, we determined the appropriate range of pH to form chitosan–Cr(III), nanoparticles Cr(III), and whiskers– Cr(III) complex. We studied also the influence of chromium concentration and the nature of chitosan-based materials on the complexation process. Our main aim is to approximate the optimal conditions to remove chromium(III) from the tanning bath, recuperated from tannery wastewater of Marrakech in Morocco. A Perkin Elmer optima 2000 Inductively Coupled Plasma- Optical Emission Spectrometer (ICP-OES), was used to determine the quantity of chromium persistent in tannery wastewater after complexation phenomenon. To the best of our knowledge, this is the first report interested in the optimal conditions for chromium recovery from wastewater by nanoparticles and whiskers of chitosan. From our research, we found that in chromium solution, the appropriate range of pH to form complex is between 5.6 and 6.7. Also, the complexation of Cr(III) is depending on the nature of complexing ligand and chromium concentration. The obtained results reveal that nanoparticles present an excellent adsorption capacity regardless of chromium concentration. In addition, after a critical chromium concentration (250 mg/l), our ligand becomes saturated, that requires an increase of ligand mass for increasing chromium concentration in order to have a better adsorption capacity. Hence, in the same conditions, we used chitosan, its nanoparticles, whiskers, and chitosan based films to remove Cr(III) from tannery wastewater. The pH of this effluent was around 6, and its chromium concentration was 300 mg/l. The results expose that the sequence of complexing ligand in the effluent is the same in chromium solution, determined via our previous study. However, the adsorbed quantity is less due to the presence of other metallic ions in tannery wastewater. We conclude that the best complexing ligand-based chitosan is chitosan nanoaprticles whether it’s in chromium solution or in tannery wastewater. Nanoparticles are the best complexing ligand after 24 h of contact nanoparticles can remove 70% of chromium from this tannery wastewater. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nanoparticles" title="nanoparticles">nanoparticles</a>, <a href="https://publications.waset.org/abstracts/search?q=whiskers" title=" whiskers"> whiskers</a>, <a href="https://publications.waset.org/abstracts/search?q=chitosan" title=" chitosan"> chitosan</a>, <a href="https://publications.waset.org/abstracts/search?q=chromium" title=" chromium"> chromium</a> </p> <a href="https://publications.waset.org/abstracts/118576/recovery-of-chromiumiii-from-tannery-wastewater-by-nanoparticles-and-whiskers-of-chitosan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118576.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">136</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">4622</span> An Integrated Cognitive Performance Evaluation Framework for Urban Search and Rescue Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Antonio%20D.%20Lee">Antonio D. Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Steven%20X.%20Jiang"> Steven X. Jiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A variety of techniques and methods are available to evaluate cognitive performance in Urban Search and Rescue (USAR) applications. However, traditional cognitive performance evaluation techniques typically incorporate either the conscious or systematic aspect, failing to take into consideration the subconscious or intuitive aspect. This leads to incomplete measures and produces ineffective designs. In order to fill the gaps in past research, this study developed a theoretical framework to facilitate the integration of situation awareness (SA) and intuitive pattern recognition (IPR) to enhance the cognitive performance representation in USAR applications. This framework provides guidance to integrate both SA and IPR in order to evaluate the cognitive performance of the USAR responders. The application of this framework will help improve the system design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20performance" title="cognitive performance">cognitive performance</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitive%20pattern%20recognition" title=" intuitive pattern recognition"> intuitive pattern recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=situation%20awareness" title=" situation awareness"> situation awareness</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20search%20and%20rescue" title=" urban search and rescue"> urban search and rescue</a> </p> <a href="https://publications.waset.org/abstracts/42030/an-integrated-cognitive-performance-evaluation-framework-for-urban-search-and-rescue-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42030.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">328</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">4621</span> Global Direct Search Optimization of a Tuned Liquid Column Damper Subject to Stochastic Load</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mansour%20H.%20Alkmim">Mansour H. Alkmim</a>, <a href="https://publications.waset.org/abstracts/search?q=Adriano%20T.%20Fabro"> Adriano T. Fabro</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcus%20V.%20G.%20De%20Morais"> Marcus V. G. De Morais</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a global direct search optimization algorithm to reduce vibration of a tuned liquid column damper (TLCD), a class of passive structural control device, is presented. The objective is to find optimized parameters for the TLCD under stochastic load from different wind power spectral density. A verification is made considering the analytical solution of an undamped primary system under white noise excitation. Finally, a numerical example considering a simplified wind turbine model is given to illustrate the efficacy of the TLCD. Results from the random vibration analysis are shown for four types of random excitation wind model where the response PSDs obtained showed good vibration attenuation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20pattern%20search" title="generalized pattern search">generalized pattern search</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20optimization" title=" parameter optimization"> parameter optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20vibration%20analysis" title=" random vibration analysis"> random vibration analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=vibration%20suppression" title=" vibration suppression"> vibration suppression</a> </p> <a href="https://publications.waset.org/abstracts/68674/global-direct-search-optimization-of-a-tuned-liquid-column-damper-subject-to-stochastic-load" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68674.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">275</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">4620</span> Improving Research by the Integration of a Collaborative Dimension in an Information Retrieval (IR) System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amel%20Hannech">Amel Hannech</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehdi%20Adda"> Mehdi Adda</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamid%20Mcheick"> Hamid Mcheick</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In computer science, the purpose of finding useful information is still one of the most active and important research topics. The most popular application of information retrieval (IR) are Search Engines, they meet users' specific needs and aim to locate the effective information in the web. However, these search engines have some limitations related to the relevancy of the results and the ease to explore those results. In this context, we proposed in previous works a Multi-Space Search Engine model that is based on a multidimensional interpretation universe. In the present paper, we integrate an additional dimension that allows to offer users new research experiences. The added component is based on creating user profiles and calculating the similarity between them that then allow the use of collaborative filtering in retrieving search results. To evaluate the effectiveness of the proposed model, a prototype is developed. The experiments showed that the additional dimension has improved the relevancy of results by predicting the interesting items of users based on their experiences and the experiences of other similar users. The offered personalization service allows users to approve the pertinent items, which allows to enrich their profiles and further improve research. <p class="card-text"><strong>Keywords:</strong> <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=v-facets" title=" v-facets"> v-facets</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20behavior%20analysis" title=" user behavior analysis"> user behavior analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20profiles" title=" user profiles"> user profiles</a>, <a href="https://publications.waset.org/abstracts/search?q=topical%20ontology" title=" topical ontology"> topical ontology</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20personalization" title=" data personalization"> data personalization</a> </p> <a href="https://publications.waset.org/abstracts/57740/improving-research-by-the-integration-of-a-collaborative-dimension-in-an-information-retrieval-ir-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57740.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">262</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">4619</span> Optimal Tracking Control of a Hydroelectric Power Plant Incorporating Neural Forecasting for Uncertain Input Disturbances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marlene%20Perez%20Villalpando">Marlene Perez Villalpando</a>, <a href="https://publications.waset.org/abstracts/search?q=Kelly%20Joel%20Gurubel%20Tun"> Kelly Joel Gurubel Tun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an optimal control strategy for a hydroelectric power plant subject to input disturbances like meteorological phenomena. The engineering characteristics of the system are described by a nonlinear model. The random availability of renewable sources is predicted by a high-order neural network trained with an extended Kalman filter, whereas the power generation is regulated by the optimal control law. The main advantage of the system is the stabilization of the amount of power generated in the plant. A control supervisor maintains stability and availability in hydropower reservoirs water levels for power generation. The proposed approach demonstrated a good performance to stabilize the reservoir level and the power generation along their desired trajectories in the presence of disturbances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hydropower" title="hydropower">hydropower</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20order%20neural%20network" title=" high order neural network"> high order neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalman%20filter" title=" Kalman filter"> Kalman filter</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a> </p> <a href="https://publications.waset.org/abstracts/132201/optimal-tracking-control-of-a-hydroelectric-power-plant-incorporating-neural-forecasting-for-uncertain-input-disturbances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132201.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">298</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">4618</span> Crow Search Algorithm-Based Task Offloading Strategies for Fog Computing Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aniket%20Ganvir">Aniket Ganvir</a>, <a href="https://publications.waset.org/abstracts/search?q=Ritarani%20Sahu"> Ritarani Sahu</a>, <a href="https://publications.waset.org/abstracts/search?q=Suchismita%20Chinara"> Suchismita Chinara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid digitization of various aspects of life is leading to the creation of smart IoT ecosystems, where interconnected devices generate significant amounts of valuable data. However, these IoT devices face constraints such as limited computational resources and bandwidth. Cloud computing emerges as a solution by offering ample resources for offloading tasks efficiently despite introducing latency issues, especially for time-sensitive applications like fog computing. Fog computing (FC) addresses latency concerns by bringing computation and storage closer to the network edge, minimizing data travel distance, and enhancing efficiency. Offloading tasks to fog nodes or the cloud can conserve energy and extend IoT device lifespan. The offloading process is intricate, with tasks categorized as full or partial, and its optimization presents an NP-hard problem. Traditional greedy search methods struggle to address the complexity of task offloading efficiently. To overcome this, the efficient crow search algorithm (ECSA) has been proposed as a meta-heuristic optimization algorithm. ECSA aims to effectively optimize computation offloading, providing solutions to this challenging problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=IoT" title="IoT">IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=fog%20computing" title=" fog computing"> fog computing</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20offloading" title=" task offloading"> task offloading</a>, <a href="https://publications.waset.org/abstracts/search?q=efficient%20crow%20search%20algorithm" title=" efficient crow search algorithm"> efficient crow search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/184694/crow-search-algorithm-based-task-offloading-strategies-for-fog-computing-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184694.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">58</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">4617</span> Optimal Power Exchange of Multi-Microgrids with Hierarchical Coordination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Beom-Ryeol%20Choi">Beom-Ryeol Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Won-Poong%20Lee"> Won-Poong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin-Young%20Choi"> Jin-Young Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Young-Hak%20Shin"> Young-Hak Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Dong-Jun%20Won"> Dong-Jun Won</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A Microgrid (MG) has a major role in power system. There are numerous benefits, such as ability to reduce environmental impact and enhance the reliability of a power system. Hence, Multi-MG (MMG) consisted of multiple MGs is being studied intensively. This paper proposes the optimal power exchange of MMG with hierarchical coordination. The whole system architecture consists of two layers: 1) upper layer including MG of MG Center (MoMC) which is in charge of the overall management and coordination and 2) lower layer comprised of several Microgrid-Energy Management Systems (MG-EMSs) which make a decision for own schedule. In order to accomplish the optimal power exchange, the proposed coordination algorithm is applied to MMG system. The objective of this process is to achieve optimal operation for improving economics under the grid-connected operation. The simulation results show how the output of each MG can be changed through coordination algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microgrids" title="microgrids">microgrids</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-microgrids" title=" multi-microgrids"> multi-microgrids</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20exchange" title=" power exchange"> power exchange</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20coordination" title=" hierarchical coordination"> hierarchical coordination</a> </p> <a href="https://publications.waset.org/abstracts/72872/optimal-power-exchange-of-multi-microgrids-with-hierarchical-coordination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72872.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">372</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4616</span> Improving Load Frequency Control of Multi-Area Power System by Considering Uncertainty by Using Optimized Type 2 Fuzzy Pid Controller with 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=Mehrdad%20Mahmudizad">Mehrdad Mahmudizad</a>, <a href="https://publications.waset.org/abstracts/search?q=Roya%20Ahmadi%20Ahangar"> Roya Ahmadi Ahangar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the method of designing the type 2 fuzzy PID controllers in order to solve the problem of Load Frequency Control (LFC). The Harmony Search (HS) algorithm is used to regulate the measurement factors and the effect of uncertainty of membership functions of Interval Type 2 Fuzzy Proportional Integral Differential (IT2FPID) controllers in order to reduce the frequency deviation resulted from the load oscillations. The simulation results implicitly show that the performance of the proposed IT2FPID LFC in terms of error, settling time and resistance against different load oscillations is more appropriate and preferred than PID and Type 1 Fuzzy Proportional Integral Differential (T1FPID) controllers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load%20frequency%20control" title="load frequency control">load frequency control</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy-pid%20controller" title=" fuzzy-pid controller"> fuzzy-pid controller</a>, <a href="https://publications.waset.org/abstracts/search?q=type%202%20fuzzy%20system" title=" type 2 fuzzy system"> type 2 fuzzy system</a>, <a href="https://publications.waset.org/abstracts/search?q=harmony%20search%20algorithm" title=" harmony search algorithm"> harmony search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/52340/improving-load-frequency-control-of-multi-area-power-system-by-considering-uncertainty-by-using-optimized-type-2-fuzzy-pid-controller-with-the-harmony-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52340.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">278</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">4615</span> Optimal Sliding Mode Controller for Knee Flexion during Walking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Sitler">Gabriel Sitler</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Sardahi"> Yousef Sardahi</a>, <a href="https://publications.waset.org/abstracts/search?q=Asad%20Salem"> Asad Salem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an optimal and robust sliding mode controller (SMC) to regulate the position of the knee joint angle for patients suffering from knee injuries. The controller imitates the role of active orthoses that produce the joint torques required to overcome gravity and loading forces and regain natural human movements. To this end, a mathematical model of the shank, the lower part of the leg, is derived first and then used for the control system design and computer simulations. The design of the controller is carried out in optimal and multi-objective settings. Four objectives are considered: minimization of the control effort and tracking error; and maximization of the control signal smoothness and closed-loop system’s speed of response. Optimal solutions in terms of the Pareto set and its image, the Pareto front, are obtained. The results show that there are trade-offs among the design objectives and many optimal solutions from which the decision-maker can choose to implement. Also, computer simulations conducted at different points from the Pareto set and assuming knee squat movement demonstrate competing relationships among the design goals. In addition, the proposed control algorithm shows robustness in tracking a standard gait signal when accounting for uncertainty in the shank’s parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title="optimal control">optimal control</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=sliding%20mode%20control" title=" sliding mode control"> sliding mode control</a>, <a href="https://publications.waset.org/abstracts/search?q=wearable%20knee%20exoskeletons" title=" wearable knee exoskeletons"> wearable knee exoskeletons</a> </p> <a href="https://publications.waset.org/abstracts/164514/optimal-sliding-mode-controller-for-knee-flexion-during-walking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164514.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">82</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">4614</span> Enhanced Arabic Semantic Information Retrieval System Based on Arabic Text Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Elsehemy">A. Elsehemy</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Abdeen"> M. Abdeen </a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Nazmy"> T. Nazmy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the appearance of the Semantic web, many semantic search techniques and models were proposed to exploit the information in ontology to enhance the traditional keyword-based search. Many advances were made in languages such as English, German, French and Spanish. However, other languages such as Arabic are not fully supported yet. In this paper we present a framework for ontology based information retrieval for Arabic language. Our system consists of four main modules, namely query parser, indexer, search and a ranking module. Our approach includes building a semantic index by linking ontology concepts to documents, including an annotation weight for each link, to be used in ranking the results. We also augmented the framework with an automatic document categorizer, which enhances the overall document ranking. We have built three Arabic domain ontologies: Sports, Economic and Politics as example for the Arabic language. We built a knowledge base that consists of 79 classes and more than 1456 instances. The system is evaluated using the precision and recall metrics. We have done many retrieval operations on a sample of 40,316 documents with a size 320 MB of pure text. The results show that the semantic search enhanced with text classification gives better performance results than the system without classification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arabic%20text%20classification" title="Arabic text classification">Arabic text classification</a>, <a href="https://publications.waset.org/abstracts/search?q=ontology%20based%20retrieval" title=" ontology based retrieval"> ontology based retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=Arabic%20semantic%20web" title=" Arabic semantic web"> Arabic semantic web</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=Arabic%20ontology" title=" Arabic ontology"> Arabic ontology</a> </p> <a href="https://publications.waset.org/abstracts/34945/enhanced-arabic-semantic-information-retrieval-system-based-on-arabic-text-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34945.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">525</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">4613</span> Analysis on Prediction Models of TBM Performance and Selection of Optimal Input Parameters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hang%20Lo%20Lee">Hang Lo Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ki%20Il%20Song"> Ki Il Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Hee%20Hwan%20Ryu"> Hee Hwan Ryu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An accurate prediction of TBM(Tunnel Boring Machine) performance is very difficult for reliable estimation of the construction period and cost in preconstruction stage. For this purpose, the aim of this study is to analyze the evaluation process of various prediction models published since 2000 for TBM performance, and to select the optimal input parameters for the prediction model. A classification system of TBM performance prediction model and applied methodology are proposed in this research. Input and output parameters applied for prediction models are also represented. Based on these results, a statistical analysis is performed using the collected data from shield TBM tunnel in South Korea. By performing a simple regression and residual analysis utilizinFg statistical program, R, the optimal input parameters are selected. These results are expected to be used for development of prediction model of TBM performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=TBM%20performance%20prediction%20model" title="TBM performance prediction model">TBM performance prediction model</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20system" title=" classification system"> classification system</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20regression%20analysis" title=" simple regression analysis"> simple regression analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=residual%20analysis" title=" residual analysis"> residual analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20input%20parameters" title=" optimal input parameters"> optimal input parameters</a> </p> <a href="https://publications.waset.org/abstracts/52738/analysis-on-prediction-models-of-tbm-performance-and-selection-of-optimal-input-parameters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52738.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">4612</span> Systematic Literature Review of Therapeutic Use of Autonomous Sensory Meridian Response (ASMR) and Short-Term ASMR Auditory Training Trial</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christine%20H.%20Cubelo">Christine H. Cubelo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study consists of 2-parts: a systematic review of current publications on the therapeutic use of autonomous sensory meridian response (ASMR) and a within-subjects auditory training trial using ASMR videos. The main intent is to explore ASMR as potentially therapeutically beneficial for those with atypical sensory processing. Many hearing-related disorders and mood or anxiety symptoms overlap with symptoms of sensory processing issues. For this reason, inclusion and exclusion criteria of the systematic review were generated in an effort to produce optimal search outcomes and avoid overly confined criteria that would limit yielded results. Criteria for inclusion in the review for Part 1 are (1) adult participants diagnosed with hearing loss or atypical sensory processing, (2) inclusion of measures related to ASMR as a treatment method, and (3) published between 2000 and 2022. A total of 1,088 publications were found in the preliminary search, and a total of 13 articles met the inclusion criteria. A total of 14 participants completed the trial and post-trial questionnaire. Of all responses, 64.29% agreed that the duration of auditory training sessions was reasonable. In addition, 71.43% agreed that the training improved their perception of music. Lastly, 64.29% agreed that the training improved their perception of a primary talker when there are other talkers or background noises present. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomous%20sensory%20meridian%20response" title="autonomous sensory meridian response">autonomous sensory meridian response</a>, <a href="https://publications.waset.org/abstracts/search?q=auditory%20training" title=" auditory training"> auditory training</a>, <a href="https://publications.waset.org/abstracts/search?q=atypical%20sensory%20processing" title=" atypical sensory processing"> atypical sensory processing</a>, <a href="https://publications.waset.org/abstracts/search?q=hearing%20loss" title=" hearing loss"> hearing loss</a>, <a href="https://publications.waset.org/abstracts/search?q=hearing%20aids" title=" hearing aids"> hearing aids</a> </p> <a href="https://publications.waset.org/abstracts/173535/systematic-literature-review-of-therapeutic-use-of-autonomous-sensory-meridian-response-asmr-and-short-term-asmr-auditory-training-trial" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173535.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">55</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=6" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=1">1</a></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 active"><span class="page-link">7</span></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=160">160</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=161">161</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20search&page=8" 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>