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: pseudo voter identity scheme PVID.</title> <meta name="description" content="Search results for: pseudo voter identity scheme PVID."> <meta name="keywords" content="pseudo voter identity scheme PVID."> <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="pseudo voter identity scheme PVID." name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="pseudo voter identity scheme PVID."> <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> 1603</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: pseudo voter identity scheme PVID.</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1603</span> Evaluation and Analysis of the Secure E-Voting Authentication Preparation Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nidal%20F.%20Shilbayeh">Nidal F. Shilbayeh</a>, <a href="https://publications.waset.org/search?q=Reem%20A.%20Al-Saidi"> Reem A. Al-Saidi</a>, <a href="https://publications.waset.org/search?q=Ahmed%20H.%20Alsswey"> Ahmed H. Alsswey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we presented an evaluation and analysis of E-Voting Authentication Preparation Scheme (EV-APS). EV-APS applies some modified security aspects that enhance the security measures and adds a strong wall of protection, confidentiality, non-repudiation and authentication requirements. Some of these modified security aspects are Kerberos authentication protocol, PVID scheme, responder certificate validation, and the converted Ferguson e-cash protocol. Authentication and privacy requirements have been evaluated and proved. Authentication guaranteed only eligible and authorized voters were permitted to vote. Also, the privacy guaranteed that all votes will be kept secret. Evaluation and analysis of some of these security requirements have been given. These modified aspects will help in filtering the counter buffer from unauthorized votes by ensuring that only authorized voters are permitted to vote.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=E-Voting%20preparation%20stage" title="E-Voting preparation stage">E-Voting preparation stage</a>, <a href="https://publications.waset.org/search?q=blind%20signature%20protocol" title=" blind signature protocol"> blind signature protocol</a>, <a href="https://publications.waset.org/search?q=nonce%20based%20authentication%20scheme" title=" nonce based authentication scheme"> nonce based authentication scheme</a>, <a href="https://publications.waset.org/search?q=Kerberos%20authentication%20protocol" title=" Kerberos authentication protocol"> Kerberos authentication protocol</a>, <a href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID." title=" pseudo voter identity scheme PVID."> pseudo voter identity scheme PVID.</a> </p> <a href="https://publications.waset.org/10004216/evaluation-and-analysis-of-the-secure-e-voting-authentication-preparation-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004216/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004216/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004216/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004216/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004216/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004216/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004216/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004216/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004216/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004216/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004216.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1618</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1602</span> Electronic Voting System using Mobile Terminal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Keonwoo%20Kim">Keonwoo Kim</a>, <a href="https://publications.waset.org/search?q=Dowon%20Hong"> Dowon Hong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Electronic voting (E-voting) using an internet has been recently performed in some nations and regions. There is no spatial restriction which a voter directly has to visit the polling place, but an e-voting using an internet has to go together the computer in which the internet connection is possible. Also, this voting requires an access code for the e-voting through the beforehand report of a voter. To minimize these disadvantages, we propose a method in which a voter, who has the wireless certificate issued in advance, uses its own cellular phone for an e-voting without the special registration for a vote. Our proposal allows a voter to cast his vote in a simple and convenient way without the limit of time and location, thereby increasing the voting rate, and also ensuring confidentiality and anonymity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Voting" title="Voting">Voting</a>, <a href="https://publications.waset.org/search?q=mobile%20terminal" title=" mobile terminal"> mobile terminal</a>, <a href="https://publications.waset.org/search?q=confidentiality" title=" confidentiality"> confidentiality</a>, <a href="https://publications.waset.org/search?q=anonymity." title=" anonymity."> anonymity.</a> </p> <a href="https://publications.waset.org/14194/electronic-voting-system-using-mobile-terminal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14194/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14194/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14194/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14194/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14194/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14194/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14194/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14194/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14194/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14194/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14194.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2770</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1601</span> Pseudo Last Useful Instant Queuing Strategy for Handovers in Low Earth Orbit Mobile Satellite Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=W.%20Kiamouche">W. Kiamouche</a>, <a href="https://publications.waset.org/search?q=M.%20Benslama"> M. Benslama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an alternative strategy of queuing handover called Pseudo Last Useful Instant PLUI scheme for Low Earth Orbit Mobile Satellite Systems LEO MSSs. The PLUI scheme uses the same approach as the Last Useful Instant LUI scheme previously proposed in literature, with less complex implementation. Simulation tests were carried out using Dynamic Channel Allocation DCA in order to evaluate the performance of this scheme and also an analytical approach has been presented to allow the performance evaluation of Fixed Channel Allocation FCA, with different handover queuing disciplines. The results show that performances achieved by the proposed strategy are close to those achieved using the LUI scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=LEO%20mobile%20satellite%20networks" title="LEO mobile satellite networks">LEO mobile satellite networks</a>, <a href="https://publications.waset.org/search?q=LUI%20and%20FIFOschemes" title=" LUI and FIFOschemes"> LUI and FIFOschemes</a>, <a href="https://publications.waset.org/search?q=queuing%20handover." title=" queuing handover."> queuing handover.</a> </p> <a href="https://publications.waset.org/8985/pseudo-last-useful-instant-queuing-strategy-for-handovers-in-low-earth-orbit-mobile-satellite-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8985/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8985/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8985/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8985/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8985/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8985/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8985/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8985/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8985/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8985/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8985.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1402</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1600</span> Vertex Configurations and Their Relationship on Orthogonal Pseudo-Polyhedra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jefri%20Marzal">Jefri Marzal</a>, <a href="https://publications.waset.org/search?q=Hong%20Xie"> Hong Xie</a>, <a href="https://publications.waset.org/search?q=Chun%20Che%20Fung"> Chun Che Fung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vertex configuration for a vertex in an orthogonal pseudo-polyhedron is an identity of a vertex that is determined by the number of edges, dihedral angles, and non-manifold properties meeting at the vertex. There are up to sixteen vertex configurations for any orthogonal pseudo-polyhedron (OPP). Understanding the relationship between these vertex configurations will give us insight into the structure of an OPP and help us design better algorithms for many 3-dimensional geometric problems. In this paper, 16 vertex configurations for OPP are described first. This is followed by a number of formulas giving insight into the relationship between different vertex configurations in an OPP. These formulas will be useful as an extension of orthogonal polyhedra usefulness on pattern analysis in 3D-digital images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Orthogonal%20Pseudo%20Polyhedra" title="Orthogonal Pseudo Polyhedra">Orthogonal Pseudo Polyhedra</a>, <a href="https://publications.waset.org/search?q=Vertex%20configuration" title=" Vertex configuration"> Vertex configuration</a> </p> <a href="https://publications.waset.org/14765/vertex-configurations-and-their-relationship-on-orthogonal-pseudo-polyhedra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14765/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14765/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14765/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14765/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14765/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14765/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14765/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14765/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14765/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14765/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14765.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1369</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1599</span> Account Management Method with Blind Signature Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ryu%20Watanabe">Ryu Watanabe</a>, <a href="https://publications.waset.org/search?q=Yutaka%20Miyake"> Yutaka Miyake</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reducing the risk of information leaks is one of the most important functions of identity management systems. To achieve this purpose, Dey et al. have already proposed an account management method for a federated login system using a blind signature scheme. In order to ensure account anonymity for the authentication provider, referred to as an IDP (identity provider), a blind signature scheme is utilized to generate an authentication token on an authentication service and the token is sent to an IDP. However, there is a problem with the proposed system. Malicious users can establish multiple accounts on an IDP by requesting such accounts. As a measure to solve this problem, in this paper, the authors propose an account checking method that is performed before account generation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=identity%20management" title="identity management">identity management</a>, <a href="https://publications.waset.org/search?q=blind%20signature" title=" blind signature"> blind signature</a>, <a href="https://publications.waset.org/search?q=privacy%20protection" title=" privacy protection"> privacy protection</a> </p> <a href="https://publications.waset.org/2657/account-management-method-with-blind-signature-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2657/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2657/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2657/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2657/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2657/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2657/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2657/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2657/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2657/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2657/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2657.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1544</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1598</span> ASC – A Stream Cipher with Built – In MAC Functionality</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kai-Thorsten%20Wirt">Kai-Thorsten Wirt</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we present the design of a new encryption scheme. The scheme we propose is a very exible encryption and authentication primitive. We build this scheme on two relatively new design principles: t-functions and fast pseudo hadamard transforms. We recapitulate the theory behind these principles and analyze their security properties and efficiency. In more detail we propose a streamcipher which outputs a message authentication tag along with theencrypted data stream with only little overhead. Moreover we proposesecurity-speed tradeoffs. Our scheme is faster than other comparablet-function based designs while offering the same security level.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cryptography" title="Cryptography">Cryptography</a>, <a href="https://publications.waset.org/search?q=Combined%20Primitives" title=" Combined Primitives"> Combined Primitives</a>, <a href="https://publications.waset.org/search?q=Stream%20Cipher" title=" Stream Cipher"> Stream Cipher</a>, <a href="https://publications.waset.org/search?q=MAC" title=" MAC"> MAC</a>, <a href="https://publications.waset.org/search?q=T-Function" title=" T-Function"> T-Function</a>, <a href="https://publications.waset.org/search?q=FPHT." title=" FPHT."> FPHT.</a> </p> <a href="https://publications.waset.org/13472/asc-a-stream-cipher-with-built-in-mac-functionality" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13472/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13472/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13472/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13472/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13472/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13472/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13472/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13472/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13472/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13472/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13472.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1936</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1597</span> Efficient Aggregate Signature Algorithm and Its Application in MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Daxing%20Wang">Daxing Wang</a>, <a href="https://publications.waset.org/search?q=Jikai%20Teng"> Jikai Teng </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An aggregate signature scheme can aggregate n signatures on n distinct messages from n distinct signers into a single signature. Thus, n verification equations can be reduced to one. So the aggregate signature adapts to Mobile Ad hoc Network (MANET). In this paper, we propose an efficient ID-based aggregate signature scheme with constant pairing computations. Compared with the existing ID-based aggregate signature scheme, this scheme greatly improves the efficiency of signature communication and verification. In addition, in this work, we apply our ID-based aggregate sig- nature to authenticated routing protocol to present a secure routing scheme. Our scheme not only provides sound authentication and a secure routing protocol in ad hoc networks, but also meets the nature of MANET.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Identity-based%20cryptography" title="Identity-based cryptography">Identity-based cryptography</a>, <a href="https://publications.waset.org/search?q=Aggregate%20signature" title=" Aggregate signature"> Aggregate signature</a>, <a href="https://publications.waset.org/search?q=Bilinear%20pairings" title=" Bilinear pairings"> Bilinear pairings</a>, <a href="https://publications.waset.org/search?q=Authenticated%20routing%20scheme." title=" Authenticated routing scheme."> Authenticated routing scheme.</a> </p> <a href="https://publications.waset.org/9997180/efficient-aggregate-signature-algorithm-and-its-application-in-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997180/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997180/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997180/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997180/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997180/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997180/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997180/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997180/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997180/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997180/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997180.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2110</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1596</span> Contributions to Differential Geometry of Pseudo Null Curves in Semi-Euclidean Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Melih%20Turgut">Melih Turgut</a>, <a href="https://publications.waset.org/search?q=S%C3%BCha%20Y%C4%B1lmaz"> Süha Yılmaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, first, a characterization of spherical Pseudo null curves in Semi-Euclidean space is given. Then, to investigate position vector of a pseudo null curve, a system of differential equation whose solution gives the components of the position vector of a pseudo null curve on the Frenet axis is established by means of Frenet equations. Additionally, in view of some special solutions of mentioned system, characterizations of some special pseudo null curves are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Semi-Euclidean%20Space" title="Semi-Euclidean Space">Semi-Euclidean Space</a>, <a href="https://publications.waset.org/search?q=Pseudo%20Null%20Curves" title=" Pseudo Null Curves"> Pseudo Null Curves</a>, <a href="https://publications.waset.org/search?q=Position%20Vectors." title=" Position Vectors."> Position Vectors.</a> </p> <a href="https://publications.waset.org/696/contributions-to-differential-geometry-of-pseudo-null-curves-in-semi-euclidean-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/696/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/696/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/696/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/696/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/696/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/696/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/696/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/696/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/696/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/696/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/696.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1345</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1595</span> A Pairing-based Blind Signature Scheme with Message Recovery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Song%20Han">Song Han</a>, <a href="https://publications.waset.org/search?q=Elizabeth%20Chang"> Elizabeth Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Blind signatures enable users to obtain valid signatures for a message without revealing its content to the signer. This paper presents a new blind signature scheme, i.e. identity-based blind signature scheme with message recovery. Due to the message recovery property, the new scheme requires less bandwidth than the identitybased blind signatures with similar constructions. The scheme is based on modified Weil/Tate pairings over elliptic curves, and thus requires smaller key sizes for the same level of security compared to previous approaches not utilizing bilinear pairings. Security and efficiency analysis for the scheme is provided in this paper.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Blind%20Signature" title="Blind Signature">Blind Signature</a>, <a href="https://publications.waset.org/search?q=Message%20Recovery" title=" Message Recovery"> Message Recovery</a>, <a href="https://publications.waset.org/search?q=Pairings" title=" Pairings"> Pairings</a>, <a href="https://publications.waset.org/search?q=Elliptic%20Curves" title=" Elliptic Curves"> Elliptic Curves</a>, <a href="https://publications.waset.org/search?q=Blindness" title=" Blindness"> Blindness</a> </p> <a href="https://publications.waset.org/8680/a-pairing-based-blind-signature-scheme-with-message-recovery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8680/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8680/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8680/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8680/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8680/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8680/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8680/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8680/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8680/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8680/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8680.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2094</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1594</span> Pseudo-almost Periodic Solutions of a Class Delayed Chaotic Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Farouk%20Cherif">Farouk Cherif </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper is concerned with the existence and unique¬ness of pseudo-almost periodic solutions to the chaotic delayed neural networks (t)= —Dx(t) ± A f (x (t)) B f (x (t — r)) C f (x(p))dp J (t) . t-o Under some suitable assumptions on A, B, C, D, J and f, the existence and uniqueness of a pseudo-almost periodic solution to equation above is obtained. The results of this paper are new and they complement previously known results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Chaotic%20neural%20network" title="Chaotic neural network">Chaotic neural network</a>, <a href="https://publications.waset.org/search?q=Hamiltonian%20systems" title="Hamiltonian systems">Hamiltonian systems</a>, <a href="https://publications.waset.org/search?q=Pseudo%20almost%20periodic." title=" Pseudo almost periodic."> Pseudo almost periodic.</a> </p> <a href="https://publications.waset.org/1713/pseudo-almost-periodic-solutions-of-a-class-delayed-chaotic-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1713/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1713/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1713/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1713/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1713/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1713/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1713/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1713/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1713/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1713/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1713.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1310</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1593</span> On the Properties of Pseudo Noise Sequences with a Simple Proposal of Randomness Test</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abhijit%20Mitra">Abhijit Mitra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Maximal length sequences (m-sequences) are also known as pseudo random sequences or pseudo noise sequences for closely following Golomb-s popular randomness properties: (P1) balance, (P2) run, and (P3) ideal autocorrelation. Apart from these, there also exist certain other less known properties of such sequences all of which are discussed in this tutorial paper. Comprehensive proofs to each of these properties are provided towards better understanding of such sequences. A simple test is also proposed at the end of the paper in order to distinguish pseudo noise sequences from truly random sequences such as Bernoulli sequences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Maximal%20length%20sequence" title="Maximal length sequence">Maximal length sequence</a>, <a href="https://publications.waset.org/search?q=pseudo%20noise%20sequence" title=" pseudo noise sequence"> pseudo noise sequence</a>, <a href="https://publications.waset.org/search?q=punctured%20de%20Bruijn%20sequence" title=" punctured de Bruijn sequence"> punctured de Bruijn sequence</a>, <a href="https://publications.waset.org/search?q=auto-correlation" title=" auto-correlation"> auto-correlation</a>, <a href="https://publications.waset.org/search?q=Bernoulli%20sequence" title=" Bernoulli sequence"> Bernoulli sequence</a>, <a href="https://publications.waset.org/search?q=randomness%20tests." title=" randomness tests."> randomness tests.</a> </p> <a href="https://publications.waset.org/15829/on-the-properties-of-pseudo-noise-sequences-with-a-simple-proposal-of-randomness-test" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15829/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15829/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15829/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15829/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15829/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15829/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15829/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15829/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15829/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15829/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">6697</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1592</span> Some Characterizations of Isotropic Curves In the Euclidean Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S%C3%BCha%20Y%C4%B1lmaz">Süha Yılmaz</a>, <a href="https://publications.waset.org/search?q=Melih%20Turgut"> Melih Turgut</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The curves, of which the square of the distance between the two points equal to zero, are called minimal or isotropic curves [4]. In this work, first, necessary and sufficient conditions to be a Pseudo Helix, which is a special case of such curves, are presented. Thereafter, it is proven that an isotropic curve-s position vector and pseudo curvature satisfy a vector differential equation of fourth order. Additionally, In view of solution of mentioned equation, position vector of pseudo helices is obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Classical%20Differential%20Geometry" title="Classical Differential Geometry">Classical Differential Geometry</a>, <a href="https://publications.waset.org/search?q=Euclidean%20space" title=" Euclidean space"> Euclidean space</a>, <a href="https://publications.waset.org/search?q=Minimal%20Curves" title=" Minimal Curves"> Minimal Curves</a>, <a href="https://publications.waset.org/search?q=Isotropic%20Curves" title=" Isotropic Curves"> Isotropic Curves</a>, <a href="https://publications.waset.org/search?q=Pseudo%20Helix." title=" Pseudo Helix."> Pseudo Helix.</a> </p> <a href="https://publications.waset.org/1544/some-characterizations-of-isotropic-curves-in-the-euclidean-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1544/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1544/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1544/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1544/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1544/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1544/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1544/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1544/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1544/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1544/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1544.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1981</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1591</span> Performance Comparison of Resource Allocation without Feedback in Wireless Body Area Networks by Various Pseudo Orthogonal Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ojin%20Kwon">Ojin Kwon</a>, <a href="https://publications.waset.org/search?q=Yong-Jin%20Yoon"> Yong-Jin Yoon</a>, <a href="https://publications.waset.org/search?q=Liu%20Xin"> Liu Xin</a>, <a href="https://publications.waset.org/search?q=Zhang%20Hongbao"> Zhang Hongbao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Body Area Network (WBAN) is a short-range wireless communication around human body for various applications such as wearable devices, entertainment, military, and especially medical devices. WBAN attracts the attention of continuous health monitoring system including diagnostic procedure, early detection of abnormal conditions, and prevention of emergency situations. Compared to cellular network, WBAN system is more difficult to control inter- and inner-cell interference due to the limited power, limited calculation capability, mobility of patient, and non-cooperation among WBANs. In this paper, we compare the performance of resource allocation scheme based on several Pseudo Orthogonal Codewords (POCs) to mitigate inter-WBAN interference. Previously, the POCs are widely exploited for a protocol sequence and optical orthogonal code. Each POCs have different properties of auto- and cross-correlation and spectral efficiency according to its construction of POCs. To identify different WBANs, several different pseudo orthogonal patterns based on POCs exploits for resource allocation of WBANs. By simulating these pseudo orthogonal resource allocations of WBANs on MATLAB, we obtain the performance of WBANs according to different POCs and can analyze and evaluate the suitability of POCs for the resource allocation in the WBANs system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wireless%20body%20area%20network" title="Wireless body area network">Wireless body area network</a>, <a href="https://publications.waset.org/search?q=body%20sensor%20network" title=" body sensor network"> body sensor network</a>, <a href="https://publications.waset.org/search?q=resource%20allocation%20without%20feedback" title=" resource allocation without feedback"> resource allocation without feedback</a>, <a href="https://publications.waset.org/search?q=interference%20mitigation" title=" interference mitigation"> interference mitigation</a>, <a href="https://publications.waset.org/search?q=pseudo%0D%0Aorthogonal%20pattern." title=" pseudo orthogonal pattern."> pseudo orthogonal pattern.</a> </p> <a href="https://publications.waset.org/10003641/performance-comparison-of-resource-allocation-without-feedback-in-wireless-body-area-networks-by-various-pseudo-orthogonal-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003641/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003641/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003641/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003641/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003641/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003641/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003641/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003641/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003641/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003641/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003641.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1343</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1590</span> New Identity Management Scheme and its Formal Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jeonghoon%20Han">Jeonghoon Han</a>, <a href="https://publications.waset.org/search?q=Hanjae%20Jeong"> Hanjae Jeong</a>, <a href="https://publications.waset.org/search?q=Dongho%20Won"> Dongho Won</a>, <a href="https://publications.waset.org/search?q=Seungjoo%20Kim"> Seungjoo Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the Internet technology has developed rapidly, the number of identities (IDs) managed by each individual person has increased and various ID management technologies have been developed to assist users. However, most of these technologies are vulnerable to the existing hacking methods such as phishing attacks and key-logging. If the administrator-s password is exposed, an attacker can access the entire contents of the stolen user-s data files in other devices. To solve these problems, we propose here a new ID management scheme based on a Single Password Protocol. The paper presents the details of the new scheme as well as a formal analysis of the method using BAN Logic. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Anti-phishing" title="Anti-phishing">Anti-phishing</a>, <a href="https://publications.waset.org/search?q=BAN%20Logic" title=" BAN Logic"> BAN Logic</a>, <a href="https://publications.waset.org/search?q=ID%20management." title=" ID management."> ID management.</a> </p> <a href="https://publications.waset.org/14412/new-identity-management-scheme-and-its-formal-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14412/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14412/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14412/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14412/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14412/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14412/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14412/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14412/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14412/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14412/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14412.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1526</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1589</span> A New Splitting H1-Galerkin Mixed Method for Pseudo-hyperbolic Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yang%20Liu">Yang Liu</a>, <a href="https://publications.waset.org/search?q=Jinfeng%20Wang"> Jinfeng Wang</a>, <a href="https://publications.waset.org/search?q=Hong%20Li"> Hong Li</a>, <a href="https://publications.waset.org/search?q=Wei%20Gao"> Wei Gao</a>, <a href="https://publications.waset.org/search?q=Siriguleng%20He"> Siriguleng He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A new numerical scheme based on the H1-Galerkin mixed finite element method for a class of second-order pseudohyperbolic equations is constructed. The proposed procedures can be split into three independent differential sub-schemes and does not need to solve a coupled system of equations. Optimal error estimates are derived for both semidiscrete and fully discrete schemes for problems in one space dimension. And the proposed method dose not requires the LBB consistency condition. Finally, some numerical results are provided to illustrate the efficacy of our method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Pseudo-hyperbolic%20equations" title="Pseudo-hyperbolic equations">Pseudo-hyperbolic equations</a>, <a href="https://publications.waset.org/search?q=splitting%20system" title=" splitting system"> splitting system</a>, <a href="https://publications.waset.org/search?q=H1-Galerkin%20mixed%20method" title=" H1-Galerkin mixed method"> H1-Galerkin mixed method</a>, <a href="https://publications.waset.org/search?q=error%20estimates." title=" error estimates."> error estimates.</a> </p> <a href="https://publications.waset.org/9984/a-new-splitting-h1-galerkin-mixed-method-for-pseudo-hyperbolic-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9984/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9984/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9984/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9984/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9984/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9984/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9984/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9984/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9984/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9984/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9984.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1502</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1588</span> Foil Bearing Stiffness Estimation with Pseudospectral Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Balaji%20Sankar">Balaji Sankar</a>, <a href="https://publications.waset.org/search?q=Sadanand%20Kulkarni"> Sadanand Kulkarni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Compliant foil gas lubricated bearings are used for the support of light loads in the order of few kilograms at high speeds, in the order of 50,000 RPM. The stiffness of the foil bearings depends both on the stiffness of the compliant foil and on the lubricating gas film. The stiffness of the bearings plays a crucial role in the stable operation of the supported rotor over a range of speeds. This paper describes a numerical approach to estimate the stiffness of the bearings using pseudo spectral scheme. Methodology to obtain the stiffness of the foil bearing as a function of weight of the shaft is given and the results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Foil%20bearing" title="Foil bearing">Foil bearing</a>, <a href="https://publications.waset.org/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/search?q=numerical" title=" numerical"> numerical</a>, <a href="https://publications.waset.org/search?q=stiffness%0D%0Aestimation." title=" stiffness estimation."> stiffness estimation.</a> </p> <a href="https://publications.waset.org/10004089/foil-bearing-stiffness-estimation-with-pseudospectral-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004089/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004089/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004089/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004089/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004089/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004089/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004089/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004089/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004089/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004089/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004089.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1242</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1587</span> Information Fusion for Identity Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Girija%20Chetty">Girija Chetty</a>, <a href="https://publications.waset.org/search?q=Monica%20Singh"> Monica Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we propose a novel approach for ascertaining human identity based on fusion of profile face and gait biometric cues The identification approach based on feature learning in PCA-LDA subspace, and classification using multivariate Bayesian classifiers allows significant improvement in recognition accuracy for low resolution surveillance video scenarios. The experimental evaluation of the proposed identification scheme on a publicly available database [2] showed that the fusion of face and gait cues in joint PCA-LDA space turns out to be a powerful method for capturing the inherent multimodality in walking gait patterns, and at the same time discriminating the person identity..</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Biometrics" title="Biometrics">Biometrics</a>, <a href="https://publications.waset.org/search?q=gait%20recognition" title=" gait recognition"> gait recognition</a>, <a href="https://publications.waset.org/search?q=PCA" title=" PCA"> PCA</a>, <a href="https://publications.waset.org/search?q=LDA" title=" LDA"> LDA</a>, <a href="https://publications.waset.org/search?q=Eigenface" title=" Eigenface"> Eigenface</a>, <a href="https://publications.waset.org/search?q=Fisherface" title=" Fisherface"> Fisherface</a>, <a href="https://publications.waset.org/search?q=Multivariate%20Gaussian%20Classifier" title=" Multivariate Gaussian Classifier"> Multivariate Gaussian Classifier</a> </p> <a href="https://publications.waset.org/11765/information-fusion-for-identity-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11765/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11765/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11765/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11765/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11765/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11765/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11765/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11765/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11765/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11765/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11765.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1779</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1586</span> A Rapid Code Acquisition Scheme in OOC-Based CDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Keunhong%20Chae">Keunhong Chae</a>, <a href="https://publications.waset.org/search?q=Seokho%20Yoon"> Seokho Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20acquisition" title="Code acquisition">Code acquisition</a>, <a href="https://publications.waset.org/search?q=optical%20CDMA" title=" optical CDMA"> optical CDMA</a>, <a href="https://publications.waset.org/search?q=optical%20orthogonal%0D%0Acode" title=" optical orthogonal code"> optical orthogonal code</a>, <a href="https://publications.waset.org/search?q=serial%20algorithm." title=" serial algorithm."> serial algorithm.</a> </p> <a href="https://publications.waset.org/10000869/a-rapid-code-acquisition-scheme-in-ooc-based-cdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000869/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000869/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000869/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000869/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000869/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000869/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000869/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000869/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000869/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000869/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000869.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2157</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1585</span> A Normalization-based Robust Image Watermarking Scheme Using SVD and DCT</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Say%20Wei%20Foo">Say Wei Foo</a>, <a href="https://publications.waset.org/search?q=Qi%20Dong"> Qi Dong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital watermarking is one of the techniques for copyright protection. In this paper, a normalization-based robust image watermarking scheme which encompasses singular value decomposition (SVD) and discrete cosine transform (DCT) techniques is proposed. For the proposed scheme, the host image is first normalized to a standard form and divided into non-overlapping image blocks. SVD is applied to each block. By concatenating the first singular values (SV) of adjacent blocks of the normalized image, a SV block is obtained. DCT is then carried out on the SV blocks to produce SVD-DCT blocks. A watermark bit is embedded in the highfrequency band of a SVD-DCT block by imposing a particular relationship between two pseudo-randomly selected DCT coefficients. An adaptive frequency mask is used to adjust local watermark embedding strength. Watermark extraction involves mainly the inverse process. The watermark extracting method is blind and efficient. Experimental results show that the quality degradation of watermarked image caused by the embedded watermark is visually transparent. Results also show that the proposed scheme is robust against various image processing operations and geometric attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20watermarking" title="Image watermarking">Image watermarking</a>, <a href="https://publications.waset.org/search?q=Image%20normalization" title=" Image normalization"> Image normalization</a>, <a href="https://publications.waset.org/search?q=Singularvalue%20decomposition" title=" Singularvalue decomposition"> Singularvalue decomposition</a>, <a href="https://publications.waset.org/search?q=Discrete%20cosine%20transform" title=" Discrete cosine transform"> Discrete cosine transform</a>, <a href="https://publications.waset.org/search?q=Robustness." title=" Robustness."> Robustness.</a> </p> <a href="https://publications.waset.org/11749/a-normalization-based-robust-image-watermarking-scheme-using-svd-and-dct" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11749/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11749/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11749/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11749/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11749/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11749/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11749/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11749/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11749/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11749/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11749.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2096</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1584</span> Visual Identity Components of Tourist Destination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Petra%20Barisic">Petra Barisic</a>, <a href="https://publications.waset.org/search?q=Zrinka%20Blazevic"> Zrinka Blazevic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In the world of modern communications, visual identity has predominant influence on the overall success of tourist destinations, but despite of these, the problem of designing thriving tourist destination visual identity and their components are hardly addressed. This study highlights the importance of building and managing the visual identity of tourist destination, and based on the empirical study of well-known Mediterranean destination of Croatia analyses three main components of tourist destination visual identity; name, slogan, and logo. Moreover, the paper shows how respondents perceive each component of Croatia’s visual identity. According to study, logo is the most important, followed by the name and slogan. Research also reveals that Croatian economy lags behind developed countries in understanding the importance of visual identity, and its influence on marketing goal achievements.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Components%20of%20visual%20identity" title="Components of visual identity">Components of visual identity</a>, <a href="https://publications.waset.org/search?q=Croatia" title=" Croatia"> Croatia</a>, <a href="https://publications.waset.org/search?q=tourist%20destination" title=" tourist destination"> tourist destination</a>, <a href="https://publications.waset.org/search?q=visual%20identity." title=" visual identity."> visual identity.</a> </p> <a href="https://publications.waset.org/9998818/visual-identity-components-of-tourist-destination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998818/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998818/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998818/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998818/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998818/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998818/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998818/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998818/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998818/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998818/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998818.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3487</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1583</span> A Nonoblivious Image Watermarking System Based on Singular Value Decomposition and Texture Segmentation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Soroosh%20Rezazadeh">Soroosh Rezazadeh</a>, <a href="https://publications.waset.org/search?q=Mehran%20Yazdi"> Mehran Yazdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a robust digital image watermarking scheme for copyright protection applications using the singular value decomposition (SVD) is proposed. In this scheme, an entropy masking model has been applied on the host image for the texture segmentation. Moreover, the local luminance and textures of the host image are considered for watermark embedding procedure to increase the robustness of the watermarking scheme. In contrast to all existing SVD-based watermarking systems that have been designed to embed visual watermarks, our system uses a pseudo-random sequence as a watermark. We have tested the performance of our method using a wide variety of image processing attacks on different test images. A comparison is made between the results of our proposed algorithm with those of a wavelet-based method to demonstrate the superior performance of our algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Watermarking" title="Watermarking">Watermarking</a>, <a href="https://publications.waset.org/search?q=copyright%20protection" title=" copyright protection"> copyright protection</a>, <a href="https://publications.waset.org/search?q=singular%20value%0Adecomposition" title=" singular value decomposition"> singular value decomposition</a>, <a href="https://publications.waset.org/search?q=entropy%20masking" title=" entropy masking"> entropy masking</a>, <a href="https://publications.waset.org/search?q=texture%20segmentation." title=" texture segmentation."> texture segmentation.</a> </p> <a href="https://publications.waset.org/2735/a-nonoblivious-image-watermarking-system-based-on-singular-value-decomposition-and-texture-segmentation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2735/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2735/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2735/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2735/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2735/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2735/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2735/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2735/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2735/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2735/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2735.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1763</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1582</span> The Variable Step-Size Gauss-Seidel Pseudo Affine Projection Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20Albu">F. Albu</a>, <a href="https://publications.waset.org/search?q=C.%20Paleologu"> C. Paleologu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new pseudo affine projection (AP) algorithm based on Gauss-Seidel (GS) iterations is proposed for acoustic echo cancellation (AEC). It is shown that the algorithm is robust against near-end signal variations (including double-talk). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=pseudo%20affine%20projection%20algorithm" title="pseudo affine projection algorithm">pseudo affine projection algorithm</a>, <a href="https://publications.waset.org/search?q=acoustic%20echo%0Acancellation" title=" acoustic echo cancellation"> acoustic echo cancellation</a>, <a href="https://publications.waset.org/search?q=double-talk." title=" double-talk."> double-talk.</a> </p> <a href="https://publications.waset.org/8294/the-variable-step-size-gauss-seidel-pseudo-affine-projection-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8294/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8294/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8294/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8294/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8294/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8294/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8294/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8294/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8294/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8294/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8294.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1426</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1581</span> A Fast Code Acquisition Scheme for O-CDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Youngpo%20Lee">Youngpo Lee</a>, <a href="https://publications.waset.org/search?q=Jaewoo%20Lee"> Jaewoo Lee</a>, <a href="https://publications.waset.org/search?q=Seokho%20Yoon"> Seokho Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a fast code acquisition scheme for optical code division multiple access (O-CDMA) systems. Unlike the conventional scheme, the proposed scheme employs multiple thresholds providing a shorter mean acquisition time (MAT) performance. The simulation results show that the MAT of the proposed scheme is shorter than that of the conventional scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optical%20CDMA" title="Optical CDMA">Optical CDMA</a>, <a href="https://publications.waset.org/search?q=acquisition" title=" acquisition"> acquisition</a>, <a href="https://publications.waset.org/search?q=MAT" title=" MAT"> MAT</a>, <a href="https://publications.waset.org/search?q=multiple-shift" title=" multiple-shift"> multiple-shift</a> </p> <a href="https://publications.waset.org/455/a-fast-code-acquisition-scheme-for-o-cdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/455/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/455/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/455/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/455/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/455/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/455/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/455/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/455/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/455/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/455/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/455.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1955</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1580</span> Characterization of Banana (Musa spp.) Pseudo-Stem and Fruit-Bunch-Stem as a Potential Renewable Energy Resource</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nurhayati%20Abdullah">Nurhayati Abdullah</a>, <a href="https://publications.waset.org/search?q=Fauziah%20Sulaiman"> Fauziah Sulaiman</a>, <a href="https://publications.waset.org/search?q=Muhamad%20Azman%20Miskam"> Muhamad Azman Miskam</a>, <a href="https://publications.waset.org/search?q=Rahmad%20Mohd%20Taib"> Rahmad Mohd Taib</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Banana pseudo-stem and fruit-bunch-stem are agricultural residues that can be used for conversion to bio-char, biooil, and gases by using thermochemical process. The aim of this work is to characterize banana pseudo-stem and banana fruit-bunch-stem through proximate analysis, elemental analysis, chemical analysis, thermo-gravimetric analysis, and heating calorific value. The ash contents of the banana pseudo-stem and banana fruit-bunch-stem are 11.0 mf wt.% and 20.6 mf wt.%; while the carbon content of banana pseudo-stem and fruit-bunch-stem are 37.9 mf wt.% and 35.58 mf wt.% respectively. The molecular formulas for banana stem and banana fruit-bunch-stem are C24H33NO26 and C19H29NO33 respectively. The measured higher heating values of banana pseudostem and banana fruit-bunch-stem are 15.5MJ/kg and 12.7 MJ/kg respectively. By chemical analysis, the lignin, cellulose, and hemicellulose contents in the samples will also be presented. The feasibility of the banana wastes to be a feedstock for thermochemical process in comparison with other biomass will be discussed in this paper.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Banana%20Waste" title="Banana Waste">Banana Waste</a>, <a href="https://publications.waset.org/search?q=Biomass" title=" Biomass"> Biomass</a>, <a href="https://publications.waset.org/search?q=Renewable%20Energy" title=" Renewable Energy"> Renewable Energy</a>, <a href="https://publications.waset.org/search?q=Thermo-chemical%20Characteristics." title=" Thermo-chemical Characteristics."> Thermo-chemical Characteristics.</a> </p> <a href="https://publications.waset.org/9998963/characterization-of-banana-musa-spp-pseudo-stem-and-fruit-bunch-stem-as-a-potential-renewable-energy-resource" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998963/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998963/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998963/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998963/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998963/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998963/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998963/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998963/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998963/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998963/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998963.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">8753</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1579</span> Crank-Nicolson Difference Scheme for the Generalized Rosenau-Burgers Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kelong%20Zheng">Kelong Zheng</a>, <a href="https://publications.waset.org/search?q=Jinsong%20Hu"> Jinsong Hu</a>, <a href="https://publications.waset.org/search?q="></a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, numerical solution for the generalized Rosenau-Burgers equation is considered and Crank-Nicolson finite difference scheme is proposed. Existence of the solutions for the difference scheme has been shown. Stability, convergence and priori error estimate of the scheme are proved. Numerical results demonstrate that the scheme is efficient and reliable.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20Rosenau-Burgers%20equation" title="Generalized Rosenau-Burgers equation">Generalized Rosenau-Burgers equation</a>, <a href="https://publications.waset.org/search?q=difference%20scheme" title=" difference scheme"> difference scheme</a>, <a href="https://publications.waset.org/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/search?q=convergence." title=" convergence."> convergence.</a> </p> <a href="https://publications.waset.org/5315/crank-nicolson-difference-scheme-for-the-generalized-rosenau-burgers-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5315/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5315/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5315/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5315/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5315/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5315/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5315/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5315/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5315/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5315/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5315.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1865</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1578</span> Color Image Edge Detection using Pseudo-Complement and Matrix Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20N.%20Janakiraman">T. N. Janakiraman</a>, <a href="https://publications.waset.org/search?q=P.%20V.%20S.%20S.%20R.%20Chandra%20Mouli"> P. V. S. S. R. Chandra Mouli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A color image edge detection algorithm is proposed in this paper using Pseudo-complement and matrix rotation operations. First, pseudo-complement method is applied on the image for each channel. Then, matrix operations are applied on the output image of the first stage. Dominant pixels are obtained by image differencing between the pseudo-complement image and the matrix operated image. Median filtering is carried out to smoothen the image thereby removing the isolated pixels. Finally, the dominant or core pixels occurring in at least two channels are selected. On plotting the selected edge pixels, the final edge map of the given color image is obtained. The algorithm is also tested in HSV and YCbCr color spaces. Experimental results on both synthetic and real world images show that the accuracy of the proposed method is comparable to other color edge detectors. All the proposed procedures can be applied to any image domain and runs in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Color%20edge%20detection" title="Color edge detection">Color edge detection</a>, <a href="https://publications.waset.org/search?q=dominant%20pixels" title=" dominant pixels"> dominant pixels</a>, <a href="https://publications.waset.org/search?q=matrixrotation%2Fshift%20operations" title=" matrixrotation/shift operations"> matrixrotation/shift operations</a>, <a href="https://publications.waset.org/search?q=pseudo-complement." title=" pseudo-complement."> pseudo-complement.</a> </p> <a href="https://publications.waset.org/2069/color-image-edge-detection-using-pseudo-complement-and-matrix-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2069/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2069/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2069/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2069/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2069/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2069/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2069/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2069/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2069/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2069/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2069.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2331</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1577</span> A Novel Transmission Scheme for Reliable Cooperative Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Won-Jun%20Choi">Won-Jun Choi</a>, <a href="https://publications.waset.org/search?q=Seung-Jun%20Yu"> Seung-Jun Yu</a>, <a href="https://publications.waset.org/search?q=Jung-In%20Baik"> Jung-In Baik</a>, <a href="https://publications.waset.org/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cooperative communication scheme can be substituted for multiple-input multiple-output (MIMO) technique when it may not be able to support multiple antennas due to size, cost or hardware limitations. In other words, cooperative communication scheme is an efficient method to achieve spatial diversity without multiple antennas. For satisfaction of rising QoS, we propose a reliable cooperative communication scheme with M-QAM based Dual Carrier Modulation (M-DCM), which can increase diversity gain. Although our proposed scheme is very simple method, it gives us frequency and spatial diversity. Simulation result shows our proposed scheme obtains diversity gain more than the conventional cooperative communication scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=cooperation" title="cooperation">cooperation</a>, <a href="https://publications.waset.org/search?q=diversity" title=" diversity"> diversity</a>, <a href="https://publications.waset.org/search?q=M-DCM" title=" M-DCM"> M-DCM</a>, <a href="https://publications.waset.org/search?q=OFDM." title=" OFDM."> OFDM.</a> </p> <a href="https://publications.waset.org/3018/a-novel-transmission-scheme-for-reliable-cooperative-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3018/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3018/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3018/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3018/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3018/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3018/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3018/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3018/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3018/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3018/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3018.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1642</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1576</span> Efficient Iterative Detection Technique in Wireless Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hwan-Jun%20Choi">Hwan-Jun Choi</a>, <a href="https://publications.waset.org/search?q=Sung-Bok%20Choi"> Sung-Bok Choi</a>, <a href="https://publications.waset.org/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Recently, among the MIMO-OFDM detection techniques, a lot of papers suggested V-BLAST scheme which can achieve high data rate. Therefore, the signal detection of MIMO-OFDM system is important issue. In this paper, efficient iterative V-BLAST detection technique is proposed in wireless communication system. The proposed scheme adjusts the number of candidate symbol and iterative scheme based on channel state. According to the simulation result, the proposed scheme has better BER performance than conventional schemes and similar BER performance of the QRD-M with iterative scheme. Moreover complexity of proposed scheme has 50.6% less than complexity of QRD-M detection with iterative scheme. Therefore the proposed detection scheme can be efficiently used in wireless communication.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/search?q=V-BLAST" title=" V-BLAST"> V-BLAST</a>, <a href="https://publications.waset.org/search?q=QR-decomposition" title=" QR-decomposition"> QR-decomposition</a>, <a href="https://publications.waset.org/search?q=QRD-M" title=" QRD-M"> QRD-M</a>, <a href="https://publications.waset.org/search?q=DFE" title=" DFE"> DFE</a>, <a href="https://publications.waset.org/search?q=Iterative%20scheme" title=" Iterative scheme"> Iterative scheme</a>, <a href="https://publications.waset.org/search?q=Channel%20condition." title=" Channel condition."> Channel condition.</a> </p> <a href="https://publications.waset.org/9997129/efficient-iterative-detection-technique-in-wireless-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997129/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997129/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997129/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997129/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997129/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997129/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997129/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997129/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997129/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997129/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997129.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2056</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1575</span> A Robust TVD-WENO Scheme for Conservation Laws</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Abdalla">A. Abdalla</a>, <a href="https://publications.waset.org/search?q=A.%20Kaltayev"> A. Kaltayev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The ultimate goal of this article is to develop a robust and accurate numerical method for solving hyperbolic conservation laws in one and two dimensions. A hybrid numerical method, coupling a cheap fourth order total variation diminishing (TVD) scheme [1] for smooth region and a Robust seventh-order weighted non-oscillatory (WENO) scheme [2] near discontinuities, is considered. High order multi-resolution analysis is used to detect the high gradients regions of the numerical solution in order to capture the shocks with the WENO scheme, while the smooth regions are computed with fourth order total variation diminishing (TVD). For time integration, we use the third order TVD Runge-Kutta scheme. The accuracy of the resulting hybrid high order scheme is comparable with these of WENO, but with significant decrease of the CPU cost. Numerical demonstrates that the proposed scheme is comparable to the high order WENO scheme and superior to the fourth order TVD scheme. Our scheme has the added advantage of simplicity and computational efficiency. Numerical tests are presented which show the robustness and effectiveness of the proposed scheme.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=WENO%20scheme" title="WENO scheme">WENO scheme</a>, <a href="https://publications.waset.org/search?q=TVD%20schemes" title=" TVD schemes"> TVD schemes</a>, <a href="https://publications.waset.org/search?q=smoothness%20indicators" title=" smoothness indicators"> smoothness indicators</a>, <a href="https://publications.waset.org/search?q=multi-resolution." title=" multi-resolution."> multi-resolution.</a> </p> <a href="https://publications.waset.org/310/a-robust-tvd-weno-scheme-for-conservation-laws" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/310/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/310/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/310/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/310/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/310/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/310/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/310/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/310/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/310/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/310/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/310.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2014</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1574</span> A Multi-Signature Scheme based on Coding Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammed%20Meziani">Mohammed Meziani</a>, <a href="https://publications.waset.org/search?q=Pierre-Louis%20Cayrel"> Pierre-Louis Cayrel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we propose two first non-generic constructions of multisignature scheme based on coding theory. The first system make use of the CFS signature scheme and is secure in random oracle while the second scheme is based on the KKS construction and is a few times. The security of our construction relies on a difficult problems in coding theory: The Syndrome Decoding problem which has been proved NP-complete [4]. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Post-quantum%20cryptography" title="Post-quantum cryptography">Post-quantum cryptography</a>, <a href="https://publications.waset.org/search?q=Coding-based%20cryptography" title=" Coding-based cryptography"> Coding-based cryptography</a>, <a href="https://publications.waset.org/search?q=Digital%20signature" title="Digital signature">Digital signature</a>, <a href="https://publications.waset.org/search?q=Multisignature%20scheme." title=" Multisignature scheme."> Multisignature scheme.</a> </p> <a href="https://publications.waset.org/5409/a-multi-signature-scheme-based-on-coding-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5409/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5409/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5409/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5409/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5409/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5409/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5409/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5409/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5409/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5409/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5409.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1880</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/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&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/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=53">53</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&page=54">54</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=pseudo%20voter%20identity%20scheme%20PVID.&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>