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: pseudorandom sequences</title> <meta name="description" content="Search results for: pseudorandom sequences"> <meta name="keywords" content="pseudorandom sequences"> <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="pseudorandom sequences" 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="pseudorandom sequences"> <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> 624</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: pseudorandom sequences</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">624</span> On the Analysis of Pseudorandom Partial Quotient Sequences Generated from Continued Fractions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Padma">T. Padma</a>, <a href="https://publications.waset.org/abstracts/search?q=Jayashree%20S.%20Pillai"> Jayashree S. Pillai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Random entities are an essential component in any cryptographic application. The suitability of a number theory based novel pseudorandom sequence called Pseudorandom Partial Quotient Sequence (PPQS) generated from the continued fraction expansion of irrational numbers, in cryptographic applications, is analyzed in this paper. An approach to build the algorithm around a hard mathematical problem has been considered. The PQ sequence is tested for randomness and its suitability as a cryptographic key by performing randomness analysis, key sensitivity and key space analysis, precision analysis and evaluating the correlation properties is established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences" title="pseudorandom sequences">pseudorandom sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20sensitivity" title=" key sensitivity"> key sensitivity</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=randomness%20analysis" title=" randomness analysis"> randomness analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/26665/on-the-analysis-of-pseudorandom-partial-quotient-sequences-generated-from-continued-fractions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26665.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">590</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">623</span> Constructing Orthogonal De Bruijn and Kautz Sequences and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yaw-Ling%20Lin">Yaw-Ling Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A de Bruijn graph of order k is a graph whose vertices representing all length-k sequences with edges joining pairs of vertices whose sequences have maximum possible overlap (length k−1). Every Hamiltonian cycle of this graph defines a distinct, minimum length de Bruijn sequence containing all k-mers exactly once. A Kautz sequence is the minimal generating sequence so as the sequence of minimal length that produces all possible length-k sequences with the restriction that every two consecutive alphabets in the sequences must be different. A collection of de Bruijn/Kautz sequences are orthogonal if any two sequences are of maximally differ in sequence composition; that is, the maximum length of their common substring is k. In this paper, we discuss how such a collection of (maximal) orthogonal de Bruijn/Kautz sequences can be made and use the algorithm to build up a web application service for the synthesized DNA and other related biomolecular sequences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biomolecular%20sequence%20synthesis" title="biomolecular sequence synthesis">biomolecular sequence synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=de%20Bruijn%20sequences" title=" de Bruijn sequences"> de Bruijn sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=Eulerian%20cycle" title=" Eulerian cycle"> Eulerian cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle" title=" Hamiltonian cycle"> Hamiltonian cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=Kautz%20sequences" title=" Kautz sequences"> Kautz sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=orthogonal%20sequences" title=" orthogonal sequences"> orthogonal sequences</a> </p> <a href="https://publications.waset.org/abstracts/121912/constructing-orthogonal-de-bruijn-and-kautz-sequences-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/121912.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">166</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">622</span> A Comprehensive Analysis of the Phylogenetic Signal in Ramp Sequences in 211 Vertebrates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lauren%20M.%20McKinnon">Lauren M. McKinnon</a>, <a href="https://publications.waset.org/abstracts/search?q=Justin%20B.%20Miller"> Justin B. Miller</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20F.%20Whiting"> Michael F. Whiting</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20S.%20K.%20Kauwe"> John S. K. Kauwe</a>, <a href="https://publications.waset.org/abstracts/search?q=Perry%20G.%20Ridge"> Perry G. Ridge</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Ramp sequences increase translational speed and accuracy when rare, slowly-translated codons are found at the beginnings of genes. Here, the results of the first analysis of ramp sequences in a phylogenetic construct are presented. Methods: Ramp sequences were compared from 211 vertebrates (110 Mammalian and 101 non-mammalian). The presence and absence of ramp sequences were analyzed as a binary character in a parsimony and maximum likelihood framework. Additionally, ramp sequences were mapped to the Open Tree of Life taxonomy to determine the number of parallelisms and reversals that occurred, and these results were compared to what would be expected due to random chance. Lastly, aligned nucleotides in ramp sequences were compared to the rest of the sequence in order to examine possible differences in phylogenetic signal between these regions of the gene. Results: Parsimony and maximum likelihood analyses of the presence/absence of ramp sequences recovered phylogenies that are highly congruent with established phylogenies. Additionally, the retention index of ramp sequences is significantly higher than would be expected due to random chance (p-value = 0). A chi-square analysis of completely orthologous ramp sequences resulted in a p-value of approximately zero as compared to random chance. Discussion: Ramp sequences recover comparable phylogenies as other phylogenomic methods. Although not all ramp sequences appear to have a phylogenetic signal, more ramp sequences track speciation than expected by random chance. Therefore, ramp sequences may be used in conjunction with other phylogenomic approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=codon%20usage%20bias" title="codon usage bias">codon usage bias</a>, <a href="https://publications.waset.org/abstracts/search?q=phylogenetics" title=" phylogenetics"> phylogenetics</a>, <a href="https://publications.waset.org/abstracts/search?q=phylogenomics" title=" phylogenomics"> phylogenomics</a>, <a href="https://publications.waset.org/abstracts/search?q=ramp%20sequence" title=" ramp sequence"> ramp sequence</a> </p> <a href="https://publications.waset.org/abstracts/124024/a-comprehensive-analysis-of-the-phylogenetic-signal-in-ramp-sequences-in-211-vertebrates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124024.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">161</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">621</span> Robust Quantum Image Encryption Algorithm Leveraging 3D-BNM Chaotic Maps and Controlled Qubit-Level Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vivek%20Verma">Vivek Verma</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjeev%20Kumar"> Sanjeev Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a novel quantum image encryption algorithm, using a 3D chaotic map and controlled qubit-level scrambling operations. The newly proposed 3D-BNM chaotic map effectively reduces the degradation of chaotic dynamics resulting from the finite word length effect. It facilitates the generation of highly unpredictable random sequences and enhances chaotic performance. The system’s efficacy is additionally enhanced by the inclusion of a SHA-256 hash function. Initially, classical plain images are converted into their quantum equivalents using the Novel Enhanced Quantum Representation (NEQR) model. The Generalized Quantum Arnold Transformation (GQAT) is then applied to disrupt the coordinate information of the quantum image. Subsequently, to diffuse the pixel values of the scrambled image, XOR operations are performed using pseudorandom sequences generated by the 3D-BNM chaotic map. Furthermore, to enhance the randomness and reduce the correlation among the pixels in the resulting cipher image, a controlled qubit-level scrambling operation is employed. The encryption process utilizes fundamental quantum gates such as C-NOT and CCNOT. Both theoretical and numerical simulations validate the effectiveness of the proposed algorithm against various statistical and differential attacks. Moreover, the proposed encryption algorithm operates with low computational complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3D%20Chaotic%20map" title="3D Chaotic map">3D Chaotic map</a>, <a href="https://publications.waset.org/abstracts/search?q=SHA-256" title=" SHA-256"> SHA-256</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20image%20encryption" title=" quantum image encryption"> quantum image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Qubit%20level%20scrambling" title=" Qubit level scrambling"> Qubit level scrambling</a>, <a href="https://publications.waset.org/abstracts/search?q=NEQR" title=" NEQR"> NEQR</a> </p> <a href="https://publications.waset.org/abstracts/193776/robust-quantum-image-encryption-algorithm-leveraging-3d-bnm-chaotic-maps-and-controlled-qubit-level-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193776.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">10</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">620</span> Advances on the Understanding of Sequence Convergence Seen from the Perspective of Mathematical Working Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paula%20Verdugo-Hernandez">Paula Verdugo-Hernandez</a>, <a href="https://publications.waset.org/abstracts/search?q=Patricio%20Cumsille"> Patricio Cumsille</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We analyze a first-class on the convergence of real number sequences, named hereafter sequences, to foster exploration and discovery of concepts through graphical representations before engaging students in proving. The main goal was to differentiate between sequences and continuous functions-of-a-real-variable and better understand concepts at an initial stage. We applied the analytic frame of mathematical working spaces, which we expect to contribute to extending to sequences since, as far as we know, it has only developed for other objects, and which is relevant to analyze how mathematical work is built systematically by connecting the epistemological and cognitive perspectives, and involving the semiotic, instrumental, and discursive dimensions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergence" title="convergence">convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=graphical%20representations" title=" graphical representations"> graphical representations</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20working%20spaces" title=" mathematical working spaces"> mathematical working spaces</a>, <a href="https://publications.waset.org/abstracts/search?q=paradigms%20of%20real%20analysis" title=" paradigms of real analysis"> paradigms of real analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20number%20sequences" title=" real number sequences"> real number sequences</a> </p> <a href="https://publications.waset.org/abstracts/133407/advances-on-the-understanding-of-sequence-convergence-seen-from-the-perspective-of-mathematical-working-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133407.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">143</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">619</span> Design and Implementation of Pseudorandom Number Generator Using Android Sensors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mochamad%20Beta%20Auditama">Mochamad Beta Auditama</a>, <a href="https://publications.waset.org/abstracts/search?q=Yusuf%20Kurniawan"> Yusuf Kurniawan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A smartphone or tablet require a strong randomness to establish secure encrypted communication, encrypt files, etc. Therefore, random number generation is one of the main keys to provide secrecy. Android devices are equipped with hardware-based sensors, such as accelerometer, gyroscope, etc. Each of these sensors provides a stochastic process which has a potential to be used as an extra randomness source, in addition to /dev/random and /dev/urandom pseudorandom number generators. Android sensors can provide randomness automatically. To obtain randomness from Android sensors, each one of Android sensors shall be used to construct an entropy source. After all entropy sources are constructed, output from these entropy sources are combined to provide more entropy. Then, a deterministic process is used to produces a sequence of random bits from the combined output. All of these processes are done in accordance with NIST SP 800-22 and the series of NIST SP 800-90. The operation conditions are done 1) on Android user-space, and 2) the Android device is placed motionless on a desk. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Android%20hardware-based%20sensor" title="Android hardware-based sensor">Android hardware-based sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=deterministic%20process" title=" deterministic process"> deterministic process</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy%20source" title=" entropy source"> entropy source</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20number%20generation%2Fgenerators" title=" random number generation/generators"> random number generation/generators</a> </p> <a href="https://publications.waset.org/abstracts/64995/design-and-implementation-of-pseudorandom-number-generator-using-android-sensors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64995.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">374</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">618</span> Deterministic Random Number Generator Algorithm for Cryptosystem Keys</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adi%20A.%20Maaita">Adi A. Maaita</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamza%20A.%20A.%20Al%20Sewadi"> Hamza A. A. Al Sewadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the crucial parameters of digital cryptographic systems is the selection of the keys used and their distribution. The randomness of the keys has a strong impact on the system’s security strength being difficult to be predicted, guessed, reproduced or discovered by a cryptanalyst. Therefore, adequate key randomness generation is still sought for the benefit of stronger cryptosystems. This paper suggests an algorithm designed to generate and test pseudo random number sequences intended for cryptographic applications. This algorithm is based on mathematically manipulating a publically agreed upon information between sender and receiver over a public channel. This information is used as a seed for performing some mathematical functions in order to generate a sequence of pseudorandom numbers that will be used for encryption/decryption purposes. This manipulation involves permutations and substitutions that fulfills Shannon’s principle of “confusion and diffusion”. ASCII code characters wereutilized in the generation process instead of using bit strings initially, which adds more flexibility in testing different seed values. Finally, the obtained results would indicate sound difficulty of guessing keys by attackers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystems" title="cryptosystems">cryptosystems</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20security%20agreement" title=" information security agreement"> information security agreement</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20distribution" title=" key distribution"> key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20numbers" title=" random numbers"> random numbers</a> </p> <a href="https://publications.waset.org/abstracts/24886/deterministic-random-number-generator-algorithm-for-cryptosystem-keys" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24886.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">268</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">617</span> A Geometrical Perspective on the Insulin Evolution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yuhei%20Kunihiro">Yuhei Kunihiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Sorin%20V.%20Sabau"> Sorin V. Sabau</a>, <a href="https://publications.waset.org/abstracts/search?q=Kazuhiro%20Shibuya"> Kazuhiro Shibuya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the molecular evolution of insulin from the metric geometry point of view. In mathematics, and particularly in geometry, distances and metrics between objects are of fundamental importance. Using a weaker notion than the classical distance, namely the weighted quasi-metrics, one can study the geometry of biological sequences (DNA, mRNA, or proteins) space. We analyze from the geometrical point of view a family of 60 insulin homologous sequences ranging on a large variety of living organisms from human to the nematode C. elegans. We show that the distances between sequences provide important information about the evolution and function of insulin. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=metric%20geometry" title="metric geometry">metric geometry</a>, <a href="https://publications.waset.org/abstracts/search?q=evolution" title=" evolution"> evolution</a>, <a href="https://publications.waset.org/abstracts/search?q=insulin" title=" insulin"> insulin</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20elegans" title=" C. elegans "> C. elegans </a> </p> <a href="https://publications.waset.org/abstracts/1430/a-geometrical-perspective-on-the-insulin-evolution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1430.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">336</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">616</span> Analysis on Thermococcus achaeans with Frequent Pattern Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jeongyeob%20Hong">Jeongyeob Hong</a>, <a href="https://publications.waset.org/abstracts/search?q=Myeonghoon%20Park"> Myeonghoon Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Taeson%20Yoon"> Taeson Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> After the advent of Achaeans which utilize different metabolism pathway and contain conspicuously different cellular structure, they have been recognized as possible materials for developing quality of human beings. Among diverse Achaeans, in this paper, we compared 16s RNA Sequences of four different species of Thermococcus: Achaeans genus specialized in sulfur-dealing metabolism. Four Species, Barophilus, Kodakarensis, Hydrothermalis, and Onnurineus, live near the hydrothermal vent that emits extreme amount of sulfur and heat. By comparing ribosomal sequences of aforementioned four species, we found similarities in their sequences and expressed protein, enabling us to expect that certain ribosomal sequence or proteins are vital for their survival. Apriori algorithms and Decision Tree were used. for comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Achaeans" title="Achaeans">Achaeans</a>, <a href="https://publications.waset.org/abstracts/search?q=Thermococcus" title=" Thermococcus"> Thermococcus</a>, <a href="https://publications.waset.org/abstracts/search?q=apriori%20algorithm" title=" apriori algorithm"> apriori algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20tree" title=" decision tree"> decision tree</a> </p> <a href="https://publications.waset.org/abstracts/30046/analysis-on-thermococcus-achaeans-with-frequent-pattern-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30046.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">290</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">615</span> Molecular Characterization and Phylogenetic Analysis of Influenza a(H3N2) Virus Circulating during the 2010-2011 in Riyadh, Saudi Arabia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghazanfar%20Ali">Ghazanfar Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Fahad%20N%20Almajhdi"> Fahad N Almajhdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study provides data on the viral diagnosis and molecular epidemiology of influenza A(H3N2) virus isolated in Riyadh, Saudi Arabia. Nasopharyngeal aspirates from 80 clinically infected patients in the peak of the 2010-2011 winter seasons were processed for viral diagnosis by RT-PCR. Sequencing of entire HA and NA genes of representative isolates and molecular epidemiological analysis were performed. A total of 06 patients were positive for influenza A, B and respiratory syncytial viruses by RT-PCR assays; out of these only one sample was positive for influenza A(H3N2) by RT-PCR. Phylogenetic analysis of the HA and NA gene sequences showed identities higher than 99-98.8 % in both genes. They were also similar to reference isolates in HA sequences (99 % identity) and in NA sequences (99 % identity). Amino acid sequences predicted for the HA gene were highly identical to reference strains. The NA amino acid substitutions identified did not include the oseltamivir-resistant H275Y substitution. Conclusion: Viral isolation and RT-PCR together were useful for diagnosis of the influenza A (H3N2) virus. Variations in HA and NA sequences are similar to those identified in worldwide reference isolates and no drug resistance was found. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=influenza%20A%20%28H3N2%29" title="influenza A (H3N2)">influenza A (H3N2)</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20characterization" title=" genetic characterization"> genetic characterization</a>, <a href="https://publications.waset.org/abstracts/search?q=viral%20isolation" title=" viral isolation"> viral isolation</a>, <a href="https://publications.waset.org/abstracts/search?q=RT-PCR" title=" RT-PCR"> RT-PCR</a>, <a href="https://publications.waset.org/abstracts/search?q=Saudi%20Arabia" title=" Saudi Arabia "> Saudi Arabia </a> </p> <a href="https://publications.waset.org/abstracts/17317/molecular-characterization-and-phylogenetic-analysis-of-influenza-ah3n2-virus-circulating-during-the-2010-2011-in-riyadh-saudi-arabia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17317.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">262</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">614</span> Identification and Differentiation of Fagonia Arabica and Fagonia Indica by Using DNA Barcode Region Matk</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Noshaba%20Dilbar">Noshaba Dilbar</a>, <a href="https://publications.waset.org/abstracts/search?q=Aisha%20Tahir"> Aisha Tahir</a>, <a href="https://publications.waset.org/abstracts/search?q=Amer%20Jamil"> Amer Jamil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> During the last decade, DNA barcoding proved to be an authentic tool for discovery and identification of plants. In the present study, DNA barcoding of two species, Fagonia arabica and Fagonia indica was done for differentiation by using matK region. matK gene is considered as a universal barcode because of its easy alignment and high discrimination ability. In this study, matK yielded 100% sequencing results. The sequences from both plants were aligned at clustal W and observed that there is no nucleotide variation and polymorphism among both sequences. This was further analysed by BLAST which showed the similar sequences from different plants belonging to same family but didn’t find sequence of both species. Considering this, the resulted sequence was submitted by the name of Fagonia arabica with accession number KM276890. In the end, we analysed the results from BOLD which gave us the final conclusion that both plants are same as their matK sequences are 100% identical. In literature, both Fagonia indica and Fagonia arabica names are used for this plant but there is no clear differentiation has been observed in these plants. Results evaluate that Fagonia indica and Fagonia arabica are the alternative names of same plant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DNA%20barcoding" title="DNA barcoding">DNA barcoding</a>, <a href="https://publications.waset.org/abstracts/search?q=Fagonia%20arabica" title=" Fagonia arabica"> Fagonia arabica</a>, <a href="https://publications.waset.org/abstracts/search?q=Fagonia%20indica" title=" Fagonia indica"> Fagonia indica</a>, <a href="https://publications.waset.org/abstracts/search?q=matK" title=" matK"> matK</a> </p> <a href="https://publications.waset.org/abstracts/122682/identification-and-differentiation-of-fagonia-arabica-and-fagonia-indica-by-using-dna-barcode-region-matk" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122682.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">153</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">613</span> Dual-Network Memory Model for Temporal Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Motonobu%20Hattori">Motonobu Hattori</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In neural networks, when new patters are learned by a network, they radically interfere with previously stored patterns. This drawback is called catastrophic forgetting. We have already proposed a biologically inspired dual-network memory model which can much reduce this forgetting for static patterns. In this model, information is ﬁrst stored in the hippocampal network, and thereafter, it is transferred to the neocortical network using pseudo patterns. Because, temporal sequence learning is more important than static pattern learning in the real world, in this study, we improve our conventional dual-network memory model so that it can deal with temporal sequences without catastrophic forgetting. The computer simulation results show the effectiveness of the proposed dual-network memory model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=catastrophic%20forgetting" title="catastrophic forgetting">catastrophic forgetting</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-network" title=" dual-network"> dual-network</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20sequences" title=" temporal sequences"> temporal sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=hippocampal" title=" hippocampal "> hippocampal </a> </p> <a href="https://publications.waset.org/abstracts/2908/dual-network-memory-model-for-temporal-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2908.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">269</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">612</span> A Similarity/Dissimilarity Measure to Biological Sequence Alignment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20A.%20Khan">Muhammad A. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Waseem%20Shahzad"> Waseem Shahzad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Analysis of protein sequences is carried out for the purpose to discover their structural and ancestry relationship. Sequence similarity determines similar protein structures, similar function, and homology detection. Biological sequences composed of amino acid residues or nucleotides provide significant information through sequence alignment. In this paper, we present a new similarity/dissimilarity measure to sequence alignment based on the primary structure of a protein. The approach finds the distance between the two given sequences using the novel sequence alignment algorithm and a mathematical model. The algorithm runs at a time complexity of O(n²). A distance matrix is generated to construct a phylogenetic tree of different species. The new similarity/dissimilarity measure outperforms other existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alignment" title="alignment">alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=distance" title=" distance"> distance</a>, <a href="https://publications.waset.org/abstracts/search?q=homology" title=" homology"> homology</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20model" title=" mathematical model"> mathematical model</a>, <a href="https://publications.waset.org/abstracts/search?q=phylogenetic%20tree" title=" phylogenetic tree"> phylogenetic tree</a> </p> <a href="https://publications.waset.org/abstracts/95183/a-similaritydissimilarity-measure-to-biological-sequence-alignment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95183.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">178</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">611</span> Fat-Tail Test of Regulatory DNA Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian-Jun%20Shu">Jian-Jun Shu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The statistical properties of CRMs are explored by estimating similar-word set occurrence distribution. It is observed that CRMs tend to have a fat-tail distribution for similar-word set occurrence. Thus, the fat-tail test with two fatness coefficients is proposed to distinguish CRMs from non-CRMs, especially from exons. For the first fatness coefficient, the separation accuracy between CRMs and exons is increased as compared with the existing content-based CRM prediction method – fluffy-tail test. For the second fatness coefficient, the computing time is reduced as compared with fluffy-tail test, making it very suitable for long sequences and large data-base analysis in the post-genome time. Moreover, these indexes may be used to predict the CRMs which have not yet been observed experimentally. This can serve as a valuable filtering process for experiment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=statistical%20approach" title="statistical approach">statistical approach</a>, <a href="https://publications.waset.org/abstracts/search?q=transcription%20factor%20binding%20sites" title=" transcription factor binding sites"> transcription factor binding sites</a>, <a href="https://publications.waset.org/abstracts/search?q=cis-regulatory%20modules" title=" cis-regulatory modules"> cis-regulatory modules</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20sequences" title=" DNA sequences"> DNA sequences</a> </p> <a href="https://publications.waset.org/abstracts/41863/fat-tail-test-of-regulatory-dna-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41863.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">290</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">610</span> Molecular Characterization of Ovine Herpesvirus 2 Strains Based on Selected Glycoprotein and Tegument Genes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fulufhelo%20Amanda%20Doboro">Fulufhelo Amanda Doboro</a>, <a href="https://publications.waset.org/abstracts/search?q=Kgomotso%20Sebeko"> Kgomotso Sebeko</a>, <a href="https://publications.waset.org/abstracts/search?q=Stephen%20Njiro"> Stephen Njiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Moritz%20Van%20Vuuren"> Moritz Van Vuuren </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ovine herpesvirus 2 (OvHV-2) genome obtained from the lymphopblastoid cell line of a BJ1035 cow was recently sequenced in the United States of America (USA). Information on the sequences of OvHV-2 genes obtained from South African strains from bovine or other African countries and molecular characterization of OvHV-2 is not documented. Present investigation provides information on the nucleotide and derived amino acid sequences and genetic diversity of Ov 7, Ov 8 ex2, ORF 27 and ORF 73 genes, of these genes from OvHV-2 strains circulating in South Africa. Gene-specific primers were designed and used for PCR of DNA extracted from 42 bovine blood samples that previously tested positive for OvHV-2. The expected PCR products of 495 bp, 253 bp, 890 bp and 1632 bp respectively for Ov 7, Ov 8 ex2, ORF 27 and ORF 73 genes were sequenced and multiple sequence analysis done on the selected regions of the sequenced PCR products. Two genotypes for ORF 27 and ORF 73 gene sequences, and three genotypes for Ov 7 and Ov 8 ex2 gene sequences were identified, and similar groupings for the derived amino acid sequences were obtained for each gene. Nucleotide and amino acid sequence variations that led to the identification of the different genotypes included SNPs, deletions and insertions. Sequence analysis of Ov 7 and ORF 27 genes revealed variations that distinguished between sequences from SA and reference OvHV-2 strains. The implication of geographic origin among SA sequences was difficult to evaluate because of random distribution of genotypes in the different provinces, for each gene. However, socio-economic factors such as migration of people with animals, or transportation of animals for agricultural or business use from one province to another are most likely to be responsible for this observation. The sequence variations observed in this study have no impact on the antibody binding activities of glycoproteins encoded by Ov 7, Ov 8 ex2 and ORF 27 genes, as determined by prediction of the presence of B cell epitopes using BepiPred 1.0. The findings of this study will be used for selection of gene candidates for the development of diagnostic assays and vaccine development as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=amino%20acid" title="amino acid">amino acid</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20diversity" title=" genetic diversity"> genetic diversity</a>, <a href="https://publications.waset.org/abstracts/search?q=genes" title=" genes"> genes</a>, <a href="https://publications.waset.org/abstracts/search?q=nucleotide" title=" nucleotide"> nucleotide</a> </p> <a href="https://publications.waset.org/abstracts/29282/molecular-characterization-of-ovine-herpesvirus-2-strains-based-on-selected-glycoprotein-and-tegument-genes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29282.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">489</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">609</span> Approximation of Analytic Functions of Several Variables by Linear K-Positive Operators in the Closed Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tulin%20Coskun">Tulin Coskun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We investigate the approximation of analytic functions of several variables in polydisc by the sequences of linear k-positive operators in Gadjiev sence. The approximation of analytic functions of complex variable by linear k-positive operators was tackled, and k-positive operators and formulated theorems of Korovkin's type for these operators in the space of analytic functions on the unit disc were introduced in the past. Recently, very general results on convergence of the sequences of linear k-positive operators on a simply connected bounded domain within the space of analytic functions were proved. In this presentation, we extend some of these results to the approximation of analytic functions of several complex variables by sequences of linear k-positive operators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytic%20functions" title="analytic functions">analytic functions</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation%20of%20analytic%20functions" title=" approximation of analytic functions"> approximation of analytic functions</a>, <a href="https://publications.waset.org/abstracts/search?q=Linear%20k-positive%20operators" title=" Linear k-positive operators"> Linear k-positive operators</a>, <a href="https://publications.waset.org/abstracts/search?q=Korovkin%20type%20theorems" title=" Korovkin type theorems"> Korovkin type theorems</a> </p> <a href="https://publications.waset.org/abstracts/53219/approximation-of-analytic-functions-of-several-variables-by-linear-k-positive-operators-in-the-closed-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53219.pdf" target="_blank" class="btn btn-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">608</span> Identifying Promoters and Their Types Based on a Two-Layer Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bin%20Liu">Bin Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Prokaryotic promoter, consisted of two short DNA sequences located at in -35 and -10 positions, is responsible for controlling the initiation and expression of gene expression. Different types of promoters have different functions, and their consensus sequences are similar. In addition, their consensus sequences may be different for the same type of promoter, which poses difficulties for promoter identification. Unfortunately, all existing computational methods treat promoter identification as a binary classification task and can only identify whether a query sequence belongs to a specific promoter type. It is desired to develop computational methods for effectively identifying promoters and their types. Here, a two-layer predictor is proposed to try to deal with the problem. The first layer is designed to predict whether a given sequence is a promoter and the second layer predicts the type of promoter that is judged as a promoter. Meanwhile, we also analyze the importance of feature and sequence conversation in two aspects: promoter identification and promoter type identification. To the best knowledge of ours, it is the first computational predictor to detect promoters and their types. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=promoter" title="promoter">promoter</a>, <a href="https://publications.waset.org/abstracts/search?q=promoter%20type" title=" promoter type"> promoter type</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20forest" title=" random forest"> random forest</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20information" title=" sequence information"> sequence information</a> </p> <a href="https://publications.waset.org/abstracts/77957/identifying-promoters-and-their-types-based-on-a-two-layer-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77957.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">184</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">607</span> Taxonomic Classification for Living Organisms Using Convolutional Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saed%20Khawaldeh">Saed Khawaldeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Elsharnouby"> Mohamed Elsharnouby</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20%20Eddin%20Alchalabi"> Alaa Eddin Alchalabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Usama%20Pervaiz"> Usama Pervaiz</a>, <a href="https://publications.waset.org/abstracts/search?q=Tajwar%20Aleef"> Tajwar Aleef</a>, <a href="https://publications.waset.org/abstracts/search?q=Vu%20Hoang%20Minh"> Vu Hoang Minh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Taxonomic classification has a wide-range of applications such as finding out more about the evolutionary history of organisms that can be done by making a comparison between species living now and species that lived in the past. This comparison can be made using different kinds of extracted species’ data which include DNA sequences. Compared to the estimated number of the organisms that nature harbours, humanity does not have a thorough comprehension of which specific species they all belong to, in spite of the significant development of science and scientific knowledge over many years. One of the methods that can be applied to extract information out of the study of organisms in this regard is to use the DNA sequence of a living organism as a marker, thus making it available to classify it into a taxonomy. The classification of living organisms can be done in many machine learning techniques including Neural Networks (NNs). In this study, DNA sequences classification is performed using Convolutional Neural Networks (CNNs) which is a special type of NNs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deep%20networks" title="deep networks">deep networks</a>, <a href="https://publications.waset.org/abstracts/search?q=convolutional%20neural%20networks" title=" convolutional neural networks"> convolutional neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=taxonomic%20classification" title=" taxonomic classification"> taxonomic classification</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20sequences%20classification" title=" DNA sequences classification "> DNA sequences classification </a> </p> <a href="https://publications.waset.org/abstracts/65170/taxonomic-classification-for-living-organisms-using-convolutional-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65170.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">442</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">606</span> Phylogenetic Relationships of the Malaysian Primates Cercopithecine Based on COI Gene Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20M.%20Md-Zain">B. M. Md-Zain</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20A.%20Rahman"> N. A. Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20B.%20Abdul-Latiff"> M. A. B. Abdul-Latiff</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20M.%20R.%20Idris"> W. M. R. Idris</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We conducted molecular research to portray phylogenetic relationships of Malaysian primates particularly in the genus of Macaca. We have sequenced cytochrome C oxidase subunit I (COI) of mitochondrial DNA of several individuals from M. fascicularis and M. arctoides. PCR amplifications were performed and COI DNA sequences were aligned using ClustalW. Phylogenetic trees were constructed using distance analyses by employing neighbor-joining algorithm (NJ). We managed to sequence 700 bp of COI DNA sequences. The tree topology showed that M. fascicularis did not clump based on phyleogeography division in Peninsular Malaysia. Individuals from Negeri Sembilan merged together with samples from Perak and Penang into one clade. In addition, phylogenetic analyses indicated that M. arctoides was classified into sinica group instead of fascicularis group supported by genetic distance data. COI gene is an effective locus to clarify phylogenetic position of M. arctoides but not in discriminating M. fascicularis population in Peninsular Malaysia. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cercopithecine" title="cercopithecine">cercopithecine</a>, <a href="https://publications.waset.org/abstracts/search?q=long-tailed%20macaque" title=" long-tailed macaque"> long-tailed macaque</a>, <a href="https://publications.waset.org/abstracts/search?q=Macaca%20fascicularis" title=" Macaca fascicularis"> Macaca fascicularis</a>, <a href="https://publications.waset.org/abstracts/search?q=Macaca%20arctoides" title=" Macaca arctoides"> Macaca arctoides</a> </p> <a href="https://publications.waset.org/abstracts/6415/phylogenetic-relationships-of-the-malaysian-primates-cercopithecine-based-on-coi-gene-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6415.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">357</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">605</span> Microbial Dark Matter Analysis Using 16S rRNA Gene Metagenomics Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hana%20Barak">Hana Barak</a>, <a href="https://publications.waset.org/abstracts/search?q=Alex%20Sivan"> Alex Sivan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ariel%20Kushmaro"> Ariel Kushmaro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Microorganisms are the most diverse and abundant life forms on Earth and account for a large portion of the Earth’s biomass and biodiversity. To date though, our knowledge regarding microbial life is lacking, as it is based mainly on information from cultivated organisms. Indeed, microbiologists have borrowed from astrophysics and termed the ‘uncultured microbial majority’ as ‘microbial dark matter’. The realization of how diverse and unexplored microorganisms are, actually stems from recent advances in molecular biology, and in particular from novel methods for sequencing microbial small subunit ribosomal RNA genes directly from environmental samples termed next-generation sequencing (NGS). This has led us to use NGS that generates several gigabases of sequencing data in a single experimental run, to identify and classify environmental samples of microorganisms. In metagenomics sequencing analysis (both 16S and shotgun), sequences are compared to reference databases that contain only small part of the existing microorganisms and therefore their taxonomy assignment may reveal groups of unknown microorganisms or origins. These unknowns, or the ‘microbial sequences dark matter’, are usually ignored in spite of their great importance. The goal of this work was to develop an improved bioinformatics method that enables more complete analyses of the microbial communities in numerous environments. Therefore, NGS was used to identify previously unknown microorganisms from three different environments (industrials wastewater, Negev Desert’s rocks and water wells at the Arava valley). 16S rRNA gene metagenome analysis of the microorganisms from those three environments produce about ~4 million reads for 75 samples. Between 0.1-12% of the sequences in each sample were tagged as ‘Unassigned’. Employing relatively simple methodology for resequencing of original gDNA samples through Sanger or MiSeq Illumina with specific primers, this study demonstrates that the mysterious ‘Unassigned’ group apparently contains sequences of candidate phyla. Those unknown sequences can be located on a phylogenetic tree and thus provide a better understanding of the ‘sequences dark matter’ and its role in the research of microbial communities and diversity. Studying this ‘dark matter’ will extend the existing databases and could reveal the hidden potential of the ‘microbial dark matter’. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bacteria" title="bacteria">bacteria</a>, <a href="https://publications.waset.org/abstracts/search?q=bioinformatics" title=" bioinformatics"> bioinformatics</a>, <a href="https://publications.waset.org/abstracts/search?q=dark%20matter" title=" dark matter"> dark matter</a>, <a href="https://publications.waset.org/abstracts/search?q=Next%20Generation%20Sequencing" title=" Next Generation Sequencing"> Next Generation Sequencing</a>, <a href="https://publications.waset.org/abstracts/search?q=unknown" title=" unknown"> unknown</a> </p> <a href="https://publications.waset.org/abstracts/97387/microbial-dark-matter-analysis-using-16s-rrna-gene-metagenomics-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97387.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">257</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">604</span> Exploring MPI-Based Parallel Computing in Analyzing Very Large Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Wajid">Bilal Wajid</a>, <a href="https://publications.waset.org/abstracts/search?q=Erchin%20Serpedin"> Erchin Serpedin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The health industry is aiming towards personalized medicine. If the patient’s genome needs to be sequenced it is important that the entire analysis be completed quickly. This paper explores use of parallel computing to analyze very large sequences. Two cases have been considered. In the first case, the sequence is kept constant and the effect of increasing the number of MPI-based processes is evaluated in terms of execution time, speed and efficiency. In the second case the number of MPI-based processes have been kept constant whereas, the length of the sequence was increased. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title="parallel computing">parallel computing</a>, <a href="https://publications.waset.org/abstracts/search?q=alignment" title=" alignment"> alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20assembly" title=" genome assembly"> genome assembly</a>, <a href="https://publications.waset.org/abstracts/search?q=alignment" title=" alignment"> alignment</a> </p> <a href="https://publications.waset.org/abstracts/40924/exploring-mpi-based-parallel-computing-in-analyzing-very-large-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40924.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">274</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">603</span> Parkinson's Disease Gene Identification Using Physicochemical Properties of Amino Acids</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Priya%20Arora">Priya Arora</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashutosh%20Mishra"> Ashutosh Mishra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Gene identification, towards the pursuit of mutated genes, leading to Parkinson’s disease, puts forward a challenge towards proactive cure of the disorder itself. Computational analysis is an effective technique for exploring genes in the form of protein sequences, as the theoretical and manual analysis is infeasible. The limitations and effectiveness of a particular computational method are entirely dependent on the previous data that is available for disease identification. The article presents a sequence-based classification method for the identification of genes responsible for Parkinson’s disease. During the initiation phase, the physicochemical properties of amino acids transform protein sequences into a feature vector. The second phase of the method employs Jaccard distances to select negative genes from the candidate population. The third phase involves artificial neural networks for making final predictions. The proposed approach is compared with the state of art methods on the basis of F-measure. The results confirm and estimate the efficiency of the method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disease%20gene%20identification" title="disease gene identification">disease gene identification</a>, <a href="https://publications.waset.org/abstracts/search?q=Parkinson%E2%80%99s%20disease" title=" Parkinson’s disease"> Parkinson’s disease</a>, <a href="https://publications.waset.org/abstracts/search?q=physicochemical%20properties%20of%20amino%20acid" title=" physicochemical properties of amino acid"> physicochemical properties of amino acid</a>, <a href="https://publications.waset.org/abstracts/search?q=protein%20sequences" title=" protein sequences"> protein sequences</a> </p> <a href="https://publications.waset.org/abstracts/116365/parkinsons-disease-gene-identification-using-physicochemical-properties-of-amino-acids" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/116365.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">140</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">602</span> Paleogene Syn-Rift Play Identification in Palembang Sub-Basin, South Sumatera, Indonesia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Perdana%20Rakhmana%20Putra">Perdana Rakhmana Putra</a>, <a href="https://publications.waset.org/abstracts/search?q=Hansen%20Wijaya"> Hansen Wijaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Sri%20Budiyani"> Sri Budiyani</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhamad%20Natsir"> Muhamad Natsir</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexis%20badai%20Samudra"> Alexis badai Samudra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Palembang Sub-Basin (PSB) located in southern part of South Sumatera basin (SSB) consist of half-graben complex trending N-S to NW-SE. These geometries are believe as an impact of strike-slip regime developed in Eocene-Oligocene. Generally, most of the wells in this area produced hydrocarbon from late stage of syn-rift sequences called Lower Talang Akar (LTAF) and post-rift sequences called Batu Raja Formation (BRF) and drilled to proved hydrocarbon on structural trap; three-way dip anticline, four-way dip anticline, dissected anticline, and stratigraphy trap; carbonate build-up and stratigraphic pinch out. Only a few wells reached the deeper syn-rift sequences called Lahat Formation (LAF) and Lemat Formation (LEF). The new interpretation of subsurface data was done by the tectonostratigraphy concept and focusing on syn-rift sequence. Base on seismic characteristic on basin centre, it divided into four sequences: pre-rift sequence, rift initiation, maximum rift and late rift. These sequences believed as a new exploration target on PSB mature basin. This paper will demonstrate the paleo depositional setting during Paleogene and exploration play concept of syn-rift sequence in PSB. The main play for this area consists of stratigraphic and structure play, where the stratigraphic play is Eocene-Oligocene sediment consist of LAF sandstone, LEF-Benakat formation, and LAF with pinch-out geometry. The pinch-out, lenses geometry and on-lap features can be seen on the seismic reflector and formed at the time of the syn-rift sequence. The structural play is dominated by a 3 Way Dip play related to reverse fault trap. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=syn-rift" title="syn-rift">syn-rift</a>, <a href="https://publications.waset.org/abstracts/search?q=tectono-stratigraphy" title=" tectono-stratigraphy"> tectono-stratigraphy</a>, <a href="https://publications.waset.org/abstracts/search?q=exploration%20play" title=" exploration play"> exploration play</a>, <a href="https://publications.waset.org/abstracts/search?q=basin%20center%20play" title=" basin center play"> basin center play</a>, <a href="https://publications.waset.org/abstracts/search?q=south%20sumatera%20basin" title=" south sumatera basin"> south sumatera basin</a> </p> <a href="https://publications.waset.org/abstracts/88167/paleogene-syn-rift-play-identification-in-palembang-sub-basin-south-sumatera-indonesia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88167.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">194</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">601</span> Biomechanical Analysis and Interpretation of Pitching Sequences for Enhanced Performance Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Corey%20F.%20Fitzgerald">Corey F. Fitzgerald</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study provides a comprehensive examination of the biomechanical sequencing inherent in pitching motions, coupled with an advanced methodology for interpreting gathered data to inform programming strategies. The analysis is conducted utilizing state-of-the-art biomechanical laboratory equipment capable of detecting subtle changes and deviations, facilitating highly informed decision-making processes. Through this presentation, the intricate dynamics of pitching sequences are meticulously discussed to highlight the complex movement patterns accessible and actionable for performance enhancement purposes in the weight room. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sport%20science" title="sport science">sport science</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20biomechanics" title=" applied biomechanics"> applied biomechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=strength%20and%20conditioning" title=" strength and conditioning"> strength and conditioning</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20research" title=" applied research"> applied research</a> </p> <a href="https://publications.waset.org/abstracts/183241/biomechanical-analysis-and-interpretation-of-pitching-sequences-for-enhanced-performance-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183241.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">60</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">600</span> Second Language Perception of Japanese /Cju/ and /Cjo/ Sequences by Mandarin-Speaking Learners of Japanese</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yili%20Liu">Yili Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Honghao%20Ren"> Honghao Ren</a>, <a href="https://publications.waset.org/abstracts/search?q=Mariko%20Kondo"> Mariko Kondo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the field of second language (L2) speech learning, it is well-known that that learner’s first language (L1) phonetic and phonological characteristics will be transferred into their L2 production and perception, which lead to foreign accent. For L1 Mandarin learners of Japanese, the confusion of /u/ and /o/ in /CjV/ sequences has been observed in their utterance frequently. L1 transfer is considered to be the cause of this issue, however, other factors which influence the identification of /Cju/ and /Cjo/ sequences still under investigation. This study investigates the perception of Japanese /Cju/ and /Cjo/ units by L1 Mandarin learners of Japanese. It further examined whether learners’ proficiency, syllable position, phonetic features of preceding consonants and background noise affect learners’ performance in perception. Fifty-two Mandarin-speaking learners of Japanese and nine native Japanese speakers were recruited to participate in an identification task. Learners were divided into beginner, intermediate and advanced level according to their Japanese proficiency. The average correct rate was used to evaluate learners’ perceptual performance. Furthermore, the comparison of the correct rate between learners’ groups and the control group was conducted as well to examine learners’ nativelikeness. Results showed that background noise tends to pose an adverse effect on distinguishing /u/ and /o/ in /CjV/ sequences. Secondly, Japanese proficiency has no influence on learners’ perceptual performance in the quiet and in background noise. Then all learners did not reach a native-like level without the distraction of noise. Beginner level learners performed less native-like, although higher level learners appeared to have achieved nativelikeness in the multi-talker babble noise. Finally, syllable position tends to affect distinguishing /Cju/ and /Cjo/ only under the noisy condition. Phonetic features of preceding consonants did not impact learners’ perception in any listening conditions. Findings in this study can give an insight into a further understanding of Japanese vowel acquisition by L1 Mandarin learners of Japanese. In addition, this study indicates that L1 transfer is not the only explanation for the confusion of /u/ and /o/ in /CjV/ sequences, factors such as listening condition and syllable position are also needed to take into consideration in future research. It also suggests the importance of perceiving speech in a noisy environment, which is close to the actual conversation required more attention to pedagogy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=background%20noise" title="background noise">background noise</a>, <a href="https://publications.waset.org/abstracts/search?q=Chinese%20learners%20of%20Japanese" title=" Chinese learners of Japanese"> Chinese learners of Japanese</a>, <a href="https://publications.waset.org/abstracts/search?q=%2FCju%2F%20and%20%2FCjo%2F%20sequences" title=" /Cju/ and /Cjo/ sequences"> /Cju/ and /Cjo/ sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=second%20language%20perception" title=" second language perception"> second language perception</a> </p> <a href="https://publications.waset.org/abstracts/99626/second-language-perception-of-japanese-cju-and-cjo-sequences-by-mandarin-speaking-learners-of-japanese" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99626.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">160</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">599</span> Lambda-Levelwise Statistical Convergence of a Sequence of Fuzzy Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=F.%20Berna%20Benli">F. Berna Benli</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%96zg%C3%BCr%20Keskin"> Özgür Keskin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lately, many mathematicians have been studied the statistical convergence of a sequence of fuzzy numbers. We know that Lambda-statistically convergence is a kind of convergence between ordinary convergence and statistical convergence. In this paper, we will introduce the new kind of convergence such as λ-levelwise statistical convergence. Then, we will define the concept of the λ-levelwise statistical cluster and limit points of a sequence of fuzzy numbers. Also, we will discuss the relations between the sets of λ-levelwise statistical cluster points and λ-levelwise statistical limit points of sequences of fuzzy numbers. This work has been extended in this paper, where some relations have been considered such that when lambda-statistical limit inferior and lambda-statistical limit superior for lambda-statistically convergent sequences of fuzzy numbers are equal. Furthermore, lambda-statistical boundedness condition for different sequences of fuzzy numbers has been studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20number" title="fuzzy number">fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-levelwise%20statistical%20cluster%20points" title=" λ-levelwise statistical cluster points"> λ-levelwise statistical cluster points</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-levelwise%20statistical%20convergence" title=" λ-levelwise statistical convergence"> λ-levelwise statistical convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-levelwise%20statistical%20limit%20points" title=" λ-levelwise statistical limit points"> λ-levelwise statistical limit points</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-statistical%20cluster%20points" title=" λ-statistical cluster points"> λ-statistical cluster points</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-statistical%20convergence" title=" λ-statistical convergence"> λ-statistical convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BB-statistical%20limit%20%20points" title=" λ-statistical limit points"> λ-statistical limit points</a> </p> <a href="https://publications.waset.org/abstracts/20755/lambda-levelwise-statistical-convergence-of-a-sequence-of-fuzzy-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20755.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">477</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">598</span> Automatic Content Curation of Visual Heritage</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Delphine%20Ribes%20Lemay">Delphine Ribes Lemay</a>, <a href="https://publications.waset.org/abstracts/search?q=Valentine%20Bernasconi"> Valentine Bernasconi</a>, <a href="https://publications.waset.org/abstracts/search?q=Andr%C3%A9%20Andrade"> André Andrade</a>, <a href="https://publications.waset.org/abstracts/search?q=Lara%20D%C3%A9Fayes"> Lara DéFayes</a>, <a href="https://publications.waset.org/abstracts/search?q=Mathieu%20Salzmann"> Mathieu Salzmann</a>, <a href="https://publications.waset.org/abstracts/search?q=Fr%C3%A9D%C3%A9Ric%20Kaplan"> FréDéRic Kaplan</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicolas%20Henchoz"> Nicolas Henchoz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digitization and preservation of large heritage induce high maintenance costs to keep up with the technical standards and ensure sustainable access. Creating impactful usage is instrumental to justify the resources for long-term preservation. The Museum für Gestaltung of Zurich holds one of the biggest poster collections of the world from which 52’000 were digitised. In the process of building a digital installation to valorize the collection, one objective was to develop an algorithm capable of predicting the next poster to show according to the ones already displayed. The work presented here describes the steps to build an algorithm able to automatically create sequences of posters reflecting associations performed by curator and professional designers. The exposed challenge finds similarities with the domain of song playlist algorithms. Recently, artificial intelligence techniques and more specifically, deep-learning algorithms have been used to facilitate their generations. Promising results were found thanks to Recurrent Neural Networks (RNN) trained on manually generated playlist and paired with clusters of extracted features from songs. We used the same principles to create the proposed algorithm but applied to a challenging medium, posters. First, a convolutional autoencoder was trained to extract features of the posters. The 52’000 digital posters were used as a training set. Poster features were then clustered. Next, an RNN learned to predict the next cluster according to the previous ones. RNN training set was composed of poster sequences extracted from a collection of books from the Gestaltung Museum of Zurich dedicated to displaying posters. Finally, within the predicted cluster, the poster with the best proximity compared to the previous poster is selected. The mean square distance between features of posters was used to compute the proximity. To validate the predictive model, we compared sequences of 15 posters produced by our model to randomly and manually generated sequences. Manual sequences were created by a professional graphic designer. We asked 21 participants working as professional graphic designers to sort the sequences from the one with the strongest graphic line to the one with the weakest and to motivate their answer with a short description. The sequences produced by the designer were ranked first 60%, second 25% and third 15% of the time. The sequences produced by our predictive model were ranked first 25%, second 45% and third 30% of the time. The sequences produced randomly were ranked first 15%, second 29%, and third 55% of the time. Compared to designer sequences, and as reported by participants, model and random sequences lacked thematic continuity. According to the results, the proposed model is able to generate better poster sequencing compared to random sampling. Eventually, our algorithm is sometimes able to outperform a professional designer. As a next step, the proposed algorithm should include a possibility to create sequences according to a selected theme. To conclude, this work shows the potentiality of artificial intelligence techniques to learn from existing content and provide a tool to curate large sets of data, with a permanent renewal of the presented content. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Artificial%20Intelligence" title="Artificial Intelligence">Artificial Intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=Digital%20Humanities" title=" Digital Humanities"> Digital Humanities</a>, <a href="https://publications.waset.org/abstracts/search?q=serendipity" title=" serendipity"> serendipity</a>, <a href="https://publications.waset.org/abstracts/search?q=design%20research" title=" design research"> design research</a> </p> <a href="https://publications.waset.org/abstracts/137502/automatic-content-curation-of-visual-heritage" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/137502.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">184</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">597</span> Effect of Bacillus Pumilus Strains on Heavy Metal Accumulation in Lettuce Grown on Contaminated Soil</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sabeen%20Alam">Sabeen Alam</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehboob%20Alam"> Mehboob Alam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research work entitled “Effect of Bacillus pumilus strains on heavy metal accumulation in lettuce grown on contaminated soil” focused on functional role of Bacillus pumilus strains inoculated with lettuce seed in mitigating heavy metal in chromite mining soil. In this experiment, factor A was three Bacillus pumilus strains (sequence C-2PMW-8, C-1 SSK-8 and C-1 PWK-7) while soil used for this experiment was collected from Prang Ghar mining site and lettuce seeds were grown in three levels of chromite mining soil (2.27, 4.65 and 7.14 %). For mining soil minimum days to germinate noted in lettuce grown on garden soil inoculated with sequence. Maximum germination percentage noted was for C-1 SSK-8 grown on garden soil, maximum lettuce height for sequence C-2 PWM-8, fresh leaf weight for C-1 PWK-7 inoculated lettuce, dry weight of lettuce leaf for lettuce inoculated with C-1 SSK-8 and C-1 PWK-7 strains, number of leaves per plant for lettuce inoculated with C-1 SSK-8, leaf area for C-2 PMW-8 inoculated lettuce, survival percentage for C-1 SSK-8 treated lettuce and chlorophyll content for C-2 PMW-8. Results related to heavy metals accumulation showed that minimum chromium was in lettuce and in soil for all three sequences, cadmium (Cd) in lettuce and in soil for all three sequences, manganese (Mn) in lettuce and in soil for three sequences, lead (Pb) in lettuce and in soil for three sequences. It can be concluded that chromite mining soil significantly reduced the growth and survival of lettuce, but when lettuce was inoculated with Bacillus.pumilus strains, it enhances growth and survival. Similarly, minimum heavy metal accumulation in plant and soil, regardless of type of Bacillus pumilus used, all three sequences has same mitigating effect on heavy metal in both soil and lettuce. All the three Bacillus pumilus strains ensured reduction in heavy metals content (Mn, Cd, Cr) in lettuce, below the maximum permissible limits of WHO 2011. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bacillus%20pumilus" title="bacillus pumilus">bacillus pumilus</a>, <a href="https://publications.waset.org/abstracts/search?q=heavy%20metals" title=" heavy metals"> heavy metals</a>, <a href="https://publications.waset.org/abstracts/search?q=permissible%20limits" title=" permissible limits"> permissible limits</a>, <a href="https://publications.waset.org/abstracts/search?q=lettuce" title=" lettuce"> lettuce</a>, <a href="https://publications.waset.org/abstracts/search?q=chromite%20mining%20soil" title=" chromite mining soil"> chromite mining soil</a>, <a href="https://publications.waset.org/abstracts/search?q=mitigating%20effect" title=" mitigating effect"> mitigating effect</a> </p> <a href="https://publications.waset.org/abstracts/181677/effect-of-bacillus-pumilus-strains-on-heavy-metal-accumulation-in-lettuce-grown-on-contaminated-soil" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/181677.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">59</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">596</span> Molecular Comparison of HEV Isolates from Sewage & Humans at Western India</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nidhi%20S.%20Chandra">Nidhi S. Chandra</a>, <a href="https://publications.waset.org/abstracts/search?q=Veena%20Agrawal"> Veena Agrawal</a>, <a href="https://publications.waset.org/abstracts/search?q=Debprasad%20Chattopadhyay"> Debprasad Chattopadhyay</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Hepatitis E virus (HEV) is a major cause of acute viral hepatitis in developing countries. It spreads feco orally mainly due to contamination of drinking water by sewage. There is limited data on the genotypic comparison of HEV isolates from sewage water and humans. The aim of this study was to identify genotype and conduct phylogenetic analysis of HEV isolates from sewage water and humans. Materials and Methods: 14 sewage water and 60 serum samples from acute sporadic hepatitis E cases (negative for hepatitis A, B, C) were tested for HEV-RNA by nested polymerase chain reaction (RTnPCR) using primers designed with in RdRp (RNA dependent RNA polymerase) region of open reading frame-1 (ORF-1). Sequencing was done by ABI prism 310. The sequences (343 nucleotides) were compared with each other and were aligned with previously reported HEV sequences obtained from GeneBank, using Clustal W software. A Phylogenetic tree was constructed by using PHYLIP version 3.67 software. Results: HEV-RNA was detected in 49/ 60 (81.67%) serum and 5/14 (35.71%) sewage samples. The sequences obtained from 17 serums and 2 sewage specimens belonged to genotype I with 85% similarity and clustering with previously reported human HEV sequences from India. HEV isolates from human and sewage in North West India are genetically closely related to each other. Conclusion: These finding suggest that sewage acts as reservoir of HEV. Therefore it is important that measures are taken for proper waste disposal and treatment of drinking water to prevent outbreaks and epidemics due to HEV. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hepatitis%20E%20virus" title="hepatitis E virus">hepatitis E virus</a>, <a href="https://publications.waset.org/abstracts/search?q=nested%20polymerase%20chain%20reaction" title=" nested polymerase chain reaction"> nested polymerase chain reaction</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20reading%20frame-1" title=" open reading frame-1"> open reading frame-1</a>, <a href="https://publications.waset.org/abstracts/search?q=nucleotidies" title=" nucleotidies"> nucleotidies</a> </p> <a href="https://publications.waset.org/abstracts/16409/molecular-comparison-of-hev-isolates-from-sewage-humans-at-western-india" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16409.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">377</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">595</span> Classifications of Images for the Recognition of People’s Behaviors by SIFT and SVM</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Henni%20Sid%20Ahmed">Henni Sid Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Belbachir%20Mohamed%20Faouzi"> Belbachir Mohamed Faouzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean%20Caelen"> Jean Caelen </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Behavior recognition has been studied for realizing drivers assisting system and automated navigation and is an important studied field in the intelligent Building. In this paper, a recognition method of behavior recognition separated from a real image was studied. Images were divided into several categories according to the actual weather, distance and angle of view etc. SIFT was firstly used to detect key points and describe them because the SIFT (Scale Invariant Feature Transform) features were invariant to image scale and rotation and were robust to changes in the viewpoint and illumination. My goal is to develop a robust and reliable system which is composed of two fixed cameras in every room of intelligent building which are connected to a computer for acquisition of video sequences, with a program using these video sequences as inputs, we use SIFT represented different images of video sequences, and SVM (support vector machine) Lights as a programming tool for classification of images in order to classify people’s behaviors in the intelligent building in order to give maximum comfort with optimized energy consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=video%20analysis" title="video analysis">video analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=people%20behavior" title=" people behavior"> people behavior</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20building" title=" intelligent building"> intelligent building</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification "> classification </a> </p> <a href="https://publications.waset.org/abstracts/24738/classifications-of-images-for-the-recognition-of-peoples-behaviors-by-sift-and-svm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24738.pdf" target="_blank" class="btn btn-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> <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=pseudorandom%20sequences&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&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=pseudorandom%20sequences&page=20">20</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&page=21">21</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences&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>