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: heuristic search</title> <meta name="description" content="Search results for: heuristic search"> <meta name="keywords" content="heuristic 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="heuristic 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="heuristic 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> 2068</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: heuristic search</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1828</span> K-Means Based Matching Algorithm for Multi-Resolution Feature Descriptors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shao-Tzu%20Huang">Shao-Tzu Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen-Chien%20Hsu"> Chen-Chien Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei-Yen%20Wang"> Wei-Yen Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Matching high dimensional features between images is computationally expensive for exhaustive search approaches in computer vision. Although the dimension of the feature can be degraded by simplifying the prior knowledge of homography, matching accuracy may degrade as a tradeoff. In this paper, we present a feature matching method based on k-means algorithm that reduces the matching cost and matches the features between images instead of using a simplified geometric assumption. Experimental results show that the proposed method outperforms the previous linear exhaustive search approaches in terms of the inlier ratio of matched pairs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=feature%20matching" title="feature matching">feature matching</a>, <a href="https://publications.waset.org/abstracts/search?q=k-means%20clustering" title=" k-means clustering"> k-means clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=SIFT" title=" SIFT"> SIFT</a>, <a href="https://publications.waset.org/abstracts/search?q=RANSAC" title=" RANSAC"> RANSAC</a> </p> <a href="https://publications.waset.org/abstracts/73493/k-means-based-matching-algorithm-for-multi-resolution-feature-descriptors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73493.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">357</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">1827</span> Short-Term Load Forecasting Based on Variational Mode Decomposition and Least Square Support Vector Machine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiangyong%20Liu">Jiangyong Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiangxiang%20Xu"> Xiangxiang Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Bote%20Luo"> Bote Luo</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoxue%20Luo"> Xiaoxue Luo</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiang%20Zhu"> Jiang Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lingzhi%20Yi"> Lingzhi Yi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To address the problems of non-linearity and high randomness of the original power load sequence causing the degradation of power load forecasting accuracy, a short-term load forecasting method is proposed. The method is based on the Least Square Support Vector Machine optimized by an Improved Sparrow Search Algorithm combined with the Variational Mode Decomposition proposed in this paper. The application of the variational mode decomposition technique decomposes the raw power load data into a series of Intrinsic Mode Functions components, which can reduce the complexity and instability of the raw data while overcoming modal confounding; the proposed improved sparrow search algorithm can solve the problem of difficult selection of learning parameters in the least Square Support Vector Machine. Finally, through comparison experiments, the results show that the method can effectively improve prediction accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load%20forecasting" title="load forecasting">load forecasting</a>, <a href="https://publications.waset.org/abstracts/search?q=variational%20mode%20decomposition" title=" variational mode decomposition"> variational mode decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=improved%20sparrow%20search%20algorithm" title=" improved sparrow search algorithm"> improved sparrow search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20square%20support%20vector%20machine" title=" least square support vector machine"> least square support vector machine</a> </p> <a href="https://publications.waset.org/abstracts/170283/short-term-load-forecasting-based-on-variational-mode-decomposition-and-least-square-support-vector-machine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/170283.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">107</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">1826</span> A Framework of Product Information Service System Using Mobile Image Retrieval and Text Mining Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mei-Yi%20Wu">Mei-Yi Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shang-Ming%20Huang"> Shang-Ming Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The online shoppers nowadays often search the product information on the Internet using some keywords of products. To use this kind of information searching model, shoppers should have a preliminary understanding about their interesting products and choose the correct keywords. However, if the products are first contact (for example, the worn clothes or backpack of passengers which you do not have any idea about the brands), these products cannot be retrieved due to insufficient information. In this paper, we discuss and study the applications in E-commerce using image retrieval and text mining techniques. We design a reasonable E-commerce application system containing three layers in the architecture to provide users product information. The system can automatically search and retrieval similar images and corresponding web pages on Internet according to the target pictures which taken by users. Then text mining techniques are applied to extract important keywords from these retrieval web pages and search the prices on different online shopping stores with these keywords using a web crawler. Finally, the users can obtain the product information including photos and prices of their favorite products. The experiments shows the efficiency of proposed system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20image%20retrieval" title="mobile image retrieval">mobile image retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20mining" title=" text mining"> text mining</a>, <a href="https://publications.waset.org/abstracts/search?q=product%20information%20service%20system" title=" product information service system"> product information service system</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20marketing" title=" online marketing"> online marketing</a> </p> <a href="https://publications.waset.org/abstracts/33483/a-framework-of-product-information-service-system-using-mobile-image-retrieval-and-text-mining-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33483.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">359</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">1825</span> Out of Order: The Rise of Stop and Search in Civil Orders Legislation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jodie%20Bradshaw">Jodie Bradshaw</a>, <a href="https://publications.waset.org/abstracts/search?q=Rebecca%20Dooley"> Rebecca Dooley</a>, <a href="https://publications.waset.org/abstracts/search?q=Habib%20Kadiri"> Habib Kadiri</a>, <a href="https://publications.waset.org/abstracts/search?q=Holly%20Bird"> Holly Bird</a>, <a href="https://publications.waset.org/abstracts/search?q=Aaliyah%20Felix-West"> Aaliyah Felix-West</a>, <a href="https://publications.waset.org/abstracts/search?q=Udit%20Mahalingam"> Udit Mahalingam</a>, <a href="https://publications.waset.org/abstracts/search?q=Ella%20Thomson"> Ella Thomson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The sharp rise of civil orders has led to an expansion of police powers, particularly in the realm of stop and search activities. The broad scope and objectives of these civil orders –addressing issues as varied as public safety, crime prevention, and counter-terrorism – has led to ‘mission-creep’, whereby orders were being imposed in a wider range of contexts than initially intended. The ever-widening purview of civil orders in practice necessitates proactive measures by law enforcement which often rely heavily on the utilisation of stop and search, leading to an expansion of stop and search practices and the regulation of public space. Civil liberties organisations, criminal justice and legal practitioners, activist groups, and researchers have argued that civil orders dilute and undermine foundational legal principles, pose a threat to our basic rights and freedoms, facilitate dangerous criminal justice net-widening, and disproportionately target young, working-class people of colour. Many of the provisions in these orders are potentially incompatible with the right to liberty and security. The conditions of an order (whether negative restrictions or positive obligations) tend to be extremely easy to breach –and in some cases, almost impossible for the person subject to the order not to breach. When the conditions of an order are breached, the result is criminal punishment – often in the form of imprisonment. This paper argues that civil orders set people up to fail, sending them down a path towards incarceration and the ultimate deprivation of liberty. The proclaimed intentions underpinning these civil orders – to tackle purportedly ‘undesirable’ behaviour (which in and of itself is not a crime) committed by ‘undesirable’ people – paves the way for justifying violent and racially disproportionate policing practices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=civil%20orders" title="civil orders">civil orders</a>, <a href="https://publications.waset.org/abstracts/search?q=policing" title=" policing"> policing</a>, <a href="https://publications.waset.org/abstracts/search?q=stop%20and%20search" title=" stop and search"> stop and search</a>, <a href="https://publications.waset.org/abstracts/search?q=crime" title=" crime"> crime</a>, <a href="https://publications.waset.org/abstracts/search?q=civil%20liberties" title=" civil liberties"> civil liberties</a>, <a href="https://publications.waset.org/abstracts/search?q=criminal%20punishment" title=" criminal punishment"> criminal punishment</a>, <a href="https://publications.waset.org/abstracts/search?q=anti-social%20behaviour" title=" anti-social behaviour"> anti-social behaviour</a> </p> <a href="https://publications.waset.org/abstracts/194429/out-of-order-the-rise-of-stop-and-search-in-civil-orders-legislation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194429.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">2</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">1824</span> Design of Microwave Building Block by Using Numerical Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Haifeng%20Zhou">Haifeng Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Tsungyang%20Liow"> Tsungyang Liow</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoguang%20Tu"> Xiaoguang Tu</a>, <a href="https://publications.waset.org/abstracts/search?q=Eujin%20Lim"> Eujin Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Chao%20Li"> Chao Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Junfeng%20Song"> Junfeng Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Xianshu%20Luo"> Xianshu Luo</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Huang"> Ying Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Lianxi%20Jia"> Lianxi Jia</a>, <a href="https://publications.waset.org/abstracts/search?q=Lianwee%20Luo"> Lianwee Luo</a>, <a href="https://publications.waset.org/abstracts/search?q=Qing%20Fang"> Qing Fang</a>, <a href="https://publications.waset.org/abstracts/search?q=Mingbin%20Yu"> Mingbin Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Guoqiang%20Lo"> Guoqiang Lo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the development of technology, countries gradually allocated more and more frequency spectrums for civilization and commercial usage, especially those high radio frequency bands indicating high information capacity. The field effect becomes more and more prominent in microwave components as frequency increases, which invalidates the transmission line theory and complicate the design of microwave components. Here a modeling approach based on numerical search algorithm is proposed to design various building blocks for microwave circuits to avoid complicated impedance matching and equivalent electrical circuit approximation. Concretely, a microwave component is discretized to a set of segments along the microwave propagation path. Each of the segment is initialized with random dimensions, which constructs a multiple-dimension parameter space. Then numerical searching algorithms (e.g. Pattern search algorithm) are used to find out the ideal geometrical parameters. The optimal parameter set is achieved by evaluating the fitness of S parameters after a number of iterations. We had adopted this approach in our current projects and designed many microwave components including sharp bends, T-branches, Y-branches, microstrip-to-stripline converters and etc. For example, a stripline 90° bend was designed in 2.54 mm x 2.54 mm space for dual-band operation (Ka band and Ku band) with < 0.18 dB insertion loss and < -55 dB reflection. We expect that this approach can enrich the tool kits for microwave designers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microwave%20component" title="microwave component">microwave component</a>, <a href="https://publications.waset.org/abstracts/search?q=microstrip%20and%20stripline" title=" microstrip and stripline"> microstrip and stripline</a>, <a href="https://publications.waset.org/abstracts/search?q=bend" title=" bend"> bend</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20division" title=" power division"> power division</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20numerical%20search%20algorithm." title=" the numerical search algorithm."> the numerical search algorithm.</a> </p> <a href="https://publications.waset.org/abstracts/37516/design-of-microwave-building-block-by-using-numerical-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37516.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">379</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">1823</span> The Dangers of Attentional Inertia in the Driving Task</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Catherine%20Thompson">Catherine Thompson</a>, <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Jalali"> Maryam Jalali</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Hills"> Peter Hills</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The allocation of visual attention is critical when driving and anything that limits attention will have a detrimental impact on safety. Engaging in a secondary task reduces the amount of attention directed to the road because drivers allocate resources towards this task, leaving fewer resources to process driving-relevant information. Yet the dangers associated with a secondary task do not end when the driver returns their attention to the road. Instead, the attentional settings adopted to complete a secondary task may persist to the road, affecting attention, and therefore affecting driver performance. This 'attentional inertia' effect was investigated in the current work. Forty drivers searched for hazards in driving video clips while their eye-movements were recorded. At varying intervals they were instructed to attend to a secondary task displayed on a tablet situated to their left-hand side. The secondary task consisted of three separate computer games that induced horizontal, vertical, and random eye movements. Visual search and hazard detection in the driving clips were compared across the three conditions of the secondary task. Results showed that the layout of information in the secondary task, and therefore the allocation of attention in this task, had an impact on subsequent search in the driving clips. Vertically presented information reduced the wide horizontal spread of search usually associated with accurate driving and had a negative influence on the detection of hazards. The findings show the additional dangers of engaging in a secondary task while driving. The attentional inertia effect has significant implications for semi-autonomous and autonomous vehicles in which drivers have greater opportunity to direct their attention away from the driving task. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attention" title="attention">attention</a>, <a href="https://publications.waset.org/abstracts/search?q=eye-movements" title=" eye-movements"> eye-movements</a>, <a href="https://publications.waset.org/abstracts/search?q=hazard%20perception" title=" hazard perception"> hazard perception</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/98055/the-dangers-of-attentional-inertia-in-the-driving-task" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98055.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">164</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">1822</span> Pareto System of Optimal Placement and Sizing of Distributed Generation in Radial Distribution Networks Using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sani%20M.%20Lawal">Sani M. Lawal</a>, <a href="https://publications.waset.org/abstracts/search?q=Idris%20Musa"> Idris Musa</a>, <a href="https://publications.waset.org/abstracts/search?q=Aliyu%20D.%20Usman"> Aliyu D. Usman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Pareto approach of optimal solutions in a search space that evolved in multi-objective optimization problems is adopted in this paper, which stands for a set of solutions in the search space. This paper aims at presenting an optimal placement of Distributed Generation (DG) in radial distribution networks with an optimal size for minimization of power loss and voltage deviation as well as maximizing voltage profile of the networks. And these problems are formulated using particle swarm optimization (PSO) as a constraint nonlinear optimization problem with both locations and sizes of DG being continuous. The objective functions adopted are the total active power loss function and voltage deviation function. The multiple nature of the problem, made it necessary to form a multi-objective function in search of the solution that consists of both the DG location and size. The proposed PSO algorithm is used to determine optimal placement and size of DG in a distribution network. The output indicates that PSO algorithm technique shows an edge over other types of search methods due to its effectiveness and computational efficiency. The proposed method is tested on the standard IEEE 34-bus and validated with 33-bus test systems distribution networks. Results indicate that the sizing and location of DG are system dependent and should be optimally selected before installing the distributed generators in the system and also an improvement in the voltage profile and power loss reduction have been achieved. <p class="card-text"><strong>Keywords:</strong> <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=pareto" title=" pareto"> pareto</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20loss" title=" power loss"> power loss</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20deviation" title=" voltage deviation"> voltage deviation</a> </p> <a href="https://publications.waset.org/abstracts/54635/pareto-system-of-optimal-placement-and-sizing-of-distributed-generation-in-radial-distribution-networks-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54635.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">364</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1821</span> A Feature Clustering-Based Sequential Selection Approach for Color Texture Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Alimoussa">Mohamed Alimoussa</a>, <a href="https://publications.waset.org/abstracts/search?q=Alice%20Porebski"> Alice Porebski</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicolas%20Vandenbroucke"> Nicolas Vandenbroucke</a>, <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Oulad%20Haj%20Thami"> Rachid Oulad Haj Thami</a>, <a href="https://publications.waset.org/abstracts/search?q=Sana%20El%20Fkihi"> Sana El Fkihi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Color and texture are highly discriminant visual cues that provide an essential information in many types of images. Color texture representation and classification is therefore one of the most challenging problems in computer vision and image processing applications. Color textures can be represented in different color spaces by using multiple image descriptors which generate a high dimensional set of texture features. In order to reduce the dimensionality of the feature set, feature selection techniques can be used. The goal of feature selection is to find a relevant subset from an original feature space that can improve the accuracy and efficiency of a classification algorithm. Traditionally, feature selection is focused on removing irrelevant features, neglecting the possible redundancy between relevant ones. This is why some feature selection approaches prefer to use feature clustering analysis to aid and guide the search. These techniques can be divided into two categories. i) Feature clustering-based ranking algorithm uses feature clustering as an analysis that comes before feature ranking. Indeed, after dividing the feature set into groups, these approaches perform a feature ranking in order to select the most discriminant feature of each group. ii) Feature clustering-based subset search algorithms can use feature clustering following one of three strategies; as an initial step that comes before the search, binded and combined with the search or as the search alternative and replacement. In this paper, we propose a new feature clustering-based sequential selection approach for the purpose of color texture representation and classification. Our approach is a three step algorithm. First, irrelevant features are removed from the feature set thanks to a class-correlation measure. Then, introducing a new automatic feature clustering algorithm, the feature set is divided into several feature clusters. Finally, a sequential search algorithm, based on a filter model and a separability measure, builds a relevant and non redundant feature subset: at each step, a feature is selected and features of the same cluster are removed and thus not considered thereafter. This allows to significantly speed up the selection process since large number of redundant features are eliminated at each step. The proposed algorithm uses the clustering algorithm binded and combined with the search. Experiments using a combination of two well known texture descriptors, namely Haralick features extracted from Reduced Size Chromatic Co-occurence Matrices (RSCCMs) and features extracted from Local Binary patterns (LBP) image histograms, on five color texture data sets, Outex, NewBarktex, Parquet, Stex and USPtex demonstrate the efficiency of our method compared to seven of the state of the art methods in terms of accuracy and computation time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=feature%20selection" title="feature selection">feature selection</a>, <a href="https://publications.waset.org/abstracts/search?q=color%20texture%20classification" title=" color texture classification"> color texture classification</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20clustering" title=" feature clustering"> feature clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=color%20LBP" title=" color LBP"> color LBP</a>, <a href="https://publications.waset.org/abstracts/search?q=chromatic%20cooccurrence%20matrix" title=" chromatic cooccurrence matrix"> chromatic cooccurrence matrix</a> </p> <a href="https://publications.waset.org/abstracts/128745/a-feature-clustering-based-sequential-selection-approach-for-color-texture-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128745.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">136</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1820</span> Enumerative Search for Crane Schedule in Anodizing Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kanate%20Pantusavase">Kanate Pantusavase</a>, <a href="https://publications.waset.org/abstracts/search?q=Jaramporn%20Hassamontr"> Jaramporn Hassamontr</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research aims to develop an algorithm to generate a schedule of multiple cranes that will maximize load throughputs in anodizing operation. The algorithm proposed utilizes an enumerative strategy to search for constant time between successive loads and crane covering range over baths. The computer program developed is able to generate a near-optimal crane schedule within reasonable times, i.e. within 10 minutes. Its results are compared with existing solutions from an aluminum extrusion industry. The program can be used to generate crane schedules for mixed products, thus allowing mixed-model line balancing to improve overall cycle times. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=crane%20scheduling" title="crane scheduling">crane scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=anodizing%20operations" title=" anodizing operations"> anodizing operations</a>, <a href="https://publications.waset.org/abstracts/search?q=cycle%20time%20minimization" title=" cycle time minimization"> cycle time minimization</a> </p> <a href="https://publications.waset.org/abstracts/27130/enumerative-search-for-crane-schedule-in-anodizing-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27130.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">464</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">1819</span> Optimal Emergency Shipment Policy for a Single-Echelon Periodic Review Inventory System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saeed%20Poormoaied">Saeed Poormoaied</a>, <a href="https://publications.waset.org/abstracts/search?q=Zumbul%20Atan"> Zumbul Atan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Emergency shipments provide a powerful mechanism to alleviate the risk of imminent stock-outs and can result in substantial benefits in an inventory system. Customer satisfaction and high service level are immediate consequences of utilizing emergency shipments. In this paper, we consider a single-echelon periodic review inventory system consisting of a single local warehouse, being replenished from a central warehouse with ample capacity in an infinite horizon setting. Since the structure of the optimal policy appears to be complicated, we analyze this problem under an order-up-to-S inventory control policy framework, the (S, T) policy, with the emergency shipment consideration. In each period of the periodic review policy, there is a single opportunity at any point of time for the emergency shipment so that in case of stock-outs, an emergency shipment is requested. The goal is to determine the timing and amount of the emergency shipment during a period (emergency shipment policy) as well as the base stock periodic review policy parameters (replenishment policy). We show that how taking advantage of having an emergency shipment during periods improves the performance of the classical (S, T) policy, especially when fixed and unit emergency shipment costs are small. Investigating the structure of the objective function, we develop an exact algorithm for finding the optimal solution. We also provide a heuristic and an approximation algorithm for the periodic review inventory system problem. The experimental analyses indicate that the heuristic algorithm is computationally more efficient than the approximation algorithm, but in terms of the solution efficiency, the approximation algorithm performs very well. We achieve up to 13% cost savings in the (S, T) policy if we apply the proposed emergency shipment policy. Moreover, our computational results reveal that the approximated solution is often within 0.21% of the globally optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=emergency%20shipment" title="emergency shipment">emergency shipment</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory" title=" inventory"> inventory</a>, <a href="https://publications.waset.org/abstracts/search?q=periodic%20review%20policy" title=" periodic review policy"> periodic review policy</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation%20algorithm." title=" approximation algorithm."> approximation algorithm.</a> </p> <a href="https://publications.waset.org/abstracts/105991/optimal-emergency-shipment-policy-for-a-single-echelon-periodic-review-inventory-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105991.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">141</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">1818</span> Optimal Voltage and Frequency Control of a Microgrid Using the Harmony Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Abbasi">Hossein Abbasi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The stability is an important topic to plan and manage the energy in the microgrids as the same as the conventional power systems. The voltage and frequency stability is one of the most important issues recently studied in microgrids. The objectives of this paper are the modelling and designing of the components and optimal controllers for the voltage and frequency control of the AC/DC hybrid microgrid under the different disturbances. Since the PI controllers have the advantages of simple structure and easy implementation, so they are designed and modeled in this paper. The harmony search (HS) algorithm is used to optimize the controllers’ parameters. According to the achieved results, the PI controllers have a good performance in voltage and frequency control of the microgrid. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20control" title="frequency control">frequency control</a>, <a href="https://publications.waset.org/abstracts/search?q=HS%20algorithm" title=" HS algorithm"> HS algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=microgrid" title=" microgrid"> microgrid</a>, <a href="https://publications.waset.org/abstracts/search?q=PI%20controller" title=" PI controller"> PI controller</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20control" title=" voltage control"> voltage control</a> </p> <a href="https://publications.waset.org/abstracts/42762/optimal-voltage-and-frequency-control-of-a-microgrid-using-the-harmony-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42762.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">391</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1817</span> Algorithms for Fast Computation of Pan Matrix Profiles of Time Series Under Unnormalized Euclidean Distances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Zhang">Jing Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Nikovski"> Daniel Nikovski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an approximation algorithm called LINKUMP to compute the Pan Matrix Profile (PMP) under the unnormalized l∞ distance (useful for value-based similarity search) using double-ended queue and linear interpolation. The algorithm has comparable time/space complexities as the state-of-the-art algorithm for typical PMP computation under the normalized l₂ distance (useful for shape-based similarity search). We validate its efficiency and effectiveness through extensive numerical experiments and a real-world anomaly detection application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pan%20matrix%20profile" title="pan matrix profile">pan matrix profile</a>, <a href="https://publications.waset.org/abstracts/search?q=unnormalized%20euclidean%20distance" title=" unnormalized euclidean distance"> unnormalized euclidean distance</a>, <a href="https://publications.waset.org/abstracts/search?q=double-ended%20queue" title=" double-ended queue"> double-ended queue</a>, <a href="https://publications.waset.org/abstracts/search?q=discord%20discovery" title=" discord discovery"> discord discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title=" anomaly detection"> anomaly detection</a> </p> <a href="https://publications.waset.org/abstracts/144363/algorithms-for-fast-computation-of-pan-matrix-profiles-of-time-series-under-unnormalized-euclidean-distances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144363.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">247</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">1816</span> ACO-TS: an ACO-based Algorithm for Optimizing Cloud Task Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fahad%20Y.%20Al-dawish">Fahad Y. Al-dawish</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The current trend by a large number of organizations and individuals to use cloud computing. Many consider it a significant shift in the field of computing. Cloud computing are distributed and parallel systems consisting of a collection of interconnected physical and virtual machines. With increasing request and profit of cloud computing infrastructure, diverse computing processes can be executed on cloud environment. Many organizations and individuals around the world depend on the cloud computing environments infrastructure to carry their applications, platform, and infrastructure. One of the major and essential issues in this environment related to allocating incoming tasks to suitable virtual machine (cloud task scheduling). Cloud task scheduling is classified as optimization problem, and there are several meta-heuristic algorithms have been anticipated to solve and optimize this problem. Good task scheduler should execute its scheduling technique on altering environment and the types of incoming task set. In this research project a cloud task scheduling methodology based on ant colony optimization ACO algorithm, we call it ACO-TS Ant Colony Optimization for Task Scheduling has been proposed and compared with different scheduling algorithms (Random, First Come First Serve FCFS, and Fastest Processor to the Largest Task First FPLTF). Ant Colony Optimization (ACO) is random optimization search method that will be used for assigning incoming tasks to available virtual machines VMs. The main role of proposed algorithm is to minimizing the makespan of certain tasks set and maximizing resource utilization by balance the load among virtual machines. The proposed scheduling algorithm was evaluated by using Cloudsim toolkit framework. Finally after analyzing and evaluating the performance of experimental results we find that the proposed algorithm ACO-TS perform better than Random, FCFS, and FPLTF algorithms in each of the makespaan and resource utilization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20Task%20scheduling" title="cloud Task scheduling">cloud Task scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization%20%28ACO%29" title=" ant colony optimization (ACO)"> ant colony optimization (ACO)</a>, <a href="https://publications.waset.org/abstracts/search?q=cloudsim" title=" cloudsim"> cloudsim</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a> </p> <a href="https://publications.waset.org/abstracts/32867/aco-ts-an-aco-based-algorithm-for-optimizing-cloud-task-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32867.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">420</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">1815</span> Lesson of Moral Teaching of the Sokoto Caliphate in the Quest for Genuine National Development in Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Murtala%20Marafa">Murtala Marafa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It’s been 50 years now since we began the desperate search for a genuine all round development as a nation. Painfully though, like a wild goose chase, the search for that promised land had remain elusive. In this piece, recourse is made to the sound administrative qualities of the 19th century Sokoto Caliphate leaders. It enabled them to administer the vast entity on the basis of mutual peace and justice. It also guaranteed a just political order built on a sound and viable economy. The paper is of the view that if the Nigerian society can allow for a replication of such moral virtues as exemplified by the founding fathers of the Caliphate, Nigeria could transform into a politically coherent and economically viable nation aspired by all. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=administration" title="administration">administration</a>, <a href="https://publications.waset.org/abstracts/search?q=religion" title=" religion"> religion</a>, <a href="https://publications.waset.org/abstracts/search?q=sokoto%20caliphate" title=" sokoto caliphate"> sokoto caliphate</a>, <a href="https://publications.waset.org/abstracts/search?q=moral%20teachings" title=" moral teachings"> moral teachings</a> </p> <a href="https://publications.waset.org/abstracts/33688/lesson-of-moral-teaching-of-the-sokoto-caliphate-in-the-quest-for-genuine-national-development-in-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33688.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">273</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">1814</span> Designing a Corpus Database to Enhance the Learning of Old English Language</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raquel%20Mateo%20Mendaza">Raquel Mateo Mendaza</a>, <a href="https://publications.waset.org/abstracts/search?q=Carmen%20Novo%20Urraca"> Carmen Novo Urraca</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The current paper presents the elaboration of a corpus database that aligns two different corpora in order to simplify the search of information both for researchers and students of Old English. This database comprises the information contained in two main reference corpora, namely the Dictionary of Old English Corpus (DOEC), compiled at the University of Toronto, and the York-Toronto-Helsinki Parsed Corpus of Old English (YCOE). The first one provides information on all surviving texts written in the Old English language. The latter offers the syntactical and morphological annotation of several texts included in the DOEC. Although both corpora are closely related, as the YCOE includes the DOE source text identifier, the main problem detected is that there is not an alignment of texts that allows for the search of whole fragments to be further analysed in terms of morphology and syntax. The database proposed in this paper gathers all this information and presents it in a simple, more accessible, visual, and educational way. The alignment of fragments has been done in an automatized way. However, some problems have emerged during the creating process particularly related to the lack of correspondence in the division of fragments. For this reason, it has been necessary to revise the whole entries manually to obtain a truthful high-quality product and to carefully indicate the gaps encountered in these corpora. All in all, this database contains more than 60,000 entries corresponding with the DOE fragments annotated by the YCOE. The main strength of the resulting product is its research and teaching implications in the study of Old English. The use of this database will help researchers and students in the study of different aspects of the language, such as inflectional morphology, syntactic behaviour of given words, or translation studies, among others. By means of the search of words or fragments, the annotated information on morphology and syntax will be automatically displayed, automatizing, and speeding up the search of data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alignment" title="alignment">alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=corpus%20database" title=" corpus database"> corpus database</a>, <a href="https://publications.waset.org/abstracts/search?q=morphosyntactic%20analysis" title=" morphosyntactic analysis"> morphosyntactic analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=Old%20English" title=" Old English"> Old English</a> </p> <a href="https://publications.waset.org/abstracts/131554/designing-a-corpus-database-to-enhance-the-learning-of-old-english-language" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131554.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">134</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1813</span> Design to Cryogenic System for Dilution Refrigerator with Cavity and Superconducting Magnet</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ki%20Woong%20Lee">Ki Woong Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Center for Axion and Precision Physics Research is studying the search for dark matter using 12 tesla superconducting magnets. A dilution refrigerator is being used for search experiments, and superconducting magnets, superconducting cavities. The dilution refrigerator requires a stable cryogenic environment using liquid helium. Accordingly, a cryogenic system for a stable supply of liquid helium is to be established. This cryogenic system includes the liquefying, supply, storage, and purification of liquid helium. This article presents the basic design, construction, and operation plans for building cryogenic systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryogenic%20system" title="cryogenic system">cryogenic system</a>, <a href="https://publications.waset.org/abstracts/search?q=dilution%20refrigerator" title=" dilution refrigerator"> dilution refrigerator</a>, <a href="https://publications.waset.org/abstracts/search?q=superconducting%20magnet" title=" superconducting magnet"> superconducting magnet</a>, <a href="https://publications.waset.org/abstracts/search?q=helium%20recovery%20system" title=" helium recovery system"> helium recovery system</a> </p> <a href="https://publications.waset.org/abstracts/154130/design-to-cryogenic-system-for-dilution-refrigerator-with-cavity-and-superconducting-magnet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154130.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">120</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1812</span> The Use of Voice in Online Public Access Catalog as Faster Searching Device</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maisyatus%20Suadaa%20Irfana">Maisyatus Suadaa Irfana</a>, <a href="https://publications.waset.org/abstracts/search?q=Nove%20Eka%20Variant%20Anna"> Nove Eka Variant Anna</a>, <a href="https://publications.waset.org/abstracts/search?q=Dyah%20Puspitasari%20Sri%20Rahayu"> Dyah Puspitasari Sri Rahayu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Technological developments provide convenience to all the people. Nowadays, the communication of human with the computer is done via text. With the development of technology, human and computer communications have been conducted with a voice like communication between human beings. It provides an easy facility for many people, especially those who have special needs. Voice search technology is applied in the search of book collections in the OPAC (Online Public Access Catalog), so library visitors will find it faster and easier to find books that they need. Integration with Google is needed to convert the voice into text. To optimize the time and the results of searching, Server will download all the book data that is available in the server database. Then, the data will be converted into JSON format. In addition, the incorporation of some algorithms is conducted including Decomposition (parse) in the form of array of JSON format, the index making, analyzer to the result. It aims to make the process of searching much faster than the usual searching in OPAC because the data are directly taken to the database for every search warrant. Data Update Menu is provided with the purpose to enable users perform their own data updates and get the latest data information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OPAC" title="OPAC">OPAC</a>, <a href="https://publications.waset.org/abstracts/search?q=voice" title=" voice"> voice</a>, <a href="https://publications.waset.org/abstracts/search?q=searching" title=" searching"> searching</a>, <a href="https://publications.waset.org/abstracts/search?q=faster" title=" faster"> faster</a> </p> <a href="https://publications.waset.org/abstracts/58561/the-use-of-voice-in-online-public-access-catalog-as-faster-searching-device" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58561.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">344</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1811</span> Computational Aerodynamic Shape Optimisation Using a Concept of Control Nodes and Modified Cuckoo Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Naumann">D. S. Naumann</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20J.%20Evans"> B. J. Evans</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20Hassan"> O. Hassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper outlines the development of an automated aerodynamic optimisation algorithm using a novel method of parameterising a computational mesh by employing user–defined control nodes. The shape boundary movement is coupled to the movement of the novel concept of the control nodes via a quasi-1D-linear deformation. Additionally, a second order smoothing step has been integrated to act on the boundary during the mesh movement based on the change in its second derivative. This allows for both linear and non-linear shape transformations dependent on the preference of the user. The domain mesh movement is then coupled to the shape boundary movement via a Delaunay graph mapping. A Modified Cuckoo Search (MCS) algorithm is used for optimisation within the prescribed design space defined by the allowed range of control node displacement. A finite volume compressible NavierStokes solver is used for aerodynamic modelling to predict aerodynamic design fitness. The resulting coupled algorithm is applied to a range of test cases in two dimensions including the design of a subsonic, transonic and supersonic intake and the optimisation approach is compared with more conventional optimisation strategies. Ultimately, the algorithm is tested on a three dimensional wing optimisation case. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mesh%20movement" title="mesh movement">mesh movement</a>, <a href="https://publications.waset.org/abstracts/search?q=aerodynamic%20shape%20optimization" title=" aerodynamic shape optimization"> aerodynamic shape optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=cuckoo%20search" title=" cuckoo search"> cuckoo search</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20parameterisation" title=" shape parameterisation"> shape parameterisation</a> </p> <a href="https://publications.waset.org/abstracts/42527/computational-aerodynamic-shape-optimisation-using-a-concept-of-control-nodes-and-modified-cuckoo-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42527.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1810</span> Optimized Algorithm for Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuzhang%20Zhao">Fuzhang Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization problems. Although some progress has been made to improve PSO algorithms over the last two decades, additional work is still needed to balance parameters to achieve better numerical properties of accuracy, efficiency, and stability. In the optimal PSO algorithm, the optimal weightings of (√ 5 − 1)/2 and (3 − √5)/2 are used for the cognitive factor and the social factor, respectively. By the same token, the same optimal weightings have been applied for intensification searches and diversification searches, respectively. Perturbation and constriction effects are optimally balanced. Simulations of the de Jong, the Rosenbrock, and the Griewank functions show that the optimal PSO algorithm indeed achieves better numerical properties and outperforms the canonical PSO algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=diversification%20search" title="diversification search">diversification search</a>, <a href="https://publications.waset.org/abstracts/search?q=intensification%20search" title=" intensification search"> intensification search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20weighting" title=" optimal weighting"> optimal weighting</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/36390/optimized-algorithm-for-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36390.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">581</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1809</span> Teacher Professional Development Programs on K-12 Engineering Education: A Systematic Review of the Literature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Canan%20Mesutoglu">Canan Mesutoglu</a>, <a href="https://publications.waset.org/abstracts/search?q=Evrim%20Baran"> Evrim Baran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Teachers have a prominent role in facilitating the place of engineering in K-12 classrooms. This study addresses the need to understand how teacher professional development programs focusing on K-12 engineering education can be designed and delivered more effectively. A systematic review of the literature on such programs can offer possible ideas and recommendations. The purpose of this study is to systematically synthesize the peer-reviewed articles published on K-12 engineering education teacher professional development programs. The methodology that guided the study was comprised of four phases: search, selection, coding, and synthesis. The search phase included articles published in the time period between 2000 and 2016. With a comprehensive search in databases, inclusion criteria were applied. This was followed by evaluation of the quality of articles with a checklist, and finally analysis of the results. The results revealed two categories of themes. These were 1) five themes related to the overarching agenda of the PD programs, and 2) five themes related to the instructional techniques of the PD programs. Finally, core elements were generated to guide the design and delivery of teacher PD programs for K-12 engineering education. The results aimed to provide a conceptual basis for future research and practice on teacher PD programs for K-12 engineering education. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=core%20elements" title="core elements">core elements</a>, <a href="https://publications.waset.org/abstracts/search?q=K-12%20engineering%20education" title=" K-12 engineering education"> K-12 engineering education</a>, <a href="https://publications.waset.org/abstracts/search?q=systematic%20literature%20review" title=" systematic literature review"> systematic literature review</a>, <a href="https://publications.waset.org/abstracts/search?q=teacher%20professional%20development%20programs" title=" teacher professional development programs"> teacher professional development programs</a> </p> <a href="https://publications.waset.org/abstracts/65553/teacher-professional-development-programs-on-k-12-engineering-education-a-systematic-review-of-the-literature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65553.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">323</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1808</span> Pharmacy-Station Mobile Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taissir%20Fekih%20Romdhane">Taissir Fekih Romdhane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a mobile web application named Pharmacy-Station that sells medicines and permits user to search for medications based on their symptoms, making it is easy to locate a specific drug online without the need to visit a pharmacy where it may be out of stock. This application is developed using the jQuery Mobile framework, which uses many web technologies and languages such as HTML5, PHP, JavaScript and CSS3. To test the proposed application, we used data from popular pharmacies in Saudi Arabia that included important information such as location, contact, and medicines in stock, etc. This document describes the different steps followed to create the Pharmacy-Station application along with screenshots. Finally, based on the results, the paper concludes with recommendations and further works planned to improve the Pharmacy-Station mobile application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pharmacy" title="pharmacy">pharmacy</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20application" title=" mobile application"> mobile application</a>, <a href="https://publications.waset.org/abstracts/search?q=jquery%20mobile%20framework" title=" jquery mobile framework"> jquery mobile framework</a>, <a href="https://publications.waset.org/abstracts/search?q=search" title=" search"> search</a>, <a href="https://publications.waset.org/abstracts/search?q=medicine" title=" medicine"> medicine</a> </p> <a href="https://publications.waset.org/abstracts/148063/pharmacy-station-mobile-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148063.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">159</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1807</span> Peer-Assisted Learning of Ebm in, a UK Medical School: Evaluation of the NICE Evidence Search Student Champion Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emily%20Jin">Emily Jin</a>, <a href="https://publications.waset.org/abstracts/search?q=Harry%20Sharples"> Harry Sharples</a>, <a href="https://publications.waset.org/abstracts/search?q=Anne%20Weist"> Anne Weist</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: NICE Evidence Search Student Champion Scheme is a peer-assisted learning scheme that aims to improve the routine use of evidence-based information by future health and social care staff. The focus is on the NICE evidence search portal that provides selected information from more than 800 reliable health, social care, and medicines sources, including up-to-date guidelines and information for the public. This paper aims to evaluate the effectiveness of the scheme when implemented in Liverpool School of Medicine and to understand the experiences of those attending. Methods: Twelve student champions were recruited and trained in February 2020 as peer tutors during a workshop facilitated by NICE. Cascade sessions were then organised and delivered on an optional basis for students, in small groups of < 10 to approximately 70 attendees. Surveys were acquired immediately before and 8-12 weeks after cascade sessions (n=47 and 45 respectively). Data from these surveys facilitated the analysis of the scheme. Results: Surveys demonstrated 74% of all attendees frequently searched for health and social care information online as a part of their studies. However, only 15% of attendees reported having prior formal training on searching for health information, despite receiving such training earlier on in the curriculum. After attending cascade sessions, students reported a 58% increase in confidence when searching for information using evidence search, from a pre-session a baseline of 36%. Conclusion: NICE Evidence Search Student Champion Scheme provided clear benefits for attending students, increasing confidence in searching for peer-reviewed, mainly secondary sources of health information. The lack of reported training represents the unmet need that the champion scheme satisfies, and this likely benefits student champions as well as attendees. Increasing confidence in searching for healthcare information online may support future evidence-based decision-making. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evidence-based%20medicine" title="evidence-based medicine">evidence-based medicine</a>, <a href="https://publications.waset.org/abstracts/search?q=NICE" title=" NICE"> NICE</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20education" title=" medical education"> medical education</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20school" title=" medical school"> medical school</a>, <a href="https://publications.waset.org/abstracts/search?q=peer-assisted%20learning" title=" peer-assisted learning"> peer-assisted learning</a> </p> <a href="https://publications.waset.org/abstracts/135833/peer-assisted-learning-of-ebm-in-a-uk-medical-school-evaluation-of-the-nice-evidence-search-student-champion-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/135833.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">1806</span> A Novel Heuristic for Analysis of Large Datasets by Selecting Wrapper-Based Features </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bushra%20Zafar">Bushra Zafar</a>, <a href="https://publications.waset.org/abstracts/search?q=Usman%20Qamar"> Usman Qamar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Large data sample size and dimensions render the effectiveness of conventional data mining methodologies. A data mining technique are important tools for collection of knowledgeable information from variety of databases and provides supervised learning in the form of classification to design models to describe vital data classes while structure of the classifier is based on class attribute. Classification efficiency and accuracy are often influenced to great extent by noisy and undesirable features in real application data sets. The inherent natures of data set greatly masks its quality analysis and leave us with quite few practical approaches to use. To our knowledge first time, we present a new approach for investigation of structure and quality of datasets by providing a targeted analysis of localization of noisy and irrelevant features of data sets. Machine learning is based primarily on feature selection as pre-processing step which offers us to select few features from number of features as a subset by reducing the space according to certain evaluation criterion. The primary objective of this study is to trim down the scope of the given data sample by searching a small set of important features which may results into good classification performance. For this purpose, a heuristic for wrapper-based feature selection using genetic algorithm and for discriminative feature selection an external classifier are used. Selection of feature based on its number of occurrence in the chosen chromosomes. Sample dataset has been used to demonstrate proposed idea effectively. A proposed method has improved average accuracy of different datasets is about 95%. Experimental results illustrate that proposed algorithm increases the accuracy of prediction of different diseases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=generic%20algorithm" title=" generic algorithm"> generic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=KNN%20algorithms" title=" KNN algorithms"> KNN algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=wrapper%20based%20feature%20selection" title=" wrapper based feature selection"> wrapper based feature selection</a> </p> <a href="https://publications.waset.org/abstracts/41534/a-novel-heuristic-for-analysis-of-large-datasets-by-selecting-wrapper-based-features" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41534.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">316</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">1805</span> Optimization of Doubly Fed Induction Generator Equivalent Circuit Parameters by Direct Search Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mamidi%20Ramakrishna%20Rao">Mamidi Ramakrishna Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Doubly-fed induction generator (DFIG) is currently the choice for many wind turbines. These generators, when connected to the grid through a converter, is subjected to varied power system conditions like voltage variation, frequency variation, short circuit fault conditions, etc. Further, many countries like Canada, Germany, UK, Scotland, etc. have distinct grid codes relating to wind turbines. Accordingly, following the network faults, wind turbines have to supply a definite reactive current. To satisfy the requirements including reactive current capability, an optimum electrical design becomes a mandate for DFIG to function. This paper intends to optimize the equivalent circuit parameters of an electrical design for satisfactory DFIG performance. Direct search method has been used for optimization of the parameters. The variables selected include electromagnetic core dimensions (diameters and stack length), slot dimensions, radial air gap between stator and rotor and winding copper cross section area. Optimization for 2 MW DFIG has been executed separately for three objective functions - maximum reactive power capability (Case I), maximum efficiency (Case II) and minimum weight (Case III). In the optimization analysis program, voltage variations (10%), power factor- leading and lagging (0.95), speeds for corresponding to slips (-0.3 to +0.3) have been considered. The optimum designs obtained for objective functions were compared. It can be concluded that direct search method of optimization helps in determining an optimum electrical design for each objective function like efficiency or reactive power capability or weight minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=direct%20search" title="direct search">direct search</a>, <a href="https://publications.waset.org/abstracts/search?q=DFIG" title=" DFIG"> DFIG</a>, <a href="https://publications.waset.org/abstracts/search?q=equivalent%20circuit%20parameters" title=" equivalent circuit parameters"> equivalent circuit parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/59884/optimization-of-doubly-fed-induction-generator-equivalent-circuit-parameters-by-direct-search-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59884.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">1804</span> Nazca: A Context-Based Matching Method for Searching Heterogeneous Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karine%20B.%20de%20Oliveira">Karine B. de Oliveira</a>, <a href="https://publications.waset.org/abstracts/search?q=Carina%20F.%20Dorneles"> Carina F. Dorneles</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The structure level matching is the problem of combining elements of a structure, which can be represented as entities, classes, XML elements, web forms, and so on. This is a challenge due to large number of distinct representations of semantically similar structures. This paper describes a structure-based matching method applied to search for different representations in data sources, considering the similarity between elements of two structures and the data source context. Using real data sources, we have conducted an experimental study comparing our approach with our baseline implementation and with another important schema matching approach. We demonstrate that our proposal reaches higher precision than the baseline. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context" title="context">context</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20source" title=" data source"> data source</a>, <a href="https://publications.waset.org/abstracts/search?q=index" title=" index"> index</a>, <a href="https://publications.waset.org/abstracts/search?q=matching" title=" matching"> matching</a>, <a href="https://publications.waset.org/abstracts/search?q=search" title=" search"> search</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=structure" title=" structure"> structure</a> </p> <a href="https://publications.waset.org/abstracts/4417/nazca-a-context-based-matching-method-for-searching-heterogeneous-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4417.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">364</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1803</span> 3D Model Completion Based on Similarity Search with Slim-Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alexis%20Aldo%20Mendoza%20Villarroel">Alexis Aldo Mendoza Villarroel</a>, <a href="https://publications.waset.org/abstracts/search?q=Ademir%20Clemente%20Villena%20Zevallos"> Ademir Clemente Villena Zevallos</a>, <a href="https://publications.waset.org/abstracts/search?q=Cristian%20Jose%20Lopez%20Del%20Alamo"> Cristian Jose Lopez Del Alamo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the advancement of technology it is now possible to scan entire objects and obtain their digital representation by using point clouds or polygon meshes. However, some objects may be broken or have missing parts; thus, several methods focused on this problem have been proposed based on Geometric Deep Learning, such as GCNN, ACNN, PointNet, among others. In this article an approach from a different paradigm is proposed, using metric data structures to index global descriptors in the spectral domain and allow the recovery of a set of similar models in polynomial time; to later use the Iterative Close Point algorithm and recover the parts of the incomplete model using the geometry and topology of the model with less Hausdorff distance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3D%20reconstruction%20method" title="3D reconstruction method">3D reconstruction method</a>, <a href="https://publications.waset.org/abstracts/search?q=point%20cloud%20completion" title=" point cloud completion"> point cloud completion</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20completion" title=" shape completion"> shape completion</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20search" title=" similarity search"> similarity search</a> </p> <a href="https://publications.waset.org/abstracts/121412/3d-model-completion-based-on-similarity-search-with-slim-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/121412.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">121</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">1802</span> An Audit of the Process of Care in Surveillance Services for Children with Sickle Cell Disease in Wales</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Charlie%20Jeffkins">Charlie Jeffkins</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sickle cell disease is a serious life-limiting condition which can reduce the quality of life for many patients. Public Health England (PHE), in partnership with the Sickle Cell Society (SCS), has created guidelines to prevent severe complications from sickle cell disease. Data was collected from Children’s Hospital for Wales between 15/03/21-26/03/21. Methods: A manual search of patient records for children under the care of Rocket Ward and a key term search of online records was used. Results: Penicillin prophylaxis was given at 90 days for 89%, 77% of TCDs scans were done at 2-3 years, and 72% have had a scan in the last year. 53% of patients have had discussions about hydroxycarbamide, whilst 65% have started it. PPV vaccination was documented for 19%. Conclusion: Overall, none of the four standards were reached; however, TCD uptake has improved. There is a need for better documentation of treatment and annual re-audits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=paediatric" title="paediatric">paediatric</a>, <a href="https://publications.waset.org/abstracts/search?q=haematology" title=" haematology"> haematology</a>, <a href="https://publications.waset.org/abstracts/search?q=sickle%20cell" title=" sickle cell"> sickle cell</a>, <a href="https://publications.waset.org/abstracts/search?q=audit" title=" audit"> audit</a> </p> <a href="https://publications.waset.org/abstracts/142056/an-audit-of-the-process-of-care-in-surveillance-services-for-children-with-sickle-cell-disease-in-wales" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142056.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">221</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">1801</span> Search for New Design Elements in Time-Honoured Shops in Tainan — On Curriculum Practice about Culture Creative Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ya-Ling%20Huang">Ya-Ling Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming-Chun%20Tsai"> Ming-Chun Tsai</a>, <a href="https://publications.waset.org/abstracts/search?q=Fan%20Hsu"> Fan Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Kai-Ru%20Hsieh"> Kai-Ru Hsieh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper mainly discusses the research and practice process of a laboratory curriculum by leading students to perform field investigation into time-honoured shops that have existed for more than 50 years in the downtown area of Tainan, Taiwan, and then search again for design elements and completing the design. The participants are juniors from the Department of Visual Communication Design, Kun Shan University. The duration of research and practice is two months. Operators of these shops are invited to jointly appraise the final achievements. 9 works out of 27 are chosen for final exhibition and commercialization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=culture%20creative%20industry" title="culture creative industry">culture creative industry</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20communication%20design" title=" visual communication design"> visual communication design</a>, <a href="https://publications.waset.org/abstracts/search?q=curriculum%20experimental" title=" curriculum experimental"> curriculum experimental</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20arts" title=" visual arts"> visual arts</a> </p> <a href="https://publications.waset.org/abstracts/7338/search-for-new-design-elements-in-time-honoured-shops-in-tainan-on-curriculum-practice-about-culture-creative-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7338.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">355</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">1800</span> Selection of Optimal Reduced Feature Sets of Brain Signal Analysis Using Heuristically Optimized Deep Autoencoder</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Souvik%20Phadikar">Souvik Phadikar</a>, <a href="https://publications.waset.org/abstracts/search?q=Nidul%20Sinha"> Nidul Sinha</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajdeep%20Ghosh"> Rajdeep Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In brainwaves research using electroencephalogram (EEG) signals, finding the most relevant and effective feature set for identification of activities in the human brain is a big challenge till today because of the random nature of the signals. The feature extraction method is a key issue to solve this problem. Finding those features that prove to give distinctive pictures for different activities and similar for the same activities is very difficult, especially for the number of activities. The performance of a classifier accuracy depends on this quality of feature set. Further, more number of features result in high computational complexity and less number of features compromise with the lower performance. In this paper, a novel idea of the selection of optimal feature set using a heuristically optimized deep autoencoder is presented. Using various feature extraction methods, a vast number of features are extracted from the EEG signals and fed to the autoencoder deep neural network. The autoencoder encodes the input features into a small set of codes. To avoid the gradient vanish problem and normalization of the dataset, a meta-heuristic search algorithm is used to minimize the mean square error (MSE) between encoder input and decoder output. To reduce the feature set into a smaller one, 4 hidden layers are considered in the autoencoder network; hence it is called Heuristically Optimized Deep Autoencoder (HO-DAE). In this method, no features are rejected; all the features are combined into the response of responses of the hidden layer. The results reveal that higher accuracy can be achieved using optimal reduced features. The proposed HO-DAE is also compared with the regular autoencoder to test the performance of both. The performance of the proposed method is validated and compared with the other two methods recently reported in the literature, which reveals that the proposed method is far better than the other two methods in terms of classification accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autoencoder" title="autoencoder">autoencoder</a>, <a href="https://publications.waset.org/abstracts/search?q=brainwave%20signal%20analysis" title=" brainwave signal analysis"> brainwave signal analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=electroencephalogram" title=" electroencephalogram"> electroencephalogram</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20extraction" title=" feature extraction"> feature extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20selection" title=" feature selection"> feature selection</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/118906/selection-of-optimal-reduced-feature-sets-of-brain-signal-analysis-using-heuristically-optimized-deep-autoencoder" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118906.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">114</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1799</span> An Analysis System for Integrating High-Throughput Transcript Abundance Data with Metabolic Pathways in Green Algae</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Han-Qin%20Zheng">Han-Qin Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Yi-Fan%20Chiang-Hsieh"> Yi-Fan Chiang-Hsieh</a>, <a href="https://publications.waset.org/abstracts/search?q=Chia-Hung%20Chien"> Chia-Hung Chien</a>, <a href="https://publications.waset.org/abstracts/search?q=Wen-Chi%20Chang"> Wen-Chi Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the most important non-vascular plants, algae have many research applications, including high species diversity, biofuel sources, adsorption of heavy metals and, following processing, health supplements. With the increasing availability of next-generation sequencing (NGS) data for algae genomes and transcriptomes, an integrated resource for retrieving gene expression data and metabolic pathway is essential for functional analysis and systems biology in algae. However, gene expression profiles and biological pathways are displayed separately in current resources, and making it impossible to search current databases directly to identify the cellular response mechanisms. Therefore, this work develops a novel AlgaePath database to retrieve gene expression profiles efficiently under various conditions in numerous metabolic pathways. AlgaePath, a web-based database, integrates gene information, biological pathways, and next-generation sequencing (NGS) datasets in Chlamydomonasreinhardtii and Neodesmus sp. UTEX 2219-4. Users can identify gene expression profiles and pathway information by using five query pages (i.e. Gene Search, Pathway Search, Differentially Expressed Genes (DEGs) Search, Gene Group Analysis, and Co-Expression Analysis). The gene expression data of 45 and 4 samples can be obtained directly on pathway maps in C. reinhardtii and Neodesmus sp. UTEX 2219-4, respectively. Genes that are differentially expressed between two conditions can be identified in Folds Search. Furthermore, the Gene Group Analysis of AlgaePath includes pathway enrichment analysis, and can easily compare the gene expression profiles of functionally related genes in a map. Finally, Co-Expression Analysis provides co-expressed transcripts of a target gene. The analysis results provide a valuable reference for designing further experiments and elucidating critical mechanisms from high-throughput data. More than an effective interface to clarify the transcript response mechanisms in different metabolic pathways under various conditions, AlgaePath is also a data mining system to identify critical mechanisms based on high-throughput sequencing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=next-generation%20sequencing%20%28NGS%29" title="next-generation sequencing (NGS)">next-generation sequencing (NGS)</a>, <a href="https://publications.waset.org/abstracts/search?q=algae" title=" algae"> algae</a>, <a href="https://publications.waset.org/abstracts/search?q=transcriptome" title=" transcriptome"> transcriptome</a>, <a href="https://publications.waset.org/abstracts/search?q=metabolic%20pathway" title=" metabolic pathway"> metabolic pathway</a>, <a href="https://publications.waset.org/abstracts/search?q=co-expression" title=" co-expression"> co-expression</a> </p> <a href="https://publications.waset.org/abstracts/9022/an-analysis-system-for-integrating-high-throughput-transcript-abundance-data-with-metabolic-pathways-in-green-algae" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9022.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">407</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=8" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=2">2</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=heuristic%20search&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=8">8</a></li> <li class="page-item active"><span class="page-link">9</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=12">12</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=heuristic%20search&page=68">68</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=69">69</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic%20search&page=10" 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>