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: symmetric algorithm</title> <meta name="description" content="Search results for: symmetric algorithm"> <meta name="keywords" content="symmetric algorithm"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="symmetric algorithm" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="symmetric algorithm"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 2375</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: symmetric algorithm</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2375</span> A Variant of a Double Structure-Preserving QR Algorithm for Symmetric and Hamiltonian Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Salam">Ahmed Salam</a>, <a href="https://publications.waset.org/abstracts/search?q=Haithem%20Benkahla"> Haithem Benkahla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, an efficient backward-stable algorithm for computing eigenvalues and vectors of a symmetric and Hamiltonian matrix has been proposed. The method preserves the symmetric and Hamiltonian structures of the original matrix, during the whole process. In this paper, we revisit the method. We derive a way for implementing the reduction of the matrix to the appropriate condensed form. Then, we construct a novel version of the implicit QR-algorithm for computing the eigenvalues and vectors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20implicit%20QR%20algorithm" title="block implicit QR algorithm">block implicit QR algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=preservation%20of%20a%20double%20structure" title=" preservation of a double structure"> preservation of a double structure</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20algorithm" title=" QR algorithm"> QR algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20and%20Hamiltonian%20structures" title=" symmetric and Hamiltonian structures"> symmetric and Hamiltonian structures</a> </p> <a href="https://publications.waset.org/abstracts/61018/a-variant-of-a-double-structure-preserving-qr-algorithm-for-symmetric-and-hamiltonian-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61018.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">409</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2374</span> Symmetric Arabic Language Encryption Technique Based on Modified Playfair Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fairouz%20Beggas">Fairouz Beggas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the large number of exchanges in the networks, the security of communications is essential. Most ways of keeping communication secure rely on encryption. In this work, a symmetric encryption technique is offered to encrypt and decrypt simple Arabic scripts based on a multi-level security. A proposed technique uses an idea of Playfair encryption with a larger table size and an additional layer of encryption to ensure more security. The idea of the proposed algorithm aims to generate a dynamic table that depends on a secret key. The same secret key is also used to create other secret keys to over-encrypt the plaintext in three steps. The obtained results show that the proposed algorithm is faster in terms of encryption/decryption speed and can resist to many types of attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arabic%20data" title="arabic data">arabic data</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=playfair" title=" playfair"> playfair</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm" title=" symmetric algorithm"> symmetric algorithm</a> </p> <a href="https://publications.waset.org/abstracts/159982/symmetric-arabic-language-encryption-technique-based-on-modified-playfair-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159982.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">88</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2373</span> The Permutation of Symmetric Triangular Equilateral Group in the Cryptography of Private and Public Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fola%20John%20Adeyeye">Fola John Adeyeye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a cryptosystem private and public key base on symmetric group Pn and validates its theoretical formulation. This proposed system benefits from the algebraic properties of Pn such as noncommutative high logical, computational speed and high flexibility in selecting key which makes the discrete permutation multiplier logic (DPML) resist to attack by any algorithm such as Pohlig-Hellman. One of the advantages of this scheme is that it explore all the possible triangular symmetries. Against these properties, the only disadvantage is that the law of permutation multiplicity only allow an operation from left to right. Many other cryptosystems can be transformed into their symmetric group. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=private%20and%20public%20key" title=" private and public key"> private and public key</a>, <a href="https://publications.waset.org/abstracts/search?q=DPML" title=" DPML"> DPML</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20group%20Pn" title=" symmetric group Pn"> symmetric group Pn</a> </p> <a href="https://publications.waset.org/abstracts/103766/the-permutation-of-symmetric-triangular-equilateral-group-in-the-cryptography-of-private-and-public-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103766.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">202</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2372</span> Forward Stable Computation of Roots of Real Polynomials with Only Real Distinct Roots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nevena%20Jakov%C4%8Devi%C4%87%20Stor">Nevena Jakovčević Stor</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Slapni%C4%8Dar"> Ivan Slapničar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=roots%20of%20polynomials" title="roots of polynomials">roots of polynomials</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20decomposition" title=" eigenvalue decomposition"> eigenvalue decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=arrowhead%20matrix" title=" arrowhead matrix"> arrowhead matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20relative%20accuracy" title=" high relative accuracy"> high relative accuracy</a> </p> <a href="https://publications.waset.org/abstracts/40100/forward-stable-computation-of-roots-of-real-polynomials-with-only-real-distinct-roots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40100.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2371</span> Hybrid Algorithm for Non-Negative Matrix Factorization Based on Symmetric Kullback-Leibler Divergence for Signal Dependent Noise: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ana%20Serafimovic">Ana Serafimovic</a>, <a href="https://publications.waset.org/abstracts/search?q=Karthik%20Devarajan"> Karthik Devarajan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Non-negative matrix factorization approximates a high dimensional non-negative matrix V as the product of two non-negative matrices, W and H, and allows only additive linear combinations of data, enabling it to learn parts with representations in reality. It has been successfully applied in the analysis and interpretation of high dimensional data arising in neuroscience, computational biology, and natural language processing, to name a few. The objective of this paper is to assess a hybrid algorithm for non-negative matrix factorization with multiplicative updates. The method aims to minimize the symmetric version of Kullback-Leibler divergence known as intrinsic information and assumes that the noise is signal-dependent and that it originates from an arbitrary distribution from the exponential family. It is a generalization of currently available algorithms for Gaussian, Poisson, gamma and inverse Gaussian noise. We demonstrate the potential usefulness of the new generalized algorithm by comparing its performance to the baseline methods which also aim to minimize symmetric divergence measures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-negative%20matrix%20factorization" title="non-negative matrix factorization">non-negative matrix factorization</a>, <a href="https://publications.waset.org/abstracts/search?q=dimension%20reduction" title=" dimension reduction"> dimension reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=intrinsic%20information" title=" intrinsic information"> intrinsic information</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20information%20divergence" title=" symmetric information divergence"> symmetric information divergence</a>, <a href="https://publications.waset.org/abstracts/search?q=signal-dependent%20noise" title=" signal-dependent noise"> signal-dependent noise</a>, <a href="https://publications.waset.org/abstracts/search?q=exponential%20family" title=" exponential family"> exponential family</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Kullback-Leibler%20divergence" title=" generalized Kullback-Leibler divergence"> generalized Kullback-Leibler divergence</a>, <a href="https://publications.waset.org/abstracts/search?q=dual%20divergence" title=" dual divergence"> dual divergence</a> </p> <a href="https://publications.waset.org/abstracts/87069/hybrid-algorithm-for-non-negative-matrix-factorization-based-on-symmetric-kullback-leibler-divergence-for-signal-dependent-noise-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87069.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">246</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2370</span> Some Classes of Lorentzian Alpha-Sasakian Manifolds with Respect to Quarter-Symmetric Metric Connection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Santu%20Dey">Santu Dey</a>, <a href="https://publications.waset.org/abstracts/search?q=Arindam%20Bhattacharyya"> Arindam Bhattacharyya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The object of the present paper is to study a quarter-symmetric metric connection in a Lorentzian α-Sasakian manifold. We study some curvature properties of Lorentzian α-Sasakian manifold with respect to quarter-symmetric metric connection. We investigate quasi-projectively at, Φ-symmetric, Φ-projectively at Lorentzian α-Sasakian manifolds with respect to quarter-symmetric metric connection. We also discuss Lorentzian α-Sasakian manifold admitting quartersymmetric metric connection satisfying P.S = 0, where P denote the projective curvature tensor with respect to quarter-symmetric metric connection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quarter-symmetric%20metric%20connection" title="quarter-symmetric metric connection">quarter-symmetric metric connection</a>, <a href="https://publications.waset.org/abstracts/search?q=Lorentzian%20alpha-Sasakian%20manifold" title=" Lorentzian alpha-Sasakian manifold"> Lorentzian alpha-Sasakian manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi-projectively%20flat%20Lorentzian%20alpha-Sasakian%20manifold" title=" quasi-projectively flat Lorentzian alpha-Sasakian manifold"> quasi-projectively flat Lorentzian alpha-Sasakian manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=phi-symmetric%20manifold" title=" phi-symmetric manifold"> phi-symmetric manifold</a> </p> <a href="https://publications.waset.org/abstracts/66809/some-classes-of-lorentzian-alpha-sasakian-manifolds-with-respect-to-quarter-symmetric-metric-connection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66809.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">240</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2369</span> Impact of Population Size on Symmetric Travelling Salesman Problem Efficiency</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%27%20Alsharafat">Wafa' Alsharafat</a>, <a href="https://publications.waset.org/abstracts/search?q=Suhila%20Farhan%20Abu-Owida"> Suhila Farhan Abu-Owida </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithm (GA) is a powerful evolutionary searching technique that is used successfully to solve and optimize problems in different research areas. Genetic Algorithm (GA) considered as one of optimization methods used to solve Travel salesman Problem (TSP). The feasibility of GA in finding a TSP solution is dependent on GA operators; encoding method, population size, termination criteria, in general. In specific, crossover and its probability play a significant role in finding possible solutions for Symmetric TSP (STSP). In addition, the crossover should be determined and enhanced in term reaching optimal or at least near optimal. In this paper, we spot the light on using a modified crossover method called modified sequential constructive crossover and its impact on reaching optimal solution. To justify the relevance of a parameter value in solving the TSP, a set comparative analysis conducted on different crossover methods values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a>, <a href="https://publications.waset.org/abstracts/search?q=mutation" title=" mutation"> mutation</a>, <a href="https://publications.waset.org/abstracts/search?q=TSP" title=" TSP"> TSP</a> </p> <a href="https://publications.waset.org/abstracts/81306/impact-of-population-size-on-symmetric-travelling-salesman-problem-efficiency" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81306.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">227</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2368</span> Symmetric Key Encryption Algorithm Using Indian Traditional Musical Scale for Information Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aishwarya%20Talapuru">Aishwarya Talapuru</a>, <a href="https://publications.waset.org/abstracts/search?q=Sri%20Silpa%20Padmanabhuni"> Sri Silpa Padmanabhuni</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Jyoshna"> B. Jyoshna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cryptography helps in preventing threats to information security by providing various algorithms. This study introduces a new symmetric key encryption algorithm for information security which is linked with the "raagas" which means Indian traditional scale and pattern of music notes. This algorithm takes the plain text as input and starts its encryption process. The algorithm then randomly selects a raaga from the list of raagas that is assumed to be present with both sender and the receiver. The plain text is associated with the thus selected raaga and an intermediate cipher-text is formed as the algorithm converts the plain text characters into other characters, depending upon the rules of the algorithm. This intermediate code or cipher text is arranged in various patterns in three different rounds of encryption performed. The total number of rounds in the algorithm is equal to the multiples of 3. To be more specific, the outcome or output of the sequence of first three rounds is again passed as the input to this sequence of rounds recursively, till the total number of rounds of encryption is performed. The raaga selected by the algorithm and the number of rounds performed will be specified at an arbitrary location in the key, in addition to important information regarding the rounds of encryption, embedded in the key which is known by the sender and interpreted only by the receiver, thereby making the algorithm hack proof. The key can be constructed of any number of bits without any restriction to the size. A software application is also developed to demonstrate this process of encryption, which dynamically takes the plain text as input and readily generates the cipher text as output. Therefore, this algorithm stands as one of the strongest tools for information security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cipher%20text" title="cipher text">cipher text</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=plaintext" title=" plaintext"> plaintext</a>, <a href="https://publications.waset.org/abstracts/search?q=raaga" title=" raaga"> raaga</a> </p> <a href="https://publications.waset.org/abstracts/50374/symmetric-key-encryption-algorithm-using-indian-traditional-musical-scale-for-information-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50374.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2367</span> Evolutionary Methods in Cryptography </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%20Slaibi%20Alsharafat">Wafa Slaibi Alsharafat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithms (GA) are random algorithms as random numbers that are generated during the operation of the algorithm determine what happens. This means that if GA is applied twice to optimize exactly the same problem it might produces two different answers. In this project, we propose an evolutionary algorithm and Genetic Algorithm (GA) to be implemented in symmetric encryption and decryption. Here, user's message and user secret information (key) which represent plain text to be transferred into cipher text. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GA" title="GA">GA</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a> </p> <a href="https://publications.waset.org/abstracts/21507/evolutionary-methods-in-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21507.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">446</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2366</span> A Proposed Mechanism for Skewing Symmetric Distributions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20T.%20Alodat">M. T. Alodat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a mechanism for skewing any symmetric distribution. The new distribution is called the deflation-inflation distribution (DID). We discuss some statistical properties of the DID such moments, stochastic representation, log-concavity. Also we fit the distribution to real data and we compare it to normal distribution and Azzlaini's skew normal distribution. Numerical results show that the DID fits the the tree ring data better than the other two distributions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=normal%20distribution" title="normal distribution">normal distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=moments" title=" moments"> moments</a>, <a href="https://publications.waset.org/abstracts/search?q=Fisher%20information" title=" Fisher information"> Fisher information</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20distributions" title=" symmetric distributions"> symmetric distributions</a> </p> <a href="https://publications.waset.org/abstracts/28593/a-proposed-mechanism-for-skewing-symmetric-distributions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28593.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">659</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2365</span> DCT and Stream Ciphers for Improved Image Encryption Mechanism </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20R.%20Sharika">T. R. Sharika</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashwini%20Kumar"> Ashwini Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamal%20Bijlani"> Kamal Bijlani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption is the process of converting crucial information’s unreadable to unauthorized persons. Image security is an important type of encryption that secures all type of images from cryptanalysis. A stream cipher is a fast symmetric key algorithm which is used to convert plaintext to cipher text. In this paper we are proposing an image encryption algorithm with Discrete Cosine Transform and Stream Ciphers that can improve compression of images and enhanced security. The paper also explains the use of a shuffling algorithm for enhancing securing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=RC4%20cipher" title=" RC4 cipher"> RC4 cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a> </p> <a href="https://publications.waset.org/abstracts/32780/dct-and-stream-ciphers-for-improved-image-encryption-mechanism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2364</span> Material Failure Process Simulation by Improved Finite Elements with Embedded Discontinuities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gelacio%20Ju%C3%A1rez-Luna">Gelacio Juárez-Luna</a>, <a href="https://publications.waset.org/abstracts/search?q=Gustavo%20Ayala"> Gustavo Ayala</a>, <a href="https://publications.waset.org/abstracts/search?q=Jaime%20Retama-Velasco"> Jaime Retama-Velasco</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper shows the advantages of the material failure process simulation by improve finite elements with embedded discontinuities, using a new definition of traction vector, dependent on the discontinuity length and the angle. Particularly, two families of this kind of elements are compared: kinematically optimal symmetric and statically and kinematically optimal non-symmetric. The constitutive model to describe the behavior of the material in the symmetric formulation is a traction-displacement jump relationship equipped with softening after reaching the failure surface. To show the validity of this symmetric formulation, representative numerical examples illustrating the performance of the proposed formulation are presented. It is shown that the non-symmetric family may over or underestimate the energy required to create a discontinuity, as this effect is related with the total length of the discontinuity, fact that is not noticed when the discontinuity path is a straight line. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=variational%20formulation" title="variational formulation">variational formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20discontinuity" title=" strong discontinuity"> strong discontinuity</a>, <a href="https://publications.waset.org/abstracts/search?q=embedded%20discontinuities" title=" embedded discontinuities"> embedded discontinuities</a>, <a href="https://publications.waset.org/abstracts/search?q=strain%20localization" title=" strain localization "> strain localization </a> </p> <a href="https://publications.waset.org/abstracts/7919/material-failure-process-simulation-by-improved-finite-elements-with-embedded-discontinuities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7919.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">781</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2363</span> A Study on Ideals and Prime Ideals of Sub-Distributive Semirings and Its Applications to Symmetric Fuzzy Numbers </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rosy%20Joseph">Rosy Joseph</a> </p> <p class="card-text"><strong>Abstract:</strong></p> From an algebraic point of view, Semirings provide the most natural generalization of group theory and ring theory. In the absence of additive inverse in a semiring, one had to impose a weaker condition on the semiring, i.e., the additive cancellative law to study interesting structural properties. In many practical situations, fuzzy numbers are used to model imprecise observations derived from uncertain measurements or linguistic assessments. In this connection, a special class of fuzzy numbers whose shape is symmetric with respect to a vertical line called the symmetric fuzzy numbers i.e., for α ∈ (0, 1] the α − cuts will have a constant mid-point and the upper end of the interval will be a non-increasing function of α, the lower end will be the image of this function, is suitable. Based on this description, arithmetic operations and a ranking technique to order the symmetric fuzzy numbers were dealt with in detail. Wherein it was observed that the structure of the class of symmetric fuzzy numbers forms a commutative semigroup with cancellative property. Also, it forms a multiplicative monoid satisfying sub-distributive property.In this paper, we introduce the algebraic structure, sub-distributive semiring and discuss its various properties viz., ideals and prime ideals of sub-distributive semiring, sub-distributive ring of difference etc. in detail. Symmetric fuzzy numbers are visualized as an illustration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semirings" title="semirings">semirings</a>, <a href="https://publications.waset.org/abstracts/search?q=subdistributive%20ring%20of%20difference" title=" subdistributive ring of difference"> subdistributive ring of difference</a>, <a href="https://publications.waset.org/abstracts/search?q=subdistributive%20semiring" title=" subdistributive semiring"> subdistributive semiring</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20fuzzy%20numbers" title=" symmetric fuzzy numbers"> symmetric fuzzy numbers</a> </p> <a href="https://publications.waset.org/abstracts/84413/a-study-on-ideals-and-prime-ideals-of-sub-distributive-semirings-and-its-applications-to-symmetric-fuzzy-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84413.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">212</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2362</span> Non-Differentiable Mond-Weir Type Symmetric Duality under Generalized Invexity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jai%20Prakash%20Verma">Jai Prakash Verma</a>, <a href="https://publications.waset.org/abstracts/search?q=Khushboo%20Verma"> Khushboo Verma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present paper, a pair of Mond-Weir type non-differentiable multiobjective second-order programming problems, involving two kernel functions, where each of the objective functions contains support function, is formulated. We prove weak, strong and converse duality theorem for the second-order symmetric dual programs under η-pseudoinvexity conditions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-differentiable%20multiobjective%20programming" title="non-differentiable multiobjective programming">non-differentiable multiobjective programming</a>, <a href="https://publications.waset.org/abstracts/search?q=second-order%20symmetric%20duality" title=" second-order symmetric duality"> second-order symmetric duality</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency" title=" efficiency"> efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20function" title=" support function"> support function</a>, <a href="https://publications.waset.org/abstracts/search?q=eta-pseudoinvexity" title=" eta-pseudoinvexity"> eta-pseudoinvexity</a> </p> <a href="https://publications.waset.org/abstracts/57852/non-differentiable-mond-weir-type-symmetric-duality-under-generalized-invexity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57852.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2361</span> FPGA Implementation of Novel Triangular Systolic Array Based Architecture for Determining the Eigenvalues of Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soumitr%20Sanjay%20Dubey">Soumitr Sanjay Dubey</a>, <a href="https://publications.waset.org/abstracts/search?q=Shubhajit%20Roy%20Chowdhury"> Shubhajit Roy Chowdhury</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahul%20Shrestha"> Rahul Shrestha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have presented a novel approach of calculating eigenvalues of any matrix for the first time on Field Programmable Gate Array (FPGA) using Triangular Systolic Arra (TSA) architecture. Conventionally, additional computation unit is required in the architecture which is compliant to the algorithm for determining the eigenvalues and this in return enhances the delay and power consumption. However, recently reported works are only dedicated for symmetric matrices or some specific case of matrix. This works presents an architecture to calculate eigenvalues of any matrix based on QR algorithm which is fully implementable on FPGA. For the implementation of QR algorithm we have used TSA architecture, which is further utilising CORDIC (CO-ordinate Rotation DIgital Computer) algorithm, to calculate various trigonometric and arithmetic functions involved in the procedure. The proposed architecture gives an error in the range of 10−4. Power consumption by the design is 0.598W. It can work at the frequency of 900 MHz. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coordinate%20rotation%20digital%20computer" title="coordinate rotation digital computer">coordinate rotation digital computer</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20angle%20complex%20rotation" title=" three angle complex rotation"> three angle complex rotation</a>, <a href="https://publications.waset.org/abstracts/search?q=triangular%20systolic%20array" title=" triangular systolic array"> triangular systolic array</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20algorithm" title=" QR algorithm "> QR algorithm </a> </p> <a href="https://publications.waset.org/abstracts/40252/fpga-implementation-of-novel-triangular-systolic-array-based-architecture-for-determining-the-eigenvalues-of-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40252.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">415</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2360</span> Flexural Analysis of Symmetric Laminated Composite Timoshenko Beams under Harmonic Forces: An Analytical Solution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Ali%20Hjaji">Mohammed Ali Hjaji</a>, <a href="https://publications.waset.org/abstracts/search?q=A.K.%20El-Senussi"> A.K. El-Senussi</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20H.%20Eshtewi"> Said H. Eshtewi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The flexural dynamic response of symmetric laminated composite beams subjected to general transverse harmonic forces is investigated. The dynamic equations of motion and associated boundary conditions based on the first order shear deformation are derived through the use of Hamilton’s principle. The influences of shear deformation, rotary inertia, Poisson’s ratio and fibre orientation are incorporated in the present formulation. The resulting governing flexural equations for symmetric composite Timoshenko beams are exactly solved and the closed form solutions for steady state flexural response are then obtained for cantilever and simply supported boundary conditions. The applicability of the analytical closed-form solution is demonstrated via several examples with various transverse harmonic loads and symmetric cross-ply and angle-ply laminates. Results based on the present solution are assessed and validated against other well established finite element solutions and exact solutions available in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytical%20solution" title="analytical solution">analytical solution</a>, <a href="https://publications.waset.org/abstracts/search?q=flexural%20response" title=" flexural response"> flexural response</a>, <a href="https://publications.waset.org/abstracts/search?q=harmonic%20forces" title=" harmonic forces"> harmonic forces</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20laminated%20beams" title=" symmetric laminated beams"> symmetric laminated beams</a>, <a href="https://publications.waset.org/abstracts/search?q=steady%20state%20response" title=" steady state response"> steady state response</a> </p> <a href="https://publications.waset.org/abstracts/18423/flexural-analysis-of-symmetric-laminated-composite-timoshenko-beams-under-harmonic-forces-an-analytical-solution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18423.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">488</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2359</span> Co-Evolutionary Fruit Fly Optimization Algorithm and Firefly Algorithm for Solving Unconstrained Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20M.%20Rizk-Allah">R. M. Rizk-Allah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents co-evolutionary fruit fly optimization algorithm based on firefly algorithm (CFOA-FA) for solving unconstrained optimization problems. The proposed algorithm integrates the merits of fruit fly optimization algorithm (FOA), firefly algorithm (FA) and elite strategy to refine the performance of classical FOA. Moreover, co-evolutionary mechanism is performed by applying FA procedures to ensure the diversity of the swarm. Finally, the proposed algorithm CFOA- FA is tested on several benchmark problems from the usual literature and the numerical results have demonstrated the superiority of the proposed algorithm for finding the global optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=firefly%20algorithm" title="firefly algorithm">firefly algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fruit%20fly%20optimization%20algorithm" title=" fruit fly optimization algorithm"> fruit fly optimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems" title=" unconstrained optimization problems"> unconstrained optimization problems</a> </p> <a href="https://publications.waset.org/abstracts/15923/co-evolutionary-fruit-fly-optimization-algorithm-and-firefly-algorithm-for-solving-unconstrained-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15923.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">536</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2358</span> A Watermarking Signature Scheme with Hidden Watermarks and Constraint Functions in the Symmetric Key Setting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yanmin%20Zhao">Yanmin Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Siu%20Ming%20Yiu"> Siu Ming Yiu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To claim the ownership for an executable program is a non-trivial task. An emerging direction is to add a watermark to the program such that the watermarked program preserves the original program’s functionality and removing the watermark would heavily destroy the functionality of the watermarked program. In this paper, the first watermarking signature scheme with the watermark and the constraint function hidden in the symmetric key setting is constructed. The scheme uses well-known techniques of lattice trapdoors and a lattice evaluation. The watermarking signature scheme is unforgeable under the Short Integer Solution (SIS) assumption and satisfies other security requirements such as the unremovability security property. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=short%20integer%20solution%20%28SIS%29%20problem" title="short integer solution (SIS) problem">short integer solution (SIS) problem</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric-key%20setting" title=" symmetric-key setting"> symmetric-key setting</a>, <a href="https://publications.waset.org/abstracts/search?q=watermarking%20schemes" title=" watermarking schemes"> watermarking schemes</a>, <a href="https://publications.waset.org/abstracts/search?q=watermarked%20signatures" title=" watermarked signatures"> watermarked signatures</a> </p> <a href="https://publications.waset.org/abstracts/126087/a-watermarking-signature-scheme-with-hidden-watermarks-and-constraint-functions-in-the-symmetric-key-setting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126087.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">133</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2357</span> 1D Klein-Gordon Equation in an Infinite Square Well with PT Symmetry Boundary Conditions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suleiman%20Bashir%20Adamu">Suleiman Bashir Adamu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lawan%20Sani%20Taura"> Lawan Sani Taura</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the role of boundary conditions via -symmetric quantum mechanics, where denotes parity operator and denotes time reversal operator. Using the one-dimensional Schrödinger Hamiltonian for a free particle in an infinite square well, we introduce symmetric boundary conditions. We find solutions of the 1D Klein-Gordon equation for a free particle in an infinite square well with Hermitian boundary and symmetry boundary conditions, where in both cases the energy eigenvalues and eigenfunction, respectively, are obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eigenvalues" title="Eigenvalues">Eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=Eigenfunction" title=" Eigenfunction"> Eigenfunction</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian" title=" Hamiltonian"> Hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=Klein-%20Gordon%20equation" title=" Klein- Gordon equation"> Klein- Gordon equation</a>, <a href="https://publications.waset.org/abstracts/search?q=PT-symmetric%20quantum%20mechanics" title=" PT-symmetric quantum mechanics"> PT-symmetric quantum mechanics</a> </p> <a href="https://publications.waset.org/abstracts/50876/1d-klein-gordon-equation-in-an-infinite-square-well-with-pt-symmetry-boundary-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50876.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">383</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2356</span> A Hybrid Multi-Objective Firefly-Sine Cosine Algorithm for Multi-Objective Optimization Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaohuizi%20Guo">Gaohuizi Guo</a>, <a href="https://publications.waset.org/abstracts/search?q=Ning%20Zhang"> Ning Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Firefly algorithm (FA) and Sine Cosine algorithm (SCA) are two very popular and advanced metaheuristic algorithms. However, these algorithms applied to multi-objective optimization problems have some shortcomings, respectively, such as premature convergence and limited exploration capability. Combining the privileges of FA and SCA while avoiding their deficiencies may improve the accuracy and efficiency of the algorithm. This paper proposes a hybridization of FA and SCA algorithms, named multi-objective firefly-sine cosine algorithm (MFA-SCA), to develop a more efficient meta-heuristic algorithm than FA and SCA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=firefly%20algorithm" title="firefly algorithm">firefly algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20algorithm" title=" hybrid algorithm"> hybrid algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sine%20cosine%20algorithm" title=" sine cosine algorithm"> sine cosine algorithm</a> </p> <a href="https://publications.waset.org/abstracts/129731/a-hybrid-multi-objective-firefly-sine-cosine-algorithm-for-multi-objective-optimization-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129731.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">169</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2355</span> A New Block Cipher for Resource-Constrained Internet of Things Devices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Rana">Muhammad Rana</a>, <a href="https://publications.waset.org/abstracts/search?q=Quazi%20Mamun"> Quazi Mamun</a>, <a href="https://publications.waset.org/abstracts/search?q=Rafiqul%20Islam"> Rafiqul Islam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the Internet of Things (IoT), many devices are connected and accumulate a sheer amount of data. These Internet-driven raw data need to be transferred securely to the end-users via dependable networks. Consequently, the challenges of IoT security in various IoT domains are paramount. Cryptography is being applied to secure the networks for authentication, confidentiality, data integrity and access control. However, due to the resource constraint properties of IoT devices, the conventional cipher may not be suitable in all IoT networks. This paper designs a robust and effective lightweight cipher to secure the IoT environment and meet the resource-constrained nature of IoT devices. We also propose a symmetric and block-cipher based lightweight cryptographic algorithm. The proposed algorithm increases the complexity of the block cipher, maintaining the lowest computational requirements possible. The proposed algorithm efficiently constructs the key register updating technique, reduces the number of encryption rounds, and adds a new layer between the encryption and decryption processes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=internet%20of%20things" title="internet of things">internet of things</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography%20block%20cipher" title=" cryptography block cipher"> cryptography block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=S-box" title=" S-box"> S-box</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20management" title=" key management"> key management</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a> </p> <a href="https://publications.waset.org/abstracts/148938/a-new-block-cipher-for-resource-constrained-internet-of-things-devices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148938.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">113</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2354</span> Approximating Fixed Points by a Two-Step Iterative Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/10341/approximating-fixed-points-by-a-two-step-iterative-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10341.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">550</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2353</span> Optimal Relaxation Parameters for Obtaining Efficient Iterative Methods for the Solution of Electromagnetic Scattering Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nadaniela%20Egidi">Nadaniela Egidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Pierluigi%20Maponi"> Pierluigi Maponi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximate solution of a time-harmonic electromagnetic scattering problem for inhomogeneous media is required in several application contexts, and its two-dimensional formulation is a Fredholm integral equation of the second kind. This integral equation provides a formulation for the direct scattering problem, but it has to be solved several times also in the numerical solution of the corresponding inverse scattering problem. The discretization of this Fredholm equation produces large and dense linear systems that are usually solved by iterative methods. In order to improve the efficiency of these iterative methods, we use the Symmetric SOR preconditioning, and we propose an algorithm for the evaluation of the associated relaxation parameter. We show the efficiency of the proposed algorithm by several numerical experiments, where we use two Krylov subspace methods, i.e., Bi-CGSTAB and GMRES. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fredholm%20integral%20equation" title="Fredholm integral equation">Fredholm integral equation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=preconditioning" title=" preconditioning"> preconditioning</a>, <a href="https://publications.waset.org/abstracts/search?q=scattering%20problem" title=" scattering problem"> scattering problem</a> </p> <a href="https://publications.waset.org/abstracts/142902/optimal-relaxation-parameters-for-obtaining-efficient-iterative-methods-for-the-solution-of-electromagnetic-scattering-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142902.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">104</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2352</span> A Quinary Coding and Matrix Structure Based Channel Hopping Algorithm for Blind Rendezvous in Cognitive Radio Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qinglin%20Liu">Qinglin Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhiyong%20Lin"> Zhiyong Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Zongheng%20Wei"> Zongheng Wei</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianfeng%20Wen"> Jianfeng Wen</a>, <a href="https://publications.waset.org/abstracts/search?q=Congming%20Yi"> Congming Yi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hai%20Liu"> Hai Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The multi-channel blind rendezvous problem in distributed cognitive radio networks (DCRNs) refers to how users in the network can hop to the same channel at the same time slot without any prior knowledge (i.e., each user is unaware of other users' information). The channel hopping (CH) technique is a typical solution to this blind rendezvous problem. In this paper, we propose a quinary coding and matrix structure-based CH algorithm called QCMS-CH. The QCMS-CH algorithm can guarantee the rendezvous of users using only one cognitive radio in the scenario of the asynchronous clock (i.e., arbitrary time drift between the users), heterogeneous channels (i.e., the available channel sets of users are distinct), and symmetric role (i.e., all users play a same role). The QCMS-CH algorithm first represents a randomly selected channel (denoted by R) as a fixed-length quaternary number. Then it encodes the quaternary number into a quinary bootstrapping sequence according to a carefully designed quaternary-quinary coding table with the prefix "R00". Finally, it builds a CH matrix column by column according to the bootstrapping sequence and six different types of elaborately generated subsequences. The user can access the CH matrix row by row and accordingly perform its channel, hoping to attempt rendezvous with other users. We prove the correctness of QCMS-CH and derive an upper bound on its Maximum Time-to-Rendezvous (MTTR). Simulation results show that the QCMS-CH algorithm outperforms the state-of-the-art in terms of the MTTR and the Expected Time-to-Rendezvous (ETTR). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=channel%20hopping" title="channel hopping">channel hopping</a>, <a href="https://publications.waset.org/abstracts/search?q=blind%20rendezvous" title=" blind rendezvous"> blind rendezvous</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio%20networks" title=" cognitive radio networks"> cognitive radio networks</a>, <a href="https://publications.waset.org/abstracts/search?q=quaternary-quinary%20coding" title=" quaternary-quinary coding"> quaternary-quinary coding</a> </p> <a href="https://publications.waset.org/abstracts/153152/a-quinary-coding-and-matrix-structure-based-channel-hopping-algorithm-for-blind-rendezvous-in-cognitive-radio-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153152.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">91</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2351</span> Digestion Optimization Algorithm: A Novel Bio-Inspired Intelligence for Global Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akintayo%20E.%20Akinsunmade">Akintayo E. Akinsunmade</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The digestion optimization algorithm is a novel biological-inspired metaheuristic method for solving complex optimization problems. The algorithm development was inspired by studying the human digestive system. The algorithm mimics the process of food ingestion, breakdown, absorption, and elimination to eﬀectively and eﬃciently search for optimal solutions. This algorithm was tested for optimal solutions on seven diﬀerent types of optimization benchmark functions. The algorithm produced optimal solutions with standard errors, which were compared with the exact solution of the test functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20algorithm" title="bio-inspired algorithm">bio-inspired algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=benchmark%20optimization%20functions" title=" benchmark optimization functions"> benchmark optimization functions</a>, <a href="https://publications.waset.org/abstracts/search?q=digestive%20system%20in%20human" title=" digestive system in human"> digestive system in human</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm%20development" title=" algorithm development"> algorithm development</a> </p> <a href="https://publications.waset.org/abstracts/194133/digestion-optimization-algorithm-a-novel-bio-inspired-intelligence-for-global-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194133.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">10</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2350</span> Magnetoviscous Effects on Axi-Symmetric Ferrofluid Flow over a Porous Rotating Disk with Suction/Injection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vikas%20Kumar">Vikas Kumar </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study is carried out to investigate the magneto-viscous effects on incompressible ferrofluid flow over a porous rotating disc with suction or injection on the surface of the disc subjected to a magnetic field. The flow under consideration is axi-symmetric steady ferrofluid flow of electrically non-conducting fluid. Karman’s transformation is used to convert the governing boundary layer equations involved in the problem to a system of non linear coupled differential equations. The solution of this system is obtained by using power series approximation. The flow characteristics i.e. radial, tangential, axial velocities and boundary layer displacement thickness are calculated for various values of MFD (magnetic field dependent) viscosity and for different values of suction injection parameter. Besides this, skin friction coefficients are also calculated on the surface of the disk. Thus, the obtained results are presented numerically and graphically in the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=axi-symmetric" title="axi-symmetric">axi-symmetric</a>, <a href="https://publications.waset.org/abstracts/search?q=ferrofluid" title=" ferrofluid"> ferrofluid</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetic%20field" title=" magnetic field"> magnetic field</a>, <a href="https://publications.waset.org/abstracts/search?q=porous%20rotating%20disk" title=" porous rotating disk"> porous rotating disk</a> </p> <a href="https://publications.waset.org/abstracts/2034/magnetoviscous-effects-on-axi-symmetric-ferrofluid-flow-over-a-porous-rotating-disk-with-suctioninjection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2034.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">397</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2349</span> Exploring Solutions in Extended Horava-Lifshitz Gravity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aziza%20Altaibayeva">Aziza Altaibayeva</a>, <a href="https://publications.waset.org/abstracts/search?q=Ertan%20G%C3%BCdekli"> Ertan Güdekli</a>, <a href="https://publications.waset.org/abstracts/search?q=Ratbay%20Myrzakulov"> Ratbay Myrzakulov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this letter, we explore exact solutions for the Horava-Lifshitz gravity. We use of an extension of this theory with first order dynamical lapse function. The equations of motion have been derived in a fully consistent scenario. We assume that there are some spherically symmetric families of exact solutions of this extended theory of gravity. We obtain exact solutions and investigate the singularity structures of these solutions. Specially, an exact solution with the regular horizon is found. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20gravity" title="quantum gravity">quantum gravity</a>, <a href="https://publications.waset.org/abstracts/search?q=Horava-Lifshitz%20gravity" title=" Horava-Lifshitz gravity"> Horava-Lifshitz gravity</a>, <a href="https://publications.waset.org/abstracts/search?q=black%20hole" title=" black hole"> black hole</a>, <a href="https://publications.waset.org/abstracts/search?q=spherically%20symmetric%20space%20times" title=" spherically symmetric space times "> spherically symmetric space times </a> </p> <a href="https://publications.waset.org/abstracts/18654/exploring-solutions-in-extended-horava-lifshitz-gravity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18654.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">581</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2348</span> Two-Dimensional Symmetric Half-Plane Recursive Doubly Complementary Digital Lattice Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chong-Jia%20Ciou"> Chong-Jia Ciou</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Hau%20Yang"> Yuan-Hau Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of two-dimensional (2-D) recursive doubly complementary (DC) digital filter design. We present a structure of 2-D recursive DC filters by using 2-D symmetric half-plane (SHP) recursive digital all-pass lattice filters (DALFs). The novelty of using 2-D SHP recursive DALFs to construct a 2-D recursive DC digital lattice filter is that the resulting 2-D SHP recursive DC digital lattice filter provides better performance than the existing 2-D SHP recursive DC digital filter. Moreover, the proposed structure possesses a favorable 2-D DC half-band (DC-HB) property that allows about half of the 2-D SHP recursive DALF’s coefficients to be zero. This leads to considerable savings in computational burden for implementation. To ensure the stability of a designed 2-D SHP recursive DC digital lattice filter, some necessary constraints on the phase of the 2-D SHP recursive DALF during the design process are presented. Design of a 2-D diamond-shape decimation/interpolation filter is presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=all-pass%20digital%20filter" title="all-pass digital filter">all-pass digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=doubly%20complementary" title=" doubly complementary"> doubly complementary</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice%20structure" title=" lattice structure"> lattice structure</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter" title=" symmetric half-plane digital filter"> symmetric half-plane digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=sampling%20rate%20conversion" title=" sampling rate conversion"> sampling rate conversion</a> </p> <a href="https://publications.waset.org/abstracts/40663/two-dimensional-symmetric-half-plane-recursive-doubly-complementary-digital-lattice-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40663.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">438</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2347</span> Improving the Performance of Back-Propagation Training Algorithm by Using ANN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Pratap%20Singh%20Kirar">Vishnu Pratap Singh Kirar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Artificial Neural Network (ANN) can be trained using backpropagation (BP). It is the most widely used algorithm for supervised learning with multi-layered feed-forward networks. Efficient learning by the BP algorithm is required for many practical applications. The BP algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a two-term algorithm consisting of a learning rate (LR) and a momentum factor (MF). The major drawbacks of the two-term BP learning algorithm are the problems of local minima and slow convergence speeds, which limit the scope for real-time applications. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and criteria for evaluating convergence are required to facilitate the application of the three terms BP algorithm. Although these two seem to be closely related, as described later, we summarize various improvements to overcome the drawbacks. Here we compare the different methods of convergence of the new three-term BP algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title="neural network">neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=backpropagation" title=" backpropagation"> backpropagation</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20minima" title=" local minima"> local minima</a>, <a href="https://publications.waset.org/abstracts/search?q=fast%20convergence%20rate" title=" fast convergence rate"> fast convergence rate</a> </p> <a href="https://publications.waset.org/abstracts/22746/improving-the-performance-of-back-propagation-training-algorithm-by-using-ann" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22746.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">498</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2346</span> Hybrid Bee Ant Colony Algorithm for Effective Load Balancing and Job Scheduling in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Yeboah">Thomas Yeboah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud Computing is newly paradigm in computing that promises a delivery of computing as a service rather than a product, whereby shared resources, software, and information are provided to computers and other devices as a utility (like the electricity grid) over a network (typically the Internet). As Cloud Computing is a newly style of computing on the internet. It has many merits along with some crucial issues that need to be resolved in order to improve reliability of cloud environment. These issues are related with the load balancing, fault tolerance and different security issues in cloud environment.In this paper the main concern is to develop an effective load balancing algorithm that gives satisfactory performance to both, cloud users and providers. This proposed algorithm (hybrid Bee Ant Colony algorithm) is a combination of two dynamic algorithms: Ant Colony Optimization and Bees Life algorithm. Ant Colony algorithm is used in this hybrid Bee Ant Colony algorithm to solve load balancing issues whiles the Bees Life algorithm is used for optimization of job scheduling in cloud environment. The results of the proposed algorithm shows that the hybrid Bee Ant Colony algorithm outperforms the performances of both Ant Colony algorithm and Bees Life algorithm when evaluated the proposed algorithm performances in terms of Waiting time and Response time on a simulator called CloudSim. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization%20algorithm" title="ant colony optimization algorithm">ant colony optimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=bees%20life%20algorithm" title=" bees life algorithm"> bees life algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=performance" title=" performance"> performance</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a> </p> <a href="https://publications.waset.org/abstracts/27139/hybrid-bee-ant-colony-algorithm-for-effective-load-balancing-and-job-scheduling-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27139.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">628</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=79">79</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=80">80</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>