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: BP algorithm</title> <meta name="description" content="Search results for: BP algorithm"> <meta name="keywords" content="BP algorithm"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="BP algorithm" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="BP algorithm"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 3595</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: BP algorithm</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3385</span> Radial Basis Surrogate Model Integrated to Evolutionary Algorithm for Solving Computation Intensive Black-Box Problems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulbaset%20Saad">Abdulbaset Saad</a>, <a href="https://publications.waset.org/abstracts/search?q=Adel%20Younis"> Adel Younis</a>, <a href="https://publications.waset.org/abstracts/search?q=Zuomin%20Dong"> Zuomin Dong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For design optimization with high-dimensional expensive problems, an effective and efficient optimization methodology is desired. This work proposes a series of modification to the Differential Evolution (DE) algorithm for solving computation Intensive Black-Box Problems. The proposed methodology is called Radial Basis Meta-Model Algorithm Assisted Differential Evolutionary (RBF-DE), which is a global optimization algorithm based on the meta-modeling techniques. A meta-modeling assisted DE is proposed to solve computationally expensive optimization problems. The Radial Basis Function (RBF) model is used as a surrogate model to approximate the expensive objective function, while DE employs a mechanism to dynamically select the best performing combination of parameters such as differential rate, cross over probability, and population size. The proposed algorithm is tested on benchmark functions and real life practical applications and problems. The test results demonstrate that the proposed algorithm is promising and performs well compared to other optimization algorithms. The proposed algorithm is capable of converging to acceptable and good solutions in terms of accuracy, number of evaluations, and time needed to converge. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=differential%20evolution" title="differential evolution">differential evolution</a>, <a href="https://publications.waset.org/abstracts/search?q=engineering%20design" title=" engineering design"> engineering design</a>, <a href="https://publications.waset.org/abstracts/search?q=expensive%20computations" title=" expensive computations"> expensive computations</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-modeling" title=" meta-modeling"> meta-modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20basis%20function" title=" radial basis function"> radial basis function</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/48247/radial-basis-surrogate-model-integrated-to-evolutionary-algorithm-for-solving-computation-intensive-black-box-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48247.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">396</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">3384</span> Reduction of Impulsive Noise in OFDM System using Adaptive Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alina%20Mirza">Alina Mirza</a>, <a href="https://publications.waset.org/abstracts/search?q=Sumrin%20M.%20Kabir"> Sumrin M. Kabir</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahzad%20A.%20Sheikh"> Shahzad A. Sheikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Orthogonal Frequency Division Multiplexing (OFDM) with high data rate, high spectral efficiency and its ability to mitigate the effects of multipath makes them most suitable in wireless application. Impulsive noise distorts the OFDM transmission and therefore methods must be investigated to suppress this noise. In this paper, a State Space Recursive Least Square (SSRLS) algorithm based adaptive impulsive noise suppressor for OFDM communication system is proposed. And a comparison with another adaptive algorithm is conducted. The state space model-dependent recursive parameters of proposed scheme enables to achieve steady state mean squared error (MSE), low bit error rate (BER), and faster convergence than that of some of existing algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDM" title="OFDM">OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=impulsive%20noise" title=" impulsive noise"> impulsive noise</a>, <a href="https://publications.waset.org/abstracts/search?q=SSRLS" title=" SSRLS"> SSRLS</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a> </p> <a href="https://publications.waset.org/abstracts/31478/reduction-of-impulsive-noise-in-ofdm-system-using-adaptive-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31478.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">457</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">3383</span> Channel Estimation for Orthogonal Frequency Division Multiplexing Systems over Doubly Selective Channels Base on DCS-DCSOMP Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Linyu%20Wang">Linyu Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Furui%20Huo"> Furui Huo</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianhong%20Xiang"> Jianhong Xiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Doppler shift generated by high-speed movement and multipath effects in the channel are the main reasons for the generation of a time-frequency doubly-selective (DS) channel. There is severe inter-carrier interference (ICI) in the DS channel. Channel estimation for an orthogonal frequency division multiplexing (OFDM) system over a DS channel is very difficult. The simultaneous orthogonal matching pursuit algorithm under distributed compressive sensing theory (DCS-SOMP) has been used in channel estimation for OFDM systems over DS channels. However, the reconstruction accuracy of the DCS-SOMP algorithm is not high enough in the low SNR stage. To solve this problem, in this paper, we propose an improved DCS-SOMP algorithm based on the inner product difference comparison operation (DCS-DCSOMP). The reconstruction accuracy is improved by increasing the number of candidate indexes and designing the comparison conditions of inner product difference. We combine the DCS-DCSOMP algorithm with the basis expansion model (BEM) to reduce the complexity of channel estimation. Simulation results show the effectiveness of the proposed algorithm and its advantages over other algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDM" title="OFDM">OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=doubly%20selective" title=" doubly selective"> doubly selective</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20estimation" title=" channel estimation"> channel estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=compressed%20sensing" title=" compressed sensing"> compressed sensing</a> </p> <a href="https://publications.waset.org/abstracts/162873/channel-estimation-for-orthogonal-frequency-division-multiplexing-systems-over-doubly-selective-channels-base-on-dcs-dcsomp-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162873.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">95</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">3382</span> Robot Operating System-Based SLAM for a Gazebo-Simulated Turtlebot2 in 2d Indoor Environment with Cartographer Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wilayat%20Ali">Wilayat Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Sheng"> Li Sheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Waleed%20Ahmed"> Waleed Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The ability of the robot to make simultaneously map of the environment and localize itself with respect to that environment is the most important element of mobile robots. To solve SLAM many algorithms could be utilized to build up the SLAM process and SLAM is a developing area in Robotics research. Robot Operating System (ROS) is one of the frameworks which provide multiple algorithm nodes to work with and provide a transmission layer to robots. Manyof these algorithms extensively in use are Hector SLAM, Gmapping and Cartographer SLAM. This paper describes a ROS-based Simultaneous localization and mapping (SLAM) library Google Cartographer mapping, which is open-source algorithm. The algorithm was applied to create a map using laser and pose data from 2d Lidar that was placed on a mobile robot. The model robot uses the gazebo package and simulated in Rviz. Our research work's primary goal is to obtain mapping through Cartographer SLAM algorithm in a static indoor environment. From our research, it is shown that for indoor environments cartographer is an applicable algorithm to generate 2d maps with LIDAR placed on mobile robot because it uses both odometry and poses estimation. The algorithm has been evaluated and maps are constructed against the SLAM algorithms presented by Turtlebot2 in the static indoor environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SLAM" title="SLAM">SLAM</a>, <a href="https://publications.waset.org/abstracts/search?q=ROS" title=" ROS"> ROS</a>, <a href="https://publications.waset.org/abstracts/search?q=navigation" title=" navigation"> navigation</a>, <a href="https://publications.waset.org/abstracts/search?q=localization%20and%20mapping" title=" localization and mapping"> localization and mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=gazebo" title=" gazebo"> gazebo</a>, <a href="https://publications.waset.org/abstracts/search?q=Rviz" title=" Rviz"> Rviz</a>, <a href="https://publications.waset.org/abstracts/search?q=Turtlebot2" title=" Turtlebot2"> Turtlebot2</a>, <a href="https://publications.waset.org/abstracts/search?q=slam%20algorithms" title=" slam algorithms"> slam algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=2d%20indoor%20environment" title=" 2d indoor environment"> 2d indoor environment</a>, <a href="https://publications.waset.org/abstracts/search?q=cartographer" title=" cartographer"> cartographer</a> </p> <a href="https://publications.waset.org/abstracts/133435/robot-operating-system-based-slam-for-a-gazebo-simulated-turtlebot2-in-2d-indoor-environment-with-cartographer-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133435.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">145</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">3381</span> Comparison of Back-Projection with Non-Uniform Fast Fourier Transform for Real-Time Photoacoustic Tomography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moung%20Young%20Lee">Moung Young Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chul%20Gyu%20Song"> Chul Gyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Photoacoustic imaging is the imaging technology that combines the optical imaging and ultrasound. This provides the high contrast and resolution due to optical imaging and ultrasound imaging, respectively. We developed the real-time photoacoustic tomography (PAT) system using linear-ultrasound transducer and digital acquisition (DAQ) board. There are two types of algorithm for reconstructing the photoacoustic signal. One is back-projection algorithm, the other is FFT algorithm. Especially, we used the non-uniform FFT algorithm. To evaluate the performance of our system and algorithms, we monitored two wires that stands at interval of 2.89 mm and 0.87 mm. Then, we compared the images reconstructed by algorithms. Finally, we monitored the two hairs crossed and compared between these algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=back-projection" title="back-projection">back-projection</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20comparison" title=" image comparison"> image comparison</a>, <a href="https://publications.waset.org/abstracts/search?q=non-uniform%20FFT" title=" non-uniform FFT"> non-uniform FFT</a>, <a href="https://publications.waset.org/abstracts/search?q=photoacoustic%20tomography" title=" photoacoustic tomography"> photoacoustic tomography</a> </p> <a href="https://publications.waset.org/abstracts/40584/comparison-of-back-projection-with-non-uniform-fast-fourier-transform-for-real-time-photoacoustic-tomography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40584.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">434</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">3380</span> Symmetric Arabic Language Encryption Technique Based on Modified Playfair Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fairouz%20Beggas">Fairouz Beggas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the large number of exchanges in the networks, the security of communications is essential. Most ways of keeping communication secure rely on encryption. In this work, a symmetric encryption technique is offered to encrypt and decrypt simple Arabic scripts based on a multi-level security. A proposed technique uses an idea of Playfair encryption with a larger table size and an additional layer of encryption to ensure more security. The idea of the proposed algorithm aims to generate a dynamic table that depends on a secret key. The same secret key is also used to create other secret keys to over-encrypt the plaintext in three steps. The obtained results show that the proposed algorithm is faster in terms of encryption/decryption speed and can resist to many types of attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arabic%20data" title="arabic data">arabic data</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=playfair" title=" playfair"> playfair</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm" title=" symmetric algorithm"> symmetric algorithm</a> </p> <a href="https://publications.waset.org/abstracts/159982/symmetric-arabic-language-encryption-technique-based-on-modified-playfair-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159982.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">87</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">3379</span> A Matheuristic Algorithm for the School Bus Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cagri%20Memis">Cagri Memis</a>, <a href="https://publications.waset.org/abstracts/search?q=Muzaffer%20Kapanoglu"> Muzaffer Kapanoglu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The school bus routing problem (SBRP) is a variant of the Vehicle Routing Problem (VRP) classified as a location-allocation-routing problem. In this study, the SBRP is decomposed into two sub-problems: (1) bus route generation and (2) bus stop selection to solve large instances of the SBRP in reasonable computational times. To solve the first sub-problem, we propose a genetic algorithm to generate bus routes. Once the routes have been fixed, a sub-problem remains of allocating students to stops considering the capacity of the buses and the walkability constraints of the students. While the exact method solves small-scale problems, treating large-scale problems with the exact method becomes complex due to computational problems, a deficiency that the genetic algorithm can overcome. Results obtained from the proposed approach on 150 instances up to 250 stops show that the matheuristic algorithm provides better solutions in reasonable computational times with respect to benchmark algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=matheuristic" title=" matheuristic"> matheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=school%20bus%20routing%20problem" title=" school bus routing problem"> school bus routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title=" vehicle routing problem"> vehicle routing problem</a> </p> <a href="https://publications.waset.org/abstracts/168676/a-matheuristic-algorithm-for-the-school-bus-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168676.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">71</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3378</span> Algorithm for Path Recognition in-between Tree Rows for Agricultural Wheeled-Mobile Robots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anderson%20Rocha">Anderson Rocha</a>, <a href="https://publications.waset.org/abstracts/search?q=Pedro%20Miguel%20de%20Figueiredo%20Dinis%20Oliveira%20Gaspar"> Pedro Miguel de Figueiredo Dinis Oliveira Gaspar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Machine vision has been widely used in recent years in agriculture, as a tool to promote the automation of processes and increase the levels of productivity. The aim of this work is the development of a path recognition algorithm based on image processing to guide a terrestrial robot in-between tree rows. The proposed algorithm was developed using the software MATLAB, and it uses several image processing operations, such as threshold detection, morphological erosion, histogram equalization and the Hough transform, to find edge lines along tree rows on an image and to create a path to be followed by a mobile robot. To develop the algorithm, a set of images of different types of orchards was used, which made possible the construction of a method capable of identifying paths between trees of different heights and aspects. The algorithm was evaluated using several images with different characteristics of quality and the results showed that the proposed method can successfully detect a path in different types of environments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agricultural%20mobile%20robot" title="agricultural mobile robot">agricultural mobile robot</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20recognition" title=" path recognition"> path recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=hough%20transform" title=" hough transform"> hough transform</a> </p> <a href="https://publications.waset.org/abstracts/96928/algorithm-for-path-recognition-in-between-tree-rows-for-agricultural-wheeled-mobile-robots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96928.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">146</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">3377</span> Improving the Security of Internet of Things Using Encryption Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amirhossein%20Safi">Amirhossein Safi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Internet of things (IOT) is a kind of advanced information technology which has drawn societies’ attention. Sensors and stimulators are usually recognized as smart devices of our environment. Simultaneously, IOT security brings up new issues. Internet connection and possibility of interaction with smart devices cause those devices to involve more in human life. Therefore, safety is a fundamental requirement in designing IOT. IOT has three remarkable features: overall perception, reliable transmission, and intelligent processing. Because of IOT span, security of conveying data is an essential factor for system security. Hybrid encryption technique is a new model that can be used in IOT. This type of encryption generates strong security and low computation. In this paper, we have proposed a hybrid encryption algorithm which has been conducted in order to reduce safety risks and enhancing encryption's speed and less computational complexity. The purpose of this hybrid algorithm is information integrity, confidentiality, non-repudiation in data exchange for IOT. Eventually, the suggested encryption algorithm has been simulated by MATLAB software, and its speed and safety efficiency were evaluated in comparison with conventional encryption algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=internet%20of%20things" title="internet of things">internet of things</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20algorithm" title=" hybrid algorithm"> hybrid algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy" title=" privacy"> privacy</a> </p> <a href="https://publications.waset.org/abstracts/69919/improving-the-security-of-internet-of-things-using-encryption-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69919.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">467</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">3376</span> Study on the Self-Location Estimate by the Evolutional Triangle Similarity Matching Using Artificial Bee Colony Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yuji%20Kageyama">Yuji Kageyama</a>, <a href="https://publications.waset.org/abstracts/search?q=Shin%20Nagata"> Shin Nagata</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatsuya%20Takino"> Tatsuya Takino</a>, <a href="https://publications.waset.org/abstracts/search?q=Izuru%20Nomura"> Izuru Nomura</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiroyuki%20Kamata"> Hiroyuki Kamata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In previous study, technique to estimate a self-location by using a lunar image is proposed. We consider the improvement of the conventional method in consideration of FPGA implementation in this paper. Specifically, we introduce Artificial Bee Colony algorithm for reduction of search time. In addition, we use fixed point arithmetic to enable high-speed operation on FPGA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SLIM" title="SLIM">SLIM</a>, <a href="https://publications.waset.org/abstracts/search?q=Artificial%20Bee%20Colony%20Algorithm" title=" Artificial Bee Colony Algorithm"> Artificial Bee Colony Algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20estimate" title=" location estimate"> location estimate</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity" title=" evolutional triangle similarity"> evolutional triangle similarity</a> </p> <a href="https://publications.waset.org/abstracts/19303/study-on-the-self-location-estimate-by-the-evolutional-triangle-similarity-matching-using-artificial-bee-colony-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19303.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">518</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">3375</span> FPGA Implementation of Novel Triangular Systolic Array Based Architecture for Determining the Eigenvalues of Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soumitr%20Sanjay%20Dubey">Soumitr Sanjay Dubey</a>, <a href="https://publications.waset.org/abstracts/search?q=Shubhajit%20Roy%20Chowdhury"> Shubhajit Roy Chowdhury</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahul%20Shrestha"> Rahul Shrestha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have presented a novel approach of calculating eigenvalues of any matrix for the first time on Field Programmable Gate Array (FPGA) using Triangular Systolic Arra (TSA) architecture. Conventionally, additional computation unit is required in the architecture which is compliant to the algorithm for determining the eigenvalues and this in return enhances the delay and power consumption. However, recently reported works are only dedicated for symmetric matrices or some specific case of matrix. This works presents an architecture to calculate eigenvalues of any matrix based on QR algorithm which is fully implementable on FPGA. For the implementation of QR algorithm we have used TSA architecture, which is further utilising CORDIC (CO-ordinate Rotation DIgital Computer) algorithm, to calculate various trigonometric and arithmetic functions involved in the procedure. The proposed architecture gives an error in the range of 10−4. Power consumption by the design is 0.598W. It can work at the frequency of 900 MHz. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coordinate%20rotation%20digital%20computer" title="coordinate rotation digital computer">coordinate rotation digital computer</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20angle%20complex%20rotation" title=" three angle complex rotation"> three angle complex rotation</a>, <a href="https://publications.waset.org/abstracts/search?q=triangular%20systolic%20array" title=" triangular systolic array"> triangular systolic array</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20algorithm" title=" QR algorithm "> QR algorithm </a> </p> <a href="https://publications.waset.org/abstracts/40252/fpga-implementation-of-novel-triangular-systolic-array-based-architecture-for-determining-the-eigenvalues-of-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40252.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">415</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">3374</span> Development and Implementation of Curvature Dependent Force Correction Algorithm for the Planning of Forced Controlled Robotic Grinding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aiman%20Alshare">Aiman Alshare</a>, <a href="https://publications.waset.org/abstracts/search?q=Sahar%20Qaadan"> Sahar Qaadan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A curvature dependent force correction algorithm for planning force controlled grinding process with off-line programming flexibility is designed for ABB industrial robot, in order to avoid the manual interface during the process. The machining path utilizes a spline curve fit that is constructed from the CAD data of the workpiece. The fitted spline has a continuity of the second order to assure path smoothness. The implemented algorithm computes uniform forces normal to the grinding surface of the workpiece, by constructing a curvature path in the spatial coordinates using the spline method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ABB%20industrial%20robot" title="ABB industrial robot">ABB industrial robot</a>, <a href="https://publications.waset.org/abstracts/search?q=grinding%20process" title=" grinding process"> grinding process</a>, <a href="https://publications.waset.org/abstracts/search?q=offline%20programming" title=" offline programming"> offline programming</a>, <a href="https://publications.waset.org/abstracts/search?q=CAD%20data%20extraction" title=" CAD data extraction"> CAD data extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=force%20correction%20algorithm" title=" force correction algorithm"> force correction algorithm</a> </p> <a href="https://publications.waset.org/abstracts/49221/development-and-implementation-of-curvature-dependent-force-correction-algorithm-for-the-planning-of-forced-controlled-robotic-grinding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49221.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">362</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">3373</span> Frequent-Pattern Tree Algorithm Application to S&P and Equity Indexes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Younsi">E. Younsi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Andriamboavonjy"> H. Andriamboavonjy</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20David"> A. David</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Dokou"> S. Dokou</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Lemrabet"> B. Lemrabet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software and time optimization are very important factors in financial markets, which are competitive fields, and emergence of new computer tools further stresses the challenge. In this context, any improvement of technical indicators which generate a buy or sell signal is a major issue. Thus, many tools have been created to make them more effective. This worry about efficiency has been leading in present paper to seek best (and most innovative) way giving largest improvement in these indicators. The approach consists in attaching a signature to frequent market configurations by application of frequent patterns extraction method which is here most appropriate to optimize investment strategies. The goal of proposed trading algorithm is to find most accurate signatures using back testing procedure applied to technical indicators for improving their performance. The problem is then to determine the signatures which, combined with an indicator, outperform this indicator alone. To do this, the FP-Tree algorithm has been preferred, as it appears to be the most efficient algorithm to perform this task. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantitative%20analysis" title="quantitative analysis">quantitative analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=back-testing" title=" back-testing"> back-testing</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20models" title=" computational models"> computational models</a>, <a href="https://publications.waset.org/abstracts/search?q=apriori%20algorithm" title=" apriori algorithm"> apriori algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20recognition" title=" pattern recognition"> pattern recognition</a>, <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=FP-tree" title=" FP-tree "> FP-tree </a> </p> <a href="https://publications.waset.org/abstracts/13642/frequent-pattern-tree-algorithm-application-to-sp-and-equity-indexes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13642.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">361</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">3372</span> Developing an Advanced Algorithm Capable of Classifying News, Articles and Other Textual Documents Using Text Mining Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20B.%20Knudsen">R. B. Knudsen</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20T.%20Rasmussen"> O. T. Rasmussen</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20A.%20Alphinas"> R. A. Alphinas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The reason for conducting this research is to develop an algorithm that is capable of classifying news articles from the automobile industry, according to the competitive actions that they entail, with the use of Text Mining (TM) methods. It is needed to test how to properly preprocess the data for this research by preparing pipelines which fits each algorithm the best. The pipelines are tested along with nine different classification algorithms in the realm of regression, support vector machines, and neural networks. Preliminary testing for identifying the optimal pipelines and algorithms resulted in the selection of two algorithms with two different pipelines. The two algorithms are Logistic Regression (LR) and Artificial Neural Network (ANN). These algorithms are optimized further, where several parameters of each algorithm are tested. The best result is achieved with the ANN. The final model yields an accuracy of 0.79, a precision of 0.80, a recall of 0.78, and an F1 score of 0.76. By removing three of the classes that created noise, the final algorithm is capable of reaching an accuracy of 94%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Artificial%20Neural%20network" title="Artificial Neural network">Artificial Neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=Competitive%20dynamics" title=" Competitive dynamics"> Competitive dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=Logistic%20Regression" title=" Logistic Regression"> Logistic Regression</a>, <a href="https://publications.waset.org/abstracts/search?q=Text%20classification" title=" Text classification"> Text classification</a>, <a href="https://publications.waset.org/abstracts/search?q=Text%20mining" title=" Text mining"> Text mining</a> </p> <a href="https://publications.waset.org/abstracts/127954/developing-an-advanced-algorithm-capable-of-classifying-news-articles-and-other-textual-documents-using-text-mining-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127954.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">3371</span> Estimating X-Ray Spectra for Digital Mammography by Using the Expectation Maximization Algorithm: A Monte Carlo Simulation Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chieh-Chun%20Chang">Chieh-Chun Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Cheng-Ting%20Shih"> Cheng-Ting Shih</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan-Lin%20Liu"> Yan-Lin Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shu-Jun%20Chang"> Shu-Jun Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jay%20Wu"> Jay Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the widespread use of digital mammography (DM), radiation dose evaluation of breasts has become important. X-ray spectra are one of the key factors that influence the absorbed dose of glandular tissue. In this study, we estimated the X-ray spectrum of DM using the expectation maximization (EM) algorithm with the transmission measurement data. The interpolating polynomial model proposed by Boone was applied to generate the initial guess of the DM spectrum with the target/filter combination of Mo/Mo and the tube voltage of 26 kVp. The Monte Carlo N-particle code (MCNP5) was used to tally the transmission data through aluminum sheets of 0.2 to 3 mm. The X-ray spectrum was reconstructed by using the EM algorithm iteratively. The influence of the initial guess for EM reconstruction was evaluated. The percentage error of the average energy between the reference spectrum inputted for Monte Carlo simulation and the spectrum estimated by the EM algorithm was -0.14%. The normalized root mean square error (NRMSE) and the normalized root max square error (NRMaSE) between both spectra were 0.6% and 2.3%, respectively. We conclude that the EM algorithm with transmission measurement data is a convenient and useful tool for estimating x-ray spectra for DM in clinical practice. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20mammography" title="digital mammography">digital mammography</a>, <a href="https://publications.waset.org/abstracts/search?q=expectation%20maximization%20algorithm" title=" expectation maximization algorithm"> expectation maximization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=X-Ray%20spectrum" title=" X-Ray spectrum"> X-Ray spectrum</a>, <a href="https://publications.waset.org/abstracts/search?q=X-Ray" title=" X-Ray"> X-Ray</a> </p> <a href="https://publications.waset.org/abstracts/3616/estimating-x-ray-spectra-for-digital-mammography-by-using-the-expectation-maximization-algorithm-a-monte-carlo-simulation-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3616.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">730</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">3370</span> Incorporating Priority Round-Robin Scheduler to Sustain Indefinite Blocking Issue and Prioritized Processes in Operating System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Heng%20Chia%20Ying">Heng Chia Ying</a>, <a href="https://publications.waset.org/abstracts/search?q=Charmaine%20Tan%20Chai%20Nie"> Charmaine Tan Chai Nie</a>, <a href="https://publications.waset.org/abstracts/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Process scheduling is the method of process management that determines which process the CPU will proceed with for the next task and how long it takes. Some issues were found in process management, particularly for Priority Scheduling (PS) and Round Robin Scheduling (RR). The proposed recommendations made for IPRRS are to combine the strengths of both into a combining algorithm while they draw on others to compensate for each weakness. A significant improvement on the combining technique of scheduler, Incorporating Priority Round-Robin Scheduler (IPRRS) address an algorithm for both high and low priority task to sustain the indefinite blocking issue faced in the priority scheduling algorithm and minimize the average turnaround time (ATT) and average waiting time (AWT) in RR scheduling algorithm. This paper will delve into the simple rules introduced by IPRRS and enhancements that both PS and RR bring to the execution of processes in the operating system. Furthermore, it incorporates the best aspects of each algorithm to build the optimum algorithm for a certain case in terms of prioritized processes, ATT, and AWT. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=round%20Robin%20scheduling" title="round Robin scheduling">round Robin scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20scheduling" title=" priority scheduling"> priority scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=indefinite%20blocking" title=" indefinite blocking"> indefinite blocking</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20management" title=" process management"> process management</a>, <a href="https://publications.waset.org/abstracts/search?q=sustain" title=" sustain"> sustain</a>, <a href="https://publications.waset.org/abstracts/search?q=turnaround%20time" title=" turnaround time"> turnaround time</a> </p> <a href="https://publications.waset.org/abstracts/160706/incorporating-priority-round-robin-scheduler-to-sustain-indefinite-blocking-issue-and-prioritized-processes-in-operating-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160706.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3369</span> A Computational Cost-Effective Clustering Algorithm in Multidimensional Space Using the Manhattan Metric: Application to the Global Terrorism Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Semeh%20Ben%20Salem">Semeh Ben Salem</a>, <a href="https://publications.waset.org/abstracts/search?q=Sami%20Naouali"> Sami Naouali</a>, <a href="https://publications.waset.org/abstracts/search?q=Moetez%20Sallami"> Moetez Sallami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The increasing amount of collected data has limited the performance of the current analyzing algorithms. Thus, developing new cost-effective algorithms in terms of complexity, scalability, and accuracy raised significant interests. In this paper, a modified effective <em>k</em>-means based algorithm is developed and experimented. The new algorithm aims to reduce the computational load without significantly affecting the quality of the clusterings. The algorithm uses the City Block distance and a new stop criterion to guarantee the convergence. Conducted experiments on a real data set show its high performance when compared with the original <em>k</em>-means version. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pattern%20recognition" title="pattern recognition">pattern recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20terrorism%20database" title=" global terrorism database"> global terrorism database</a>, <a href="https://publications.waset.org/abstracts/search?q=Manhattan%20distance" title=" Manhattan distance"> Manhattan distance</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=terrorism%20data%20analysis" title=" terrorism data analysis"> terrorism data analysis</a> </p> <a href="https://publications.waset.org/abstracts/72016/a-computational-cost-effective-clustering-algorithm-in-multidimensional-space-using-the-manhattan-metric-application-to-the-global-terrorism-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72016.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">386</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">3368</span> Parameter Estimation of Induction Motors by PSO Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Mohammadi">A. Mohammadi</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Asghari"> S. Asghari</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Aien"> M. Aien</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Rashidinejad"> M. Rashidinejad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> After emergent of alternative current networks and their popularity, asynchronous motors became more widespread than other kinds of industrial motors. In order to control and run these motors efficiently, an accurate estimation of motor parameters is needed. There are different methods to obtain these parameters such as rotor locked test, no load test, DC test, analytical methods, and so on. The most common drawback of these methods is their inaccuracy in estimation of some motor parameters. In order to remove this concern, a novel method for parameter estimation of induction motors using particle swarm optimization (PSO) algorithm is proposed. In the proposed method, transient state of motor is used for parameter estimation. Comparison of the simulation results purtuined to the PSO algorithm with other available methods justifies the effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=induction%20motor" title="induction motor">induction motor</a>, <a href="https://publications.waset.org/abstracts/search?q=motor%20parameter%20estimation" title=" motor parameter estimation"> motor parameter estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=PSO%20algorithm" title=" PSO algorithm"> PSO algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=analytical%20method" title=" analytical method"> analytical method</a> </p> <a href="https://publications.waset.org/abstracts/15433/parameter-estimation-of-induction-motors-by-pso-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15433.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">633</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">3367</span> Dual Band Antenna Design with Compact Radiator for 2.5/5.2/5.8 Ghz Wlan Application Using Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramnath%20Narhete">Ramnath Narhete</a>, <a href="https://publications.waset.org/abstracts/search?q=Saket%20Pandey"> Saket Pandey</a>, <a href="https://publications.waset.org/abstracts/search?q=Puran%20Gour"> Puran Gour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents of dual-band planner antenna with a compact radiator for 2.4/5.2/5.8 proposed by optimizing its resonant frequency, Bandwidth of operation and radiation frequency using the genetic algorithm. The antenna consists L-shaped and E-shaped radiating element to generate two resonant modes for dual band operation. The above techniques have been successfully used in many applications. Dual band antenna with the compact radiator for 2.4/5.2/5.8 GHz WLAN application design and radiator size only width 8mm and a length is 11.3 mm. The antenna can we used for various application in the field of communication. Genetic algorithm will be used to design the antenna and impedance matching network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-band%20E" title=" dual-band E"> dual-band E</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-band%20L" title=" dual-band L"> dual-band L</a>, <a href="https://publications.waset.org/abstracts/search?q=WLAN" title=" WLAN"> WLAN</a>, <a href="https://publications.waset.org/abstracts/search?q=compact%20radiator" title=" compact radiator"> compact radiator</a> </p> <a href="https://publications.waset.org/abstracts/28512/dual-band-antenna-design-with-compact-radiator-for-255258-ghz-wlan-application-using-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28512.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">579</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">3366</span> Mutual Information Based Image Registration of Satellite Images Using PSO-GA Hybrid Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dipti%20Patra">Dipti Patra</a>, <a href="https://publications.waset.org/abstracts/search?q=Guguloth%20Uma"> Guguloth Uma</a>, <a href="https://publications.waset.org/abstracts/search?q=Smita%20Pradhan"> Smita Pradhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Registration is a fundamental task in image processing. It is used to transform different sets of data into one coordinate system, where data are acquired from different times, different viewing angles, and/or different sensors. The registration geometrically aligns two images (the reference and target images). Registration techniques are used in satellite images and it is important in order to be able to compare or integrate the data obtained from these different measurements. In this work, mutual information is considered as a similarity metric for registration of satellite images. The transformation is assumed to be a rigid transformation. An attempt has been made here to optimize the transformation function. The proposed image registration technique hybrid PSO-GA incorporates the notion of Particle Swarm Optimization and Genetic Algorithm and is used for finding the best optimum values of transformation parameters. The performance comparision obtained with the experiments on satellite images found that the proposed hybrid PSO-GA algorithm outperforms the other algorithms in terms of mutual information and registration accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20registration" title="image registration">image registration</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20PSO-GA%20algorithm%20and%20mutual%20information" title=" hybrid PSO-GA algorithm and mutual information"> hybrid PSO-GA algorithm and mutual information</a> </p> <a href="https://publications.waset.org/abstracts/9683/mutual-information-based-image-registration-of-satellite-images-using-pso-ga-hybrid-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9683.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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3365</span> Intrusion Detection Based on Graph Oriented Big Data Analytics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahlem%20Abid">Ahlem Abid</a>, <a href="https://publications.waset.org/abstracts/search?q=Farah%20%20Jemili"> Farah Jemili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intrusion detection has been the subject of numerous studies in industry and academia, but cyber security analysts always want greater precision and global threat analysis to secure their systems in cyberspace. To improve intrusion detection system, the visualisation of the security events in form of graphs and diagrams is important to improve the accuracy of alerts. In this paper, we propose an approach of an IDS based on cloud computing, big data technique and using a machine learning graph algorithm which can detect in real time different attacks as early as possible. We use the MAWILab intrusion detection dataset . We choose Microsoft Azure as a unified cloud environment to load our dataset on. We implement the k2 algorithm which is a graphical machine learning algorithm to classify attacks. Our system showed a good performance due to the graphical machine learning algorithm and spark structured streaming engine. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Apache%20Spark%20Streaming" title="Apache Spark Streaming">Apache Spark Streaming</a>, <a href="https://publications.waset.org/abstracts/search?q=Graph" title=" Graph"> Graph</a>, <a href="https://publications.waset.org/abstracts/search?q=Intrusion%20detection" title=" Intrusion detection"> Intrusion detection</a>, <a href="https://publications.waset.org/abstracts/search?q=k2%20algorithm" title=" k2 algorithm"> k2 algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=Machine%20Learning" title=" Machine Learning"> Machine Learning</a>, <a href="https://publications.waset.org/abstracts/search?q=MAWILab" title=" MAWILab"> MAWILab</a>, <a href="https://publications.waset.org/abstracts/search?q=Microsoft%20Azure%20Cloud" title=" Microsoft Azure Cloud"> Microsoft Azure Cloud</a> </p> <a href="https://publications.waset.org/abstracts/127073/intrusion-detection-based-on-graph-oriented-big-data-analytics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127073.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">146</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">3364</span> Review of Different Machine Learning Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Romat%20Ali%20Shah">Syed Romat Ali Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Shoaib"> Bilal Shoaib</a>, <a href="https://publications.waset.org/abstracts/search?q=Saleem%20Akhtar"> Saleem Akhtar</a>, <a href="https://publications.waset.org/abstracts/search?q=Munib%20Ahmad"> Munib Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahan%20Sadiqui"> Shahan Sadiqui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Classification is a data mining technique, which is recognizedon Machine Learning (ML) algorithm. It is used to classifythe individual articlein a knownofinformation into a set of predefinemodules or group. Web mining is also a portion of that sympathetic of data mining methods. The main purpose of this paper to analysis and compare the performance of Naïve Bayse Algorithm, Decision Tree, K-Nearest Neighbor (KNN), Artificial Neural Network (ANN)and Support Vector Machine (SVM). This paper consists of different ML algorithm and their advantages and disadvantages and also define research issues. <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=Web%20Mining" title=" Web Mining"> Web Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=ML%20Algorithms" title=" ML Algorithms"> ML Algorithms</a> </p> <a href="https://publications.waset.org/abstracts/124105/review-of-different-machine-learning-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124105.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">303</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">3363</span> Modern Imputation Technique for Missing Data in Linear Functional Relationship Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adilah%20Abdul%20Ghapor">Adilah Abdul Ghapor</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong%20Zulina%20Zubairi"> Yong Zulina Zubairi</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahmatullah%20Imon"> Rahmatullah Imon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Missing value problem is common in statistics and has been of interest for years. This article considers two modern techniques in handling missing data for linear functional relationship model (LFRM) namely the Expectation-Maximization (EM) algorithm and Expectation-Maximization with Bootstrapping (EMB) algorithm using three performance indicators; namely the mean absolute error (MAE), root mean square error (RMSE) and estimated biased (EB). In this study, we applied the methods of imputing missing values in the LFRM. Results of the simulation study suggest that EMB algorithm performs much better than EM algorithm in both models. We also illustrate the applicability of the approach in a real data set. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=expectation-maximization" title="expectation-maximization">expectation-maximization</a>, <a href="https://publications.waset.org/abstracts/search?q=expectation-maximization%20with%20bootstrapping" title=" expectation-maximization with bootstrapping"> expectation-maximization with bootstrapping</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20functional%20relationship%20model" title=" linear functional relationship model"> linear functional relationship model</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20indicators" title=" performance indicators"> performance indicators</a> </p> <a href="https://publications.waset.org/abstracts/44261/modern-imputation-technique-for-missing-data-in-linear-functional-relationship-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44261.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">399</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">3362</span> Tank Barrel Surface Damage Detection Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tom%C3%A1%C5%A1%20Dyk">Tomáš Dyk</a>, <a href="https://publications.waset.org/abstracts/search?q=Stanislav%20Proch%C3%A1zka"> Stanislav Procházka</a>, <a href="https://publications.waset.org/abstracts/search?q=Martin%20Drahansk%C3%BD"> Martin Drahanský</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article proposes a new algorithm for detecting damaged areas of the tank barrel based on the image of the inner surface of the tank barrel. Damage position is calculated using image processing techniques such as edge detection, discrete wavelet transformation and image segmentation for accurate contour detection. The algorithm can detect surface damage in smoothbore and even in rifled tank barrels. The algorithm also calculates the volume of the detected damage from the depth map generated, for example, from the distance measurement unit. The proposed method was tested on data obtained by a tank barrel scanning device, which generates both surface image data and depth map. The article also discusses tank barrel scanning devices and how damaged surface impacts material resistance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=barrel" title="barrel">barrel</a>, <a href="https://publications.waset.org/abstracts/search?q=barrel%20diagnostic" title=" barrel diagnostic"> barrel diagnostic</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=surface%20damage%20detection" title=" surface damage detection"> surface damage detection</a>, <a href="https://publications.waset.org/abstracts/search?q=tank" title=" tank"> tank</a> </p> <a href="https://publications.waset.org/abstracts/148441/tank-barrel-surface-damage-detection-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148441.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">137</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3361</span> DCT and Stream Ciphers for Improved Image Encryption Mechanism </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20R.%20Sharika">T. R. Sharika</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashwini%20Kumar"> Ashwini Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamal%20Bijlani"> Kamal Bijlani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption is the process of converting crucial information’s unreadable to unauthorized persons. Image security is an important type of encryption that secures all type of images from cryptanalysis. A stream cipher is a fast symmetric key algorithm which is used to convert plaintext to cipher text. In this paper we are proposing an image encryption algorithm with Discrete Cosine Transform and Stream Ciphers that can improve compression of images and enhanced security. The paper also explains the use of a shuffling algorithm for enhancing securing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=RC4%20cipher" title=" RC4 cipher"> RC4 cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a> </p> <a href="https://publications.waset.org/abstracts/32780/dct-and-stream-ciphers-for-improved-image-encryption-mechanism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32780.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">361</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">3360</span> Dual-Channel Multi-Band Spectral Subtraction Algorithm Dedicated to a Bilateral Cochlear Implant</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fathi%20Kallel">Fathi Kallel</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Ben%20Hamida"> Ahmed Ben Hamida</a>, <a href="https://publications.waset.org/abstracts/search?q=Christian%20Berger-Vachon"> Christian Berger-Vachon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a Speech Enhancement Algorithm based on Multi-Band Spectral Subtraction (MBSS) principle is evaluated for Bilateral Cochlear Implant (BCI) users. Specifically, dual-channel noise power spectral estimation algorithm using Power Spectral Densities (PSD) and Cross Power Spectral Densities (CPSD) of the observed signals is studied. The enhanced speech signal is obtained using Dual-Channel Multi-Band Spectral Subtraction ‘DC-MBSS’ algorithm. For performance evaluation, objective speech assessment test relying on Perceptual Evaluation of Speech Quality (PESQ) score is performed to fix the optimal number of frequency bands needed in DC-MBSS algorithm. In order to evaluate the speech intelligibility, subjective listening tests are assessed with 3 deafened BCI patients. Experimental results obtained using French Lafon database corrupted by an additive babble noise at different Signal-to-Noise Ratios (SNR) showed that DC-MBSS algorithm improves speech understanding for single and multiple interfering noise sources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=speech%20enhancement" title="speech enhancement">speech enhancement</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20substracion" title=" spectral substracion"> spectral substracion</a>, <a href="https://publications.waset.org/abstracts/search?q=noise%20estimation" title=" noise estimation"> noise estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=cochlear%20impalnt" title=" cochlear impalnt"> cochlear impalnt</a> </p> <a href="https://publications.waset.org/abstracts/18785/dual-channel-multi-band-spectral-subtraction-algorithm-dedicated-to-a-bilateral-cochlear-implant" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18785.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3359</span> Recognition of Tifinagh Characters with Missing Parts Using Neural Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=El%20Mahdi%20Barrah">El Mahdi Barrah</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20Safi"> Said Safi</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdessamad%20Malaoui"> Abdessamad Malaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present an algorithm for reconstruction from incomplete 2D scans for tifinagh characters. This algorithm is based on using correlation between the lost block and its neighbors. This system proposed contains three main parts: pre-processing, features extraction and recognition. In the first step, we construct a database of tifinagh characters. In the second step, we will apply “shape analysis algorithm”. In classification part, we will use Neural Network. The simulation results demonstrate that the proposed method give good results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tifinagh%20character%20recognition" title="Tifinagh character recognition">Tifinagh character recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20cost%20computation" title=" local cost computation"> local cost computation</a>, <a href="https://publications.waset.org/abstracts/search?q=ANN" title=" ANN"> ANN</a> </p> <a href="https://publications.waset.org/abstracts/45178/recognition-of-tifinagh-characters-with-missing-parts-using-neural-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45178.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">334</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">3358</span> Reliability Improvement of Power System Networks Using Adaptive Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alireza%20Alesaadi">Alireza Alesaadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reliability analysis is a powerful method for determining the weak points of the electrical networks. In designing of electrical network, it is tried to design the most reliable network with minimal system shutting down, but it is usually associated with increasing the cost. In this paper, using adaptive genetic algorithm, a method was presented that provides the most reliable system with a certain economical cost. Finally, the proposed method is applied to a sample network and results will be analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20genetic%20algorithm" title=" adaptive genetic algorithm"> adaptive genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=electrical%20network" title=" electrical network"> electrical network</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20engineering" title=" communication engineering"> communication engineering</a> </p> <a href="https://publications.waset.org/abstracts/6512/reliability-improvement-of-power-system-networks-using-adaptive-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6512.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">508</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3357</span> Design Data Sorter Circuit Using Insertion Sorting Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hoda%20Abugharsa">Hoda Abugharsa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we propose to design a sorter circuit using insertion sorting algorithm. The circuit will be designed using Algorithmic State Machines (ASM) method. That means converting the insertion sorting flowchart into an ASM chart. Then the ASM chart will be used to design the sorter circuit and the control unit. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=insert%20sorting%20algorithm" title="insert sorting algorithm">insert sorting algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=ASM%20chart" title=" ASM chart"> ASM chart</a>, <a href="https://publications.waset.org/abstracts/search?q=sorter%20circuit" title=" sorter circuit"> sorter circuit</a>, <a href="https://publications.waset.org/abstracts/search?q=state%20machine" title=" state machine"> state machine</a>, <a href="https://publications.waset.org/abstracts/search?q=control%20unit" title=" control unit"> control unit</a> </p> <a href="https://publications.waset.org/abstracts/5614/design-data-sorter-circuit-using-insertion-sorting-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5614.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">445</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">3356</span> Product Development in Company</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Giorgi%20Methodishvili">Giorgi Methodishvili</a>, <a href="https://publications.waset.org/abstracts/search?q=Iuliia%20Methodishvili"> Iuliia Methodishvili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper product development algorithm is used to determine the optimal management of financial resources in company. Aspects of financial management considered include put initial investment, examine all possible ways to solve the problem and the optimal rotation length of profit. The software of given problems is based using greedy algorithm. The obtained model and program maintenance enable us to define the optimal version of management of proper financial flows by using visual diagram on each level of investment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=management" title="management">management</a>, <a href="https://publications.waset.org/abstracts/search?q=software" title=" software"> software</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal" title=" optimal"> optimal</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20algorithm" title=" greedy algorithm"> greedy algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-diagram" title=" graph-diagram"> graph-diagram</a> </p> <a href="https://publications.waset.org/abstracts/182730/product-development-in-company" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182730.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">56</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=7" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&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=BP%20algorithm&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=7">7</a></li> <li class="page-item active"><span class="page-link">8</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=11">11</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=BP%20algorithm&page=119">119</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=120">120</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=BP%20algorithm&page=9" 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>