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: multiplication factor</title> <meta name="description" content="Search results for: multiplication factor"> <meta name="keywords" content="multiplication factor"> <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="multiplication factor" 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="multiplication factor"> <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> 5375</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: multiplication factor</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5375</span> Magnification Factor Based Seismic Response of Moment Resisting Frames with Open Ground Storey</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Subzar%20Ahmad%20Bhat">Subzar Ahmad Bhat</a>, <a href="https://publications.waset.org/abstracts/search?q=Saraswati%20Setia"> Saraswati Setia</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20K.Sehgal"> V. K.Sehgal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> During the past earthquakes, open ground storey buildings have performed poorly due to the soft storey defect. Indian Standard IS 1893:2002 allows analysis of open ground storey buildings without considering infill stiffness but with a multiplication factor 2.5 in compensation for the stiffness discontinuity. Therefore, the aim of this paper is to check the applicability of the multiplication factor of 2.5 and study behaviour of the structure after the application of the multiplication factor. For this purpose, study is performed on models considering infill stiffness using SAP 2000 (Version 14) by linear static analysis and response spectrum analysis. Total seven models are analysed and designed for the range of multiplication factor ranging from 1.25 to 2.5. The value of multiplication factor equal to 2.5 has been found on the higher side, resulting in increased dimension and percentage of reinforcement without significant enhancement beyond a certain multiplication factor. When the building with OGS is designed for values of MF higher than 1.25 considering infill stiffness soft storey effect shifts from ground storey to first storey. For the analysis of the OGS structure best way to analysis the structure is to analyse it as the frame with stiffness and strength of the infill taken into account. The provision of infill walls in the upper storeys enhances the performance of the structure in terms of displacement and storey drift controls. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=open%20ground%20storey" title="open ground storey">open ground storey</a>, <a href="https://publications.waset.org/abstracts/search?q=multiplication%20factor" title=" multiplication factor"> multiplication factor</a>, <a href="https://publications.waset.org/abstracts/search?q=IS%201893%3A2002%20provisions" title=" IS 1893:2002 provisions"> IS 1893:2002 provisions</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20analysis" title=" static analysis"> static analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=response%20spectrum%20analysis" title=" response spectrum analysis"> response spectrum analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=infill%20stiffness" title=" infill stiffness"> infill stiffness</a>, <a href="https://publications.waset.org/abstracts/search?q=equivalent%20strut" title=" equivalent strut "> equivalent strut </a> </p> <a href="https://publications.waset.org/abstracts/28538/magnification-factor-based-seismic-response-of-moment-resisting-frames-with-open-ground-storey" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28538.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">395</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">5374</span> The Fallacy around Inserting Brackets to Evaluate Expressions Involving Multiplication and Division</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manduth%20Ramchander">Manduth Ramchander</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evaluating expressions involving multiplication and division can give rise to the fallacy that brackets can be arbitrarily inserted into expressions involving multiplication and division. The aim of this article was to draw upon mathematical theory to prove that brackets cannot be arbitrarily inserted into expressions involving multiplication and division and in particular in expressions where division precedes multiplication. In doing so, it demonstrates that the notion that two different answers are possible, when evaluating expressions involving multiplication and division, is indeed a false one. Searches conducted in a number of scholarly databases unearthed the rules to be applied when removing brackets from expressions, which revealed that consideration needs to be given to sign changes when brackets are removed. The rule pertaining to expressions involving multiplication and division was then extended upon, in its reverse format, to prove that brackets cannot be arbitrarily inserted into expressions involving multiplication and division. The application of the rule demonstrates that an expression involving multiplication and division can have only one correct answer. It is recommended that both the rule and its reverse be included in the curriculum, preferably at the juncture when manipulation with brackets is introduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=brackets" title="brackets">brackets</a>, <a href="https://publications.waset.org/abstracts/search?q=multiplications%20and%20division" title=" multiplications and division"> multiplications and division</a>, <a href="https://publications.waset.org/abstracts/search?q=operations" title=" operations"> operations</a>, <a href="https://publications.waset.org/abstracts/search?q=order" title=" order"> order</a> </p> <a href="https://publications.waset.org/abstracts/132918/the-fallacy-around-inserting-brackets-to-evaluate-expressions-involving-multiplication-and-division" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">160</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5373</span> Low-Complexity Multiplication Using Complement and Signed-Digit Recoding Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Te-Jen%20Chang">Te-Jen Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=I-Hui%20Pan"> I-Hui Pan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ping-Sheng%20Huang"> Ping-Sheng Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shan-Jen%20Cheng"> Shan-Jen Cheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a fast multiplication computing method utilizing the complement representation method and canonical recoding technique is proposed. By performing complements and canonical recoding technique, the number of partial products can be reduced. Based on these techniques, we propose an algorithm that provides an efficient multiplication method. On average, our proposed algorithm is to reduce the number of k-bit additions from (0.25k+logk/k+2.5) to (k/6 +logk/k+2.5), where k is the bit-length of the multiplicand A and multiplier B. We can therefore efficiently speed up the overall performance of the multiplication. Moreover, if we use the new proposes to compute common-multiplicand multiplication, the computational complexity can be reduced from (0.5 k+2 logk/k+5) to (k/3+2 logk/k+5) k-bit additions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithm%20design" title="algorithm design">algorithm design</a>, <a href="https://publications.waset.org/abstracts/search?q=complexity%20analysis" title=" complexity analysis"> complexity analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=canonical%20recoding" title=" canonical recoding"> canonical recoding</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20key%20cryptography" title=" public key cryptography"> public key cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=common-multiplicand%20multiplication" title=" common-multiplicand multiplication"> common-multiplicand multiplication</a> </p> <a href="https://publications.waset.org/abstracts/9129/low-complexity-multiplication-using-complement-and-signed-digit-recoding-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9129.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">435</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">5372</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">7</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">5371</span> Design and Construction of an Intelligent Multiplication Table for Enhanced Education and Increased Student Engagement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Alikhani%20Koopaei">Zahra Alikhani Koopaei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the fifth lesson of the third-grade mathematics book, students are introduced to the concept of multiplication. However, some students showed a lack of interest in learning this topic. To address this, a simple electronic multiplication table was designed with the aim of making the concept of multiplication entertaining and engaging for students. It provides them with moments of excitement during the learning process. To achieve this goal, a device was created that produced a bell sound when two wire ends were connected. Each wire end was connected to a specific number in the multiplication table, and the other end was linked to the corresponding answer. Consequently, if the answer is correct, the bell will ring. This study employs interactive and engaging methods to teach mathematics, particularly to students who have previously shown little interest in the subject. By integrating game-based learning and critical thinking, we observed an increase in understanding and interest in learning multiplication compared to before using this method. This further motivated the students. As a result, the intelligent multiplication table was successfully designed. Students, under the instructor's supervision, could easily construct the device during the lesson. Through the implementation of these operations, the concept of multiplication was firmly established in the students' minds. Engaging multiple intelligences in each student enhances a more stable and improved understanding of the concept of multiplication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intelligent%20multiplication%20table" title="intelligent multiplication table">intelligent multiplication table</a>, <a href="https://publications.waset.org/abstracts/search?q=design" title=" design"> design</a>, <a href="https://publications.waset.org/abstracts/search?q=construction" title=" construction"> construction</a>, <a href="https://publications.waset.org/abstracts/search?q=education" title=" education"> education</a>, <a href="https://publications.waset.org/abstracts/search?q=increased%20interest" title=" increased interest"> increased interest</a>, <a href="https://publications.waset.org/abstracts/search?q=students" title=" students"> students</a> </p> <a href="https://publications.waset.org/abstracts/176502/design-and-construction-of-an-intelligent-multiplication-table-for-enhanced-education-and-increased-student-engagement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176502.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">69</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">5370</span> Modified Montgomery for RSA Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rupali%20Verma">Rupali Verma</a>, <a href="https://publications.waset.org/abstracts/search?q=Maitreyee%20Dutta"> Maitreyee Dutta</a>, <a href="https://publications.waset.org/abstracts/search?q=Renu%20Vig"> Renu Vig</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence, efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitioned over two iterations such that parallel computations are performed. This reduces the critical path delay of proposed Montgomery design. The proposed design and RSA are implemented on Virtex 2 and Virtex 5 FPGAs. The two factors partitioning and parallelism have improved the frequency and throughput of proposed design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RSA" title="RSA">RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=montgomery%20modular%20multiplication" title=" montgomery modular multiplication"> montgomery modular multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=4%3A2%20compressor" title=" 4:2 compressor"> 4:2 compressor</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA "> FPGA </a> </p> <a href="https://publications.waset.org/abstracts/3733/modified-montgomery-for-rsa-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3733.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">413</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">5369</span> Parallel Computing: Offloading Matrix Multiplication to GPU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bharath%20R.">Bharath R.</a>, <a href="https://publications.waset.org/abstracts/search?q=Tharun%20Sai%20N."> Tharun Sai N.</a>, <a href="https://publications.waset.org/abstracts/search?q=Bhuvan%20G."> Bhuvan G.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This project focuses on developing a Parallel Computing method aimed at optimizing matrix multiplication through GPU acceleration. Addressing algorithmic challenges, GPU programming intricacies, and integration issues, the project aims to enhance efficiency and scalability. The methodology involves algorithm design, GPU programming, and optimization techniques. Future plans include advanced optimizations, extended functionality, and integration with high-level frameworks. User engagement is emphasized through user-friendly interfaces, open- source collaboration, and continuous refinement based on feedback. The project's impact extends to significantly improving matrix multiplication performance in scientific computing and machine learning applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20multiplication" title="matrix multiplication">matrix multiplication</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=cuda" title=" cuda"> cuda</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20boost" title=" performance boost"> performance boost</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a> </p> <a href="https://publications.waset.org/abstracts/185203/parallel-computing-offloading-matrix-multiplication-to-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185203.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">58</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">5368</span> Efficient Semi-Systolic Finite Field Multiplier Using Redundant Basis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyun-Ho%20Lee">Hyun-Ho Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Kee-Won%20Kim"> Kee-Won Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The arithmetic operations over GF(2m) have been extensively used in error correcting codes and public-key cryptography schemes. Finite field arithmetic includes addition, multiplication, division and inversion operations. Addition is very simple and can be implemented with an extremely simple circuit. The other operations are much more complex. The multiplication is the most important for cryptosystems, such as the elliptic curve cryptosystem, since computing exponentiation, division, and computing multiplicative inverse can be performed by computing multiplication iteratively. In this paper, we present a parallel computation algorithm that operates Montgomery multiplication over finite field using redundant basis. Also, based on the multiplication algorithm, we present an efficient semi-systolic multiplier over finite field. The multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the multiplier saves at least 5% area, 50% time, and 53% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field, such as inversion and division operation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=finite%20field" title="finite field">finite field</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery%20multiplication" title=" Montgomery multiplication"> Montgomery multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=systolic%20array" title=" systolic array"> systolic array</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a> </p> <a href="https://publications.waset.org/abstracts/55023/efficient-semi-systolic-finite-field-multiplier-using-redundant-basis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55023.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">294</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">5367</span> Integrating Indigenous Students’ Funds of Knowledge to Introduce Multiplication with a Picture Storybook</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Murni%20Sianturi">Murni Sianturi</a>, <a href="https://publications.waset.org/abstracts/search?q=Andreas%20Au%20%20Hurit"> Andreas Au Hurit</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The low level of Indigenous Papuan students’ literacy and numeracy in Merauke Regency-Indonesia needs to be considered. The development of a learnable storybook with pictures related to their lives might raise their curiosity to read. This study aimed to design a storybook as a complementary resource for the third graders using Indigenous Malind cultural approaches by employing research and development methods. The product developed was a thematic-integrative picture storybook using funds of knowledge from Indigenous students. All the book contents depicted Indigenous students’ lives and were in line with the national curriculum syllabus, specifically representing one sub-theme−multiplication topic. Multiplication material of grade 3 was modified in the form of a story, and at the end of the reading, students were given several multiplication exercises. Based on the results of the evaluation from the expert team, it was found that the average score was in the excellent category. The students’ and teacher’s responses to the storybook were very positive. Students were thrilled when reading this book and also effortlessly understood the concept of multiplication. Therefore, this book might be used as a companion book to the main book and serve as introductory reading material for students prior to discussing multiplication material. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=a%20picture%20storybook" title="a picture storybook">a picture storybook</a>, <a href="https://publications.waset.org/abstracts/search?q=funds%20of%20knowledge" title=" funds of knowledge"> funds of knowledge</a>, <a href="https://publications.waset.org/abstracts/search?q=Indigenous%20elementary%20students" title=" Indigenous elementary students"> Indigenous elementary students</a>, <a href="https://publications.waset.org/abstracts/search?q=literacy" title=" literacy"> literacy</a>, <a href="https://publications.waset.org/abstracts/search?q=numeracy" title=" numeracy"> numeracy</a> </p> <a href="https://publications.waset.org/abstracts/138000/integrating-indigenous-students-funds-of-knowledge-to-introduce-multiplication-with-a-picture-storybook" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138000.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">189</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">5366</span> A Design of Elliptic Curve Cryptography Processor based on SM2 over GF(p)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shiji%20Hu">Shiji Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lei%20Li"> Lei Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Wanting%20Zhou"> Wanting Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=DaoHong%20Yang"> DaoHong Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The data encryption, is the foundation of today’s communication. On this basis, how to improve the speed of data encryption and decryption is always a problem that scholars work for. In this paper, we proposed an elliptic curve crypto processor architecture based on SM2 prime field. In terms of hardware implementation, we optimized the algorithms in different stages of the structure. In finite field modulo operation, we proposed an optimized improvement of Karatsuba-Ofman multiplication algorithm, and shorten the critical path through pipeline structure in the algorithm implementation. Based on SM2 recommended prime field, a fast modular reduction algorithm is used to reduce 512-bit wide data obtained from the multiplication unit. The radix-4 extended Euclidean algorithm was used to realize the conversion between affine coordinate system and Jacobi projective coordinate system. In the parallel scheduling of point operations on elliptic curves, we proposed a three-level parallel structure of point addition and point double based on the Jacobian projective coordinate system. Combined with the scalar multiplication algorithm, we added mutual pre-operation to the point addition and double point operation to improve the efficiency of the scalar point multiplication. The proposed ECC hardware architecture was verified and implemented on Xilinx Virtex-7 and ZYNQ-7 platforms, and each 256-bit scalar multiplication operation took 0.275ms. The performance for handling scalar multiplication is 32 times that of CPU(dual-core ARM Cortex-A9). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elliptic%20curve%20cryptosystems" title="Elliptic curve cryptosystems">Elliptic curve cryptosystems</a>, <a href="https://publications.waset.org/abstracts/search?q=SM2" title=" SM2"> SM2</a>, <a href="https://publications.waset.org/abstracts/search?q=modular%20multiplication" title=" modular multiplication"> modular multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=point%20multiplication." title=" point multiplication."> point multiplication.</a> </p> <a href="https://publications.waset.org/abstracts/164598/a-design-of-elliptic-curve-cryptography-processor-based-on-sm2-over-gfp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164598.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">98</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">5365</span> Symmetry Properties of Linear Algebraic Systems with Non-Canonical Scalar Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Krish%20Jhurani">Krish Jhurani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research paper presents an in-depth analysis of symmetry properties in linear algebraic systems under the operation of non-canonical scalar multiplication structures, specifically semirings, and near-rings. The objective is to unveil the profound alterations that occur in traditional linear algebraic structures when we replace conventional field multiplication with these non-canonical operations. In the methodology, we first establish the theoretical foundations of non-canonical scalar multiplication, followed by a meticulous investigation into the resulting symmetry properties, focusing on eigenvectors, eigenspaces, and invariant subspaces. The methodology involves a combination of rigorous mathematical proofs and derivations, supplemented by illustrative examples that exhibit these discovered symmetry properties in tangible mathematical scenarios. The core findings uncover unique symmetry attributes. For linear algebraic systems with semiring scalar multiplication, we reveal eigenvectors and eigenvalues. Systems operating under near-ring scalar multiplication disclose unique invariant subspaces. These discoveries drastically broaden the traditional landscape of symmetry properties in linear algebraic systems. With the application of these findings, potential practical implications span across various fields such as physics, coding theory, and cryptography. They could enhance error detection and correction codes, devise more secure cryptographic algorithms, and even influence theoretical physics. This expansion of applicability accentuates the significance of the presented research. The research paper thus contributes to the mathematical community by bringing forth perspectives on linear algebraic systems and their symmetry properties through the lens of non-canonical scalar multiplication, coupled with an exploration of practical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenspaces" title="eigenspaces">eigenspaces</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvectors" title=" eigenvectors"> eigenvectors</a>, <a href="https://publications.waset.org/abstracts/search?q=invariant%20subspaces" title=" invariant subspaces"> invariant subspaces</a>, <a href="https://publications.waset.org/abstracts/search?q=near-rings" title=" near-rings"> near-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=non-canonical%20scalar%20multiplication" title=" non-canonical scalar multiplication"> non-canonical scalar multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=semirings" title=" semirings"> semirings</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetry%20properties" title=" symmetry properties"> symmetry properties</a> </p> <a href="https://publications.waset.org/abstracts/167875/symmetry-properties-of-linear-algebraic-systems-with-non-canonical-scalar-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167875.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">123</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">5364</span> Very Large Scale Integration Architecture of Finite Impulse Response Filter Implementation Using Retiming Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Jalaja">S. Jalaja</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Vijaya%20Prakash"> A. M. Vijaya Prakash </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recursive combination of an algorithm based on Karatsuba multiplication is exploited to design a generalized transpose and parallel Finite Impulse Response (FIR) Filter. Mid-range Karatsuba multiplication and Carry Save adder based on Karatsuba multiplication reduce time complexity for higher order multiplication implemented up to n-bit. As a result, we design modified N-tap Transpose and Parallel Symmetric FIR Filter Structure using Karatsuba algorithm. The mathematical formulation of the FFA Filter is derived. The proposed architecture involves significantly less area delay product (APD) then the existing block implementation. By adopting retiming technique, hardware cost is reduced further. The filter architecture is designed by using 90 nm technology library and is implemented by using cadence EDA Tool. The synthesized result shows better performance for different word length and block size. The design achieves switching activity reduction and low power consumption by applying with and without retiming for different combination of the circuit. The proposed structure achieves more than a half of the power reduction by adopting with and without retiming techniques compared to the earlier design structure. As a proof of the concept for block size 16 and filter length 64 for CKA method, it achieves a 51% as well as 70% less power by applying retiming technique, and for CSA method it achieves a 57% as well as 77% less power by applying retiming technique compared to the previously proposed design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=carry%20save%20adder%20Karatsuba%20multiplication" title="carry save adder Karatsuba multiplication">carry save adder Karatsuba multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=mid%20range%20Karatsuba%20multiplication" title=" mid range Karatsuba multiplication"> mid range Karatsuba multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20FFA%20and%20transposed%20filter" title=" modified FFA and transposed filter"> modified FFA and transposed filter</a>, <a href="https://publications.waset.org/abstracts/search?q=retiming" title=" retiming"> retiming</a> </p> <a href="https://publications.waset.org/abstracts/56239/very-large-scale-integration-architecture-of-finite-impulse-response-filter-implementation-using-retiming-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56239.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">5363</span> Performance Analysis and Optimization for Diagonal Sparse Matrix-Vector Multiplication on Machine Learning Unit</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiuyu%20Dai">Qiuyu Dai</a>, <a href="https://publications.waset.org/abstracts/search?q=Haochong%20Zhang"> Haochong Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiangrong%20Liu"> Xiangrong Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Diagonal sparse matrix-vector multiplication is a well-studied topic in the fields of scientific computing and big data processing. However, when diagonal sparse matrices are stored in DIA format, there can be a significant number of padded zero elements and scattered points, which can lead to a degradation in the performance of the current DIA kernel. This can also lead to excessive consumption of computational and memory resources. In order to address these issues, the authors propose the DIA-Adaptive scheme and its kernel, which leverages the parallel instruction sets on MLU. The researchers analyze the effect of allocating a varying number of threads, clusters, and hardware architectures on the performance of SpMV using different formats. The experimental results indicate that the proposed DIA-Adaptive scheme performs well and offers excellent parallelism. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20method" title="adaptive method">adaptive method</a>, <a href="https://publications.waset.org/abstracts/search?q=DIA" title=" DIA"> DIA</a>, <a href="https://publications.waset.org/abstracts/search?q=diagonal%20sparse%20matrices" title=" diagonal sparse matrices"> diagonal sparse matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=MLU" title=" MLU"> MLU</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20matrix-vector%20multiplication" title=" sparse matrix-vector multiplication"> sparse matrix-vector multiplication</a> </p> <a href="https://publications.waset.org/abstracts/161003/performance-analysis-and-optimization-for-diagonal-sparse-matrix-vector-multiplication-on-machine-learning-unit" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161003.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">135</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">5362</span> Implementation of Integer Sub-Decomposition Method on Elliptic Curves with J-Invariant 1728</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siti%20Noor%20Farwina%20Anwar">Siti Noor Farwina Anwar</a>, <a href="https://publications.waset.org/abstracts/search?q=Hailiza%20Kamarulhaili"> Hailiza Kamarulhaili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present the idea of implementing the Integer Sub-Decomposition (ISD) method on elliptic curves with j-invariant 1728. The ISD method was proposed in 2013 to compute scalar multiplication in elliptic curves, which remains to be the most expensive operation in Elliptic Curve Cryptography (ECC). However, the original ISD method only works on integer number field and solve integer scalar multiplication. By extending the method into the complex quadratic field, we are able to solve complex multiplication and implement the ISD method on elliptic curves with j-invariant 1728. The curve with j-invariant 1728 has a unique discriminant of the imaginary quadratic field. This unique discriminant of quadratic field yields a unique efficiently computable endomorphism, which later able to speed up the computations on this curve. However, the ISD method needs three endomorphisms to be accomplished. Hence, we choose all three endomorphisms to be from the same imaginary quadratic field as the curve itself, where the first endomorphism is the unique endomorphism yield from the discriminant of the imaginary quadratic field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=efficiently%20computable%20endomorphism" title="efficiently computable endomorphism">efficiently computable endomorphism</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20scalar%20multiplication" title=" elliptic scalar multiplication"> elliptic scalar multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=j-invariant%201728" title=" j-invariant 1728"> j-invariant 1728</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20field" title=" quadratic field"> quadratic field</a> </p> <a href="https://publications.waset.org/abstracts/89234/implementation-of-integer-sub-decomposition-method-on-elliptic-curves-with-j-invariant-1728" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89234.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">200</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">5361</span> In vitro Clonal Multiplication and Acclimatization of Large Cardamom (Amomum subulatum Roxb.) </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Krishna%20Poudel">Krishna Poudel</a>, <a href="https://publications.waset.org/abstracts/search?q=Tahar%20Katuwal"> Tahar Katuwal</a>, <a href="https://publications.waset.org/abstracts/search?q=Sujan%20Karki"> Sujan Karki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A rapid propagation and acclimatization method of large cardamom was optimized in this study. Sprouted rhizome buds were collected. The excised rhizome bud explants were cultured on semi solid culture media. The explants were cultured on Murashige and Skoog’s (MS) medium supplemented with different concentration and combinations of BAP (6-Benzyl-amino-purine) and IBA (Indole-3-butyric acid) for shoot and root induction. Explants cultured on MS basal medium supplemented with 1.0 mg/l BAP + 0.5 gm/l IBA showed the highest rate of shoot multiplication. In vitro shoots were rooted on to the half-strength MS basal media supplemented with 0.5 mg/l IBA. Rooted shoots were transplanted in the screen house for hardening process. These hardened plants were subsequently shifted into the netted nursery for further multiplication process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=concentration" title="concentration">concentration</a>, <a href="https://publications.waset.org/abstracts/search?q=explants" title=" explants"> explants</a>, <a href="https://publications.waset.org/abstracts/search?q=hardening" title=" hardening"> hardening</a>, <a href="https://publications.waset.org/abstracts/search?q=rhizome" title=" rhizome"> rhizome</a> </p> <a href="https://publications.waset.org/abstracts/54823/in-vitro-clonal-multiplication-and-acclimatization-of-large-cardamom-amomum-subulatum-roxb" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54823.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">243</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">5360</span> Effective Dose and Size Specific Dose Estimation with and without Tube Current Modulation for Thoracic Computed Tomography Examinations: A Phantom Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Gharbi">S. Gharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Labidi"> S. Labidi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Mars"> M. Mars</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Chelli"> M. Chelli</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Ladeb"> F. Ladeb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this study is to reduce radiation dose for chest CT examination by including Tube Current Modulation (TCM) to a standard CT protocol. A scan of an anthropomorphic male Alderson phantom was performed on a 128-slice scanner. The estimation of effective dose (ED) in both scans with and without mAs modulation was done via multiplication of Dose Length Product (DLP) to a conversion factor. Results were compared to those measured with a CT-Expo software. The size specific dose estimation (SSDE) values were obtained by multiplication of the volume CT dose index (CTDIvol) with a conversion size factor related to the phantom’s effective diameter. Objective assessment of image quality was performed with Signal to Noise Ratio (SNR) measurements in phantom. SPSS software was used for data analysis. Results showed including CARE Dose 4D; ED was lowered by 48.35% and 51.51% using DLP and CT-expo, respectively. In addition, ED ranges between 7.01 mSv and 6.6 mSv in case of standard protocol, while it ranges between 3.62 mSv and 3.2 mSv with TCM. Similar results are found for SSDE; dose was higher without TCM of 16.25 mGy and was lower by 48.8% including TCM. The SNR values calculated were significantly different (p=0.03<0.05). The highest one is measured on images acquired with TCM and reconstructed with Filtered back projection (FBP). In conclusion, this study proves the potential of TCM technique in SSDE and ED reduction and in conserving image quality with high diagnostic reference level for thoracic CT examinations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anthropomorphic%20phantom" title="anthropomorphic phantom">anthropomorphic phantom</a>, <a href="https://publications.waset.org/abstracts/search?q=computed%20tomography" title=" computed tomography"> computed tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=CT-expo" title=" CT-expo"> CT-expo</a>, <a href="https://publications.waset.org/abstracts/search?q=radiation%20dose" title=" radiation dose"> radiation dose</a> </p> <a href="https://publications.waset.org/abstracts/60056/effective-dose-and-size-specific-dose-estimation-with-and-without-tube-current-modulation-for-thoracic-computed-tomography-examinations-a-phantom-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60056.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">221</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">5359</span> Functional Instruction Set Simulator (ISS) of a Neural Network (NN) IP with Native BF-16 Generator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debajyoti%20Mukherjee">Debajyoti Mukherjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Arathy%20B.%20S."> Arathy B. S.</a>, <a href="https://publications.waset.org/abstracts/search?q=Arpita%20Sahu"> Arpita Sahu</a>, <a href="https://publications.waset.org/abstracts/search?q=Saranga%20P.%20Pogula"> Saranga P. Pogula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A Functional Model to mimic the functional correctness of a Neural Network Compute Accelerator IP is very crucial for design validation. Neural network workloads are based on a Brain Floating Point (BF-16) data type. The major challenge we were facing was the incompatibility of gcc compilers to BF-16 datatype, which we addressed with a native BF-16 generator integrated to our functional model. Moreover, working with big GEMM (General Matrix Multiplication) or SpMM (Sparse Matrix Multiplication) Work Loads (Dense or Sparse) and debugging the failures related to data integrity is highly painstaking. In this paper, we are addressing the quality challenge of such a complex Neural Network Accelerator design by proposing a Functional Model-based scoreboard or Software model using SystemC. The proposed Functional Model executes the assembly code based on the ISA of the processor IP, decodes all instructions, and executes as expected to be done by the DUT. The said model would give a lot of visibility and debug capability in the DUT bringing up micro-steps of execution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ISA%20%28instruction%20set%20architecture%29" title="ISA (instruction set architecture)">ISA (instruction set architecture)</a>, <a href="https://publications.waset.org/abstracts/search?q=NN%20%28neural%20network%29" title=" NN (neural network)"> NN (neural network)</a>, <a href="https://publications.waset.org/abstracts/search?q=TLM%20%28transaction-level%20modeling%29" title=" TLM (transaction-level modeling)"> TLM (transaction-level modeling)</a>, <a href="https://publications.waset.org/abstracts/search?q=GEMM%20%28general%20matrix%20multiplication%29" title=" GEMM (general matrix multiplication)"> GEMM (general matrix multiplication)</a> </p> <a href="https://publications.waset.org/abstracts/168875/functional-instruction-set-simulator-iss-of-a-neural-network-nn-ip-with-native-bf-16-generator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168875.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">86</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">5358</span> Spectral Analysis Approaches for Simultaneous Determination of Binary Mixtures with Overlapping Spectra: An Application on Pseudoephedrine Sulphate and Loratadine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sara%20El-Hanboushy">Sara El-Hanboushy</a>, <a href="https://publications.waset.org/abstracts/search?q=Hayam%20Lotfy"> Hayam Lotfy</a>, <a href="https://publications.waset.org/abstracts/search?q=Yasmin%20Fayez"> Yasmin Fayez</a>, <a href="https://publications.waset.org/abstracts/search?q=Engy%20Shokry"> Engy Shokry</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20%20Abdelkawy"> Mohammed Abdelkawy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Simple, speciﬁc, accurate and precise spectrophotometric methods are developed and validated for simultaneous determination of pseudoephedrine sulphate (PSE) and loratadine (LOR) in combined dosage form based on spectral analysis technique. Pseudoephedrine (PSE) in binary mixture could be analyzed either by using its resolved zero order absorption spectrum at its λ max 256.8 nm after subtraction of LOR spectrum or in presence of LOR spectrum by absorption correction method at 256.8 nm, dual wavelength (DWL) method at 254nm and 273nm, induced dual wavelength (IDWL) method at 256nm and 272nm and ratio difference (RD) method at 256nm and 262 nm. Loratadine (LOR) in the mixture could be analyzed directly at 280nm without any interference of PSE spectrum or at 250 nm using its recovered zero order absorption spectrum using constant multiplication(CM).In addition, simultaneous determination for PSE and LOR in their mixture could be applied by induced amplitude modulation method (IAM) coupled with amplitude multiplication (PM). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dual%20wavelength%20%28DW%29" title="dual wavelength (DW)">dual wavelength (DW)</a>, <a href="https://publications.waset.org/abstracts/search?q=induced%20amplitude%20modulation%20method%20%28IAM%29%20coupled%20with%20amplitude%20multiplication%20%28PM%29" title=" induced amplitude modulation method (IAM) coupled with amplitude multiplication (PM)"> induced amplitude modulation method (IAM) coupled with amplitude multiplication (PM)</a>, <a href="https://publications.waset.org/abstracts/search?q=loratadine" title=" loratadine"> loratadine</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudoephedrine%20sulphate" title=" pseudoephedrine sulphate"> pseudoephedrine sulphate</a>, <a href="https://publications.waset.org/abstracts/search?q=ratio%20difference%20%28RD%29" title=" ratio difference (RD)"> ratio difference (RD)</a> </p> <a href="https://publications.waset.org/abstracts/53587/spectral-analysis-approaches-for-simultaneous-determination-of-binary-mixtures-with-overlapping-spectra-an-application-on-pseudoephedrine-sulphate-and-loratadine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53587.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">321</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5357</span> Performance Evaluation of Wideband Code Division Multiplication Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Osama%20Abdallah%20Mohammed%20Enan">Osama Abdallah Mohammed Enan</a>, <a href="https://publications.waset.org/abstracts/search?q=Amin%20Babiker%20A%2FNabi%20Mustafa"> Amin Babiker A/Nabi Mustafa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this study is to evaluate and analyze different parameters of WCDMA (wideband code division multiplication). Moreover, this study also incorporates brief yet throughout analysis of WCDMA’s components as well as its internal architecture. This study also examines different power controls. These power controls may include open loop power control, closed or inner group loop power control and outer loop power control. Different handover techniques or methods of WCDMA are also illustrated in this study. These handovers may include hard handover, inter system handover and soft and softer handover. Different duplexing techniques are also described in the paper. This study has also presented an idea about different parameters of WCDMA that leads the system towards QoS issues. This may help the operator in designing and developing adequate network configuration. In addition to this, the study has also investigated various parameters including Bit Energy per Noise Spectral Density (Eb/No), Noise rise, and Bit Error Rate (BER). After simulating these parameters, using MATLAB environment, it was investigated that, for a given Eb/No value the system capacity increase by increasing the reuse factor. Besides that, it was also analyzed that, noise rise is decreasing for lower data rates and for lower interference levels. Finally, it was examined that, BER increase by using one type of modulation technique than using other type of modulation technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=duplexing" title="duplexing">duplexing</a>, <a href="https://publications.waset.org/abstracts/search?q=handover" title=" handover"> handover</a>, <a href="https://publications.waset.org/abstracts/search?q=loop%20power%20control" title=" loop power control"> loop power control</a>, <a href="https://publications.waset.org/abstracts/search?q=WCDMA" title=" WCDMA"> WCDMA</a> </p> <a href="https://publications.waset.org/abstracts/85847/performance-evaluation-of-wideband-code-division-multiplication-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85847.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">215</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">5356</span> The Students' Mathematical Competency and Attitude towards Mathematics Using the Trachtenberg Speed Math System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marlone%20D.%20Severo">Marlone D. Severo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A pre- and post-test quasi-experimental design was used to test the intervention of Trachtenberg Speed Math on the mathematical competency of sixty (60) matched-paired students with a poor performing grade in Mathematics from one of the biggest public national high school at the South of Metro Manila. Both control and experimental group were administered with the Attitude Towards Mathematics Inventory (ATMI) before the pretest were given and both group showed high dislike for Mathematics. Pretest showed a 53 percent accuracy for the control group and 51 percent for the experimental group using a 15-item long multiplication test without any aid of a computing device. The experimental group were taught how to use the Trachtenberg number-keys and techniques in multiplication between October 2014 to March 2015. Post-test showed an improvement in the experimental group with 96 percent accuracy for the control group and a dismal 57 percent for the control group in long-multiplication. Post-test ATMI were administered. The control group showed a great dislike towards Mathematics, while the experimental group showed a positive attitude towards the subject. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attitude%20towards%20mathematics" title="attitude towards mathematics">attitude towards mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20competency" title=" mathematical competency"> mathematical competency</a>, <a href="https://publications.waset.org/abstracts/search?q=number-keys" title=" number-keys"> number-keys</a>, <a href="https://publications.waset.org/abstracts/search?q=trachtenberg%20speed%20math" title=" trachtenberg speed math"> trachtenberg speed math</a> </p> <a href="https://publications.waset.org/abstracts/34697/the-students-mathematical-competency-and-attitude-towards-mathematics-using-the-trachtenberg-speed-math-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34697.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">367</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">5355</span> Modeling a Feedback Concept in a Spherical Thundercloud Cell</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zemlianskaya%20Daria">Zemlianskaya Daria</a>, <a href="https://publications.waset.org/abstracts/search?q=Egor%20Stadnichuk"> Egor Stadnichuk</a>, <a href="https://publications.waset.org/abstracts/search?q=Ekaterina%20Svechnikova"> Ekaterina Svechnikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Relativistic runaway electron avalanches (RREAs) are generally accepted as a source of thunderstorms gamma-ray radiation. Avalanches' dynamics in the electric fields can lead to their multiplication via gamma-rays and positrons, which is called relativistic feedback. This report shows that a non-uniform electric field geometry leads to the new RREAs multiplication mechanism - “geometric feedback”, which occurs due to the exchange of high-energy particles between different accelerating regions within a thundercloud. This report will present the results of the simulation in GEANT4 of feedback in a spherical cell. Necessary conditions for the occurrence of geometric feedback were obtained from it. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20field" title="electric field">electric field</a>, <a href="https://publications.waset.org/abstracts/search?q=GEANT4" title=" GEANT4"> GEANT4</a>, <a href="https://publications.waset.org/abstracts/search?q=gamma-rays" title=" gamma-rays"> gamma-rays</a>, <a href="https://publications.waset.org/abstracts/search?q=relativistic%20runaway%20electron%20avalanches%20%28RREAs%29" title=" relativistic runaway electron avalanches (RREAs)"> relativistic runaway electron avalanches (RREAs)</a>, <a href="https://publications.waset.org/abstracts/search?q=relativistic%20feedback" title=" relativistic feedback"> relativistic feedback</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20thundercloud" title=" the thundercloud"> the thundercloud</a> </p> <a href="https://publications.waset.org/abstracts/142367/modeling-a-feedback-concept-in-a-spherical-thundercloud-cell" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142367.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">173</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">5354</span> The Theory of Number "0"</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Iryna%20Shevchenko">Iryna Shevchenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The science of mathematics was originated at the order of count of objects and subsequently for the measurement of size and quality of objects using the logical or abstract means. The laws of mathematics are based on the study of absolute values. The number 0 or "nothing" is the purely logical (as the opposite to absolute) value as the "nothing" should always assume the space for the something that had existed there; otherwise the "something" would never come to existence. In this work we are going to prove that the number "0" is the abstract (logical) and not an absolute number and it has the absolute value of “∞” (infinity). Therefore, the number "0" might not stand in the row of numbers that symbolically represents the absolute values, as it would be the mathematically incorrect. The symbolical value of number "0" in the row of numbers could be represented with symbol "∞" (infinity). As a result, we have the mathematical row of numbers: epsilon, ...4, 3, 2, 1, ∞. As the conclusions of the theory of number “0” we presented the statements: multiplication and division by fractions of numbers is illegal operation and the mathematical division by number “0” is allowed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=illegal%20operation%20of%20division%20and%20multiplication%20by%20fractions%20of%20number" title="illegal operation of division and multiplication by fractions of number">illegal operation of division and multiplication by fractions of number</a>, <a href="https://publications.waset.org/abstracts/search?q=infinity" title=" infinity"> infinity</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20row%20of%20numbers" title=" mathematical row of numbers"> mathematical row of numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=theory%20of%20number%20%E2%80%9C0%E2%80%9D" title=" theory of number “0”"> theory of number “0”</a> </p> <a href="https://publications.waset.org/abstracts/27872/the-theory-of-number-0" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27872.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">552</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">5353</span> On Lie Groupoids, Bundles, and Their Categories</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20G.%20Romeo">P. G. Romeo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A Lie group is a highly sophisticated structure which is a smooth manifold whose underlying set of elements is equipped with the structure of a group such that the group multiplication and inverse-assigning functions are smooth. This structure was introduced by the Norwegian mathematician So- phus Lie who founded the theory of continuous groups. The Lie groups are well developed and have wide applications in areas including Mathematical Physics. There are several advances and generalizations for Lie groups and Lie groupoids is one such which is termed as a "many-object generalization" of Lie groups. A groupoid is a category whose morphisms are all invertible, obviously, every group is a groupoid but not conversely. Definition 1. A Lie groupoid G ⇒ M is a groupoid G on a base M together with smooth structures on G and M such that the maps α, β: G → M are surjective submertions, the object inclusion map x '→ 1x, M → G is smooth, and the partial multiplication G ∗ G → G is smooth. A bundle is a triple (E, p, B) where E, B are topological spaces p: E → B is a map. Space B is called the base space and space E is called total space and map p is the projection of the bundle. For each b ∈ B, the space p−1(b) is called the fibre of the bundle over b ∈ B. Intuitively a bundle is regarded as a union of fibres p−1(b) for b ∈ B parametrized by B and ’glued together’ by the topology of the space E. A cross-section of a bundle (E, p, B) is a map s: B → E such that ps = 1B. Example 1. Given any space B, a product bundle over B with fibre F is (B × F, p, B) where p is the projection on the first factor. Definition 2. A principal bundle P (M, G, π) consists of a manifold P, a Lie group G, and a free right action of G on P denoted (u, g) '→ ug, such that the orbits of the action coincide with the fibres of the surjective submersion π : P → M, and such that M is covered by the domains of local sections σ: U → P, U ⊆ M, of π. Definition 3. A Lie group bundle, or LGB, is a smooth fibre bundle (K, q, M ) in which each fibre (Km = q−1(m), and the fibre type G, has a Lie group structure, and for which there is an atlas {ψi: Ui × G → KUi } such that each {ψi,m : G → Km}, is an isomorphism of Lie groups. A morphism of LGB from (K, q, M ) to (K′, q′, M′) is a morphism (F, f ) of fibre bundles such that each Fm: Km → K′ is a morphism of Lie groups. In this paper, we will be discussing the Lie groupoid bundles. Here it is seen that to a Lie groupoid Ω on base B there is associated a collection of principal bundles Ωx(B, Ωx), all of which are mutually isomorphic and conversely, associated to any principal bundle P (B, G, p) there is a groupoid called the Ehresmann groupoid which is easily seen to be Lie. Further, some interesting properties of the category of Lie groupoids and bundles will be explored. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=groupoid" title="groupoid">groupoid</a>, <a href="https://publications.waset.org/abstracts/search?q=lie%20group" title=" lie group"> lie group</a>, <a href="https://publications.waset.org/abstracts/search?q=lie%20groupoid" title=" lie groupoid"> lie groupoid</a>, <a href="https://publications.waset.org/abstracts/search?q=bundle" title=" bundle"> bundle</a> </p> <a href="https://publications.waset.org/abstracts/173005/on-lie-groupoids-bundles-and-their-categories" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173005.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">77</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">5352</span> Private Coded Computation of Matrix Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malihe%20Aliasgari">Malihe Aliasgari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Nejatbakhsh"> Yousef Nejatbakhsh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The era of Big Data and the immensity of real-life datasets compels computation tasks to be performed in a distributed fashion, where the data is dispersed among many servers that operate in parallel. However, massive parallelization leads to computational bottlenecks due to faulty servers and stragglers. Stragglers refer to a few slow or delay-prone processors that can bottleneck the entire computation because one has to wait for all the parallel nodes to finish. The problem of straggling processors, has been well studied in the context of distributed computing. Recently, it has been pointed out that, for the important case of linear functions, it is possible to improve over repetition strategies in terms of the tradeoff between performance and latency by carrying out linear precoding of the data prior to processing. The key idea is that, by employing suitable linear codes operating over fractions of the original data, a function may be completed as soon as enough number of processors, depending on the minimum distance of the code, have completed their operations. The problem of matrix-matrix multiplication in the presence of practically big sized of data sets faced with computational and memory related difficulties, which makes such operations are carried out using distributed computing platforms. In this work, we study the problem of distributed matrix-matrix multiplication W = XY under storage constraints, i.e., when each server is allowed to store a fixed fraction of each of the matrices X and Y, which is a fundamental building of many science and engineering fields such as machine learning, image and signal processing, wireless communication, optimization. Non-secure and secure matrix multiplication are studied. We want to study the setup, in which the identity of the matrix of interest should be kept private from the workers and then obtain the recovery threshold of the colluding model, that is, the number of workers that need to complete their task before the master server can recover the product W. The problem of secure and private distributed matrix multiplication W = XY which the matrix X is confidential, while matrix Y is selected in a private manner from a library of public matrices. We present the best currently known trade-off between communication load and recovery threshold. On the other words, we design an achievable PSGPD scheme for any arbitrary privacy level by trivially concatenating a robust PIR scheme for arbitrary colluding workers and private databases and the proposed SGPD code that provides a smaller computational complexity at the workers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coded%20distributed%20computation" title="coded distributed computation">coded distributed computation</a>, <a href="https://publications.waset.org/abstracts/search?q=private%20information%20retrieval" title=" private information retrieval"> private information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=stragglers" title=" stragglers"> stragglers</a> </p> <a href="https://publications.waset.org/abstracts/144645/private-coded-computation-of-matrix-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144645.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">122</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">5351</span> A Review on Bearing Capacity Factor Nγ of Foundations with Different Shapes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Ziaie%20Moayed">R. Ziaie Moayed</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Taghvamanesh"> S. Taghvamanesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> So far several methods by different researchers have been developed in order to calculate the bearing capacity factors of foundations and retaining walls. In this paper, the bearing capacity factor Ny (shape factor) for different types of foundation have been investigated. The formula for bearing capacity on c–φ–γ soil can still be expressed by Terzaghi’s equation except that the bearing capacity factor Ny depends on the surcharge ratio, and friction angle φ. Many empirical definitions have been used for measurement of the bearing capacity factors N <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bearing%20capacity" title="bearing capacity">bearing capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=bearing%20capacity%20factor%20N%CE%B3" title=" bearing capacity factor Nγ"> bearing capacity factor Nγ</a>, <a href="https://publications.waset.org/abstracts/search?q=irregular%20foundations" title=" irregular foundations"> irregular foundations</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20factor" title=" shape factor"> shape factor</a> </p> <a href="https://publications.waset.org/abstracts/134905/a-review-on-bearing-capacity-factor-ngh-of-foundations-with-different-shapes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/134905.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">150</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">5350</span> Parametric Study and Modelling of Orthogonal Cutting Process for AISI 4340 and Ti-6Al-4V Alloy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Purnank%20Bhatt">Purnank Bhatt</a>, <a href="https://publications.waset.org/abstracts/search?q=Mit%20Shah"> Mit Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Pawan%20Nagda"> Pawan Nagda</a>, <a href="https://publications.waset.org/abstracts/search?q=Vimal%20Jasoliya"> Vimal Jasoliya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The influence of parameters like velocity and depth of cut on cutting forces is investigated for the empirical relation of the coefficient of friction derived for CRS 1018 for different materials like AISI 4340 and Ti6Al4V. For this purpose, turning tests were carried out on the above materials using coated cemented carbide tool inserts for steel grade and uncoated cemented carbide cutting tool inserts for Titanium with different chip breaker geometries. The cutting forces were measured using a Kistler dynamometer where the multiplication factor taken is 200.The effect of cutting force variation was analyzed experimentally and are compared with the analytical results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cutting%20forces" title="cutting forces">cutting forces</a>, <a href="https://publications.waset.org/abstracts/search?q=coefficient%20of%20friction" title=" coefficient of friction"> coefficient of friction</a>, <a href="https://publications.waset.org/abstracts/search?q=carbide%20tool%20inserts" title=" carbide tool inserts"> carbide tool inserts</a>, <a href="https://publications.waset.org/abstracts/search?q=titanium" title=" titanium"> titanium</a> </p> <a href="https://publications.waset.org/abstracts/66438/parametric-study-and-modelling-of-orthogonal-cutting-process-for-aisi-4340-and-ti-6al-4v-alloy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66438.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">375</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">5349</span> Influence of Cyperus Rotundus Active Principles Inhibit Viral Multiplication and Stimulate Immune System in Indian White Shrimp Fenneropenaeus Indicus against White Spot Syndrome Virus Infection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thavasimuthu%20Citarasu">Thavasimuthu Citarasu</a>, <a href="https://publications.waset.org/abstracts/search?q=Mariavincent%20Michaelbabu"> Mariavincent Michaelbabu</a>, <a href="https://publications.waset.org/abstracts/search?q=Vikram%20Vakharia"> Vikram Vakharia </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rhizome of Java grass, Cyperus rotundus was extracted different organic polar and non-polar solvents and performed the in vitro antiviral and immunostimulant activities against White Spot Syndrome Virus (WSSV) and Vibrio harveyi respectively. Based on the initial screening the ethyl acetate extract of C. rotundus was strong activities and further it was purified through silica column chromatography and the fractions were screened again for antiviral and immunostimulant activity. Among the different fractions screened against the WSSV and V. harveyi, the fractions, F-III to FV had strong activities. In order to study the in vivo influence of C. rotundus, the fractions (F-III to FV) were pooled and delivered to the F. indicus through artificial feed for 30 days. After the feeding trail the experimental and control diet fed F. indicus were challenged with virulent WSSV and studied the survival, molecular diagnosis, biochemical, haematological and immunological parameters. Surprisingly, the pooled fractions (F-III to FV) incorporated diets helped to significantly (P < 0.01) suppressed viral multiplication, showed significant (P < 0.01) differences in protein and glucose levels, improved total haemocyte count (THC), coagulase activity, significantly increased (P < =0.001) prophenol oxidase and intracellular superoxide anion production compared to the control shrimps. Based on the results, C. rotundus extracts effectively suppressed WSSV multiplication and improve the immune system in F. indicus against WSSV infection and this knowledge will helps to develop novel drugs from C. rotundus against WSSV. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=antiviral%20drugs" title="antiviral drugs">antiviral drugs</a>, <a href="https://publications.waset.org/abstracts/search?q=cyperus%20rotundus" title=" cyperus rotundus"> cyperus rotundus</a>, <a href="https://publications.waset.org/abstracts/search?q=fenneropenaeus%20indicus" title=" fenneropenaeus indicus"> fenneropenaeus indicus</a>, <a href="https://publications.waset.org/abstracts/search?q=WSSV" title=" WSSV"> WSSV</a> </p> <a href="https://publications.waset.org/abstracts/25193/influence-of-cyperus-rotundus-active-principles-inhibit-viral-multiplication-and-stimulate-immune-system-in-indian-white-shrimp-fenneropenaeus-indicus-against-white-spot-syndrome-virus-infection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25193.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">457</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">5348</span> Functional Instruction Set Simulator of a Neural Network IP with Native Brain Float-16 Generator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debajyoti%20Mukherjee">Debajyoti Mukherjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Arathy%20B.%20S."> Arathy B. S.</a>, <a href="https://publications.waset.org/abstracts/search?q=Arpita%20Sahu"> Arpita Sahu</a>, <a href="https://publications.waset.org/abstracts/search?q=Saranga%20P.%20Pogula"> Saranga P. Pogula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A functional model to mimic the functional correctness of a neural network compute accelerator IP is very crucial for design validation. Neural network workloads are based on a Brain Floating Point (BF-16) data type. The major challenge we were facing was the incompatibility of GCC compilers to the BF-16 datatype, which we addressed with a native BF-16 generator integrated into our functional model. Moreover, working with big GEMM (General Matrix Multiplication) or SpMM (Sparse Matrix Multiplication) Work Loads (Dense or Sparse) and debugging the failures related to data integrity is highly painstaking. In this paper, we are addressing the quality challenge of such a complex neural network accelerator design by proposing a functional model-based scoreboard or software model using SystemC. The proposed functional model executes the assembly code based on the ISA of the processor IP, decodes all instructions, and executes as expected to be done by the DUT. The said model would give a lot of visibility and debug capability in the DUT, bringing up micro-steps of execution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ISA" title="ISA">ISA</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=Brain%20Float-16" title=" Brain Float-16"> Brain Float-16</a>, <a href="https://publications.waset.org/abstracts/search?q=DUT" title=" DUT"> DUT</a> </p> <a href="https://publications.waset.org/abstracts/159455/functional-instruction-set-simulator-of-a-neural-network-ip-with-native-brain-float-16-generator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159455.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">94</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">5347</span> Response Reduction Factor for Earthquake Resistant Design of Special Moment Resisting Frames</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rohan%20V.%20Ambekar">Rohan V. Ambekar</a>, <a href="https://publications.waset.org/abstracts/search?q=Shrirang%20N.%20Tande"> Shrirang N. Tande</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study estimates the seismic response reduction factor (R) of reinforced concrete special moment resisting frame (SMRF) with and without shear wall using static nonlinear (pushover) analysis. Calculation of response reduction factor (R) is done as per the new formulation of response reduction factor (R) given by Applied Technology Council (ATC)-19 which is the product of strength factor (Rs), ductility factor (Rµ) and redundancy factor (RR). The analysis revealed that these three factors affect the actual value of response reduction factor (R) and therefore they must be taken into consideration while determining the appropriate response reduction factor to be used during the seismic design process. The actual values required for determination of response reduction factor (R) is worked out on the basis of pushover curve which is a plot of base shear verses roof displacement. Finally, the calculated values of response reduction factor (R) of reinforced concrete special moment resisting frame (SMRF) with and without shear wall are compared with the codal values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=response%20reduction%20factor" title="response reduction factor">response reduction factor</a>, <a href="https://publications.waset.org/abstracts/search?q=ductility%20ratio" title=" ductility ratio"> ductility ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=base%20shear" title=" base shear"> base shear</a>, <a href="https://publications.waset.org/abstracts/search?q=special%20moment%20resisting%20frames" title=" special moment resisting frames"> special moment resisting frames</a> </p> <a href="https://publications.waset.org/abstracts/1362/response-reduction-factor-for-earthquake-resistant-design-of-special-moment-resisting-frames" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1362.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">487</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">5346</span> Impairments Correction of Six-Port Based Millimeter-Wave Radar</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dan%20Ohev%20Zion">Dan Ohev Zion</a>, <a href="https://publications.waset.org/abstracts/search?q=Alon%20Cohen"> Alon Cohen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, the presence of short-range millimeter-wave radar in civil application has increased significantly. Autonomous driving, security, 3D imaging and high data rate communication systems are a few examples. The next challenge is the integration inside small form-factor devices, such as smartphones (e.g. gesture recognition). The main challenge is implementation of a truly low-power, low-complexity high-resolution radar. The most popular approach is the Frequency Modulated Continuous Wave (FMCW) radar, with an analog multiplication front-end. In this paper, we present an approach for adaptive estimation and correction of impairments of such front-end, specifically implemented using the Six-Port Device (SPD) as the multiplier element. The proposed algorithm was simulated and implemented on a 60 GHz radar lab prototype. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=radar" title="radar">radar</a>, <a href="https://publications.waset.org/abstracts/search?q=FMCW%20Radar" title=" FMCW Radar"> FMCW Radar</a>, <a href="https://publications.waset.org/abstracts/search?q=IQ%20mismatch" title=" IQ mismatch"> IQ mismatch</a>, <a href="https://publications.waset.org/abstracts/search?q=six%20port" title=" six port"> six port</a> </p> <a href="https://publications.waset.org/abstracts/117510/impairments-correction-of-six-port-based-millimeter-wave-radar" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/117510.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">152</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=multiplication%20factor&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&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=multiplication%20factor&page=179">179</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&page=180">180</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiplication%20factor&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>