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: cuckoo search</title> <meta name="description" content="Search results for: cuckoo search"> <meta name="keywords" content="cuckoo 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="cuckoo 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="cuckoo 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> 1889</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: cuckoo search</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1769</span> 2D Fingerprint Performance for PubChem Chemical Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fatimah%20Zawani%20Abdullah">Fatimah Zawani Abdullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Shereena%20Mohd%20Arif"> Shereena Mohd Arif</a>, <a href="https://publications.waset.org/abstracts/search?q=Nurul%20Malim"> Nurul Malim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study of molecular similarity search in chemical database is increasingly widespread, especially in the area of drug discovery. Similarity search is an application in the field of Chemoinformatics to measure the similarity between the molecular structure which is known as the query and the structure of chemical compounds in the database. Similarity search is also one of the approaches in virtual screening which involves computational techniques and scoring the probabilities of activity. The main objective of this work is to determine the best fingerprint when compared to the other five fingerprints selected in this study using PubChem chemical dataset. This paper will discuss the similarity searching process conducted using 6 types of descriptors, which are ECFP4, ECFC4, FCFP4, FCFC4, SRECFC4 and SRFCFC4 on 15 activity classes of PubChem dataset using Tanimoto coefficient to calculate the similarity between the query structures and each of the database structure. The results suggest that ECFP4 performs the best to be used with Tanimoto coefficient in the PubChem dataset. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=2D%20fingerprints" title="2D fingerprints">2D fingerprints</a>, <a href="https://publications.waset.org/abstracts/search?q=Tanimoto" title=" Tanimoto"> Tanimoto</a>, <a href="https://publications.waset.org/abstracts/search?q=PubChem" title=" PubChem"> PubChem</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20searching" title=" similarity searching"> similarity searching</a>, <a href="https://publications.waset.org/abstracts/search?q=chemoinformatics" title=" chemoinformatics"> chemoinformatics</a> </p> <a href="https://publications.waset.org/abstracts/15097/2d-fingerprint-performance-for-pubchem-chemical-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15097.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">293</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">1768</span> Chaotic Search Optimal Design and Modeling of Permanent Magnet Synchronous Linear Motor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yang%20Yi-Fei">Yang Yi-Fei</a>, <a href="https://publications.waset.org/abstracts/search?q=Luo%20Min-Zhou"> Luo Min-Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Fu-Chun"> Zhang Fu-Chun</a>, <a href="https://publications.waset.org/abstracts/search?q=He%20Nai-Bao"> He Nai-Bao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xing%20Shao-Bang"> Xing Shao-Bang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an electromagnetic finite element model of permanent magnet synchronous linear motor and distortion rate of the air gap flux density waveform is analyzed in detail. By designing the sample space of the parameters, nonlinear regression modeling of the orthogonal experimental design is introduced. We put forward for possible air gap flux density waveform sine electromagnetic scheme. Parameters optimization of the permanent magnet synchronous linear motor is also introduced which is based on chaotic search and adaptation function. Simulation results prove that the pole shifting does not affect the motor back electromotive symmetry based on the structural parameters, it provides a novel way for the optimum design of permanent magnet synchronous linear motor and other engineering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=permanent%20magnet%20synchronous%20linear%20motor" title="permanent magnet synchronous linear motor">permanent magnet synchronous linear motor</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20analysis" title=" finite element analysis"> finite element analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=chaotic%20search" title=" chaotic search"> chaotic search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20design" title=" optimization design"> optimization design</a> </p> <a href="https://publications.waset.org/abstracts/48599/chaotic-search-optimal-design-and-modeling-of-permanent-magnet-synchronous-linear-motor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48599.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">417</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1767</span> On Privacy-Preserving Search in the Encrypted Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chun-Shien%20Lu">Chun-Shien Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Privacy-preserving query has recently received considerable attention in the signal processing and multimedia community. It is also a critical step in wireless sensor network for retrieval of sensitive data. The purposes of privacy-preserving query in both the areas of signal processing and sensor network are the same, but the similarity and difference of the adopted technologies are not fully explored. In this paper, we first review the recently developed methods of privacy-preserving query, and then describe in a comprehensive manner what we can learn from the mutual of both areas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption" title="encryption">encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy-preserving" title=" privacy-preserving"> privacy-preserving</a>, <a href="https://publications.waset.org/abstracts/search?q=search" title=" search"> search</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/55834/on-privacy-preserving-search-in-the-encrypted-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55834.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">256</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">1766</span> A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mehran%20Kazemi">Seyed Mehran Kazemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Bahare%20Fatemi"> Bahare Fatemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sudoku is a logic-based combinatorial puzzle game which is popular among people of different ages. Due to this popularity, computer softwares are being developed to generate and solve Sudoku puzzles with different levels of difficulty. Several methods and algorithms have been proposed and used in different softwares to efficiently solve Sudoku puzzles. Various search methods such as stochastic local search have been applied to this problem. Genetic Algorithm (GA) is one of the algorithms which have been applied to this problem in different forms and in several works in the literature. In these works, chromosomes with little or no information were considered and obtained results were not promising. In this paper, we propose a new way of applying GA to this problem which uses more-informed chromosomes than other works in the literature. We optimize the parameters of our GA using puzzles with different levels of difficulty. Then we use the optimized values of the parameters to solve various puzzles and compare our results to another GA-based method for solving Sudoku puzzles. <p class="card-text"><strong>Keywords:</strong> <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=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=solving%20Sudoku%20puzzles" title=" solving Sudoku puzzles"> solving Sudoku puzzles</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20local%20search" title=" stochastic local search"> stochastic local search</a> </p> <a href="https://publications.waset.org/abstracts/8411/a-retrievable-genetic-algorithm-for-efficient-solving-of-sudoku-puzzles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8411.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">423</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1765</span> A Variable Neighborhood Search with Tabu Conditions for the Roaming Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Masoud%20Shahmanzari">Masoud Shahmanzari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to present a Variable Neighborhood Search (VNS) with Tabu Search (TS) conditions for the Roaming Salesman Problem (RSP). The RSP is a special case of the well-known traveling salesman problem (TSP) where a set of cities with time-dependent rewards and a set of campaign days are given. Each city can be visited on any day and a subset of cities can be visited multiple times. The goal is to determine an optimal campaign schedule consist of daily open/closed tours that visit some cities and maximizes the total net benefit while respecting daily maximum tour duration constraints and the necessity to return campaign base frequently. This problem arises in several real-life applications and particularly in election logistics where depots are not fixed. We formulate the problem as a mixed integer linear programming (MILP), in which we capture as many real-world aspects of the RSP as possible. We also present a hybrid metaheuristic algorithm based on a VNS with TS conditions. The initial feasible solution is constructed via a new matheuristc approach based on the decomposition of the original problem. Next, this solution is improved in terms of the collected rewards using the proposed local search procedure. We consider a set of 81 cities in Turkey and a campaign of 30 days as our largest instance. Computational results on real-world instances show that the developed algorithm could find near-optimal solutions effectively. <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=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=election%20logistics" title=" election logistics"> election logistics</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a> </p> <a href="https://publications.waset.org/abstracts/162992/a-variable-neighborhood-search-with-tabu-conditions-for-the-roaming-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162992.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">92</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">1764</span> Model Updating Based on Modal Parameters Using Hybrid Pattern Search Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Guo">N. Guo</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Xu"> C. Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Z.%20C.%20Yang"> Z. C. Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to ensure the high reliability of an aircraft, the accurate structural dynamics analysis has become an indispensable part in the design of an aircraft structure. Therefore, the structural finite element model which can be used to accurately calculate the structural dynamics and their transfer relations is the prerequisite in structural dynamic design. A dynamic finite element model updating method is presented to correct the uncertain parameters of the finite element model of a structure using measured modal parameters. The coordinate modal assurance criterion is used to evaluate the correlation level at each coordinate over the experimental and the analytical mode shapes. Then, the weighted summation of the natural frequency residual and the coordinate modal assurance criterion residual is used as the objective function. Moreover, the hybrid pattern search (HPS) optimization technique, which synthesizes the advantages of pattern search (PS) optimization technique and genetic algorithm (GA), is introduced to solve the dynamic FE model updating problem. A numerical simulation and a model updating experiment for GARTEUR aircraft model are performed to validate the feasibility and effectiveness of the present dynamic model updating method, respectively. The updated results show that the proposed method can be successfully used to modify the incorrect parameters with good robustness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=model%20updating" title="model updating">model updating</a>, <a href="https://publications.waset.org/abstracts/search?q=modal%20parameter" title=" modal parameter"> modal parameter</a>, <a href="https://publications.waset.org/abstracts/search?q=coordinate%20modal%20assurance%20criterion" title=" coordinate modal assurance criterion"> coordinate modal assurance criterion</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20genetic%2Fpattern%20search" title=" hybrid genetic/pattern search"> hybrid genetic/pattern search</a> </p> <a href="https://publications.waset.org/abstracts/98650/model-updating-based-on-modal-parameters-using-hybrid-pattern-search-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98650.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">161</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">1763</span> On Exploring Search Heuristics for improving the efficiency in Web Information Extraction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Patricia%20Jim%C3%A9nez">Patricia Jiménez</a>, <a href="https://publications.waset.org/abstracts/search?q=Rafael%20Corchuelo"> Rafael Corchuelo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays the World Wide Web is the most popular source of information that relies on billions of on-line documents. Web mining is used to crawl through these documents, collect the information of interest and process it by applying data mining tools in order to use the gathered information in the best interest of a business, what enables companies to promote theirs. Unfortunately, it is not easy to extract the information a web site provides automatically when it lacks an API that allows to transform the user-friendly data provided in web documents into a structured format that is machine-readable. Rule-based information extractors are the tools intended to extract the information of interest automatically and offer it in a structured format that allow mining tools to process it. However, the performance of an information extractor strongly depends on the search heuristic employed since bad choices regarding how to learn a rule may easily result in loss of effectiveness and/or efficiency. Improving search heuristics regarding efficiency is of uttermost importance in the field of Web Information Extraction since typical datasets are very large. In this paper, we employ an information extractor based on a classical top-down algorithm that uses the so-called Information Gain heuristic introduced by Quinlan and Cameron-Jones. Unfortunately, the Information Gain relies on some well-known problems so we analyse an intuitive alternative, Termini, that is clearly more efficient; we also analyse other proposals in the literature and conclude that none of them outperforms the previous alternative. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20extraction" title="information extraction">information extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20heuristics" title=" search heuristics"> search heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-structured%20documents" title=" semi-structured documents"> semi-structured documents</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20mining." title=" web mining. "> web mining. </a> </p> <a href="https://publications.waset.org/abstracts/25697/on-exploring-search-heuristics-for-improving-the-efficiency-in-web-information-extraction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25697.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">335</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">1762</span> Spectral Anomaly Detection and Clustering in Radiological Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20L.%20McCullough">Thomas L. McCullough</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20D.%20Hague"> John D. Hague</a>, <a href="https://publications.waset.org/abstracts/search?q=Marylesa%20M.%20Howard"> Marylesa M. Howard</a>, <a href="https://publications.waset.org/abstracts/search?q=Matthew%20K.%20Kiser"> Matthew K. Kiser</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20A.%20Mazur"> Michael A. Mazur</a>, <a href="https://publications.waset.org/abstracts/search?q=Lance%20K.%20McLean"> Lance K. McLean</a>, <a href="https://publications.waset.org/abstracts/search?q=Johanna%20L.%20Turk"> Johanna L. Turk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Radiological search and mapping depends on the successful recognition of anomalies in large data sets which contain varied and dynamic backgrounds. We present a new algorithmic approach for real-time anomaly detection which is resistant to common detector imperfections, avoids the limitations of a source template library and provides immediate, and easily interpretable, user feedback. This algorithm is based on a continuous wavelet transform for variance reduction and evaluates the deviation between a foreground measurement and a local background expectation using methods from linear algebra. We also present a technique for recognizing and visualizing spectrally similar clusters of data. This technique uses Laplacian Eigenmap Manifold Learning to perform dimensional reduction which preserves the geometric "closeness" of the data while maintaining sensitivity to outlying data. We illustrate the utility of both techniques on real-world data sets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=radiological%20search" title="radiological search">radiological search</a>, <a href="https://publications.waset.org/abstracts/search?q=radiological%20mapping" title=" radiological mapping"> radiological mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=radioactivity" title=" radioactivity"> radioactivity</a>, <a href="https://publications.waset.org/abstracts/search?q=radiation%20protection" title=" radiation protection"> radiation protection</a> </p> <a href="https://publications.waset.org/abstracts/29396/spectral-anomaly-detection-and-clustering-in-radiological-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29396.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">692</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">1761</span> Solving Process Planning, Weighted Earliest Due Date Scheduling and Weighted Due Date Assignment Using Simulated Annealing and Evolutionary Strategies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Hulusi%20Kokcam"> Abdullah Hulusi Kokcam</a>, <a href="https://publications.waset.org/abstracts/search?q=Fuat%20Simsir"> Fuat Simsir</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%96zer%20Uygun"> Özer Uygun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditionally, three important manufacturing functions which are process planning, scheduling and due-date assignment are performed sequentially and separately. Although there are numerous works on the integration of process planning and scheduling and plenty of works focusing on scheduling with due date assignment, there are only a few works on integrated process planning, scheduling and due-date assignment. Although due-dates are determined without taking into account of weights of the customers in the literature, here weighted due-date assignment is employed to get better performance. Jobs are scheduled according to weighted earliest due date dispatching rule and due dates are determined according to some popular due date assignment methods by taking into account of the weights of each job. Simulated Annealing, Evolutionary Strategies, Random Search, hybrid of Random Search and Simulated Annealing, and hybrid of Random Search and Evolutionary Strategies, are applied as solution techniques. Three important manufacturing functions are integrated step-by-step and higher integration levels are found better. Search meta-heuristics are found to be very useful while improving performance measure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20strategies" title=" evolutionary strategies"> evolutionary strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20searches" title=" hybrid searches"> hybrid searches</a> </p> <a href="https://publications.waset.org/abstracts/67706/solving-process-planning-weighted-earliest-due-date-scheduling-and-weighted-due-date-assignment-using-simulated-annealing-and-evolutionary-strategies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67706.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">462</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">1760</span> Formal Verification of Cache System Using a Novel Cache Memory Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guowei%20Hou">Guowei Hou</a>, <a href="https://publications.waset.org/abstracts/search?q=Lixin%20Yu"> Lixin Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei%20Zhuang"> Wei Zhuang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hui%20Qin"> Hui Qin</a>, <a href="https://publications.waset.org/abstracts/search?q=Xue%20Yang"> Xue Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Formal verification is proposed to ensure the correctness of the design and make functional verification more efficient. As cache plays a vital role in the design of System on Chip (SoC), and cache with Memory Management Unit (MMU) and cache memory unit makes the state space too large for simulation to verify, then a formal verification is presented for such system design. In the paper, a formal model checking verification flow is suggested and a new cache memory model which is called “exhaustive search model” is proposed. Instead of using large size ram to denote the whole cache memory, exhaustive search model employs just two cache blocks. For cache system contains data cache (Dcache) and instruction cache (Icache), Dcache memory model and Icache memory model are established separately using the same mechanism. At last, the novel model is employed to the verification of a cache which is module of a custom-built SoC system that has been applied in practical, and the result shows that the cache system is verified correctly using the exhaustive search model, and it makes the verification much more manageable and flexible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cache%20system" title="cache system">cache system</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/abstracts/search?q=novel%20model" title=" novel model"> novel model</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20on%20chip%20%28SoC%29" title=" system on chip (SoC)"> system on chip (SoC)</a> </p> <a href="https://publications.waset.org/abstracts/26581/formal-verification-of-cache-system-using-a-novel-cache-memory-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26581.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">496</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">1759</span> Loss Minimization by Distributed Generation Allocation in Radial Distribution System Using Crow Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Nageswara%20Rao">M. Nageswara Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20S.%20N.%20K.%20Chaitanya"> V. S. N. K. Chaitanya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Amarendranath"> K. Amarendranath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an optimal allocation and sizing of Distributed Generation (DG) in Radial Distribution Network (RDN) for total power loss minimization and enhances the voltage profile of the system. The two main important part of this study first is to find optimal allocation and second is optimum size of DG. The locations of DGs are identified by Analytical expressions and crow search algorithm has been employed to determine the optimum size of DG. In this study, the DG has been placed on single and multiple allocations.CSA is a meta-heuristic algorithm inspired by the intelligent behavior of the crows. Crows stores their excess food in different locations and memorizes those locations to retrieve it when it is needed. They follow each other to do thievery to obtain better food source. This analysis is tested on IEEE 33 bus and IEEE 69 bus under MATLAB environment and the results are compared with existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytical%20expression" title="analytical expression">analytical expression</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title=" distributed generation"> distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=crow%20search%20algorithm" title=" crow search algorithm"> crow search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20loss" title=" power loss"> power loss</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20profile" title=" voltage profile"> voltage profile</a> </p> <a href="https://publications.waset.org/abstracts/104210/loss-minimization-by-distributed-generation-allocation-in-radial-distribution-system-using-crow-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104210.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">235</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">1758</span> Metaheuristics to Solve Tasks Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Ziteuni">Rachid Ziteuni</a>, <a href="https://publications.waset.org/abstracts/search?q=Selt%20Omar"> Selt Omar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n tasks on m identical parallel machines with unavailability periods. This problem is NP-complete in the strong sens and finding an optimal solution appears unlikely. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote Pm/N-c/summs of (wjCj) is the weighted sum of the end dates of tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20identical%20machines" title=" parallel identical machines"> parallel identical machines</a>, <a href="https://publications.waset.org/abstracts/search?q=unavailability%20periods" title=" unavailability periods"> unavailability periods</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a> </p> <a href="https://publications.waset.org/abstracts/5635/metaheuristics-to-solve-tasks-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5635.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">331</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1757</span> Survey Paper on Graph Coloring Problem and Its Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prateek%20Chharia">Prateek Chharia</a>, <a href="https://publications.waset.org/abstracts/search?q=Biswa%20Bhusan%20Ghosh"> Biswa Bhusan Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph coloring is one of the prominent concepts in graph coloring. It can be defined as a coloring of the various regions of the graph such that all the constraints are fulfilled. In this paper various graphs coloring approaches like greedy coloring, Heuristic search for maximum independent set and graph coloring using edge table is described. Graph coloring can be used in various real time applications like student time tabling generation, Sudoku as a graph coloring problem, GSM phone network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20coloring" title="graph coloring">graph coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20coloring" title=" greedy coloring"> greedy coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20search" title=" heuristic search"> heuristic search</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20table" title=" edge table"> edge table</a>, <a href="https://publications.waset.org/abstracts/search?q=sudoku%20as%20a%20graph%20coloring%20problem" title=" sudoku as a graph coloring problem"> sudoku as a graph coloring problem</a> </p> <a href="https://publications.waset.org/abstracts/19691/survey-paper-on-graph-coloring-problem-and-its-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19691.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">539</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">1756</span> Search for Flavour Changing Neutral Current Couplings of Higgs-up Sector Quarks at Future Circular Collider (FCC-eh)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20Turk%20Cakir">I. Turk Cakir</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Hacisahinoglu"> B. Hacisahinoglu</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Kartal"> S. Kartal</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Yilmaz"> A. Yilmaz</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Yilmaz"> A. Yilmaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Z.%20Uysal"> Z. Uysal</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20Cakir"> O. Cakir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the search for new physics beyond the Standard Model, Flavour Changing Neutral Current (FCNC) is a good research field in terms of the observability at future colliders. Increased Higgs production with higher energy and luminosity in colliders is essential for verification or falsification of our knowledge of physics and predictions, and the search for new physics. Prospective electron-proton collider constituent of the Future Circular Collider project is FCC-eh. It offers great sensitivity due to its high luminosity and low interference. In this work, thq FCNC interaction vertex with off-shell top quark decay at electron-proton colliders is studied. By using MadGraph5_aMC@NLO multi-purpose event generator, observability of tuh and tch couplings are obtained with equal coupling scenario. Upper limit on branching ratio of tree level top quark FCNC decay is determined as 0.012% at FCC-eh with 1 ab ^−1 luminosity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FCC" title="FCC">FCC</a>, <a href="https://publications.waset.org/abstracts/search?q=FCNC" title=" FCNC"> FCNC</a>, <a href="https://publications.waset.org/abstracts/search?q=Higgs%20Boson" title=" Higgs Boson"> Higgs Boson</a>, <a href="https://publications.waset.org/abstracts/search?q=Top%20Quark" title=" Top Quark"> Top Quark</a> </p> <a href="https://publications.waset.org/abstracts/83207/search-for-flavour-changing-neutral-current-couplings-of-higgs-up-sector-quarks-at-future-circular-collider-fcc-eh" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83207.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">212</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1755</span> Evaluation of a Surrogate Based Method for Global Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=David%20Lindstr%C3%B6m">David Lindström</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We evaluate the performance of a numerical method for global optimization of expensive functions. The method is using a response surface to guide the search for the global optimum. This metamodel could be based on radial basis functions, kriging, or a combination of different models. We discuss how to set the cycling parameters of the optimization method to get a balance between local and global search. We also discuss the eventual problem with Runge oscillations in the response surface. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=expensive%20function" title="expensive function">expensive function</a>, <a href="https://publications.waset.org/abstracts/search?q=infill%20sampling%20criterion" title=" infill sampling criterion"> infill sampling criterion</a>, <a href="https://publications.waset.org/abstracts/search?q=kriging" title=" kriging"> kriging</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title=" global optimization"> global optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=response%20surface" title=" response surface"> response surface</a>, <a href="https://publications.waset.org/abstracts/search?q=Runge%20phenomenon" title=" Runge phenomenon"> Runge phenomenon</a> </p> <a href="https://publications.waset.org/abstracts/24538/evaluation-of-a-surrogate-based-method-for-global-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24538.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">578</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">1754</span> SC-LSH: An Efficient Indexing Method for Approximate Similarity Search in High Dimensional Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanaa%20Chafik">Sanaa Chafik</a>, <a href="https://publications.waset.org/abstracts/search?q=Imane%20Daoudi"> Imane Daoudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mounim%20A.%20El%20Yacoubi"> Mounim A. El Yacoubi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamid%20El%20Ouardi"> Hamid El Ouardi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Locality Sensitive Hashing (LSH) is one of the most promising techniques for solving nearest neighbour search problem in high dimensional space. Euclidean LSH is the most popular variation of LSH that has been successfully applied in many multimedia applications. However, the Euclidean LSH presents limitations that affect structure and query performances. The main limitation of the Euclidean LSH is the large memory consumption. In order to achieve a good accuracy, a large number of hash tables is required. In this paper, we propose a new hashing algorithm to overcome the storage space problem and improve query time, while keeping a good accuracy as similar to that achieved by the original Euclidean LSH. The Experimental results on a real large-scale dataset show that the proposed approach achieves good performances and consumes less memory than the Euclidean LSH. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20nearest%20neighbor%20search" title="approximate nearest neighbor search">approximate nearest neighbor search</a>, <a href="https://publications.waset.org/abstracts/search?q=content%20based%20image%20retrieval%20%28CBIR%29" title=" content based image retrieval (CBIR)"> content based image retrieval (CBIR)</a>, <a href="https://publications.waset.org/abstracts/search?q=curse%20of%20dimensionality" title=" curse of dimensionality"> curse of dimensionality</a>, <a href="https://publications.waset.org/abstracts/search?q=locality%20sensitive%20hashing" title=" locality sensitive hashing"> locality sensitive hashing</a>, <a href="https://publications.waset.org/abstracts/search?q=multidimensional%20indexing" title=" multidimensional indexing"> multidimensional indexing</a>, <a href="https://publications.waset.org/abstracts/search?q=scalability" title=" scalability"> scalability</a> </p> <a href="https://publications.waset.org/abstracts/12901/sc-lsh-an-efficient-indexing-method-for-approximate-similarity-search-in-high-dimensional-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12901.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">321</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">1753</span> A Coordinate-Based Heuristic Route Search Algorithm for Delivery Truck Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Tarek">Ahmed Tarek</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Alveed"> Ahmed Alveed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vehicle routing problem is a well-known re-search avenue in computing. Modern vehicle routing is more focused with the GPS-based coordinate system, as the state-of-the-art vehicle, and trucking systems are equipped with digital navigation. In this paper, a new two dimensional coordinate-based algorithm for addressing the vehicle routing problem for a supply chain network is proposed and explored, and the algorithm is compared with other available, and recently devised heuristics. For the algorithms discussed, which includes the pro-posed coordinate-based search heuristic as well, the advantages and the disadvantages associated with the heuristics are explored. The proposed algorithm is studied from the stand point of a small supermarket chain delivery network that supplies to its stores in four different states around the East Coast area, and is trying to optimize its trucking delivery cost. Minimizing the delivery cost for the supply network of a supermarket chain is important to ensure its business success. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coordinate-based%20optimal%20routing" title="coordinate-based optimal routing">coordinate-based optimal routing</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20Circuit" title=" Hamiltonian Circuit"> Hamiltonian Circuit</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithm" title=" heuristic algorithm"> heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title=" vehicle routing problem"> vehicle routing problem</a> </p> <a href="https://publications.waset.org/abstracts/136218/a-coordinate-based-heuristic-route-search-algorithm-for-delivery-truck-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136218.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">147</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1752</span> Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Caner%20Erden"> Caner Erden</a>, <a href="https://publications.waset.org/abstracts/search?q=Mumtaz%20Ipek"> Mumtaz Ipek</a>, <a href="https://publications.waset.org/abstracts/search?q=Ozer%20Uygun"> Ozer Uygun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of these three important functions are not adequately addressed. Here, the integration of these three important functions is studied by using genetic, random-genetic hybrid, simulated annealing, random-simulated annealing hybrid and random search techniques. As well, the importance of the integration of these three functions and the power of meta-heuristics and of hybrid heuristics are studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20search" title=" genetic search"> genetic search</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20meta-heuristics" title=" hybrid meta-heuristics"> hybrid meta-heuristics</a> </p> <a href="https://publications.waset.org/abstracts/57629/solving-weighted-number-of-operation-plus-processing-time-due-date-assignment-weighted-scheduling-and-process-planning-integration-problem-using-genetic-and-simulated-annealing-search-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57629.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">469</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">1751</span> Unified Coordinate System Approach for Swarm Search Algorithms in Global Information Deficit Environments</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rohit%20Dey">Rohit Dey</a>, <a href="https://publications.waset.org/abstracts/search?q=Sailendra%20Karra"> Sailendra Karra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims at solving the problem of multi-target searching in a Global Positioning System (GPS) denied environment using swarm robots with limited sensing and communication abilities. Typically, existing swarm-based search algorithms rely on the presence of a global coordinate system (vis-à-vis, GPS) that is shared by the entire swarm which, in turn, limits its application in a real-world scenario. This can be attributed to the fact that robots in a swarm need to share information among themselves regarding their location and signal from targets to decide their future course of action but this information is only meaningful when they all share the same coordinate frame. The paper addresses this very issue by eliminating any dependency of a search algorithm on the need of a predetermined global coordinate frame by the unification of the relative coordinate of individual robots when within the communication range, therefore, making the system more robust in real scenarios. Our algorithm assumes that all the robots in the swarm are equipped with range and bearing sensors and have limited sensing range and communication abilities. Initially, every robot maintains their relative coordinate frame and follow Levy walk random exploration until they come in range with other robots. When two or more robots are within communication range, they share sensor information and their location w.r.t. their coordinate frames based on which we unify their coordinate frames. Now they can share information about the areas that were already explored, information about the surroundings, and target signal from their location to make decisions about their future movement based on the search algorithm. During the process of exploration, there can be several small groups of robots having their own coordinate systems but eventually, it is expected for all the robots to be under one global coordinate frame where they can communicate information on the exploration area following swarm search techniques. Using the proposed method, swarm-based search algorithms can work in a real-world scenario without GPS and any initial information about the size and shape of the environment. Initial simulation results show that running our modified-Particle Swarm Optimization (PSO) without global information we can still achieve the desired results that are comparable to basic PSO working with GPS. In the full paper, we plan on doing the comparison study between different strategies to unify the coordinate system and to implement them on other bio-inspired algorithms, to work in GPS denied environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20search%20algorithms" title="bio-inspired search algorithms">bio-inspired search algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=decentralized%20control" title=" decentralized control"> decentralized control</a>, <a href="https://publications.waset.org/abstracts/search?q=GPS%20denied%20environment" title=" GPS denied environment"> GPS denied environment</a>, <a href="https://publications.waset.org/abstracts/search?q=swarm%20robotics" title=" swarm robotics"> swarm robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=target%20searching" title=" target searching"> target searching</a>, <a href="https://publications.waset.org/abstracts/search?q=unifying%20coordinate%20systems" title=" unifying coordinate systems"> unifying coordinate systems</a> </p> <a href="https://publications.waset.org/abstracts/128283/unified-coordinate-system-approach-for-swarm-search-algorithms-in-global-information-deficit-environments" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128283.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">137</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1750</span> Uplift Segmentation Approach for Targeting Customers in a Churn Prediction Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shivahari%20Revathi%20Venkateswaran">Shivahari Revathi Venkateswaran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Segmenting customers plays a significant role in churn prediction. It helps the marketing team with proactive and reactive customer retention. For the reactive retention, the retention team reaches out to customers who already showed intent to disconnect by giving some special offers. When coming to proactive retention, the marketing team uses churn prediction model, which ranks each customer from rank 1 to 100, where 1 being more risk to churn/disconnect (high ranks have high propensity to churn). The churn prediction model is built by using XGBoost model. However, with the churn rank, the marketing team can only reach out to the customers based on their individual ranks. To profile different groups of customers and to frame different marketing strategies for targeted groups of customers are not possible with the churn ranks. For this, the customers must be grouped in different segments based on their profiles, like demographics and other non-controllable attributes. This helps the marketing team to frame different offer groups for the targeted audience and prevent them from disconnecting (proactive retention). For segmentation, machine learning approaches like k-mean clustering will not form unique customer segments that have customers with same attributes. This paper finds an alternate approach to find all the combination of unique segments that can be formed from the user attributes and then finds the segments who have uplift (churn rate higher than the baseline churn rate). For this, search algorithms like fast search and recursive search are used. Further, for each segment, all customers can be targeted using individual churn ranks from the churn prediction model. Finally, a UI (User Interface) is developed for the marketing team to interactively search for the meaningful segments that are formed and target the right set of audience for future marketing campaigns and prevent them from disconnecting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=churn%20prediction%20modeling" title="churn prediction modeling">churn prediction modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=XGBoost%20model" title=" XGBoost model"> XGBoost model</a>, <a href="https://publications.waset.org/abstracts/search?q=uplift%20segments" title=" uplift segments"> uplift segments</a>, <a href="https://publications.waset.org/abstracts/search?q=proactive%20marketing" title=" proactive marketing"> proactive marketing</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20algorithms" title=" search algorithms"> search algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=retention" title=" retention"> retention</a>, <a href="https://publications.waset.org/abstracts/search?q=k-mean%20clustering" title=" k-mean clustering"> k-mean clustering</a> </p> <a href="https://publications.waset.org/abstracts/171364/uplift-segmentation-approach-for-targeting-customers-in-a-churn-prediction-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171364.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">71</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">1749</span> Modified Bat Algorithm for Economic Load Dispatch Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daljinder%20Singh">Daljinder Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=J.S.Dhillon"> J.S.Dhillon</a>, <a href="https://publications.waset.org/abstracts/search?q=Balraj%20Singh"> Balraj Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to no free lunch theorem, a single search technique cannot perform best in all conditions. Optimization method can be attractive choice to solve optimization problem that may have exclusive advantages like robust and reliable performance, global search capability, little information requirement, ease of implementation, parallelism, no requirement of differentiable and continuous objective function. In order to synergize between exploration and exploitation and to further enhance the performance of Bat algorithm, the paper proposed a modified bat algorithm that adds additional search procedure based on bat’s previous experience. The proposed algorithm is used for solving the economic load dispatch (ELD) problem. The practical constraint such valve-point loading along with power balance constraints and generator limit are undertaken. To take care of power demand constraint variable elimination method is exploited. The proposed algorithm is tested on various ELD problems. The results obtained show that the proposed algorithm is capable of performing better in majority of ELD problems considered and is at par with existing algorithms for some of problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bat%20algorithm" title="bat algorithm">bat algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20load%20dispatch" title=" economic load dispatch"> economic load dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=penalty%20method" title=" penalty method"> penalty method</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20elimination%20method" title=" variable elimination method"> variable elimination method</a> </p> <a href="https://publications.waset.org/abstracts/34397/modified-bat-algorithm-for-economic-load-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34397.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">459</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1748</span> Social Studies Teaching Methods: Approaches and Techniques in Teaching History in Primary Education</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tonguc%20Basaran">Tonguc Basaran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> History is a record of a people’s past based on a critical examination of documents and other facts. The essentials of this historical method are not beyond the grasp of even young children. Concrete examples, such as the story of the Rosetta stone, which enabled Champollion to establish the first principles of the deciphering of Egyptian hieroglyphics, vividly illustrate the fundamental processes involved. This search for the facts can be used to illustrate one side of the search for historic truth. The other side is the truth of historic interpretation. The facts cannot be changed, but the interpretation of them can and does change. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=history" title="history">history</a>, <a href="https://publications.waset.org/abstracts/search?q=primary%20education" title=" primary education"> primary education</a>, <a href="https://publications.waset.org/abstracts/search?q=teaching%20methods" title=" teaching methods"> teaching methods</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20studies" title=" social studies"> social studies</a> </p> <a href="https://publications.waset.org/abstracts/47371/social-studies-teaching-methods-approaches-and-techniques-in-teaching-history-in-primary-education" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47371.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">1747</span> Relativity in Toddlers' Understanding of the Physical World as Key to Misconceptions in the Science Classroom</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Hast">Michael Hast</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Within their first year, infants can differentiate between objects based on their weight. By at least 5 years children hold consistent weight-related misconceptions about the physical world, such as that heavy things fall faster than lighter ones because of their weight. Such misconceptions are seen as a challenge for science education since they are often highly resistant to change through instruction. Understanding the time point of emergence of such ideas could, therefore, be crucial for early science pedagogy. The paper thus discusses two studies that jointly address the issue by examining young children’s search behaviour in hidden displacement tasks under consideration of relative object weight. In both studies, they were tested with a heavy or a light ball, and they either had information about one of the balls only or both. In Study 1, 88 toddlers aged 2 to 3½ years watched a ball being dropped into a curved tube and were then allowed to search for the ball in three locations – one straight beneath the tube entrance, one where the curved tube lead to, and one that corresponded to neither of the previous outcomes. Success and failure at the task were not impacted by weight of the balls alone in any particular way. However, from around 3 years onwards, relative lightness, gained through having tactile experience of both balls beforehand, enhanced search success. Conversely, relative heaviness increased search errors such that children increasingly searched in the location immediately beneath the tube entry – known as the gravity bias. In Study 2, 60 toddlers aged 2, 2½ and 3 years watched a ball roll down a ramp and behind a screen with four doors, with a barrier placed along the ramp after one of four doors. Toddlers were allowed to open the doors to find the ball. While search accuracy generally increased with age, relative weight did not play a role in 2-year-olds’ search behaviour. Relative lightness improved 2½-year-olds’ searches. At 3 years, both relative lightness and relative heaviness had a significant impact, with the former improving search accuracy and the latter reducing it. Taken together, both studies suggest that between 2 and 3 years of age, relative object weight is increasingly taken into consideration in navigating naïve physical concepts. In particular, it appears to contribute to the early emergence of misconceptions relating to object weight. This insight from developmental psychology research may have consequences for early science education and related pedagogy towards early conceptual change. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conceptual%20development" title="conceptual development">conceptual development</a>, <a href="https://publications.waset.org/abstracts/search?q=early%20science%20education" title=" early science education"> early science education</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitive%20physics" title=" intuitive physics"> intuitive physics</a>, <a href="https://publications.waset.org/abstracts/search?q=misconceptions" title=" misconceptions"> misconceptions</a>, <a href="https://publications.waset.org/abstracts/search?q=object%20weight" title=" object weight"> object weight</a> </p> <a href="https://publications.waset.org/abstracts/83485/relativity-in-toddlers-understanding-of-the-physical-world-as-key-to-misconceptions-in-the-science-classroom" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83485.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">190</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">1746</span> Elemental Graph Data Model: A Semantic and Topological Representation of Building Elements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yasmeen%20A.%20S.%20Essawy">Yasmeen A. S. Essawy</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Nassar"> Khaled Nassar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the rapid increase of complexity in the building industry, professionals in the A/E/C industry were forced to adopt Building Information Modeling (BIM) in order to enhance the communication between the different project stakeholders throughout the project life cycle and create a semantic object-oriented building model that can support geometric-topological analysis of building elements during design and construction. This paper presents a model that extracts topological relationships and geometrical properties of building elements from an existing fully designed BIM, and maps this information into a directed acyclic Elemental Graph Data Model (EGDM). The model incorporates BIM-based search algorithms for automatic deduction of geometrical data and topological relationships for each building element type. Using graph search algorithms, such as Depth First Search (DFS) and topological sortings, all possible construction sequences can be generated and compared against production and construction rules to generate an optimized construction sequence and its associated schedule. The model is implemented in a C# platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=building%20information%20modeling%20%28BIM%29" title="building information modeling (BIM)">building information modeling (BIM)</a>, <a href="https://publications.waset.org/abstracts/search?q=elemental%20graph%20data%20model%20%28EGDM%29" title=" elemental graph data model (EGDM)"> elemental graph data model (EGDM)</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20and%20topological%20data%20models" title=" geometric and topological data models"> geometric and topological data models</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a> </p> <a href="https://publications.waset.org/abstracts/70542/elemental-graph-data-model-a-semantic-and-topological-representation-of-building-elements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70542.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">382</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">1745</span> An Optimized Approach to Generate the Possible States of Football Tournaments Final Table</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mouslem%20Damkhi">Mouslem Damkhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper focuses on possible states of a football tournament final table according to the number of participating teams. Each team holds a position in the table with which it is possible to determine the highest and lowest points for that team. This paper proposes an optimized search space based on the minimum and maximum number of points which can be gained by each team to produce and enumerate the possible states for a football tournament final table. The proposed search space minimizes producing the invalid states which cannot occur during a football tournament. The generated states are filtered by a validity checking algorithm which seeks to reach a tournament graph based on a generated state. Thus, the algorithm provides a way to determine which team’s wins, draws and loses values guarantee a particular table position. The paper also presents and discusses the experimental results of the approach on the tournaments with up to eight teams. Comparing with a blind search algorithm, our proposed approach reduces generating the invalid states up to 99.99%, which results in a considerable optimization in term of the execution time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorics" title="combinatorics">combinatorics</a>, <a href="https://publications.waset.org/abstracts/search?q=enumeration" title=" enumeration"> enumeration</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a>, <a href="https://publications.waset.org/abstracts/search?q=tournament" title=" tournament"> tournament</a> </p> <a href="https://publications.waset.org/abstracts/125649/an-optimized-approach-to-generate-the-possible-states-of-football-tournaments-final-table" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125649.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">122</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">1744</span> Intelligent Staff Scheduling: Optimizing the Solver with Tabu Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu-Ping%20Chiu">Yu-Ping Chiu</a>, <a href="https://publications.waset.org/abstracts/search?q=Dung-Ying%20Lin"> Dung-Ying Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditional staff scheduling methods, relying on employee experience, often lead to inefficiencies and resource waste. The challenges of transferring scheduling expertise and adapting to changing labor regulations further complicate this process. Manual approaches become increasingly impractical as companies accumulate complex scheduling rules over time. This study proposes an algorithmic optimization approach to address these issues, aiming to expedite scheduling while ensuring strict compliance with labor regulations and company policies. The method focuses on generating optimal schedules that minimize weighted company objectives within a compressed timeframe. Recognizing the limitations of conventional commercial software in modeling and solving complex real-world scheduling problems efficiently, this research employs Tabu Search with both long-term and short-term memory structures. The study will present numerical results and managerial insights to demonstrate the effectiveness of this approach in achieving intelligent and efficient staff scheduling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intelligent%20memory%20structures" title="intelligent memory structures">intelligent memory structures</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristics" title=" meta-heuristics"> meta-heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=staff%20scheduling%20problem" title=" staff scheduling problem"> staff scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a> </p> <a href="https://publications.waset.org/abstracts/191996/intelligent-staff-scheduling-optimizing-the-solver-with-tabu-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191996.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">23</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">1743</span> Pay Per Click Attribution: Effects on Direct Search Traffic and Purchases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Toni%20Raurich-Marcet">Toni Raurich-Marcet</a>, <a href="https://publications.waset.org/abstracts/search?q=Joan%20Llonch-Andreu"> Joan Llonch-Andreu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research is focused on the relationship between Search Engine Marketing (SEM) and traditional advertising. The dominant assumption is that SEM does not help brand awareness and only does it in session as if it were the cost of manufacturing the product being sold. The study is methodologically developed using an experiment where the effects were determined to analyze the billboard effect. The research allowed the cross-linking of theoretical and empirical knowledge on digital marketing. This paper has validated this marketing generates retention as traditional advertising would by measuring brand awareness and its improvements. This changes the way performance and brand campaigns are split within marketing departments, effectively rebalancing budgets moving forward. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attribution" title="attribution">attribution</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20marketing" title=" performance marketing"> performance marketing</a>, <a href="https://publications.waset.org/abstracts/search?q=SEM" title=" SEM"> SEM</a>, <a href="https://publications.waset.org/abstracts/search?q=marketplaces" title=" marketplaces"> marketplaces</a> </p> <a href="https://publications.waset.org/abstracts/147427/pay-per-click-attribution-effects-on-direct-search-traffic-and-purchases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147427.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">130</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">1742</span> Electroencephalography-Based Intention Recognition and Consensus Assessment during Emergency Response</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siyao%20Zhu">Siyao Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yifang%20Xu"> Yifang Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> After natural and man-made disasters, robots can bypass the danger, expedite the search, and acquire unprecedented situational awareness to design rescue plans. The hands-free requirement from the first responders excludes the use of tedious manual control and operation. In unknown, unstructured, and obstructed environments, natural-language-based supervision is not amenable for first responders to formulate, and is difficult for robots to understand. Brain-computer interface is a promising option to overcome the limitations. This study aims to test the feasibility of using electroencephalography (EEG) signals to decode human intentions and detect the level of consensus on robot-provided information. EEG signals were classified using machine-learning and deep-learning methods to discriminate search intentions and agreement perceptions. The results show that the average classification accuracy for intention recognition and consensus assessment is 67% and 72%, respectively, proving the potential of incorporating recognizable users’ bioelectrical responses into advanced robot-assisted systems for emergency response. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=consensus%20assessment" title="consensus assessment">consensus assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=electroencephalogram" title=" electroencephalogram"> electroencephalogram</a>, <a href="https://publications.waset.org/abstracts/search?q=emergency%20response" title=" emergency response"> emergency response</a>, <a href="https://publications.waset.org/abstracts/search?q=human-robot%20collaboration" title=" human-robot collaboration"> human-robot collaboration</a>, <a href="https://publications.waset.org/abstracts/search?q=intention%20recognition" title=" intention recognition"> intention recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20and%20rescue" title=" search and rescue"> search and rescue</a> </p> <a href="https://publications.waset.org/abstracts/151629/electroencephalography-based-intention-recognition-and-consensus-assessment-during-emergency-response" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151629.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">93</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">1741</span> The Bioequivalent: A Medical Drug Search Tool Based on a Collaborative Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rosa%20L.%20Figueroa">Rosa L. Figueroa</a>, <a href="https://publications.waset.org/abstracts/search?q=Joselyn%20A.%20Hern%C3%A1ndez"> Joselyn A. Hernández</a> </p> <p class="card-text"><strong>Abstract:</strong></p> During the last couple of years, the Ministry of Health have been developing new health policies in order to regulate and improve in benefit of the patient the pharmaceutical system in our country. However, there are still some deficiencies in how medicines have been accessed, distributed, and sold. Therefore, it is necessary to empower the patient by offering new instances to improve access to drug information. This work introduces ‘the bioequivalent’ a medical drug search tool created to increase both diffusion and getting information about the therapeutic equivalence of medicines for the patient. The development of the search tool started with a study on the availability of sources of drug information accessible to the patient where advantages and disadvantages were analyzed. The information obtained was used to feed the functional design of the new tool. The design of the new tool shows an external interface that includes a header, body, sidebar and footer. The header has a menu containing ‘Home,’ ‘Who we are,’ and ‘Mission and vision.’ The Body contains the medical drug search tool, and the Sidebar is for the user logging in. It could be anonym, registered user, as well as, administrator. Anonym user could only use the tool. Registered users could add some information on existing medicines in the database; however, adding information will be restricted and limited to specific items and subject to administrator approval because the information added must be endorsed by the Chilean Public Health Institute. On the other hand, the administrator will have all the privileges, including creating or deleting drugs or information about them. The Bioequivalent was tested on different mobile devices, and no fails have been found. Moreover, a small survey was answered by ten people who tested the tool, and all of them agree that the tool was useful to get information about bioequivalent drugs, and they would recommend the tool to others. Nevertheless, an 80% of people who tested the tool says it was easy to use, and a 70% indicates that additional help is not required. These results are evidence that ‘the Bioequivalent’ may contribute to the knowledge about the therapeutic bioequivalence and bioequivalent drugs existing in Chile. As future work, the tool will be developed to make it available to the public for a first testing stage in a more massive scenario. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=collaborative%20database" title="collaborative database">collaborative database</a>, <a href="https://publications.waset.org/abstracts/search?q=bioequivalent%20drugs" title=" bioequivalent drugs"> bioequivalent drugs</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20tool" title=" search tool"> search tool</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20platform" title=" web platform"> web platform</a> </p> <a href="https://publications.waset.org/abstracts/71706/the-bioequivalent-a-medical-drug-search-tool-based-on-a-collaborative-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71706.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">232</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">1740</span> The Impact of Sign Language on Generating and Maintaining a Mental Image</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yi-Shiuan%20Chiu">Yi-Shiuan Chiu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Deaf signers have been found to have better mental image performance than hearing nonsigners. The goal of this study was to investigate the ability to generate mental images, to maintain them, and to manipulate them in deaf signers of Taiwanese Sign Language (TSL). In the visual image task, participants first memorized digits formed in a cell of 4 × 5 grids. After presenting a cue of Chinese digit character shown on the top of a blank cell, participants had to form a corresponding digit. When showing a probe, which was a grid containing a red circle, participants had to decide as quickly as possible whether the probe would have been covered by the mental image of the digit. The ISI (interstimulus interval) between cue and probe was manipulated. In experiment 1, 24 deaf signers and 24 hearing nonsigners were asked to perform image generation tasks (ISI: 200, 400 ms) and image maintenance tasks (ISI: 800, 2000 ms). The results showed that deaf signers had had an enhanced ability to generate and maintain a mental image. To explore the process of mental image, in experiment 2, 30 deaf signers and 30 hearing nonsigners were asked to do visual searching when maintaining a mental image. Between a digit image cue and a red circle probe, participants were asked to search a visual search task to see if a target triangle apex was directed to the right or left. When there was only one triangle in the searching task, the results showed that both deaf signers and hearing non-signers had similar visual searching performance in which the searching targets in the mental image locations got facilitates. However, deaf signers could maintain better and faster mental image performance than nonsigners. In experiment 3, we increased the number of triangles to 4 to raise the difficulty of the visual search task. The results showed that deaf participants performed more accurately in visual search and image maintenance tasks. The results suggested that people may use eye movements as a mnemonic strategy to maintain the mental image. And deaf signers had enhanced abilities to resist the interference of eye movements in the situation of fewer distractors. In sum, these findings suggested that deaf signers had enhanced mental image processing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deaf%20signers" title="deaf signers">deaf signers</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20maintain" title=" image maintain"> image maintain</a>, <a href="https://publications.waset.org/abstracts/search?q=mental%20image" title=" mental image"> mental image</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20search" title=" visual search"> visual search</a> </p> <a href="https://publications.waset.org/abstracts/104952/the-impact-of-sign-language-on-generating-and-maintaining-a-mental-image" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104952.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">154</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=4" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=4">4</a></li> <li class="page-item active"><span class="page-link">5</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%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=cuckoo%20search&page=62">62</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=63">63</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cuckoo%20search&page=6" 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>