CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: subnormal imprecise vector</title> <meta name="description" content="Search results for: subnormal imprecise vector"> <meta name="keywords" content="subnormal imprecise vector"> <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="subnormal imprecise vector" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="subnormal imprecise vector"> <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> 1144</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: subnormal imprecise vector</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1144</span> Imprecise Vector: The Case of Subnormality</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dhruba%20Das">Dhruba Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, the author has put forward the actual mathematical explanation of subnormal imprecise vector. Every subnormal imprecise vector has to be defined with reference to a membership surface. The membership surface of normal imprecise vector has already defined based on Randomness-Impreciseness Consistency Principle. The Randomness- Impreciseness Consistency Principle leads to defining a normal law of impreciseness using two different laws of randomness. A normal imprecise vector is a special case of subnormal imprecise vector. Nothing however is available in the literature about the membership surface when a subnormal imprecise vector is defined. The author has shown here how to construct the membership surface of a subnormal imprecise vector. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=imprecise%20vector" title="imprecise vector">imprecise vector</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20surface" title=" membership surface"> membership surface</a>, <a href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20number" title=" subnormal imprecise number"> subnormal imprecise number</a>, <a href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector" title=" subnormal imprecise vector"> subnormal imprecise vector</a> </p> <a href="https://publications.waset.org/abstracts/44144/imprecise-vector-the-case-of-subnormality" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44144.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">320</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1143</span> Membership Surface and Arithmetic Operations of Imprecise Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dhruba%20Das">Dhruba Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a method has been developed to construct the membership surfaces of row and column vectors and arithmetic operations of imprecise matrix. A matrix with imprecise elements would be called an imprecise matrix. The membership surface of imprecise vector has been already shown based on Randomness-Impreciseness Consistency Principle. The Randomness- Impreciseness Consistency Principle leads to defining a normal law of impreciseness using two different laws of randomness. In this paper, the author has shown row and column membership surfaces and arithmetic operations of imprecise matrix and demonstrated with the help of numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=imprecise%20number" title="imprecise number">imprecise number</a>, <a href="https://publications.waset.org/abstracts/search?q=imprecise%20vector" title=" imprecise vector"> imprecise vector</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20surface" title=" membership surface"> membership surface</a>, <a href="https://publications.waset.org/abstracts/search?q=imprecise%20matrix" title=" imprecise matrix"> imprecise matrix</a> </p> <a href="https://publications.waset.org/abstracts/33597/membership-surface-and-arithmetic-operations-of-imprecise-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33597.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">386</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1142</span> Vector Quantization Based on Vector Difference Scheme for Image Enhancement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Biji%20Jacob">Biji Jacob</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vector quantization algorithm which uses minimum distance calculation for codebook generation, a time consuming calculation performed on each pixel values leads to computation complexity. The codebook is updated by comparing the distance of each vector to their centroid vector and measure for their closeness. In this paper vector quantization is modified based on vector difference algorithm for image enhancement purpose. In the proposed scheme, vector differences between the vectors are considered as the new generation vectors or new codebook vectors. The codebook is updated by comparing the new generation vector with a threshold value having minimum error with the parent vector. The minimum error decides the fitness of each newly generated vector. Thus the codebook is generated in an adaptive manner and the fitness value is determined for the suppression of the degraded portion of the image and thereby leads to the enhancement of the image through the adaptive searching capability of the vector quantization through vector difference algorithm. Experimental results shows that the vector difference scheme efficiently modifies the vector quantization algorithm for enhancing the image with peak signal to noise ratio (PSNR), mean square error (MSE), Euclidean distance (E_dist) as the performance parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=codebook" title="codebook">codebook</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20enhancement" title=" image enhancement"> image enhancement</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20difference" title=" vector difference"> vector difference</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20quantization" title=" vector quantization"> vector quantization</a> </p> <a href="https://publications.waset.org/abstracts/39597/vector-quantization-based-on-vector-difference-scheme-for-image-enhancement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39597.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">267</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1141</span> Imprecise Vowel Articulation in Down Syndrome: An Acoustic Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anitha%20Naittee%20Abraham">Anitha Naittee Abraham</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Sreedevi"> N. Sreedevi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Individuals with Down syndrome (DS) have relatively better expressive language compared to other individuals with intellectual disabilities. Reduced speech intelligibility is one of the major concerns of this group of individuals due to their anatomical and physiological differences. The study investigated the vowel articulation of Malayalam speaking children with DS in the age range of 5-10 years. The vowel production of 10 children with DS was compared with typically developing children in the same age range. Vowels were extracted from 3 words with the corner vowels /a/, /i/ and /u/ in the word-initial position, using Praat (version 5.3.23) software. Acoustic analysis was based on vowel space area (VSA), Formant centralization ration (FCR) and F2i/F2u. The findings revealed increased formant values for the control group except for F2a and F2u. Also, the experimental group had higher FCR, lower VSA, and F2i/F2u values suggestive of imprecise vowel articulation due to restricted tongue movements. The results of the independent t-test revealed a significant difference in F1a, F2i, F2u, VSA, FCR and F2i/F2u values between the experimental and control group. These findings support the fact that children with DS have imprecise vowel articulation that interferes with the overall speech intelligibility. Hence it is essential to target the oromotor skills to enhance the speech intelligibility which in turn benefit in the social and vocational domains of these individuals. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Down%20syndrome" title="Down syndrome">Down syndrome</a>, <a href="https://publications.waset.org/abstracts/search?q=FCR" title=" FCR"> FCR</a>, <a href="https://publications.waset.org/abstracts/search?q=vowel%20articulation" title=" vowel articulation"> vowel articulation</a>, <a href="https://publications.waset.org/abstracts/search?q=vowel%20space" title=" vowel space"> vowel space</a> </p> <a href="https://publications.waset.org/abstracts/99225/imprecise-vowel-articulation-in-down-syndrome-an-acoustic-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99225.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">186</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1140</span> Intracellular Strategies for Gene Delivery into Mammalian Cells Using Bacteria as a Vector</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kumaran%20Narayanan">Kumaran Narayanan</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrew%20N.%20Osahor"> Andrew N. Osahor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> E. coli has been engineered by our group and by others as a vector to deliver DNA into cultured human and animal cells. However, so far conditions to improve gene delivery using this vector have not been investigated, resulting in a major gap in our understanding of the requirements for this vector to function optimally. Our group recently published novel data showing that simple addition of the DNA transfection reagent Lipofectamine increased the efficiency of the E. coli vector by almost 3-fold, providing the first strong evidence that further optimization of bactofection is possible. This presentation will discuss advances that demonstrate the effects of several intracellular strategies that improve the efficiency of this vector. Conditions that promote endosomal escape of internalized bacteria to evade lysosomal destruction after entry in the cell, a known obstacle limiting this vector, are elucidated. Further, treatments that increase bacterial lysis so that the vector can release its transgene into the mammalian environment for expression will be discussed. These experiments will provide valuable new insight to advance this E. coli system as an important class of vector technology for genetic correction of human disease models in cells and whole animals. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DNA" title="DNA">DNA</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20coli" title=" E. coli"> E. coli</a>, <a href="https://publications.waset.org/abstracts/search?q=gene%20expression" title=" gene expression"> gene expression</a>, <a href="https://publications.waset.org/abstracts/search?q=vector" title=" vector"> vector</a> </p> <a href="https://publications.waset.org/abstracts/45408/intracellular-strategies-for-gene-delivery-into-mammalian-cells-using-bacteria-as-a-vector" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45408.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">358</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1139</span> Speed up Vector Median Filtering by Quasi Euclidean Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vinai%20K.%20Singh">Vinai K. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For reducing impulsive noise without degrading image contours, median filtering is a powerful tool. In multiband images as for example colour images or vector fields obtained by optic flow computation, a vector median filter can be used. Vector median filters are defined on the basis of a suitable distance, the best performing distance being the Euclidean. Euclidean distance is evaluated by using the Euclidean norms which is quite demanding from the point of view of computation given that a square root is required. In this paper an optimal piece-wise linear approximation of the Euclidean norm is presented which is applied to vector median filtering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euclidean%20norm" title="euclidean norm">euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi%20euclidean%20norm" title=" quasi euclidean norm"> quasi euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20median%20filtering" title=" vector median filtering"> vector median filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20mathematics" title=" applied mathematics"> applied mathematics</a> </p> <a href="https://publications.waset.org/abstracts/21942/speed-up-vector-median-filtering-by-quasi-euclidean-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21942.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">474</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1138</span> Robust Processing of Antenna Array Signals under Local Scattering Environments</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ching-Wei%20Liao"> Ching-Wei Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An adaptive array beamformer is designed for automatically preserving the desired signals while cancelling interference and noise. Providing robustness against model mismatches and tracking possible environment changes calls for robust adaptive beamforming techniques. The design criterion yields the well-known generalized sidelobe canceller (GSC) beamformer. In practice, the knowledge of the desired steering vector can be imprecise, which often occurs due to estimation errors in the DOA of the desired signal or imperfect array calibration. In these situations, the SOI is considered as interference, and the performance of the GSC beamformer is known to degrade. This undesired behavior results in a reduction of the array output signal-to-interference plus-noise-ratio (SINR). Therefore, it is worth developing robust techniques to deal with the problem due to local scattering environments. As to the implementation of adaptive beamforming, the required computational complexity is enormous when the array beamformer is equipped with massive antenna array sensors. To alleviate this difficulty, a generalized sidelobe canceller (GSC) with partially adaptivity for less adaptive degrees of freedom and faster adaptive response has been proposed in the literature. Unfortunately, it has been shown that the conventional GSC-based adaptive beamformers are usually very sensitive to the mismatch problems due to local scattering situations. In this paper, we present an effective GSC-based beamformer against the mismatch problems mentioned above. The proposed GSC-based array beamformer adaptively estimates the actual direction of the desired signal by using the presumed steering vector and the received array data snapshots. We utilize the predefined steering vector and a presumed angle tolerance range to carry out the required estimation for obtaining an appropriate steering vector. A matrix associated with the direction vector of signal sources is first created. Then projection matrices related to the matrix are generated and are utilized to iteratively estimate the actual direction vector of the desired signal. As a result, the quiescent weight vector and the required signal blocking matrix required for performing adaptive beamforming can be easily found. By utilizing the proposed GSC-based beamformer, we find that the performance degradation due to the considered local scattering environments can be effectively mitigated. To further enhance the beamforming performance, a signal subspace projection matrix is also introduced into the proposed GSC-based beamformer. Several computer simulation examples show that the proposed GSC-based beamformer outperforms the existing robust techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20antenna%20beamforming" title="adaptive antenna beamforming">adaptive antenna beamforming</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20scattering" title=" local scattering"> local scattering</a>, <a href="https://publications.waset.org/abstracts/search?q=signal%20blocking" title=" signal blocking"> signal blocking</a>, <a href="https://publications.waset.org/abstracts/search?q=steering%20mismatch" title=" steering mismatch"> steering mismatch</a> </p> <a href="https://publications.waset.org/abstracts/106035/robust-processing-of-antenna-array-signals-under-local-scattering-environments" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106035.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">112</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1137</span> Efficient Antenna Array Beamforming with Robustness against Random Steering Mismatch</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ching-Wei%20Liao"> Ching-Wei Liao</a>, <a href="https://publications.waset.org/abstracts/search?q=Kun-Che%20Lee"> Kun-Che Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of using antenna sensors for adaptive beamforming in the presence of random steering mismatch. We present an efficient adaptive array beamformer with robustness to deal with the considered problem. The robustness of the proposed beamformer comes from the efficient designation of the steering vector. Using the received array data vector, we construct an appropriate correlation matrix associated with the received array data vector and a correlation matrix associated with signal sources. Then, the eigenvector associated with the largest eigenvalue of the constructed signal correlation matrix is designated as an appropriate estimate of the steering vector. Finally, the adaptive weight vector required for adaptive beamforming is obtained by using the estimated steering vector and the constructed correlation matrix of the array data vector. Simulation results confirm the effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20beamforming" title="adaptive beamforming">adaptive beamforming</a>, <a href="https://publications.waset.org/abstracts/search?q=antenna%20array" title=" antenna array"> antenna array</a>, <a href="https://publications.waset.org/abstracts/search?q=linearly%20constrained%20minimum%20variance" title=" linearly constrained minimum variance"> linearly constrained minimum variance</a>, <a href="https://publications.waset.org/abstracts/search?q=robustness" title=" robustness"> robustness</a>, <a href="https://publications.waset.org/abstracts/search?q=steering%20vector" title=" steering vector"> steering vector</a> </p> <a href="https://publications.waset.org/abstracts/84543/efficient-antenna-array-beamforming-with-robustness-against-random-steering-mismatch" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84543.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">199</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1136</span> Application of IF Rough Data on Knowledge Towards Malaria of Rural Tribal Communities in Tripura</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chhaya%20Gangwal">Chhaya Gangwal</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20N.%20Bhaumik"> R. N. Bhaumik</a>, <a href="https://publications.waset.org/abstracts/search?q=Shishir%20Kumar"> Shishir Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Handling uncertainty and impreciseness of knowledge appears to be a challenging task in Information Systems. Intuitionistic fuzzy (IF) and rough set theory enhances databases by allowing it for the management of uncertainty and impreciseness. This paper presents a new efficient query optimization technique for the multi-valued or imprecise IF rough database. The usefulness of this technique was illustrated on malaria knowledge from the rural tribal communities of Tripura where most of the information is multi-valued and imprecise. Then, the querying about knowledge on malaria is executed into SQL server to make the implementation of IF rough data querying simpler. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20set" title="intuitionistic fuzzy set">intuitionistic fuzzy set</a>, <a href="https://publications.waset.org/abstracts/search?q=rough%20set" title=" rough set"> rough set</a>, <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title=" relational database"> relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=IF%20rough%20relational%20database" title=" IF rough relational database"> IF rough relational database</a> </p> <a href="https://publications.waset.org/abstracts/1814/application-of-if-rough-data-on-knowledge-towards-malaria-of-rural-tribal-communities-in-tripura" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1814.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">445</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1135</span> Parallel Vector Processing Using Multi Level Orbital DATA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nagi%20Mekhiel">Nagi Mekhiel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many applications use vector operations by applying single instruction to multiple data that map to different locations in conventional memory. Transferring data from memory is limited by access latency and bandwidth affecting the performance gain of vector processing. We present a memory system that makes all of its content available to processors in time so that processors need not to access the memory, we force each location to be available to all processors at a specific time. The data move in different orbits to become available to other processors in higher orbits at different time. We use this memory to apply parallel vector operations to data streams at first orbit level. Data processed in the first level move to upper orbit one data element at a time, allowing a processor in that orbit to apply another vector operation to deal with serial code limitations inherited in all parallel applications and interleaved it with lower level vector operations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Memory%20Organization" title="Memory Organization">Memory Organization</a>, <a href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors" title=" Parallel Processors"> Parallel Processors</a>, <a href="https://publications.waset.org/abstracts/search?q=Serial%0D%0ACode" title=" Serial Code"> Serial Code</a>, <a href="https://publications.waset.org/abstracts/search?q=Vector%20Processing" title=" Vector Processing"> Vector Processing</a> </p> <a href="https://publications.waset.org/abstracts/59115/parallel-vector-processing-using-multi-level-orbital-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59115.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">270</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1134</span> 0.13-µm Complementary Metal-Oxide Semiconductor Vector Modulator for Beamforming System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20S.%20Kim">J. S. Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a 0.13-µm Complementary Metal-Oxide Semiconductor (CMOS) vector modulator for beamforming system. The vector modulator features a 360° phase and gain range of -10 dB to 10 dB with a root mean square phase and amplitude error of only 2.2° and 0.45 dB, respectively. These features make it a suitable for wireless backhaul system in the 5 GHz industrial, scientific, and medical (ISM) bands. It draws a current of 20.4 mA from a 1.2 V supply. The total chip size is 1.87x1.34 mm². <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CMOS" title="CMOS">CMOS</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20modulator" title=" vector modulator"> vector modulator</a>, <a href="https://publications.waset.org/abstracts/search?q=beamforming" title=" beamforming"> beamforming</a>, <a href="https://publications.waset.org/abstracts/search?q=802.11ac" title=" 802.11ac"> 802.11ac</a> </p> <a href="https://publications.waset.org/abstracts/67880/013-m-complementary-metal-oxide-semiconductor-vector-modulator-for-beamforming-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67880.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">210</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1133</span> Using Support Vector Machines for Measuring Democracy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tommy%20Krieger">Tommy Krieger</a>, <a href="https://publications.waset.org/abstracts/search?q=Klaus%20Gruendler"> Klaus Gruendler </a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a novel approach for measuring democracy, which enables a very detailed and sensitive index. This method is based on Support Vector Machines, a mathematical algorithm for pattern recognition. Our implementation evaluates 188 countries in the period between 1981 and 2011. The Support Vector Machines Democracy Index (SVMDI) is continuously on the 0-1-Interval and robust to variations in the numerical process parameters. The algorithm introduced here can be used for every concept of democracy without additional adjustments, and due to its flexibility it is also a valuable tool for comparison studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=democracy" title="democracy">democracy</a>, <a href="https://publications.waset.org/abstracts/search?q=democracy%20index" title=" democracy index"> democracy index</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machines" title=" support vector machines"> support vector machines</a> </p> <a href="https://publications.waset.org/abstracts/31697/using-support-vector-machines-for-measuring-democracy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31697.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">378</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1132</span> Core Loss Influence on MTPA Current Vector Variation of Synchronous Reluctance Machine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Huai-Cong%20Liu">Huai-Cong Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Tae%20Chul%20Jeong"> Tae Chul Jeong</a>, <a href="https://publications.waset.org/abstracts/search?q=Ju%20Lee"> Ju Lee </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this study was to develop an electric circuit method (ECM) to ascertain the core loss influence on a Synchronous Reluctance Motor (SynRM) in the condition of the maximum torque per ampere (MTPA). SynRM for fan usually operates on the constant torque region, at synchronous speed the MTPA control is adopted due to current vector. However, finite element analysis (FEA) program is not sufficient exactly to reflect how the core loss influenced on the current vector. This paper proposed a method to calculate the current vector with consideration of core loss. The precision of current vector by ECM is useful for MTPA control. The result shows that ECM analysis is closer to the actual motor’s characteristics by testing with a 7.5kW SynRM drive System. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=core%20loss" title="core loss">core loss</a>, <a href="https://publications.waset.org/abstracts/search?q=SynRM" title=" SynRM"> SynRM</a>, <a href="https://publications.waset.org/abstracts/search?q=current%20vector" title=" current vector"> current vector</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetic%20saturation" title=" magnetic saturation"> magnetic saturation</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20torque%20per%20ampere%20%28MTPA%29" title=" maximum torque per ampere (MTPA)"> maximum torque per ampere (MTPA)</a> </p> <a href="https://publications.waset.org/abstracts/25312/core-loss-influence-on-mtpa-current-vector-variation-of-synchronous-reluctance-machine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25312.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">530</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1131</span> A New Concept for Deriving the Expected Value of Fuzzy Random Variables</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liang-Hsuan%20Chen">Liang-Hsuan Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Chia-Jung%20Chang"> Chia-Jung Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy random variables have been introduced as an imprecise concept of numeric values for characterizing the imprecise knowledge. The descriptive parameters can be used to describe the primary features of a set of fuzzy random observations. In fuzzy environments, the expected values are usually represented as fuzzy-valued, interval-valued or numeric-valued descriptive parameters using various metrics. Instead of the concept of area metric that is usually adopted in the relevant studies, the numeric expected value is proposed by the concept of distance metric in this study based on two characters (fuzziness and randomness) of FRVs. Comparing with the existing measures, although the results show that the proposed numeric expected value is same with those using the different metric, if only triangular membership functions are used. However, the proposed approach has the advantages of intuitiveness and computational efficiency, when the membership functions are not triangular types. An example with three datasets is provided for verifying the proposed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20random%20variables" title="fuzzy random variables">fuzzy random variables</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20measure" title=" distance measure"> distance measure</a>, <a href="https://publications.waset.org/abstracts/search?q=expected%20value" title=" expected value"> expected value</a>, <a href="https://publications.waset.org/abstracts/search?q=descriptive%20parameters" title=" descriptive parameters"> descriptive parameters</a> </p> <a href="https://publications.waset.org/abstracts/7545/a-new-concept-for-deriving-the-expected-value-of-fuzzy-random-variables" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7545.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1130</span> A Word-to-Vector Formulation for Word Representation </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sandra%20Rizkallah">Sandra Rizkallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20F.%20Atiya"> Amir F. Atiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work presents a novel word to vector representation that is based on embedding the words into a sphere, whereby the dot product of the corresponding vectors represents the similarity between any two words. Embedding the vectors into a sphere enabled us to take into consideration the antonymity between words, not only the synonymity, because of the suitability to handle the polarity nature of words. For example, a word and its antonym can be represented as a vector and its negative. Moreover, we have managed to extract an adequate vocabulary. The obtained results show that the proposed approach can capture the essence of the language, and can be generalized to estimate a correct similarity of any new pair of words. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20processing" title="natural language processing">natural language processing</a>, <a href="https://publications.waset.org/abstracts/search?q=word%20to%20vector" title=" word to vector"> word to vector</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20similarity" title=" text similarity"> text similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20mining" title=" text mining"> text mining</a> </p> <a href="https://publications.waset.org/abstracts/81808/a-word-to-vector-formulation-for-word-representation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81808.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">275</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1129</span> Voltage Problem Location Classification Using Performance of Least Squares Support Vector Machine LS-SVM and Learning Vector Quantization LVQ</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Khaled%20Abduesslam">M. Khaled Abduesslam</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Ali"> Mohammed Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Basher%20H.%20Alsdai"> Basher H. Alsdai</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Nizam%20Inayati"> Muhammad Nizam Inayati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the voltage problem location classification using performance of Least Squares Support Vector Machine (LS-SVM) and Learning Vector Quantization (LVQ) in electrical power system for proper voltage problem location implemented by IEEE 39 bus New-England. The data was collected from the time domain simulation by using Power System Analysis Toolbox (PSAT). Outputs from simulation data such as voltage, phase angle, real power and reactive power were taken as input to estimate voltage stability at particular buses based on Power Transfer Stability Index (PTSI).The simulation data was carried out on the IEEE 39 bus test system by considering load bus increased on the system. To verify of the proposed LS-SVM its performance was compared to Learning Vector Quantization (LVQ). The results showed that LS-SVM is faster and better as compared to LVQ. The results also demonstrated that the LS-SVM was estimated by 0% misclassification whereas LVQ had 7.69% misclassification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=IEEE%2039%20bus" title="IEEE 39 bus">IEEE 39 bus</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20squares%20support%20vector%20machine" title=" least squares support vector machine"> least squares support vector machine</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20vector%20quantization" title=" learning vector quantization"> learning vector quantization</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20collapse" title=" voltage collapse"> voltage collapse</a> </p> <a href="https://publications.waset.org/abstracts/11211/voltage-problem-location-classification-using-performance-of-least-squares-support-vector-machine-ls-svm-and-learning-vector-quantization-lvq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11211.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">441</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1128</span> The Boundary Element Method in Excel for Teaching Vector Calculus and Simulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stephen%20Kirkup">Stephen Kirkup</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses the implementation of the boundary element method (BEM) on an Excel spreadsheet and how it can be used in teaching vector calculus and simulation. There are two separate spreadheets, within which Laplace equation is solved by the BEM in two dimensions (LIBEM2) and axisymmetric three dimensions (LBEMA). The main algorithms are implemented in the associated programming language within Excel, Visual Basic for Applications (VBA). The BEM only requires a boundary mesh and hence it is a relatively accessible method. The BEM in the open spreadsheet environment is demonstrated as being useful as an aid to teaching and learning. The application of the BEM implemented on a spreadsheet for educational purposes in introductory vector calculus and simulation is explored. The development of assignment work is discussed, and sample results from student work are given. The spreadsheets were found to be useful tools in developing the students’ understanding of vector calculus and in simulating heat conduction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=boundary%20element%20method" title="boundary element method">boundary element method</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplace%E2%80%99s%20equation" title=" Laplace’s equation"> Laplace’s equation</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20calculus" title=" vector calculus"> vector calculus</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=education" title=" education"> education</a> </p> <a href="https://publications.waset.org/abstracts/95383/the-boundary-element-method-in-excel-for-teaching-vector-calculus-and-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95383.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1127</span> Performance of Total Vector Error of an Estimated Phasor within Local Area Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Abdolkhalig">Ahmed Abdolkhalig</a>, <a href="https://publications.waset.org/abstracts/search?q=Rastko%20Zivanovic"> Rastko Zivanovic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper evaluates the Total Vector Error of an estimated Phasor as define in IEEE C37.118 standard within different medium access in Local Area Networks (LAN). Three different LAN models (CSMA/CD, CSMA/AMP, and Switched Ethernet) are evaluated. The Total Vector Error of the estimated Phasor has been evaluated for the effect of Nodes Number under the standardized network Band-width values defined in IEC 61850-9-2 communication standard (i.e. 0.1, 1, and 10 Gbps). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=phasor" title="phasor">phasor</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20area%20network" title=" local area network"> local area network</a>, <a href="https://publications.waset.org/abstracts/search?q=total%20vector%20error" title=" total vector error"> total vector error</a>, <a href="https://publications.waset.org/abstracts/search?q=IEEE%20C37.118" title=" IEEE C37.118"> IEEE C37.118</a>, <a href="https://publications.waset.org/abstracts/search?q=IEC%2061850" title=" IEC 61850"> IEC 61850</a> </p> <a href="https://publications.waset.org/abstracts/5655/performance-of-total-vector-error-of-an-estimated-phasor-within-local-area-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5655.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">311</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1126</span> Neural Correlates of Decision-Making Under Ambiguity and Conflict </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Helen%20Pushkarskaya">Helen Pushkarskaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Smithson"> Michael Smithson</a>, <a href="https://publications.waset.org/abstracts/search?q=Jane%20E.%20Joseph"> Jane E. Joseph</a>, <a href="https://publications.waset.org/abstracts/search?q=Christine%20Corbly"> Christine Corbly</a>, <a href="https://publications.waset.org/abstracts/search?q=Ifat%20Levy"> Ifat Levy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Studies of decision making under uncertainty generally focus on imprecise information about outcome probabilities (“ambiguity”). It is not clear, however, whether conflicting information about outcome probabilities affects decision making in the same manner as ambiguity does. Here we combine functional Magnetic Resonance Imaging (fMRI) and a simple gamble design to study this question. In this design, the levels of ambiguity and conflict are parametrically varied, and ambiguity and conflict gambles are matched on both expected value and variance. Behaviorally, participants avoided conflict more than ambiguity, and attitudes toward ambiguity and conflict did not correlate across subjects. Neurally, regional brain activation was differentially modulated by ambiguity level and aversion to ambiguity and by conflict level and aversion to conflict. Activation in the medial prefrontal cortex was correlated with the level of ambiguity and with ambiguity aversion, whereas activation in the ventral striatum was correlated with the level of conflict and with conflict aversion. This novel double dissociation indicates that decision makers process imprecise and conflicting information differently, a finding that has important implications for basic and clinical research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decision%20making" title="decision making">decision making</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title=" uncertainty"> uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=ambiguity" title=" ambiguity"> ambiguity</a>, <a href="https://publications.waset.org/abstracts/search?q=conflict" title=" conflict"> conflict</a>, <a href="https://publications.waset.org/abstracts/search?q=fMRI" title=" fMRI"> fMRI</a> </p> <a href="https://publications.waset.org/abstracts/27681/neural-correlates-of-decision-making-under-ambiguity-and-conflict" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27681.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">564</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1125</span> Volume Density of Power of Multivector Electric Machine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aldan%20A.%20Sapargaliyev">Aldan A. Sapargaliyev</a>, <a href="https://publications.waset.org/abstracts/search?q=Yerbol%20A.%20Sapargaliyev"> Yerbol A. Sapargaliyev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the invention, the electric machine (EM) can be defined as oEM – one-vector electric machine, as it works due to one-vector inductive coupling with use of one-vector electromagnet. The disadvantages of oEM are large size and limited efficiency at low and medium power applications. This paper describes multi-vector electric machine (mEM) based on multi-vector inductive coupling, which is characterized by the increased surface area of the inductive coupling per EM volume, with a reduced share of inefficient and energy-consuming part of the winding, in comparison with oEM’s. Particularly, it is considered, calculated and compared the performance of three different electrical motors and their power at the same volumes and rotor frequencies. It is also presented the result of calculation of correlation between power density and volume for oEM and mEM. The method of multi-vector inductive coupling enables mEM to possess 1.5-4.0 greater density of power per volume and significantly higher efficiency, in comparison with today’s oEM, especially in low and medium power applications. mEM has distinct advantages, when used in transport vehicles such as electric cars and aircrafts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20machine" title="electric machine">electric machine</a>, <a href="https://publications.waset.org/abstracts/search?q=electric%20motor" title=" electric motor"> electric motor</a>, <a href="https://publications.waset.org/abstracts/search?q=electromagnet" title=" electromagnet"> electromagnet</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency%20of%20electric%20motor" title=" efficiency of electric motor"> efficiency of electric motor</a> </p> <a href="https://publications.waset.org/abstracts/67282/volume-density-of-power-of-multivector-electric-machine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67282.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">338</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1124</span> Support Vector Regression with Weighted Least Absolute Deviations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kang-Mo%20Jung">Kang-Mo Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Least squares support vector machine (LS-SVM) is a penalized regression which considers both fitting and generalization ability of a model. However, the squared loss function is very sensitive to even single outlier. We proposed a weighted absolute deviation loss function for the robustness of the estimates in least absolute deviation support vector machine. The proposed estimates can be obtained by a quadratic programming algorithm. Numerical experiments on simulated datasets show that the proposed algorithm is competitive in view of robustness to outliers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=least%20absolute%20deviation" title="least absolute deviation">least absolute deviation</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20programming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=robustness" title=" robustness"> robustness</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machine" title=" support vector machine"> support vector machine</a>, <a href="https://publications.waset.org/abstracts/search?q=weight" title=" weight"> weight</a> </p> <a href="https://publications.waset.org/abstracts/23674/support-vector-regression-with-weighted-least-absolute-deviations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23674.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">527</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1123</span> A Comparative Study of Series-Connected Two-Motor Drive Fed by a Single Inverter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Djahbar">A. Djahbar</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Bounadja"> E. Bounadja</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Zegaoui"> A. Zegaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Allouache"> H. Allouache</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, vector control of a series-connected two-machine drive system fed by a single inverter (CSI/VSI) is presented. The two stator windings of both machines are connected in series while the rotors may be connected to different loads, are called series-connected two-machine drive. Appropriate phase transposition is introduced while connecting the series stator winding to obtain decoupled control the two-machines. The dynamic decoupling of each machine from the group is obtained using the vector control algorithm. The independent control is demonstrated by analyzing the characteristics of torque and speed of each machine obtained via simulation under vector control scheme. The viability of the control techniques is proved using analytically and simulation approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=drives" title="drives">drives</a>, <a href="https://publications.waset.org/abstracts/search?q=inverter" title=" inverter"> inverter</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-phase%20induction%20machine" title=" multi-phase induction machine"> multi-phase induction machine</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20control" title=" vector control"> vector control</a> </p> <a href="https://publications.waset.org/abstracts/42943/a-comparative-study-of-series-connected-two-motor-drive-fed-by-a-single-inverter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42943.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">480</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1122</span> Diagonal Vector Autoregressive Models and Their Properties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Usoro%20Anthony%20E.">Usoro Anthony E.</a>, <a href="https://publications.waset.org/abstracts/search?q=Udoh%20Emediong"> Udoh Emediong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Diagonal Vector Autoregressive Models are special classes of the general vector autoregressive models identified under certain conditions, where parameters are restricted to the diagonal elements in the coefficient matrices. Variance, autocovariance, and autocorrelation properties of the upper and lower diagonal VAR models are derived. The new set of VAR models is verified with empirical data and is found to perform favourably with the general VAR models. The advantage of the diagonal models over the existing models is that the new models are parsimonious, given the reduction in the interactive coefficients of the general VAR models. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=VAR%20models" title="VAR models">VAR models</a>, <a href="https://publications.waset.org/abstracts/search?q=diagonal%20VAR%20models" title=" diagonal VAR models"> diagonal VAR models</a>, <a href="https://publications.waset.org/abstracts/search?q=variance" title=" variance"> variance</a>, <a href="https://publications.waset.org/abstracts/search?q=autocovariance" title=" autocovariance"> autocovariance</a>, <a href="https://publications.waset.org/abstracts/search?q=autocorrelations" title=" autocorrelations"> autocorrelations</a> </p> <a href="https://publications.waset.org/abstracts/157980/diagonal-vector-autoregressive-models-and-their-properties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157980.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">116</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1121</span> Improving Cheon-Kim-Kim-Song (CKKS) Performance with Vector Computation and GPU Acceleration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Smaran%20Manchala">Smaran Manchala</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Homomorphic Encryption (HE) enables computations on encrypted data without requiring decryption, mitigating data vulnerability during processing. Usable Fully Homomorphic Encryption (FHE) could revolutionize secure data operations across cloud computing, AI training, and healthcare, providing both privacy and functionality, however, the computational inefficiency of schemes like Cheon-Kim-Kim-Song (CKKS) hinders their widespread practical use. This study focuses on optimizing CKKS for faster matrix operations through the implementation of vector computation parallelization and GPU acceleration. The variable effects of vector parallelization on GPUs were explored, recognizing that while parallelization typically accelerates operations, it could introduce overhead that results in slower runtimes, especially in smaller, less computationally demanding operations. To assess performance, two neural network models, MLPN and CNN—were tested on the MNIST dataset using both ARM and x86-64 architectures, with CNN chosen for its higher computational demands. Each test was repeated 1,000 times, and outliers were removed via Z-score analysis to measure the effect of vector parallelization on CKKS performance. Model accuracy was also evaluated under CKKS encryption to ensure optimizations did not compromise results. According to the results of the trail runs, applying vector parallelization had a 2.63X efficiency increase overall with a 1.83X performance increase for x86-64 over ARM architecture. Overall, these results suggest that the application of vector parallelization in tandem with GPU acceleration significantly improves the efficiency of CKKS even while accounting for vector parallelization overhead, providing impact in future zero trust operations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CKKS%20scheme" title="CKKS scheme">CKKS scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=runtime%20efficiency" title=" runtime efficiency"> runtime efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=fully%20homomorphic%20encryption%20%28FHE%29" title=" fully homomorphic encryption (FHE)"> fully homomorphic encryption (FHE)</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU%20acceleration" title=" GPU acceleration"> GPU acceleration</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20parallelization" title=" vector parallelization"> vector parallelization</a> </p> <a href="https://publications.waset.org/abstracts/192456/improving-cheon-kim-kim-song-ckks-performance-with-vector-computation-and-gpu-acceleration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192456.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">23</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1120</span> Open-Loop Vector Control of Induction Motor with Space Vector Pulse Width Modulation Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karchung">Karchung</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Ruangsinchaiwanich"> S. Ruangsinchaiwanich</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents open-loop vector control method of induction motor with space vector pulse width modulation (SVPWM) technique. Normally, the closed loop speed control is preferred and is believed to be more accurate. However, it requires a position sensor to track the rotor position which is not desirable to use it for certain workspace applications. This paper exhibits the performance of three-phase induction motor with the simplest control algorithm without the use of a position sensor nor an estimation block to estimate rotor position for sensorless control. The motor stator currents are measured and are transformed to synchronously rotating (d-q-axis) frame by use of Clarke and Park transformation. The actual control happens in this frame where the measured currents are compared with the reference currents. The error signal is fed to a conventional PI controller, and the corrected d-q voltage is generated. The controller outputs are transformed back to three phase voltages and are fed to SVPWM block which generates PWM signal for the voltage source inverter. The open loop vector control model along with SVPWM algorithm is modeled in MATLAB/Simulink software and is experimented and validated in TMS320F28335 DSP board. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20drive" title="electric drive">electric drive</a>, <a href="https://publications.waset.org/abstracts/search?q=induction%20motor" title=" induction motor"> induction motor</a>, <a href="https://publications.waset.org/abstracts/search?q=open-loop%20vector%20control" title=" open-loop vector control"> open-loop vector control</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20vector%20pulse%20width%20modulation%20technique" title=" space vector pulse width modulation technique"> space vector pulse width modulation technique</a> </p> <a href="https://publications.waset.org/abstracts/105539/open-loop-vector-control-of-induction-motor-with-space-vector-pulse-width-modulation-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105539.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">147</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1119</span> Using New Machine Algorithms to Classify Iranian Musical Instruments According to Temporal, Spectral and Coefficient Features</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ronak%20Khosravi">Ronak Khosravi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmood%20Abbasi%20Layegh"> Mahmood Abbasi Layegh</a>, <a href="https://publications.waset.org/abstracts/search?q=Siamak%20Haghipour"> Siamak Haghipour</a>, <a href="https://publications.waset.org/abstracts/search?q=Avin%20Esmaili"> Avin Esmaili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a study on classification of musical woodwind instruments using a small set of features selected from a broad range of extracted ones by the sequential forward selection method was carried out. Firstly, we extract 42 features for each record in the music database of 402 sound files belonging to five different groups of Flutes (end blown and internal duct), Single –reed, Double –reed (exposed and capped), Triple reed and Quadruple reed. Then, the sequential forward selection method is adopted to choose the best feature set in order to achieve very high classification accuracy. Two different classification techniques of support vector machines and relevance vector machines have been tested out and an accuracy of up to 96% can be achieved by using 21 time, frequency and coefficient features and relevance vector machine with the Gaussian kernel function. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coefficient%20features" title="coefficient features">coefficient features</a>, <a href="https://publications.waset.org/abstracts/search?q=relevance%20vector%20machines" title=" relevance vector machines"> relevance vector machines</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20features" title=" spectral features"> spectral features</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machines" title=" support vector machines"> support vector machines</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20features" title=" temporal features"> temporal features</a> </p> <a href="https://publications.waset.org/abstracts/54321/using-new-machine-algorithms-to-classify-iranian-musical-instruments-according-to-temporal-spectral-and-coefficient-features" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54321.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">321</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1118</span> A Deletion-Cost Based Fast Compression Algorithm for Linear Vector Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiuxiao%20Chen">Qiuxiao Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Hou"> Yan Hou</a>, <a href="https://publications.waset.org/abstracts/search?q=Ning%20Wu"> Ning Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As there are deficiencies of the classic Douglas-Peucker Algorithm (DPA), such as high risks of deleting key nodes by mistake, high complexity, time consumption and relatively slow execution speed, a new Deletion-Cost Based Compression Algorithm (DCA) for linear vector data was proposed. For each curve — the basic element of linear vector data, all the deletion costs of its middle nodes were calculated, and the minimum deletion cost was compared with the pre-defined threshold. If the former was greater than or equal to the latter, all remaining nodes were reserved and the curve’s compression process was finished. Otherwise, the node with the minimal deletion cost was deleted, its two neighbors' deletion costs were updated, and the same loop on the compressed curve was repeated till the termination. By several comparative experiments using different types of linear vector data, the comparison between DPA and DCA was performed from the aspects of compression quality and computing efficiency. Experiment results showed that DCA outperformed DPA in compression accuracy and execution efficiency as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Douglas-Peucker%20algorithm" title="Douglas-Peucker algorithm">Douglas-Peucker algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20vector%20data" title=" linear vector data"> linear vector data</a>, <a href="https://publications.waset.org/abstracts/search?q=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/abstracts/search?q=deletion%20cost" title=" deletion cost"> deletion cost</a> </p> <a href="https://publications.waset.org/abstracts/8376/a-deletion-cost-based-fast-compression-algorithm-for-linear-vector-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8376.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">251</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1117</span> SVM-Based Modeling of Mass Transfer Potential of Multiple Plunging Jets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Surinder%20Deswal">Surinder Deswal</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahesh%20Pal"> Mahesh Pal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper investigates the potential of support vector machines based regression approach to model the mass transfer capacity of multiple plunging jets, both vertical (θ = 90°) and inclined (θ = 60°). The data set used in this study consists of four input parameters with a total of eighty eight cases. For testing, tenfold cross validation was used. Correlation coefficient values of 0.971 and 0.981 (root mean square error values of 0.0025 and 0.0020) were achieved by using polynomial and radial basis kernel functions based support vector regression respectively. Results suggest an improved performance by radial basis function in comparison to polynomial kernel based support vector machines. The estimated overall mass transfer coefficient, by both the kernel functions, is in good agreement with actual experimental values (within a scatter of ±15 %); thereby suggesting the utility of support vector machines based regression approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mass%20transfer" title="mass transfer">mass transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20plunging%20jets" title=" multiple plunging jets"> multiple plunging jets</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machines" title=" support vector machines"> support vector machines</a>, <a href="https://publications.waset.org/abstracts/search?q=ecological%20sciences" title=" ecological sciences"> ecological sciences</a> </p> <a href="https://publications.waset.org/abstracts/9906/svm-based-modeling-of-mass-transfer-potential-of-multiple-plunging-jets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9906.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">464</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1116</span> Using Cooperation Approaches at Different Levels of Artificial Bee Colony Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vahid%20Zeighami">Vahid Zeighami</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Ghsemi"> Mohsen Ghsemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Akbari"> Reza Akbari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, a Multi-Level Artificial Bee Colony (called MLABC) is presented. In MLABC two species are used. The first species employs n colonies in which each of the them optimizes the complete solution vector. The cooperation between these colonies is carried out by exchanging information through a leader colony, which contains a set of elite bees. The second species uses a cooperative approach in which the complete solution vector is divided to k sub-vectors, and each of these sub-vectors is optimized by a a colony. The cooperation between these colonies is carried out by compiling sub-vectors into the complete solution vector. Finally, the cooperation between two species is obtained by exchanging information between them. The proposed algorithm is tested on a set of well known test functions. The results show that MLABC algorithms provide efficiency and robustness to solve numerical functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony" title="artificial bee colony">artificial bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative" title=" cooperative"> cooperative</a>, <a href="https://publications.waset.org/abstracts/search?q=multilevel%20cooperation" title=" multilevel cooperation"> multilevel cooperation</a>, <a href="https://publications.waset.org/abstracts/search?q=vector" title=" vector"> vector</a> </p> <a href="https://publications.waset.org/abstracts/15646/using-cooperation-approaches-at-different-levels-of-artificial-bee-colony-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15646.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">446</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1115</span> Review on Quaternion Gradient Operator with Marginal and Vector Approaches for Colour Edge Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nadia%20Ben%20Youssef">Nadia Ben Youssef</a>, <a href="https://publications.waset.org/abstracts/search?q=Aicha%20Bouzid"> Aicha Bouzid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Gradient estimation is one of the most fundamental tasks in the field of image processing in general, and more particularly for color images since that the research in color image gradient remains limited. The widely used gradient method is Di Zenzo’s gradient operator, which is based on the measure of squared local contrast of color images. The proposed gradient mechanism, presented in this paper, is based on the principle of the Di Zenzo’s approach using quaternion representation. This edge detector is compared to a marginal approach based on multiscale product of wavelet transform and another vector approach based on quaternion convolution and vector gradient approach. The experimental results indicate that the proposed color gradient operator outperforms marginal approach, however, it is less efficient then the second vector approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gradient" title="gradient">gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20detection" title=" edge detection"> edge detection</a>, <a href="https://publications.waset.org/abstracts/search?q=color%20image" title=" color image"> color image</a>, <a href="https://publications.waset.org/abstracts/search?q=quaternion" title=" quaternion"> quaternion</a> </p> <a href="https://publications.waset.org/abstracts/141138/review-on-quaternion-gradient-operator-with-marginal-and-vector-approaches-for-colour-edge-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141138.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">234</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=38">38</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=39">39</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subnormal%20imprecise%20vector&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>