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>Publications | World Academy of Science, Engineering and Technology</title> <meta name="description" content="Publications, World Academy of Science, Engineering and Technology"> <meta name="keywords" content="publications, conferences, meetings, events, science, academy, papers, 2024, 2025, 2026"> <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="" 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/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=""> <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> 175</div> </div> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">175</span> Idiopathic Constipation can be Subdivided in Clinical Subtypes: Data Mining by Cluster Analysis on a Population based Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mauro%20Giacomini">Mauro Giacomini</a>, <a href="https://publications.waset.org/search?q=Stefania%20Bertone"> Stefania Bertone</a>, <a href="https://publications.waset.org/search?q=Carlo%20Mansi"> Carlo Mansi</a>, <a href="https://publications.waset.org/search?q=Pietro%20Dulbecco"> Pietro Dulbecco</a>, <a href="https://publications.waset.org/search?q=Vincenzo%20Savarino"> Vincenzo Savarino</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The prevalence of non organic constipation differs from country to country and the reliability of the estimate rates is uncertain. Moreover, the clinical relevance of subdividing the heterogeneous functional constipation disorders into pre-defined subgroups is largely unknown.. Aim: to estimate the prevalence of constipation in a population-based sample and determine whether clinical subgroups can be identified. An age and gender stratified sample population from 5 Italian cities was evaluated using a previously validated questionnaire. Data mining by cluster analysis was used to determine constipation subgroups. Results: 1,500 complete interviews were obtained from 2,083 contacted households (72%). Self-reported constipation correlated poorly with symptombased constipation found in 496 subjects (33.1%). Cluster analysis identified four constipation subgroups which correlated to subgroups identified according to pre-defined symptom criteria. Significant differences in socio-demographics and lifestyle were observed among subgroups. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cluster%20analysis" title="Cluster analysis">Cluster analysis</a>, <a href="https://publications.waset.org/search?q=constipation" title=" constipation"> constipation</a>, <a href="https://publications.waset.org/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/search?q=statistical%20analysis." title=" statistical analysis."> statistical analysis.</a> </p> <a href="https://publications.waset.org/4751/idiopathic-constipation-can-be-subdivided-in-clinical-subtypes-data-mining-by-cluster-analysis-on-a-population-based-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4751/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4751/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4751/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4751/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4751/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4751/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4751/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4751/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4751/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4751/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4751.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">1294</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">174</span> State Feedback Controller Design via Takagi- Sugeno Fuzzy Model: LMI Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20Khaber">F. Khaber</a>, <a href="https://publications.waset.org/search?q=K.%20Zehar"> K. Zehar</a>, <a href="https://publications.waset.org/search?q=A.%20Hamzaoui"> A. Hamzaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we introduce a robust state feedback controller design using Linear Matrix Inequalities (LMIs) and guaranteed cost approach for Takagi-Sugeno fuzzy systems. The purpose on this work is to establish a systematic method to design controllers for a class of uncertain linear and non linear systems. Our approach utilizes a certain type of fuzzy systems that are based on Takagi-Sugeno (T-S) fuzzy models to approximate nonlinear systems. We use a robust control methodology to design controllers. This method not only guarantees stability, but also minimizes an upper bound on a linear quadratic performance measure. A simulation example is presented to show the effectiveness of this method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Takagi-Sugeno%20fuzzy%20model" title="Takagi-Sugeno fuzzy model">Takagi-Sugeno fuzzy model</a>, <a href="https://publications.waset.org/search?q=state%20feedback" title=" state feedback"> state feedback</a>, <a href="https://publications.waset.org/search?q=linear%20matrix%20inequalities" title=" linear matrix inequalities"> linear matrix inequalities</a>, <a href="https://publications.waset.org/search?q=robust%20stability." title=" robust stability."> robust stability.</a> </p> <a href="https://publications.waset.org/12563/state-feedback-controller-design-via-takagi-sugeno-fuzzy-model-lmi-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12563/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12563/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12563/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12563/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12563/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12563/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12563/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12563/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12563/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12563/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12563.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">2501</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">173</span> Statistical Evaluation of Nonlinear Distortion using the Multi-Canonical Monte Carlo Method and the Split Step Fourier Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ioannis%20Neokosmidis">Ioannis Neokosmidis</a>, <a href="https://publications.waset.org/search?q=Nikos%20Gkekas"> Nikos Gkekas</a>, <a href="https://publications.waset.org/search?q=Thomas%20Kamalakis"> Thomas Kamalakis</a>, <a href="https://publications.waset.org/search?q=Thomas%20Sphicopoulos"> Thomas Sphicopoulos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In high powered dense wavelength division multiplexed (WDM) systems with low chromatic dispersion, four-wave mixing (FWM) can prove to be a major source of noise. The MultiCanonical Monte Carlo Method (MCMC) and the Split Step Fourier Method (SSFM) are combined to accurately evaluate the probability density function of the decision variable of a receiver, limited by FWM. The combination of the two methods leads to more accurate results, and offers the possibility of adding other optical noises such as the Amplified Spontaneous Emission (ASE) noise. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Monte%20Carlo" title="Monte Carlo">Monte Carlo</a>, <a href="https://publications.waset.org/search?q=Nonlinear%20optics" title=" Nonlinear optics"> Nonlinear optics</a>, <a href="https://publications.waset.org/search?q=optical%20crosstalk" title=" optical crosstalk"> optical crosstalk</a>, <a href="https://publications.waset.org/search?q=Wavelength-division%20Multiplexing%20%28WDM%29." title=" Wavelength-division Multiplexing (WDM)."> Wavelength-division Multiplexing (WDM).</a> </p> <a href="https://publications.waset.org/3783/statistical-evaluation-of-nonlinear-distortion-using-the-multi-canonical-monte-carlo-method-and-the-split-step-fourier-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3783/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3783/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3783/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3783/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3783/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3783/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3783/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3783/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3783/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3783/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3783.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">1692</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">172</span> Computation of the Filtering Properties of Photonic Crystal Waveguide Discontinuities Using the Mode Matching Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Athanasios%20Theoharidis">Athanasios Theoharidis</a>, <a href="https://publications.waset.org/search?q=Thomas%20Kamalakis"> Thomas Kamalakis</a>, <a href="https://publications.waset.org/search?q=Ioannis%20Neokosmidis"> Ioannis Neokosmidis</a>, <a href="https://publications.waset.org/search?q=Thomas%20Sphicopoulos"> Thomas Sphicopoulos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the application of the Mode Matching (MM) method in the case of photonic crystal waveguide discontinuities is presented. The structure under consideration is divided into a number of cells, which supports a number of guided and evanescent modes. These modes can be calculated numerically by an alternative formulation of the plane wave expansion method for each frequency. A matrix equation is then formed relating the modal amplitudes at the beginning and at the end of the structure. The theory is highly efficient and accurate and can be applied to study the transmission sensitivity of photonic crystal devices due to fabrication tolerances. The accuracy of the MM method is compared to the Finite Difference Frequency Domain (FDFD) and the Adjoint Variable Method (AVM) and good agreement is observed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optical%20Communications" title="Optical Communications">Optical Communications</a>, <a href="https://publications.waset.org/search?q=Integrated%20Optics" title=" Integrated Optics"> Integrated Optics</a>, <a href="https://publications.waset.org/search?q=Photonic%20Crystals" title=" Photonic Crystals"> Photonic Crystals</a>, <a href="https://publications.waset.org/search?q=Optical%20Waveguide%20Discontinuities." title=" Optical Waveguide Discontinuities."> Optical Waveguide Discontinuities.</a> </p> <a href="https://publications.waset.org/13965/computation-of-the-filtering-properties-of-photonic-crystal-waveguide-discontinuities-using-the-mode-matching-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13965/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13965/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13965/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13965/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13965/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13965/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13965/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13965/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13965/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13965/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13965.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">1578</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">171</span> Distinguishing Innocent Murmurs from Murmurs caused by Aortic Stenosis by Recurrence Quantification Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Christer%20Ahlstrom">Christer Ahlstrom</a>, <a href="https://publications.waset.org/search?q=Katja%20H%C3%B6glund"> Katja Höglund</a>, <a href="https://publications.waset.org/search?q=Peter%20Hult"> Peter Hult</a>, <a href="https://publications.waset.org/search?q=Jens%20H%C3%A4ggstr%C3%B6m"> Jens Häggström</a>, <a href="https://publications.waset.org/search?q=Clarence%20Kvart"> Clarence Kvart</a>, <a href="https://publications.waset.org/search?q=Per%20Ask"> Per Ask</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is sometimes difficult to differentiate between innocent murmurs and pathological murmurs during auscultation. In these difficult cases, an intelligent stethoscope with decision support abilities would be of great value. In this study, using a dog model, phonocardiographic recordings were obtained from 27 boxer dogs with various degrees of aortic stenosis (AS) severity. As a reference for severity assessment, continuous wave Doppler was used. The data were analyzed with recurrence quantification analysis (RQA) with the aim to find features able to distinguish innocent murmurs from murmurs caused by AS. Four out of eight investigated RQA features showed significant differences between innocent murmurs and pathological murmurs. Using a plain linear discriminant analysis classifier, the best pair of features (recurrence rate and entropy) resulted in a sensitivity of 90% and a specificity of 88%. In conclusion, RQA provide valid features which can be used for differentiation between innocent murmurs and murmurs caused by AS. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bioacoustics" title="Bioacoustics">Bioacoustics</a>, <a href="https://publications.waset.org/search?q=murmur" title=" murmur"> murmur</a>, <a href="https://publications.waset.org/search?q=phonocardiographic%20signal" title=" phonocardiographic signal"> phonocardiographic signal</a>, <a href="https://publications.waset.org/search?q=recurrence%20quantification%20analysis." title=" recurrence quantification analysis."> recurrence quantification analysis.</a> </p> <a href="https://publications.waset.org/2998/distinguishing-innocent-murmurs-from-murmurs-caused-by-aortic-stenosis-by-recurrence-quantification-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2998/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2998/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2998/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2998/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2998/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2998/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2998/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2998/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2998/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2998/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2998.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">2005</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">170</span> Accuracy of Divergence Measures for Detection of Abrupt Changes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.%20Bergl">P. Bergl</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Numerous divergence measures (spectral distance, cepstral distance, difference of the cepstral coefficients, Kullback-Leibler divergence, distance given by the General Likelihood Ratio, distance defined by the Recursive Bayesian Changepoint Detector and the Mahalanobis measure) are compared in this study. The measures are used for detection of abrupt spectral changes in synthetic AR signals via the sliding window algorithm. Two experiments are performed; the first is focused on detection of single boundary while the second concentrates on detection of a couple of boundaries. Accuracy of detection is judged for each method; the measures are compared according to results of both experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Abrupt%20changes%20detection" title="Abrupt changes detection">Abrupt changes detection</a>, <a href="https://publications.waset.org/search?q=autoregressive%20model" title=" autoregressive model"> autoregressive model</a>, <a href="https://publications.waset.org/search?q=divergence%20measure." title=" divergence measure."> divergence measure.</a> </p> <a href="https://publications.waset.org/1730/accuracy-of-divergence-measures-for-detection-of-abrupt-changes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1730/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1730/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1730/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1730/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1730/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1730/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1730/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1730/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1730/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1730/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1730.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">1449</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">169</span> Neural Networks: From Black Box towards Transparent Box Application to Evapotranspiration Modeling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Johannet">A. Johannet</a>, <a href="https://publications.waset.org/search?q=B.%20Vayssade"> B. Vayssade</a>, <a href="https://publications.waset.org/search?q=D.%20Bertin"> D. Bertin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Neural networks are well known for their ability to model non linear functions, but as statistical methods usually does, they use a no parametric approach thus, a priori knowledge is not obvious to be taken into account no more than the a posteriori knowledge. In order to deal with these problematics, an original way to encode the knowledge inside the architecture is proposed. This method is applied to the problem of the evapotranspiration inside karstic aquifer which is a problem of huge utility in order to deal with water resource. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Neural-Networks" title="Neural-Networks">Neural-Networks</a>, <a href="https://publications.waset.org/search?q=Hydrology" title=" Hydrology"> Hydrology</a>, <a href="https://publications.waset.org/search?q=Evapotranpiration" title=" Evapotranpiration"> Evapotranpiration</a>, <a href="https://publications.waset.org/search?q=Hidden%20Function%20Modeling." title=" Hidden Function Modeling."> Hidden Function Modeling.</a> </p> <a href="https://publications.waset.org/15004/neural-networks-from-black-box-towards-transparent-box-application-to-evapotranspiration-modeling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15004/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15004/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15004/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15004/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15004/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15004/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15004/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15004/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15004/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15004/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15004.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">1807</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">168</span> Estimating Word Translation Probabilities for Thai – English Machine Translation using EM Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chutchada%20Nusai">Chutchada Nusai</a>, <a href="https://publications.waset.org/search?q=Yoshimi%20Suzuki"> Yoshimi Suzuki</a>, <a href="https://publications.waset.org/search?q=Haruaki%20Yamazaki"> Haruaki Yamazaki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Selecting the word translation from a set of target language words, one that conveys the correct sense of source word and makes more fluent target language output, is one of core problems in machine translation. In this paper we compare the 3 methods of estimating word translation probabilities for selecting the translation word in Thai – English Machine Translation. The 3 methods are (1) Method based on frequency of word translation, (2) Method based on collocation of word translation, and (3) Method based on Expectation Maximization (EM) algorithm. For evaluation we used Thai – English parallel sentences generated by NECTEC. The method based on EM algorithm is the best method in comparison to the other methods and gives the satisfying results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Machine%20translation" title="Machine translation">Machine translation</a>, <a href="https://publications.waset.org/search?q=EM%20algorithm." title=" EM algorithm."> EM algorithm.</a> </p> <a href="https://publications.waset.org/10738/estimating-word-translation-probabilities-for-thai-english-machine-translation-using-em-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10738/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10738/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10738/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10738/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10738/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10738/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10738/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10738/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10738/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10738/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10738.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">1679</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">167</span> Modelling Multiagent Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Gilbert%20Ndjatou">Gilbert Ndjatou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a formal framework for the specification of the behavior of a system of agents, as well as those of the constituting agents. This framework allows us to model each agent-s effectoric capability including its interactions with the other agents. We also provide an algorithm based on Milner-s "observation equivalence" to derive an agent-s perception of its task domain situations from its effectoric capability, and use "system computations" to model the coordinated efforts of the agents in the system . Formal definitions of the concept of "behavior equivalence" of two agents and that of system computations equivalence for an agent are also provided. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiagent%20system" title="Multiagent system">Multiagent system</a>, <a href="https://publications.waset.org/search?q=object%20system" title=" object system"> object system</a>, <a href="https://publications.waset.org/search?q=observation%20equivalence" title=" observation equivalence"> observation equivalence</a>, <a href="https://publications.waset.org/search?q=reactive%20systems." title=" reactive systems."> reactive systems.</a> </p> <a href="https://publications.waset.org/4681/modelling-multiagent-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4681/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4681/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4681/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4681/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4681/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4681/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4681/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4681/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4681/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4681/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4681.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">1247</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">166</span> The Nanobiotechnology of Obtaining of Collagen Gels from Marin Fish Skin and Yours Reological Properties for using Like New Materials in Dental Medicine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Anamaria%20Bechir">Anamaria Bechir</a>, <a href="https://publications.waset.org/search?q=Rodica%20Sirbu"> Rodica Sirbu</a>, <a href="https://publications.waset.org/search?q=Minodora%20Leca"> Minodora Leca</a>, <a href="https://publications.waset.org/search?q=Maria%20Maris"> Maria Maris</a>, <a href="https://publications.waset.org/search?q=Dan%20Artenie%20Maris"> Dan Artenie Maris</a>, <a href="https://publications.waset.org/search?q=Emilia%20Mihaela%20Cadar"> Emilia Mihaela Cadar</a>, <a href="https://publications.waset.org/search?q=Marius%20Maris"> Marius Maris</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims at presenting the biotechnology used to obtain collagen-based gels from shark (Squalus acanthias) and brill skin, marine fish growing in the Black Sea. Due to the structure of its micro-fibres, collagen can be considered a nanomaterial; in order to use collagen-based matrixes as biomaterial, rheological studies must be performed first, to state whether they are stable or not. For the triple-helix structure to remain stable within these gels at room or human body temperature, they must be stabilized by reticulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Collagen" title="Collagen">Collagen</a>, <a href="https://publications.waset.org/search?q=biotechnology" title=" biotechnology"> biotechnology</a>, <a href="https://publications.waset.org/search?q=reticulation." title=" reticulation."> reticulation.</a> </p> <a href="https://publications.waset.org/108/the-nanobiotechnology-of-obtaining-of-collagen-gels-from-marin-fish-skin-and-yours-reological-properties-for-using-like-new-materials-in-dental-medicine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/108/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/108/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/108/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/108/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/108/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/108/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/108/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/108/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/108/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/108/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/108.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">2975</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">165</span> RB-Matcher: String Matching Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rajender%20Singh%20Chillar">Rajender Singh Chillar</a>, <a href="https://publications.waset.org/search?q=Barjesh%20Kochar"> Barjesh Kochar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> All Text processing systems allow their users to search a pattern of string from a given text. String matching is fundamental to database and text processing applications. Every text editor must contain a mechanism to search the current document for arbitrary strings. Spelling checkers scan an input text for words in the dictionary and reject any strings that do not match. We store our information in data bases so that later on we can retrieve the same and this retrieval can be done by using various string matching algorithms. This paper is describing a new string matching algorithm for various applications. A new algorithm has been designed with the help of Rabin Karp Matcher, to improve string matching process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Algorithm" title="Algorithm">Algorithm</a>, <a href="https://publications.waset.org/search?q=Complexity" title=" Complexity"> Complexity</a>, <a href="https://publications.waset.org/search?q=Matching-patterns" title=" Matching-patterns"> Matching-patterns</a>, <a href="https://publications.waset.org/search?q=Pattern" title=" Pattern"> Pattern</a>, <a href="https://publications.waset.org/search?q=Rabin-Karp" title=" Rabin-Karp"> Rabin-Karp</a>, <a href="https://publications.waset.org/search?q=String" title=" String"> String</a>, <a href="https://publications.waset.org/search?q=text-processing." title=" text-processing."> text-processing.</a> </p> <a href="https://publications.waset.org/10088/rb-matcher-string-matching-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10088/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10088/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10088/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10088/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10088/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10088/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10088/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10088/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10088/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10088/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10088.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">1766</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">164</span> A Intelligent Inference Model about Complex Systems- Stability: Inspiration from Nature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Naiqin%20Feng">Naiqin Feng</a>, <a href="https://publications.waset.org/search?q=Yuhui%20Qiu"> Yuhui Qiu</a>, <a href="https://publications.waset.org/search?q=Yingshan%20Zhang"> Yingshan Zhang</a>, <a href="https://publications.waset.org/search?q=Fang%20Wang"> Fang Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A logic model for analyzing complex systems- stability is very useful to many areas of sciences. In the real world, we are enlightened from some natural phenomena such as “biosphere", “food chain", “ecological balance" etc. By research and practice, and taking advantage of the orthogonality and symmetry defined by the theory of multilateral matrices, we put forward a logic analysis model of stability of complex systems with three relations, and prove it by means of mathematics. This logic model is usually successful in analyzing stability of a complex system. The structure of the logic model is not only clear and simple, but also can be easily used to research and solve many stability problems of complex systems. As an application, some examples are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Complex%20system" title="Complex system">Complex system</a>, <a href="https://publications.waset.org/search?q=logic%20model" title=" logic model"> logic model</a>, <a href="https://publications.waset.org/search?q=relation" title=" relation"> relation</a>, <a href="https://publications.waset.org/search?q=stability." title=" stability."> stability.</a> </p> <a href="https://publications.waset.org/10647/a-intelligent-inference-model-about-complex-systems-stability-inspiration-from-nature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10647/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10647/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10647/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10647/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10647/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10647/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10647/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10647/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10647/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10647/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10647.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">1328</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">163</span> Effective Collaboration in Product Development via a Common Sharable Ontology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sihem%20Mostefai">Sihem Mostefai</a>, <a href="https://publications.waset.org/search?q=Abdelaziz%20Bouras"> Abdelaziz Bouras</a>, <a href="https://publications.waset.org/search?q=Mohamed%20Batouche"> Mohamed Batouche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To achieve competitive advantage nowadays, most of the industrial companies are considering that success is sustained to great product development. That is to manage the product throughout its entire lifetime ranging from design, manufacture, operation and destruction. Achieving this goal requires a tight collaboration between partners from a wide variety of domains, resulting in various product data types and formats, as well as different software tools. So far, the lack of a meaningful unified representation for product data semantics has slowed down efficient product development. This paper proposes an ontology based approach to enable such semantic interoperability. Generic and extendible product ontology is described, gathering main concepts pertaining to the mechanical field and the relations that hold among them. The ontology is not exhaustive; nevertheless, it shows that such a unified representation is possible and easily exploitable. This is illustrated thru a case study with an example product and some semantic requests to which the ontology responds quite easily. The study proves the efficiency of ontologies as a support to product data exchange and information sharing, especially in product development environments where collaboration is not just a choice but a mandatory prerequisite. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Information%20exchange" title="Information exchange">Information exchange</a>, <a href="https://publications.waset.org/search?q=product%20lifecyclemanagement" title=" product lifecyclemanagement"> product lifecyclemanagement</a>, <a href="https://publications.waset.org/search?q=product%20ontology" title=" product ontology"> product ontology</a>, <a href="https://publications.waset.org/search?q=semantic%20interoperability." title=" semantic interoperability."> semantic interoperability.</a> </p> <a href="https://publications.waset.org/15769/effective-collaboration-in-product-development-via-a-common-sharable-ontology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15769/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15769/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15769/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15769/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15769/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15769/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15769/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15769/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15769/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15769/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15769.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">1593</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">162</span> Chose the Right Mutation Rate for Better Evolve Combinational Logic Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Emanuele%20Stomeo">Emanuele Stomeo</a>, <a href="https://publications.waset.org/search?q=Tatiana%20Kalganova"> Tatiana Kalganova</a>, <a href="https://publications.waset.org/search?q=Cyrille%20Lambert"> Cyrille Lambert</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evolvable hardware (EHW) is a developing field that applies evolutionary algorithm (EA) to automatically design circuits, antennas, robot controllers etc. A lot of research has been done in this area and several different EAs have been introduced to tackle numerous problems, as scalability, evolvability etc. However every time a specific EA is chosen for solving a particular task, all its components, such as population size, initialization, selection mechanism, mutation rate, and genetic operators, should be selected in order to achieve the best results. In the last three decade the selection of the right parameters for the EA-s components for solving different “test-problems" has been investigated. In this paper the behaviour of mutation rate for designing logic circuits, which has not been done before, has been deeply analyzed. The mutation rate for an EHW system modifies the number of inputs of each logic gates, the functionality (for example from AND to NOR) and the connectivity between logic gates. The behaviour of the mutation has been analyzed based on the number of generations, genotype redundancy and number of logic gates for the evolved circuits. The experimental results found provide the behaviour of the mutation rate during evolution for the design and optimization of simple logic circuits. The experimental results propose the best mutation rate to be used for designing combinational logic circuits. The research presented is particular important for those who would like to implement a dynamic mutation rate inside the evolutionary algorithm for evolving digital circuits. The researches on the mutation rate during the last 40 years are also summarized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Design%20of%20logic%20circuit" title="Design of logic circuit">Design of logic circuit</a>, <a href="https://publications.waset.org/search?q=evolutionary%20computation" title=" evolutionary computation"> evolutionary computation</a>, <a href="https://publications.waset.org/search?q=evolvable%20hardware" title="evolvable hardware">evolvable hardware</a>, <a href="https://publications.waset.org/search?q=mutation%20rate." title=" mutation rate."> mutation rate.</a> </p> <a href="https://publications.waset.org/10551/chose-the-right-mutation-rate-for-better-evolve-combinational-logic-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10551/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10551/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10551/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10551/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10551/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10551/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10551/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10551/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10551/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10551/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10551.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">1693</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">161</span> Genetic-Based Planning with Recursive Subgoals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Han%20Yu">Han Yu</a>, <a href="https://publications.waset.org/search?q=Dan%20C.%20Marinescu"> Dan C. Marinescu</a>, <a href="https://publications.waset.org/search?q=Annie%20S.%20Wu"> Annie S. Wu</a>, <a href="https://publications.waset.org/search?q=Howard%20Jay%20Siegel"> Howard Jay Siegel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce an effective strategy for subgoal division and ordering based upon recursive subgoals and combine this strategy with a genetic-based planning approach. This strategy can be applied to domains with conjunctive goals. The main idea is to recursively decompose a goal into a set of serializable subgoals and to specify a strict ordering among the subgoals. Empirical results show that the recursive subgoal strategy reduces the size of the search space and improves the quality of solutions to planning problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Planning" title="Planning">Planning</a>, <a href="https://publications.waset.org/search?q=recursive%20subgoals" title=" recursive subgoals"> recursive subgoals</a>, <a href="https://publications.waset.org/search?q=Sliding-tile%20puzzle" title=" Sliding-tile puzzle"> Sliding-tile puzzle</a>, <a href="https://publications.waset.org/search?q=subgoal%20interaction" title="subgoal interaction">subgoal interaction</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithms." title=" genetic algorithms."> genetic algorithms.</a> </p> <a href="https://publications.waset.org/13213/genetic-based-planning-with-recursive-subgoals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13213/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13213/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13213/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13213/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13213/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13213/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13213/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13213/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13213/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13213/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13213.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">1509</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">160</span> A Comparison of Grey Model and Fuzzy Predictive Model for Time Series</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20I.%20Dounis">A. I. Dounis</a>, <a href="https://publications.waset.org/search?q=P.%20Tiropanis"> P. Tiropanis</a>, <a href="https://publications.waset.org/search?q=D.%20Tseles"> D. Tseles</a>, <a href="https://publications.waset.org/search?q=G.%20Nikolaou"> G. Nikolaou</a>, <a href="https://publications.waset.org/search?q=G.%20P.%20Syrcos"> G. P. Syrcos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The prediction of meteorological parameters at a meteorological station is an interesting and open problem. A firstorder linear dynamic model GM(1,1) is the main component of the grey system theory. The grey model requires only a few previous data points in order to make a real-time forecast. In this paper, we consider the daily average ambient temperature as a time series and the grey model GM(1,1) applied to local prediction (short-term prediction) of the temperature. In the same case study we use a fuzzy predictive model for global prediction. We conclude the paper with a comparison between local and global prediction schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20predictive%20model" title="Fuzzy predictive model">Fuzzy predictive model</a>, <a href="https://publications.waset.org/search?q=grey%20model" title=" grey model"> grey model</a>, <a href="https://publications.waset.org/search?q=local%20andglobal%20prediction" title=" local andglobal prediction"> local andglobal prediction</a>, <a href="https://publications.waset.org/search?q=meteorological%20forecasting" title=" meteorological forecasting"> meteorological forecasting</a>, <a href="https://publications.waset.org/search?q=time%20series." title=" time series."> time series.</a> </p> <a href="https://publications.waset.org/15438/a-comparison-of-grey-model-and-fuzzy-predictive-model-for-time-series" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15438/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15438/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15438/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15438/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15438/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15438/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15438/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15438/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15438/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15438/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15438.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">2155</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">159</span> Wavelet based ANN Approach for Transformer Protection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Okan%20%C3%96zg%C3%B6nenel">Okan Özgönenel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the development of a wavelet based algorithm, for distinguishing between magnetizing inrush currents and power system fault currents, which is quite adequate, reliable, fast and computationally efficient tool. The proposed technique consists of a preprocessing unit based on discrete wavelet transform (DWT) in combination with an artificial neural network (ANN) for detecting and classifying fault currents. The DWT acts as an extractor of distinctive features in the input signals at the relay location. This information is then fed into an ANN for classifying fault and magnetizing inrush conditions. A 220/55/55 V, 50Hz laboratory transformer connected to a 380 V power system were simulated using ATP-EMTP. The DWT was implemented by using Matlab and Coiflet mother wavelet was used to analyze primary currents and generate training data. The simulated results presented clearly show that the proposed technique can accurately discriminate between magnetizing inrush and fault currents in transformer protection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20neural%20network" title="Artificial neural network">Artificial neural network</a>, <a href="https://publications.waset.org/search?q=discrete%20wavelet%20transform" title=" discrete wavelet transform"> discrete wavelet transform</a>, <a href="https://publications.waset.org/search?q=fault%20detection" title="fault detection">fault detection</a>, <a href="https://publications.waset.org/search?q=magnetizing%20inrush%20current." title=" magnetizing inrush current."> magnetizing inrush current.</a> </p> <a href="https://publications.waset.org/15020/wavelet-based-ann-approach-for-transformer-protection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15020/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15020/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15020/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15020/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15020/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15020/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15020/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15020/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15020/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15020/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15020.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">1845</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">158</span> Modeling Language for Constructing Solvers in Machine Learning: Reductionist Perspectives</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tsuyoshi%20Okita">Tsuyoshi Okita</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>For a given specific problem an efficient algorithm has been the matter of study. However, an alternative approach orthogonal to this approach comes out, which is called a reduction. In general for a given specific problem this reduction approach studies how to convert an original problem into subproblems. This paper proposes a formal modeling language to support this reduction approach in order to make a solver quickly. We show three examples from the wide area of learning problems. The benefit is a fast prototyping of algorithms for a given new problem. It is noted that our formal modeling language is not intend for providing an efficient notation for data mining application, but for facilitating a designer who develops solvers in machine learning.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Formal%20language" title="Formal language">Formal language</a>, <a href="https://publications.waset.org/search?q=statistical%20inference%20problem" title=" statistical inference problem"> statistical inference problem</a>, <a href="https://publications.waset.org/search?q=reduction." title=" reduction."> reduction.</a> </p> <a href="https://publications.waset.org/15086/modeling-language-for-constructing-solvers-in-machine-learning-reductionist-perspectives" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15086/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15086/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15086/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15086/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15086/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15086/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15086/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15086/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15086/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15086/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15086.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">1328</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">157</span> Meta Random Forests</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Praveen%20Boinee">Praveen Boinee</a>, <a href="https://publications.waset.org/search?q=Alessandro%20De%20Angelis"> Alessandro De Angelis</a>, <a href="https://publications.waset.org/search?q=Gian%20Luca%20Foresti"> Gian Luca Foresti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Leo Breimans Random Forests (RF) is a recent development in tree based classifiers and quickly proven to be one of the most important algorithms in the machine learning literature. It has shown robust and improved results of classifications on standard data sets. Ensemble learning algorithms such as AdaBoost and Bagging have been in active research and shown improvements in classification results for several benchmarking data sets with mainly decision trees as their base classifiers. In this paper we experiment to apply these Meta learning techniques to the random forests. We experiment the working of the ensembles of random forests on the standard data sets available in UCI data sets. We compare the original random forest algorithm with their ensemble counterparts and discuss the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Random%20Forests%20%5BRF%5D" title="Random Forests [RF]">Random Forests [RF]</a>, <a href="https://publications.waset.org/search?q=ensembles" title=" ensembles"> ensembles</a>, <a href="https://publications.waset.org/search?q=UCI." title=" UCI."> UCI.</a> </p> <a href="https://publications.waset.org/3799/meta-random-forests" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3799/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3799/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3799/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3799/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3799/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3799/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3799/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3799/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3799/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3799/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3799.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">2710</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">156</span> Distributional Semantics Approach to Thai Word Sense Disambiguation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sunee%20Pongpinigpinyo">Sunee Pongpinigpinyo</a>, <a href="https://publications.waset.org/search?q=Wanchai%20Rivepiboon"> Wanchai Rivepiboon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Word sense disambiguation is one of the most important open problems in natural language processing applications such as information retrieval and machine translation. Many approach strategies can be employed to resolve word ambiguity with a reasonable degree of accuracy. These strategies are: knowledgebased, corpus-based, and hybrid-based. This paper pays attention to the corpus-based strategy that employs an unsupervised learning method for disambiguation. We report our investigation of Latent Semantic Indexing (LSI), an information retrieval technique and unsupervised learning, to the task of Thai noun and verbal word sense disambiguation. The Latent Semantic Indexing has been shown to be efficient and effective for Information Retrieval. For the purposes of this research, we report experiments on two Thai polysemous words, namely  /hua4/ and /kep1/ that are used as a representative of Thai nouns and verbs respectively. The results of these experiments demonstrate the effectiveness and indicate the potential of applying vector-based distributional information measures to semantic disambiguation.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Distributional%20semantics" title="Distributional semantics">Distributional semantics</a>, <a href="https://publications.waset.org/search?q=Latent%20Semantic%20Indexing" title=" Latent Semantic Indexing"> Latent Semantic Indexing</a>, <a href="https://publications.waset.org/search?q=natural%20language%20processing" title="natural language processing">natural language processing</a>, <a href="https://publications.waset.org/search?q=Polysemous%20words" title=" Polysemous words"> Polysemous words</a>, <a href="https://publications.waset.org/search?q=unsupervisedlearning" title=" unsupervisedlearning"> unsupervisedlearning</a>, <a href="https://publications.waset.org/search?q=Word%20Sense%20Disambiguation." title=" Word Sense Disambiguation."> Word Sense Disambiguation.</a> </p> <a href="https://publications.waset.org/12429/distributional-semantics-approach-to-thai-word-sense-disambiguation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12429/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12429/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12429/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12429/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12429/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12429/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12429/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12429/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12429/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12429/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12429.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">1814</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">155</span> A PSO-based End-Member Selection Method for Spectral Unmixing of Multispectral Satellite Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mahamed%20G.H.%20Omran">Mahamed G.H. Omran</a>, <a href="https://publications.waset.org/search?q=Andries%20P%20Engelbrecht"> Andries P Engelbrecht</a>, <a href="https://publications.waset.org/search?q=Ayed%20Salman"> Ayed Salman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An end-member selection method for spectral unmixing that is based on Particle Swarm Optimization (PSO) is developed in this paper. The algorithm uses the K-means clustering algorithm and a method of dynamic selection of end-members subsets to find the appropriate set of end-members for a given set of multispectral images. The proposed algorithm has been successfully applied to test image sets from various platforms such as LANDSAT 5 MSS and NOAA's AVHRR. The experimental results of the proposed algorithm are encouraging. The influence of different values of the algorithm control parameters on performance is studied. Furthermore, the performance of different versions of PSO is also investigated.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=End-members%20selection" title="End-members selection">End-members selection</a>, <a href="https://publications.waset.org/search?q=multispectral%20satellite%20imagery" title=" multispectral satellite imagery"> multispectral satellite imagery</a>, <a href="https://publications.waset.org/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=spectral%20unmixing." title=" spectral unmixing."> spectral unmixing.</a> </p> <a href="https://publications.waset.org/7090/a-pso-based-end-member-selection-method-for-spectral-unmixing-of-multispectral-satellite-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7090/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7090/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7090/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7090/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7090/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7090/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7090/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7090/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7090/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7090/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7090.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">2099</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">154</span> Restoration of Noisy Document Images with an Efficient Bi-Level Adaptive Thresholding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abhijit%20Mitra">Abhijit Mitra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An effective approach for extracting document images from a noisy background is introduced. The entire scheme is divided into three sub- stechniques – the initial preprocessing operations for noise cluster tightening, introduction of a new thresholding method by maximizing the ratio of stan- dard deviations of the combined effect on the image to the sum of weighted classes and finally the image restoration phase by image binarization utiliz- ing the proposed optimum threshold level. The proposed method is found to be efficient compared to the existing schemes in terms of computational complexity as well as speed with better noise rejection.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Document%20image%20extraction" title="Document image extraction">Document image extraction</a>, <a href="https://publications.waset.org/search?q=Preprocessing" title=" Preprocessing"> Preprocessing</a>, <a href="https://publications.waset.org/search?q=Ratio%20of%20stan-dard%20deviations" title=" Ratio of stan-dard deviations"> Ratio of stan-dard deviations</a>, <a href="https://publications.waset.org/search?q=Bi-level%20adaptive%20thresholding." title=" Bi-level adaptive thresholding."> Bi-level adaptive thresholding.</a> </p> <a href="https://publications.waset.org/15663/restoration-of-noisy-document-images-with-an-efficient-bi-level-adaptive-thresholding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15663/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15663/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15663/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15663/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15663/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15663/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15663/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15663/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15663/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15663/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15663.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">1457</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">153</span> An Efficient Feature Extraction Algorithm for the Recognition of Handwritten Arabic Digits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ahmad%20T.%20Al-Taani">Ahmad T. Al-Taani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an efficient structural approach for recognizing on-line handwritten digits is proposed. After reading the digit from the user, the slope is estimated and normalized for adjacent nodes. Based on the changing of signs of the slope values, the primitives are identified and extracted. The names of these primitives are represented by strings, and then a finite state machine, which contains the grammars of the digits, is traced to identify the digit. Finally, if there is any ambiguity, it will be resolved. Experiments showed that this technique is flexible and can achieve high recognition accuracy for the shapes of the digits represented in this work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Digits%20Recognition" title="Digits Recognition">Digits Recognition</a>, <a href="https://publications.waset.org/search?q=Pattern%20Recognition" title=" Pattern Recognition"> Pattern Recognition</a>, <a href="https://publications.waset.org/search?q=FeatureExtraction" title=" FeatureExtraction"> FeatureExtraction</a>, <a href="https://publications.waset.org/search?q=Structural%20Primitives" title=" Structural Primitives"> Structural Primitives</a>, <a href="https://publications.waset.org/search?q=Document%20Processing" title=" Document Processing"> Document Processing</a>, <a href="https://publications.waset.org/search?q=Handwritten%20Recognition" title="Handwritten Recognition">Handwritten Recognition</a>, <a href="https://publications.waset.org/search?q=Primitives%20Selection." title=" Primitives Selection."> Primitives Selection.</a> </p> <a href="https://publications.waset.org/274/an-efficient-feature-extraction-algorithm-for-the-recognition-of-handwritten-arabic-digits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/274/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/274/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/274/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/274/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/274/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/274/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/274/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/274/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/274/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/274/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/274.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">2642</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">152</span> Effective Sonar Target Classification via Parallel Structure of Minimal Resource Allocation Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=W.S.%20Lim">W.S. Lim</a>, <a href="https://publications.waset.org/search?q=M.V.C.%20Rao"> M.V.C. Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the processing of sonar signals has been carried out using Minimal Resource Allocation Network (MRAN) and a Probabilistic Neural Network (PNN) in differentiation of commonly encountered features in indoor environments. The stability-plasticity behaviors of both networks have been investigated. The experimental result shows that MRAN possesses lower network complexity but experiences higher plasticity than PNN. An enhanced version called parallel MRAN (pMRAN) is proposed to solve this problem and is proven to be stable in prediction and also outperformed the original MRAN. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ultrasonic%20sensing" title="Ultrasonic sensing">Ultrasonic sensing</a>, <a href="https://publications.waset.org/search?q=target%20classification" title=" target classification"> target classification</a>, <a href="https://publications.waset.org/search?q=minimalresource%20allocation%20network%20%28MRAN%29" title=" minimalresource allocation network (MRAN)"> minimalresource allocation network (MRAN)</a>, <a href="https://publications.waset.org/search?q=probabilistic%20neural%20network%28PNN%29" title=" probabilistic neural network(PNN)"> probabilistic neural network(PNN)</a>, <a href="https://publications.waset.org/search?q=stability-plasticity%20dilemma." title=" stability-plasticity dilemma."> stability-plasticity dilemma.</a> </p> <a href="https://publications.waset.org/3276/effective-sonar-target-classification-via-parallel-structure-of-minimal-resource-allocation-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3276/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3276/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3276/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3276/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3276/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3276/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3276/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3276/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3276/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3276/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3276.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">1596</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">151</span> Estimating an Optimal Neighborhood Size in the Spherical Self-Organizing Feature Map</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Alexandros%20Leontitsis">Alexandros Leontitsis</a>, <a href="https://publications.waset.org/search?q=Archana%20P.%20Sangole"> Archana P. Sangole</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article presents a short discussion on optimum neighborhood size selection in a spherical selforganizing feature map (SOFM). A majority of the literature on the SOFMs have addressed the issue of selecting optimal learning parameters in the case of Cartesian topology SOFMs. However, the use of a Spherical SOFM suggested that the learning aspects of Cartesian topology SOFM are not directly translated. This article presents an approach on how to estimate the neighborhood size of a spherical SOFM based on the data. It adopts the L-curve criterion, previously suggested for choosing the regularization parameter on problems of linear equations where their right-hand-side is contaminated with noise. Simulation results are presented on two artificial 4D data sets of the coupled Hénon-Ikeda map. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parameter%20estimation" title="Parameter estimation">Parameter estimation</a>, <a href="https://publications.waset.org/search?q=self-organizing%20feature%20maps" title=" self-organizing feature maps"> self-organizing feature maps</a>, <a href="https://publications.waset.org/search?q=spherical%20topology." title="spherical topology.">spherical topology.</a> </p> <a href="https://publications.waset.org/2190/estimating-an-optimal-neighborhood-size-in-the-spherical-self-organizing-feature-map" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2190/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2190/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2190/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2190/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2190/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2190/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2190/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2190/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2190/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2190/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2190.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">1519</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">150</span> A Novel Approach to Fault Classification and Fault Location for Medium Voltage Cables Based on Artificial Neural Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20Khorashadi-Zadeh">H. Khorashadi-Zadeh</a>, <a href="https://publications.waset.org/search?q=M.%20R.%20Aghaebrahimi"> M. R. Aghaebrahimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A novel application of neural network approach to fault classification and fault location of Medium voltage cables is demonstrated in this paper. Different faults on a protected cable should be classified and located correctly. This paper presents the use of neural networks as a pattern classifier algorithm to perform these tasks. The proposed scheme is insensitive to variation of different parameters such as fault type, fault resistance, and fault inception angle. Studies show that the proposed technique is able to offer high accuracy in both of the fault classification and fault location tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20neural%20networks" title="Artificial neural networks">Artificial neural networks</a>, <a href="https://publications.waset.org/search?q=cable" title=" cable"> cable</a>, <a href="https://publications.waset.org/search?q=fault%20location%20andfault%20classification." title=" fault location andfault classification."> fault location andfault classification.</a> </p> <a href="https://publications.waset.org/15692/a-novel-approach-to-fault-classification-and-fault-location-for-medium-voltage-cables-based-on-artificial-neural-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15692/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15692/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15692/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15692/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15692/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15692/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15692/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15692/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15692/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15692/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15692.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">1851</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">149</span> Maya Semantic Technique: A Mathematical Technique Used to Determine Partial Semantics for Declarative Sentences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Marcia%20T.%20Mitchell">Marcia T. Mitchell</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This research uses computational linguistics, an area of study that employs a computer to process natural language, and aims at discerning the patterns that exist in declarative sentences used in technical texts. The approach is mathematical, and the focus is on instructional texts found on web pages. The technique developed by the author and named the MAYA Semantic Technique is used here and organized into four stages. In the first stage, the parts of speech in each sentence are identified. In the second stage, the subject of the sentence is determined. In the third stage, MAYA performs a frequency analysis on the remaining words to determine the verb and its object. In the fourth stage, MAYA does statistical analysis to determine the content of the web page. The advantage of the MAYA Semantic Technique lies in its use of mathematical principles to represent grammatical operations which assist processing and accuracy if performed on unambiguous text. The MAYA Semantic Technique is part of a proposed architecture for an entire web-based intelligent tutoring system. On a sample set of sentences, partial semantics derived using the MAYA Semantic Technique were approximately 80% accurate. The system currently processes technical text in one domain, namely Cµ programming. In this domain all the keywords and programming concepts are known and understood.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Natural%20language%20understanding" title="Natural language understanding">Natural language understanding</a>, <a href="https://publications.waset.org/search?q=computational%20linguistics" title=" computational linguistics"> computational linguistics</a>, <a href="https://publications.waset.org/search?q=knowledge%20representation" title=" knowledge representation"> knowledge representation</a>, <a href="https://publications.waset.org/search?q=linguistic%20theories." title=" linguistic theories."> linguistic theories.</a> </p> <a href="https://publications.waset.org/9639/maya-semantic-technique-a-mathematical-technique-used-to-determine-partial-semantics-for-declarative-sentences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9639/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9639/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9639/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9639/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9639/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9639/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9639/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9639/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9639/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9639/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9639.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">1671</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">148</span> Modeling of Crude Oil Blending via Discrete-Time Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xiaoou%20Li">Xiaoou Li</a>, <a href="https://publications.waset.org/search?q=Wen%20Yu"> Wen Yu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Crude oil blending is an important unit operation in petroleum refining industry. A good model for the blending system is beneficial for supervision operation, prediction of the export petroleum quality and realizing model-based optimal control. Since the blending cannot follow the ideal mixing rule in practice, we propose a static neural network to approximate the blending properties. By the dead-zone approach, we propose a new robust learning algorithm and give theoretical analysis. Real data of crude oil blending is applied to illustrate the neuro modeling approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Neural%20networks" title="Neural networks">Neural networks</a>, <a href="https://publications.waset.org/search?q=modeling" title=" modeling"> modeling</a>, <a href="https://publications.waset.org/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/search?q=crude%20oil." title=" crude oil."> crude oil.</a> </p> <a href="https://publications.waset.org/11060/modeling-of-crude-oil-blending-via-discrete-time-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11060/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11060/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11060/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11060/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11060/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11060/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11060/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11060/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11060/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11060/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11060.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">2263</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">147</span> Face Tracking using a Polling Strategy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rodrigo%20Montufar-Chaveznava">Rodrigo Montufar-Chaveznava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The colors of the human skin represent a special category of colors, because they are distinctive from the colors of other natural objects. This category is found as a cluster in color spaces, and the skin color variations between people are mostly due to differences in the intensity. Besides, the face detection based on skin color detection is a faster method as compared to other techniques. In this work, we present a system to track faces by carrying out skin color detection in four different color spaces: HSI, YCbCr, YES and RGB. Once some skin color regions have been detected for each color space, we label each and get some characteristics such as size and position. We are supposing that a face is located in one the detected regions. Next, we compare and employ a polling strategy between labeled regions to determine the final region where the face effectively has been detected and located. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Tracking" title="Tracking">Tracking</a>, <a href="https://publications.waset.org/search?q=face%20detection" title=" face detection"> face detection</a>, <a href="https://publications.waset.org/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/search?q=colorspaces." title=" colorspaces."> colorspaces.</a> </p> <a href="https://publications.waset.org/5467/face-tracking-using-a-polling-strategy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5467/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5467/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5467/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5467/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5467/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5467/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5467/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5467/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5467/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5467/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5467.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">1579</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">146</span> Partial 3D Reconstruction using Evolutionary Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M%C3%B3nica%20P%C3%A9rez-Meza">Mónica Pérez-Meza</a>, <a href="https://publications.waset.org/search?q=Rodrigo%20Mont%C3%BAfar-Chaveznava"> Rodrigo Montúfar-Chaveznava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When reconstructing a scenario, it is necessary to know the structure of the elements present on the scene to have an interpretation. In this work we link 3D scenes reconstruction to evolutionary algorithms through the vision stereo theory. We consider vision stereo as a method that provides the reconstruction of a scene using only a couple of images of the scene and performing some computation. Through several images of a scene, captured from different positions, vision stereo can give us an idea about the threedimensional characteristics of the world. Vision stereo usually requires of two cameras, making an analogy to the mammalian vision system. In this work we employ only a camera, which is translated along a path, capturing images every certain distance. As we can not perform all computations required for an exhaustive reconstruction, we employ an evolutionary algorithm to partially reconstruct the scene in real time. The algorithm employed is the fly algorithm, which employ “flies" to reconstruct the principal characteristics of the world following certain evolutionary rules. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=3D%20Reconstruction" title="3D Reconstruction">3D Reconstruction</a>, <a href="https://publications.waset.org/search?q=Computer%20Vision" title=" Computer Vision"> Computer Vision</a>, <a href="https://publications.waset.org/search?q=EvolutionaryAlgorithms" title=" EvolutionaryAlgorithms"> EvolutionaryAlgorithms</a>, <a href="https://publications.waset.org/search?q=Vision%20Stereo." title=" Vision Stereo."> Vision Stereo.</a> </p> <a href="https://publications.waset.org/629/partial-3d-reconstruction-using-evolutionary-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/629/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/629/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/629/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/629/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/629/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/629/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/629/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/629/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/629/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/629/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/629.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">1886</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">145</span> Demand and Price Evolution Forecasting as Tools for Facilitating the RoadMapping Process of the Photonic Component Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20Kamalakis">T. Kamalakis</a>, <a href="https://publications.waset.org/search?q=I.%20Neokosmidis"> I. Neokosmidis</a>, <a href="https://publications.waset.org/search?q=D.%20Varoutas"> D. Varoutas</a>, <a href="https://publications.waset.org/search?q=T.%20Sphicopoulos"> T. Sphicopoulos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The photonic component industry is a highly innovative industry with a large value chain. In order to ensure the growth of the industry much effort must be devoted to road mapping activities. In such activities demand and price evolution forecasting tools can prove quite useful in order to help in the roadmap refinement and update process. This paper attempts to provide useful guidelines in roadmapping of optical components and considers two models based on diffusion theory and the extended learning curve for demand and price evolution forecasting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Roadmapping" title="Roadmapping">Roadmapping</a>, <a href="https://publications.waset.org/search?q=Photonic%20Components" title=" Photonic Components"> Photonic Components</a>, <a href="https://publications.waset.org/search?q=Forecasting" title=" Forecasting"> Forecasting</a>, <a href="https://publications.waset.org/search?q=Diffusion%20Theory." title="Diffusion Theory.">Diffusion Theory.</a> </p> <a href="https://publications.waset.org/2488/demand-and-price-evolution-forecasting-as-tools-for-facilitating-the-roadmapping-process-of-the-photonic-component-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2488/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2488/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2488/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2488/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2488/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2488/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2488/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2488/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2488/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2488/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2488.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">1379</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">144</span> Design of an SNMP Agent for OSGi Service Platforms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Pedro%20J.%20Mu%C3%B1oz%20Merino">Pedro J. Muñoz Merino</a>, <a href="https://publications.waset.org/search?q=Natividad%20Mart%C3%ADnez%20Madrid"> Natividad Martínez Madrid</a>, <a href="https://publications.waset.org/search?q=Ralf%20E.%20D.%20Seepold"> Ralf E. D. Seepold</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On one hand, SNMP (Simple Network Management Protocol) allows integrating different enterprise elements connected through Internet into a standardized remote management. On the other hand, as a consequence of the success of Intelligent Houses they can be connected through Internet now by means of a residential gateway according to a common standard called OSGi (Open Services Gateway initiative). Due to the specifics of OSGi Service Platforms and their dynamic nature, specific design criterions should be defined to implement SNMP Agents for OSGi in order to integrate them into the SNMP remote management. Based on the analysis of the relation between both standards (SNMP and OSGi), this paper shows how OSGi Service Platforms can be included into the SNMP management of a global enterprise, giving implementation details about an SNMP Agent solution and the definition of a new MIB (Management Information Base) for managing OSGi platforms that takes into account the specifics and dynamic nature of OSGi. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=MIB" title="MIB">MIB</a>, <a href="https://publications.waset.org/search?q=OSGi" title=" OSGi"> OSGi</a>, <a href="https://publications.waset.org/search?q=Remote%20Management" title=" Remote Management"> Remote Management</a>, <a href="https://publications.waset.org/search?q=SNMP." title=" SNMP."> SNMP.</a> </p> <a href="https://publications.waset.org/15012/design-of-an-snmp-agent-for-osgi-service-platforms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15012/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15012/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15012/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15012/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15012/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15012/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15012/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15012/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15012/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15012/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15012.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">1564</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">143</span> A 1.5V,100MS/s,12-bit Current-Mode CMOSS ample-and-Hold Circuit</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=O.%20Hashemipour">O. Hashemipour</a>, <a href="https://publications.waset.org/search?q=S.%20G.%20Nabavi"> S. G. Nabavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A high-linearity and high-speed current-mode sampleand- hold circuit is designed and simulated using a 0.25μm CMOS technology. This circuit design is based on low voltage and it utilizes a fully differential circuit. Due to the use of only two switches the switch related noise has been reduced. Signal - dependent -error is completely eliminated by a new zero voltage switching technique. The circuit has a linearity error equal to ±0.05μa, i.e. 12-bit accuracy with a ±160 μa differential output - input signal frequency of 5MHZ, and sampling frequency of 100 MHZ. Third harmonic is equal to –78dB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Zero-voltage-technique" title="Zero-voltage-technique">Zero-voltage-technique</a>, <a href="https://publications.waset.org/search?q=MOS-resistor" title=" MOS-resistor"> MOS-resistor</a>, <a href="https://publications.waset.org/search?q=OTA" title=" OTA"> OTA</a>, <a href="https://publications.waset.org/search?q=Feedback-resistor." title="Feedback-resistor.">Feedback-resistor.</a> </p> <a href="https://publications.waset.org/15494/a-15v100mss12-bit-current-mode-cmoss-ample-and-hold-circuit" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15494/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15494/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15494/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15494/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15494/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15494/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15494/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15494/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15494/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15494/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15494.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">1406</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">142</span> Modeling “Web of Trust“ with Web 2.0</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Omer%20Mahmood">Omer Mahmood</a>, <a href="https://publications.waset.org/search?q=Selvakennedy%20Selvadurai"> Selvakennedy Selvadurai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> “Web of Trust" is one of the recognized goals for Web 2.0. It aims to make it possible for the people to take responsibility for what they publish on the web, including organizations, businesses and individual users. These objectives, among others, drive most of the technologies and protocols recently standardized by the governing bodies. One of the great advantages of Web infrastructure is decentralization of publication. The primary motivation behind Web 2.0 is to assist the people to add contents for Collective Intelligence (CI) while providing mechanisms to link content with people for evaluations and accountability of information. Such structure of contents will interconnect users and contents so that users can use contents to find participants and vice versa. This paper proposes conceptual information storage and linking model, based on decentralized information structure, that links contents and people together. The model uses FOAF, Atom, RDF and RDFS and can be used as a blueprint to develop Web 2.0 applications for any e-domain. However, primary target for this paper is online trust evaluation domain. The proposed model targets to assist the individuals to establish “Web of Trust" in online trust domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Web%20of%20Trust" title="Web of Trust">Web of Trust</a>, <a href="https://publications.waset.org/search?q=Semantic%20Web" title=" Semantic Web"> Semantic Web</a>, <a href="https://publications.waset.org/search?q=Electronic%20SocialNetworks" title=" Electronic SocialNetworks"> Electronic SocialNetworks</a>, <a href="https://publications.waset.org/search?q=Information%20Management" title=" Information Management"> Information Management</a> </p> <a href="https://publications.waset.org/7014/modeling-web-of-trust-with-web-20" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7014/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7014/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7014/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7014/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7014/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7014/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7014/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7014/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7014/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7014/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7014.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">2222</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">141</span> Effective Software-Based Solution for Processing Mass Downstream Data in Interactive Push VOD System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ni%20Hong">Ni Hong</a>, <a href="https://publications.waset.org/search?q=Wu%20Guobin"> Wu Guobin</a>, <a href="https://publications.waset.org/search?q=Wu%20Gang"> Wu Gang</a>, <a href="https://publications.waset.org/search?q=Pan%20Liang"> Pan Liang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Interactive push VOD system is a new kind of system that incorporates push technology and interactive technique. It can push movies to users at high speeds at off-peak hours for optimal network usage so as to save bandwidth. This paper presents effective software-based solution for processing mass downstream data at terminals of interactive push VOD system, where the service can download movie according to a viewer-s selection. The downstream data is divided into two catalogs: (1) the carousel data delivered according to DSM-CC protocol; (2) IP data delivered according to Euro-DOCSIS protocol. In order to accelerate download speed and reduce data loss rate at terminals, this software strategy introduces caching, multi-thread and resuming mechanisms. The experiments demonstrate advantages of the software-based solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=DSM-CC" title="DSM-CC">DSM-CC</a>, <a href="https://publications.waset.org/search?q=data%20carousel" title=" data carousel"> data carousel</a>, <a href="https://publications.waset.org/search?q=Euro-DOCSIS" title=" Euro-DOCSIS"> Euro-DOCSIS</a>, <a href="https://publications.waset.org/search?q=push%20VOD." title=" push VOD."> push VOD.</a> </p> <a href="https://publications.waset.org/3834/effective-software-based-solution-for-processing-mass-downstream-data-in-interactive-push-vod-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3834/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3834/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3834/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3834/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3834/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3834/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3834/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3834/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3834/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3834/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3834.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">1489</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">140</span> Application of Genetic Algorithms to Feature Subset Selection in a Farsi OCR</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Soryani">M. Soryani</a>, <a href="https://publications.waset.org/search?q=N.%20Rafat"> N. Rafat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dealing with hundreds of features in character recognition systems is not unusual. This large number of features leads to the increase of computational workload of recognition process. There have been many methods which try to remove unnecessary or redundant features and reduce feature dimensionality. Besides because of the characteristics of Farsi scripts, it-s not possible to apply other languages algorithms to Farsi directly. In this paper some methods for feature subset selection using genetic algorithms are applied on a Farsi optical character recognition (OCR) system. Experimental results show that application of genetic algorithms (GA) to feature subset selection in a Farsi OCR results in lower computational complexity and enhanced recognition rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Feature%20Subset%20Selection" title="Feature Subset Selection">Feature Subset Selection</a>, <a href="https://publications.waset.org/search?q=Genetic%20Algorithms" title=" Genetic Algorithms"> Genetic Algorithms</a>, <a href="https://publications.waset.org/search?q=Optical%20Character%20Recognition." title="Optical Character Recognition.">Optical Character Recognition.</a> </p> <a href="https://publications.waset.org/5202/application-of-genetic-algorithms-to-feature-subset-selection-in-a-farsi-ocr" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5202/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5202/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5202/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5202/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5202/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5202/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5202/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5202/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5202/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5202/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5202.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">1979</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">139</span> Air-Filled Circular Cross Sectional Cavity for Microwave Non-Destructive Testing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohd%20Tarmizi%20Ali">Mohd Tarmizi Ali</a>, <a href="https://publications.waset.org/search?q=Mohd%20Khairul%20Mohd%20Salleh"> Mohd Khairul Mohd Salleh</a>, <a href="https://publications.waset.org/search?q=Md.%20Mahfudz%20Md.%20Zan"> Md. Mahfudz Md. Zan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dielectric sheet perturbation to the dominant TE111 mode resonant frequency of a circular cavity is studied and presented in this paper. The dielectric sheet, placed at the middle of the airfilled cavity, introduces discontinuities and disturbs the configuration of electromagnetic fields in the cavity. For fixed dimensions of cavity and fixed thickness of the loading dielectric, the dominant resonant frequency varies quite linearly with the permittivity of the dielectric. This quasi-linear relationship is plotted using Maple software and verified using 3D electromagnetic simulations. Two probes are used in the simulation for wave excitation into and from the cavity. The best length of probe is found to be 3 mm, giving the closest resonant frequency to the one calculated using Maple. A total of fourteen different dielectrics of permittivity ranging from 1 to 12.9 are tested one by one in the simulation. The works show very close agreement between the results from Maple and the simulation. A constant difference of 0.04 GHz is found between the resonant frequencies collected during simulation and the ones from Maple. The success of this project may lead to the possibility of using the middle loaded cavity at TE111 mode as a microwave non-destructive testing of solid materials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Middle-loaded%20cavity" title="Middle-loaded cavity">Middle-loaded cavity</a>, <a href="https://publications.waset.org/search?q=dielectric%20sheet%20perturbation." title=" dielectric sheet perturbation."> dielectric sheet perturbation.</a> </p> <a href="https://publications.waset.org/4485/air-filled-circular-cross-sectional-cavity-for-microwave-non-destructive-testing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4485/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4485/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4485/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4485/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4485/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4485/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4485/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4485/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4485/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4485/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4485.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">2344</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">138</span> Bandwidth, Area Efficient and Target Device Independent DDR SDRAM Controller</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20Mladenov">T. Mladenov</a>, <a href="https://publications.waset.org/search?q=F.%20Mujahid"> F. Mujahid</a>, <a href="https://publications.waset.org/search?q=E.%20Jung"> E. Jung</a>, <a href="https://publications.waset.org/search?q=D.%20Har"> D. Har</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The application of the synchronous dynamic random access memory (SDRAM) has gone beyond the scope of personal computers for quite a long time. It comes into hand whenever a big amount of low price and still high speed memory is needed. Most of the newly developed stand alone embedded devices in the field of image, video and sound processing take more and more use of it. The big amount of low price memory has its trade off – the speed. In order to take use of the full potential of the memory, an efficient controller is needed. Efficient stands for maximum random accesses to the memory both for reading and writing and less area after implementation. This paper proposes a target device independent DDR SDRAM pipelined controller and provides performance comparison with available solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=DDR%20SDRAM" title="DDR SDRAM">DDR SDRAM</a>, <a href="https://publications.waset.org/search?q=controller" title=" controller"> controller</a>, <a href="https://publications.waset.org/search?q=effective%20implementation" title=" effective implementation"> effective implementation</a> </p> <a href="https://publications.waset.org/10742/bandwidth-area-efficient-and-target-device-independent-ddr-sdram-controller" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10742/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10742/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10742/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10742/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10742/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10742/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10742/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10742/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10742/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10742/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10742.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">1554</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">137</span> Improvements in Navy Data Networks and Tactical Communication Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Laurent%20Enel">Laurent Enel</a>, <a href="https://publications.waset.org/search?q=Franck%20Guillem"> Franck Guillem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the benefits gained by using an efficient quality of service management such as DiffServ technique to improve the performance of military communications. Low delay and no blockage must be achieved especially for real time tactical data. All traffic flows generated by different applications do not need same bandwidth, same latency, same error ratio and this scalable technique of packet management based on priority levels is analysed. End to end architectures supporting various traffic flows and including lowbandwidth and high-delay HF or SHF military links as well as unprotected Internet sub domains are studied. A tuning of Diffserv parameters is proposed in accordance with different loads of various traffic and different operational situations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Military%20data%20networks" title="Military data networks">Military data networks</a>, <a href="https://publications.waset.org/search?q=Quality%20of%20service" title=" Quality of service"> Quality of service</a>, <a href="https://publications.waset.org/search?q=Tacticalsystems." title=" Tacticalsystems."> Tacticalsystems.</a> </p> <a href="https://publications.waset.org/15544/improvements-in-navy-data-networks-and-tactical-communication-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15544/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15544/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15544/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15544/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15544/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15544/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15544/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15544/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15544/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15544/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15544.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">2069</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">136</span> Application of ESA in the CAVE Mode Authentication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Keonwoo%20Kim">Keonwoo Kim</a>, <a href="https://publications.waset.org/search?q=Dowon%20Hong"> Dowon Hong</a>, <a href="https://publications.waset.org/search?q=Kyoil%20Chung"> Kyoil Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes the authentication method using ESA algorithm instead of using CAVE algorithm in the CDMA mobile communication systems including IS-95 and CDMA2000 1x. And, we analyze to apply ESA mechanism on behalf of CAVE mechanism without the change of message format and air interface in the existing CDMA systems. If ESA algorithm can be used as the substitution of CAVE algorithm, security strength of authentication algorithm is intensified without protocol change. An algorithm replacement proposed in this paper is not to change an authentication mechanism, but to configure input of ESA algorithm and to produce output. Therefore, our proposal can be the compatible to the existing systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ESA" title="ESA">ESA</a>, <a href="https://publications.waset.org/search?q=CAVE" title=" CAVE"> CAVE</a>, <a href="https://publications.waset.org/search?q=CDMA" title=" CDMA"> CDMA</a>, <a href="https://publications.waset.org/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/search?q=mobilecommunication." title=" mobilecommunication."> mobilecommunication.</a> </p> <a href="https://publications.waset.org/3251/application-of-esa-in-the-cave-mode-authentication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3251/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3251/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3251/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3251/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3251/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3251/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3251/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3251/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3251/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3251/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3251.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">1592</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">135</span> The Effect of Different Compression Schemes on Speech Signals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jalal%20Karam">Jalal Karam</a>, <a href="https://publications.waset.org/search?q=Raed%20Saad"> Raed Saad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies the effect of different compression constraints and schemes presented in a new and flexible paradigm to achieve high compression ratios and acceptable signal to noise ratios of Arabic speech signals. Compression parameters are computed for variable frame sizes of a level 5 to 7 Discrete Wavelet Transform (DWT) representation of the signals for different analyzing mother wavelet functions. Results are obtained and compared for Global threshold and level dependent threshold techniques. The results obtained also include comparisons with Signal to Noise Ratios, Peak Signal to Noise Ratios and Normalized Root Mean Square Error. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Speech%20Compression" title="Speech Compression">Speech Compression</a>, <a href="https://publications.waset.org/search?q=Wavelets." title=" Wavelets."> Wavelets.</a> </p> <a href="https://publications.waset.org/11387/the-effect-of-different-compression-schemes-on-speech-signals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11387/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11387/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11387/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11387/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11387/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11387/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11387/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11387/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11387/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11387/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11387.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">1734</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">134</span> Towards an AS Level Network Performance Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Huan%20Xiong">Huan Xiong</a>, <a href="https://publications.waset.org/search?q=Ming%20Chen"> Ming Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to research Internet quantificationally and better model the performance of network, this paper proposes a novel AS level network performance model (MNPM), it takes autonomous system (AS) as basic modeling unit, measures E2E performance between any two outdegrees of an AS and organizes measurement results into matrix form which called performance matrix (PM). Inter-AS performance calculation is defined according to performance information stored in PM. Simulation has been implemented to verify the correctness of MNPM and a practical application of MNPM (network congestion detection) is given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AS" title="AS">AS</a>, <a href="https://publications.waset.org/search?q=network%20performance" title=" network performance"> network performance</a>, <a href="https://publications.waset.org/search?q=model" title=" model"> model</a>, <a href="https://publications.waset.org/search?q=metric" title=" metric"> metric</a>, <a href="https://publications.waset.org/search?q=congestion." title=" congestion."> congestion.</a> </p> <a href="https://publications.waset.org/362/towards-an-as-level-network-performance-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/362/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/362/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/362/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/362/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/362/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/362/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/362/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/362/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/362/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/362/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/362.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">1408</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">133</span> Quality of Service in Multioperator GPON Access Networks with Triple-Play Services</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Germ%C3%A1n%20Santos-Boada">Germán Santos-Boada</a>, <a href="https://publications.waset.org/search?q=Jordi%20Domingo-Pascual"> Jordi Domingo-Pascual</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, in some places, optical-fibre access networks have been used with GPON technology belonging to organizations (in most cases public bodies) that act as neutral operators. These operators simultaneously provide network services to various telecommunications operators that offer integrated voice, data and television services. This situation creates new problems related to quality of service, since the interests of the users are intermingled with the interests of the operators. In this paper, we analyse this problem and consider solutions that make it possible to provide guaranteed quality of service for voice over IP, data services and interactive digital television. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=GPON%20networks" title="GPON networks">GPON networks</a>, <a href="https://publications.waset.org/search?q=multioperator" title=" multioperator"> multioperator</a>, <a href="https://publications.waset.org/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/search?q=triple-play%20services." title="triple-play services.">triple-play services.</a> </p> <a href="https://publications.waset.org/7220/quality-of-service-in-multioperator-gpon-access-networks-with-triple-play-services" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7220/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7220/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7220/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7220/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7220/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7220/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7220/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7220/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7220/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7220/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7220.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">3433</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">132</span> An Approach to Solving a Permutation Problem of Frequency Domain Independent Component Analysis for Blind Source Separation of Speech Signals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Masaru%20Fujieda">Masaru Fujieda</a>, <a href="https://publications.waset.org/search?q=Takahiro%20Murakami"> Takahiro Murakami</a>, <a href="https://publications.waset.org/search?q=Yoshihisa%20Ishida"> Yoshihisa Ishida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Independent component analysis (ICA) in the frequency domain is used for solving the problem of blind source separation (BSS). However, this method has some problems. For example, a general ICA algorithm cannot determine the permutation of signals which is important in the frequency domain ICA. In this paper, we propose an approach to the solution for a permutation problem. The idea is to effectively combine two conventional approaches. This approach improves the signal separation performance by exploiting features of the conventional approaches. We show the simulation results using artificial data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Blind%20source%20separation" title="Blind source separation">Blind source separation</a>, <a href="https://publications.waset.org/search?q=Independent%20componentanalysis" title=" Independent componentanalysis"> Independent componentanalysis</a>, <a href="https://publications.waset.org/search?q=Frequency%20domain" title=" Frequency domain"> Frequency domain</a>, <a href="https://publications.waset.org/search?q=Permutation%20ambiguity." title=" Permutation ambiguity."> Permutation ambiguity.</a> </p> <a href="https://publications.waset.org/3094/an-approach-to-solving-a-permutation-problem-of-frequency-domain-independent-component-analysis-for-blind-source-separation-of-speech-signals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3094/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3094/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3094/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3094/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3094/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3094/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3094/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3094/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3094/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3094/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3094.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">1786</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">131</span> A Wireless Secure Remote Access Architecture Implementing Role Based Access Control: WiSeR</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=E.%20Tomur">E. Tomur</a>, <a href="https://publications.waset.org/search?q=R.%20Deregozu"> R. Deregozu</a>, <a href="https://publications.waset.org/search?q=T.%20Genc"> T. Genc</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we propose a network architecture for providing secure access to information resources of enterprise network from remote locations in a wireless fashion. Our proposed architecture offers a very promising solution for organizations which are in need of a secure, flexible and cost-effective remote access methodology. Security of the proposed architecture is based on Virtual Private Network technology and a special role based access control mechanism with location and time constraints. The flexibility mainly comes from the use of Internet as the communication medium and cost-effectiveness is due to the possibility of in-house implementation of the proposed architecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Remote%20access" title="Remote access">Remote access</a>, <a href="https://publications.waset.org/search?q=wireless%20networks" title=" wireless networks"> wireless networks</a>, <a href="https://publications.waset.org/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/search?q=virtualprivate%20networks" title=" virtualprivate networks"> virtualprivate networks</a>, <a href="https://publications.waset.org/search?q=RBAC." title=" RBAC."> RBAC.</a> </p> <a href="https://publications.waset.org/711/a-wireless-secure-remote-access-architecture-implementing-role-based-access-control-wiser" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/711/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/711/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/711/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/711/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/711/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/711/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/711/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/711/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/711/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/711/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/711.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">1698</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">130</span> The Tag Authentication Scheme using Self-Shrinking Generator on RFID System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=HangRok%20Lee">HangRok Lee</a>, <a href="https://publications.waset.org/search?q=DoWon%20Hong"> DoWon Hong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since communications between tag and reader in RFID system are by radio, anyone can access the tag and obtain its any information. And a tag always replies with the same ID so that it is hard to distinguish between a real and a fake tag. Thus, there are many security problems in today-s RFID System. Firstly, unauthorized reader can easily read the ID information of any Tag. Secondly, Adversary can easily cheat the legitimate reader using the collected Tag ID information, such as the any legitimate Tag. These security problems can be typically solved by encryption of messages transmitted between Tag and Reader and by authentication for Tag. In this paper, to solve these security problems on RFID system, we propose the Tag Authentication Scheme based on self shrinking generator (SSG). SSG Algorithm using in our scheme is proposed by W.Meier and O.Staffelbach in EUROCRYPT-94. This Algorithm is organized that only one LFSR and selection logic in order to generate random stream. Thus it is optimized to implement the hardware logic on devices with extremely limited resource, and the output generating from SSG at each time do role as random stream so that it is allow our to design the light-weight authentication scheme with security against some network attacks. Therefore, we propose the novel tag authentication scheme which use SSG to encrypt the Tag-ID transmitted from tag to reader and achieve authentication of tag. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=RFID%20system" title="RFID system">RFID system</a>, <a href="https://publications.waset.org/search?q=RFID%20security" title=" RFID security"> RFID security</a>, <a href="https://publications.waset.org/search?q=self%20shrinkinggeneratior" title=" self shrinkinggeneratior"> self shrinkinggeneratior</a>, <a href="https://publications.waset.org/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/search?q=protocol." title=" protocol."> protocol.</a> </p> <a href="https://publications.waset.org/6443/the-tag-authentication-scheme-using-self-shrinking-generator-on-rfid-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6443/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6443/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6443/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6443/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6443/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6443/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6443/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6443/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6443/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6443/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6443.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">1628</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">129</span> Simulation and Measurement the Radiation of an Antenna inside a Metallic Case using FDTD</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shabnam%20Ladan">Shabnam Ladan</a>, <a href="https://publications.waset.org/search?q=M.%20S.%20Abrishamian"> M. S. Abrishamian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we have developed a FDTD simulation code which can treat wave propagation of a monopole antenna in a metallic case which covers with PML, and performed a series of three dimensional FDTD simulations of electromagnetic wave propagation in this space .We also provide a measurement set up in antenna lab and fortunately the simulations and measurements show good agreement. According to simulation and measurement results, we confirmed that the computer program which had been written in FORTRAN, works correctly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=FDTD" title="FDTD">FDTD</a>, <a href="https://publications.waset.org/search?q=EMC" title=" EMC"> EMC</a>, <a href="https://publications.waset.org/search?q=monopole%20antenna." title=" monopole antenna."> monopole antenna.</a> </p> <a href="https://publications.waset.org/6838/simulation-and-measurement-the-radiation-of-an-antenna-inside-a-metallic-case-using-fdtd" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6838/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6838/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6838/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6838/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6838/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6838/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6838/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6838/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6838/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6838/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6838.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">1535</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">128</span> The Application of Hadamard Matrixes in the SNR Enhancement of Optical Time-Domain Reflectometry(OTDR)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mingyu%20Zhong">Mingyu Zhong</a>, <a href="https://publications.waset.org/search?q=Yi%20Xie"> Yi Xie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Results in one field necessarily give insight into the others, and all have much potential for scientific and technological application. The Hadamard-transform technique once been applied to the spectrometry also has its use in the SNR Enhancement of OTDR. In this report, a new set of code (Simplex-codes) is discussed and where the addition gain of SNR come from is implied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hadamard-transform" title="Hadamard-transform">Hadamard-transform</a>, <a href="https://publications.waset.org/search?q=matrixes" title=" matrixes"> matrixes</a>, <a href="https://publications.waset.org/search?q=averaging" title=" averaging"> averaging</a>, <a href="https://publications.waset.org/search?q=opticaltime-domain%20reflectometry%20%28OTDR%29." title=" opticaltime-domain reflectometry (OTDR)."> opticaltime-domain reflectometry (OTDR).</a> </p> <a href="https://publications.waset.org/651/the-application-of-hadamard-matrixes-in-the-snr-enhancement-of-optical-time-domain-reflectometryotdr" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/651/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/651/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/651/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/651/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/651/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/651/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/651/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/651/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/651/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/651/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/651.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">1311</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">127</span> Liveness Detection for Embedded Face Recognition System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hyung-Keun%20Jee">Hyung-Keun Jee</a>, <a href="https://publications.waset.org/search?q=Sung-Uk%20Jung"> Sung-Uk Jung</a>, <a href="https://publications.waset.org/search?q=Jang-Hee%20Yoo"> Jang-Hee Yoo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To increase reliability of face recognition system, the system must be able to distinguish real face from a copy of face such as a photograph. In this paper, we propose a fast and memory efficient method of live face detection for embedded face recognition system, based on the analysis of the movement of the eyes. We detect eyes in sequential input images and calculate variation of each eye region to determine whether the input face is a real face or not. Experimental results show that the proposed approach is competitive and promising for live face detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Liveness%20Detection" title="Liveness Detection">Liveness Detection</a>, <a href="https://publications.waset.org/search?q=Eye%20detection" title=" Eye detection"> Eye detection</a>, <a href="https://publications.waset.org/search?q=SQI." title=" SQI."> SQI.</a> </p> <a href="https://publications.waset.org/5308/liveness-detection-for-embedded-face-recognition-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5308/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5308/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5308/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5308/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5308/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5308/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5308/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5308/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5308/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5308/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5308.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">3181</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">126</span> A High-Frequency Low-Power Low-Pass-Filter-Based All-Current-Mirror Sinusoidal Quadrature Oscillator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Leelasantitham">A. Leelasantitham</a>, <a href="https://publications.waset.org/search?q=B.%20Srisuchinwong"> B. Srisuchinwong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A high-frequency low-power sinusoidal quadrature oscillator is presented through the use of two 2nd-order low-pass current-mirror (CM)-based filters, a 1st-order CM low-pass filter and a CM bilinear transfer function. The technique is relatively simple based on (i) inherent time constants of current mirrors, i.e. the internal capacitances and the transconductance of a diode-connected NMOS, (ii) a simple negative resistance RN formed by a resistor load RL of a current mirror. Neither external capacitances nor inductances are required. As a particular example, a 1.9-GHz, 0.45-mW, 2-V CMOS low-pass-filter-based all-current-mirror sinusoidal quadrature oscillator is demonstrated. The oscillation frequency (f0) is 1.9 GHz and is current-tunable over a range of 370 MHz or 21.6 %. The power consumption is at approximately 0.45 mW. The amplitude matching and the quadrature phase matching are better than 0.05 dB and 0.15°, respectively. Total harmonic distortions (THD) are less than 0.3 %. At 2 MHz offset from the 1.9 GHz, the carrier to noise ratio (CNR) is 90.01 dBc/Hz whilst the figure of merit called a normalized carrier-to-noise ratio (CNRnorm) is 153.03 dBc/Hz. The ratio of the oscillation frequency (f0) to the unity-gain frequency (fT) of a transistor is 0.25. Comparisons to other approaches are also included. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Sinusoidal%20quadrature%20oscillator" title="Sinusoidal quadrature oscillator">Sinusoidal quadrature oscillator</a>, <a href="https://publications.waset.org/search?q=low-pass-filterbased" title=" low-pass-filterbased"> low-pass-filterbased</a>, <a href="https://publications.waset.org/search?q=current-mirror%20bilinear%20transfer%20function" title="current-mirror bilinear transfer function">current-mirror bilinear transfer function</a>, <a href="https://publications.waset.org/search?q=all-current-mirror" title=" all-current-mirror"> all-current-mirror</a>, <a href="https://publications.waset.org/search?q=negative%20resistance" title="negative resistance">negative resistance</a>, <a href="https://publications.waset.org/search?q=low%20power" title=" low power"> low power</a>, <a href="https://publications.waset.org/search?q=high%20frequency" title=" high frequency"> high frequency</a>, <a href="https://publications.waset.org/search?q=low%20distortion." title=" low distortion."> low distortion.</a> </p> <a href="https://publications.waset.org/163/a-high-frequency-low-power-low-pass-filter-based-all-current-mirror-sinusoidal-quadrature-oscillator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/163/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/163/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/163/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/163/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/163/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/163/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/163/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/163/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/163/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/163/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/163.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">2070</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">125</span> Design of MBMS Client Functions in the Mobile</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jaewook%20Shin">Jaewook Shin</a>, <a href="https://publications.waset.org/search?q=Aesoon%20Park"> Aesoon Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> MBMS is a unidirectional point-to-multipoint bearer service in which data are transmitted from a single source entity to multiple recipients. For a mobile to support the MBMS, MBMS client functions as well as MBMS radio protocols should be designed and implemented. In this paper, we analyze the MBMS client functions and describe the implementation of them in our mobile test-bed. User operations and signaling flows between protocol entities to control the MBMS functions are designed in detail. Service announcement utilizing the file download MBMS service and four MBMS user services are demonstrated in the test-bed to verify the MBMS client functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=BM-SC" title="BM-SC">BM-SC</a>, <a href="https://publications.waset.org/search?q=Broadcast" title=" Broadcast"> Broadcast</a>, <a href="https://publications.waset.org/search?q=MBMS" title=" MBMS"> MBMS</a>, <a href="https://publications.waset.org/search?q=Mobile" title=" Mobile"> Mobile</a>, <a href="https://publications.waset.org/search?q=Multicast." title=" Multicast."> Multicast.</a> </p> <a href="https://publications.waset.org/2989/design-of-mbms-client-functions-in-the-mobile" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2989/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2989/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2989/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2989/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2989/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2989/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2989/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2989/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2989/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2989/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2989.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">1930</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">124</span> An Investigation into Kanji Character Discrimination Process from EEG Signals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hiroshi%20Abe">Hiroshi Abe</a>, <a href="https://publications.waset.org/search?q=Minoru%20Nakayama"> Minoru Nakayama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The frontal area in the brain is known to be involved in behavioral judgement. Because a Kanji character can be discriminated visually and linguistically from other characters, in Kanji character discrimination, we hypothesized that frontal event-related potential (ERP) waveforms reflect two discrimination processes in separate time periods: one based on visual analysis and the other based on lexcical access. To examine this hypothesis, we recorded ERPs while performing a Kanji lexical decision task. In this task, either a known Kanji character, an unknown Kanji character or a symbol was presented and the subject had to report if the presented character was a known Kanji character for the subject or not. The same response was required for unknown Kanji trials and symbol trials. As a preprocessing of signals, we examined the performance of a method using independent component analysis for artifact rejection and found it was effective. Therefore we used it. In the ERP results, there were two time periods in which the frontal ERP wavefoms were significantly different betweeen the unknown Kanji trials and the symbol trials: around 170ms and around 300ms after stimulus onset. This result supported our hypothesis. In addition, the result suggests that Kanji character lexical access may be fully completed by around 260ms after stimulus onset. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Character%20discrimination" title="Character discrimination">Character discrimination</a>, <a href="https://publications.waset.org/search?q=Event-related%20Potential" title=" Event-related Potential"> Event-related Potential</a>, <a href="https://publications.waset.org/search?q=IndependentComponent%20Analysis" title=" IndependentComponent Analysis"> IndependentComponent Analysis</a>, <a href="https://publications.waset.org/search?q=Kanji" title=" Kanji"> Kanji</a>, <a href="https://publications.waset.org/search?q=Lexical%20access." title=" Lexical access."> Lexical access.</a> </p> <a href="https://publications.waset.org/14219/an-investigation-into-kanji-character-discrimination-process-from-eeg-signals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14219/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14219/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14219/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14219/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14219/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14219/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14219/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14219/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14219/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14219/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14219.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">1784</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">123</span> Information Retrieval in the Semantic LIFE Personal Digital Memory Framework</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hanh%20Huu%20Hoang">Hanh Huu Hoang</a>, <a href="https://publications.waset.org/search?q=Tho%20Manh%20Nguyen"> Tho Manh Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ever increasing capacities of contemporary storage devices inspire the vision to accumulate (personal) information without the need of deleting old data over a long time-span. Hence the target of SemanticLIFE project is to create a Personal Information Management system for a human lifetime data. One of the most important characteristics of the system is its dedication to retrieve information in a very efficient way. By adopting user demands regarding the reduction of ambiguities, our approach aims at a user-oriented and yet powerful enough system with a satisfactory query performance. We introduce the query system of SemanticLIFE, the Virtual Query System, which uses emerging Semantic Web technologies to fulfill users- requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ontology-based%20Information%20Retrieval" title="Ontology-based Information Retrieval">Ontology-based Information Retrieval</a>, <a href="https://publications.waset.org/search?q=Digital%20Memories" title=" Digital Memories"> Digital Memories</a>, <a href="https://publications.waset.org/search?q=SemanticLIFE." title="SemanticLIFE.">SemanticLIFE.</a> </p> <a href="https://publications.waset.org/14905/information-retrieval-in-the-semantic-life-personal-digital-memory-framework" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14905/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14905/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14905/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14905/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14905/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14905/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14905/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14905/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14905/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14905/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14905.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">1346</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">122</span> Grid Computing in Physics and Life Sciences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Heinz%20Stockinger">Heinz Stockinger</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Certain sciences such as physics, chemistry or biology, have a strong computational aspect and use computing infrastructures to advance their scientific goals. Often, high performance and/or high throughput computing infrastructures such as clusters and computational Grids are applied to satisfy computational needs. In addition, these sciences are sometimes characterised by scientific collaborations requiring resource sharing which is typically provided by Grid approaches. In this article, I discuss Grid computing approaches in High Energy Physics as well as in bioinformatics and highlight some of my experience in both scientific domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Grid%20computing" title="Grid computing">Grid computing</a>, <a href="https://publications.waset.org/search?q=Web%20services" title=" Web services"> Web services</a>, <a href="https://publications.waset.org/search?q=physics" title=" physics"> physics</a>, <a href="https://publications.waset.org/search?q=bioinformatics" title=" bioinformatics"> bioinformatics</a> </p> <a href="https://publications.waset.org/15952/grid-computing-in-physics-and-life-sciences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15952/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15952/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15952/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15952/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15952/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15952/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15952/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15952/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15952/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15952/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15952.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">1544</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">121</span> System Identification with General Dynamic Neural Networks and Network Pruning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Christian%20Endisch">Christian Endisch</a>, <a href="https://publications.waset.org/search?q=Christoph%20Hackl"> Christoph Hackl</a>, <a href="https://publications.waset.org/search?q=Dierk%20Schr%C3%B6der"> Dierk Schröder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an exact pruning algorithm with adaptive pruning interval for general dynamic neural networks (GDNN). GDNNs are artificial neural networks with internal dynamics. All layers have feedback connections with time delays to the same and to all other layers. The structure of the plant is unknown, so the identification process is started with a larger network architecture than necessary. During parameter optimization with the Levenberg- Marquardt (LM) algorithm irrelevant weights of the dynamic neural network are deleted in order to find a model for the plant as simple as possible. The weights to be pruned are found by direct evaluation of the training data within a sliding time window. The influence of pruning on the identification system depends on the network architecture at pruning time and the selected weight to be deleted. As the architecture of the model is changed drastically during the identification and pruning process, it is suggested to adapt the pruning interval online. Two system identification examples show the architecture selection ability of the proposed pruning approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=System%20identification" title="System identification">System identification</a>, <a href="https://publications.waset.org/search?q=dynamic%20neural%20network" title=" dynamic neural network"> dynamic neural network</a>, <a href="https://publications.waset.org/search?q=recurrentneural%20network" title=" recurrentneural network"> recurrentneural network</a>, <a href="https://publications.waset.org/search?q=GDNN" title=" GDNN"> GDNN</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=Levenberg%20Marquardt" title=" Levenberg Marquardt"> Levenberg Marquardt</a>, <a href="https://publications.waset.org/search?q=realtime%20recurrent%20learning" title=" realtime recurrent learning"> realtime recurrent learning</a>, <a href="https://publications.waset.org/search?q=network%20pruning" title=" network pruning"> network pruning</a>, <a href="https://publications.waset.org/search?q=quasi-online%20learning." title=" quasi-online learning."> quasi-online learning.</a> </p> <a href="https://publications.waset.org/13248/system-identification-with-general-dynamic-neural-networks-and-network-pruning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13248/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13248/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13248/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13248/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13248/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13248/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13248/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13248/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13248/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13248/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13248.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">1937</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">120</span> Feature Based Dense Stereo Matching using Dynamic Programming and Color</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hajar%20Sadeghi">Hajar Sadeghi</a>, <a href="https://publications.waset.org/search?q=Payman%20Moallem"> Payman Moallem</a>, <a href="https://publications.waset.org/search?q=S.%20Amirhassn%20Monadjemi"> S. Amirhassn Monadjemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a new feature based dense stereo matching algorithm to obtain the dense disparity map via dynamic programming. After extraction of some proper features, we use some matching constraints such as epipolar line, disparity limit, ordering and limit of directional derivative of disparity as well. Also, a coarseto- fine multiresolution strategy is used to decrease the search space and therefore increase the accuracy and processing speed. The proposed method links the detected feature points into the chains and compares some of the feature points from different chains, to increase the matching speed. We also employ color stereo matching to increase the accuracy of the algorithm. Then after feature matching, we use the dynamic programming to obtain the dense disparity map. It differs from the classical DP methods in the stereo vision, since it employs sparse disparity map obtained from the feature based matching stage. The DP is also performed further on a scan line, between any matched two feature points on that scan line. Thus our algorithm is truly an optimization method. Our algorithm offers a good trade off in terms of accuracy and computational efficiency. Regarding the results of our experiments, the proposed algorithm increases the accuracy from 20 to 70%, and reduces the running time of the algorithm almost 70%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Chain%20Correspondence" title="Chain Correspondence">Chain Correspondence</a>, <a href="https://publications.waset.org/search?q=Color%20Stereo%20Matching" title=" Color Stereo Matching"> Color Stereo Matching</a>, <a href="https://publications.waset.org/search?q=Dynamic%20Programming" title="Dynamic Programming">Dynamic Programming</a>, <a href="https://publications.waset.org/search?q=Epipolar%20Line" title=" Epipolar Line"> Epipolar Line</a>, <a href="https://publications.waset.org/search?q=Stereo%20Vision." title=" Stereo Vision."> Stereo Vision.</a> </p> <a href="https://publications.waset.org/6889/feature-based-dense-stereo-matching-using-dynamic-programming-and-color" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6889/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6889/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6889/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6889/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6889/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6889/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6889/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6889/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6889/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6889/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6889.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">2349</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">119</span> Decision Making using Maximization of Negret</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jos%C3%A9%20M.%20Merig%C3%B3">José M. Merigó</a>, <a href="https://publications.waset.org/search?q=Montserrat%20Casanovas"> Montserrat Casanovas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We analyze the problem of decision making under ignorance with regrets. Recently, Yager has developed a new method for decision making where instead of using regrets he uses another type of transformation called negrets. Basically, the negret is considered as the dual of the regret. We study this problem in detail and we suggest the use of geometric aggregation operators in this method. For doing this, we develop a different method for constructing the negret matrix where all the values are positive. The main result obtained is that now the model is able to deal with negative numbers because of the transformation done in the negret matrix. We further extent these results to another model developed also by Yager about mixing valuations and negrets. Unfortunately, in this case we are not able to deal with negative numbers because the valuations can be either positive or negative. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decision%20Making" title="Decision Making">Decision Making</a>, <a href="https://publications.waset.org/search?q=Aggregation%20operators" title=" Aggregation operators"> Aggregation operators</a>, <a href="https://publications.waset.org/search?q=Negret" title=" Negret"> Negret</a>, <a href="https://publications.waset.org/search?q=OWA%20operator" title="OWA operator">OWA operator</a>, <a href="https://publications.waset.org/search?q=OWG%20operator." title=" OWG operator."> OWG operator.</a> </p> <a href="https://publications.waset.org/11348/decision-making-using-maximization-of-negret" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11348/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11348/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11348/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11348/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11348/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11348/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11348/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11348/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11348/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11348/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11348.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">1310</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">118</span> Discovery of Time Series Event Patterns based on Time Constraints from Textual Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shigeaki%20Sakurai">Shigeaki Sakurai</a>, <a href="https://publications.waset.org/search?q=Ken%20Ueno"> Ken Ueno</a>, <a href="https://publications.waset.org/search?q=Ryohei%20Orihara"> Ryohei Orihara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper proposes a method that discovers time series event patterns from textual data with time information. The patterns are composed of sequences of events and each event is extracted from the textual data, where an event is characteristic content included in the textual data such as a company name, an action, and an impression of a customer. The method introduces 7 types of time constraints based on the analysis of the textual data. The method also evaluates these constraints when the frequency of a time series event pattern is calculated. We can flexibly define the time constraints for interesting combinations of events and can discover valid time series event patterns which satisfy these conditions. The paper applies the method to daily business reports collected by a sales force automation system and verifies its effectiveness through numerical experiments.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Text%20mining" title="Text mining">Text mining</a>, <a href="https://publications.waset.org/search?q=sequential%20mining" title=" sequential mining"> sequential mining</a>, <a href="https://publications.waset.org/search?q=time%20constraints" title=" time constraints"> time constraints</a>, <a href="https://publications.waset.org/search?q=daily%20business%20reports." title=" daily business reports."> daily business reports.</a> </p> <a href="https://publications.waset.org/8360/discovery-of-time-series-event-patterns-based-on-time-constraints-from-textual-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8360/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8360/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8360/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8360/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8360/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8360/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8360/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8360/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8360/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8360/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8360.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">1488</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">117</span> Thematic Role Extraction Using Shallow Parsing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mehrnoush%20Shamsfard">Mehrnoush Shamsfard</a>, <a href="https://publications.waset.org/search?q=Maryam%20Sadr%20Mousavi"> Maryam Sadr Mousavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Extracting thematic (semantic) roles is one of the major steps in representing text meaning. It refers to finding the semantic relations between a predicate and syntactic constituents in a sentence. In this paper we present a rule-based approach to extract semantic roles from Persian sentences. The system exploits a twophase architecture to (1) identify the arguments and (2) label them for each predicate. For the first phase we developed a rule based shallow parser to chunk Persian sentences and for the second phase we developed a knowledge-based system to assign 16 selected thematic roles to the chunks. The experimental results of testing each phase are shown at the end of the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Natural%20Language%20Processing" title="Natural Language Processing">Natural Language Processing</a>, <a href="https://publications.waset.org/search?q=Semantic%20RoleLabeling" title=" Semantic RoleLabeling"> Semantic RoleLabeling</a>, <a href="https://publications.waset.org/search?q=Shallow%20parsing" title=" Shallow parsing"> Shallow parsing</a>, <a href="https://publications.waset.org/search?q=Thematic%20Roles." title=" Thematic Roles."> Thematic Roles.</a> </p> <a href="https://publications.waset.org/10674/thematic-role-extraction-using-shallow-parsing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10674/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10674/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10674/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10674/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10674/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10674/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10674/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10674/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10674/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10674/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10674.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">2027</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">116</span> Using Data Mining for Learning and Clustering FCM</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Somayeh%20Alizadeh">Somayeh Alizadeh</a>, <a href="https://publications.waset.org/search?q=Mehdi%20Ghazanfari"> Mehdi Ghazanfari</a>, <a href="https://publications.waset.org/search?q=Mohammad%20Fathian"> Mohammad Fathian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy Cognitive Maps (FCMs) have successfully been applied in numerous domains to show relations between essential components. In some FCM, there are more nodes, which related to each other and more nodes means more complex in system behaviors and analysis. In this paper, a novel learning method used to construct FCMs based on historical data and by using data mining and DEMATEL method, a new method defined to reduce nodes number. This method cluster nodes in FCM based on their cause and effect behaviors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering" title="Clustering">Clustering</a>, <a href="https://publications.waset.org/search?q=Data%20Mining" title=" Data Mining"> Data Mining</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Cognitive%20Map%28FCM%29" title=" Fuzzy Cognitive Map(FCM)"> Fuzzy Cognitive Map(FCM)</a>, <a href="https://publications.waset.org/search?q=Learning." title=" Learning."> Learning.</a> </p> <a href="https://publications.waset.org/12275/using-data-mining-for-learning-and-clustering-fcm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12275/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12275/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12275/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12275/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12275/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12275/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12275/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12275/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12275/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12275/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12275.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">2016</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">115</span> Asynchronous Parallel Distributed Genetic Algorithm with Elite Migration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kazunori%20Kojima">Kazunori Kojima</a>, <a href="https://publications.waset.org/search?q=Masaaki%20Ishigame"> Masaaki Ishigame</a>, <a href="https://publications.waset.org/search?q=Goutam%20Chakraborty"> Goutam Chakraborty</a>, <a href="https://publications.waset.org/search?q=Hiroshi%20Hatsuo"> Hiroshi Hatsuo</a>, <a href="https://publications.waset.org/search?q=Shozo%20Makino"> Shozo Makino</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In most of the popular implementation of Parallel GAs the whole population is divided into a set of subpopulations, each subpopulation executes GA independently and some individuals are migrated at fixed intervals on a ring topology. In these studies, the migrations usually occur 'synchronously' among subpopulations. Therefore, CPUs are not used efficiently and the communication do not occur efficiently either. A few studies tried asynchronous migration but it is hard to implement and setting proper parameter values is difficult. The aim of our research is to develop a migration method which is easy to implement, which is easy to set parameter values, and which reduces communication traffic. In this paper, we propose a traffic reduction method for the Asynchronous Parallel Distributed GA by migration of elites only. This is a Server-Client model. Every client executes GA on a subpopulation and sends an elite information to the server. The server manages the elite information of each client and the migrations occur according to the evolution of sub-population in a client. This facilitates the reduction in communication traffic. To evaluate our proposed model, we apply it to many function optimization problems. We confirm that our proposed method performs as well as current methods, the communication traffic is less, and setting of the parameters are much easier. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20Distributed%20Genetic%20Algorithm%20%28PDGA%29" title="Parallel Distributed Genetic Algorithm (PDGA)">Parallel Distributed Genetic Algorithm (PDGA)</a>, <a href="https://publications.waset.org/search?q=asynchronousPDGA" title=" asynchronousPDGA"> asynchronousPDGA</a>, <a href="https://publications.waset.org/search?q=Server-Client%20configuration" title=" Server-Client configuration"> Server-Client configuration</a>, <a href="https://publications.waset.org/search?q=Elite%20Migration" title=" Elite Migration"> Elite Migration</a> </p> <a href="https://publications.waset.org/4165/asynchronous-parallel-distributed-genetic-algorithm-with-elite-migration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4165/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4165/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4165/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4165/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4165/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4165/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4165/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4165/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4165/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4165/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4165.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">1372</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">114</span> Robust Artificial Neural Network Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Schuster">A. Schuster</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many artificial intelligence (AI) techniques are inspired by problem-solving strategies found in nature. Robustness is a key feature in many natural systems. This paper studies robustness in artificial neural networks (ANNs) and proposes several novel, nature inspired ANN architectures. The paper includes encouraging results from experimental studies on these networks showing increased robustness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=robustness" title="robustness">robustness</a>, <a href="https://publications.waset.org/search?q=robust%20artificial%20neural%20networks%20architectures." title=" robust artificial neural networks architectures."> robust artificial neural networks architectures.</a> </p> <a href="https://publications.waset.org/11954/robust-artificial-neural-network-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11954/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11954/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11954/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11954/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11954/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11954/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11954/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11954/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11954/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11954/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11954.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">1407</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">113</span> The Labeled Classification and its Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Nemissi">M. Nemissi</a>, <a href="https://publications.waset.org/search?q=H.%20Seridi"> H. Seridi</a>, <a href="https://publications.waset.org/search?q=H.%20Akdag"> H. Akdag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents and evaluates a new classification method that aims to improve classifiers performances and speed up their training process. The proposed approach, called labeled classification, seeks to improve convergence of the BP (Back propagation) algorithm through the addition of an extra feature (labels) to all training examples. To classify every new example, tests will be carried out each label. The simplicity of implementation is the main advantage of this approach because no modifications are required in the training algorithms. Therefore, it can be used with others techniques of acceleration and stabilization. In this work, two models of the labeled classification are proposed: the LMLP (Labeled Multi Layered Perceptron) and the LNFC (Labeled Neuro Fuzzy Classifier). These models are tested using Iris, wine, texture and human thigh databases to evaluate their performances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20neural%20networks" title="Artificial neural networks">Artificial neural networks</a>, <a href="https://publications.waset.org/search?q=Fusion%20of%20neural%20networkfuzzysystems" title=" Fusion of neural networkfuzzysystems"> Fusion of neural networkfuzzysystems</a>, <a href="https://publications.waset.org/search?q=Learning%20theory" title=" Learning theory"> Learning theory</a>, <a href="https://publications.waset.org/search?q=Pattern%20recognition." title=" Pattern recognition."> Pattern recognition.</a> </p> <a href="https://publications.waset.org/10253/the-labeled-classification-and-its-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10253/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10253/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10253/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10253/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10253/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10253/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10253/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10253/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10253/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10253/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10253.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">1410</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">112</span> Validity Domains of Beams Behavioural Models: Efficiency and Reduction with Artificial Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Keny%20Ordaz-Hernandez">Keny Ordaz-Hernandez</a>, <a href="https://publications.waset.org/search?q=Xavier%20Fischer"> Xavier Fischer</a>, <a href="https://publications.waset.org/search?q=Fouad%20Bennis"> Fouad Bennis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In a particular case of behavioural model reduction by ANNs, a validity domain shortening has been found. In mechanics, as in other domains, the notion of validity domain allows the engineer to choose a valid model for a particular analysis or simulation. In the study of mechanical behaviour for a cantilever beam (using linear and non-linear models), Multi-Layer Perceptron (MLP) Backpropagation (BP) networks have been applied as model reduction technique. This reduced model is constructed to be more efficient than the non-reduced model. Within a less extended domain, the ANN reduced model estimates correctly the non-linear response, with a lower computational cost. It has been found that the neural network model is not able to approximate the linear behaviour while it does approximate the non-linear behaviour very well. The details of the case are provided with an example of the cantilever beam behaviour modelling.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=artificial%20neural%20network" title="artificial neural network">artificial neural network</a>, <a href="https://publications.waset.org/search?q=validity%20domain" title=" validity domain"> validity domain</a>, <a href="https://publications.waset.org/search?q=cantileverbeam" title=" cantileverbeam"> cantileverbeam</a>, <a href="https://publications.waset.org/search?q=non-linear%20behaviour" title=" non-linear behaviour"> non-linear behaviour</a>, <a href="https://publications.waset.org/search?q=model%20reduction." title=" model reduction."> model reduction.</a> </p> <a href="https://publications.waset.org/4871/validity-domains-of-beams-behavioural-models-efficiency-and-reduction-with-artificial-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4871/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4871/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4871/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4871/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4871/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4871/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4871/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4871/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4871/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4871/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4871.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">1428</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">111</span> Machine Learning in Production Systems Design Using Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abu%20Qudeiri%20Jaber">Abu Qudeiri Jaber</a>, <a href="https://publications.waset.org/search?q=Yamamoto%20Hidehiko%20Rizauddin%20Ramli"> Yamamoto Hidehiko Rizauddin Ramli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To create a solution for a specific problem in machine learning, the solution is constructed from the data or by use a search method. Genetic algorithms are a model of machine learning that can be used to find nearest optimal solution. While the great advantage of genetic algorithms is the fact that they find a solution through evolution, this is also the biggest disadvantage. Evolution is inductive, in nature life does not evolve towards a good solution but it evolves away from bad circumstances. This can cause a species to evolve into an evolutionary dead end. In order to reduce the effect of this disadvantage we propose a new a learning tool (criteria) which can be included into the genetic algorithms generations to compare the previous population and the current population and then decide whether is effective to continue with the previous population or the current population, the proposed learning tool is called as Keeping Efficient Population (KEP). We applied a GA based on KEP to the production line layout problem, as a result KEP keep the evaluation direction increases and stops any deviation in the evaluation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithms" title="Genetic algorithms">Genetic algorithms</a>, <a href="https://publications.waset.org/search?q=Layout%20problem" title=" Layout problem"> Layout problem</a>, <a href="https://publications.waset.org/search?q=Machinelearning" title=" Machinelearning"> Machinelearning</a>, <a href="https://publications.waset.org/search?q=Production%20system." title=" Production system."> Production system.</a> </p> <a href="https://publications.waset.org/10797/machine-learning-in-production-systems-design-using-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10797/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10797/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10797/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10797/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10797/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10797/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10797/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10797/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10797/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10797/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10797.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">1629</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">110</span> Enhanced Clustering Analysis and Visualization Using Kohonen's Self-Organizing Feature Map Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kasthurirangan%20Gopalakrishnan">Kasthurirangan Gopalakrishnan</a>, <a href="https://publications.waset.org/search?q=Siddhartha%20Khaitan"> Siddhartha Khaitan</a>, <a href="https://publications.waset.org/search?q=Anshu%20Manik"> Anshu Manik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Cluster analysis is the name given to a diverse collection of techniques that can be used to classify objects (e.g. individuals, quadrats, species etc). While Kohonen's Self-Organizing Feature Map (SOFM) or Self-Organizing Map (SOM) networks have been successfully applied as a classification tool to various problem domains, including speech recognition, image data compression, image or character recognition, robot control and medical diagnosis, its potential as a robust substitute for clustering analysis remains relatively unresearched. SOM networks combine competitive learning with dimensionality reduction by smoothing the clusters with respect to an a priori grid and provide a powerful tool for data visualization. In this paper, SOM is used for creating a toroidal mapping of two-dimensional lattice to perform cluster analysis on results of a chemical analysis of wines produced in the same region in Italy but derived from three different cultivators, referred to as the “wine recognition data" located in the University of California-Irvine database. The results are encouraging and it is believed that SOM would make an appealing and powerful decision-support system tool for clustering tasks and for data visualization.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20neural%20networks" title="Artificial neural networks">Artificial neural networks</a>, <a href="https://publications.waset.org/search?q=cluster%20analysis" title=" cluster analysis"> cluster analysis</a>, <a href="https://publications.waset.org/search?q=Kohonen%20maps" title=" Kohonen maps"> Kohonen maps</a>, <a href="https://publications.waset.org/search?q=wine%20recognition." title=" wine recognition."> wine recognition.</a> </p> <a href="https://publications.waset.org/6000/enhanced-clustering-analysis-and-visualization-using-kohonens-self-organizing-feature-map-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6000/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6000/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6000/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6000/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6000/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6000/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6000/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6000/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6000/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6000/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6000.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">2123</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">109</span> Mining News Sites to Create Special Domain News Collections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=David%20B.%20Bracewell">David B. Bracewell</a>, <a href="https://publications.waset.org/search?q=Fuji%20Ren"> Fuji Ren</a>, <a href="https://publications.waset.org/search?q=Shingo%20Kuroiwa"> Shingo Kuroiwa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a method to create special domain collections from news sites. The method only requires a single sample article as a seed. No prior corpus statistics are needed and the method is applicable to multiple languages. We examine various similarity measures and the creation of document collections for English and Japanese. The main contributions are as follows. First, the algorithm can build special domain collections from as little as one sample document. Second, unlike other algorithms it does not require a second “general" corpus to compute statistics. Third, in our testing the algorithm outperformed others in creating collections made up of highly relevant articles. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Information%20Retrieval" title="Information Retrieval">Information Retrieval</a>, <a href="https://publications.waset.org/search?q=News" title=" News"> News</a>, <a href="https://publications.waset.org/search?q=Special%20DomainCollections" title=" Special DomainCollections"> Special DomainCollections</a>, <a href="https://publications.waset.org/search?q=" title=""></a> </p> <a href="https://publications.waset.org/2162/mining-news-sites-to-create-special-domain-news-collections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2162/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2162/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2162/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2162/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2162/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2162/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2162/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2162/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2162/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2162/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2162.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">1487</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">108</span> An Improved Conjugate Gradient Based Learning Algorithm for Back Propagation Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=N.%20M.%20Nawi">N. M. Nawi</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20Ransing"> R. S. Ransing</a>, <a href="https://publications.waset.org/search?q=M.%20R.%20Ransing"> M. R. Ransing</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The conjugate gradient optimization algorithm is combined with the modified back propagation algorithm to yield a computationally efficient algorithm for training multilayer perceptron (MLP) networks (CGFR/AG). The computational efficiency is enhanced by adaptively modifying initial search direction as described in the following steps: (1) Modification on standard back propagation algorithm by introducing a gain variation term in the activation function, (2) Calculation of the gradient descent of error with respect to the weights and gains values and (3) the determination of a new search direction by using information calculated in step (2). The performance of the proposed method is demonstrated by comparing accuracy and computation time with the conjugate gradient algorithm used in MATLAB neural network toolbox. The results show that the computational efficiency of the proposed method was better than the standard conjugate gradient algorithm.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20gain%20variation" title="Adaptive gain variation">Adaptive gain variation</a>, <a href="https://publications.waset.org/search?q=back-propagation" title=" back-propagation"> back-propagation</a>, <a href="https://publications.waset.org/search?q=activation%20function" title="activation function">activation function</a>, <a href="https://publications.waset.org/search?q=conjugate%20gradient" title=" conjugate gradient"> conjugate gradient</a>, <a href="https://publications.waset.org/search?q=search%20direction." title=" search direction."> search direction.</a> </p> <a href="https://publications.waset.org/10722/an-improved-conjugate-gradient-based-learning-algorithm-for-back-propagation-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10722/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10722/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10722/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10722/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10722/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10722/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10722/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10722/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10722/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10722/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10722.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">1521</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">107</span> Meta Model Based EA for Complex Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Maumita%20Bhattacharya">Maumita Bhattacharya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evolutionary Algorithms are population-based, stochastic search techniques, widely used as efficient global optimizers. However, many real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function evaluations. Use of evolutionary algorithms in such problem domains is thus practically prohibitive. An attractive alternative is to build meta models or use an approximation of the actual fitness functions to be evaluated. These meta models are order of magnitude cheaper to evaluate compared to the actual function evaluation. Many regression and interpolation tools are available to build such meta models. This paper briefly discusses the architectures and use of such meta-modeling tools in an evolutionary optimization context. We further present two evolutionary algorithm frameworks which involve use of meta models for fitness function evaluation. The first framework, namely the Dynamic Approximate Fitness based Hybrid EA (DAFHEA) model [14] reduces computation time by controlled use of meta-models (in this case approximate model generated by Support Vector Machine regression) to partially replace the actual function evaluation by approximate function evaluation. However, the underlying assumption in DAFHEA is that the training samples for the metamodel are generated from a single uniform model. This does not take into account uncertain scenarios involving noisy fitness functions. The second model, DAFHEA-II, an enhanced version of the original DAFHEA framework, incorporates a multiple-model based learning approach for the support vector machine approximator to handle noisy functions [15]. Empirical results obtained by evaluating the frameworks using several benchmark functions demonstrate their efficiency <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Meta%20model" title="Meta model">Meta model</a>, <a href="https://publications.waset.org/search?q=Evolutionary%20algorithm" title=" Evolutionary algorithm"> Evolutionary algorithm</a>, <a href="https://publications.waset.org/search?q=Stochastictechnique" title=" Stochastictechnique"> Stochastictechnique</a>, <a href="https://publications.waset.org/search?q=Fitness%20function" title=" Fitness function"> Fitness function</a>, <a href="https://publications.waset.org/search?q=Optimization" title=" Optimization"> Optimization</a>, <a href="https://publications.waset.org/search?q=Support%20vector%20machine." title=" Support vector machine."> Support vector machine.</a> </p> <a href="https://publications.waset.org/449/meta-model-based-ea-for-complex-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/449/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/449/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/449/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/449/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/449/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/449/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/449/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/449/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/449/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/449/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/449.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">2067</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">106</span> Digital filters for Hot-Mix Asphalt Complex Modulus Test Data Using Genetic Algorithm Strategies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Madhav%20V.%20Chitturi">Madhav V. Chitturi</a>, <a href="https://publications.waset.org/search?q=Anshu%20Manik"> Anshu Manik</a>, <a href="https://publications.waset.org/search?q=Kasthurirangan%20Gopalakrishnan"> Kasthurirangan Gopalakrishnan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The dynamic or complex modulus test is considered to be a mechanistically based laboratory test to reliably characterize the strength and load-resistance of Hot-Mix Asphalt (HMA) mixes used in the construction of roads. The most common observation is that the data collected from these tests are often noisy and somewhat non-sinusoidal. This hampers accurate analysis of the data to obtain engineering insight. The goal of the work presented in this paper is to develop and compare automated evolutionary computational techniques to filter test noise in the collection of data for the HMA complex modulus test. The results showed that the Covariance Matrix Adaptation-Evolutionary Strategy (CMA-ES) approach is computationally efficient for filtering data obtained from the HMA complex modulus test. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=HMA" title="HMA">HMA</a>, <a href="https://publications.waset.org/search?q=dynamic%20modulus" title=" dynamic modulus"> dynamic modulus</a>, <a href="https://publications.waset.org/search?q=GA" title=" GA"> GA</a>, <a href="https://publications.waset.org/search?q=evolutionarycomputation." title=" evolutionarycomputation."> evolutionarycomputation.</a> </p> <a href="https://publications.waset.org/3405/digital-filters-for-hot-mix-asphalt-complex-modulus-test-data-using-genetic-algorithm-strategies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3405/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3405/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3405/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3405/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3405/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3405/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3405/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3405/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3405/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3405/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3405.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">1571</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">105</span> A Text Mining Technique Using Association Rules Extraction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hany%20Mahgoub">Hany Mahgoub</a>, <a href="https://publications.waset.org/search?q=Dietmar%20R%C3%B6sner"> Dietmar Rösner</a>, <a href="https://publications.waset.org/search?q=Nabil%20Ismail"> Nabil Ismail</a>, <a href="https://publications.waset.org/search?q=Fawzy%20Torkey"> Fawzy Torkey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper describes text mining technique for automatically extracting association rules from collections of textual documents. The technique called, Extracting Association Rules from Text (EART). It depends on keyword features for discover association rules amongst keywords labeling the documents. In this work, the EART system ignores the order in which the words occur, but instead focusing on the words and their statistical distributions in documents. The main contributions of the technique are that it integrates XML technology with Information Retrieval scheme (TFIDF) (for keyword/feature selection that automatically selects the most discriminative keywords for use in association rules generation) and use Data Mining technique for association rules discovery. It consists of three phases: Text Preprocessing phase (transformation, filtration, stemming and indexing of the documents), Association Rule Mining (ARM) phase (applying our designed algorithm for Generating Association Rules based on Weighting scheme GARW) and Visualization phase (visualization of results). Experiments applied on WebPages news documents related to the outbreak of the bird flu disease. The extracted association rules contain important features and describe the informative news included in the documents collection. The performance of the EART system compared with another system that uses the Apriori algorithm throughout the execution time and evaluating extracted association rules.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Text%20mining" title="Text mining">Text mining</a>, <a href="https://publications.waset.org/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/search?q=association%20rule%20mining" title=" association rule mining"> association rule mining</a> </p> <a href="https://publications.waset.org/3124/a-text-mining-technique-using-association-rules-extraction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3124/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3124/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3124/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3124/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3124/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3124/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3124/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3124/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3124/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3124/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3124.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">4437</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">104</span> Multivariate High Order Fuzzy Time Series Forecasting for Car Road Accidents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tahseen%20A.%20Jilani">Tahseen A. Jilani</a>, <a href="https://publications.waset.org/search?q=S.%20M.%20Aqil%20Burney"> S. M. Aqil Burney</a>, <a href="https://publications.waset.org/search?q=C.%20Ardil"> C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have presented a new multivariate fuzzy time series forecasting method. This method assumes mfactors with one main factor of interest. History of past three years is used for making new forecasts. This new method is applied in forecasting total number of car accidents in Belgium using four secondary factors. We also make comparison of our proposed method with existing methods of fuzzy time series forecasting. Experimentally, it is shown that our proposed method perform better than existing fuzzy time series forecasting methods. Practically, actuaries are interested in analysis of the patterns of causalities in road accidents. Thus using fuzzy time series, actuaries can define fuzzy premium and fuzzy underwriting of car insurance and life insurance for car insurance. National Institute of Statistics, Belgium provides region of risk classification for each road. Thus using this risk classification, we can predict premium rate and underwriting of insurance policy holders. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Average%20forecasting%20error%20rate%20%28AFER%29" title="Average forecasting error rate (AFER)">Average forecasting error rate (AFER)</a>, <a href="https://publications.waset.org/search?q=Fuzziness%20offuzzy%20sets%20Fuzzy" title=" Fuzziness offuzzy sets Fuzzy"> Fuzziness offuzzy sets Fuzzy</a>, <a href="https://publications.waset.org/search?q=If-Then%20rules" title=" If-Then rules"> If-Then rules</a>, <a href="https://publications.waset.org/search?q=Multivariate%20fuzzy%20time%20series." title=" Multivariate fuzzy time series."> Multivariate fuzzy time series.</a> </p> <a href="https://publications.waset.org/15658/multivariate-high-order-fuzzy-time-series-forecasting-for-car-road-accidents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15658/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15658/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15658/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15658/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15658/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15658/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15658/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15658/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15658/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15658/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15658.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">2490</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">103</span> On the Parameter Optimization of Fuzzy Inference Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Erika%20Martinez%20Ramirez">Erika Martinez Ramirez</a>, <a href="https://publications.waset.org/search?q=Rene%20V.%20Mayorga"> Rene V. Mayorga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, more engineering systems are using some kind of Artificial Intelligence (AI) for the development of their processes. Some well-known AI techniques include artificial neural nets, fuzzy inference systems, and neuro-fuzzy inference systems among others. Furthermore, many decision-making applications base their intelligent processes on Fuzzy Logic; due to the Fuzzy Inference Systems (FIS) capability to deal with problems that are based on user knowledge and experience. Also, knowing that users have a wide variety of distinctiveness, and generally, provide uncertain data, this information can be used and properly processed by a FIS. To properly consider uncertainty and inexact system input values, FIS normally use Membership Functions (MF) that represent a degree of user satisfaction on certain conditions and/or constraints. In order to define the parameters of the MFs, the knowledge from experts in the field is very important. This knowledge defines the MF shape to process the user inputs and through fuzzy reasoning and inference mechanisms, the FIS can provide an “appropriate" output. However an important issue immediately arises: How can it be assured that the obtained output is the optimum solution? How can it be guaranteed that each MF has an optimum shape? A viable solution to these questions is through the MFs parameter optimization. In this Paper a novel parameter optimization process is presented. The process for FIS parameter optimization consists of the five simple steps that can be easily realized off-line. Here the proposed process of FIS parameter optimization it is demonstrated by its implementation on an Intelligent Interface section dealing with the on-line customization / personalization of internet portals applied to E-commerce. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20Intelligence" title="Artificial Intelligence">Artificial Intelligence</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Logic" title=" Fuzzy Logic"> Fuzzy Logic</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20InferenceSystems" title=" Fuzzy InferenceSystems"> Fuzzy InferenceSystems</a>, <a href="https://publications.waset.org/search?q=Nonlinear%20Optimization." title=" Nonlinear Optimization."> Nonlinear Optimization.</a> </p> <a href="https://publications.waset.org/15939/on-the-parameter-optimization-of-fuzzy-inference-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15939/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15939/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15939/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15939/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15939/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15939/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15939/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15939/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15939/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15939/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15939.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">1984</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">102</span> Using Multimedia in Computer Based Learning (CBL) A Case Study: Teaching Science to Student</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Maryam%20Honarmand">Maryam Honarmand</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Regarding to the fast growth of computer, internet, and virtual learning in our country (Iran) and need computer-based learning systems and multimedia tools as an essential part of such education, designing and implementing such systems would help teach different field such as science. This paper describes the basic principle of multimedia. At the end, with a description of learning science to the infant students, the method of this system will be explained.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multimedia%20tools" title="Multimedia tools">Multimedia tools</a>, <a href="https://publications.waset.org/search?q=computer%20based%20learning" title=" computer based learning"> computer based learning</a>, <a href="https://publications.waset.org/search?q=science" title=" science"> science</a>, <a href="https://publications.waset.org/search?q=student." title=" student."> student.</a> </p> <a href="https://publications.waset.org/9636/using-multimedia-in-computer-based-learning-cbl-a-case-study-teaching-science-to-student" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9636/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9636/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9636/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9636/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9636/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9636/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9636/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9636/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9636/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9636/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9636.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">1491</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">101</span> Neural Networks for Short Term Wind Speed Prediction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Sreelakshmi">K. Sreelakshmi</a>, <a href="https://publications.waset.org/search?q=P.%20Ramakanthkumar"> P. Ramakanthkumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Predicting short term wind speed is essential in order to prevent systems in-action from the effects of strong winds. It also helps in using wind energy as an alternative source of energy, mainly for Electrical power generation. Wind speed prediction has applications in Military and civilian fields for air traffic control, rocket launch, ship navigation etc. The wind speed in near future depends on the values of other meteorological variables, such as atmospheric pressure, moisture content, humidity, rainfall etc. The values of these parameters are obtained from a nearest weather station and are used to train various forms of neural networks. The trained model of neural networks is validated using a similar set of data. The model is then used to predict the wind speed, using the same meteorological information. This paper reports an Artificial Neural Network model for short term wind speed prediction, which uses back propagation algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Short%20term%20wind%20speed%20prediction" title="Short term wind speed prediction">Short term wind speed prediction</a>, <a href="https://publications.waset.org/search?q=Neural%20networks" title=" Neural networks"> Neural networks</a>, <a href="https://publications.waset.org/search?q=Back%20propagation." title="Back propagation.">Back propagation.</a> </p> <a href="https://publications.waset.org/568/neural-networks-for-short-term-wind-speed-prediction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/568/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/568/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/568/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/568/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/568/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/568/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/568/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/568/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/568/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/568/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/568.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">3065</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">100</span> A New Approach for Mobile Agent Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Haghighat%20far">R. Haghighat far</a>, <a href="https://publications.waset.org/search?q=H.%20Yarahmadi"> H. Yarahmadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mobile agent is a software which performs an action autonomously and independently as a person or an organizations assistance. Mobile agents are used for searching information, retrieval information, filtering, intruder recognition in networks, and so on. One of the important issues of mobile agent is their security. It must consider different security issues in effective and secured usage of mobile agent. One of those issues is the integrity-s protection of mobile agents. In this paper, the advantages and disadvantages of each method, after reviewing the existing methods, is examined. Regarding to this matter that each method has its own advantage or disadvantage, it seems that by combining these methods, one can reach to a better method for protecting the integrity of mobile agents. Therefore, this method is provided in this paper and then is evaluated in terms of existing method. Finally, this method is simulated and its results are the sign of improving the possibility of integrity-s protection of mobile agents. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Integrity" title="Integrity">Integrity</a>, <a href="https://publications.waset.org/search?q=Mobile%20Agent" title=" Mobile Agent"> Mobile Agent</a>, <a href="https://publications.waset.org/search?q=Security." title=" Security."> Security.</a> </p> <a href="https://publications.waset.org/433/a-new-approach-for-mobile-agent-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/433/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/433/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/433/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/433/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/433/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/433/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/433/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/433/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/433/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/433/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/433.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">1759</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">99</span> Abrupt Scene Change Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Priyadarshinee%20Adhikari">Priyadarshinee Adhikari</a>, <a href="https://publications.waset.org/search?q=Neeta%20Gargote"> Neeta Gargote</a>, <a href="https://publications.waset.org/search?q=Jyothi%20Digge"> Jyothi Digge</a>, <a href="https://publications.waset.org/search?q=B.G.%20Hogade"> B.G. Hogade</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A number of automated shot-change detection methods for indexing a video sequence to facilitate browsing and retrieval have been proposed in recent years. This paper emphasizes on the simulation of video shot boundary detection using one of the methods of the color histogram wherein scaling of the histogram metrics is an added feature. The difference between the histograms of two consecutive frames is evaluated resulting in the metrics. Further scaling of the metrics is performed to avoid ambiguity and to enable the choice of apt threshold for any type of videos which involves minor error due to flashlight, camera motion, etc. Two sample videos are used here with resolution of 352 X 240 pixels using color histogram approach in the uncompressed media. An attempt is made for the retrieval of color video. The simulation is performed for the abrupt change in video which yields 90% recall and precision value. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Abrupt%20change" title="Abrupt change">Abrupt change</a>, <a href="https://publications.waset.org/search?q=color%20histogram" title=" color histogram"> color histogram</a>, <a href="https://publications.waset.org/search?q=ground-truthing" title=" ground-truthing"> ground-truthing</a>, <a href="https://publications.waset.org/search?q=precision" title="precision">precision</a>, <a href="https://publications.waset.org/search?q=recall" title=" recall"> recall</a>, <a href="https://publications.waset.org/search?q=scaling" title=" scaling"> scaling</a>, <a href="https://publications.waset.org/search?q=threshold." title=" threshold."> threshold.</a> </p> <a href="https://publications.waset.org/9318/abrupt-scene-change-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9318/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9318/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9318/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9318/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9318/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9318/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9318/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9318/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9318/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9318/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9318.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">2103</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">98</span> Performance Assessment of Computational Gridon Weather Indices from HOAPS Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Madhuri%20Bhavsar">Madhuri Bhavsar</a>, <a href="https://publications.waset.org/search?q=Anupam%20K%20Singh"> Anupam K Singh</a>, <a href="https://publications.waset.org/search?q=Shrikant%20Pradhan"> Shrikant Pradhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Long term rainfall analysis and prediction is a challenging task especially in the modern world where the impact of global warming is creating complications in environmental issues. These factors which are data intensive require high performance computational modeling for accurate prediction. This research paper describes a prototype which is designed and developed on grid environment using a number of coupled software infrastructural building blocks. This grid enabled system provides the demanding computational power, efficiency, resources, user-friendly interface, secured job submission and high throughput. The results obtained using sequential execution and grid enabled execution shows that computational performance has enhanced among 36% to 75%, for decade of climate parameters. Large variation in performance can be attributed to varying degree of computational resources available for job execution. Grid Computing enables the dynamic runtime selection, sharing and aggregation of distributed and autonomous resources which plays an important role not only in business, but also in scientific implications and social surroundings. This research paper attempts to explore the grid enabled computing capabilities on weather indices from HOAPS data for climate impact modeling and change detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Climate%20model" title="Climate model">Climate model</a>, <a href="https://publications.waset.org/search?q=Computational%20Grid" title=" Computational Grid"> Computational Grid</a>, <a href="https://publications.waset.org/search?q=GridApplication" title=" GridApplication"> GridApplication</a>, <a href="https://publications.waset.org/search?q=Heterogeneous%20Grid" title=" Heterogeneous Grid"> Heterogeneous Grid</a> </p> <a href="https://publications.waset.org/7092/performance-assessment-of-computational-gridon-weather-indices-from-hoaps-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7092/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7092/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7092/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7092/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7092/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7092/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7092/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7092/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7092/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7092/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7092.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">1443</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">97</span> Impact of Computer-Mediated Communication on Virtual Teams- Performance: An Empirical Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nadeem%20Ehsan">Nadeem Ehsan</a>, <a href="https://publications.waset.org/search?q=Ebtisam%20Mirza"> Ebtisam Mirza</a>, <a href="https://publications.waset.org/search?q=Muhammad%20Ahmad"> Muhammad Ahmad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a complex project environment, project teams face multi-dimensional communication problems that can ultimately lead to project breakdown. Team Performance varies in Face-to-Face (FTF) environment versus groups working remotely in a computermediated communication (CMC) environment. A brief review of the Input_Process_Output model suggested by James E. Driskell, Paul H. Radtke and Eduardo Salas in “Virtual Teams: Effects of Technological Mediation on Team Performance (2003)", has been done to develop the basis of this research. This model theoretically analyzes the effects of technological mediation on team processes, such as, cohesiveness, status and authority relations, counternormative behavior and communication. An empirical study described in this paper has been undertaken to test the “cohesiveness" of diverse project teams in a multi-national organization. This study uses both quantitative and qualitative techniques for data gathering and analysis. These techniques include interviews, questionnaires for data collection and graphical data representation for analyzing the collected data. Computer-mediated technology may impact team performance because of difference in cohesiveness among teams and this difference may be moderated by factors, such as, the type of communication environment, the type of task and the temporal context of the team. Based on the reviewed model, sets of hypotheses are devised and tested. This research, reports on a study that compared team cohesiveness among virtual teams using CMC and non-CMC communication mediums. The findings suggest that CMC can help virtual teams increase team cohesiveness among their members, making CMC an effective medium for increasing productivity and team performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Computer-mediated%20Communication" title="Computer-mediated Communication">Computer-mediated Communication</a>, <a href="https://publications.waset.org/search?q=Virtual%20Teams" title=" Virtual Teams"> Virtual Teams</a>, <a href="https://publications.waset.org/search?q=Team%20Performance" title="Team Performance">Team Performance</a>, <a href="https://publications.waset.org/search?q=Team%20Cohesiveness." title=" Team Cohesiveness."> Team Cohesiveness.</a> </p> <a href="https://publications.waset.org/6548/impact-of-computer-mediated-communication-on-virtual-teams-performance-an-empirical-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6548/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6548/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6548/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6548/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6548/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6548/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6548/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6548/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6548/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6548/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6548.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">2332</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">96</span> Trimmed Mean as an Adaptive Robust Estimator of a Location Parameter for Weibull Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Carolina%20B.%20Baguio">Carolina B. Baguio</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the purposes of the robust method of estimation is to reduce the influence of outliers in the data, on the estimates. The outliers arise from gross errors or contamination from distributions with long tails. The trimmed mean is a robust estimate. This means that it is not sensitive to violation of distributional assumptions of the data. It is called an adaptive estimate when the trimming proportion is determined from the data rather than being fixed a “priori-. The main objective of this study is to find out the robustness properties of the adaptive trimmed means in terms of efficiency, high breakdown point and influence function. Specifically, it seeks to find out the magnitude of the trimming proportion of the adaptive trimmed mean which will yield efficient and robust estimates of the parameter for data which follow a modified Weibull distribution with parameter λ = 1/2 , where the trimming proportion is determined by a ratio of two trimmed means defined as the tail length. Secondly, the asymptotic properties of the tail length and the trimmed means are also investigated. Finally, a comparison is made on the efficiency of the adaptive trimmed means in terms of the standard deviation for the trimming proportions and when these were fixed a “priori". The asymptotic tail lengths defined as the ratio of two trimmed means and the asymptotic variances were computed by using the formulas derived. While the values of the standard deviations for the derived tail lengths for data of size 40 simulated from a Weibull distribution were computed for 100 iterations using a computer program written in Pascal language. The findings of the study revealed that the tail lengths of the Weibull distribution increase in magnitudes as the trimming proportions increase, the measure of the tail length and the adaptive trimmed mean are asymptotically independent as the number of observations n becomes very large or approaching infinity, the tail length is asymptotically distributed as the ratio of two independent normal random variables, and the asymptotic variances decrease as the trimming proportions increase. The simulation study revealed empirically that the standard error of the adaptive trimmed mean using the ratio of tail lengths is relatively smaller for different values of trimming proportions than its counterpart when the trimming proportions were fixed a 'priori'. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20robust%20estimate" title="Adaptive robust estimate">Adaptive robust estimate</a>, <a href="https://publications.waset.org/search?q=asymptotic%20efficiency" title=" asymptotic efficiency"> asymptotic efficiency</a>, <a href="https://publications.waset.org/search?q=breakdown%20point" title="breakdown point">breakdown point</a>, <a href="https://publications.waset.org/search?q=influence%20function" title=" influence function"> influence function</a>, <a href="https://publications.waset.org/search?q=L-estimates" title=" L-estimates"> L-estimates</a>, <a href="https://publications.waset.org/search?q=location%20parameter" title=" location parameter"> location parameter</a>, <a href="https://publications.waset.org/search?q=tail%20length" title="tail length">tail length</a>, <a href="https://publications.waset.org/search?q=Weibull%20distribution." title=" Weibull distribution."> Weibull distribution.</a> </p> <a href="https://publications.waset.org/9953/trimmed-mean-as-an-adaptive-robust-estimator-of-a-location-parameter-for-weibull-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9953/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9953/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9953/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9953/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9953/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9953/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9953/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9953/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9953/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9953/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9953.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">2073</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">95</span> Tool Tracker: A Toolkit Ensembling Useful Online Networking Tools for Efficient Management and Operation of a Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Onkar%20Bhat%20Kodical">Onkar Bhat Kodical</a>, <a href="https://publications.waset.org/search?q=Sridhar%20Srinivasan"> Sridhar Srinivasan</a>, <a href="https://publications.waset.org/search?q=N.K.%20Srinath"> N.K. Srinath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Tool Tracker is a client-server based application. It is essentially a catalogue of various network monitoring and management tools that are available online. There is a database maintained on the server side that contains the information about various tools. Several clients can access this information simultaneously and utilize this information. The various categories of tools considered are packet sniffers, port mappers, port scanners, encryption tools, and vulnerability scanners etc for the development of this application. This application provides a front end through which the user can invoke any tool from a central repository for the purpose of packet sniffing, port scanning, network analysis etc. Apart from the tool, its description and the help files associated with it would also be stored in the central repository. This facility will enable the user to view the documentation pertaining to the tool without having to download and install the tool. The application would update the central repository with the latest versions of the tools. The application would inform the user about the availability of a newer version of the tool currently being used and give the choice of installing the newer version to the user. Thus ToolTracker provides any network administrator that much needed abstraction and ease-ofuse with respect to the tools that he can use to efficiently monitor a network.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network%20monitoring" title="Network monitoring">Network monitoring</a>, <a href="https://publications.waset.org/search?q=single%20platform" title=" single platform"> single platform</a>, <a href="https://publications.waset.org/search?q=client%2Fserver%20application" title=" client/server application"> client/server application</a>, <a href="https://publications.waset.org/search?q=version%20management." title=" version management."> version management.</a> </p> <a href="https://publications.waset.org/747/tool-tracker-a-toolkit-ensembling-useful-online-networking-tools-for-efficient-management-and-operation-of-a-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/747/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/747/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/747/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/747/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/747/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/747/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/747/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/747/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/747/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/747/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/747.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">1300</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">94</span> Bayesian Decision Approach to Protection on the Flood Event in Upper Ayeyarwady River, Myanmar</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Min%20Min%20Swe%20Zin">Min Min Swe Zin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper introduces the foundations of Bayesian probability theory and Bayesian decision method. The main goal of Bayesian decision theory is to minimize the expected loss of a decision or minimize the expected risk. The purposes of this study are to review the decision process on the issue of flood occurrences and to suggest possible process for decision improvement. This study examines the problem structure of flood occurrences and theoretically explicates the decision-analytic approach based on Bayesian decision theory and application to flood occurrences in Environmental Engineering. In this study, we will discuss about the flood occurrences upon an annual maximum water level in cm, 43-year record available from 1965 to 2007 at the gauging station of Sagaing on the Ayeyarwady River with the drainage area - 120193 sq km by using Bayesian decision method. As a result, we will discuss the loss and risk of vast areas of agricultural land whether which will be inundated or not in the coming year based on the two standard maximum water levels during 43 years. And also we forecast about that lands will be safe from flood water during the next 10 years.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bayesian%20decision%20method" title="Bayesian decision method">Bayesian decision method</a>, <a href="https://publications.waset.org/search?q=conditional%20binomial%20distribution" title=" conditional binomial distribution"> conditional binomial distribution</a>, <a href="https://publications.waset.org/search?q=minimax%20rules" title=" minimax rules"> minimax rules</a>, <a href="https://publications.waset.org/search?q=prior%20beta%20distribution." title=" prior beta distribution."> prior beta distribution.</a> </p> <a href="https://publications.waset.org/13886/bayesian-decision-approach-to-protection-on-the-flood-event-in-upper-ayeyarwady-river-myanmar" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13886/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13886/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13886/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13886/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13886/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13886/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13886/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13886/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13886/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13886/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13886.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">1579</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">93</span> Fuzzy Mathematical Morphology approach in Image Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yee%20Yee%20Htun">Yee Yee Htun</a>, <a href="https://publications.waset.org/search?q=Dr.%20Khaing%20Khaing%20Aye"> Dr. Khaing Khaing Aye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Morphological operators transform the original image into another image through the interaction with the other image of certain shape and size which is known as the structure element. Mathematical morphology provides a systematic approach to analyze the geometric characteristics of signals or images, and has been applied widely too many applications such as edge detection, objection segmentation, noise suppression and so on. Fuzzy Mathematical Morphology aims to extend the binary morphological operators to grey-level images. In order to define the basic morphological operations such as fuzzy erosion, dilation, opening and closing, a general method based upon fuzzy implication and inclusion grade operators is introduced. The fuzzy morphological operations extend the ordinary morphological operations by using fuzzy sets where for fuzzy sets, the union operation is replaced by a maximum operation, and the intersection operation is replaced by a minimum operation. In this work, it consists of two articles. In the first one, fuzzy set theory, fuzzy Mathematical morphology which is based on fuzzy logic and fuzzy set theory; fuzzy Mathematical operations and their properties will be studied in details. As a second part, the application of fuzziness in Mathematical morphology in practical work such as image processing will be discussed with the illustration problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Binary%20Morphological" title="Binary Morphological">Binary Morphological</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20sets" title=" Fuzzy sets"> Fuzzy sets</a>, <a href="https://publications.waset.org/search?q=Grayscalemorphology" title=" Grayscalemorphology"> Grayscalemorphology</a>, <a href="https://publications.waset.org/search?q=Image%20processing" title=" Image processing"> Image processing</a>, <a href="https://publications.waset.org/search?q=Mathematical%20morphology." title=" Mathematical morphology."> Mathematical morphology.</a> </p> <a href="https://publications.waset.org/1511/fuzzy-mathematical-morphology-approach-in-image-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1511/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1511/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1511/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1511/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1511/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1511/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1511/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1511/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1511/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1511/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1511.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">3247</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">92</span> Low Jitter ADPLL based Clock Generator for High Speed SoC Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Moorthi%20S.">Moorthi S.</a>, <a href="https://publications.waset.org/search?q=Meganathan%20D."> Meganathan D.</a>, <a href="https://publications.waset.org/search?q=Janarthanan%20D."> Janarthanan D.</a>, <a href="https://publications.waset.org/search?q=Praveen%20Kumar%20P."> Praveen Kumar P.</a>, <a href="https://publications.waset.org/search?q=J.%20Raja%20paul%20perinbam"> J. Raja paul perinbam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An efficient architecture for low jitter All Digital Phase Locked Loop (ADPLL) suitable for high speed SoC applications is presented in this paper. The ADPLL is designed using standard cells and described by Hardware Description Language (HDL). The ADPLL implemented in a 90 nm CMOS process can operate from 10 to 200 MHz and achieve worst case frequency acquisition in 14 reference clock cycles. The simulation result shows that PLL has cycle to cycle jitter of 164 ps and period jitter of 100 ps at 100MHz. Since the digitally controlled oscillator (DCO) can achieve both high resolution and wide frequency range, it can meet the demands of system-level integration. The proposed ADPLL can easily be ported to different processes in a short time. Thus, it can reduce the design time and design complexity of the ADPLL, making it very suitable for System-on-Chip (SoC) applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=All%20Digital%20Phase%20Locked%20Loop%20%28ADPLL%29" title="All Digital Phase Locked Loop (ADPLL)">All Digital Phase Locked Loop (ADPLL)</a>, <a href="https://publications.waset.org/search?q=Systemon-Chip%20%28SoC%29" title=" Systemon-Chip (SoC)"> Systemon-Chip (SoC)</a>, <a href="https://publications.waset.org/search?q=Phase%20Locked%20Loop%20%28PLL%29" title=" Phase Locked Loop (PLL)"> Phase Locked Loop (PLL)</a>, <a href="https://publications.waset.org/search?q=Very%20High%20speedIntegrated%20Circuit%20%28VHSIC%29%20Hardware%20Description%20Language%28VHDL%29" title=" Very High speedIntegrated Circuit (VHSIC) Hardware Description Language(VHDL)"> Very High speedIntegrated Circuit (VHSIC) Hardware Description Language(VHDL)</a>, <a href="https://publications.waset.org/search?q=Digitally%20Controlled%20Oscillator%20%28DCO%29" title=" Digitally Controlled Oscillator (DCO)"> Digitally Controlled Oscillator (DCO)</a>, <a href="https://publications.waset.org/search?q=Phase%20frequencydetector%20%28PFD%29%20and%20Voltage%20Controlled%20Oscillator%20%28VCO%29." title=" Phase frequencydetector (PFD) and Voltage Controlled Oscillator (VCO)."> Phase frequencydetector (PFD) and Voltage Controlled Oscillator (VCO).</a> </p> <a href="https://publications.waset.org/776/low-jitter-adpll-based-clock-generator-for-high-speed-soc-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/776/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/776/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/776/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/776/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/776/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/776/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/776/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/776/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/776/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/776/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/776.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">3069</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">91</span> Constraint Based Frequent Pattern Mining Technique for Solving GCS Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=First%20G.M.%20Karthik">First G.M. Karthik</a>, <a href="https://publications.waset.org/search?q=Second%20Ramachandra.V.Pujeri"> Second Ramachandra.V.Pujeri</a>, <a href="https://publications.waset.org/search?q=Dr."> Dr.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Generalized Center String (GCS) problem are generalized from Common Approximate Substring problem and Common substring problems. GCS are known to be NP-hard allowing the problems lies in the explosion of potential candidates. Finding longest center string without concerning the sequence that may not contain any motifs is not known in advance in any particular biological gene process. GCS solved by frequent pattern-mining techniques and known to be fixed parameter tractable based on the fixed input sequence length and symbol set size. Efficient method known as Bpriori algorithms can solve GCS with reasonable time/space complexities. Bpriori 2 and Bpriori 3-2 algorithm are been proposed of any length and any positions of all their instances in input sequences. In this paper, we reduced the time/space complexity of Bpriori algorithm by Constrained Based Frequent Pattern mining (CBFP) technique which integrates the idea of Constraint Based Mining and FP-tree mining. CBFP mining technique solves the GCS problem works for all center string of any length, but also for the positions of all their mutated copies of input sequence. CBFP mining technique construct TRIE like with FP tree to represent the mutated copies of center string of any length, along with constraints to restraint growth of the consensus tree. The complexity analysis for Constrained Based FP mining technique and Bpriori algorithm is done based on the worst case and average case approach. Algorithm's correctness compared with the Bpriori algorithm using artificial data is shown. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Constraint%20Based%20Mining" title="Constraint Based Mining">Constraint Based Mining</a>, <a href="https://publications.waset.org/search?q=FP%20tree" title=" FP tree"> FP tree</a>, <a href="https://publications.waset.org/search?q=Data%20mining" title=" Data mining"> Data mining</a>, <a href="https://publications.waset.org/search?q=GCS%20problem" title="GCS problem">GCS problem</a>, <a href="https://publications.waset.org/search?q=CBFP%20mining%20technique." title=" CBFP mining technique."> CBFP mining technique.</a> </p> <a href="https://publications.waset.org/11090/constraint-based-frequent-pattern-mining-technique-for-solving-gcs-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11090/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11090/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11090/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11090/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11090/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11090/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11090/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11090/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11090/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11090/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11090.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">1702</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">90</span> Region-Based Segmentation of Generic Video Scenes Indexing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Aree%20A.%20Mohammed">Aree A. Mohammed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work we develop an object extraction method and propose efficient algorithms for object motion characterization. The set of proposed tools serves as a basis for development of objectbased functionalities for manipulation of video content. The estimators by different algorithms are compared in terms of quality and performance and tested on real video sequences. The proposed method will be useful for the latest standards of encoding and description of multimedia content – MPEG4 and MPEG7. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Object%20extraction" title="Object extraction">Object extraction</a>, <a href="https://publications.waset.org/search?q=Video%20indexing" title=" Video indexing"> Video indexing</a>, <a href="https://publications.waset.org/search?q=Segmentation" title=" Segmentation"> Segmentation</a>, <a href="https://publications.waset.org/search?q=Optical%20flow" title="Optical flow">Optical flow</a>, <a href="https://publications.waset.org/search?q=Motion%20estimators." title=" Motion estimators."> Motion estimators.</a> </p> <a href="https://publications.waset.org/5078/region-based-segmentation-of-generic-video-scenes-indexing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5078/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5078/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5078/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5078/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5078/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5078/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5078/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5078/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5078/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5078/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5078.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">1352</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">89</span> Architecture of Speech-based Registration System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mayank%20Kumar">Mayank Kumar</a>, <a href="https://publications.waset.org/search?q=D%20B%20Mahesh%20Kumar"> D B Mahesh Kumar</a>, <a href="https://publications.waset.org/search?q=Ashwin%20S%20Kumar"> Ashwin S Kumar</a>, <a href="https://publications.waset.org/search?q=N%20K%20Srinath"> N K Srinath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this era of technology, fueled by the pervasive usage of the internet, security is a prime concern. The number of new attacks by the so-called “bots", which are automated programs, is increasing at an alarming rate. They are most likely to attack online registration systems. Technology, called “CAPTCHA" (Completely Automated Public Turing test to tell Computers and Humans Apart) do exist, which can differentiate between automated programs and humans and prevent replay attacks. Traditionally CAPTCHA-s have been implemented with the challenge involved in recognizing textual images and reproducing the same. We propose an approach where the visual challenge has to be read out from which randomly selected keywords are used to verify the correctness of spoken text and in turn detect the presence of human. This is supplemented with a speaker recognition system which can identify the speaker also. Thus, this framework fulfills both the objectives – it can determine whether the user is a human or not and if it is a human, it can verify its identity.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CAPTCHA" title="CAPTCHA">CAPTCHA</a>, <a href="https://publications.waset.org/search?q=automatic%20speech%20recognition" title=" automatic speech recognition"> automatic speech recognition</a>, <a href="https://publications.waset.org/search?q=keyword%20spotting." title=" keyword spotting."> keyword spotting.</a> </p> <a href="https://publications.waset.org/13260/architecture-of-speech-based-registration-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13260/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13260/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13260/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13260/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13260/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13260/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13260/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13260/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13260/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13260/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13260.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">1547</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">88</span> An Intelligent Fuzzy-Neural Diagnostic System for Osteoporosis Risk Assessment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chin-Ming%20Hong">Chin-Ming Hong</a>, <a href="https://publications.waset.org/search?q=Chin-Teng%20Lin"> Chin-Teng Lin</a>, <a href="https://publications.waset.org/search?q=Chao-Yen%20Huang"> Chao-Yen Huang</a>, <a href="https://publications.waset.org/search?q=Yi-Ming%20Lin"> Yi-Ming Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we propose an Intelligent Medical Diagnostic System (IMDS) accessible through common web-based interface, to on-line perform initial screening for osteoporosis. The fundamental approaches which construct the proposed system are mainly based on the fuzzy-neural theory, which can exhibit superiority over other conventional technologies in many fields. In diagnosis process, users simply answer a series of directed questions to the system, and then they will immediately receive a list of results which represents the risk degrees of osteoporosis. According to clinical testing results, it is shown that the proposed system can provide the general public or even health care providers with a convenient, reliable, inexpensive approach to osteoporosis risk assessment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=BMD" title="BMD">BMD</a>, <a href="https://publications.waset.org/search?q=osteoporosis" title=" osteoporosis"> osteoporosis</a>, <a href="https://publications.waset.org/search?q=IMDS" title=" IMDS"> IMDS</a>, <a href="https://publications.waset.org/search?q=fuzzy-neural%20theory" title=" fuzzy-neural theory"> fuzzy-neural theory</a>, <a href="https://publications.waset.org/search?q=web%20interface." title="web interface.">web interface.</a> </p> <a href="https://publications.waset.org/382/an-intelligent-fuzzy-neural-diagnostic-system-for-osteoporosis-risk-assessment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/382/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/382/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/382/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/382/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/382/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/382/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/382/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/382/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/382/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/382/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/382.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">1949</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">87</span> Parallel-computing Approach for FFT Implementation on Digital Signal Processor (DSP)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yi-Pin%20Hsu">Yi-Pin Hsu</a>, <a href="https://publications.waset.org/search?q=Shin-Yu%20Lin"> Shin-Yu Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An efficient parallel form in digital signal processor can improve the algorithm performance. The butterfly structure is an important role in fast Fourier transform (FFT), because its symmetry form is suitable for hardware implementation. Although it can perform a symmetric structure, the performance will be reduced under the data-dependent flow characteristic. Even though recent research which call as novel memory reference reduction methods (NMRRM) for FFT focus on reduce memory reference in twiddle factor, the data-dependent property still exists. In this paper, we propose a parallel-computing approach for FFT implementation on digital signal processor (DSP) which is based on data-independent property and still hold the property of low-memory reference. The proposed method combines final two steps in NMRRM FFT to perform a novel data-independent structure, besides it is very suitable for multi-operation-unit digital signal processor and dual-core system. We have applied the proposed method of radix-2 FFT algorithm in low memory reference on TI TMSC320C64x DSP. Experimental results show the method can reduce 33.8% clock cycles comparing with the NMRRM FFT implementation and keep the low-memory reference property.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel-computing" title="Parallel-computing">Parallel-computing</a>, <a href="https://publications.waset.org/search?q=FFT" title=" FFT"> FFT</a>, <a href="https://publications.waset.org/search?q=low-memory%20reference" title=" low-memory reference"> low-memory reference</a>, <a href="https://publications.waset.org/search?q=TIDSP." title=" TIDSP."> TIDSP.</a> </p> <a href="https://publications.waset.org/4516/parallel-computing-approach-for-fft-implementation-on-digital-signal-processor-dsp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4516/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4516/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4516/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4516/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4516/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4516/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4516/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4516/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4516/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4516/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4516.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">2198</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">86</span> A Neural Network Based Facial Expression Analysis using Gabor Wavelets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Praseeda%20Lekshmi.V">Praseeda Lekshmi.V</a>, <a href="https://publications.waset.org/search?q=Dr.M.Sasikumar"> Dr.M.Sasikumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Facial expression analysis is rapidly becoming an area of intense interest in computer science and human-computer interaction design communities. The most expressive way humans display emotions is through facial expressions. In this paper we present a method to analyze facial expression from images by applying Gabor wavelet transform (GWT) and Discrete Cosine Transform (DCT) on face images. Radial Basis Function (RBF) Network is used to classify the facial expressions. As a second stage, the images are preprocessed to enhance the edge details and non uniform down sampling is done to reduce the computational complexity and processing time. Our method reliably works even with faces, which carry heavy expressions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Face%20Expression" title="Face Expression">Face Expression</a>, <a href="https://publications.waset.org/search?q=Radial%20Basis%20Function" title=" Radial Basis Function"> Radial Basis Function</a>, <a href="https://publications.waset.org/search?q=GaborWavelet%20Transform" title=" GaborWavelet Transform"> GaborWavelet Transform</a>, <a href="https://publications.waset.org/search?q=Human%20Computer%20Interaction." title=" Human Computer Interaction."> Human Computer Interaction.</a> </p> <a href="https://publications.waset.org/2741/a-neural-network-based-facial-expression-analysis-using-gabor-wavelets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2741/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2741/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2741/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2741/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2741/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2741/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2741/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2741/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2741/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2741/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2741.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">2107</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">85</span> RBF Based Face Recognition and Expression Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Praseeda%20Lekshmi.V">Praseeda Lekshmi.V</a>, <a href="https://publications.waset.org/search?q=Dr.M.Sasikumar"> Dr.M.Sasikumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Facial recognition and expression analysis is rapidly becoming an area of intense interest in computer science and humancomputer interaction design communities. The most expressive way humans display emotions is through facial expressions. In this paper skin and non-skin pixels were separated. Face regions were extracted from the detected skin regions. Facial expressions are analyzed from facial images by applying Gabor wavelet transform (GWT) and Discrete Cosine Transform (DCT) on face images. Radial Basis Function (RBF) Network is used to identify the person and to classify the facial expressions. Our method reliably works even with faces, which carry heavy expressions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Face%20Recognition" title="Face Recognition">Face Recognition</a>, <a href="https://publications.waset.org/search?q=Radial%20Basis%20Function" title=" Radial Basis Function"> Radial Basis Function</a>, <a href="https://publications.waset.org/search?q=Gabor%20Wavelet%20Transform" title="Gabor Wavelet Transform">Gabor Wavelet Transform</a>, <a href="https://publications.waset.org/search?q=Discrete%20Cosine%20Transform" title=" Discrete Cosine Transform"> Discrete Cosine Transform</a> </p> <a href="https://publications.waset.org/9404/rbf-based-face-recognition-and-expression-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9404/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9404/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9404/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9404/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9404/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9404/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9404/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9404/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9404/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9404/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9404.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">1595</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">84</span> Some Properties of Superfuzzy Subset of a Fuzzy Subset</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hassan%20Naraghi">Hassan Naraghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we define permutable and mutually permutable fuzzy subgroups of a group. Then we study their relation with permutable and mutually permutable subgroups of a group. Also we study some properties of fuzzy quasinormal subgroup. We define superfuzzy subset of a fuzzy subset and we study some properties of superfuzzy subset of a fuzzy subset.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Permutable%20fuzzy%20subgroup" title="Permutable fuzzy subgroup">Permutable fuzzy subgroup</a>, <a href="https://publications.waset.org/search?q=mutually%20permutable%20fuzzy%20subgroup" title=" mutually permutable fuzzy subgroup"> mutually permutable fuzzy subgroup</a>, <a href="https://publications.waset.org/search?q=fuzzy%20quasinormal%20subgroup" title=" fuzzy quasinormal subgroup"> fuzzy quasinormal subgroup</a>, <a href="https://publications.waset.org/search?q=superfuzzy%20subset." title=" superfuzzy subset."> superfuzzy subset.</a> </p> <a href="https://publications.waset.org/12660/some-properties-of-superfuzzy-subset-of-a-fuzzy-subset" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12660/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12660/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12660/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12660/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12660/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12660/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12660/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12660/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12660/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12660/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12660.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">1204</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">83</span> Hippocratic Database: A Privacy-Aware Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Norjihan%20Abdul%20Ghani">Norjihan Abdul Ghani</a>, <a href="https://publications.waset.org/search?q=Zailani%20Mohd%20Sidek"> Zailani Mohd Sidek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Nowadays, organizations and business has several motivating factors to protect an individual-s privacy. Confidentiality refers to type of sharing information to third parties. This is always referring to private information, especially for personal information that usually needs to keep as a private. Because of the important of privacy concerns today, we need to design a database system that suits with privacy. Agrawal et. al. has introduced Hippocratic Database also we refer here as a privacy-aware database. This paper will explain how HD can be a future trend for web-based application to enhance their privacy level of trustworthiness among internet users.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hippocratic%20database" title="Hippocratic database">Hippocratic database</a>, <a href="https://publications.waset.org/search?q=privacy" title=" privacy"> privacy</a>, <a href="https://publications.waset.org/search?q=privacy-aware." title=" privacy-aware."> privacy-aware.</a> </p> <a href="https://publications.waset.org/9597/hippocratic-database-a-privacy-aware-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9597/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9597/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9597/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9597/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9597/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9597/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9597/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9597/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9597/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9597/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9597.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">1832</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">82</span> Comparative Evaluation of Adaptive and Conventional Distance Relay for Parallel Transmission Line with Mutual Coupling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.G.%20Srivani">S.G. Srivani</a>, <a href="https://publications.waset.org/search?q=Chandrasekhar%20Reddy%20Atla"> Chandrasekhar Reddy Atla</a>, <a href="https://publications.waset.org/search?q=K.P.Vittal"> K.P.Vittal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the development of adaptive distance relay for protection of parallel transmission line with mutual coupling. The proposed adaptive relay, automatically adjusts its operation based on the acquisition of the data from distance relay of adjacent line and status of adjacent line from line circuit breaker IED (Intelligent Electronic Device). The zero sequence current of the adjacent parallel transmission line is used to compute zero sequence current ratio and the mutual coupling effect is fully compensated. The relay adapts to changing circumstances, like failure in communication from other relays and non - availability of adjacent transmission line. The performance of the proposed adaptive relay is tested using steady state and dynamic test procedures. The fault transients are obtained by simulating a realistic parallel transmission line system with mutual coupling effect in PSCAD. The evaluation test results show the efficacy of adaptive distance relay over the conventional distance relay. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20relaying" title="Adaptive relaying">Adaptive relaying</a>, <a href="https://publications.waset.org/search?q=distance%20measurement" title=" distance measurement"> distance measurement</a>, <a href="https://publications.waset.org/search?q=mutualcoupling" title=" mutualcoupling"> mutualcoupling</a>, <a href="https://publications.waset.org/search?q=quadrilateral%20trip%20characteristic" title=" quadrilateral trip characteristic"> quadrilateral trip characteristic</a>, <a href="https://publications.waset.org/search?q=zones%20of%20protection." title=" zones of protection."> zones of protection.</a> </p> <a href="https://publications.waset.org/2765/comparative-evaluation-of-adaptive-and-conventional-distance-relay-for-parallel-transmission-line-with-mutual-coupling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2765/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2765/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2765/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2765/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2765/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2765/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2765/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2765/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2765/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2765/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2765.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">3145</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">81</span> Temporal Change of Fractal Dimension of Explosion Earthquakes and Harmonic Tremors at Semeru Volcano, East Java, Indonesia, using Critical Exponent Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sukir%20Maryanto">Sukir Maryanto</a>, <a href="https://publications.waset.org/search?q=Iyan%20Mulyana"> Iyan Mulyana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fractal analyses of successive event of explosion earthquake and harmonic tremor recorded at Semeru volcano were carried out to investigate the dynamical system regarding to their generating mechanism. The explosive eruptions accompanied by explosion earthquakes and following volcanic tremor which are generated by continuous emission of volcanic ash. The fractal dimension of successive event of explosion and harmonic tremor was estimated by Critical Exponent Method (CEM). It was found that the method yield a higher fractal dimension of explosion earthquakes and gradually decrease during the occurrence of harmonic tremor, and can be considerably as correlated complexity of the source mechanism from the variance of fractal dimension. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fractal%20dimension" title="Fractal dimension">Fractal dimension</a>, <a href="https://publications.waset.org/search?q=Semeru%20volcano" title=" Semeru volcano"> Semeru volcano</a>, <a href="https://publications.waset.org/search?q=explosionearthquake" title=" explosionearthquake"> explosionearthquake</a>, <a href="https://publications.waset.org/search?q=harmonic%20tremor" title=" harmonic tremor"> harmonic tremor</a>, <a href="https://publications.waset.org/search?q=Critical%20Exponent%20Method" title=" Critical Exponent Method"> Critical Exponent Method</a> </p> <a href="https://publications.waset.org/12855/temporal-change-of-fractal-dimension-of-explosion-earthquakes-and-harmonic-tremors-at-semeru-volcano-east-java-indonesia-using-critical-exponent-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12855/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12855/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12855/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12855/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12855/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12855/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12855/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12855/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12855/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12855/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12855.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">1762</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">80</span> Voltage Stability Investigation of Grid Connected Wind Farm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Trinh%20Trong%20Chuong">Trinh Trong Chuong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> At present, it is very common to find renewable energy resources, especially wind power, connected to distribution systems. The impact of this wind power on voltage distribution levels has been addressed in the literature. The majority of this works deals with the determination of the maximum active and reactive power that is possible to be connected on a system load bus, until the voltage at that bus reaches the voltage collapse point. It is done by the traditional methods of PV curves reported in many references. Theoretical expression of maximum power limited by voltage stability transfer through a grid is formulated using an exact representation of distribution line with ABCD parameters. The expression is used to plot PV curves at various power factors of a radial system. Limited values of reactive power can be obtained. This paper presents a method to study the relationship between the active power and voltage (PV) at the load bus to identify the voltage stability limit. It is a foundation to build a permitted working operation region in complying with the voltage stability limit at the point of common coupling (PCC) connected wind farm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wind%20generator" title="Wind generator">Wind generator</a>, <a href="https://publications.waset.org/search?q=Voltage%20stability" title=" Voltage stability"> Voltage stability</a>, <a href="https://publications.waset.org/search?q=grid%20connected" title=" grid connected"> grid connected</a> </p> <a href="https://publications.waset.org/14898/voltage-stability-investigation-of-grid-connected-wind-farm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14898/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14898/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14898/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14898/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14898/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14898/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14898/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14898/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14898/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14898/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14898.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">3655</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">79</span> Wireless Healthcare Monitoring System for Home</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20Hui%20Teo">T. Hui Teo</a>, <a href="https://publications.waset.org/search?q=Wee%20Tiong%20Tan"> Wee Tiong Tan</a>, <a href="https://publications.waset.org/search?q=Pradeep%20K.%20Gopalakrishnan"> Pradeep K. Gopalakrishnan</a>, <a href="https://publications.waset.org/search?q=Victor%20K.%20H.%20Phay"> Victor K. H. Phay</a>, <a href="https://publications.waset.org/search?q=Ma%20Su%20M.%20M.%20Shwe">Ma Su M. M. Shwe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A healthcare monitoring system is presented in this paper. This system is based on ultra-low power sensor nodes and a personal server, which is based on hardware and software extensions to a Personal Digital Assistant (PDA)/Smartphone. The sensor node collects data from the body of a patient and sends it to the personal server where the data is processed, displayed and made ready to be sent to a healthcare network, if necessary. The personal server consists of a compact low power receiver module and equipped with a Smartphone software. The receiver module takes less than 30 × 30 mm board size and consumes approximately 25 mA in active mode. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=healthcare%20monitoring" title="healthcare monitoring">healthcare monitoring</a>, <a href="https://publications.waset.org/search?q=sensor%20node" title=" sensor node"> sensor node</a>, <a href="https://publications.waset.org/search?q=personal%20server" title=" personal server"> personal server</a>, <a href="https://publications.waset.org/search?q=wireless." title="wireless.">wireless.</a> </p> <a href="https://publications.waset.org/5820/wireless-healthcare-monitoring-system-for-home" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5820/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5820/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5820/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5820/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5820/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5820/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5820/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5820/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5820/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5820/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5820.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">1997</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">78</span> Digital Power Management Hardware Realization Using FPGA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kar%20Foo%20Chong">Kar Foo Chong</a>, <a href="https://publications.waset.org/search?q=Andreas%20Lee%20Astuti"> Andreas Lee Astuti</a>, <a href="https://publications.waset.org/search?q=Pradeep%20K.%20Gopalakrishnan"> Pradeep K. Gopalakrishnan</a>, <a href="https://publications.waset.org/search?q=T.%20Hui%20Teo"> T. Hui Teo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes design of a digital feedback loop for a low switching frequency dc-dc switching converters. Low switching frequencies were selected in this design. A look up table for the digital PID (proportional integrator differentiator) compensator was implemented using Altera Stratix II with built-in ADC (analog-to-digital converter) to achieve this hardware realization. Design guidelines are given for the PID compensator, high frequency DPWM (digital pulse width modulator) and moving average filter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=dc-dc%20converter" title="dc-dc converter">dc-dc converter</a>, <a href="https://publications.waset.org/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/search?q=PID" title=" PID"> PID</a>, <a href="https://publications.waset.org/search?q=power%20management" title=" power management"> power management</a>, <a href="https://publications.waset.org/search?q=." title=".">.</a> </p> <a href="https://publications.waset.org/6883/digital-power-management-hardware-realization-using-fpga" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6883/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6883/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6883/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6883/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6883/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6883/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6883/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6883/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6883/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6883/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6883.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">1997</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">77</span> Low Power Approach for Decimation Filter Hardware Realization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kar%20Foo%20Chong">Kar Foo Chong</a>, <a href="https://publications.waset.org/search?q=Pradeep%20K.%20Gopalakrishnan"> Pradeep K. Gopalakrishnan</a>, <a href="https://publications.waset.org/search?q=T.%20Hui%20Teo"> T. Hui Teo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are multiple ways to implement a decimator filter. This paper addresses usage of CIC (cascaded-integrator-comb) filter and HB (half band) filter as the decimator filter to reduce the frequency sample rate by factor of 64 and detail of the implementation step to realize this design in hardware. Low power design approach for CIC filter and half band filter will be discussed. The filter design is implemented through MATLAB system modeling, ASIC (application specific integrated circuit) design flow and verified using a FPGA (field programmable gate array) board and MATLAB analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CIC%20filter" title="CIC filter">CIC filter</a>, <a href="https://publications.waset.org/search?q=decimation%20filter" title=" decimation filter"> decimation filter</a>, <a href="https://publications.waset.org/search?q=half-band%20filter" title=" half-band filter"> half-band filter</a>, <a href="https://publications.waset.org/search?q=lowpower." title=" lowpower."> lowpower.</a> </p> <a href="https://publications.waset.org/15409/low-power-approach-for-decimation-filter-hardware-realization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15409/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15409/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15409/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15409/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15409/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15409/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15409/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15409/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15409/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15409/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15409.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">2397</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">76</span> A New Model for Question Answering Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20Reza%20Kangavari">Mohammad Reza Kangavari</a>, <a href="https://publications.waset.org/search?q=Samira%20Ghandchi"> Samira Ghandchi</a>, <a href="https://publications.waset.org/search?q=Manak%20Golpour"> Manak Golpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Most of the Question Answering systems composed of three main modules: question processing, document processing and answer processing. Question processing module plays an important role in QA systems. If this module doesn't work properly, it will make problems for other sections. Moreover answer processing module is an emerging topic in Question Answering, where these systems are often required to rank and validate candidate answers. These techniques aiming at finding short and precise answers are often based on the semantic classification. This paper discussed about a new model for question answering which improved two main modules, question processing and answer processing. There are two important components which are the bases of the question processing. First component is question classification that specifies types of question and answer. Second one is reformulation which converts the user's question into an understandable question by QA system in a specific domain. Answer processing module, consists of candidate answer filtering, candidate answer ordering components and also it has a validation section for interacting with user. This module makes it more suitable to find exact answer. In this paper we have described question and answer processing modules with modeling, implementing and evaluating the system. System implemented in two versions. Results show that 'Version No.1' gave correct answer to 70% of questions (30 correct answers to 50 asked questions) and 'version No.2' gave correct answers to 94% of questions (47 correct answers to 50 asked questions). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Answer%20Processing" title="Answer Processing">Answer Processing</a>, <a href="https://publications.waset.org/search?q=Classification" title=" Classification"> Classification</a>, <a href="https://publications.waset.org/search?q=QuestionAnswering%20and%20Query%20Reformulation." title=" QuestionAnswering and Query Reformulation."> QuestionAnswering and Query Reformulation.</a> </p> <a href="https://publications.waset.org/15301/a-new-model-for-question-answering-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15301/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15301/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15301/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15301/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15301/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15301/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15301/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15301/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15301/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15301/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15301.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">2125</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">75</span> Compiler-Based Architecture for Context Aware Frameworks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hossein%20Nejati">Hossein Nejati</a>, <a href="https://publications.waset.org/search?q=Seyed%20H.%20Mirisaee"> Seyed H. Mirisaee</a>, <a href="https://publications.waset.org/search?q=Gholam%20H.%20Dastghaibifard"> Gholam H. Dastghaibifard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computers are being integrated in the various aspects of human every day life in different shapes and abilities. This fact has intensified a requirement for the software development technologies which is ability to be: 1) portable, 2) adaptable, and 3) simple to develop. This problem is also known as the Pervasive Computing Problem (PCP) which can be implemented in different ways, each has its own pros and cons and Context Oriented Programming (COP) is one of the methods to address the PCP. In this paper a design for a COP framework, a context aware framework, is presented which has eliminated weak points of a previous design based on interpreter languages, while introducing the compiler languages power in implementing these frameworks. The key point of this improvement is combining COP and Dependency Injection (DI) techniques. Both old and new frameworks are analyzed to show advantages and disadvantages. Finally a simulation of both designs is proposed to indicating that the practical results agree with the theoretical analysis while the new design runs almost 8 times faster. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dependency%20Injection" title="Dependency Injection">Dependency Injection</a>, <a href="https://publications.waset.org/search?q=Compiler-based%20architecture" title=" Compiler-based architecture"> Compiler-based architecture</a>, <a href="https://publications.waset.org/search?q=Context-Oriented%20Programming" title="Context-Oriented Programming">Context-Oriented Programming</a>, <a href="https://publications.waset.org/search?q=COP" title=" COP"> COP</a>, <a href="https://publications.waset.org/search?q=Pervasive%20ComputingProblem" title=" Pervasive ComputingProblem"> Pervasive ComputingProblem</a> </p> <a href="https://publications.waset.org/135/compiler-based-architecture-for-context-aware-frameworks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/135/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/135/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/135/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/135/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/135/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/135/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/135/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/135/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/135/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/135/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/135.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">1929</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">74</span> Alcoholic Extract of Terminalia Arjuna Protects Rabbit Heart against Ischemic-Reperfusion Injury: Role of Antioxidant Enzymes and Heat Shock Protein</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Gauthaman">K. Gauthaman</a>, <a href="https://publications.waset.org/search?q=T.S.%20Mohamed%20Saleem"> T.S. Mohamed Saleem</a>, <a href="https://publications.waset.org/search?q=V.%20Ravi"> V. Ravi</a>, <a href="https://publications.waset.org/search?q=Sita%20Sharan%20Patel"> Sita Sharan Patel</a>, <a href="https://publications.waset.org/search?q=S.%20Niranjali%20Devaraj"> S. Niranjali Devaraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study was designed to investigate the cardio protective role of chronic oral administration of alcoholic extract of Terminalia arjuna in in-vivo ischemic reperfusion injury and the induction of HSP72. Rabbits, divided into three groups, and were administered with the alcoholic extract of the bark powder of Terminalia arjuna (TAAE) by oral gavage [6.75mg/kg: (T1) and 9.75mg/kg: (T2), 6 days /week for 12 weeks]. In open-chest Ketamine pentobarbitone anaesthetized rabbits, the left anterior descending coronary artery was occluded for 15 min of ischemia followed by 60 min of reperfusion. In the vehicle-treated group, ischemic-reperfusion injury (IRI) was evidenced by depression of global hemodynamic function (MAP, HR, LVEDP, peak LV (+) & (- ) (dP/dt) along with depletion of HEP compounds. Oxidative stress in IRI was evidenced by, raised levels of myocardial TBARS and depletion of endogenous myocardial antioxidants GSH, SOD and catalase. Western blot analysis showed a single band corresponding to 72 kDa in homogenates of hearts from rabbits treated with both the doses. In the alcoholic extract of the bark powder of Terminalia arjuna treatment groups, both the doses had better recovery of myocardial hemodynamic function, with significant reduction in TBARS, and rise in SOD, GSH, catalase were observed. The results of the present study suggest that the alcoholic extract of the bark powder of Terminalia arjuna in rabbit induces myocardial HSP 72 and augments myocardial endogenous antioxidants, without causing any cellular injury and offered better cardioprotection against oxidative stress associated with myocardial IR injury. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Antioxidants" title="Antioxidants">Antioxidants</a>, <a href="https://publications.waset.org/search?q=HSP72" title=" HSP72"> HSP72</a>, <a href="https://publications.waset.org/search?q=Ischemic%20reperfusion%20injury" title=" Ischemic reperfusion injury"> Ischemic reperfusion injury</a>, <a href="https://publications.waset.org/search?q=Terminalia%20arjuna." title="Terminalia arjuna.">Terminalia arjuna.</a> </p> <a href="https://publications.waset.org/7059/alcoholic-extract-of-terminalia-arjuna-protects-rabbit-heart-against-ischemic-reperfusion-injury-role-of-antioxidant-enzymes-and-heat-shock-protein" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7059/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7059/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7059/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7059/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7059/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7059/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7059/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7059/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7059/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7059/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7059.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">2301</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">73</span> Device Discover: A Component for Network Management System using Simple Network Management Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Garima%20Gupta">Garima Gupta</a>, <a href="https://publications.waset.org/search?q=Daya%20Gupta"> Daya Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Virtually all existing networked system management tools use a Manager/Agent paradigm. That is, distributed agents are deployed on managed devices to collect local information and report it back to some management unit. Even those that use standard protocols such as SNMP fall into this model. Using standard protocol has the advantage of interoperability among devices from different vendors. However, it may not be able to provide customized information that is of interest to satisfy specific management needs. In this dissertation work, different approaches are used to collect information regarding the devices attached to a Local Area Network. An SNMP aware application is being developed that will manage the discovery procedure and will be used as data collector. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ICMP%20Scanner" title="ICMP Scanner">ICMP Scanner</a>, <a href="https://publications.waset.org/search?q=Network%20Discovery" title=" Network Discovery"> Network Discovery</a>, <a href="https://publications.waset.org/search?q=NetworkManagement" title=" NetworkManagement"> NetworkManagement</a>, <a href="https://publications.waset.org/search?q=SNMP%20Scanner." title=" SNMP Scanner."> SNMP Scanner.</a> </p> <a href="https://publications.waset.org/6812/device-discover-a-component-for-network-management-system-using-simple-network-management-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6812/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6812/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6812/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6812/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6812/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6812/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6812/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6812/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6812/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6812/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6812.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">1666</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">72</span> A Comparison of the Sum of Squares in Linear and Partial Linear Regression Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dursun%20Ayd%C4%B1n">Dursun Aydın</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, estimation of the linear regression model is made by ordinary least squares method and the partially linear regression model is estimated by penalized least squares method using smoothing spline. Then, it is investigated that differences and similarity in the sum of squares related for linear regression and partial linear regression models (semi-parametric regression models). It is denoted that the sum of squares in linear regression is reduced to sum of squares in partial linear regression models. Furthermore, we indicated that various sums of squares in the linear regression are similar to different deviance statements in partial linear regression. In addition to, coefficient of the determination derived in linear regression model is easily generalized to coefficient of the determination of the partial linear regression model. For this aim, it is made two different applications. A simulated and a real data set are considered to prove the claim mentioned here. In this way, this study is supported with a simulation and a real data example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Partial%20Linear%20Regression%20Model" title="Partial Linear Regression Model">Partial Linear Regression Model</a>, <a href="https://publications.waset.org/search?q=Linear%20RegressionModel" title=" Linear RegressionModel"> Linear RegressionModel</a>, <a href="https://publications.waset.org/search?q=Residuals" title=" Residuals"> Residuals</a>, <a href="https://publications.waset.org/search?q=Deviance" title=" Deviance"> Deviance</a>, <a href="https://publications.waset.org/search?q=Smoothing%20Spline." title=" Smoothing Spline."> Smoothing Spline.</a> </p> <a href="https://publications.waset.org/9806/a-comparison-of-the-sum-of-squares-in-linear-and-partial-linear-regression-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9806/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9806/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9806/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9806/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9806/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9806/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9806/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9806/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9806/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9806/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9806.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">1872</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">71</span> A Genetic Algorithm with Priority Selection for the Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Cha-Hwa%20Lin">Cha-Hwa Lin</a>, <a href="https://publications.waset.org/search?q=Je-Wei%20Hu"> Je-Wei Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The conventional GA combined with a local search algorithm, such as the 2-OPT, forms a hybrid genetic algorithm(HGA) for the traveling salesman problem (TSP). However, the geometric properties which are problem specific knowledge can be used to improve the search process of the HGA. Some tour segments (edges) of TSPs are fine while some maybe too long to appear in a short tour. This knowledge could constrain GAs to work out with fine tour segments without considering long tour segments as often. Consequently, a new algorithm is proposed, called intelligent-OPT hybrid genetic algorithm (IOHGA), to improve the GA and the 2-OPT algorithm in order to reduce the search time for the optimal solution. Based on the geometric properties, all the tour segments are assigned 2-level priorities to distinguish between good and bad genes. A simulation study was conducted to evaluate the performance of the IOHGA. The experimental results indicate that in general the IOHGA could obtain near-optimal solutions with less time and better accuracy than the hybrid genetic algorithm with simulated annealing algorithm (HGA(SA)). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Traveling%20salesman%20problem" title="Traveling salesman problem">Traveling salesman problem</a>, <a href="https://publications.waset.org/search?q=hybrid%20geneticalgorithm" title=" hybrid geneticalgorithm"> hybrid geneticalgorithm</a>, <a href="https://publications.waset.org/search?q=priority%20selection" title=" priority selection"> priority selection</a>, <a href="https://publications.waset.org/search?q=2-OPT." title=" 2-OPT."> 2-OPT.</a> </p> <a href="https://publications.waset.org/14198/a-genetic-algorithm-with-priority-selection-for-the-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14198/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14198/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14198/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14198/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14198/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14198/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14198/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14198/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14198/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14198/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14198.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">1560</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">70</span> Analysis of Modified Heap Sort Algorithm on Different Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Vandana%20Sharma">Vandana Sharma</a>, <a href="https://publications.waset.org/search?q=Parvinder%20S.%20Sandhu"> Parvinder S. Sandhu</a>, <a href="https://publications.waset.org/search?q=Satwinder%20Singh"> Satwinder Singh</a>, <a href="https://publications.waset.org/search?q=Baljit%20Saini"> Baljit Saini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In field of Computer Science and Mathematics, sorting algorithm is an algorithm that puts elements of a list in a certain order i.e. ascending or descending. Sorting is perhaps the most widely studied problem in computer science and is frequently used as a benchmark of a system-s performance. This paper presented the comparative performance study of four sorting algorithms on different platform. For each machine, it is found that the algorithm depends upon the number of elements to be sorted. In addition, as expected, results show that the relative performance of the algorithms differed on the various machines. So, algorithm performance is dependent on data size and there exists impact of hardware also. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Algorithm" title="Algorithm">Algorithm</a>, <a href="https://publications.waset.org/search?q=Analysis" title=" Analysis"> Analysis</a>, <a href="https://publications.waset.org/search?q=Complexity" title=" Complexity"> Complexity</a>, <a href="https://publications.waset.org/search?q=Sorting." title=" Sorting."> Sorting.</a> </p> <a href="https://publications.waset.org/14236/analysis-of-modified-heap-sort-algorithm-on-different-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14236/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14236/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14236/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14236/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14236/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14236/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14236/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14236/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14236/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14236/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14236.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">2412</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">69</span> Protein Secondary Structure Prediction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Manpreet%20Singh">Manpreet Singh</a>, <a href="https://publications.waset.org/search?q=Parvinder%20Singh%20Sandhu"> Parvinder Singh Sandhu</a>, <a href="https://publications.waset.org/search?q=Reet%20Kamal%20Kaur"> Reet Kamal Kaur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Protein structure determination and prediction has been a focal research subject in the field of bioinformatics due to the importance of protein structure in understanding the biological and chemical activities of organisms. The experimental methods used by biotechnologists to determine the structures of proteins demand sophisticated equipment and time. A host of computational methods are developed to predict the location of secondary structure elements in proteins for complementing or creating insights into experimental results. However, prediction accuracies of these methods rarely exceed 70%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Protein" title="Protein">Protein</a>, <a href="https://publications.waset.org/search?q=Secondary%20Structure" title=" Secondary Structure"> Secondary Structure</a>, <a href="https://publications.waset.org/search?q=Prediction" title=" Prediction"> Prediction</a>, <a href="https://publications.waset.org/search?q=DNA" title=" DNA"> DNA</a>, <a href="https://publications.waset.org/search?q=RNA." title="RNA.">RNA.</a> </p> <a href="https://publications.waset.org/14119/protein-secondary-structure-prediction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14119/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14119/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14119/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14119/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14119/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14119/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14119/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14119/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14119/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14119/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14119.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">1389</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">68</span> Cluster Algorithm for Genetic Diversity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Manpreet%20Singh">Manpreet Singh</a>, <a href="https://publications.waset.org/search?q=Keerat%20Kaur"> Keerat Kaur</a>, <a href="https://publications.waset.org/search?q=Bhavdeep%20Singh"> Bhavdeep Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the hardware technology advancing, the cost of storing is decreasing. Thus there is an urgent need for new techniques and tools that can intelligently and automatically assist us in transferring this data into useful knowledge. Different techniques of data mining are developed which are helpful for handling these large size databases [7]. Data mining is also finding its role in the field of biotechnology. Pedigree means the associated ancestry of a crop variety. Genetic diversity is the variation in the genetic composition of individuals within or among species. Genetic diversity depends upon the pedigree information of the varieties. Parents at lower hierarchic levels have more weightage for predicting genetic diversity as compared to the upper hierarchic levels. The weightage decreases as the level increases. For crossbreeding, the two varieties should be more and more genetically diverse so as to incorporate the useful characters of the two varieties in the newly developed variety. This paper discusses the searching and analyzing of different possible pairs of varieties selected on the basis of morphological characters, Climatic conditions and Nutrients so as to obtain the most optimal pair that can produce the required crossbreed variety. An algorithm was developed to determine the genetic diversity between the selected wheat varieties. Cluster analysis technique is used for retrieving the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20diversity" title="Genetic diversity">Genetic diversity</a>, <a href="https://publications.waset.org/search?q=pedigree" title=" pedigree"> pedigree</a>, <a href="https://publications.waset.org/search?q=nutrients." title=" nutrients."> nutrients.</a> </p> <a href="https://publications.waset.org/13983/cluster-algorithm-for-genetic-diversity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13983/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13983/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13983/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13983/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13983/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13983/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13983/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13983/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13983/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13983/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13983.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">1802</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">67</span> A Complexity Measure for Java Bean based Software Components</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sandeep%20Khimta">Sandeep Khimta</a>, <a href="https://publications.waset.org/search?q=Parvinder%20S.%20Sandhu"> Parvinder S. Sandhu</a>, <a href="https://publications.waset.org/search?q=Amanpreet%20Singh%20Brar"> Amanpreet Singh Brar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The traditional software product and process metrics are neither suitable nor sufficient in measuring the complexity of software components, which ultimately is necessary for quality and productivity improvement within organizations adopting CBSE. Researchers have proposed a wide range of complexity metrics for software systems. However, these metrics are not sufficient for components and component-based system and are restricted to the module-oriented systems and object-oriented systems. In this proposed study it is proposed to find the complexity of the JavaBean Software Components as a reflection of its quality and the component can be adopted accordingly to make it more reusable. The proposed metric involves only the design issues of the component and does not consider the packaging and the deployment complexity. In this way, the software components could be kept in certain limit which in turn help in enhancing the quality and productivity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=JavaBean%20Components" title="JavaBean Components">JavaBean Components</a>, <a href="https://publications.waset.org/search?q=Complexity" title=" Complexity"> Complexity</a>, <a href="https://publications.waset.org/search?q=Metrics" title=" Metrics"> Metrics</a>, <a href="https://publications.waset.org/search?q=Validation." title="Validation.">Validation.</a> </p> <a href="https://publications.waset.org/7452/a-complexity-measure-for-java-bean-based-software-components" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7452/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7452/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7452/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7452/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7452/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7452/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7452/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7452/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7452/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7452/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7452.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">1527</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">66</span> Enhanced Character Based Algorithm for Small Parsimony</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Parvinder%20Singh%20Sandhu">Parvinder Singh Sandhu</a>, <a href="https://publications.waset.org/search?q=Sumeet%20Kaur%20Sehra"> Sumeet Kaur Sehra</a>, <a href="https://publications.waset.org/search?q=Karmjit%20Kaur"> Karmjit Kaur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Phylogenetic tree is a graphical representation of the evolutionary relationship among three or more genes or organisms. These trees show relatedness of data sets, species or genes divergence time and nature of their common ancestors. Quality of a phylogenetic tree requires parsimony criterion. Various approaches have been proposed for constructing most parsimonious trees. This paper is concerned about calculating and optimizing the changes of state that are needed called Small Parsimony Algorithms. This paper has proposed enhanced small parsimony algorithm to give better score based on number of evolutionary changes needed to produce the observed sequence changes tree and also give the ancestor of the given input. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Phylogenetic%20Analysis" title="Phylogenetic Analysis">Phylogenetic Analysis</a>, <a href="https://publications.waset.org/search?q=Small%20Parsimony" title=" Small Parsimony"> Small Parsimony</a>, <a href="https://publications.waset.org/search?q=EnhancedFitch%20Algorithm" title=" EnhancedFitch Algorithm"> EnhancedFitch Algorithm</a>, <a href="https://publications.waset.org/search?q=Enhanced%20Sakoff%20Algorithm." title=" Enhanced Sakoff Algorithm."> Enhanced Sakoff Algorithm.</a> </p> <a href="https://publications.waset.org/5111/enhanced-character-based-algorithm-for-small-parsimony" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5111/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5111/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5111/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5111/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5111/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5111/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5111/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5111/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5111/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5111/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5111.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">1349</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">65</span> Delay Preserving Substructures in Wireless Networks Using Edge Difference between a Graph and its Square Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20N.%20Janakiraman">T. N. Janakiraman</a>, <a href="https://publications.waset.org/search?q=J.%20Janet%20Lourds%20Rani"> J. Janet Lourds Rani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In practice, wireless networks has the property that the signal strength attenuates with respect to the distance from the base station, it could be better if the nodes at two hop away are considered for better quality of service. In this paper, we propose a procedure to identify delay preserving substructures for a given wireless ad-hoc network using a new graph operation G 2 – E (G) = G* (Edge difference of square graph of a given graph and the original graph). This operation helps to analyze some induced substructures, which preserve delay in communication among them. This operation G* on a given graph will induce a graph, in which 1- hop neighbors of any node are at 2-hop distance in the original network. In this paper, we also identify some delay preserving substructures in G*, which are (i) set of all nodes, which are mutually at 2-hop distance in G that will form a clique in G*, (ii) set of nodes which forms an odd cycle C2k+1 in G, will form an odd cycle in G* and the set of nodes which form a even cycle C2k in G that will form two disjoint companion cycles ( of same parity odd/even) of length k in G*, (iii) every path of length 2k+1 or 2k in G will induce two disjoint paths of length k in G*, and (iv) set of nodes in G*, which induces a maximal connected sub graph with radius 1 (which identifies a substructure with radius equal 2 and diameter at most 4 in G). The above delay preserving sub structures will behave as good clusters in the original network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clique" title="Clique">Clique</a>, <a href="https://publications.waset.org/search?q=cycles" title=" cycles"> cycles</a>, <a href="https://publications.waset.org/search?q=delay%20preserving%20substructures" title=" delay preserving substructures"> delay preserving substructures</a>, <a href="https://publications.waset.org/search?q=maximal%20connected%20sub%20graph." title="maximal connected sub graph.">maximal connected sub graph.</a> </p> <a href="https://publications.waset.org/9283/delay-preserving-substructures-in-wireless-networks-using-edge-difference-between-a-graph-and-its-square-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9283/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9283/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9283/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9283/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9283/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9283/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9283/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9283/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9283/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9283/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9283.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">1254</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">64</span> Color Image Edge Detection using Pseudo-Complement and Matrix Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20N.%20Janakiraman">T. N. Janakiraman</a>, <a href="https://publications.waset.org/search?q=P.%20V.%20S.%20S.%20R.%20Chandra%20Mouli"> P. V. S. S. R. Chandra Mouli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A color image edge detection algorithm is proposed in this paper using Pseudo-complement and matrix rotation operations. First, pseudo-complement method is applied on the image for each channel. Then, matrix operations are applied on the output image of the first stage. Dominant pixels are obtained by image differencing between the pseudo-complement image and the matrix operated image. Median filtering is carried out to smoothen the image thereby removing the isolated pixels. Finally, the dominant or core pixels occurring in at least two channels are selected. On plotting the selected edge pixels, the final edge map of the given color image is obtained. The algorithm is also tested in HSV and YCbCr color spaces. Experimental results on both synthetic and real world images show that the accuracy of the proposed method is comparable to other color edge detectors. All the proposed procedures can be applied to any image domain and runs in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Color%20edge%20detection" title="Color edge detection">Color edge detection</a>, <a href="https://publications.waset.org/search?q=dominant%20pixels" title=" dominant pixels"> dominant pixels</a>, <a href="https://publications.waset.org/search?q=matrixrotation%2Fshift%20operations" title=" matrixrotation/shift operations"> matrixrotation/shift operations</a>, <a href="https://publications.waset.org/search?q=pseudo-complement." title=" pseudo-complement."> pseudo-complement.</a> </p> <a href="https://publications.waset.org/2069/color-image-edge-detection-using-pseudo-complement-and-matrix-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2069/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2069/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2069/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2069/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2069/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2069/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2069/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2069/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2069/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2069/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2069.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">2331</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">63</span> Dynamic Modeling and Simulation of Threephase Small Power Induction Motor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nyein%20Nyein%20Soe">Nyein Nyein Soe</a>, <a href="https://publications.waset.org/search?q=Thet%20Thet%20Han%20Yee"> Thet Thet Han Yee</a>, <a href="https://publications.waset.org/search?q=Soe%20Sandar%20Aung"> Soe Sandar Aung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is proposed the dynamic simulation of small power induction motor based on Mathematical modeling. The dynamic simulation is one of the key steps in the validation of the design process of the motor drive systems and it is needed for eliminating inadvertent design mistakes and the resulting error in the prototype construction and testing. This paper demonstrates the simulation of steady-state performance of induction motor by MATLAB Program Three phase 3 hp induction motor is modeled and simulated with SIMULINK model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Squirrel%20cage%20induction%20motor" title="Squirrel cage induction motor">Squirrel cage induction motor</a>, <a href="https://publications.waset.org/search?q=modeling%20andsimulation" title=" modeling andsimulation"> modeling andsimulation</a>, <a href="https://publications.waset.org/search?q=MATLAB%20software" title=" MATLAB software"> MATLAB software</a>, <a href="https://publications.waset.org/search?q=torque" title=" torque"> torque</a>, <a href="https://publications.waset.org/search?q=speed." title=" speed."> speed.</a> </p> <a href="https://publications.waset.org/11158/dynamic-modeling-and-simulation-of-threephase-small-power-induction-motor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11158/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11158/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11158/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11158/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11158/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11158/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11158/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11158/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11158/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11158/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11158.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">4520</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">62</span> Design Calculation and Performance Testing of Heating Coil in Induction Surface Hardening Machine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Soe%20Sandar%20Aung">Soe Sandar Aung</a>, <a href="https://publications.waset.org/search?q=Han%20Phyo%20Wai"> Han Phyo Wai</a>, <a href="https://publications.waset.org/search?q=Nyein%20Nyein%20Soe"> Nyein Nyein Soe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The induction hardening machines are utilized in the industries which modify machine parts and tools needed to achieve high ware resistance. This paper describes the model of induction heating process design of inverter circuit and the results of induction surface hardening of heating coil. In the design of heating coil, the shape and the turn numbers of the coil are very important design factors because they decide the overall operating performance of induction heater including resonant frequency, Q factor, efficiency and power factor. The performance will be tested by experiments in some cases high frequency induction hardening machine. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Induction%20Heating" title="Induction Heating">Induction Heating</a>, <a href="https://publications.waset.org/search?q=Resonant%20Circuit" title=" Resonant Circuit"> Resonant Circuit</a>, <a href="https://publications.waset.org/search?q=InverterCircuit" title=" InverterCircuit"> InverterCircuit</a>, <a href="https://publications.waset.org/search?q=Coil%20Design" title=" Coil Design"> Coil Design</a>, <a href="https://publications.waset.org/search?q=Induction%20Hardening%20Machine." title=" Induction Hardening Machine."> Induction Hardening Machine.</a> </p> <a href="https://publications.waset.org/13504/design-calculation-and-performance-testing-of-heating-coil-in-induction-surface-hardening-machine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13504/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13504/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13504/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13504/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13504/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13504/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13504/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13504/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13504/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13504/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13504.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">22283</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">61</span> Increasing Lifetime of Target Tracking Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Khin%20Thanda%20Soe">Khin Thanda Soe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A model to identify the lifetime of target tracking wireless sensor network is proposed. The model is a static clusterbased architecture and aims to provide two factors. First, it is to increase the lifetime of target tracking wireless sensor network. Secondly, it is to enable good localization result with low energy consumption for each sensor in the network. The model consists of heterogeneous sensors and each sensing member node in a cluster uses two operation modes–active mode and sleep mode. The performance results illustrate that the proposed architecture consumes less energy and increases lifetime than centralized and dynamic clustering architectures, for target tracking sensor network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network%20lifetime" title="Network lifetime">Network lifetime</a>, <a href="https://publications.waset.org/search?q=Target%20Localization" title=" Target Localization"> Target Localization</a>, <a href="https://publications.waset.org/search?q=TargetTracking" title=" TargetTracking"> TargetTracking</a>, <a href="https://publications.waset.org/search?q=Wireless%20Sensor%20Networks." title=" Wireless Sensor Networks."> Wireless Sensor Networks.</a> </p> <a href="https://publications.waset.org/10675/increasing-lifetime-of-target-tracking-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10675/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10675/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10675/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10675/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10675/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10675/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10675/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10675/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10675/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10675/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10675.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">1723</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">60</span> Solar Energy Potential and Applications in Myanmar</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Thet%20Thet%20Han%20Yee">Thet Thet Han Yee</a>, <a href="https://publications.waset.org/search?q=Su%20Su%20Win"> Su Su Win</a>, <a href="https://publications.waset.org/search?q=Nyein%20Nyein%20Soe"> Nyein Nyein Soe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Energy consumption is one of the indices in determining the levels of development of a nation. Therefore, availability of energy supply to all sectors of life in any country is crucial for its development. These exists shortage of all kinds of energy, particularly electricity which is badly needed for economic development. Electricity from the sun which is quite abundant in most of the developing countries is used in rural areas to meet basic electricity needs of a rural community. Today-s electricity supply in Myanmar is generated by fuel generators and hydroelectric power plants. However, far-flung areas which are away from National Grids cannot enjoy the electricity generated by these sources. Since Myanmar is a land of plentiful sunshine, especially in central and southern regions of the country, the first form of energy- solar energy could hopefully become the final solution to its energy supply problem. The direct conversion of solar energy into electricity using photovoltaic system has been receiving intensive installation not only in developed countries but also in developing countries. It is mainly intended to present solar energy potential and application in Myanmar. It is also wanted to get the benefits of using solar energy for people in remote areas which are not yet connected to the national grids because of the high price of fossil fuel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Electricity%20supply%20in%20Myanmar" title="Electricity supply in Myanmar">Electricity supply in Myanmar</a>, <a href="https://publications.waset.org/search?q=National%20Grids" title=" National Grids"> National Grids</a>, <a href="https://publications.waset.org/search?q=solarenergy." title=" solarenergy."> solarenergy.</a> </p> <a href="https://publications.waset.org/12130/solar-energy-potential-and-applications-in-myanmar" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12130/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12130/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12130/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12130/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12130/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12130/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12130/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12130/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12130/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12130/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12130.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">7882</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">59</span> Implementation of Neural Network Based Electricity Load Forecasting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Myint%20Myint%20Yi">Myint Myint Yi</a>, <a href="https://publications.waset.org/search?q=Khin%20Sandar%20Linn"> Khin Sandar Linn</a>, <a href="https://publications.waset.org/search?q=Marlar%20Kyaw"> Marlar Kyaw</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposed a novel model for short term load forecast (STLF) in the electricity market. The prior electricity demand data are treated as time series. The model is composed of several neural networks whose data are processed using a wavelet technique. The model is created in the form of a simulation program written with MATLAB. The load data are treated as time series data. They are decomposed into several wavelet coefficient series using the wavelet transform technique known as Non-decimated Wavelet Transform (NWT). The reason for using this technique is the belief in the possibility of extracting hidden patterns from the time series data. The wavelet coefficient series are used to train the neural networks (NNs) and used as the inputs to the NNs for electricity load prediction. The Scale Conjugate Gradient (SCG) algorithm is used as the learning algorithm for the NNs. To get the final forecast data, the outputs from the NNs are recombined using the same wavelet technique. The model was evaluated with the electricity load data of Electronic Engineering Department in Mandalay Technological University in Myanmar. The simulation results showed that the model was capable of producing a reasonable forecasting accuracy in STLF. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Neural%20network" title="Neural network">Neural network</a>, <a href="https://publications.waset.org/search?q=Load%20forecast" title=" Load forecast"> Load forecast</a>, <a href="https://publications.waset.org/search?q=Time%20series" title=" Time series"> Time series</a>, <a href="https://publications.waset.org/search?q=wavelettransform." title=" wavelettransform."> wavelettransform.</a> </p> <a href="https://publications.waset.org/139/implementation-of-neural-network-based-electricity-load-forecasting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/139/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/139/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/139/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/139/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/139/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/139/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/139/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/139/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/139/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/139/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/139.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">2493</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">58</span> Feature Subset Selection approach based on Maximizing Margin of Support Vector Classifier</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Khin%20May%20Win">Khin May Win</a>, <a href="https://publications.waset.org/search?q=Nan%20Sai%20Moon%20Kham"> Nan Sai Moon Kham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Identification of cancer genes that might anticipate the clinical behaviors from different types of cancer disease is challenging due to the huge number of genes and small number of patients samples. The new method is being proposed based on supervised learning of classification like support vector machines (SVMs).A new solution is described by the introduction of the Maximized Margin (MM) in the subset criterion, which permits to get near the least generalization error rate. In class prediction problem, gene selection is essential to improve the accuracy and to identify genes for cancer disease. The performance of the new method was evaluated with real-world data experiment. It can give the better accuracy for classification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Microarray%20data" title="Microarray data">Microarray data</a>, <a href="https://publications.waset.org/search?q=feature%20selection" title=" feature selection"> feature selection</a>, <a href="https://publications.waset.org/search?q=recursive%20featureelimination" title=" recursive featureelimination"> recursive featureelimination</a>, <a href="https://publications.waset.org/search?q=support%20vector%20machines." title=" support vector machines."> support vector machines.</a> </p> <a href="https://publications.waset.org/15714/feature-subset-selection-approach-based-on-maximizing-margin-of-support-vector-classifier" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15714/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15714/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15714/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15714/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15714/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15714/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15714/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15714/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15714/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15714/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15714.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">1541</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">57</span> Exploiting Query Feedback for Efficient Query Routing in Unstructured Peer-to-peer Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Iskandar%20Ishak">Iskandar Ishak</a>, <a href="https://publications.waset.org/search?q=Naomie%20Salim"> Naomie Salim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query routing processes to learn the routing based on the feedbacks collected. In an unstructured network where there is no global information available, efficient and low cost routing approach is needed for routing efficiency. In this paper, we propose a novel mechanism for query-feedback oriented routing indices to achieve routing efficiency in unstructured network at a minimal cost. The approach also applied information retrieval technique to make sure the content of the query is understandable and will make the routing process not just based to the query hits but also related to the query content. Experiments have shown that the proposed mechanism performs more efficient than flood-based routing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Unstructured%20peer-to-peer" title="Unstructured peer-to-peer">Unstructured peer-to-peer</a>, <a href="https://publications.waset.org/search?q=Searching" title=" Searching"> Searching</a>, <a href="https://publications.waset.org/search?q=Retrieval" title=" Retrieval"> Retrieval</a>, <a href="https://publications.waset.org/search?q=Internet." title="Internet.">Internet.</a> </p> <a href="https://publications.waset.org/1111/exploiting-query-feedback-for-efficient-query-routing-in-unstructured-peer-to-peer-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1111/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1111/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1111/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1111/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1111/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1111/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1111/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1111/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1111/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1111/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1111.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">1535</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">56</span> Averaging Mechanisms to Decision Making for Handover in GSM</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Akhila">S. Akhila</a>, <a href="https://publications.waset.org/search?q=M.%20Lakshminarayana"> M. Lakshminarayana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In cellular networks, limited availability of resources has to be tapped to its fullest potential. In view of this aspect, a sophisticated averaging and voting technique has been discussed in this paper, wherein the radio resources available are utilized to the fullest value by taking into consideration, several network and radio parameters which decide on when the handover has to be made and thereby reducing the load on Base station .The increase in the load on the Base station might be due to several unnecessary handover taking place which can be eliminated by making judicious use of the radio and network parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Averaging%20and%20Voting" title="Averaging and Voting">Averaging and Voting</a>, <a href="https://publications.waset.org/search?q=Handover" title=" Handover"> Handover</a>, <a href="https://publications.waset.org/search?q=QoS." title=" QoS."> QoS.</a> </p> <a href="https://publications.waset.org/3593/averaging-mechanisms-to-decision-making-for-handover-in-gsm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3593/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3593/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3593/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3593/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3593/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3593/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3593/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3593/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3593/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3593/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3593.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">3509</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">55</span> Walking Hexapod Robot in Disaster Recovery: Developing Algorithm for Terrain Negotiation and Navigation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Md.%20Masum%20Billah">Md. Masum Billah</a>, <a href="https://publications.waset.org/search?q=Mohiuddin%20Ahmed"> Mohiuddin Ahmed</a>, <a href="https://publications.waset.org/search?q=Soheli%20Farhana"> Soheli Farhana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In modern day disaster recovery mission has become one of the top priorities in any natural disaster management regime. Smart autonomous robots may play a significant role in such missions, including search for life under earth quake hit rubbles, Tsunami hit islands, de-mining in war affected areas and many other such situations. In this paper current state of many walking robots are compared and advantages of hexapod systems against wheeled robots are described. In our research we have selected a hexapod spider robot; we are developing focusing mainly on efficient navigation method in different terrain using apposite gait of locomotion, which will make it faster and at the same time energy efficient to navigate and negotiate difficult terrain. This paper describes the method of terrain negotiation navigation in a hazardous field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Walking%20robots" title="Walking robots">Walking robots</a>, <a href="https://publications.waset.org/search?q=locomotion" title=" locomotion"> locomotion</a>, <a href="https://publications.waset.org/search?q=hexapod%20robot" title=" hexapod robot"> hexapod robot</a>, <a href="https://publications.waset.org/search?q=gait" title=" gait"> gait</a>, <a href="https://publications.waset.org/search?q=hazardous%20field." title="hazardous field.">hazardous field.</a> </p> <a href="https://publications.waset.org/15549/walking-hexapod-robot-in-disaster-recovery-developing-algorithm-for-terrain-negotiation-and-navigation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15549/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15549/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15549/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15549/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15549/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15549/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15549/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15549/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15549/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15549/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15549.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">4433</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">54</span> An Intelligent System for Phish Detection, using Dynamic Analysis and Template Matching</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chinmay%20Soman">Chinmay Soman</a>, <a href="https://publications.waset.org/search?q=Hrishikesh%20Pathak"> Hrishikesh Pathak</a>, <a href="https://publications.waset.org/search?q=Vishal%20Shah"> Vishal Shah</a>, <a href="https://publications.waset.org/search?q=Aniket%20Padhye"> Aniket Padhye</a>, <a href="https://publications.waset.org/search?q=Amey%20Inamdar"> Amey Inamdar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Phishing, or stealing of sensitive information on the web, has dealt a major blow to Internet Security in recent times. Most of the existing anti-phishing solutions fail to handle the fuzziness involved in phish detection, thus leading to a large number of false positives. This fuzziness is attributed to the use of highly flexible and at the same time, highly ambiguous HTML language. We introduce a new perspective against phishing, that tries to systematically prove, whether a given page is phished or not, using the corresponding original page as the basis of the comparison. It analyzes the layout of the pages under consideration to determine the percentage distortion between them, indicative of any form of malicious alteration. The system design represents an intelligent system, employing dynamic assessment which accurately identifies brand new phishing attacks and will prove effective in reducing the number of false positives. This framework could potentially be used as a knowledge base, in educating the internet users against phishing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=World%20Wide%20Web" title="World Wide Web">World Wide Web</a>, <a href="https://publications.waset.org/search?q=Phishing" title=" Phishing"> Phishing</a>, <a href="https://publications.waset.org/search?q=Internet%20security" title=" Internet security"> Internet security</a>, <a href="https://publications.waset.org/search?q=data%0Amining." title=" data mining."> data mining.</a> </p> <a href="https://publications.waset.org/3599/an-intelligent-system-for-phish-detection-using-dynamic-analysis-and-template-matching" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3599/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3599/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3599/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3599/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3599/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3599/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3599/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3599/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3599/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3599/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3599.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">1832</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">53</span> Parallel and Distributed Mining of Association Rule on Knowledge Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=U.%20Sakthi">U. Sakthi</a>, <a href="https://publications.waset.org/search?q=R.%20Hemalatha"> R. Hemalatha</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20Bhuvaneswaran"> R. S. Bhuvaneswaran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Virtual organization, Knowledge Discovery (KD) service contains distributed data resources and computing grid nodes. Computational grid is integrated with data grid to form Knowledge Grid, which implements Apriori algorithm for mining association rule on grid network. This paper describes development of parallel and distributed version of Apriori algorithm on Globus Toolkit using Message Passing Interface extended with Grid Services (MPICHG2). The creation of Knowledge Grid on top of data and computational grid is to support decision making in real time applications. In this paper, the case study describes design and implementation of local and global mining of frequent item sets. The experiments were conducted on different configurations of grid network and computation time was recorded for each operation. We analyzed our result with various grid configurations and it shows speedup of computation time is almost superlinear. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Association%20rule" title="Association rule">Association rule</a>, <a href="https://publications.waset.org/search?q=Grid%20computing" title=" Grid computing"> Grid computing</a>, <a href="https://publications.waset.org/search?q=Knowledge%20grid" title=" Knowledge grid"> Knowledge grid</a>, <a href="https://publications.waset.org/search?q=Mobility%20prediction." title="Mobility prediction.">Mobility prediction.</a> </p> <a href="https://publications.waset.org/11084/parallel-and-distributed-mining-of-association-rule-on-knowledge-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11084/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11084/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11084/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11084/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11084/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11084/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11084/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11084/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11084/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11084/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11084.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">2181</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">52</span> Fiber Optic Sensors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bahareh%20Gholamzadeh">Bahareh Gholamzadeh</a>, <a href="https://publications.waset.org/search?q=Hooman%20Nabovati"> Hooman Nabovati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fiber optic sensor technology offers the possibility of sensing different parameters like strain, temperature, pressure in harsh environment and remote locations. these kinds of sensors modulates some features of the light wave in an optical fiber such an intensity and phase or use optical fiber as a medium for transmitting the measurement information. The advantages of fiber optic sensors in contrast to conventional electrical ones make them popular in different applications and now a day they consider as a key component in improving industrial processes, quality control systems, medical diagnostics, and preventing and controlling general process abnormalities. This paper is an introduction to fiber optic sensor technology and some of the applications that make this branch of optic technology, which is still in its early infancy, an interesting field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fiber%20optic%20sensors" title="Fiber optic sensors">Fiber optic sensors</a>, <a href="https://publications.waset.org/search?q=distributed%20sensors" title=" distributed sensors"> distributed sensors</a>, <a href="https://publications.waset.org/search?q=sensorapplication" title=" sensorapplication"> sensorapplication</a>, <a href="https://publications.waset.org/search?q=crack%20sensor." title=" crack sensor."> crack sensor.</a> </p> <a href="https://publications.waset.org/10905/fiber-optic-sensors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10905/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10905/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10905/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10905/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10905/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10905/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10905/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10905/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10905/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10905/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10905.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">6520</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">51</span> Newton-Raphson State Estimation Solution Employing Systematically Constructed Jacobian Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nursyarizal%20Mohd%20Nor">Nursyarizal Mohd Nor</a>, <a href="https://publications.waset.org/search?q=Ramiah%20Jegatheesan"> Ramiah Jegatheesan</a>, <a href="https://publications.waset.org/search?q=Perumal%20Nallagownden"> Perumal Nallagownden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Newton-Raphson State Estimation method using bus admittance matrix remains as an efficient and most popular method to estimate the state variables. Elements of Jacobian matrix are computed from standard expressions which lack physical significance. In this paper, elements of the state estimation Jacobian matrix are obtained considering the power flow measurements in the network elements. These elements are processed one-by-one and the Jacobian matrix H is updated suitably in a simple manner. The constructed Jacobian matrix H is integrated with Weight Least Square method to estimate the state variables. The suggested procedure is successfully tested on IEEE standard systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=State%20Estimation%20%28SE%29" title="State Estimation (SE)">State Estimation (SE)</a>, <a href="https://publications.waset.org/search?q=Weight%20Least%20Square%20%28WLS%29" title=" Weight Least Square (WLS)"> Weight Least Square (WLS)</a>, <a href="https://publications.waset.org/search?q=Newton-Raphson%20State%20Estimation%20%28NRSE%29" title="Newton-Raphson State Estimation (NRSE)">Newton-Raphson State Estimation (NRSE)</a>, <a href="https://publications.waset.org/search?q=Jacobian%20matrix%20H." title=" Jacobian matrix H."> Jacobian matrix H.</a> </p> <a href="https://publications.waset.org/12948/newton-raphson-state-estimation-solution-employing-systematically-constructed-jacobian-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12948/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12948/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12948/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12948/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12948/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12948/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12948/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12948/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12948/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12948/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12948.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">2465</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">50</span> A Middleware System between WEB and Database Servers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20H.%20Abu-Arqoub">Mohammad H. Abu-Arqoub</a>, <a href="https://publications.waset.org/search?q=Ihab%20S.%20Serhed"> Ihab S. Serhed</a>, <a href="https://publications.waset.org/search?q=Waheeb%20A.%20Abu-Dawwas"> Waheeb A. Abu-Dawwas</a>, <a href="https://publications.waset.org/search?q=Rashid%20M.%20Al-Azzeh"> Rashid M. Al-Azzeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims at improving web server performance by establishing a middleware layer between web and database servers, which minimizes the overload on the database server. A middleware system has been developed as a service mainly to improve the performance. This system manages connection accesses in a way that would result in reducing the overload on the database server. In addition to the connection management, this system acts as an object-oriented model for best utilization of operating system resources. A web developer can use this Service Broker to improve web server performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Database%20server" title="Database server">Database server</a>, <a href="https://publications.waset.org/search?q=Improve%20performance" title=" Improve performance"> Improve performance</a>, <a href="https://publications.waset.org/search?q=Middleware" title=" Middleware"> Middleware</a>, <a href="https://publications.waset.org/search?q=Web%20server." title=" Web server."> Web server.</a> </p> <a href="https://publications.waset.org/10929/a-middleware-system-between-web-and-database-servers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10929/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10929/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10929/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10929/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10929/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10929/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10929/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10929/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10929/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10929/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10929.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">2408</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">49</span> Multilevel Classifiers in Recognition of Handwritten Kannada Numerals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dinesh%20Acharya%20U.">Dinesh Acharya U.</a>, <a href="https://publications.waset.org/search?q=N.%20V.%20Subba%20Reddy"> N. V. Subba Reddy</a>, <a href="https://publications.waset.org/search?q=Krishnamoorthi%20Makkithaya"> Krishnamoorthi Makkithaya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The recognition of handwritten numeral is an important area of research for its applications in post office, banks and other organizations. This paper presents automatic recognition of handwritten Kannada numerals based on structural features. Five different types of features, namely, profile based 10-segment string, water reservoir; vertical and horizontal strokes, end points and average boundary length from the minimal bounding box are used in the recognition of numeral. The effect of each feature and their combination in the numeral classification is analyzed using nearest neighbor classifiers. It is common to combine multiple categories of features into a single feature vector for the classification. Instead, separate classifiers can be used to classify based on each visual feature individually and the final classification can be obtained based on the combination of separate base classification results. One popular approach is to combine the classifier results into a feature vector and leaving the decision to next level classifier. This method is extended to extract a better information, possibility distribution, from the base classifiers in resolving the conflicts among the classification results. Here, we use fuzzy k Nearest Neighbor (fuzzy k-NN) as base classifier for individual feature sets, the results of which together forms the feature vector for the final k Nearest Neighbor (k-NN) classifier. Testing is done, using different features, individually and in combination, on a database containing 1600 samples of different numerals and the results are compared with the results of different existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20k%20Nearest%20Neighbor" title="Fuzzy k Nearest Neighbor">Fuzzy k Nearest Neighbor</a>, <a href="https://publications.waset.org/search?q=Multiple%20Classifiers" title=" Multiple Classifiers"> Multiple Classifiers</a>, <a href="https://publications.waset.org/search?q=Numeral%20Recognition" title="Numeral Recognition">Numeral Recognition</a>, <a href="https://publications.waset.org/search?q=Structural%20features." title=" Structural features."> Structural features.</a> </p> <a href="https://publications.waset.org/1849/multilevel-classifiers-in-recognition-of-handwritten-kannada-numerals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1849/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1849/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1849/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1849/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1849/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1849/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1849/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1849/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1849/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1849/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1849.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">1751</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">48</span> Improved C-Fuzzy Decision Tree for Intrusion Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Krishnamoorthi%20Makkithaya">Krishnamoorthi Makkithaya</a>, <a href="https://publications.waset.org/search?q=N.%20V.%20Subba%20Reddy"> N. V. Subba Reddy</a>, <a href="https://publications.waset.org/search?q=U.%20Dinesh%20Acharya"> U. Dinesh Acharya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the number of networked computers grows, intrusion detection is an essential component in keeping networks secure. Various approaches for intrusion detection are currently being in use with each one has its own merits and demerits. This paper presents our work to test and improve the performance of a new class of decision tree c-fuzzy decision tree to detect intrusion. The work also includes identifying best candidate feature sub set to build the efficient c-fuzzy decision tree based Intrusion Detection System (IDS). We investigated the usefulness of c-fuzzy decision tree for developing IDS with a data partition based on horizontal fragmentation. Empirical results indicate the usefulness of our approach in developing the efficient IDS. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20mining" title="Data mining">Data mining</a>, <a href="https://publications.waset.org/search?q=Decision%20tree" title=" Decision tree"> Decision tree</a>, <a href="https://publications.waset.org/search?q=Feature%20selection" title=" Feature selection"> Feature selection</a>, <a href="https://publications.waset.org/search?q=Fuzzyc-%20means%20clustering" title=" Fuzzyc- means clustering"> Fuzzyc- means clustering</a>, <a href="https://publications.waset.org/search?q=Intrusion%20detection." title=" Intrusion detection."> Intrusion detection.</a> </p> <a href="https://publications.waset.org/15151/improved-c-fuzzy-decision-tree-for-intrusion-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15151/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15151/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15151/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15151/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15151/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15151/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15151/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15151/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15151/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15151/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15151.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">1576</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">47</span> Delay Analysis of Sampled-Data Systems in Hard RTOS</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20M.%20Azad">A. M. Azad</a>, <a href="https://publications.waset.org/search?q=M.%20Alam"> M. Alam</a>, <a href="https://publications.waset.org/search?q=C.%20M.%20Hussain"> C. M. Hussain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have presented the effect of varying time-delays on performance and stability in the single-channel multirate sampled-data system in hard real-time (RT-Linux) environment. The sampling task require response time that might exceed the capacity of RT-Linux. So a straight implementation with RT-Linux is not feasible, because of the latency of the systems and hence, sampling period should be less to handle this task. The best sampling rate is chosen for the sampled-data system, which is the slowest rate meets all performance requirements. RT-Linux is consistent with its specifications and the resolution of the real-time is considered 0.01 seconds to achieve an efficient result. The test results of our laboratory experiment shows that the multi-rate control technique in hard real-time operating system (RTOS) can improve the stability problem caused by the random access delays and asynchronization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multi-rate" title="Multi-rate">Multi-rate</a>, <a href="https://publications.waset.org/search?q=PID" title=" PID"> PID</a>, <a href="https://publications.waset.org/search?q=RT-Linux" title=" RT-Linux"> RT-Linux</a>, <a href="https://publications.waset.org/search?q=Sampled-data" title=" Sampled-data"> Sampled-data</a>, <a href="https://publications.waset.org/search?q=Servo." title=" Servo."> Servo.</a> </p> <a href="https://publications.waset.org/3978/delay-analysis-of-sampled-data-systems-in-hard-rtos" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3978/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3978/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3978/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3978/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3978/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3978/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3978/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3978/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3978/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3978/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3978.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">1444</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">46</span> UML Modeling for Instruction Pipeline Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Vipin%20Saxena">Vipin Saxena</a>, <a href="https://publications.waset.org/search?q=Deepa%20Raj"> Deepa Raj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Unified Modeling language (UML) is one of the important modeling languages used for the visual representation of the research problem. In the present paper, UML model is designed for the Instruction pipeline which is used for the evaluation of the instructions of software programs. The class and sequence diagrams are designed & performance is evaluated for instructions of a sample program through a case study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=UML" title="UML">UML</a>, <a href="https://publications.waset.org/search?q=Instruction%20Pipeline" title=" Instruction Pipeline"> Instruction Pipeline</a>, <a href="https://publications.waset.org/search?q=Class%20Diagram%20%26Sequence%20Diagram." title=" Class Diagram &Sequence Diagram."> Class Diagram &Sequence Diagram.</a> </p> <a href="https://publications.waset.org/10208/uml-modeling-for-instruction-pipeline-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10208/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10208/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10208/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10208/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10208/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10208/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10208/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10208/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10208/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10208/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10208.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">2536</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">45</span> Effective Defect Prevention Approach in Software Process for Achieving Better Quality Levels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Suma.%20V.">Suma. V.</a>, <a href="https://publications.waset.org/search?q=T.%20R.%20Gopalakrishnan%20Nair"> T. R. Gopalakrishnan Nair</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Defect prevention is the most vital but habitually neglected facet of software quality assurance in any project. If functional at all stages of software development, it can condense the time, overheads and wherewithal entailed to engineer a high quality product. The key challenge of an IT industry is to engineer a software product with minimum post deployment defects. This effort is an analysis based on data obtained for five selected projects from leading software companies of varying software production competence. The main aim of this paper is to provide information on various methods and practices supporting defect detection and prevention leading to thriving software generation. The defect prevention technique unearths 99% of defects. Inspection is found to be an essential technique in generating ideal software generation in factories through enhanced methodologies of abetted and unaided inspection schedules. On an average 13 % to 15% of inspection and 25% - 30% of testing out of whole project effort time is required for 99% - 99.75% of defect elimination. A comparison of the end results for the five selected projects between the companies is also brought about throwing light on the possibility of a particular company to position itself with an appropriate complementary ratio of inspection testing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Defect%20Detection%20and%20Prevention" title="Defect Detection and Prevention">Defect Detection and Prevention</a>, <a href="https://publications.waset.org/search?q=Inspections" title=" Inspections"> Inspections</a>, <a href="https://publications.waset.org/search?q=Software%20Engineering" title="Software Engineering">Software Engineering</a>, <a href="https://publications.waset.org/search?q=Software%20Process" title=" Software Process"> Software Process</a>, <a href="https://publications.waset.org/search?q=Testing." title=" Testing."> Testing.</a> </p> <a href="https://publications.waset.org/15871/effective-defect-prevention-approach-in-software-process-for-achieving-better-quality-levels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15871/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15871/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15871/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15871/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15871/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15871/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15871/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15871/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15871/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15871/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15871.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">1537</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">44</span> A Middleware Transparent Framework for Applying MDA to SOA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ali%20Taee%20Zade">Ali Taee Zade</a>, <a href="https://publications.waset.org/search?q=Siamak%20Rasulzadeh"> Siamak Rasulzadeh</a>, <a href="https://publications.waset.org/search?q=Reza%20Torkashvan"> Reza Torkashvan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Although Model Driven Architecture has taken successful steps toward model-based software development, this approach still faces complex situations and ambiguous questions while applying to real world software systems. One of these questions - which has taken the most interest and focus - is how model transforms between different abstraction levels, MDA proposes. In this paper, we propose an approach based on Story Driven Modeling and Aspect Oriented Programming to ease these transformations. Service Oriented Architecture is taken as the target model to test the proposed mechanism in a functional system. Service Oriented Architecture and Model Driven Architecture [1] are both considered as the frontiers of their own domain in the software world. Following components - which was the greatest step after object oriented - SOA is introduced, focusing on more integrated and automated software solutions. On the other hand - and from the designers' point of view - MDA is just initiating another evolution. MDA is considered as the next big step after UML in designing domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=SOA" title="SOA">SOA</a>, <a href="https://publications.waset.org/search?q=MDA" title=" MDA"> MDA</a>, <a href="https://publications.waset.org/search?q=SDM" title=" SDM"> SDM</a>, <a href="https://publications.waset.org/search?q=Model%20Transformation" title=" Model Transformation"> Model Transformation</a>, <a href="https://publications.waset.org/search?q=Middleware%20Transparency" title="Middleware Transparency">Middleware Transparency</a>, <a href="https://publications.waset.org/search?q=Aspects%20and%20Jini." title=" Aspects and Jini."> Aspects and Jini.</a> </p> <a href="https://publications.waset.org/4179/a-middleware-transparent-framework-for-applying-mda-to-soa" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4179/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4179/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4179/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4179/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4179/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4179/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4179/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4179/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4179/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4179/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4179.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">1509</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">43</span> Formal Modeling and Verification of Software Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Siamak%20Rasulzadeh">Siamak Rasulzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph transformation has recently become more and more popular as a general visual modeling language to formally state the dynamic semantics of the designed models. Especially, it is a very natural formalism for languages which basically are graph (e.g. UML). Using this technique, we present a highly understandable yet precise approach to formally model and analyze the behavioral semantics of UML 2.0 Activity diagrams. In our proposal, AGG is used to design Activities, then using our previous approach to model checking graph transformation systems, designers can verify and analyze designed Activity diagrams by checking the interesting properties as combination of graph rules and LTL (Linear Temporal Logic) formulas on the Activities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=UML%202.0%20Activity" title="UML 2.0 Activity">UML 2.0 Activity</a>, <a href="https://publications.waset.org/search?q=Verification" title=" Verification"> Verification</a>, <a href="https://publications.waset.org/search?q=Model%20Checking" title=" Model Checking"> Model Checking</a>, <a href="https://publications.waset.org/search?q=Graph%20Transformation" title="Graph Transformation">Graph Transformation</a>, <a href="https://publications.waset.org/search?q=Dynamic%20Semantics." title=" Dynamic Semantics."> Dynamic Semantics.</a> </p> <a href="https://publications.waset.org/14252/formal-modeling-and-verification-of-software-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14252/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14252/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14252/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14252/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14252/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14252/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14252/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14252/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14252/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14252/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14252.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">1445</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">42</span> ReSeT : Reverse Engineering System Requirements Tool</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rosziati%20Ibrahim">Rosziati Ibrahim</a>, <a href="https://publications.waset.org/search?q=Tiu%20Kian%20Yong"> Tiu Kian Yong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reverse Engineering is a very important process in Software Engineering. It can be performed backwards from system development life cycle (SDLC) in order to get back the source data or representations of a system through analysis of its structure, function and operation. We use reverse engineering to introduce an automatic tool to generate system requirements from its program source codes. The tool is able to accept the Cµ programming source codes, scan the source codes line by line and parse the codes to parser. Then, the engine of the tool will be able to generate system requirements for that specific program to facilitate reuse and enhancement of the program. The purpose of producing the tool is to help recovering the system requirements of any system when the system requirements document (SRD) does not exist due to undocumented support of the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=System%20Requirements" title="System Requirements">System Requirements</a>, <a href="https://publications.waset.org/search?q=Reverse%20Engineering" title=" Reverse Engineering"> Reverse Engineering</a>, <a href="https://publications.waset.org/search?q=SourceCodes." title=" SourceCodes."> SourceCodes.</a> </p> <a href="https://publications.waset.org/9558/reset-reverse-engineering-system-requirements-tool" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9558/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9558/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9558/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9558/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9558/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9558/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9558/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9558/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9558/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9558/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9558.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">1674</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">41</span> A Classification Scheme for Game Input and Output</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.%20Prema">P. Prema</a>, <a href="https://publications.waset.org/search?q=B.%20Ramadoss"> B. Ramadoss</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computer game industry has experienced exponential growth in recent years. A game is a recreational activity involving one or more players. Game input is information such as data, commands, etc., which is passed to the game system at run time from an external source. Conversely, game outputs are information which are generated by the game system and passed to an external target, but which is not used internally by the game. This paper identifies a new classification scheme for game input and output, which is based on player-s input and output. Using this, relationship table for game input classifier and output classifier is developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Game%20Classification" title="Game Classification">Game Classification</a>, <a href="https://publications.waset.org/search?q=Game%20Input" title=" Game Input"> Game Input</a>, <a href="https://publications.waset.org/search?q=Game%20Output" title=" Game Output"> Game Output</a>, <a href="https://publications.waset.org/search?q=Game%20Testing." title="Game Testing.">Game Testing.</a> </p> <a href="https://publications.waset.org/9892/a-classification-scheme-for-game-input-and-output" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9892/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9892/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9892/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9892/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9892/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9892/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9892/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9892/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9892/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9892/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9892.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">1983</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">40</span> A New Type of Integration Error and its Influence on Integration Testing Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.%20Prema">P. Prema</a>, <a href="https://publications.waset.org/search?q=B.%20Ramadoss"> B. Ramadoss</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Testing is an activity that is required both in the development and maintenance of the software development life cycle in which Integration Testing is an important activity. Integration testing is based on the specification and functionality of the software and thus could be called black-box testing technique. The purpose of integration testing is testing integration between software components. In function or system testing, the concern is with overall behavior and whether the software meets its functional specifications or performance characteristics or how well the software and hardware work together. This explains the importance and necessity of IT for which the emphasis is on interactions between modules and their interfaces. Software errors should be discovered early during IT to reduce the costs of correction. This paper introduces a new type of integration error, presenting an overview of Integration Testing techniques with comparison of each technique and also identifying which technique detects what type of error. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Integration%20Error" title="Integration Error">Integration Error</a>, <a href="https://publications.waset.org/search?q=Integration%20Error%20Types" title=" Integration Error Types"> Integration Error Types</a>, <a href="https://publications.waset.org/search?q=Integration%20Testing%20Techniques" title="Integration Testing Techniques">Integration Testing Techniques</a>, <a href="https://publications.waset.org/search?q=Software%20Testing" title=" Software Testing"> Software Testing</a> </p> <a href="https://publications.waset.org/8525/a-new-type-of-integration-error-and-its-influence-on-integration-testing-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8525/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8525/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8525/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8525/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8525/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8525/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8525/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8525/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8525/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8525/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8525.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">2217</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">39</span> A Case Study to Assess the Validity of Function Points</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Neelam%20Bawane%20nee%27%20Singhal">Neelam Bawane nee' Singhal</a>, <a href="https://publications.waset.org/search?q=C.%20V.%20Srikrishna"> C. V. Srikrishna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many metrics were proposed to evaluate the characteristics of the analysis and design model of a given product which in turn help to assess the quality of the product. Function point metric is a measure of the 'functionality' delivery by the software. This paper presents an analysis of a set of programs of a project developed in Cµ through Function Points metric. Function points are measured for a Data Flow Diagram (DFD) of the case developed at initial stage. Lines of Codes (LOCs) and possible errors are calculated with the help of measured Function Points (FPs). The calculations are performed using suitable established functions. Calculated LOCs and errors are compared with actual LOCs and errors found at the time of analysis & design review, implementation and testing. It has been observed that actual found errors are more than calculated errors. On the basis of analysis and observations, authors conclude that function point provides useful insight and helps to analyze the drawbacks in the development process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Function%20Points" title="Function Points">Function Points</a>, <a href="https://publications.waset.org/search?q=Data%20Flow%20Diagram" title=" Data Flow Diagram"> Data Flow Diagram</a>, <a href="https://publications.waset.org/search?q=Lines%20ofCodes." title=" Lines ofCodes."> Lines ofCodes.</a> </p> <a href="https://publications.waset.org/1072/a-case-study-to-assess-the-validity-of-function-points" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1072/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1072/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1072/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1072/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1072/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1072/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1072/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1072/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1072/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1072/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1072.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">3672</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">38</span> Pushing the Limits of Address Based Authentication: How to Avoid MAC Address Spoofing in Wireless LANs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kemal%20Bicakci">Kemal Bicakci</a>, <a href="https://publications.waset.org/search?q=Yusuf%20Uzunay"> Yusuf Uzunay</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is well-known that in wireless local area networks, authenticating nodes by their MAC addresses is not secure since it is very easy for an attacker to learn one of the authorized addresses and change his MAC address accordingly. In this paper, in order to prevent MAC address spoofing attacks, we propose to use dynamically changing MAC addresses and make each address usable for only one session. The scheme we propose does not require any change in 802.11 protocols and incurs only a small performance overhead. One of the nice features of our new scheme is that no third party can link different communication sessions of the same user by monitoring MAC addresses therefore our scheme is preferable also with respect to user privacy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Authentication" title="Authentication">Authentication</a>, <a href="https://publications.waset.org/search?q=MAC%20address%20spoofing" title=" MAC address spoofing"> MAC address spoofing</a>, <a href="https://publications.waset.org/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/search?q=wireless%20networks." title="wireless networks.">wireless networks.</a> </p> <a href="https://publications.waset.org/15752/pushing-the-limits-of-address-based-authentication-how-to-avoid-mac-address-spoofing-in-wireless-lans" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15752/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15752/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15752/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15752/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15752/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15752/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15752/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15752/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15752/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15752/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15752.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">2577</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">37</span> Application of Artificial Neural Network to Forecast Actual Cost of a Project to Improve Earned Value Management System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Seyed%20Hossein%20Iranmanesh">Seyed Hossein Iranmanesh</a>, <a href="https://publications.waset.org/search?q=Mansoureh%20Zarezadeh"> Mansoureh Zarezadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents an application of Artificial Neural Network (ANN) to forecast actual cost of a project based on the earned value management system (EVMS). For this purpose, some projects randomly selected based on the standard data set , and it is produced necessary progress data such as actual cost ,actual percent complete , baseline cost and percent complete for five periods of project. Then an ANN with five inputs and five outputs and one hidden layer is trained to produce forecasted actual costs. The comparison between real and forecasted data show better performance based on the Mean Absolute Percentage Error (MAPE) criterion. This approach could be applicable to better forecasting the project cost and result in decreasing the risk of project cost overrun, and therefore it is beneficial for planning preventive actions.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Earned%20Value%20Management%20System%20%28EVMS%29" title="Earned Value Management System (EVMS)">Earned Value Management System (EVMS)</a>, <a href="https://publications.waset.org/search?q=Artificial%20Neural%20Network%20%28ANN%29" title="Artificial Neural Network (ANN)">Artificial Neural Network (ANN)</a>, <a href="https://publications.waset.org/search?q=Estimate%20At%20Completion" title=" Estimate At Completion"> Estimate At Completion</a>, <a href="https://publications.waset.org/search?q=Forecasting%20Methods" title="Forecasting Methods">Forecasting Methods</a>, <a href="https://publications.waset.org/search?q=Project%20Performance%20Measurement." title=" Project Performance Measurement."> Project Performance Measurement.</a> </p> <a href="https://publications.waset.org/13246/application-of-artificial-neural-network-to-forecast-actual-cost-of-a-project-to-improve-earned-value-management-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13246/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13246/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13246/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13246/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13246/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13246/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13246/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13246/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13246/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13246/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13246.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">2767</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">36</span> Application of Data Mining Tools to Predicate Completion Time of a Project</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Seyed%20Hossein%20Iranmanesh">Seyed Hossein Iranmanesh</a>, <a href="https://publications.waset.org/search?q=Zahra%20Mokhtari"> Zahra Mokhtari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Estimation time and cost of work completion in a project and follow up them during execution are contributors to success or fail of a project, and is very important for project management team. Delivering on time and within budgeted cost needs to well managing and controlling the projects. To dealing with complex task of controlling and modifying the baseline project schedule during execution, earned value management systems have been set up and widely used to measure and communicate the real physical progress of a project. But it often fails to predict the total duration of the project. In this paper data mining techniques is used predicting the total project duration in term of Time Estimate At Completion-EAC (t). For this purpose, we have used a project with 90 activities, it has updated day by day. Then, it is used regular indexes in literature and applied Earned Duration Method to calculate time estimate at completion and set these as input data for prediction and specifying the major parameters among them using Clem software. By using data mining, the effective parameters on EAC and the relationship between them could be extracted and it is very useful to manage a project with minimum delay risks. As we state, this could be a simple, safe and applicable method in prediction the completion time of a project during execution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20Mining%20Techniques" title="Data Mining Techniques">Data Mining Techniques</a>, <a href="https://publications.waset.org/search?q=Earned%20Duration%20Method" title=" Earned Duration Method"> Earned Duration Method</a>, <a href="https://publications.waset.org/search?q=Earned%20Value" title="Earned Value">Earned Value</a>, <a href="https://publications.waset.org/search?q=Estimate%20At%20Completion." title=" Estimate At Completion."> Estimate At Completion.</a> </p> <a href="https://publications.waset.org/2412/application-of-data-mining-tools-to-predicate-completion-time-of-a-project" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2412/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2412/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2412/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2412/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2412/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2412/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2412/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2412/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2412/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2412/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2412.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">1803</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">35</span> P-ACO Approach to Assignment Problem in FMSs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.%20Mahdavi">I. Mahdavi</a>, <a href="https://publications.waset.org/search?q=A.%20Jazayeri"> A. Jazayeri</a>, <a href="https://publications.waset.org/search?q=M.%20Jahromi"> M. Jahromi</a>, <a href="https://publications.waset.org/search?q=R.%20Jafari"> R. Jafari</a>, <a href="https://publications.waset.org/search?q=H.%20Iranmanesh"> H. Iranmanesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>One of the most important problems in production planning of flexible manufacturing system (FMS) is machine tool selection and operation allocation problem that directly influences the production costs and times .In this paper minimizing machining cost, set-up cost and material handling cost as a multi-objective problem in flexible manufacturing systems environment are considered. We present a 0-1 integer linear programming model for the multiobjective machine tool selection and operation allocation problem and due to the large scale nature of the problem, solving the problem to obtain optimal solution in a reasonable time is infeasible, Paretoant colony optimization (P-ACO) approach for solving the multiobjective problem in reasonable time is developed. Experimental results indicate effectiveness of the proposed algorithm for solving the problem.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Flexible%20manufacturing%20system" title="Flexible manufacturing system">Flexible manufacturing system</a>, <a href="https://publications.waset.org/search?q=Production%20planning" title=" Production planning"> Production planning</a>, <a href="https://publications.waset.org/search?q=Machine%20tool%20selection" title=" Machine tool selection"> Machine tool selection</a>, <a href="https://publications.waset.org/search?q=Operation%20allocation" title=" Operation allocation"> Operation allocation</a>, <a href="https://publications.waset.org/search?q=Multiobjective%20optimization" title=" Multiobjective optimization"> Multiobjective optimization</a>, <a href="https://publications.waset.org/search?q=Metaheuristic." title=" Metaheuristic."> Metaheuristic.</a> </p> <a href="https://publications.waset.org/14341/p-aco-approach-to-assignment-problem-in-fmss" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14341/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14341/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14341/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14341/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14341/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14341/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14341/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14341/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14341/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14341/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14341.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">1907</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">34</span> Separation of Vitamin B2 and B12 byImpregnate HPTLC Plates with Boric Acid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Homayon%20Ahmad%20Panahi">Homayon Ahmad Panahi</a>, <a href="https://publications.waset.org/search?q=Hossein%20Sid%20Kalal"> Hossein Sid Kalal</a>, <a href="https://publications.waset.org/search?q=Atyeh%20Rahimi"> Atyeh Rahimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A high performance thin layer chromatography system (HPTLC) for the separation of vitamin B2 and B12 has been developed. The separation was successfully using a solvent system of methanol, water, ammonia 7.3.1 (V/V) as mobile phase on HPTLC plates impregnated with boric acid. The effect of other mobile phases on the separation of vitamins was also examined. The method is based on different behavior of investigated compounds in impregnated TLC plates with different amount of boric acid. The Rf values of vitamin B2 and B12 are considered on non impregnated and impregnated silica gel HPTLC plate with boric acid. The effect of boric acid in the mobile phase and on HPTLC plates on the RF values of the vitamins has also been studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=High%20performance%20thin%20layer%20chromatography" title="High performance thin layer chromatography">High performance thin layer chromatography</a>, <a href="https://publications.waset.org/search?q=HPTLC" title="HPTLC">HPTLC</a>, <a href="https://publications.waset.org/search?q=Vitamin%20B2" title=" Vitamin B2"> Vitamin B2</a>, <a href="https://publications.waset.org/search?q=Vitamin%20B12" title=" Vitamin B12"> Vitamin B12</a>, <a href="https://publications.waset.org/search?q=Separation." title=" Separation."> Separation.</a> </p> <a href="https://publications.waset.org/6116/separation-of-vitamin-b2-and-b12-byimpregnate-hptlc-plates-with-boric-acid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6116/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6116/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6116/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6116/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6116/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6116/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6116/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6116/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6116/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6116/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6116.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">2201</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">33</span> Effect of Boric Acid on a-Hydroxy Acids Compounds in Thin Layer Chromatography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Elham%20Moniri">Elham Moniri</a>, <a href="https://publications.waset.org/search?q=Homayon%20Ahmad%20Panahi"> Homayon Ahmad Panahi</a>, <a href="https://publications.waset.org/search?q=Ahmad%20Izadi"> Ahmad Izadi</a>, <a href="https://publications.waset.org/search?q=Mohamad%20Mehdi%20Parvin"> Mohamad Mehdi Parvin</a>, <a href="https://publications.waset.org/search?q=Atyeh%20Rahimi"> Atyeh Rahimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this investigation Salicylic acid, Sulfosalicylic acid and Acetyl salicylic acid were chosen as a sample for thin layer chromatography (TLC) on silica gel plates. Bicarbonate buffer at different pH containing different amounts of boric acid was applied as mobile phase. Specific interaction of these substances with boric acid has effect on Rf in thin layer chromatography. Regular and similar trend was observed in variations of Rf for mentioned compounds in TLC by altering of percentages of boric acid in mobile phase in pH range of 8-10. Also effect of organic solvent, mixture of water/ organic solvent and organic solvent containing boric acid as mobile phase was studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Thin%20layer%20chromatography%20%28TLC%29" title="Thin layer chromatography (TLC)">Thin layer chromatography (TLC)</a>, <a href="https://publications.waset.org/search?q=Aspirin" title=" Aspirin"> Aspirin</a>, <a href="https://publications.waset.org/search?q=Salicylic%20acid" title="Salicylic acid">Salicylic acid</a>, <a href="https://publications.waset.org/search?q=Sulfosalycylic%20acid" title=" Sulfosalycylic acid"> Sulfosalycylic acid</a>, <a href="https://publications.waset.org/search?q=Boric%20acid." title=" Boric acid."> Boric acid.</a> </p> <a href="https://publications.waset.org/524/effect-of-boric-acid-on-a-hydroxy-acids-compounds-in-thin-layer-chromatography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/524/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/524/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/524/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/524/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/524/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/524/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/524/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/524/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/524/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/524/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/524.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">2326</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">32</span> A Novel EMG Feedback Control Method in Functional Electrical Stimulation Cycling System for Stroke Patients</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chien-Chih%20Chen">Chien-Chih Chen</a>, <a href="https://publications.waset.org/search?q=Ya-Hsin%20Hsueh"> Ya-Hsin Hsueh</a>, <a href="https://publications.waset.org/search?q=Zong-Cian%20He"> Zong-Cian He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With getting older in the whole population, the prevalence of stroke and its residual disability is getting higher and higher recently in Taiwan. The functional electrical stimulation cycling system (FESCS) is useful for hemiplegic patients. Because that the muscle of stroke patients is under hybrid activation. The raw electromyography (EMG) represents the residual muscle force of stroke subject whereas the peak-to-peak of stimulus EMG indicates the force enhancement benefiting from ES. It seems that EMG signals could be used for a parameter of feedback control mechanism. So, we design the feedback control protocol of FESCS, it includes physiological signal recorder, FPGA biomedical module, DAC and electrical stimulation circuit. Using the intensity of real-time EMG signal obtained from patients, as a feedback control method for the output voltage of FES-cycling system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Functional%20Electrical%20Stimulation%20cycling%20system%20EMG" title="Functional Electrical Stimulation cycling system EMG">Functional Electrical Stimulation cycling system EMG</a>, <a href="https://publications.waset.org/search?q=control%20protocol." title=" control protocol."> control protocol.</a> </p> <a href="https://publications.waset.org/1013/a-novel-emg-feedback-control-method-in-functional-electrical-stimulation-cycling-system-for-stroke-patients" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1013/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1013/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1013/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1013/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1013/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1013/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1013/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1013/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1013/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1013/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1013.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">2115</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">31</span> MRI Reconstruction Using Discrete Fourier Transform: A tutorial</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abiodun%20M.%20Aibinu">Abiodun M. Aibinu</a>, <a href="https://publications.waset.org/search?q=Momoh%20J.%20E.%20Salami"> Momoh J. E. Salami</a>, <a href="https://publications.waset.org/search?q=Amir%20A.%20Shafie"> Amir A. Shafie</a>, <a href="https://publications.waset.org/search?q=Athaur%20Rahman%20Najeeb"> Athaur Rahman Najeeb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The use of Inverse Discrete Fourier Transform (IDFT) implemented in the form of Inverse Fourier Transform (IFFT) is one of the standard method of reconstructing Magnetic Resonance Imaging (MRI) from uniformly sampled K-space data. In this tutorial, three of the major problems associated with the use of IFFT in MRI reconstruction are highlighted. The tutorial also gives brief introduction to MRI physics; MRI system from instrumentation point of view; K-space signal and the process of IDFT and IFFT for One and two dimensional (1D and 2D) data.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Discrete%20Fourier%20Transform%20%28DFT%29" title="Discrete Fourier Transform (DFT)">Discrete Fourier Transform (DFT)</a>, <a href="https://publications.waset.org/search?q=K-space%20Data" title=" K-space Data"> K-space Data</a>, <a href="https://publications.waset.org/search?q=Magnetic%20Resonance%20%28MR%29" title="Magnetic Resonance (MR)">Magnetic Resonance (MR)</a>, <a href="https://publications.waset.org/search?q=Spin" title=" Spin"> Spin</a>, <a href="https://publications.waset.org/search?q=Windows." title=" Windows."> Windows.</a> </p> <a href="https://publications.waset.org/13757/mri-reconstruction-using-discrete-fourier-transform-a-tutorial" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13757/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13757/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13757/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13757/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13757/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13757/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13757/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13757/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13757/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13757/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13757.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">5111</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">30</span> Comparing Autoregressive Moving Average (ARMA) Coefficients Determination using Artificial Neural Networks with Other Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abiodun%20M.%20Aibinu">Abiodun M. Aibinu</a>, <a href="https://publications.waset.org/search?q=Momoh%20J.%20E.%20Salami"> Momoh J. E. Salami</a>, <a href="https://publications.waset.org/search?q=Amir%20A.%20Shafie"> Amir A. Shafie</a>, <a href="https://publications.waset.org/search?q=Athaur%20Rahman%20Najeeb"> Athaur Rahman Najeeb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Autoregressive Moving average (ARMA) is a parametric based method of signal representation. It is suitable for problems in which the signal can be modeled by explicit known source functions with a few adjustable parameters. Various methods have been suggested for the coefficients determination among which are Prony, Pade, Autocorrelation, Covariance and most recently, the use of Artificial Neural Network technique. In this paper, the method of using Artificial Neural network (ANN) technique is compared with some known and widely acceptable techniques. The comparisons is entirely based on the value of the coefficients obtained. Result obtained shows that the use of ANN also gives accurate in computing the coefficients of an ARMA system.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Autoregressive%20moving%20average" title="Autoregressive moving average">Autoregressive moving average</a>, <a href="https://publications.waset.org/search?q=coefficients" title=" coefficients"> coefficients</a>, <a href="https://publications.waset.org/search?q=back%20propagation" title=" back propagation"> back propagation</a>, <a href="https://publications.waset.org/search?q=model%20parameters" title=" model parameters"> model parameters</a>, <a href="https://publications.waset.org/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/search?q=weight." title=" weight."> weight.</a> </p> <a href="https://publications.waset.org/1467/comparing-autoregressive-moving-average-arma-coefficients-determination-using-artificial-neural-networks-with-other-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1467/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1467/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1467/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1467/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1467/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1467/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1467/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1467/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1467/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1467/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1467.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">2290</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">29</span> Increasing The Speed of Convergence of an Artificial Neural Network based ARMA Coefficients Determination Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abiodun%20M.%20Aibinu">Abiodun M. Aibinu</a>, <a href="https://publications.waset.org/search?q=Momoh%20J.%20E.%20Salami"> Momoh J. E. Salami</a>, <a href="https://publications.waset.org/search?q=Amir%20A.%20Shafie"> Amir A. Shafie</a>, <a href="https://publications.waset.org/search?q=Athaur%20Rahman%20Najeeb"> Athaur Rahman Najeeb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, novel techniques in increasing the accuracy and speed of convergence of a Feed forward Back propagation Artificial Neural Network (FFBPNN) with polynomial activation function reported in literature is presented. These technique was subsequently used to determine the coefficients of Autoregressive Moving Average (ARMA) and Autoregressive (AR) system. The results obtained by introducing sequential and batch method of weight initialization, batch method of weight and coefficient update, adaptive momentum and learning rate technique gives more accurate result and significant reduction in convergence time when compared t the traditional method of back propagation algorithm, thereby making FFBPNN an appropriate technique for online ARMA coefficient determination. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20Learning%20rate" title="Adaptive Learning rate">Adaptive Learning rate</a>, <a href="https://publications.waset.org/search?q=Adaptive%20momentum" title=" Adaptive momentum"> Adaptive momentum</a>, <a href="https://publications.waset.org/search?q=Autoregressive" title=" Autoregressive"> Autoregressive</a>, <a href="https://publications.waset.org/search?q=Modeling" title="Modeling">Modeling</a>, <a href="https://publications.waset.org/search?q=Neural%20Network." title=" Neural Network."> Neural Network.</a> </p> <a href="https://publications.waset.org/3015/increasing-the-speed-of-convergence-of-an-artificial-neural-network-based-arma-coefficients-determination-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3015/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3015/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3015/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3015/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3015/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3015/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3015/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3015/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3015/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3015/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3015.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">1498</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">28</span> Optimal Model Order Selection for Transient Error Autoregressive Moving Average (TERA) MRI Reconstruction Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abiodun%20M.%20Aibinu">Abiodun M. Aibinu</a>, <a href="https://publications.waset.org/search?q=Athaur%20Rahman%20Najeeb"> Athaur Rahman Najeeb</a>, <a href="https://publications.waset.org/search?q=Momoh%20J.%20E.%20Salami"> Momoh J. E. Salami</a>, <a href="https://publications.waset.org/search?q=Amir%20A.%20Shafie"> Amir A. Shafie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An alternative approach to the use of Discrete Fourier Transform (DFT) for Magnetic Resonance Imaging (MRI) reconstruction is the use of parametric modeling technique. This method is suitable for problems in which the image can be modeled by explicit known source functions with a few adjustable parameters. Despite the success reported in the use of modeling technique as an alternative MRI reconstruction technique, two important problems constitutes challenges to the applicability of this method, these are estimation of Model order and model coefficient determination. In this paper, five of the suggested method of evaluating the model order have been evaluated, these are: The Final Prediction Error (FPE), Akaike Information Criterion (AIC), Residual Variance (RV), Minimum Description Length (MDL) and Hannan and Quinn (HNQ) criterion. These criteria were evaluated on MRI data sets based on the method of Transient Error Reconstruction Algorithm (TERA). The result for each criterion is compared to result obtained by the use of a fixed order technique and three measures of similarity were evaluated. Result obtained shows that the use of MDL gives the highest measure of similarity to that use by a fixed order technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Autoregressive%20Moving%20Average%20%28ARMA%29" title="Autoregressive Moving Average (ARMA)">Autoregressive Moving Average (ARMA)</a>, <a href="https://publications.waset.org/search?q=MagneticResonance%20Imaging%20%28MRI%29" title=" MagneticResonance Imaging (MRI)"> MagneticResonance Imaging (MRI)</a>, <a href="https://publications.waset.org/search?q=Parametric%20modeling" title=" Parametric modeling"> Parametric modeling</a>, <a href="https://publications.waset.org/search?q=Transient%20Error." title=" Transient Error."> Transient Error.</a> </p> <a href="https://publications.waset.org/10711/optimal-model-order-selection-for-transient-error-autoregressive-moving-average-tera-mri-reconstruction-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10711/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10711/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10711/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10711/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10711/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10711/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10711/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10711/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10711/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10711/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10711.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">1615</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27</span> A Strategy to Optimize the SPC Scheme for Mass Production of HDD Arm with ClusteringTechnique and Three-Way Control Chart</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=W.%20Chattinnawat">W. Chattinnawat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Consider a mass production of HDD arms where hundreds of CNC machines are used to manufacturer the HDD arms. According to an overwhelming number of machines and models of arm, construction of separate control chart for monitoring each HDD arm model by each machine is not feasible. This research proposed a strategy to optimize the SPC management on shop floor. The procedure started from identifying the clusters of the machine with similar manufacturing performance using clustering technique. The three way control chart ( I - MR - R ) is then applied to each clustered group of machine. This proposed research has advantageous to the manufacturer in terms of not only better performance of the SPC but also the quality management paradigm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Three%20way%20control%20chart.%20I%20-%20MR%20-%20R" title="Three way control chart. I - MR - R ">Three way control chart. I - MR - R </a>, <a href="https://publications.waset.org/search?q=between%2Fwithin%20variation" title="between/within variation">between/within variation</a>, <a href="https://publications.waset.org/search?q=HDD%20arm." title=" HDD arm."> HDD arm.</a> </p> <a href="https://publications.waset.org/14991/a-strategy-to-optimize-the-spc-scheme-for-mass-production-of-hdd-arm-with-clusteringtechnique-and-three-way-control-chart" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14991/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14991/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14991/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14991/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14991/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14991/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14991/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14991/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14991/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14991/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14991.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">1635</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26</span> Modeling Concave Globoidal Cam with Swinging Roller Follower : A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nguyen%20Van%20Tuong">Nguyen Van Tuong</a>, <a href="https://publications.waset.org/search?q=Premysl%20Pokorny"> Premysl Pokorny</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a computer-aided design for design of the concave globoidal cam with cylindrical rollers and swinging follower. Four models with different modeling methods are made from the same input data. The input data are angular input and output displacements of the cam and the follower and some other geometrical parameters of the globoidal cam mechanism. The best cam model is the cam which has no interference with the rollers when their motions are simulated in assembly conditions. The angular output displacement of the follower for the best cam is also compared with that of in the input data to check errors. In this study, Pro/ENGINEER® Wildfire 2.0 is used for modeling the cam, simulating motions and checking interference and errors of the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Globoidal%20cam" title="Globoidal cam">Globoidal cam</a>, <a href="https://publications.waset.org/search?q=sweep" title=" sweep"> sweep</a>, <a href="https://publications.waset.org/search?q=pitch%20surface" title=" pitch surface"> pitch surface</a>, <a href="https://publications.waset.org/search?q=modeling." title=" modeling."> modeling.</a> </p> <a href="https://publications.waset.org/6975/modeling-concave-globoidal-cam-with-swinging-roller-follower-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6975/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6975/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6975/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6975/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6975/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6975/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6975/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6975/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6975/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6975/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6975.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">3666</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">25</span> Optimized Delay Constrained QoS Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.%20S.%20Prakash">P. S. Prakash</a>, <a href="https://publications.waset.org/search?q=S.%20Selvan"> S. Selvan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP-hard or complete and some algorithms have been proposed to find a near optimal solution. But these heuristics or algorithms either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we concentrate an algorithm that finds a near-optimal solution fast and we named this algorithm as optimized Delay Constrained Routing (ODCR), which uses an adaptive path weight function together with an additional constraint imposed on the path cost, to restrict search space and hence ODCR finds near optimal solution in much quicker time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=QoS" title="QoS">QoS</a>, <a href="https://publications.waset.org/search?q=Delay" title=" Delay"> Delay</a>, <a href="https://publications.waset.org/search?q=Routing" title=" Routing"> Routing</a>, <a href="https://publications.waset.org/search?q=Optimization." title=" Optimization."> Optimization.</a> </p> <a href="https://publications.waset.org/10441/optimized-delay-constrained-qos-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10441/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10441/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10441/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10441/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10441/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10441/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10441/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10441/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10441/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10441/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10441.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">1213</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">24</span> E-government Adoption in Romania</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sofia%20Elena%20Colesca">Sofia Elena Colesca</a>, <a href="https://publications.waset.org/search?q=Dobrica%20Liliana"> Dobrica Liliana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Romanian government has been making significant attempts to make its services and information available on the Internet. According to the UN e-government survey conducted in 2008, Romania comes under mid range countries by utilization of egovernment (percent of utilization 41%). Romania-s national portal www.e-guvernare.ro aims at progressively making all services and information accessible through the portal. However, the success of these efforts depends, to a great extent, on how well the targeted users for such services, citizens in general, make use of them. For this reason, the purpose of the presented study was to identify what factors could affect the citizens' adoption of e-government services. The study is an extension of the Technology Acceptance Model. The proposed model was validated using data collected from 481 citizens. The results provided substantial support for all proposed hypotheses and showed the significance of the extended constructs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=e-government" title="e-government">e-government</a>, <a href="https://publications.waset.org/search?q=citizen%27s%20adoption" title=" citizen's adoption"> citizen's adoption</a>, <a href="https://publications.waset.org/search?q=TechnologyAcceptance%20model." title=" TechnologyAcceptance model."> TechnologyAcceptance model.</a> </p> <a href="https://publications.waset.org/15361/e-government-adoption-in-romania" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15361/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15361/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15361/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15361/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15361/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15361/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15361/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15361/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15361/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15361/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15361.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">2433</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">23</span> Information Retrieval in Domain Specific Search Engine with Machine Learning Approaches</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shilpy%20Sharma">Shilpy Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the web continues to grow exponentially, the idea of crawling the entire web on a regular basis becomes less and less feasible, so the need to include information on specific domain, domain-specific search engines was proposed. As more information becomes available on the World Wide Web, it becomes more difficult to provide effective search tools for information access. Today, people access web information through two main kinds of search interfaces: Browsers (clicking and following hyperlinks) and Query Engines (queries in the form of a set of keywords showing the topic of interest) [2]. Better support is needed for expressing one's information need and returning high quality search results by web search tools. There appears to be a need for systems that do reasoning under uncertainty and are flexible enough to recover from the contradictions, inconsistencies, and irregularities that such reasoning involves. In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view algorithms, which reduce the amount of labeled data required for learning, rely on the assumptions that the views are compatible and uncorrelated. This paper describes the use of semi-structured machine learning approach with Active learning for the “Domain Specific Search Engines". A domain-specific search engine is “An information access system that allows access to all the information on the web that is relevant to a particular domain. The proposed work shows that with the help of this approach relevant data can be extracted with the minimum queries fired by the user. It requires small number of labeled data and pool of unlabelled data on which the learning algorithm is applied to extract the required data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Search%20engines%3B%20machine%20learning" title="Search engines; machine learning">Search engines; machine learning</a>, <a href="https://publications.waset.org/search?q=Informationretrieval" title=" Informationretrieval"> Informationretrieval</a>, <a href="https://publications.waset.org/search?q=Active%20logic." title=" Active logic."> Active logic.</a> </p> <a href="https://publications.waset.org/10075/information-retrieval-in-domain-specific-search-engine-with-machine-learning-approaches" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10075/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10075/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10075/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10075/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10075/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10075/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10075/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10075/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10075/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10075/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10075.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">2083</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">22</span> Real-time Laser Monitoring based on Pipe Detective Operation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mongkorn%20Klingajay">Mongkorn Klingajay</a>, <a href="https://publications.waset.org/search?q=Tawatchai%20Jitson"> Tawatchai Jitson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The pipe inspection operation is the difficult detective performance. Almost applications are mainly relies on a manual recognition of defective areas that have carried out detection by an engineer. Therefore, an automation process task becomes a necessary in order to avoid the cost incurred in such a manual process. An automated monitoring method to obtain a complete picture of the sewer condition is proposed in this work. The focus of the research is the automated identification and classification of discontinuities in the internal surface of the pipe. The methodology consists of several processing stages including image segmentation into the potential defect regions and geometrical characteristic features. Automatic recognition and classification of pipe defects are carried out by means of using an artificial neural network technique (ANN) based on Radial Basic Function (RBF). Experiments in a realistic environment have been conducted and results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20neural%20network" title="Artificial neural network">Artificial neural network</a>, <a href="https://publications.waset.org/search?q=Radial%20basic%20function" title=" Radial basic function"> Radial basic function</a>, <a href="https://publications.waset.org/search?q=Curve%20fitting" title="Curve fitting">Curve fitting</a>, <a href="https://publications.waset.org/search?q=CCTV" title=" CCTV"> CCTV</a>, <a href="https://publications.waset.org/search?q=Image%20segmentation" title=" Image segmentation"> Image segmentation</a>, <a href="https://publications.waset.org/search?q=Data%20acquisition." title=" Data acquisition."> Data acquisition.</a> </p> <a href="https://publications.waset.org/6436/real-time-laser-monitoring-based-on-pipe-detective-operation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6436/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6436/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6436/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6436/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6436/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6436/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6436/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6436/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6436/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6436/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6436.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">1819</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">21</span> Real E-Government, Real Convenience</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Kargar">M. Kargar</a>, <a href="https://publications.waset.org/search?q=F.Fartash"> F.Fartash</a>, <a href="https://publications.waset.org/search?q=T.%20Saderi"> T. Saderi</a>, <a href="https://publications.waset.org/search?q=M.%20Abdar-e%20Bakhshayesh"> M. Abdar-e Bakhshayesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we have suggested a new system for egovernment. In this method a government can design a precise and perfect system to control people and organizations by using five major documents. These documents contain the important information of each member of a society and help all organizations to do their informatics tasks through them. This information would be available by only a national code and a secure program would support it. The suggested system can give a good awareness to the society and help it be managed correctly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=E-Government" title="E-Government">E-Government</a>, <a href="https://publications.waset.org/search?q=Internet" title=" Internet"> Internet</a>, <a href="https://publications.waset.org/search?q=Web-Based%20System" title=" Web-Based System"> Web-Based System</a>, <a href="https://publications.waset.org/search?q=Society." title="Society.">Society.</a> </p> <a href="https://publications.waset.org/14031/real-e-government-real-convenience" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14031/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14031/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14031/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14031/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14031/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14031/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14031/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14031/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14031/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14031/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14031.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">1505</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20</span> A Four Architectures to Locate Mobile Users using Statistical Mapping of WLANs in Indoorand Outdoor Environments-Loids</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Krishna%20Naik">K. Krishna Naik</a>, <a href="https://publications.waset.org/search?q=M.%20N.%20Giri%20Prasad"> M. N. Giri Prasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> These days wireless local area networks has become very popular, when the initial IEEE802.11 is the standard for providing wireless connectivity to automatic machinery, equipment and stations that require rapid deployment, which may be portable, handheld or which may be mounted on moving vehicles within a local area. IEEE802.11 Wireless local area network is a sharedmedium communication network that transmits information over wireless links for all IEEE802.11 stations in its transmission range to receive. When a user is moving from one location to another, how the other user knows about the required station inside WLAN. For that we designed and implemented a system to locate a mobile user inside the wireless local area network based on RSSI with the help of four specially designed architectures. These architectures are based on statistical or we can say manual configuration of mapping and radio map of indoor and outdoor location with the help of available Sniffer based and cluster based techniques. We found a better location of a mobile user in WLAN. We tested this work in indoor and outdoor environments with different locations with the help of Pamvotis, a simulator for WLAN. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AP" title="AP">AP</a>, <a href="https://publications.waset.org/search?q=RSSI" title=" RSSI"> RSSI</a>, <a href="https://publications.waset.org/search?q=RPM" title=" RPM"> RPM</a>, <a href="https://publications.waset.org/search?q=WLAN." title=" WLAN."> WLAN.</a> </p> <a href="https://publications.waset.org/9218/a-four-architectures-to-locate-mobile-users-using-statistical-mapping-of-wlans-in-indoorand-outdoor-environments-loids" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9218/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9218/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9218/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9218/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9218/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9218/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9218/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9218/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9218/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9218/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9218.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">1315</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">19</span> On-line Identification of Continuous-time Hammerstein Systems via RBF Networks and Immune Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tomohiro%20Hachino">Tomohiro Hachino</a>, <a href="https://publications.waset.org/search?q=Kengo%20Nagatomo"> Kengo Nagatomo</a>, <a href="https://publications.waset.org/search?q=Hitoshi%20Takata"> Hitoshi Takata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with an on-line identification method of continuous-time Hammerstein systems by using the radial basis function (RBF) networks and immune algorithm (IA). An unknown nonlinear static part to be estimated is approximately represented by the RBF network. The IA is efficiently combined with the recursive least-squares (RLS) method. The objective function for the identification is regarded as the antigen. The candidates of the RBF parameters such as the centers and widths are coded into binary bit strings as the antibodies and searched by the IA. On the other hand, the candidates of both the weighting parameters of the RBF network and the system parameters of the linear dynamic part are updated by the RLS method. Simulation results are shown to illustrate the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Continuous-time%20System" title="Continuous-time System">Continuous-time System</a>, <a href="https://publications.waset.org/search?q=Hammerstein%20System" title=" Hammerstein System"> Hammerstein System</a>, <a href="https://publications.waset.org/search?q=OnlineIdentification" title=" OnlineIdentification"> OnlineIdentification</a>, <a href="https://publications.waset.org/search?q=Immune%20Algorithm" title=" Immune Algorithm"> Immune Algorithm</a>, <a href="https://publications.waset.org/search?q=RBF%20network." title=" RBF network."> RBF network.</a> </p> <a href="https://publications.waset.org/3831/on-line-identification-of-continuous-time-hammerstein-systems-via-rbf-networks-and-immune-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3831/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3831/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3831/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3831/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3831/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3831/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3831/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3831/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3831/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3831/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3831.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">1362</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">18</span> A Hybrid Method for Eyes Detection in Facial Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Muhammad%20Shafi">Muhammad Shafi</a>, <a href="https://publications.waset.org/search?q=Paul%20W.%20H.%20Chung"> Paul W. H. Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a hybrid method for eyes localization in facial images. The novelty is in combining techniques that utilise colour, edge and illumination cues to improve accuracy. The method is based on the observation that eye regions have dark colour, high density of edges and low illumination as compared to other parts of face. The first step in the method is to extract connected regions from facial images using colour, edge density and illumination cues separately. Some of the regions are then removed by applying rules that are based on the general geometry and shape of eyes. The remaining connected regions obtained through these three cues are then combined in a systematic way to enhance the identification of the candidate regions for the eyes. The geometry and shape based rules are then applied again to further remove the false eye regions. The proposed method was tested using images from the PICS facial images database. The proposed method has 93.7% and 87% accuracies for initial blobs extraction and final eye detection respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Erosion" title="Erosion">Erosion</a>, <a href="https://publications.waset.org/search?q=dilation" title=" dilation"> dilation</a>, <a href="https://publications.waset.org/search?q=Edge-density" title=" Edge-density"> Edge-density</a> </p> <a href="https://publications.waset.org/7427/a-hybrid-method-for-eyes-detection-in-facial-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7427/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7427/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7427/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7427/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7427/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7427/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7427/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7427/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7427/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7427/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7427.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">2050</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">17</span> Direct Sequence Spread Spectrum Technique with Residue Number System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20I.%20Youssef">M. I. Youssef</a>, <a href="https://publications.waset.org/search?q=A.%20E.%20Emam"> A. E. Emam</a>, <a href="https://publications.waset.org/search?q=M.%20Abd%20Elghany"> M. Abd Elghany</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a residue number arithmetic is used in direct sequence spread spectrum system, this system is evaluated and the bit error probability of this system is compared to that of non residue number system. The effect of channel bandwidth, PN sequences, multipath effect and modulation scheme are studied. A Matlab program is developed to measure the signal-to-noise ratio (SNR), and the bit error probability for the various schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Spread%20Spectrum" title="Spread Spectrum">Spread Spectrum</a>, <a href="https://publications.waset.org/search?q=Direct%20sequence" title=" Direct sequence"> Direct sequence</a>, <a href="https://publications.waset.org/search?q=Bit%20errorprobability%20and%20Residue%20number%20system." title=" Bit errorprobability and Residue number system."> Bit errorprobability and Residue number system.</a> </p> <a href="https://publications.waset.org/9495/direct-sequence-spread-spectrum-technique-with-residue-number-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9495/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9495/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9495/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9495/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9495/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9495/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9495/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9495/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9495/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9495/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9495.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">3649</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">16</span> Measurement of Small PD-S in Compressed SF6(10%) - N2(90%) Gas Mixture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Rajesh%20Kamath">B. Rajesh Kamath</a>, <a href="https://publications.waset.org/search?q=J.%20Sundara%20Rajan"> J. Sundara Rajan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Partial Discharge measurement is a very important means of assessing the integrity of insulation systems in a High Voltage apparatus. In compressed gas insulation systems, floating particles can initiate partial discharge activities which adversely affect the working of insulation. Partial Discharges below the inception voltage also plays a crucial in damaging the integrity of insulation over a period of time. This paper discusses the effect of loose and fixed Copper and Nichrome wire particles on the PD characteristics in SF6-N2 (10:90) gas mixtures at a pressure of 0.4MPa. The Partial Discharge statistical parameters and their correlation to the observed results are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Gas%20Insulated%20transmission%20Line" title="Gas Insulated transmission Line">Gas Insulated transmission Line</a>, <a href="https://publications.waset.org/search?q=Sulphur%20HexaFlouride" title=" Sulphur HexaFlouride"> Sulphur HexaFlouride</a>, <a href="https://publications.waset.org/search?q=metallic%20Particles" title=" metallic Particles"> metallic Particles</a>, <a href="https://publications.waset.org/search?q=Partial%20Discharge%20%28PD%29" title=" Partial Discharge (PD)"> Partial Discharge (PD)</a>, <a href="https://publications.waset.org/search?q=InceptionVoltage%20%28Vi%29" title=" InceptionVoltage (Vi)"> InceptionVoltage (Vi)</a>, <a href="https://publications.waset.org/search?q=Extinction%20Voltage%20%28Ve%29" title=" Extinction Voltage (Ve)"> Extinction Voltage (Ve)</a>, <a href="https://publications.waset.org/search?q=PD%20Statistical%20parameters." title=" PD Statistical parameters."> PD Statistical parameters.</a> </p> <a href="https://publications.waset.org/14143/measurement-of-small-pd-s-in-compressed-sf610-n290-gas-mixture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14143/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14143/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14143/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14143/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14143/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14143/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14143/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14143/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14143/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14143/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14143.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">1671</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">15</span> Study of Tower Grounding Resistance Effected Back Flashover to 500 kV Transmission Line in Thailand by using ATP/EMTP</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Marungsri">B. Marungsri</a>, <a href="https://publications.waset.org/search?q=S.%20Boonpoke"> S. Boonpoke</a>, <a href="https://publications.waset.org/search?q=A.%20Rawangpai"> A. Rawangpai</a>, <a href="https://publications.waset.org/search?q=A.%20Oonsivilai"> A. Oonsivilai</a>, <a href="https://publications.waset.org/search?q=C.%20Kritayakornupong"> C. Kritayakornupong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study describes analysis of tower grounding resistance effected the back flashover voltage across insulator string in a transmission system. This paper studies the 500 kV transmission lines from Mae Moh, Lampang to Nong Chok, Bangkok, Thailand, which is double circuit in the same steel tower with two overhead ground wires. The factor of this study includes magnitude of lightning stroke, and front time of lightning stroke. Steel tower uses multistory tower model. The assumption of studies based on the return stroke current ranged 1-200 kA, front time of lightning stroke between 1 μs to 3 μs. The simulations study the effect of varying tower grounding resistance that affect the lightning current. Simulation results are analyzed lightning over voltage that causes back flashover at insulator strings. This study helps to know causes of problems of back flashover the transmission line system, and also be as a guideline solving the problem for 500 kV transmission line systems, as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Tower%20grounding%20resistance" title="Tower grounding resistance">Tower grounding resistance</a>, <a href="https://publications.waset.org/search?q=back%20flashover" title=" back flashover"> back flashover</a>, <a href="https://publications.waset.org/search?q=multistory%20tower%20model" title="multistory tower model">multistory tower model</a>, <a href="https://publications.waset.org/search?q=lightning%20stroke%20current." title=" lightning stroke current."> lightning stroke current.</a> </p> <a href="https://publications.waset.org/3915/study-of-tower-grounding-resistance-effected-back-flashover-to-500-kv-transmission-line-in-thailand-by-using-atpemtp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3915/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3915/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3915/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3915/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3915/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3915/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3915/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3915/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3915/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3915/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3915.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">4341</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">14</span> Electric Field and Potential Distributions along Surface of Silicone Rubber Polymer Insulators Using Finite Element Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Marungsri">B. Marungsri</a>, <a href="https://publications.waset.org/search?q=W.%20Onchantuek"> W. Onchantuek</a>, <a href="https://publications.waset.org/search?q=A.%20Oonsivilai"> A. Oonsivilai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the simulation the results of electric field and potential distributions along surface of silicone rubber polymer insulators. Near the same leakage distance subjected to 15 kV in 50 cycle salt fog ageing test, alternate sheds silicone rubber polymer insulator showed better contamination performance than straight sheds silicone rubber polymer insulator. Severe surface ageing was observed on the straight sheds insulator. The objective of this work is to elucidate that electric field distribution along straight sheds insulator higher than alternate shed insulator in salt fog ageing test. Finite element method (FEM) is adopted for this work. The simulation results confirmed the experimental data, as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Electric%20field%20distribution" title="Electric field distribution">Electric field distribution</a>, <a href="https://publications.waset.org/search?q=potential%20distribution" title=" potential distribution"> potential distribution</a>, <a href="https://publications.waset.org/search?q=silicone%20rubber%20polymer%20insulator" title="silicone rubber polymer insulator">silicone rubber polymer insulator</a>, <a href="https://publications.waset.org/search?q=finite%20element%20method." title=" finite element method."> finite element method.</a> </p> <a href="https://publications.waset.org/10564/electric-field-and-potential-distributions-along-surface-of-silicone-rubber-polymer-insulators-using-finite-element-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10564/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10564/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10564/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10564/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10564/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10564/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10564/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10564/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10564/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10564/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10564.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">2108</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">13</span> A Trust Model using Fuzzy Logic in Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tae%20Kyung%20Kim">Tae Kyung Kim</a>, <a href="https://publications.waset.org/search?q=Hee%20Suk%20Seo"> Hee Suk Seo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Adapting various sensor devices to communicate within sensor networks empowers us by providing range of possibilities. The sensors in sensor networks need to know their measurable belief of trust for efficient and safe communication. In this paper, we suggested a trust model using fuzzy logic in sensor network. Trust is an aggregation of consensus given a set of past interaction among sensors. We applied our suggested model to sensor networks in order to show how trust mechanisms are involved in communicating algorithm to choose the proper path from source to destination. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy" title="Fuzzy">Fuzzy</a>, <a href="https://publications.waset.org/search?q=Sensor%20Networks" title=" Sensor Networks"> Sensor Networks</a>, <a href="https://publications.waset.org/search?q=Trust." title=" Trust."> Trust.</a> </p> <a href="https://publications.waset.org/12432/a-trust-model-using-fuzzy-logic-in-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12432/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12432/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12432/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12432/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12432/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12432/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12432/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12432/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12432/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12432/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12432.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">3555</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">12</span> Simulation using the Recursive Method in USN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tae%20Kyung%20Kim">Tae Kyung Kim</a>, <a href="https://publications.waset.org/search?q=Hee%20Suk%20Seo"> Hee Suk Seo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sensor networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects forged reports into the network through compromised nodes, with the goal of deceiving the base station or depleting the resources of forwarding nodes. Several research solutions have been recently proposed to detect and drop such forged reports during the forwarding process. Each design can provide the equivalent resilience in terms of node compromising. However, their energy consumption characteristics differ from each other. Thus, employing only a single filtering scheme for a network is not a recommendable strategy in terms of energy saving. It's very important the threshold determination for message authentication to identify. We propose the recursive contract net protocols which less energy level of terminal node in wireless sensor network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20filtering" title="Data filtering">Data filtering</a>, <a href="https://publications.waset.org/search?q=recursive%20CNP" title=" recursive CNP"> recursive CNP</a>, <a href="https://publications.waset.org/search?q=simulation." title=" simulation."> simulation.</a> </p> <a href="https://publications.waset.org/8708/simulation-using-the-recursive-method-in-usn" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8708/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8708/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8708/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8708/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8708/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8708/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8708/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8708/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8708/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8708/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8708.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">1503</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11</span> Low Energy Method for Data Delivery in Ubiquitous Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tae%20Kyung%20Kim">Tae Kyung Kim</a>, <a href="https://publications.waset.org/search?q=Hee%20Suk%20Seo"> Hee Suk Seo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recent advances in wireless sensor networks have led to many routing methods designed for energy-efficiency in wireless sensor networks. Despite that many routing methods have been proposed in USN, a single routing method cannot be energy-efficient if the environment of the ubiquitous sensor network varies. We present the controlling network access to various hosts and the services they offer, rather than on securing them one by one with a network security model. When ubiquitous sensor networks are deployed in hostile environments, an adversary may compromise some sensor nodes and use them to inject false sensing reports. False reports can lead to not only false alarms but also the depletion of limited energy resource in battery powered networks. The interleaved hop-by-hop authentication scheme detects such false reports through interleaved authentication. This paper presents a LMDD (Low energy method for data delivery) algorithm that provides energy-efficiency by dynamically changing protocols installed at the sensor nodes. The algorithm changes protocols based on the output of the fuzzy logic which is the fitness level of the protocols for the environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20delivery" title="Data delivery">Data delivery</a>, <a href="https://publications.waset.org/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/search?q=simulation." title=" simulation."> simulation.</a> </p> <a href="https://publications.waset.org/7417/low-energy-method-for-data-delivery-in-ubiquitous-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7417/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7417/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7417/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7417/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7417/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7417/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7417/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7417/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7417/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7417/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7417.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">1345</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10</span> Exponential Particle Swarm Optimization Approach for Improving Data Clustering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Neveen%20I.%20Ghali">Neveen I. Ghali</a>, <a href="https://publications.waset.org/search?q=Nahed%20El-Dessouki"> Nahed El-Dessouki</a>, <a href="https://publications.waset.org/search?q=Mervat%20A.%20N."> Mervat A. N.</a>, <a href="https://publications.waset.org/search?q=Lamiaa%20Bakrawi"> Lamiaa Bakrawi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we use exponential particle swarm optimization (EPSO) to cluster data. Then we compare between (EPSO) clustering algorithm which depends on exponential variation for the inertia weight and particle swarm optimization (PSO) clustering algorithm which depends on linear inertia weight. This comparison is evaluated on five data sets. The experimental results show that EPSO clustering algorithm increases the possibility to find the optimal positions as it decrease the number of failure. Also show that (EPSO) clustering algorithm has a smaller quantization error than (PSO) clustering algorithm, i.e. (EPSO) clustering algorithm more accurate than (PSO) clustering algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Particle%20swarm%20optimization" title="Particle swarm optimization">Particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=data%20clustering" title=" data clustering"> data clustering</a>, <a href="https://publications.waset.org/search?q=exponential%20PSO." title="exponential PSO.">exponential PSO.</a> </p> <a href="https://publications.waset.org/8531/exponential-particle-swarm-optimization-approach-for-improving-data-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8531/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8531/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8531/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8531/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8531/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8531/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8531/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8531/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8531/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8531/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8531.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">1690</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9</span> Estimation of Skew Angle in Binary Document Images Using Hough Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nandini%20N.">Nandini N.</a>, <a href="https://publications.waset.org/search?q=Srikanta%20Murthy%20K."> Srikanta Murthy K.</a>, <a href="https://publications.waset.org/search?q=G.%20Hemantha%20Kumar"> G. Hemantha Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper includes two novel techniques for skew estimation of binary document images. These algorithms are based on connected component analysis and Hough transform. Both these methods focus on reducing the amount of input data provided to Hough transform. In the first method, referred as word centroid approach, the centroids of selected words are used for skew detection. In the second method, referred as dilate & thin approach, the selected characters are blocked and dilated to get word blocks and later thinning is applied. The final image fed to Hough transform has the thinned coordinates of word blocks in the image. The methods have been successful in reducing the computational complexity of Hough transform based skew estimation algorithms. Promising experimental results are also provided to prove the effectiveness of the proposed methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dilation" title="Dilation">Dilation</a>, <a href="https://publications.waset.org/search?q=Document%20processing" title=" Document processing"> Document processing</a>, <a href="https://publications.waset.org/search?q=Hough%20transform" title=" Hough transform"> Hough transform</a>, <a href="https://publications.waset.org/search?q=Optical%20Character%20Recognition" title="Optical Character Recognition">Optical Character Recognition</a>, <a href="https://publications.waset.org/search?q=Skew%20estimation" title=" Skew estimation"> Skew estimation</a>, <a href="https://publications.waset.org/search?q=and%20Thinning." title=" and Thinning."> and Thinning.</a> </p> <a href="https://publications.waset.org/8967/estimation-of-skew-angle-in-binary-document-images-using-hough-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8967/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8967/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8967/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8967/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8967/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8967/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8967/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8967/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8967/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8967/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8967.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">3266</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8</span> Development of A Meta Description Language for Software/Hardware Cooperative Design and Verification for Model-Checking Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Katsumi%20Wasaki">Katsumi Wasaki</a>, <a href="https://publications.waset.org/search?q=Naoki%20Iwasaki"> Naoki Iwasaki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Model-checking tools such as Symbolic Model Verifier (SMV) and NuSMV are available for checking hardware designs. These tools can automatically check the formal legitimacy of a design. However, NuSMV is too low level for describing a complete hardware design. It is therefore necessary to translate the system definition, as designed in a language such as Verilog or VHDL, into a language such as NuSMV for validation. In this paper, we present a meta hardware description language, Melasy, that contains a code generator for existing hardware description languages (HDLs) and languages for model checking that solve this problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=meta%20description%20language" title="meta description language">meta description language</a>, <a href="https://publications.waset.org/search?q=software%2Fhardware%20codesign" title=" software/hardware codesign"> software/hardware codesign</a>, <a href="https://publications.waset.org/search?q=co-verification" title="co-verification">co-verification</a>, <a href="https://publications.waset.org/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/search?q=hardware%20compiler" title=" hardware compiler"> hardware compiler</a>, <a href="https://publications.waset.org/search?q=modelchecking." title=" modelchecking."> modelchecking.</a> </p> <a href="https://publications.waset.org/4385/development-of-a-meta-description-language-for-softwarehardware-cooperative-design-and-verification-for-model-checking-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4385/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4385/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4385/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4385/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4385/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4385/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4385/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4385/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4385/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4385/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4385.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">1464</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7</span> Image Segmentation Based on Graph Theoretical Approach to Improve the Quality of Image Segmentation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Deepthi%20Narayan">Deepthi Narayan</a>, <a href="https://publications.waset.org/search?q=Srikanta%20Murthy%20K."> Srikanta Murthy K.</a>, <a href="https://publications.waset.org/search?q=G.%20Hemantha%20Kumar"> G. Hemantha Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph based image segmentation techniques are considered to be one of the most efficient segmentation techniques which are mainly used as time & space efficient methods for real time applications. How ever, there is need to focus on improving the quality of segmented images obtained from the earlier graph based methods. This paper proposes an improvement to the graph based image segmentation methods already described in the literature. We contribute to the existing method by proposing the use of a weighted Euclidean distance to calculate the edge weight which is the key element in building the graph. We also propose a slight modification of the segmentation method already described in the literature, which results in selection of more prominent edges in the graph. The experimental results show the improvement in the segmentation quality as compared to the methods that already exist, with a slight compromise in efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Graph%20based%20image%20segmentation" title="Graph based image segmentation">Graph based image segmentation</a>, <a href="https://publications.waset.org/search?q=threshold" title=" threshold"> threshold</a>, <a href="https://publications.waset.org/search?q=Weighted%20Euclidean%20distance." title="Weighted Euclidean distance.">Weighted Euclidean distance.</a> </p> <a href="https://publications.waset.org/7317/image-segmentation-based-on-graph-theoretical-approach-to-improve-the-quality-of-image-segmentation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7317/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7317/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7317/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7317/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7317/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7317/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7317/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7317/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7317/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7317/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7317.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">1563</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">6</span> Text Summarization for Oil and Gas Drilling Topic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20Y.%20Chen">Y. Y. Chen</a>, <a href="https://publications.waset.org/search?q=O.%20M.%20Foong"> O. M. Foong</a>, <a href="https://publications.waset.org/search?q=S.%20P.%20Yong"> S. P. Yong</a>, <a href="https://publications.waset.org/search?q=Kurniawan%20Iwan"> Kurniawan Iwan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Information sharing and gathering are important in the rapid advancement era of technology. The existence of WWW has caused rapid growth of information explosion. Readers are overloaded with too many lengthy text documents in which they are more interested in shorter versions. Oil and gas industry could not escape from this predicament. In this paper, we develop an Automated Text Summarization System known as AutoTextSumm to extract the salient points of oil and gas drilling articles by incorporating statistical approach, keywords identification, synonym words and sentence-s position. In this study, we have conducted interviews with Petroleum Engineering experts and English Language experts to identify the list of most commonly used keywords in the oil and gas drilling domain. The system performance of AutoTextSumm is evaluated using the formulae of precision, recall and F-score. Based on the experimental results, AutoTextSumm has produced satisfactory performance with F-score of 0.81.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Keyword%27s%20probability" title="Keyword's probability">Keyword's probability</a>, <a href="https://publications.waset.org/search?q=synonym%20sets." title=" synonym sets."> synonym sets.</a> </p> <a href="https://publications.waset.org/9497/text-summarization-for-oil-and-gas-drilling-topic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9497/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9497/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9497/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9497/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9497/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9497/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9497/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9497/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9497/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9497/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9497.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">1731</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5</span> Hand Gesture Recognition: Sign to Voice System (S2V)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Oi%20Mean%20Foong">Oi Mean Foong</a>, <a href="https://publications.waset.org/search?q=Tan%20Jung%20Low"> Tan Jung Low</a>, <a href="https://publications.waset.org/search?q=Satrio%20Wibowo"> Satrio Wibowo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hand gesture is one of the typical methods used in sign language for non-verbal communication. It is most commonly used by people who have hearing or speech problems to communicate among themselves or with normal people. Various sign language systems have been developed by manufacturers around the globe but they are neither flexible nor cost-effective for the end users. This paper presents a system prototype that is able to automatically recognize sign language to help normal people to communicate more effectively with the hearing or speech impaired people. The Sign to Voice system prototype, S2V, was developed using Feed Forward Neural Network for two-sequence signs detection. Different sets of universal hand gestures were captured from video camera and utilized to train the neural network for classification purpose. The experimental results have shown that neural network has achieved satisfactory result for sign-to-voice translation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hand%20gesture%20detection" title="Hand gesture detection">Hand gesture detection</a>, <a href="https://publications.waset.org/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/search?q=signlanguage" title=" signlanguage"> signlanguage</a>, <a href="https://publications.waset.org/search?q=sequence%20detection." title=" sequence detection."> sequence detection.</a> </p> <a href="https://publications.waset.org/9202/hand-gesture-recognition-sign-to-voice-system-s2v" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9202/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9202/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9202/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9202/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9202/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9202/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9202/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9202/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9202/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9202/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9202.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">1856</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4</span> An Ontology for Knowledge Representation and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nhon%20Do">Nhon Do</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ontology is a terminology which is used in artificial intelligence with different meanings. Ontology researching has an important role in computer science and practical applications, especially distributed knowledge systems. In this paper we present an ontology which is called Computational Object Knowledge Base Ontology. It has been used in designing some knowledge base systems for solving problems such as the system that supports studying knowledge and solving analytic geometry problems, the program for studying and solving problems in Plane Geometry, the knowledge system in linear algebra. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20intelligence" title="Artificial intelligence">Artificial intelligence</a>, <a href="https://publications.waset.org/search?q=knowledge%20representation" title=" knowledge representation"> knowledge representation</a>, <a href="https://publications.waset.org/search?q=knowledge%20base%20system" title="knowledge base system">knowledge base system</a>, <a href="https://publications.waset.org/search?q=ontology." title=" ontology."> ontology.</a> </p> <a href="https://publications.waset.org/3009/an-ontology-for-knowledge-representation-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3009/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3009/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3009/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3009/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3009/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3009/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3009/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3009/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3009/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3009/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3009.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">2159</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3</span> Analysis of DNA Microarray Data using Association Rules: A Selective Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Anandhavalli%20Gauthaman">M. Anandhavalli Gauthaman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>DNA microarrays allow the measurement of expression levels for a large number of genes, perhaps all genes of an organism, within a number of different experimental samples. It is very much important to extract biologically meaningful information from this huge amount of expression data to know the current state of the cell because most cellular processes are regulated by changes in gene expression. Association rule mining techniques are helpful to find association relationship between genes. Numerous association rule mining algorithms have been developed to analyze and associate this huge amount of gene expression data. This paper focuses on some of the popular association rule mining algorithms developed to analyze gene expression data.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=DNA%20microarray" title="DNA microarray">DNA microarray</a>, <a href="https://publications.waset.org/search?q=gene%20expression" title=" gene expression"> gene expression</a>, <a href="https://publications.waset.org/search?q=association%20rule%20mining." title=" association rule mining."> association rule mining.</a> </p> <a href="https://publications.waset.org/5818/analysis-of-dna-microarray-data-using-association-rules-a-selective-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5818/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5818/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5818/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5818/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5818/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5818/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5818/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5818/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5818/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5818/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5818.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">2145</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2</span> An Archetype to Sustain Knowledge Management Systems through Intranet</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20T.%20Sayed">B. T. Sayed</a>, <a href="https://publications.waset.org/search?q=Nafa%C3%A2%20Jabeur"> Nafaâ Jabeur</a>, <a href="https://publications.waset.org/search?q=M.%20Aref"> M. Aref</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Creation and maintenance of knowledge management systems has been recognized as an important research area. Consecutively lack of accurate results from knowledge management systems limits the organization to apply their knowledge management processes. This leads to a failure in getting the right information to the right people at the right time thus followed by a deficiency in decision making processes. An Intranet offers a powerful tool for communication and collaboration, presenting data and information, and the means that creates and shares knowledge, all in one easily accessible place. This paper proposes an archetype describing how a knowledge management system, with the support of intranet capabilities, could very much increase the accuracy of capturing, storing and retrieving knowledge based processes thereby increasing the efficiency of the system. This system will expect a critical mass of usage, by the users, for intranet to function as knowledge management systems. This prototype would lead to a design of an application that would impose creation and maintenance of an effective knowledge management system through intranet. The aim of this paper is to introduce an effective system to handle capture, store and distribute knowledge management in a form that may not lead to any failure which exists in most of the systems. The methodology used in the system would require all the employees, in the organization, to contribute the maximum to deliver the system to a successful arena. The system is still in its initial mode and thereby the authors are under the process to practically implement the ideas, as mentioned in the system, to produce satisfactory results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Knowledge%20Management%20Systems" title="Knowledge Management Systems">Knowledge Management Systems</a>, <a href="https://publications.waset.org/search?q=Intranet" title=" Intranet"> Intranet</a>, <a href="https://publications.waset.org/search?q=Methodology." title="Methodology.">Methodology.</a> </p> <a href="https://publications.waset.org/15728/an-archetype-to-sustain-knowledge-management-systems-through-intranet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15728/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15728/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15728/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15728/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15728/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15728/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15728/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15728/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15728/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15728/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15728.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">1999</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1</span> Property Aggregation and Uncertainty with Links to the Management and Determination of Critical Design Features</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Steven%20Whittle">Steven Whittle</a>, <a href="https://publications.waset.org/search?q=Ingrida%20Valiusaityte"> Ingrida Valiusaityte</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Within the domain of Systems Engineering the need to perform property aggregation to understand, analyze and manage complex systems is unequivocal. This can be seen in numerous domains such as capability analysis, Mission Essential Competencies (MEC) and Critical Design Features (CDF). Furthermore, the need to consider uncertainty propagation as well as the sensitivity of related properties within such analysis is equally as important when determining a set of critical properties within such a system. This paper describes this property breakdown in a number of domains within Systems Engineering and, within the area of CDFs, emphasizes the importance of uncertainty analysis. As part of this, a section of the paper describes possible techniques which may be used within uncertainty propagation and in conclusion an example is described utilizing one of the techniques for property and uncertainty aggregation within an aircraft system to aid the determination of Critical Design Features. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Complex%20Systems" title="Complex Systems">Complex Systems</a>, <a href="https://publications.waset.org/search?q=Critical%20Design%20Features" title=" Critical Design Features"> Critical Design Features</a>, <a href="https://publications.waset.org/search?q=Property%20Aggregation" title="Property Aggregation">Property Aggregation</a>, <a href="https://publications.waset.org/search?q=Uncertainty." title=" Uncertainty."> Uncertainty.</a> </p> <a href="https://publications.waset.org/3552/property-aggregation-and-uncertainty-with-links-to-the-management-and-determination-of-critical-design-features" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3552/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3552/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3552/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3552/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3552/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3552/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3552/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3552/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3552/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3552/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3552.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">1539</span> </span> </div> </div> </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>