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: modified simplex algorithm</title> <meta name="description" content="Search results for: modified simplex algorithm"> <meta name="keywords" content="modified simplex 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="modified simplex 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="modified simplex 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> 5883</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: modified simplex algorithm</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5883</span> Optimal Cropping Pattern in an Irrigation Project: A Hybrid Model of Artificial Neural Network and Modified Simplex Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safayat%20Ali%20Shaikh">Safayat Ali Shaikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software has been developed for optimal cropping pattern in an irrigation project considering land constraint, water availability constraint and pick up flow constraint using modified Simplex Algorithm. Artificial Neural Network Models (ANN) have been developed to predict rainfall. AR (1) model used to generate 1000 years rainfall data to train the ANN. Simulation has been done with expected rainfall data. Eight number crops and three types of soil class have been considered for optimization model. Area under each crop and each soil class have been quantified using Modified Simplex Algorithm to get optimum net return. Efficacy of the software has been tested using data of large irrigation project in India. <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=large%20irrigation%20project" title=" large irrigation project"> large irrigation project</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm" title=" modified simplex algorithm"> modified simplex algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20cropping%20pattern" title=" optimal cropping pattern"> optimal cropping pattern</a> </p> <a href="https://publications.waset.org/abstracts/71956/optimal-cropping-pattern-in-an-irrigation-project-a-hybrid-model-of-artificial-neural-network-and-modified-simplex-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71956.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">203</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">5882</span> Genomic Identification of Anisakis Simplex Larvae by PCR-RAPD</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fumiko%20Kojima">Fumiko Kojima</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuji%20Fujimoto"> Shuji Fujimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Anisakiasis is a disease caused by infection with an anisakid larvae, mostly Anisakis simplex. The larvae commonly infect in marine fish and the disease is frequently reported in areas of the world where fish is consumed raw, lightly pickled or salted. In Japan, people have the habit of eating raw fish such as ‘sushi’ or ‘sashimi’, so they have more chance of infection with larvae of anisakid nematodes. There are three sibling species in A. simplex larvae, namely, A. simplex sensu stricto (Asss), A. pegreffii (Ap) and A. simplex C. It was revealed that Ap is dominant among the larvae from fish (Scomber japonics) in the Japan Sea side and Asss is dominant among those of the Pacific Ocean side conversely. Although anisakiasis has happened in Japan among both the Japan Sea side area and the Pacific Ocean side area. The aim of this study was to investigate genetic variations between the siblings (Asss and Ap) and within the same sibling species by random amplified polymorphic DNA (RAPD) technique. In order to investigate the genetic difference among the each A. simplex larvae, we used RAPD technique to differentiate individuals of A. simplex obtained from Scomber japonics fish those were caught in the Japan sea (Goto Islands in Nagasaki Prefecture) and the cost of Pacific Ocean (Kanagawa Prefecture). The RAPD patterns of the control DNA (Genus Raphidascaris) were markedly different from those of the A. simplex. There were differences in amplification patterns between Asss and Ap. The RAPD patterns for larvae obtained from fish of the same sea were somewhat different and variations were detected even among larvae from the same fish. These results suggest the considerable high genetic variability between Asss and Ap and the possible existence of genetic variation within the sibling species. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anisakiasis%20in%20Japan" title="Anisakiasis in Japan">Anisakiasis in Japan</a>, <a href="https://publications.waset.org/abstracts/search?q=Anisakis%20simplex" title=" Anisakis simplex"> Anisakis simplex</a>, <a href="https://publications.waset.org/abstracts/search?q=genomic%20identification" title=" genomic identification"> genomic identification</a>, <a href="https://publications.waset.org/abstracts/search?q=PCR-RAPD" title=" PCR-RAPD"> PCR-RAPD</a> </p> <a href="https://publications.waset.org/abstracts/55789/genomic-identification-of-anisakis-simplex-larvae-by-pcr-rapd" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55789.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">181</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5881</span> Virtual Dimension Analysis of Hyperspectral Imaging to Characterize a Mining Sample</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=L.%20Chevez">L. Chevez</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Apaza"> A. Apaza</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Rodriguez"> J. Rodriguez</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Puga"> R. Puga</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Loro"> H. Loro</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20Z.%20Davalos"> Juan Z. Davalos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Virtual Dimension (VD) procedure is used to analyze Hyperspectral Image (HIS) treatment-data in order to estimate the abundance of mineral components of a mining sample. Hyperspectral images coming from reflectance spectra (NIR region) are pre-treated using Standard Normal Variance (SNV) and Minimum Noise Fraction (MNF) methodologies. The endmember components are identified by the Simplex Growing Algorithm (SVG) and after adjusted to the reflectance spectra of reference-databases using Simulated Annealing (SA) methodology. The obtained abundance of minerals of the sample studied is very near to the ones obtained using XRD with a total relative error of 2%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20imaging" title="hyperspectral imaging">hyperspectral imaging</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20noise%20fraction" title=" minimum noise fraction"> minimum noise fraction</a>, <a href="https://publications.waset.org/abstracts/search?q=MNF" title=" MNF"> MNF</a>, <a href="https://publications.waset.org/abstracts/search?q=simplex%20growing%20algorithm" title=" simplex growing algorithm"> simplex growing algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=SGA" title=" SGA"> SGA</a>, <a href="https://publications.waset.org/abstracts/search?q=standard%20normal%20variance" title=" standard normal variance"> standard normal variance</a>, <a href="https://publications.waset.org/abstracts/search?q=SNV" title=" SNV"> SNV</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20dimension" title=" virtual dimension"> virtual dimension</a>, <a href="https://publications.waset.org/abstracts/search?q=XRD" title=" XRD"> XRD</a> </p> <a href="https://publications.waset.org/abstracts/131834/virtual-dimension-analysis-of-hyperspectral-imaging-to-characterize-a-mining-sample" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131834.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">158</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">5880</span> Modified Active (MA) Algorithm to Generate Semantic Web Related Clustered Hierarchy for Keyword Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Leena%20Giri">G. Leena Giri</a>, <a href="https://publications.waset.org/abstracts/search?q=Archana%20Mathur"> Archana Mathur</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Manjula"> S. H. Manjula</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20R.%20Venugopal"> K. R. Venugopal</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20M.%20Patnaik"> L. M. Patnaik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Keyword search in XML documents is based on the notion of lowest common ancestors in the labelled trees model of XML documents and has recently gained a lot of research interest in the database community. In this paper, we propose the Modified Active (MA) algorithm which is an improvement over the active clustering algorithm by taking into consideration the entity aspect of the nodes to find the level of the node pertaining to a particular keyword input by the user. A portion of the bibliography database is used to experimentally evaluate the modified active algorithm and results show that it performs better than the active algorithm. Our modification improves the response time of the system and thereby increases the efficiency of the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=keyword%20matching%20patterns" title="keyword matching patterns">keyword matching patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=MA%20algorithm" title=" MA algorithm"> MA algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20search" title=" semantic search"> semantic search</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20management" title=" knowledge management"> knowledge management</a> </p> <a href="https://publications.waset.org/abstracts/6608/modified-active-ma-algorithm-to-generate-semantic-web-related-clustered-hierarchy-for-keyword-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6608.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">413</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">5879</span> Soil Parameters Identification around PMT Test by Inverse Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20Toumi">I. Toumi</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Abed"> Y. Abed</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Bouafia"> A. Bouafia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a methodology for identifying the cohesive soil parameters that takes into account different constitutive equations. The procedure, applied to identify the parameters of generalized Prager model associated to the Drucker & Prager failure criterion from a pressuremeter expansion curve, is based on an inverse analysis approach, which consists of minimizing the function representing the difference between the experimental curve and the simulated curve using a simplex algorithm. The model response on pressuremeter path and its identification from experimental data lead to the determination of the friction angle, the cohesion and the Young modulus. Some parameters effects on the simulated curves and stresses path around pressuremeter probe are presented. Comparisons between the parameters determined with the proposed method and those obtained by other means are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cohesive%20soils" title="cohesive soils">cohesive soils</a>, <a href="https://publications.waset.org/abstracts/search?q=cavity%20expansion" title=" cavity expansion"> cavity expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=pressuremeter%20test" title=" pressuremeter test"> pressuremeter test</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20procedure" title=" optimization procedure"> optimization procedure</a>, <a href="https://publications.waset.org/abstracts/search?q=simplex%20algorithm" title=" simplex algorithm"> simplex algorithm</a> </p> <a href="https://publications.waset.org/abstracts/49462/soil-parameters-identification-around-pmt-test-by-inverse-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49462.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">294</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">5878</span> Mathematical Model of the Spread of Herpes Simplex Virus Type-2 in Heterosexual Relations with and without Condom Usage in a College Population</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jacob%20A.%20Braun">Jacob A. Braun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper uses mathematical modeling to show the spread of Herpes Simplex type-2 with and without the usage of condoms in a college population. The model uses four differential equations to calculate the data for the simulation. The dt increment used is one week. It also runs based on a fixated period. The period chosen was five years to represent time spent in college. The average age of the individual is 21, once again to represent the age of someone in college. In the total population, there are almost two times as many women who have Herpes Simplex Type-2 as men. Additionally, Herpes Simplex Type-2 does not have a known cure. The goal of the model is to show how condom usage affects women’s chances of receiving the virus in the hope of being able to reduce the number of women infected. In the end, the model demonstrates that condoms offer significant protection to women from the virus. Since fewer women are infected with the virus when condoms are used, in turn, fewer males are infected. Since Herpes Simplex Type-2 affects the carrier for their whole life, a small decrease of infections could lead to large ramifications over time. Specifically, a small decrease of infections at a young age, such as college, could have a very big effect on the long-term number of people infected with the virus. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=college" title="college">college</a>, <a href="https://publications.waset.org/abstracts/search?q=condom" title=" condom"> condom</a>, <a href="https://publications.waset.org/abstracts/search?q=Herpes" title=" Herpes"> Herpes</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20modelling" title=" mathematical modelling "> mathematical modelling </a> </p> <a href="https://publications.waset.org/abstracts/129084/mathematical-model-of-the-spread-of-herpes-simplex-virus-type-2-in-heterosexual-relations-with-and-without-condom-usage-in-a-college-population" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129084.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">216</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">5877</span> A Prediction Model of Adopting IPTV</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jeonghwan%20Jeon">Jeonghwan Jeon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the advent of IPTV in the fierce competition with existing broadcasting system, it is emerged as an important issue to predict how much the adoption of IPTV service will be. This paper aims to suggest a prediction model for adopting IPTV using classification and Ranking Belief Simplex (CaRBS). A simplex plot method of representing data allows a clear visual representation to the degree of interaction of the support from the variables to the prediction of the objects. CaRBS is applied to the survey data on the IPTV adoption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prediction" title="prediction">prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=adoption" title=" adoption"> adoption</a>, <a href="https://publications.waset.org/abstracts/search?q=IPTV" title=" IPTV"> IPTV</a>, <a href="https://publications.waset.org/abstracts/search?q=CaRBS" title=" CaRBS"> CaRBS</a> </p> <a href="https://publications.waset.org/abstracts/2971/a-prediction-model-of-adopting-iptv" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2971.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">412</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">5876</span> Optimizing Human Diet Problem Using Linear Programming Approach: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Priyanka">P. Priyanka</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Shruthi"> S. Shruthi</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Guruprasad"> N. Guruprasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Health is a common theme in most cultures. In fact all communities have their concepts of health, as part of their culture. Health continues to be a neglected entity. Planning of Human diet should be done very careful by selecting the food items or groups of food items also the composition involved. Low price and good taste of foods are regarded as two major factors for optimal human nutrition. Linear programming techniques have been extensively used for human diet formulation for quiet good number of years. Through the process, we mainly apply “The Simplex Method” which is a very useful statistical tool based on the theorem of Elementary Row Operation from Linear Algebra and also incorporate some other necessary rules set by the Simplex Method to help solve the problem. The study done by us is an attempt to develop a programming model for optimal planning and best use of nutrient ingredients. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=diet%20formulation" title="diet formulation">diet formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=nutrient%20ingredients" title=" nutrient ingredients"> nutrient ingredients</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=simplex%20method" title=" simplex method"> simplex method</a> </p> <a href="https://publications.waset.org/abstracts/19161/optimizing-human-diet-problem-using-linear-programming-approach-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19161.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">558</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">5875</span> Anterior Uveitis Caused by Infection with Cytomegalovirus and Herpes Simplex Virus Type I at Cicendo Eye Hospital Bandung</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shinta%20Stri%20Ayuda%20Nur%20Setyaningsih">Shinta Stri Ayuda Nur Setyaningsih</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Anterior uveitis is often triggered by viral infections such as herpes simplex virus (HSV) and cytomegalovirus (CMV). This study aims to provide an overview of the demographic and clinical characteristics of patients with anterior uveitis caused by CMV and HSV infection at PMN Cicendo Eye Hospital Bandung. This study used a retrospective observational method. Data were collected from the medical records of patients who visited the PMN Infection and Immunology Polyclinic at Cicendo Eye Hospital between February and July 2023. The results showed that anterior uveitis associated with HSV and CMV viruses often occurs in the elderly and more in women. The most common clinical symptoms are red eyes and decreased visual acuity, with a gradual onset of symptoms. Complications that often arise are cataracts and glaucoma. This study provides a deeper understanding of anterior uveitis caused by infection with HSV and CMV viruses. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uveitis%20anterior" title="uveitis anterior">uveitis anterior</a>, <a href="https://publications.waset.org/abstracts/search?q=cytomegavirus" title=" cytomegavirus"> cytomegavirus</a>, <a href="https://publications.waset.org/abstracts/search?q=herpes%20simplex%20virus%20type%20I%20ELISA" title=" herpes simplex virus type I ELISA"> herpes simplex virus type I ELISA</a> </p> <a href="https://publications.waset.org/abstracts/173938/anterior-uveitis-caused-by-infection-with-cytomegalovirus-and-herpes-simplex-virus-type-i-at-cicendo-eye-hospital-bandung" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173938.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">83</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">5874</span> A Multidimensional Genetic Algorithm Applicable for Our VRP Variant Dealing with the Problems of Infrastructure Defaults SVRDP-CMTW: “Safety Vehicle Routing Diagnosis Problem with Control and Modified Time Windows”</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ben%20Mansour%20Mouin">Ben Mansour Mouin</a>, <a href="https://publications.waset.org/abstracts/search?q=Elloumi%20Abdelkarim"> Elloumi Abdelkarim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We will discuss the problem of routing a fleet of different vehicles from a central depot to different types of infrastructure-defaults with dynamic maintenance requests, modified time windows, and control of default maintained. For this reason, we propose a modified metaheuristicto to solve our mathematical model. SVRDP-CMTW is a variant VRP of an optimal vehicle plan that facilitates the maintenance task of different types of infrastructure-defaults. This task will be monitored after the maintenance, based on its priorities, the degree of danger associated with each default, and the neighborhood at the black-spots. We will present, in this paper, a multidimensional genetic algorithm “MGA” by detailing its characteristics, proposed mechanisms, and roles in our work. The coding of this algorithm represents the necessary parameters that characterize each infrastructure-default with the objective of minimizing a combination of cost, distance and maintenance times while satisfying the priority levels of the most urgent defaults. The developed algorithm will allow the dynamic integration of newly detected defaults at the execution time. This result will be displayed in our programmed interactive system at the routing time. This multidimensional genetic algorithm replaces N genetic algorithm to solve P different type problems of infrastructure defaults (instead of N algorithm for P problem we can solve in one multidimensional algorithm simultaneously who can solve all these problemsatonce). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mathematical%20model" title="mathematical model">mathematical model</a>, <a href="https://publications.waset.org/abstracts/search?q=VRP" title=" VRP"> VRP</a>, <a href="https://publications.waset.org/abstracts/search?q=multidimensional%20genetic%20algorithm" title=" multidimensional genetic algorithm"> multidimensional genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a> </p> <a href="https://publications.waset.org/abstracts/141979/a-multidimensional-genetic-algorithm-applicable-for-our-vrp-variant-dealing-with-the-problems-of-infrastructure-defaults-svrdp-cmtw-safety-vehicle-routing-diagnosis-problem-with-control-and-modified-time-windows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141979.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">196</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">5873</span> Collocation Method Using Quartic B-Splines for Solving the Modified RLW Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20Soliman">A. A. Soliman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Modified Regularized Long Wave (MRLW) equation is solved numerically by giving a new algorithm based on collocation method using quartic B-splines at the mid-knot points as element shape. Also, we use the fourth Runge-Kutta method for solving the system of first order ordinary differential equations instead of finite difference method. Our test problems, including the migration and interaction of solitary waves, are used to validate the algorithm which is found to be accurate and efficient. The three invariants of the motion are evaluated to determine the conservation properties of the algorithm. The temporal evaluation of a Maxwellian initial pulse is then studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=collocation%20method" title="collocation method">collocation method</a>, <a href="https://publications.waset.org/abstracts/search?q=MRLW%20equation" title=" MRLW equation"> MRLW equation</a>, <a href="https://publications.waset.org/abstracts/search?q=Quartic%20B-splines" title=" Quartic B-splines"> Quartic B-splines</a>, <a href="https://publications.waset.org/abstracts/search?q=solitons" title=" solitons"> solitons</a> </p> <a href="https://publications.waset.org/abstracts/7664/collocation-method-using-quartic-b-splines-for-solving-the-modified-rlw-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7664.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">5872</span> Global Convergence of a Modified Three-Term Conjugate Gradient Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Belloufi%20Mohammed">Belloufi Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Sellami%20Badreddine"> Sellami Badreddine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with a new nonlinear modified three-term conjugate gradient algorithm for solving large-scale unstrained optimization problems. The search direction of the algorithms from this class has three terms and is computed as modifications of the classical conjugate gradient algorithms to satisfy both the descent and the conjugacy conditions. An example of three-term conjugate gradient algorithm from this class, as modifications of the classical and well known Hestenes and Stiefel or of the CG_DESCENT by Hager and Zhang conjugate gradient algorithms, satisfying both the descent and the conjugacy conditions is presented. Under mild conditions, we prove that the modified three-term conjugate gradient algorithm with Wolfe type line search is globally convergent. Preliminary numerical results show the proposed method is very promising. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=three-term%20conjugate%20gradient" title=" three-term conjugate gradient"> three-term conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search" title=" line search"> line search</a> </p> <a href="https://publications.waset.org/abstracts/41727/global-convergence-of-a-modified-three-term-conjugate-gradient-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41727.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">375</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5871</span> An Accurate Method for Phylogeny Tree Reconstruction Based on a Modified Wild Dog Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Essam%20Al%20Daoud">Essam Al Daoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study solves a phylogeny problem by using modified wild dog pack optimization. The least squares error is considered as a cost function that needs to be minimized. Therefore, in each iteration, new distance matrices based on the constructed trees are calculated and used to select the alpha dog. To test the suggested algorithm, ten homologous genes are selected and collected from National Center for Biotechnology Information (NCBI) databanks (i.e., 16S, 18S, 28S, Cox 1, ITS1, ITS2, ETS, ATPB, Hsp90, and STN). The data are divided into three categories: 50 taxa, 100 taxa and 500 taxa. The empirical results show that the proposed algorithm is more reliable and accurate than other implemented methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=least%20square" title="least square">least square</a>, <a href="https://publications.waset.org/abstracts/search?q=neighbor%20joining" title=" neighbor joining"> neighbor joining</a>, <a href="https://publications.waset.org/abstracts/search?q=phylogenetic%20tree" title=" phylogenetic tree"> phylogenetic tree</a>, <a href="https://publications.waset.org/abstracts/search?q=wild%20dog%20pack" title=" wild dog pack"> wild dog pack</a> </p> <a href="https://publications.waset.org/abstracts/42453/an-accurate-method-for-phylogeny-tree-reconstruction-based-on-a-modified-wild-dog-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42453.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">320</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">5870</span> Modification of Rk Equation of State for Liquid and Vapor of Ammonia by Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Mousavian">S. Mousavian</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Mousavian"> F. Mousavian</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20Nikkhah%20Rashidabad"> V. Nikkhah Rashidabad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cubic equations of state like Redlich–Kwong (RK) EOS have been proved to be very reliable tools in the prediction of phase behavior. Despite their good performance in compositional calculations, they usually suffer from weaknesses in the predictions of saturated liquid density. In this research, RK equation was modified. The result of this study shows that modified equation has good agreement with experimental data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=equation%20of%20state" title="equation of state">equation of state</a>, <a href="https://publications.waset.org/abstracts/search?q=modification" title=" modification"> modification</a>, <a href="https://publications.waset.org/abstracts/search?q=ammonia" title=" ammonia"> ammonia</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/2790/modification-of-rk-equation-of-state-for-liquid-and-vapor-of-ammonia-by-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2790.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">382</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5869</span> Modified Bat Algorithm for Economic Load Dispatch Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daljinder%20Singh">Daljinder Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=J.S.Dhillon"> J.S.Dhillon</a>, <a href="https://publications.waset.org/abstracts/search?q=Balraj%20Singh"> Balraj Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to no free lunch theorem, a single search technique cannot perform best in all conditions. Optimization method can be attractive choice to solve optimization problem that may have exclusive advantages like robust and reliable performance, global search capability, little information requirement, ease of implementation, parallelism, no requirement of differentiable and continuous objective function. In order to synergize between exploration and exploitation and to further enhance the performance of Bat algorithm, the paper proposed a modified bat algorithm that adds additional search procedure based on bat’s previous experience. The proposed algorithm is used for solving the economic load dispatch (ELD) problem. The practical constraint such valve-point loading along with power balance constraints and generator limit are undertaken. To take care of power demand constraint variable elimination method is exploited. The proposed algorithm is tested on various ELD problems. The results obtained show that the proposed algorithm is capable of performing better in majority of ELD problems considered and is at par with existing algorithms for some of problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bat%20algorithm" title="bat algorithm">bat algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20load%20dispatch" title=" economic load dispatch"> economic load dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=penalty%20method" title=" penalty method"> penalty method</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20elimination%20method" title=" variable elimination method"> variable elimination method</a> </p> <a href="https://publications.waset.org/abstracts/34397/modified-bat-algorithm-for-economic-load-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34397.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">459</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5868</span> Cash Flow Optimization on Synthetic CDOs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Timoth%C3%A9e%20Bligny">Timothée Bligny</a>, <a href="https://publications.waset.org/abstracts/search?q=Cl%C3%A9ment%20Codron"> Clément Codron</a>, <a href="https://publications.waset.org/abstracts/search?q=Antoine%20Estruch"> Antoine Estruch</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicolas%20Girodet"> Nicolas Girodet</a>, <a href="https://publications.waset.org/abstracts/search?q=Cl%C3%A9ment%20Ginet"> Clément Ginet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Collateralized Debt Obligations are not as widely used nowadays as they were before 2007 Subprime crisis. Nonetheless there remains an enthralling challenge to optimize cash flows associated with synthetic CDOs. A Gaussian-based model is used here in which default correlation and unconditional probabilities of default are highlighted. Then numerous simulations are performed based on this model for different scenarios in order to evaluate the associated cash flows given a specific number of defaults at different periods of time. Cash flows are not solely calculated on a single bought or sold tranche but rather on a combination of bought and sold tranches. With some assumptions, the simplex algorithm gives a way to find the maximum cash flow according to correlation of defaults and maturities. The used Gaussian model is not realistic in crisis situations. Besides present system does not handle buying or selling a portion of a tranche but only the whole tranche. However the work provides the investor with relevant elements on how to know what and when to buy and sell. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=synthetic%20collateralized%20debt%20obligation%20%28CDO%29" title="synthetic collateralized debt obligation (CDO)">synthetic collateralized debt obligation (CDO)</a>, <a href="https://publications.waset.org/abstracts/search?q=credit%20default%20swap%20%28CDS%29" title=" credit default swap (CDS)"> credit default swap (CDS)</a>, <a href="https://publications.waset.org/abstracts/search?q=cash%20flow%20optimization" title=" cash flow optimization"> cash flow optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=probability%20of%20default" title=" probability of default"> probability of default</a>, <a href="https://publications.waset.org/abstracts/search?q=default%20correlation" title=" default correlation"> default correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=strategies" title=" strategies"> strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=simplex" title=" simplex "> simplex </a> </p> <a href="https://publications.waset.org/abstracts/10900/cash-flow-optimization-on-synthetic-cdos" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10900.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">274</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">5867</span> A Modified NSGA-II Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a>, <a href="https://publications.waset.org/abstracts/search?q=Ozan%20Bahadir"> Ozan Bahadir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> NSGA-II is one of the most well-known and most widely used evolutionary algorithms. In addition to its new versions, such as NSGA-III, there are several modified types of this algorithm in the literature. In this paper, a hybrid NSGA-II algorithm has been suggested for solving the multi-objective flexible job shop scheduling problem. For a better search, new neighborhood-based crossover and mutation operators are defined. To create new generations, the neighbors of the selected individuals by the tournament selection are constructed. Also, at the end of each iteration, before sorting, neighbors of a certain number of good solutions are derived, except for solutions protected by elitism. The neighbors are generated using a constraint-based neural network that uses various constructs. The non-dominated sorting and crowding distance operators are same as the classic NSGA-II. A comparison based on some multi-objective benchmarks from the literature shows the efficiency of the algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop%20scheduling%20problem" title="flexible job shop scheduling problem">flexible job shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=NSGA-II%20algorithm" title=" NSGA-II algorithm"> NSGA-II algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=neighborhood%20structures" title=" neighborhood structures"> neighborhood structures</a> </p> <a href="https://publications.waset.org/abstracts/96824/a-modified-nsga-ii-algorithm-for-solving-multi-objective-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96824.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">229</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">5866</span> Hyperspectral Image Classification Using Tree Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shreya%20Pare">Shreya Pare</a>, <a href="https://publications.waset.org/abstracts/search?q=Parvin%20Akhter"> Parvin Akhter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Remotely sensing image classification becomes a very challenging task owing to the high dimensionality of hyperspectral images. The pixel-wise classification methods fail to take the spatial structure information of an image. Therefore, to improve the performance of classification, spatial information can be integrated into the classification process. In this paper, the multilevel thresholding algorithm based on a modified fuzzy entropy function is used to perform the segmentation of hyperspectral images. The fuzzy parameters of the MFE function have been optimized by using a new meta-heuristic algorithm based on the Tree-Search algorithm. The segmented image is classified by a large distribution machine (LDM) classifier. Experimental results are shown on a hyperspectral image dataset. The experimental outputs indicate that the proposed technique (MFE-TSA-LDM) achieves much higher classification accuracy for hyperspectral images when compared to state-of-art classification techniques. The proposed algorithm provides accurate segmentation and classification maps, thus becoming more suitable for image classification with large spatial structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20images" title=" hyperspectral images"> hyperspectral images</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20distribution%20margin" title=" large distribution margin"> large distribution margin</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20fuzzy%20entropy%20function" title=" modified fuzzy entropy function"> modified fuzzy entropy function</a>, <a href="https://publications.waset.org/abstracts/search?q=multilevel%20thresholding" title=" multilevel thresholding"> multilevel thresholding</a>, <a href="https://publications.waset.org/abstracts/search?q=tree%20search%20algorithm" title=" tree search algorithm"> tree search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20image%20classification%20using%20tree%20search%20algorithm" title=" hyperspectral image classification using tree search algorithm"> hyperspectral image classification using tree search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/143284/hyperspectral-image-classification-using-tree-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143284.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">177</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">5865</span> Multimodal Optimization of Density-Based Clustering Using Collective Animal Behavior Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kristian%20Bautista">Kristian Bautista</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruben%20A.%20Idoy"> Ruben A. Idoy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A bio-inspired metaheuristic algorithm inspired by the theory of collective animal behavior (CAB) was integrated to density-based clustering modeled as multimodal optimization problem. The algorithm was tested on synthetic, Iris, Glass, Pima and Thyroid data sets in order to measure its effectiveness relative to CDE-based Clustering algorithm. Upon preliminary testing, it was found out that one of the parameter settings used was ineffective in performing clustering when applied to the algorithm prompting the researcher to do an investigation. It was revealed that fine tuning distance δ3 that determines the extent to which a given data point will be clustered helped improve the quality of cluster output. Even though the modification of distance δ3 significantly improved the solution quality and cluster output of the algorithm, results suggest that there is no difference between the population mean of the solutions obtained using the original and modified parameter setting for all data sets. This implies that using either the original or modified parameter setting will not have any effect towards obtaining the best global and local animal positions. Results also suggest that CDE-based clustering algorithm is better than CAB-density clustering algorithm for all data sets. Nevertheless, CAB-density clustering algorithm is still a good clustering algorithm because it has correctly identified the number of classes of some data sets more frequently in a thirty trial run with a much smaller standard deviation, a potential in clustering high dimensional data sets. Thus, the researcher recommends further investigation in the post-processing stage of the algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering" title="clustering">clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=collective%20animal%20behavior%20algorithm" title=" collective animal behavior algorithm"> collective animal behavior algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=density-based%20%20clustering" title=" density-based clustering"> density-based clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodal%20optimization" title=" multimodal optimization"> multimodal optimization</a> </p> <a href="https://publications.waset.org/abstracts/94254/multimodal-optimization-of-density-based-clustering-using-collective-animal-behavior-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94254.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">230</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">5864</span> An Efficient Approach to Optimize the Cost and Profit of a Tea Garden by Using Branch and Bound Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abu%20Hashan%20Md%20Mashud">Abu Hashan Md Mashud</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharif%20Uddin"> M. Sharif Uddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Aminur%20Rahman%20Khan"> Aminur Rahman Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we formulate a new problem as a linear programming and Integer Programming problem and maximize profit within the limited budget and limited resources based on the construction of a tea garden problem. It describes a new idea about how to optimize profit and focuses on the practical aspects of modeling and the challenges of providing a solution to a complex real life problem. Finally, a comparative study is carried out among Graphical method, Simplex method and Branch and bound method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=tea%20garden" title=" tea garden"> tea garden</a>, <a href="https://publications.waset.org/abstracts/search?q=graphical%20method" title=" graphical method"> graphical method</a>, <a href="https://publications.waset.org/abstracts/search?q=simplex%20method" title=" simplex method"> simplex method</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound%20method" title=" branch and bound method"> branch and bound method</a> </p> <a href="https://publications.waset.org/abstracts/2584/an-efficient-approach-to-optimize-the-cost-and-profit-of-a-tea-garden-by-using-branch-and-bound-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2584.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">623</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">5863</span> Optimal Design of Concrete Shells by Modified Particle Community Algorithm Using Spinless Curves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reza%20%20Abbasi">Reza Abbasi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20%20Hamidi%20Benam"> Ahmad Hamidi Benam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Shell structures have many geometrical variables that modify some of these parameters to improve the mechanical behavior of the shell. On the other hand, the behavior of such structures depends on their geometry rather than on mass. Optimization techniques are useful in finding the geometrical shape of shell structures to improve mechanical behavior, especially to prevent or reduce bending anchors. The overall objective of this research is to optimize the shape of concrete shells using the thickness and height parameters along the reference curve and the overall shape of this curve. To implement the proposed scheme, the geometry of the structure was formulated using nonlinear curves. Shell optimization was performed under equivalent static loading conditions using the modified bird community algorithm. The results of this optimization show that without disrupting the initial design and with slight changes in the shell geometry, the structural behavior is significantly improved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=concrete%20shells" title="concrete shells">concrete shells</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20optimization" title=" shape optimization"> shape optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=spinless%20curves" title=" spinless curves"> spinless curves</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20particle%20community%20algorithm" title=" modified particle community algorithm"> modified particle community algorithm</a> </p> <a href="https://publications.waset.org/abstracts/124571/optimal-design-of-concrete-shells-by-modified-particle-community-algorithm-using-spinless-curves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124571.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">231</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">5862</span> Engineering Optimization Using Two-Stage Differential Evolution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Y.%20Tseng">K. Y. Tseng</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Y.%20Wu"> C. Y. Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper employs a heuristic algorithm to solve engineering problems including truss structure optimization and optimal chiller loading (OCL) problems. Two different type algorithms, real-valued differential evolution (DE) and modified binary differential evolution (MBDE), are successfully integrated and then can obtain better performance in solving engineering problems. In order to demonstrate the performance of the proposed algorithm, this study adopts each one testing case of truss structure optimization and OCL problems to compare the results of other heuristic optimization methods. The result indicates that the proposed algorithm can obtain similar or better solution in comparing with previous studies. <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=Truss%20structure%20optimization" title=" Truss structure optimization"> Truss structure optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20chiller%20loading" title=" optimal chiller loading"> optimal chiller loading</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20binary%20differential%20evolution" title=" modified binary differential evolution"> modified binary differential evolution</a> </p> <a href="https://publications.waset.org/abstracts/109896/engineering-optimization-using-two-stage-differential-evolution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109896.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">168</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">5861</span> Pruning Algorithm for the Minimum Rule Reduct Generation </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sahin%20Emrah%20Amrahov">Sahin Emrah Amrahov</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatih%20Aybar"> Fatih Aybar</a>, <a href="https://publications.waset.org/abstracts/search?q=Serhat%20Dogan"> Serhat Dogan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we consider the rule reduct generation problem. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms, that are used to solve this problem, are well-known. Alternative to these algorithms, we develop Pruning Rule Generation (PRG) algorithm. We compare the PRG algorithm with RG and MRG. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rough%20sets" title="rough sets">rough sets</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20rules" title=" decision rules"> decision rules</a>, <a href="https://publications.waset.org/abstracts/search?q=rule%20induction" title=" rule induction"> rule induction</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a> </p> <a href="https://publications.waset.org/abstracts/17254/pruning-algorithm-for-the-minimum-rule-reduct-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17254.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">528</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">5860</span> Chemical Reaction Algorithm for Expectation Maximization Clustering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Ni">Li Ni</a>, <a href="https://publications.waset.org/abstracts/search?q=Pen%20ManMan"> Pen ManMan</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20KenLi"> Li KenLi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20reaction%20optimization" title="chemical reaction optimization">chemical reaction optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=expection%20maimization" title=" expection maimization"> expection maimization</a>, <a href="https://publications.waset.org/abstracts/search?q=initia" title=" initia"> initia</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20function%20clustering" title=" objective function clustering"> objective function clustering</a> </p> <a href="https://publications.waset.org/abstracts/54706/chemical-reaction-algorithm-for-expectation-maximization-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54706.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">713</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">5859</span> Impact of Population Size on Symmetric Travelling Salesman Problem Efficiency</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%27%20Alsharafat">Wafa' Alsharafat</a>, <a href="https://publications.waset.org/abstracts/search?q=Suhila%20Farhan%20Abu-Owida"> Suhila Farhan Abu-Owida </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithm (GA) is a powerful evolutionary searching technique that is used successfully to solve and optimize problems in different research areas. Genetic Algorithm (GA) considered as one of optimization methods used to solve Travel salesman Problem (TSP). The feasibility of GA in finding a TSP solution is dependent on GA operators; encoding method, population size, termination criteria, in general. In specific, crossover and its probability play a significant role in finding possible solutions for Symmetric TSP (STSP). In addition, the crossover should be determined and enhanced in term reaching optimal or at least near optimal. In this paper, we spot the light on using a modified crossover method called modified sequential constructive crossover and its impact on reaching optimal solution. To justify the relevance of a parameter value in solving the TSP, a set comparative analysis conducted on different crossover methods values. <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=crossover" title=" crossover"> crossover</a>, <a href="https://publications.waset.org/abstracts/search?q=mutation" title=" mutation"> mutation</a>, <a href="https://publications.waset.org/abstracts/search?q=TSP" title=" TSP"> TSP</a> </p> <a href="https://publications.waset.org/abstracts/81306/impact-of-population-size-on-symmetric-travelling-salesman-problem-efficiency" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81306.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">227</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">5858</span> A New Optimization Algorithm for Operation of a Microgrid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sirus%20Mohammadi">Sirus Mohammadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Rohala%20Moghimi"> Rohala Moghimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main advantages of microgrids are high energy efficiency through the application of Combined Heat and Power (CHP), high quality and reliability of the delivered electric energy and environmental and economic advantages. This study presents an energy management system (EMS) to optimize the operation of the microgrid (MG). In this paper an Adaptive Modified Firefly Algorithm (AMFA) is presented for optimal operation of a typical MG with renewable energy sources (RESs) accompanied by a back-up Micro-Turbine/Fuel Cell/Battery hybrid power source to level the power mismatch or to store the energy surplus when it’s needed. The problem is formulated as a nonlinear constraint problem to minimize the total operating cost. The management of Energy storage system (ESS), economic load dispatch and operation optimization of distributed generation (DG) are simplified into a single-object optimization problem in the EMS. The proposed algorithm is tested on a typical grid-connected MG including WT/PV/Micro Turbine/Fuel Cell and Energy Storage Devices (ESDs) then its superior performance is compared with those from other evolutionary algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Fuzzy Self Adaptive PSO (FSAPSO), Chaotic Particle PSO (CPSO), Adaptive Modified PSO (AMPSO), and Firefly Algorithm (FA). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microgrid" title="microgrid">microgrid</a>, <a href="https://publications.waset.org/abstracts/search?q=operation%20management" title=" operation management"> operation management</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=firefly%20algorithm%20%28AMFA%29" title=" firefly algorithm (AMFA)"> firefly algorithm (AMFA)</a> </p> <a href="https://publications.waset.org/abstracts/7163/a-new-optimization-algorithm-for-operation-of-a-microgrid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7163.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">341</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">5857</span> Using Maximization Entropy in Developing a Filipino Phonetically Balanced Wordlist for a Phoneme-Level Speech Recognition System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=John%20Lorenzo%20Bautista">John Lorenzo Bautista</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoon-Joong%20Kim"> Yoon-Joong Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a set of Filipino Phonetically Balanced Word list consisting of 250 words (PBW250) were constructed for a phoneme-level ASR system for the Filipino language. The Entropy Maximization is used to obtain phonological balance in the list. Entropy of phonemes in a word is maximized, providing an optimal balance in each word’s phonological distribution using the Add-Delete Method (PBW algorithm) and is compared to the modified PBW algorithm implemented in a dynamic algorithm approach to obtain optimization. The gained entropy score of 4.2791 and 4.2902 for the PBW and modified algorithm respectively. The PBW250 was recorded by 40 respondents, each with 2 sets data. Recordings from 30 respondents were trained to produce an acoustic model that were tested using recordings from 10 respondents using the HMM Toolkit (HTK). The results of test gave the maximum accuracy rate of 97.77% for a speaker dependent test and 89.36% for a speaker independent test. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=entropy%20maximization" title="entropy maximization">entropy maximization</a>, <a href="https://publications.waset.org/abstracts/search?q=Filipino%20language" title=" Filipino language"> Filipino language</a>, <a href="https://publications.waset.org/abstracts/search?q=Hidden%20Markov%20Model" title=" Hidden Markov Model"> Hidden Markov Model</a>, <a href="https://publications.waset.org/abstracts/search?q=phonetically%20balanced%20words" title=" phonetically balanced words"> phonetically balanced words</a>, <a href="https://publications.waset.org/abstracts/search?q=speech%20recognition" title=" speech recognition"> speech recognition</a> </p> <a href="https://publications.waset.org/abstracts/10241/using-maximization-entropy-in-developing-a-filipino-phonetically-balanced-wordlist-for-a-phoneme-level-speech-recognition-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10241.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">5856</span> Image Reconstruction Method Based on L0 Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jianhong%20Xiang">Jianhong Xiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hao%20Xiang"> Hao Xiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Linyu%20Wang"> Linyu Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Compressed sensing (CS) has a wide range of applications in sparse signal reconstruction. Aiming at the problems of low recovery accuracy and long reconstruction time of existing reconstruction algorithms in medical imaging, this paper proposes a corrected smoothing L0 algorithm based on compressed sensing (CSL0). First, an approximate hyperbolic tangent function (AHTF) that is more similar to the L0 norm is proposed to approximate the L0 norm. Secondly, in view of the "sawtooth phenomenon" in the steepest descent method and the problem of sensitivity to the initial value selection in the modified Newton method, the use of the steepest descent method and the modified Newton method are jointly optimized to improve the reconstruction accuracy. Finally, the CSL0 algorithm is simulated on various images. The results show that the algorithm proposed in this paper improves the reconstruction accuracy of the test image by 0-0. 98dB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=smoothed%20L0" title="smoothed L0">smoothed L0</a>, <a href="https://publications.waset.org/abstracts/search?q=compressed%20sensing" title=" compressed sensing"> compressed sensing</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=sparse%20reconstruction" title=" sparse reconstruction"> sparse reconstruction</a> </p> <a href="https://publications.waset.org/abstracts/155598/image-reconstruction-method-based-on-l0-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155598.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">115</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">5855</span> Modified CUSUM Algorithm for Gradual Change Detection in a Time Series Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Victoria%20Siriaki%20Jorry">Victoria Siriaki Jorry</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20S.%20Mbalawata"> I. S. Mbalawata</a>, <a href="https://publications.waset.org/abstracts/search?q=Hayong%20Shin"> Hayong Shin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main objective in a change detection problem is to develop algorithms for efficient detection of gradual and/or abrupt changes in the parameter distribution of a process or time series data. In this paper, we present a modified cumulative (MCUSUM) algorithm to detect the start and end of a time-varying linear drift in mean value of a time series data based on likelihood ratio test procedure. The design, implementation and performance of the proposed algorithm for a linear drift detection is evaluated and compared to the existing CUSUM algorithm using different performance measures. An approach to accurately approximate the threshold of the MCUSUM is also provided. Performance of the MCUSUM for gradual change-point detection is compared to that of standard cumulative sum (CUSUM) control chart designed for abrupt shift detection using Monte Carlo Simulations. In terms of the expected time for detection, the MCUSUM procedure is found to have a better performance than a standard CUSUM chart for detection of the gradual change in mean. The algorithm is then applied and tested to a randomly generated time series data with a gradual linear trend in mean to demonstrate its usefulness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=average%20run%20length" title="average run length">average run length</a>, <a href="https://publications.waset.org/abstracts/search?q=CUSUM%20control%20chart" title=" CUSUM control chart"> CUSUM control chart</a>, <a href="https://publications.waset.org/abstracts/search?q=gradual%20change%20detection" title=" gradual change detection"> gradual change detection</a>, <a href="https://publications.waset.org/abstracts/search?q=likelihood%20ratio%20test" title=" likelihood ratio test"> likelihood ratio test</a> </p> <a href="https://publications.waset.org/abstracts/70339/modified-cusum-algorithm-for-gradual-change-detection-in-a-time-series-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70339.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">298</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5854</span> Modification Encryption Time and Permutation in Advanced Encryption Standard Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dalal%20N.%20Hammod">Dalal N. Hammod</a>, <a href="https://publications.waset.org/abstracts/search?q=Ekhlas%20K.%20Gbashi"> Ekhlas K. Gbashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, cryptography is used in many applications to achieve high security in data transmission and in real-time communications. AES has long gained global acceptance and is used for securing sensitive data in various industries but has suffered from slow processing and take a large time to transfer data. This paper suggests a method to enhance Advance Encryption Standard (AES) Algorithm based on time and permutation. The suggested method (MAES) is based on modifying the SubByte and ShiftRrows in the encryption part and modification the InvSubByte and InvShiftRows in the decryption part. After the implementation of the proposal and testing the results, the Modified AES achieved good results in accomplishing the communication with high performance criteria in terms of randomness, encryption time, storage space, and avalanche effects. The proposed method has good randomness to ciphertext because this method passed NIST statistical tests against attacks; also, (MAES) reduced the encryption time by (10 %) than the time of the original AES; therefore, the modified AES is faster than the original AES. Also, the proposed method showed good results in memory utilization where the value is (54.36) for the MAES, but the value for the original AES is (66.23). Also, the avalanche effects used for calculating diffusion property are (52.08%) for the modified AES and (51.82%) percentage for the original AES. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modified%20AES" title="modified AES">modified AES</a>, <a href="https://publications.waset.org/abstracts/search?q=randomness%20test" title=" randomness test"> randomness test</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption%20time" title=" encryption time"> encryption time</a>, <a href="https://publications.waset.org/abstracts/search?q=avalanche%20effects" title=" avalanche effects"> avalanche effects</a> </p> <a href="https://publications.waset.org/abstracts/139308/modification-encryption-time-and-permutation-in-advanced-encryption-standard-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139308.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">248</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=196">196</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=197">197</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>