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: pairing computation</title> <meta name="description" content="Search results for: pairing computation"> <meta name="keywords" content="pairing computation"> <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="pairing computation" 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="pairing computation"> <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> 584</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: pairing computation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">584</span> Scalable Systolic Multiplier over Binary Extension Fields Based on Two-Level Karatsuba Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chiou-Yng%20Lee">Chiou-Yng Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Wen-Yo%20Lee"> Wen-Yo Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chieh-Tsai%20Wu"> Chieh-Tsai Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Cheng-Chen%20Yang"> Cheng-Chen Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Shifted polynomial basis (SPB) is a variation of polynomial basis representation. SPB has potential for efficient bit-level and digit-level implementations of multiplication over binary extension fields with subquadratic space complexity. For efficient implementation of pairing computation with large finite fields, this paper presents a new SPB multiplication algorithm based on Karatsuba schemes, and used that to derive a novel scalable multiplier architecture. Analytical results show that the proposed multiplier provides a trade-off between space and time complexities. Our proposed multiplier is modular, regular, and suitable for very-large-scale integration (VLSI) implementations. It involves less area complexity compared to the multipliers based on traditional decomposition methods. It is therefore, more suitable for efficient hardware implementation of pairing based cryptography and elliptic curve cryptography (ECC) in constraint driven applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digit-serial%20systolic%20multiplier" title="digit-serial systolic multiplier">digit-serial systolic multiplier</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography%20%28ECC%29" title=" elliptic curve cryptography (ECC)"> elliptic curve cryptography (ECC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Karatsuba%20algorithm%20%28KA%29" title=" Karatsuba algorithm (KA)"> Karatsuba algorithm (KA)</a>, <a href="https://publications.waset.org/abstracts/search?q=shifted%20polynomial%20basis%20%28SPB%29" title=" shifted polynomial basis (SPB)"> shifted polynomial basis (SPB)</a>, <a href="https://publications.waset.org/abstracts/search?q=pairing%20computation" title=" pairing computation"> pairing computation</a> </p> <a href="https://publications.waset.org/abstracts/8169/scalable-systolic-multiplier-over-binary-extension-fields-based-on-two-level-karatsuba-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8169.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</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">583</span> Effective Charge Coupling in Low Dimensional Doped Quantum Antiferromagnets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suraka%20Bhattacharjee">Suraka Bhattacharjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranjan%20Chaudhury"> Ranjan Chaudhury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The interaction between the charge degrees of freedom for itinerant antiferromagnets is investigated in terms of generalized charge stiffness constant corresponding to nearest neighbour t-J model and t1-t2-t3-J model. The low dimensional hole doped antiferromagnets are the well known systems that can be described by the t-J-like models. Accordingly, we have used these models to investigate the fermionic pairing possibilities and the coupling between the itinerant charge degrees of freedom. A detailed comparison between spin and charge couplings highlights that the charge and spin couplings show very similar behaviour in the over-doped region, whereas, they show completely different trends in the lower doping regimes. Moreover, a qualitative equivalence between generalized charge stiffness and effective Coulomb interaction is also established based on the comparisons with other theoretical and experimental results. Thus it is obvious that the enhanced possibility of fermionic pairing is inherent in the reduction of Coulomb repulsion with increase in doping concentration. However, the increased possibility can not give rise to pairing without the presence of any other pair producing mechanism outside the t-J model. Therefore, one can conclude that the t-J-like models themselves solely are not capable of producing conventional momentum-based superconducting pairing on their own. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20charge%20stiffness%20constant" title="generalized charge stiffness constant">generalized charge stiffness constant</a>, <a href="https://publications.waset.org/abstracts/search?q=charge%20coupling" title=" charge coupling"> charge coupling</a>, <a href="https://publications.waset.org/abstracts/search?q=effective%20Coulomb%20interaction" title=" effective Coulomb interaction"> effective Coulomb interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=t-J-like%20models" title=" t-J-like models"> t-J-like models</a>, <a href="https://publications.waset.org/abstracts/search?q=momentum-space%20pairing" title=" momentum-space pairing"> momentum-space pairing</a> </p> <a href="https://publications.waset.org/abstracts/111537/effective-charge-coupling-in-low-dimensional-doped-quantum-antiferromagnets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111537.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">159</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">582</span> Equality, Friendship, and Violence in Slash or Yaoi Fan Art</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Proud%20Arunrangsiwed">Proud Arunrangsiwed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Slash or Yaoi fan art is the artwork that contains a homosexual relationship between fictional male characters, which were heterosexual in the original media. Previous belief about Slash or Yaoi fan art is that the fan fiction writers and the fan artists need to see the equality in romantic relationship. They do not prefer the pairing of man and woman, since both genders are not equal. The objectives of the current study are to confirm this belief, and to examine the relationship between equality found in Slash fan art, friendship in original media, and violence contained in fan art. Mean comparisons show that equality could be found in the pairing of hero and hero, but rarely found in the pairing of hero and villain. Regression analysis shows that the level of equality in fan art and friendship in original media are significant predictors of violence contained in fan art. Since villain-related pairings yield a high level of violence in fan art and a low level of equality, researchers of future studies should find the strategies to prevent fans to include villains in their Slash or Yaoi fan art. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=equality" title="equality">equality</a>, <a href="https://publications.waset.org/abstracts/search?q=fan%20art" title=" fan art"> fan art</a>, <a href="https://publications.waset.org/abstracts/search?q=slash" title=" slash"> slash</a>, <a href="https://publications.waset.org/abstracts/search?q=violence" title=" violence"> violence</a>, <a href="https://publications.waset.org/abstracts/search?q=yaoi" title=" yaoi"> yaoi</a> </p> <a href="https://publications.waset.org/abstracts/40603/equality-friendship-and-violence-in-slash-or-yaoi-fan-art" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40603.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">253</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">581</span> Solving 94-Bit ECDLP with 70 Computers in Parallel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shunsuke%20Miyoshi">Shunsuke Miyoshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Yasuyuki%20Nogami"> Yasuyuki Nogami</a>, <a href="https://publications.waset.org/abstracts/search?q=Takuya%20Kusaka"> Takuya Kusaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Nariyoshi%20Yamai"> Nariyoshi Yamai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Elliptic curve discrete logarithm problem (ECDLP) is one of problems on which the security of pairing-based cryptography is based. This paper considers Pollard's rho method to evaluate the security of ECDLP on Barreto-Naehrig (BN) curve that is an efficient pairing-friendly curve. Some techniques are proposed to make the rho method efficient. Especially, the group structure on BN curve, distinguished point method, and Montgomery trick are well-known techniques. This paper applies these techniques and shows its optimization. According to the experimental results for which a large-scale parallel system with MySQL is applied, 94-bit ECDLP was solved about 28 hours by parallelizing 71 computers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pollard%27s%20rho%20method" title="Pollard's rho method">Pollard's rho method</a>, <a href="https://publications.waset.org/abstracts/search?q=BN%20curve" title=" BN curve"> BN curve</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery%20multiplication" title=" Montgomery multiplication"> Montgomery multiplication</a> </p> <a href="https://publications.waset.org/abstracts/28038/solving-94-bit-ecdlp-with-70-computers-in-parallel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28038.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">272</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">580</span> Indexing and Incremental Approach Using Map Reduce Bipartite Graph (MRBG) for Mining Evolving Big Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adarsh%20Shroff">Adarsh Shroff</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Big data is a collection of dataset so large and complex that it becomes difficult to process using data base management tools. To perform operations like search, analysis, visualization on big data by using data mining; which is the process of extraction of patterns or knowledge from large data set. In recent years, the data mining applications become stale and obsolete over time. Incremental processing is a promising approach to refreshing mining results. It utilizes previously saved states to avoid the expense of re-computation from scratch. This project uses i2MapReduce, an incremental processing extension to Map Reduce, the most widely used framework for mining big data. I2MapReduce performs key-value pair level incremental processing rather than task level re-computation, supports not only one-step computation but also more sophisticated iterative computation, which is widely used in data mining applications, and incorporates a set of novel techniques to reduce I/O overhead for accessing preserved fine-grain computation states. To optimize the mining results, evaluate i2MapReduce using a one-step algorithm and three iterative algorithms with diverse computation characteristics for efficient mining. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=map%20reduce" title=" map reduce"> map reduce</a>, <a href="https://publications.waset.org/abstracts/search?q=incremental%20processing" title=" incremental processing"> incremental processing</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20computation" title=" iterative computation"> iterative computation</a> </p> <a href="https://publications.waset.org/abstracts/46413/indexing-and-incremental-approach-using-map-reduce-bipartite-graph-mrbg-for-mining-evolving-big-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46413.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">350</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">579</span> A Low-Latency Quadratic Extended Domain Modular Multiplier for Bilinear Pairing Based on Non-Least Positive Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yulong%20Jia">Yulong Jia</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiang%20Zhang"> Xiang Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ziyuan%20Wu"> Ziyuan Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiji%20Hu"> Shiji Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The calculation of bilinear pairing is the core of the SM9 algorithm, which relies on the underlying prime domain algorithm and the quadratic extension domain algorithm. Among the field algorithms, modular multiplication operation is the most time-consuming part. Therefore, the underlying modular multiplication algorithm is optimized to maximize the operation speed of bilinear pairings. This paper uses a modular multiplication method based on non-least positive (NLP) combined with Karatsuba and schoolbook multiplication to improve the Montgomery algorithm. At the same time, according to the characteristics of multiplication operation in the quadratic extension domain, a quadratic extension domain FP2-NLP modular multiplication algorithm for bilinear pairings is proposed, which effectively reduces the operation time of modular multiplication in the quadratic extension domain. The sub-expanded domain Fp₂ -NLP modular multiplication algorithm effectively reduces the operation time of modular multiplication under the second-expanded domain. The multiplication unit in the quadratic extension domain is implemented using SMIC55nm process, and two different implementation architectures are designed to cope with different application scenarios. Compared with the existing related literature, The output latency of this design can reach a minimum of 15 cycles. The shortest time for calculating the (AB+CD)r⁻¹ mod form is 37.5ns, and the comprehensive area-time product (AT) is 11400. The final R-ate pairing algorithm hardware accelerator consumes 2670k equivalent logic gates and 1.8ms computing time in 55nm process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sm9" title="sm9">sm9</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware" title=" hardware"> hardware</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery" title=" Montgomery"> Montgomery</a> </p> <a href="https://publications.waset.org/abstracts/194787/a-low-latency-quadratic-extended-domain-modular-multiplier-for-bilinear-pairing-based-on-non-least-positive-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194787.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">5</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">578</span> Verifiable Secure Computation of Large Scale Two-Point Boundary Value Problems Using Certificate Validation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yogita%20M.%20Ahire">Yogita M. Ahire</a>, <a href="https://publications.waset.org/abstracts/search?q=Nedal%20M.%20Mohammed"> Nedal M. Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20A.%20Hamoud"> Ahmed A. Hamoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scientific computation outsourcing is gaining popularity because it allows customers with limited computing resources and storage devices to outsource complex computation workloads to more powerful service providers. However, it raises some security and privacy concerns and challenges, such as customer input and output privacy, as well as cloud cheating behaviors. This study was motivated by these concerns and focused on privacy-preserving Two-Point Boundary Value Problems (BVP) as a common and realistic instance for verifiable safe multiparty computing. We'll look at the safe and verifiable schema with correctness guarantees by utilizing standard multiparty approaches to compute the result of a computation and then solely using verifiable ways to check that the result was right. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=verifiable%20computing" title="verifiable computing">verifiable computing</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=secure%20and%20privacy%20BVP" title=" secure and privacy BVP"> secure and privacy BVP</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20computation%20outsourcing" title=" secure computation outsourcing"> secure computation outsourcing</a> </p> <a href="https://publications.waset.org/abstracts/151558/verifiable-secure-computation-of-large-scale-two-point-boundary-value-problems-using-certificate-validation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151558.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">97</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">577</span> Dissociation of CDS from CVA Valuation Under Notation Changes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Henry">R. Henry</a>, <a href="https://publications.waset.org/abstracts/search?q=J-B.%20Paulin"> J-B. Paulin</a>, <a href="https://publications.waset.org/abstracts/search?q=St.%20Fauchille"> St. Fauchille</a>, <a href="https://publications.waset.org/abstracts/search?q=Ph.%20Delord"> Ph. Delord</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Benkirane"> K. Benkirane</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Brunel"> A. Brunel </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the CVA computation of interest rate swap is presented based on its rating. Rating and probability default given by Moody’s Investors Service are used to calculate our CVA for a specific swap with different maturities. With this computation, the influence of rating variation can be shown on CVA. The application is made to the analysis of Greek CDS variation during the period of Greek crisis between 2008 and 2011. The main point is the determination of correlation between the fluctuation of Greek CDS cumulative value and the variation of swap CVA due to change of rating <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CDS" title="CDS">CDS</a>, <a href="https://publications.waset.org/abstracts/search?q=computation" title=" computation"> computation</a>, <a href="https://publications.waset.org/abstracts/search?q=CVA" title=" CVA"> CVA</a>, <a href="https://publications.waset.org/abstracts/search?q=Greek%20crisis" title=" Greek crisis"> Greek crisis</a>, <a href="https://publications.waset.org/abstracts/search?q=interest%20rate%20swap" title=" interest rate swap"> interest rate swap</a>, <a href="https://publications.waset.org/abstracts/search?q=maturity" title=" maturity"> maturity</a>, <a href="https://publications.waset.org/abstracts/search?q=rating" title=" rating"> rating</a>, <a href="https://publications.waset.org/abstracts/search?q=swap" title=" swap"> swap</a> </p> <a href="https://publications.waset.org/abstracts/16483/dissociation-of-cds-from-cva-valuation-under-notation-changes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16483.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">309</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">576</span> Aperiodic and Asymmetric Fibonacci Quasicrystals: Next Big Future in Quantum Computation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jatindranath%20Gain">Jatindranath Gain</a>, <a href="https://publications.waset.org/abstracts/search?q=Madhumita%20DasSarkar"> Madhumita DasSarkar</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudakshina%20Kundu"> Sudakshina Kundu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum information is stored in states with multiple quasiparticles, which have a topological degeneracy. Topological quantum computation is concerned with two-dimensional many body systems that support excitations. Anyons are elementary building block of quantum computations. When anyons tunneling in a double-layer system can transition to an exotic non-Abelian state and produce Fibonacci anyons, which are powerful enough for universal topological quantum computation (TQC).Here the exotic behavior of Fibonacci Superlattice is studied by using analytical transfer matrix methods and hence Fibonacci anyons. This Fibonacci anyons can build a quantum computer which is very emerging and exciting field today’s in Nanophotonics and quantum computation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quasicrystals" title=" quasicrystals"> quasicrystals</a>, <a href="https://publications.waset.org/abstracts/search?q=Multiple%20Quantum%20wells%20%28MQWs%29" title=" Multiple Quantum wells (MQWs)"> Multiple Quantum wells (MQWs)</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20matrix%20method" title=" transfer matrix method"> transfer matrix method</a>, <a href="https://publications.waset.org/abstracts/search?q=fibonacci%20anyons" title=" fibonacci anyons"> fibonacci anyons</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20hall%20effect" title=" quantum hall effect"> quantum hall effect</a>, <a href="https://publications.waset.org/abstracts/search?q=nanophotonics" title=" nanophotonics"> nanophotonics</a> </p> <a href="https://publications.waset.org/abstracts/41369/aperiodic-and-asymmetric-fibonacci-quasicrystals-next-big-future-in-quantum-computation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41369.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">390</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">575</span> Symbolic Computation and Abundant Travelling Wave Solutions to Modified Burgers' Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Younis">Muhammad Younis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, the novel (G′/G)-expansion method is successfully applied to construct the abundant travelling wave solutions to the modified Burgers’ equation with the aid of computation. The method is reliable and useful, which gives more general exact travelling wave solutions than the existing methods. These obtained solutions are in the form of hyperbolic, trigonometric and rational functions including solitary, singular and periodic solutions which have many potential applications in physical science and engineering. Some of these solutions are new and some have already been constructed. Additionally, the constraint conditions, for the existence of the solutions are also listed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=traveling%20wave%20solutions" title="traveling wave solutions">traveling wave solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=NLPDE" title=" NLPDE"> NLPDE</a>, <a href="https://publications.waset.org/abstracts/search?q=computation" title=" computation"> computation</a>, <a href="https://publications.waset.org/abstracts/search?q=integrability" title=" integrability"> integrability</a> </p> <a href="https://publications.waset.org/abstracts/48762/symbolic-computation-and-abundant-travelling-wave-solutions-to-modified-burgers-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48762.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">433</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">574</span> Symbolic Computation on Variable-Coefficient Non-Linear Dispersive Wave Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Edris%20Rawashdeh">Edris Rawashdeh</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Abu-Falahah"> I. Abu-Falahah</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20M.%20Jaradat"> H. M. Jaradat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The variable-coefficient non-linear dispersive wave equation is investigated with the aid of symbolic computation. By virtue of a newly developed simplified bilinear method, multi-soliton solutions for such an equation have been derived. Effects of the inhomogeneities of media and nonuniformities of boundaries, depicted by the variable coefficients, on the soliton behavior are discussed with the aid of the characteristic curve method and graphical analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dispersive%20wave%20equations" title="dispersive wave equations">dispersive wave equations</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20soliton%20solution" title=" multiple soliton solution"> multiple soliton solution</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirota%20Bilinear%20Method" title=" Hirota Bilinear Method"> Hirota Bilinear Method</a>, <a href="https://publications.waset.org/abstracts/search?q=symbolic%20computation" title=" symbolic computation"> symbolic computation</a> </p> <a href="https://publications.waset.org/abstracts/18831/symbolic-computation-on-variable-coefficient-non-linear-dispersive-wave-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18831.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">456</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">573</span> Exploring the Intersection of Categorification and Computation in Algebraic Combinatorial Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gebreegziabher%20Hailu%20Gebrecherkos">Gebreegziabher Hailu Gebrecherkos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study explores the intersection of categorification and computation within algebraic combinatorial structures, aiming to deepen the understanding of how categorical frameworks can enhance computational methods. We investigate the role of higher-dimensional categories in organizing and analyzing combinatorial data, revealing how these structures can lead to new computational techniques for solving complex problems in algebraic combinatory. By examining examples such as species, posets, and operads, we illustrate the transformative potential of categorification in generating new algorithms and optimizing existing ones. Our findings suggest that integrating categorical insights with computational approaches not only enriches the theoretical landscape but also provides practical tools for tackling intricate combinatorial challenges, ultimately paving the way for future research in both fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=categorification" title="categorification">categorification</a>, <a href="https://publications.waset.org/abstracts/search?q=computation" title=" computation"> computation</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20structures" title=" algebraic structures"> algebraic structures</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorics" title=" combinatorics"> combinatorics</a> </p> <a href="https://publications.waset.org/abstracts/192299/exploring-the-intersection-of-categorification-and-computation-in-algebraic-combinatorial-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192299.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">14</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">572</span> Parallel Computation of the Covariance-Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Claude%20Tadonki">Claude Tadonki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We address the issues related to the computation of the covariance matrix. This matrix is likely to be ill conditioned following its canonical expression, thus consequently raises serious numerical issues. The underlying linear system, which therefore should be solved by means of iterative approaches, becomes computationally challenging. A huge number of iterations is expected in order to reach an acceptable level of convergence, necessary to meet the required accuracy of the computation. In addition, this linear system needs to be solved at each iteration following the general form of the covariance matrix. Putting all together, its comes that we need to compute as fast as possible the associated matrix-vector product. This is our purpose in the work, where we consider and discuss skillful formulations of the problem, then propose a parallel implementation of the matrix-vector product involved. Numerical and performance oriented discussions are provided based on experimental evaluations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=covariance-matrix" title="covariance-matrix">covariance-matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=multicore" title=" multicore"> multicore</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20computing" title=" numerical computing"> numerical computing</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/59579/parallel-computation-of-the-covariance-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59579.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">312</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">571</span> The Intersection/Union Region Computation for Drosophila Brain Images Using Encoding Schemes Based on Multi-Core CPUs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ming-Yang%20Guo">Ming-Yang Guo</a>, <a href="https://publications.waset.org/abstracts/search?q=Cheng-Xian%20Wu"> Cheng-Xian Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei-Xiang%20Chen"> Wei-Xiang Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Chun-Yuan%20Lin"> Chun-Yuan Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yen-Jen%20Lin"> Yen-Jen Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Ann-Shyn%20Chiang"> Ann-Shyn Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With more and more Drosophila Driver and Neuron images, it is an important work to find the similarity relationships among them as the functional inference. There is a general problem that how to find a Drosophila Driver image, which can cover a set of Drosophila Driver/Neuron images. In order to solve this problem, the intersection/union region for a set of images should be computed at first, then a comparison work is used to calculate the similarities between the region and other images. In this paper, three encoding schemes, namely Integer, Boolean, Decimal, are proposed to encode each image as a one-dimensional structure. Then, the intersection/union region from these images can be computed by using the compare operations, Boolean operators and lookup table method. Finally, the comparison work is done as the union region computation, and the similarity score can be calculated by the definition of Tanimoto coefficient. The above methods for the region computation are also implemented in the multi-core CPUs environment with the OpenMP. From the experimental results, in the encoding phase, the performance by the Boolean scheme is the best than that by others; in the region computation phase, the performance by Decimal is the best when the number of images is large. The speedup ratio can achieve 12 based on 16 CPUs. This work was supported by the Ministry of Science and Technology under the grant MOST 106-2221-E-182-070. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Drosophila%20driver%20image" title="Drosophila driver image">Drosophila driver image</a>, <a href="https://publications.waset.org/abstracts/search?q=Drosophila%20neuron%20images" title=" Drosophila neuron images"> Drosophila neuron images</a>, <a href="https://publications.waset.org/abstracts/search?q=intersection%2Funion%20computation" title=" intersection/union computation"> intersection/union computation</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20processing" title=" parallel processing"> parallel processing</a>, <a href="https://publications.waset.org/abstracts/search?q=OpenMP" title=" OpenMP"> OpenMP</a> </p> <a href="https://publications.waset.org/abstracts/89335/the-intersectionunion-region-computation-for-drosophila-brain-images-using-encoding-schemes-based-on-multi-core-cpus" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89335.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">239</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">570</span> Deep Reinforcement Learning-Based Computation Offloading for 5G Vehicle-Aware Multi-Access Edge Computing Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ziying%20Wu">Ziying Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Danfeng%20Yan"> Danfeng Yan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multi-Access Edge Computing (MEC) is one of the key technologies of the future 5G network. By deploying edge computing centers at the edge of wireless access network, the computation tasks can be offloaded to edge servers rather than the remote cloud server to meet the requirements of 5G low-latency and high-reliability application scenarios. Meanwhile, with the development of IOV (Internet of Vehicles) technology, various delay-sensitive and compute-intensive in-vehicle applications continue to appear. Compared with traditional internet business, these computation tasks have higher processing priority and lower delay requirements. In this paper, we design a 5G-based Vehicle-Aware Multi-Access Edge Computing Network (VAMECN) and propose a joint optimization problem of minimizing total system cost. In view of the problem, a deep reinforcement learning-based joint computation offloading and task migration optimization (JCOTM) algorithm is proposed, considering the influences of multiple factors such as concurrent multiple computation tasks, system computing resources distribution, and network communication bandwidth. And, the mixed integer nonlinear programming problem is described as a Markov Decision Process. Experiments show that our proposed algorithm can effectively reduce task processing delay and equipment energy consumption, optimize computing offloading and resource allocation schemes, and improve system resource utilization, compared with other computing offloading policies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-access%20edge%20computing" title="multi-access edge computing">multi-access edge computing</a>, <a href="https://publications.waset.org/abstracts/search?q=computation%20offloading" title=" computation offloading"> computation offloading</a>, <a href="https://publications.waset.org/abstracts/search?q=5th%20generation" title=" 5th generation"> 5th generation</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle-aware" title=" vehicle-aware"> vehicle-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20reinforcement%20learning" title=" deep reinforcement learning"> deep reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20q-network" title=" deep q-network"> deep q-network</a> </p> <a href="https://publications.waset.org/abstracts/131562/deep-reinforcement-learning-based-computation-offloading-for-5g-vehicle-aware-multi-access-edge-computing-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131562.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">118</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">569</span> A Column Generation Based Algorithm for Airline Cabin Crew Rostering Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nan%20Xu">Nan Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In airlines, the crew scheduling problem is usually decomposed into two stages: crew pairing and crew rostering. In the crew pairing stage, pairings are generated such that each flight is covered by exactly one pairing and the overall cost is minimized. In the crew rostering stage, the pairings generated in the crew pairing stage are combined with off days, training and other breaks to create individual work schedules. The paper focuses on cabin crew rostering problem, which is challenging due to the extremely large size and the complex working rules involved. In our approach, the objective of rostering consists of two major components. The first is to minimize the number of unassigned pairings and the second is to ensure the fairness to crew members. There are two measures of fairness to crew members, the number of overnight duties and the total fly-hour over a given period. Pairings should be assigned to each crew member so that their actual overnight duties and fly hours are as close to the expected average as possible. Deviations from the expected average are penalized in the objective function. Since several small deviations are preferred than a large deviation, the penalization is quadratic. Our model of the airline crew rostering problem is based on column generation. The problem is decomposed into a master problem and subproblems. The mater problem is modeled as a set partition problem and exactly one roster for each crew is picked up such that the pairings are covered. The restricted linear master problem (RLMP) is considered. The current subproblem tries to find columns with negative reduced costs and add them to the RLMP for the next iteration. When no column with negative reduced cost can be found or a stop criteria is met, the procedure ends. The subproblem is to generate feasible crew rosters for each crew member. A separate acyclic weighted graph is constructed for each crew member and the subproblem is modeled as resource constrained shortest path problems in the graph. Labeling algorithm is used to solve it. Since the penalization is quadratic, a method to deal with non-additive shortest path problem using labeling algorithm is proposed and corresponding domination condition is defined. The major contribution of our model is: 1) We propose a method to deal with non-additive shortest path problem; 2) Operation to allow relaxing some soft rules is allowed in our algorithm, which can improve the coverage rate; 3) Multi-thread techniques are used to improve the efficiency of the algorithm when generating Line-of-Work for crew members. Here a column generation based algorithm for the airline cabin crew rostering problem is proposed. The objective is to assign a personalized roster to crew member which minimize the number of unassigned pairings and ensure the fairness to crew members. The algorithm we propose in this paper has been put into production in a major airline in China and numerical experiments show that it has a good performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aircrew%20rostering" title="aircrew rostering">aircrew rostering</a>, <a href="https://publications.waset.org/abstracts/search?q=aircrew%20scheduling" title=" aircrew scheduling"> aircrew scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=column%20generation" title=" column generation"> column generation</a>, <a href="https://publications.waset.org/abstracts/search?q=SPPRC" title=" SPPRC"> SPPRC</a> </p> <a href="https://publications.waset.org/abstracts/74722/a-column-generation-based-algorithm-for-airline-cabin-crew-rostering-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74722.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">146</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">568</span> An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Wang">Y. Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is <em>O</em>(<em>CN</em><sub>max</sub><em>n</em><sup>2</sup>) where <em>C</em> is the iterations, <em>N</em><sub>max</sub> is the maximum number of frequency quadrilaterals containing each edge and <em>n</em> is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5<em>n</em> edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrilateral" title="frequency quadrilateral">frequency quadrilateral</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=sparse%20graph" title=" sparse graph"> sparse graph</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a> </p> <a href="https://publications.waset.org/abstracts/82737/an-improved-method-to-compute-sparse-graphs-for-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82737.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">233</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">567</span> An Efficient Book Keeping Strategy for the Formation of the Design Matrix in Geodetic Network Adjustment </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O.%20G.%20Omogunloye">O. G. Omogunloye</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20B.%20Olaleye"> J. B. Olaleye</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20E.%20Abiodun"> O. E. Abiodun</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20O.%20Odumosu"> J. O. Odumosu</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20G.%20Ajayi"> O. G. Ajayi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The focus of the study is to proffer easy formulation and computation of least square observation equation’s design matrix by using an efficient book keeping strategy. Usually, for a large network of many triangles and stations, a rigorous task is involved in the computation and placement of the values of the differentials of each observation with respect to its station coordinates (latitude and longitude), in their respective rows and columns. The efficient book keeping strategy seeks to eliminate or reduce this rigorous task involved, especially in large network, by simple skillful arrangement and development of a short program written in the Matlab environment, the formulation and computation of least square observation equation’s design matrix can be easily achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design" title="design">design</a>, <a href="https://publications.waset.org/abstracts/search?q=differential" title=" differential"> differential</a>, <a href="https://publications.waset.org/abstracts/search?q=geodetic" title=" geodetic"> geodetic</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix" title=" matrix"> matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a>, <a href="https://publications.waset.org/abstracts/search?q=station" title=" station"> station</a> </p> <a href="https://publications.waset.org/abstracts/71597/an-efficient-book-keeping-strategy-for-the-formation-of-the-design-matrix-in-geodetic-network-adjustment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71597.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">356</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">566</span> Aerodynamic Coefficients Prediction from Minimum Computation Combinations Using OpenVSP Software</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marine%20Segui">Marine Segui</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruxandra%20Mihaela%20Botez"> Ruxandra Mihaela Botez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> OpenVSP is an aerodynamic solver developed by National Aeronautics and Space Administration (NASA) that allows building a reliable model of an aircraft. This software performs an aerodynamic simulation according to the angle of attack of the aircraft makes between the incoming airstream, and its speed. A reliable aerodynamic model of the Cessna Citation X was designed but it required a lot of computation time. As a consequence, a prediction method was established that allowed predicting lift and drag coefficients for all Mach numbers and for all angles of attack, exclusively for stall conditions, from a computation of three angles of attack and only one Mach number. Aerodynamic coefficients given by the prediction method for a Cessna Citation X model were finally compared with aerodynamics coefficients obtained using a complete OpenVSP study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aerodynamic" title="aerodynamic">aerodynamic</a>, <a href="https://publications.waset.org/abstracts/search?q=coefficient" title=" coefficient"> coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=cruise" title=" cruise"> cruise</a>, <a href="https://publications.waset.org/abstracts/search?q=improving" title=" improving"> improving</a>, <a href="https://publications.waset.org/abstracts/search?q=longitudinal" title=" longitudinal"> longitudinal</a>, <a href="https://publications.waset.org/abstracts/search?q=openVSP" title=" openVSP"> openVSP</a>, <a href="https://publications.waset.org/abstracts/search?q=solver" title=" solver"> solver</a>, <a href="https://publications.waset.org/abstracts/search?q=time" title=" time"> time</a> </p> <a href="https://publications.waset.org/abstracts/85268/aerodynamic-coefficients-prediction-from-minimum-computation-combinations-using-openvsp-software" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85268.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">235</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">565</span> Motion Estimator Architecture with Optimized Number of Processing Elements for High Efficiency Video Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seongsoo%20Lee">Seongsoo Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Motion estimation occupies the heaviest computation in HEVC (high efficiency video coding). Many fast algorithms such as TZS (test zone search) have been proposed to reduce the computation. Still the huge computation of the motion estimation is a critical issue in the implementation of HEVC video codec. In this paper, motion estimator architecture with optimized number of PEs (processing element) is presented by exploiting early termination. It also reduces hardware size by exploiting parallel processing. The presented motion estimator architecture has 8 PEs, and it can efficiently perform TZS with very high utilization of PEs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=motion%20estimation" title="motion estimation">motion estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=test%20zone%20search" title=" test zone search"> test zone search</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20efficiency%20video%20coding" title=" high efficiency video coding"> high efficiency video coding</a>, <a href="https://publications.waset.org/abstracts/search?q=processing%20element" title=" processing element"> processing element</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/70881/motion-estimator-architecture-with-optimized-number-of-processing-elements-for-high-efficiency-video-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70881.pdf" target="_blank" class="btn btn-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">564</span> Parallel Evaluation of Sommerfeld Integrals for Multilayer Dyadic Green's Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Duygu%20Kan">Duygu Kan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Cayoren"> Mehmet Cayoren</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sommerfeld-integrals (SIs) are commonly encountered in electromagnetics problems involving analysis of antennas and scatterers embedded in planar multilayered media. Generally speaking, the analytical solution of SIs is unavailable, and it is well known that numerical evaluation of SIs is very time consuming and computationally expensive due to the highly oscillating and slowly decaying nature of the integrands. Therefore, fast computation of SIs has a paramount importance. In this paper, a parallel code has been developed to speed up the computation of SI in the framework of calculation of dyadic Green’s function in multilayered media. OpenMP shared memory approach is used to parallelize the SI algorithm and resulted in significant time savings. Moreover accelerating the computation of dyadic Green’s function is discussed based on the parallel SI algorithm developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sommerfeld-integrals" title="Sommerfeld-integrals">Sommerfeld-integrals</a>, <a href="https://publications.waset.org/abstracts/search?q=multilayer%20dyadic%20Green%E2%80%99s%20function" title=" multilayer dyadic Green’s function"> multilayer dyadic Green’s function</a>, <a href="https://publications.waset.org/abstracts/search?q=OpenMP" title=" OpenMP"> OpenMP</a>, <a href="https://publications.waset.org/abstracts/search?q=shared%20memory%20parallel%20programming" title=" shared memory parallel programming"> shared memory parallel programming</a> </p> <a href="https://publications.waset.org/abstracts/73819/parallel-evaluation-of-sommerfeld-integrals-for-multilayer-dyadic-greens-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73819.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">247</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">563</span> Exploiting Non-Uniform Utility of Computing: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arnab%20Sarkar">Arnab Sarkar</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Huang"> Michael Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chuang%20Ren"> Chuang Ren</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Li"> Jun Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The increasing importance of computing in modern society has brought substantial growth in the demand for more computational power. In some problem domains such as scientific simulations, available computational power still sets a limit on what can be practically explored in computation. For many types of code, there is non-uniformity in the utility of computation. That is not every piece of computation contributes equally to the quality of the result. If this non-uniformity is understood well and exploited effectively, we can much more effectively utilize available computing power. In this paper, we discuss a case study of exploring such non-uniformity in a particle-in-cell simulation platform. We find both the existence of significant non-uniformity and that it is generally straightforward to exploit it. We show the potential of order-of-magnitude effective performance gain while keeping the comparable quality of output. We also discuss some challenges in both the practical application of the idea and evaluation of its impact. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20computing" title="approximate computing">approximate computing</a>, <a href="https://publications.waset.org/abstracts/search?q=landau%20damping" title=" landau damping"> landau damping</a>, <a href="https://publications.waset.org/abstracts/search?q=non%20uniform%20utility%20computing" title=" non uniform utility computing"> non uniform utility computing</a>, <a href="https://publications.waset.org/abstracts/search?q=particle-in-cell" title=" particle-in-cell"> particle-in-cell</a> </p> <a href="https://publications.waset.org/abstracts/86032/exploiting-non-uniform-utility-of-computing-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">259</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">562</span> Message Authentication Scheme for Vehicular Ad-Hoc Networks under Sparse RSUs Environment </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen%20Shyong%20Hsieh">Wen Shyong Hsieh</a>, <a href="https://publications.waset.org/abstracts/search?q=Chih%20Hsueh%20Lin"> Chih Hsueh Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we combine the concepts of chameleon hash function (CHF) and identification based cryptography (IBC) to build a message authentication environment for VANET under sparse RSUs. Based on the CHF, TA keeps two common secrets that will be embedded to all identities to be as the evidence of mutual trusting. TA will issue one original identity to every RSU and vehicle. An identity contains one public ID and one private key. The public ID, includes three components: pseudonym, random key, and public key, is used to present one entity and can be verified to be a legal one. The private key is used to claim the ownership of the public ID. Based on the concept of IBC, without any negotiating process, a CHF pairing key multiplied by one private key and other’s public key will be used for mutually trusting and to be utilized as the session key of secure communicating between RSUs and vehicles. To help the vehicles to do message authenticating, the RSUs are assigned to response the vehicle’s temple identity request using two short time secretes that are broadcasted by TA. To light the loading of request information, one day is divided into M time slots. At every time slot, TA will broadcast two short time secretes to all valid RSUs for that time slot. Any RSU can response the temple identity request from legal vehicles. With the collected announcement of public IDs from the neighbor vehicles, a vehicle can set up its neighboring set, which includes the information about the neighbor vehicle’s temple public ID and temple CHF pairing key that can be derived by the private key and neighbor’s public key and will be used to do message authenticating or secure communicating without the help of RSU. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Internet%20of%20Vehicles%20%28IOV%29" title="Internet of Vehicles (IOV)">Internet of Vehicles (IOV)</a>, <a href="https://publications.waset.org/abstracts/search?q=Vehicular%20Ad-hoc%20Networks%20%28VANETs%29" title=" Vehicular Ad-hoc Networks (VANETs)"> Vehicular Ad-hoc Networks (VANETs)</a>, <a href="https://publications.waset.org/abstracts/search?q=Chameleon%20Hash%20Function%20%28CHF%29" title=" Chameleon Hash Function (CHF)"> Chameleon Hash Function (CHF)</a>, <a href="https://publications.waset.org/abstracts/search?q=message%20authentication" title=" message authentication"> message authentication</a> </p> <a href="https://publications.waset.org/abstracts/58528/message-authentication-scheme-for-vehicular-ad-hoc-networks-under-sparse-rsus-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58528.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">391</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">561</span> A Parallel Computation Based on GPU Programming for a 3D Compressible Fluid Flow Simulation </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sugeng%20Rianto">Sugeng Rianto</a>, <a href="https://publications.waset.org/abstracts/search?q=P.W.%20Arinto%20Yudi"> P.W. Arinto Yudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Soemarno%20%20Muhammad%20Nurhuda"> Soemarno Muhammad Nurhuda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A computation of a 3D compressible fluid flow for virtual environment with haptic interaction can be a non-trivial issue. This is especially how to reach good performances and balancing between visualization, tactile feedback interaction, and computations. In this paper, we describe our approach of computation methods based on parallel programming on a GPU. The 3D fluid flow solvers have been developed for smoke dispersion simulation by using combinations of the cubic interpolated propagation (CIP) based fluid flow solvers and the advantages of the parallelism and programmability of the GPU. The fluid flow solver is generated in the GPU-CPU message passing scheme to get rapid development of haptic feedback modes for fluid dynamic data. A rapid solution in fluid flow solvers is developed by applying cubic interpolated propagation (CIP) fluid flow solvers. From this scheme, multiphase fluid flow equations can be solved simultaneously. To get more acceleration in the computation, the Navier-Stoke Equations (NSEs) is packed into channels of texel, where computation models are performed on pixels that can be considered to be a grid of cells. Therefore, despite of the complexity of the obstacle geometry, processing on multiple vertices and pixels can be done simultaneously in parallel. The data are also shared in global memory for CPU to control the haptic in providing kinaesthetic interaction and felling. The results show that GPU based parallel computation approaches provide effective simulation of compressible fluid flow model for real-time interaction in 3D computer graphic for PC platform. This report has shown the feasibility of a new approach of solving the compressible fluid flow equations on the GPU. The experimental tests proved that the compressible fluid flowing on various obstacles with haptic interactions on the few model obstacles can be effectively and efficiently simulated on the reasonable frame rate with a realistic visualization. These results confirm that good performances and balancing between visualization, tactile feedback interaction, and computations can be applied successfully. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CIP" title="CIP">CIP</a>, <a href="https://publications.waset.org/abstracts/search?q=compressible%20fluid" title=" compressible fluid"> compressible fluid</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU%20programming" title=" GPU programming"> GPU programming</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computation" title=" parallel computation"> parallel computation</a>, <a href="https://publications.waset.org/abstracts/search?q=real-time%20visualisation" title=" real-time visualisation"> real-time visualisation</a> </p> <a href="https://publications.waset.org/abstracts/3308/a-parallel-computation-based-on-gpu-programming-for-a-3d-compressible-fluid-flow-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3308.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">432</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">560</span> A CORDIC Based Design Technique for Efficient Computation of DCT</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Deboraj%20Muchahary">Deboraj Muchahary</a>, <a href="https://publications.waset.org/abstracts/search?q=Amlan%20Deep%20Borah%20Abir%20J.%20Mondal"> Amlan Deep Borah Abir J. Mondal</a>, <a href="https://publications.waset.org/abstracts/search?q=Alak%20Majumder"> Alak Majumder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A discrete cosine transform (DCT) is described and a technique to compute it using fast Fourier transform (FFT) is developed. In this work, DCT of a finite length sequence is obtained by incorporating CORDIC methodology in radix-2 FFT algorithm. The proposed methodology is simple to comprehend and maintains a regular structure, thereby reducing computational complexity. DCTs are used extensively in the area of digital processing for the purpose of pattern recognition. So the efficient computation of DCT maintaining a transparent design flow is highly solicited. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DCT" title="DCT">DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=DFT" title=" DFT"> DFT</a>, <a href="https://publications.waset.org/abstracts/search?q=CORDIC" title=" CORDIC"> CORDIC</a>, <a href="https://publications.waset.org/abstracts/search?q=FFT" title=" FFT"> FFT</a> </p> <a href="https://publications.waset.org/abstracts/25826/a-cordic-based-design-technique-for-efficient-computation-of-dct" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25826.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">478</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">559</span> Structural Insights into the Bypass of the Major Deaminated Purines by Translesion Synthesis DNA Polymerase</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hunmin%20Jung">Hunmin Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Hawkins"> Michael Hawkins</a>, <a href="https://publications.waset.org/abstracts/search?q=Seongmin%20Lee"> Seongmin Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The exocyclic amines of nucleobases can undergo deamination by various DNA damaging agents such as reactive oxygen species, nitric oxide, and water. The deamination of guanine and adenine generates the promutagenic xanthine and hypoxanthine, respectively. The exocyclic amines of bases in DNA are hydrogen bond donors, while the carbonyl moiety generated by the base deamination acts as hydrogen bond acceptors, which can alter base pairing properties of the purines. Xanthine is known to base pair with both cytosine and thymine, while hypoxanthine predominantly pairs with cytosine to promote A to G mutations. Despite the known promutagenicity of the major deaminated purines, structures of DNA polymerase bypassing these lesions have not been reported. To gain insights into the deaminated-induced mutagenesis, we solved crystal structures of human DNA polymerase η (polη) catalyzing across xanthine and hypoxanthine. In the catalytic site of polη, the deaminated guanine (i.e., xanthine) forms three Watson-Crick-like hydrogen bonds with an incoming dCTP, indicating the O2-enol tautomer of xanthine involves in the base pairing. The formation of the enol tautomer appears to be promoted by the minor groove contact by Gln38 of polη. When hypoxanthine is at the templating position, the deaminated adenine uses its O6-keto tautomer to form two Watson-Crick hydrogen bonds with an incoming dCTP, providing the structural basis for the high promutagenicity of hypoxanthine. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DNA%20damage" title="DNA damage">DNA damage</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20polymerase" title="DNA polymerase">DNA polymerase</a>, <a href="https://publications.waset.org/abstracts/search?q=deamination" title="deamination">deamination</a>, <a href="https://publications.waset.org/abstracts/search?q=mutagenesis" title="mutagenesis">mutagenesis</a>, <a href="https://publications.waset.org/abstracts/search?q=tautomerization" title="tautomerization">tautomerization</a>, <a href="https://publications.waset.org/abstracts/search?q=translesion%20synthesis" title="translesion synthesis">translesion synthesis</a> </p> <a href="https://publications.waset.org/abstracts/149816/structural-insights-into-the-bypass-of-the-major-deaminated-purines-by-translesion-synthesis-dna-polymerase" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/149816.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">134</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">558</span> Numerical Computation of Specific Absorption Rate and Induced Current for Workers Exposed to Static Magnetic Fields of MRI Scanners</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sherine%20Farrag">Sherine Farrag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Currently-used MRI scanners in Cairo City possess static magnetic field (SMF) that varies from 0.25 up to 3T. More than half of them possess SMF of 1.5T. The SMF of the magnet determine the diagnostic power of a scanner, but not worker's exposure profile. This research paper presents an approach for numerical computation of induced electric fields and SAR values by estimation of fringe static magnetic fields. Iso-gauss line of MR was mapped and a polynomial function of the 7th degree was generated and tested. Induced current field due to worker motion in the SMF and SAR values for organs and tissues have been calculated. Results illustrate that the computation tool used permits quick accurate MRI iso-gauss mapping and calculation of SAR values which can then be used for assessment of occupational exposure profile of MRI operators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MRI%20occupational%20exposure" title="MRI occupational exposure">MRI occupational exposure</a>, <a href="https://publications.waset.org/abstracts/search?q=MRI%20safety" title=" MRI safety"> MRI safety</a>, <a href="https://publications.waset.org/abstracts/search?q=induced%20current%20density" title=" induced current density"> induced current density</a>, <a href="https://publications.waset.org/abstracts/search?q=specific%20absorption%20rate" title=" specific absorption rate"> specific absorption rate</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20magnetic%20fields" title=" static magnetic fields"> static magnetic fields</a> </p> <a href="https://publications.waset.org/abstracts/13235/numerical-computation-of-specific-absorption-rate-and-induced-current-for-workers-exposed-to-static-magnetic-fields-of-mri-scanners" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13235.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">430</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">557</span> Computation of Natural Logarithm Using Abstract Chemical Reaction Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Iuliia%20Zarubiieva">Iuliia Zarubiieva</a>, <a href="https://publications.waset.org/abstracts/search?q=Joyun%20Tseng"> Joyun Tseng</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishwesh%20Kulkarni"> Vishwesh Kulkarni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recent researches has focused on nucleic acids as a substrate for designing biomolecular circuits for in situ monitoring and control. A common approach is to express them by a set of idealised abstract chemical reaction networks (ACRNs). Here, we present new results on how abstract chemical reactions, viz., catalysis, annihilation and degradation, can be used to implement circuit that accurately computes logarithm function using the method of Arithmetic-Geometric Mean (AGM), which has not been previously used in conjunction with ACRNs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20reaction%20networks" title="chemical reaction networks">chemical reaction networks</a>, <a href="https://publications.waset.org/abstracts/search?q=ratio%20computation" title=" ratio computation"> ratio computation</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/abstracts/search?q=robustness" title=" robustness"> robustness</a> </p> <a href="https://publications.waset.org/abstracts/93960/computation-of-natural-logarithm-using-abstract-chemical-reaction-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93960.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">170</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">556</span> Optoelectronic Hardware Architecture for Recurrent Learning Algorithm in Image Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Bal">Abdullah Bal</a>, <a href="https://publications.waset.org/abstracts/search?q=Sevdenur%20Bal"> Sevdenur Bal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper purposes a new type of hardware application for training of cellular neural networks (CNN) using optical joint transform correlation (JTC) architecture for image feature extraction. CNNs require much more computation during the training stage compare to test process. Since optoelectronic hardware applications offer possibility of parallel high speed processing capability for 2D data processing applications, CNN training algorithm can be realized using Fourier optics technique. JTC employs lens and CCD cameras with laser beam that realize 2D matrix multiplication and summation in the light speed. Therefore, in the each iteration of training, JTC carries more computation burden inherently and the rest of mathematical computation realized digitally. The bipolar data is encoded by phase and summation of correlation operations is realized using multi-object input joint images. Overlapping properties of JTC are then utilized for summation of two cross-correlations which provide less computation possibility for training stage. Phase-only JTC does not require data rearrangement, electronic pre-calculation and strict system alignment. The proposed system can be incorporated simultaneously with various optical image processing or optical pattern recognition techniques just in the same optical system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CNN%20training" title="CNN training">CNN training</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=joint%20transform%20correlation" title=" joint transform correlation"> joint transform correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=optoelectronic%20hardware" title=" optoelectronic hardware"> optoelectronic hardware</a> </p> <a href="https://publications.waset.org/abstracts/35981/optoelectronic-hardware-architecture-for-recurrent-learning-algorithm-in-image-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35981.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">506</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">555</span> A New Paradigm to Make Cloud Computing Greener</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Apurva%20Saxena">Apurva Saxena</a>, <a href="https://publications.waset.org/abstracts/search?q=Sunita%20Gond"> Sunita Gond</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Demand of computation, data storage in large amount are rapidly increases day by day. Cloud computing technology fulfill the demand of today’s computation but this will lead to high power consumption in cloud data centers. Initiative for Green IT try to reduce power consumption and its adverse environmental impacts. Paper also focus on various green computing techniques, proposed models and efficient way to make cloud greener. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=virtualization" title="virtualization">virtualization</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=green%20computing" title=" green computing"> green computing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20center" title=" data center"> data center</a> </p> <a href="https://publications.waset.org/abstracts/27336/a-new-paradigm-to-make-cloud-computing-greener" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27336.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">554</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=pairing%20computation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&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=pairing%20computation&page=19">19</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&page=20">20</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=pairing%20computation&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>