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: least significant bits</title> <meta name="description" content="Search results for: least significant bits"> <meta name="keywords" content="least significant bits"> <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="least significant bits" 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="least significant bits"> <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> 16894</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: least significant bits</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">16894</span> Rounding Technique's Application in Schnorr Signature Algorithm: Known Partially Most Significant Bits of Nonce</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wenjie%20Qin">Wenjie Qin</a>, <a href="https://publications.waset.org/abstracts/search?q=Kewei%20Lv"> Kewei Lv</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 1996, Boneh and Venkatesan proposed the Hidden Number Problem (HNP) and proved the most significant bits (MSB) of computational Diffie-Hellman key exchange scheme and related schemes are unpredictable bits. They also gave a method which is a lattice rounding technique to solve HNP in non-uniform model. In this paper, we put forward a new concept that is Schnorr-MSB-HNP. We also reduce the problem of solving Schnorr signature private key with a few consecutive most significant bits of random nonce (used at each signature generation) to Schnorr-MSB-HNP, then we use the rounding technique to solve the Schnorr-MSB-HNP. We have come to the conclusion that if there is a ‘miraculous box’ which inputs the random nonce and outputs 2loglogq (q is a prime number) most significant bits of nonce, the signature private key will be obtained by choosing 2logq signature messages randomly. Thus we get an attack on the Schnorr signature private key. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rounding%20technique" title="rounding technique">rounding technique</a>, <a href="https://publications.waset.org/abstracts/search?q=most%20significant%20bits" title=" most significant bits"> most significant bits</a>, <a href="https://publications.waset.org/abstracts/search?q=Schnorr%20signature%20algorithm" title=" Schnorr signature algorithm"> Schnorr signature algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=nonce" title=" nonce"> nonce</a>, <a href="https://publications.waset.org/abstracts/search?q=Schnorr-MSB-HNP" title=" Schnorr-MSB-HNP"> Schnorr-MSB-HNP</a> </p> <a href="https://publications.waset.org/abstracts/67137/rounding-techniques-application-in-schnorr-signature-algorithm-known-partially-most-significant-bits-of-nonce" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67137.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">233</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">16893</span> Implementation of Elliptic Curve Cryptography Encryption Engine on a FPGA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamad%20Khairi%20Ishak">Mohamad Khairi Ishak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conventional public key crypto systems such as RSA (Ron Rivest, Adi Shamir and Leonard Adleman), DSA (Digital Signature Algorithm), and Elgamal are no longer efficient to be implemented in the small, memory constrained devices. Elliptic Curve Cryptography (ECC), which allows smaller key length as compared to conventional public key crypto systems, has thus become a very attractive choice for many applications. This paper describes implementation of an elliptic curve cryptography (ECC) encryption engine on a FPGA. The system has been implemented in 2 different key sizes, which are 131 bits and 163 bits. Area and timing analysis are provided for both key sizes for comparison. The crypto system, which has been implemented on Altera’s EPF10K200SBC600-1, has a hardware size of 5945/9984 and 6913/9984 of logic cells for 131 bits implementation and 163 bits implementation respectively. The crypto system operates up to 43 MHz, and performs point multiplication operation in 11.3 ms for 131 bits implementation and 14.9 ms for 163 bits implementation. In terms of speed, our crypto system is about 8 times faster than the software implementation of the same system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title="elliptic curve cryptography">elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20sizes" title=" key sizes"> key sizes</a>, <a href="https://publications.waset.org/abstracts/search?q=memory" title=" memory "> memory </a> </p> <a href="https://publications.waset.org/abstracts/13762/implementation-of-elliptic-curve-cryptography-encryption-engine-on-a-fpga" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13762.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">322</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">16892</span> Robust Medical Image Watermarking Using Frequency Domain and Least Significant Bits Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Volkan%20Kaya">Volkan Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Ersin%20Elbasi"> Ersin Elbasi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Watermarking and stenography are getting importance recently because of copyright protection and authentication. In watermarking we embed stamp, logo, noise or image to multimedia elements such as image, video, audio, animation and text. There are several works have been done in watermarking for different purposes. In this research work, we used watermarking techniques to embed patient information into the medical magnetic resonance (MR) images. There are two methods have been used; frequency domain (Digital Wavelet Transform-DWT, Digital Cosine Transform-DCT, and Digital Fourier Transform-DFT) and spatial domain (Least Significant Bits-LSB) domain. Experimental results show that embedding in frequency domains resist against one type of attacks, and embedding in spatial domain is resist against another group of attacks. Peak Signal Noise Ratio (PSNR) and Similarity Ratio (SR) values are two measurement values for testing. These two values give very promising result for information hiding in medical MR images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=watermarking" title="watermarking">watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20image" title=" medical image"> medical image</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20domain" title=" frequency domain"> frequency domain</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits" title=" least significant bits"> least significant bits</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/75214/robust-medical-image-watermarking-using-frequency-domain-and-least-significant-bits-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75214.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">288</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">16891</span> Digital Image Steganography with Multilayer Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amar%20Partap%20Singh%20Pharwaha">Amar Partap Singh Pharwaha</a>, <a href="https://publications.waset.org/abstracts/search?q=Balkrishan%20Jindal"> Balkrishan Jindal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new method is developed for hiding image in a digital image with multilayer security. In the proposed method, the secret image is encrypted in the first instance using a flexible matrix based symmetric key to add first layer of security. Then another layer of security is added to the secret data by encrypting the ciphered data using Pythagorean Theorem method. The ciphered data bits (4 bits) produced after double encryption are then embedded within digital image in the spatial domain using Least Significant Bits (LSBs) substitution. To improve the image quality of the stego-image, an improved form of pixel adjustment process is proposed. To evaluate the effectiveness of the proposed method, image quality metrics including Peak Signal-to-Noise Ratio (PSNR), Mean Square Error (MSE), entropy, correlation, mean value and Universal Image Quality Index (UIQI) are measured. It has been found experimentally that the proposed method provides higher security as well as robustness. In fact, the results of this study are quite promising. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pythagorean%20theorem" title="Pythagorean theorem">Pythagorean theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20adjustment" title=" pixel adjustment"> pixel adjustment</a>, <a href="https://publications.waset.org/abstracts/search?q=ciphered%20data" title=" ciphered data"> ciphered data</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20hiding" title=" image hiding"> image hiding</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20significant%20bit" title=" least significant bit"> least significant bit</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20matrix" title=" flexible matrix"> flexible matrix</a> </p> <a href="https://publications.waset.org/abstracts/31493/digital-image-steganography-with-multilayer-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31493.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">337</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">16890</span> A High Time Resolution Digital Pulse Width Modulator Based on Field Programmable Gate Array’s Phase Locked Loop Megafunction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jun%20Wang">Jun Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Tingcun%20Wei"> Tingcun Wei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The digital pulse width modulator (DPWM) is the crucial building block for digitally-controlled DC-DC switching converter, which converts the digital duty ratio signal into its analog counterpart to control the power MOSFET transistors on or off. With the increase of switching frequency of digitally-controlled DC-DC converter, the DPWM with higher time resolution is required. In this paper, a 15-bits DPWM with three-level hybrid structure is presented; the first level is composed of a7-bits counter and a comparator, the second one is a 5-bits delay line, and the third one is a 3-bits digital dither. The presented DPWM is designed and implemented using the PLL megafunction of FPGA (Field Programmable Gate Arrays), and the required frequency of clock signal is 128 times of switching frequency. The simulation results show that, for the switching frequency of 2 MHz, a DPWM which has the time resolution of 15 ps is achieved using a maximum clock frequency of 256MHz. The designed DPWM in this paper is especially useful for high-frequency digitally-controlled DC-DC switching converters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DPWM" title="DPWM">DPWM</a>, <a href="https://publications.waset.org/abstracts/search?q=digitally-controlled%20DC-DC%20switching%20converter" title=" digitally-controlled DC-DC switching converter"> digitally-controlled DC-DC switching converter</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=PLL%20megafunction" title=" PLL megafunction"> PLL megafunction</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20resolution" title=" time resolution"> time resolution</a> </p> <a href="https://publications.waset.org/abstracts/50826/a-high-time-resolution-digital-pulse-width-modulator-based-on-field-programmable-gate-arrays-phase-locked-loop-megafunction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50826.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">480</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">16889</span> An Improved Image Steganography Technique Based on Least Significant Bit Insertion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Olaiya%20Folorunsho">Olaiya Folorunsho</a>, <a href="https://publications.waset.org/abstracts/search?q=Comfort%20Y.%20Daramola"> Comfort Y. Daramola</a>, <a href="https://publications.waset.org/abstracts/search?q=Joel%20N.%20Ugwu"> Joel N. Ugwu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lawrence%20B.%20Adewole"> Lawrence B. Adewole</a>, <a href="https://publications.waset.org/abstracts/search?q=Olufisayo%20S.%20Ekundayo"> Olufisayo S. Ekundayo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In today world, there is a tremendous rise in the usage of internet due to the fact that almost all the communication and information sharing is done over the web. Conversely, there is a continuous growth of unauthorized access to confidential data. This has posed a challenge to information security expertise whose major goal is to curtail the menace. One of the approaches to secure the safety delivery of data/information to the rightful destination without any modification is steganography. Steganography is the art of hiding information inside an embedded information. This research paper aimed at designing a secured algorithm with the use of image steganographic technique that makes use of Least Significant Bit (LSB) algorithm for embedding the data into the bit map image (bmp) in order to enhance security and reliability. In the LSB approach, the basic idea is to replace the LSB of the pixels of the cover image with the Bits of the messages to be hidden without destroying the property of the cover image significantly. The system was implemented using C# programming language of Microsoft.NET framework. The performance evaluation of the proposed system was experimented by conducting a benchmarking test for analyzing the parameters like Mean Squared Error (MSE) and Peak Signal to Noise Ratio (PSNR). The result showed that image steganography performed considerably in securing data hiding and information transmission over the networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20steganography" title=" image steganography"> image steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits" title=" least significant bits"> least significant bits</a>, <a href="https://publications.waset.org/abstracts/search?q=bit%20map%20image" title=" bit map image"> bit map image</a> </p> <a href="https://publications.waset.org/abstracts/57080/an-improved-image-steganography-technique-based-on-least-significant-bit-insertion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57080.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">266</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">16888</span> The Impact of Bilateral Investment Treaties on Health-Related Intellectual Property Rights in the Agreement on Trade-Related Aspects of Intellectual Property Rights in the Kingdom of Saudi Arabia and Australia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulrahman%20Fahim%20M.%20Alsulami">Abdulrahman Fahim M. Alsulami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is dedicated to a detailed investigation of the interaction between the agreement on trade-related aspects of intellectual property rights (TRIPS) and bilateral investment treaties (BITs) in the regulation of health-related intellectual property rights in Australia and the Kingdom of Saudi Arabia. The chosen research object is complex and requires a thorough examination of a set of factors influencing the problem under investigation. At the moment, to the author’s best knowledge’ there is no academic research that would conceptualize and critically compare the regulation of health-related intellectual property rights in these two countries. While there is a substantial amount of information in the literature on certain aspects of the problem, the existing knowledge about certain aspects of the health-related regulatory frameworks in Australia and Saudi Arabia barely explains in detail the specifics of the ways in which the TRIPS agreement interacts with (BITs) in the regulation of health-related intellectual property rights. Therefore, this paper will address an evident research gap by studying an intriguing yet under-researched problem. The paper comprises five subsections. The first subsection provides an overview of the investment climate in Saudi Arabia and Australia with an emphasis on the health care industry. It will cover political, economic, and social factors influencing the investment climate in these countries, the systems of intellectual property rights protection, recent patterns relevant to the investment climate’s development, and key characteristics of the investment climate in the health care industry. The second subsection analyses BITs in Saudi Arabia and Australia in light of the countries’ responsibilities under the TRIPS Agreement. The third subsection provides a critical examination of the interaction between the TRIPS Agreement and BITs in Saudi Arabia on the basis of data collected and analyzed in previous subsections. It will investigate key discrepancies concerning the regulation of health-related intellectual property rights in Saudi Arabia and Australia from the position of BITs’ interaction with the TRIPS Agreement and explore the existing procedures for clarifying priorities between them in regulating health-related intellectual property rights. The fourth subsection of the paper provides recommendations concerning the transformation of BITS into a TRIPS+ dimension in regulating health-related intellectual property rights in Saudi Arabia and Australia. The final subsection provides a summary of differences between the Australian and Saudi BITs from the perspective of the regulation of health-related intellectual property rights under the TRIPS agreement and bilateral investment treaties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Australia" title="Australia">Australia</a>, <a href="https://publications.waset.org/abstracts/search?q=bilateral%20investment%20treaties" title=" bilateral investment treaties"> bilateral investment treaties</a>, <a href="https://publications.waset.org/abstracts/search?q=IP%20law" title=" IP law"> IP law</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20health%20sector" title=" public health sector"> public health sector</a>, <a href="https://publications.waset.org/abstracts/search?q=Saudi%20Arabia" title=" Saudi Arabia"> Saudi Arabia</a> </p> <a href="https://publications.waset.org/abstracts/134783/the-impact-of-bilateral-investment-treaties-on-health-related-intellectual-property-rights-in-the-agreement-on-trade-related-aspects-of-intellectual-property-rights-in-the-kingdom-of-saudi-arabia-and-australia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/134783.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">144</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">16887</span> The Study of the Perspectives on Economic Development in Bilateral Investment Treaties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anuj%20Kumar%20Vaksha">Anuj Kumar Vaksha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the post cold war era the foreign direct investments have come to be considered as one of the most critical factors for economic development of a country particularly for the capital scarce countries like the developing and the under developed countries. The rush for foreign direct investments have led to intense competition between the countries treaties to attract foreign investments by entering into alluring Bilateral Investment Treaties (BITs). The Bilateral Investment Treaties are the intergovernmental legal framework for the promotion of private investments from one country to other. With more than 3000 BITs, the web of such BITs are the most dominant development of International Law in the post cold war era. The essence of all these BITs are bilateral cooperation for economic development and thus it is actually the theme of economic development around which the International Law had developed most dominantly in the post cold war era. Within the framework of two generally accepted premises that foreign direct investments are critical for economic development and the bilateral investment treaties are critical for promotion of foreign direct investments, the research paper seeks to explore the perspectives and paradigms on economic development as embodied in various Bilateral Investment Treaties. It seeks to address how and in what manners the perspectives on economic development as embodied in bilateral investment varies between the developed, developing and underdeveloped countries. It goes without saying that economic development is a very broad, complex and operationally intricate concept. In the paradigm of International Law it becomes much more complex and intricate. Understanding the concept of economic development from the perspectives of Bilateral Investment Treaties is a novel idea with far reaching significance. Such a perspective on economic development would help in enriching the contemporary International Law perspectives and paradigms on economic development. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilateral%20investment%20treaties" title="bilateral investment treaties">bilateral investment treaties</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20development" title=" economic development"> economic development</a>, <a href="https://publications.waset.org/abstracts/search?q=international%20Law" title=" international Law"> international Law</a>, <a href="https://publications.waset.org/abstracts/search?q=perspectives" title=" perspectives"> perspectives</a> </p> <a href="https://publications.waset.org/abstracts/33943/the-study-of-the-perspectives-on-economic-development-in-bilateral-investment-treaties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33943.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">325</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">16886</span> Medicinal Plants and Arbuscular mycorrhizal Colonization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ammani%20K.">Ammani K.</a>, <a href="https://publications.waset.org/abstracts/search?q=Glory%20M."> Glory M.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Demands of traditional herbal medicines are increasing day by day over the world. Considering the growing demand of medicinal plants in curative treatments and the role of VAM fungi in augmentation of the production of active secondary metabolites by the medicinal plants, the present work has been undertaken to survey the mycorrhizal status in 30 different medicinal plants belonging to various families from Krishna district, Andhra Pradesh. The roots were collected carefully and stained by the Phillips & Hayman technique. Basing on the occurrence of vesicles and arbuscules, categorized into four grades; Excellent: mycelia, vesicles or arbuscules present more than 75% of root bits, Good: mycelia, vesicles or arbuscules present 50-75% in surface of root bits, moderate: mycelia, vesicles or arbuscules present 25-50% in surface of root bits, and poor: mycelia, vesicles or arbuscules present 1-25% in surface of root bits. The study reveals that the roots of all plants were colonized by AM fungi. Percentage of root colonization by AM fungi was more in Aloe vera, Phylanthus emblica, Azadiracta indica and least in plants such as Aerva lanata, Vinca rosea, Crotalaria verrucosa among the 30 medicinal plants in present study. The enhancement of growth and vigour and increased production of bioactive compounds of the medicinal plants is desirable which may be achieved by inoculation of the roots with Arbuscular mycorrhizal fungi. There is a steady increase in the cultivation of medicinal plants to maintain a steady supply to support the increasing demand but corresponding researches of VAM fungi and their association in medicinal plants have received very little attention as compared to the studies on forest species and field crops. So a vast research on this field is necessary for a better tomorrow. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arbuscular%20mycorrhizae" title="Arbuscular mycorrhizae">Arbuscular mycorrhizae</a>, <a href="https://publications.waset.org/abstracts/search?q=colonization" title=" colonization"> colonization</a>, <a href="https://publications.waset.org/abstracts/search?q=categories" title=" categories"> categories</a>, <a href="https://publications.waset.org/abstracts/search?q=medicinal%20plants" title=" medicinal plants"> medicinal plants</a> </p> <a href="https://publications.waset.org/abstracts/35465/medicinal-plants-and-arbuscular-mycorrhizal-colonization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35465.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">402</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">16885</span> Adaptive Transmission Scheme Based on Channel State in Dual-Hop System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seung-Jun%20Yu">Seung-Jun Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim"> Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jung-In%20Baik"> Jung-In Baik</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a dual-hop relay based on channel state is studied. In the conventional relay scheme, a relay uses the same modulation method without reference to channel state. But, a relay uses an adaptive modulation method with reference to channel state. If the channel state is poor, a relay eliminates latter 2 bits and uses Quadrature Phase Shift Keying (QPSK) modulation. If channel state is good, a relay modulates the received symbols with 16-QAM symbols by using 4 bits. The performance of the proposed scheme for Symbol Error Rate (SER) and throughput is analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20transmission" title="adaptive transmission">adaptive transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20state" title=" channel state"> channel state</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-hop" title=" dual-hop"> dual-hop</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20modulation" title=" hierarchical modulation"> hierarchical modulation</a>, <a href="https://publications.waset.org/abstracts/search?q=relay" title=" relay"> relay</a> </p> <a href="https://publications.waset.org/abstracts/52599/adaptive-transmission-scheme-based-on-channel-state-in-dual-hop-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52599.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">380</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">16884</span> Establishment of Bit Selective Mode Storage Covert Channel in VANETs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amarpreet%20Singh">Amarpreet Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Kimi%20Manchanda"> Kimi Manchanda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intended for providing the security in the VANETS (Vehicular Ad hoc Network) scenario, the covert storage channel is implemented through data transmitted between the sender and the receiver. Covert channels are the logical links which are used for the communication purpose and hiding the secure data from the intruders. This paper refers to the Establishment of bit selective mode covert storage channels in VANETS. In this scenario, the data is being transmitted with two modes i.e. the normal mode and the covert mode. During the communication between vehicles in this scenario, the controlling of bits is possible through the optional bits of IPV6 Header Format. This implementation is fulfilled with the help of Network simulator. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=covert%20mode" title="covert mode">covert mode</a>, <a href="https://publications.waset.org/abstracts/search?q=normal%20mode" title=" normal mode"> normal mode</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=OBU" title=" OBU"> OBU</a>, <a href="https://publications.waset.org/abstracts/search?q=on-board%20unit" title=" on-board unit"> on-board unit</a> </p> <a href="https://publications.waset.org/abstracts/40241/establishment-of-bit-selective-mode-storage-covert-channel-in-vanets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40241.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">366</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">16883</span> Size-Reduction Strategies for Iris Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jutta%20H%C3%A4mmerle-Uhl">Jutta Hämmerle-Uhl</a>, <a href="https://publications.waset.org/abstracts/search?q=Georg%20Penn"> Georg Penn</a>, <a href="https://publications.waset.org/abstracts/search?q=Gerhard%20P%C3%B6tzelsberger"> Gerhard Pötzelsberger</a>, <a href="https://publications.waset.org/abstracts/search?q=Andreas%20Uhl"> Andreas Uhl</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Iris codes contain bits with different entropy. This work investigates different strategies to reduce the size of iris code templates with the aim of reducing storage requirements and computational demand in the matching process. Besides simple sub-sampling schemes, also a binary multi-resolution representation as used in the JBIG hierarchical coding mode is assessed. We find that iris code template size can be reduced significantly while maintaining recognition accuracy. Besides, we propose a two stage identification approach, using small-sized iris code templates in a pre-selection satge, and full resolution templates for final identification, which shows promising recognition behaviour. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=iris%20recognition" title="iris recognition">iris recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=compact%20iris%20code" title=" compact iris code"> compact iris code</a>, <a href="https://publications.waset.org/abstracts/search?q=fast%20matching" title=" fast matching"> fast matching</a>, <a href="https://publications.waset.org/abstracts/search?q=best%20bits" title=" best bits"> best bits</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-selection%20identification" title=" pre-selection identification"> pre-selection identification</a>, <a href="https://publications.waset.org/abstracts/search?q=two-stage%20identification" title=" two-stage identification"> two-stage identification</a> </p> <a href="https://publications.waset.org/abstracts/20877/size-reduction-strategies-for-iris-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20877.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">440</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">16882</span> An Automated Approach to the Nozzle Configuration of Polycrystalline Diamond Compact Drill Bits for Effective Cuttings Removal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Suresh">R. Suresh</a>, <a href="https://publications.waset.org/abstracts/search?q=Pavan%20Kumar%20Nimmagadda"> Pavan Kumar Nimmagadda</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming%20Zo%20Tan"> Ming Zo Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shane%20Hart"> Shane Hart</a>, <a href="https://publications.waset.org/abstracts/search?q=Sharp%20Ugwuocha"> Sharp Ugwuocha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Polycrystalline diamond compact (PDC) drill bits are extensively used in the oil and gas industry as well as the mining industry. Industry engineers continually improve upon PDC drill bit designs and hydraulic conditions. Optimized injection nozzles play a key role in improving the drilling performance and efficiency of these ever changing PDC drill bits. In the first part of this study, computational fluid dynamics (CFD) modelling is performed to investigate the hydrodynamic characteristics of drilling fluid flow around the PDC drill bit. An Open-source CFD software – OpenFOAM simulates the flow around the drill bit, based on the field input data. A specifically developed console application integrates the entire CFD process including, domain extraction, meshing, and solving governing equations and post-processing. The results from the OpenFOAM solver are then compared with that of the ANSYS Fluent software. The data from both software programs agree. The second part of the paper describes the parametric study of the PDC drill bit nozzle to determine the effect of parameters such as number of nozzles, nozzle velocity, nozzle radial position and orientations on the flow field characteristics and bit washing patterns. After analyzing a series of nozzle configurations, the best configuration is identified and recommendations are made for modifying the PDC bit design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ANSYS%20Fluent" title="ANSYS Fluent">ANSYS Fluent</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20fluid%20dynamics" title=" computational fluid dynamics"> computational fluid dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=nozzle%20configuration" title=" nozzle configuration"> nozzle configuration</a>, <a href="https://publications.waset.org/abstracts/search?q=OpenFOAM" title=" OpenFOAM"> OpenFOAM</a>, <a href="https://publications.waset.org/abstracts/search?q=PDC%20dill%20bit" title=" PDC dill bit"> PDC dill bit</a> </p> <a href="https://publications.waset.org/abstracts/87978/an-automated-approach-to-the-nozzle-configuration-of-polycrystalline-diamond-compact-drill-bits-for-effective-cuttings-removal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87978.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">420</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">16881</span> Using the Cluster Computing to Improve the Computational Speed of the Modular Exponentiation in RSA Cryptography System</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=Ping-Sheng%20Huang"> Ping-Sheng Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shan-Ten%20Cheng"> Shan-Ten Cheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Chih-Lin%20Lin"> Chih-Lin Lin</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=Tsung-%20Hsien%20Lin"> Tsung- Hsien Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> RSA system is a great contribution for the encryption and the decryption. It is based on the modular exponentiation. We call this system as “a large of numbers for calculation”. The operation of a large of numbers is a very heavy burden for CPU. For increasing the computational speed, in addition to improve these algorithms, such as the binary method, the sliding window method, the addition chain method, and so on, the cluster computer can be used to advance computational speed. The cluster system is composed of the computers which are installed the MPICH2 in laboratory. The parallel procedures of the modular exponentiation can be processed by combining the sliding window method with the addition chain method. It will significantly reduce the computational time of the modular exponentiation whose digits are more than 512 bits and even more than 1024 bits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cluster%20system" title="cluster system">cluster system</a>, <a href="https://publications.waset.org/abstracts/search?q=modular%20exponentiation" title=" modular exponentiation"> modular exponentiation</a>, <a href="https://publications.waset.org/abstracts/search?q=sliding%20window" title=" sliding window"> sliding window</a>, <a href="https://publications.waset.org/abstracts/search?q=addition%20chain" title=" addition chain"> addition chain</a> </p> <a href="https://publications.waset.org/abstracts/9093/using-the-cluster-computing-to-improve-the-computational-speed-of-the-modular-exponentiation-in-rsa-cryptography-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9093.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">522</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">16880</span> New Efficient Method for Coding Color Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walaa%20M.Abd-Elhafiez">Walaa M.Abd-Elhafiez</a>, <a href="https://publications.waset.org/abstracts/search?q=Wajeb%20Gharibi"> Wajeb Gharibi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a novel color image compression technique for efficient storage and delivery of data is proposed. The proposed compression technique started by RGB to YCbCr color transformation process. Secondly, the canny edge detection method is used to classify the blocks into edge and non-edge blocks. Each color component Y, Cb, and Cr compressed by discrete cosine transform (DCT) process, quantizing and coding step by step using adaptive arithmetic coding. Our technique is concerned with the compression ratio, bits per pixel and peak signal to noise ratio, and produce better results than JPEG and more recent published schemes (like, CBDCT-CABS and MHC). The provided experimental results illustrate the proposed technique which is efficient and feasible in terms of compression ratio, bits per pixel and peak signal to noise ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title="image compression">image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=color%20image" title=" color image"> color image</a>, <a href="https://publications.waset.org/abstracts/search?q=q-coder" title=" q-coder"> q-coder</a>, <a href="https://publications.waset.org/abstracts/search?q=quantization" title=" quantization"> quantization</a>, <a href="https://publications.waset.org/abstracts/search?q=edge-detection" title=" edge-detection"> edge-detection</a> </p> <a href="https://publications.waset.org/abstracts/2342/new-efficient-method-for-coding-color-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2342.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">330</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">16879</span> A Case Study of the Saudi Arabian Investment Regime</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Atif%20Alenezi">Atif Alenezi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The low global oil price poses economic challenges for Saudi Arabia, as oil revenues still make up a great percentage of its Gross Domestic Product (GDP). At the end of 2014, the Consultative Assembly considered a report from the Committee on Economic Affairs and Energy which highlights that the economy had not been successfully diversified. There thus exist ample reasons for modernising the Foreign Direct Investment (FDI) regime, primarily to achieve and maintain prosperity and facilitate peace in the region. Therefore, this paper aims at identifying specific problems with the existing FDI regime in Saudi Arabia and subsequently some solutions to those problems. Saudi Arabia adopted its first specific legislation in 1956, which imposed significant restrictions on foreign ownership. Since then, Saudi Arabia has modernised its FDI framework with the passing of the Foreign Capital Investment Act 1979 and the Foreign Investment Law2000 and the accompanying Executive Rules 2000 and the recently adopted Implementing Regulations 2014.Nonetheless, the legislative provisions contain various gaps and the failure to address these gaps creates risks and uncertainty for investors. For instance, the important topic of mergers and acquisitions has not been addressed in the Foreign Investment Law 2000. The circumstances in which expropriation can be considered to be in the public interest have not been defined. Moreover, Saudi Arabia has not entered into many bilateral investment treaties (BITs). This has an effect on the investment climate, as foreign investors are not afforded typical rights. An analysis of the BITs which have been entered into reveals that the national treatment standard and stabilisation, umbrella or renegotiation provisions have not been included. This is problematic since the 2000 Act does not spell out the applicable standard in accordance with which foreign investors should be treated. Moreover, the most-favoured-nation (MFN) or fair and equitable treatment (FET) standards have not been put on a statutory footing. Whilst the Arbitration Act 2012 permits that investment disputes can be internationalised, restrictions have been retained. The effectiveness of international arbitration is further undermined because Saudi Arabia does not enforce non-domestic arbitral awards which contravene public policy. Furthermore, the reservation to the Convention on the Settlement of Investment Disputes allows Saudi Arabia to exclude petroleum and sovereign disputes. Interviews with foreign investors, who operate in Saudi Arabia highlight additional issues. Saudi Arabia ought not to procrastinate far-reaching structural reforms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FDI" title="FDI">FDI</a>, <a href="https://publications.waset.org/abstracts/search?q=Saudi" title=" Saudi"> Saudi</a>, <a href="https://publications.waset.org/abstracts/search?q=BITs" title=" BITs"> BITs</a>, <a href="https://publications.waset.org/abstracts/search?q=law" title=" law"> law</a> </p> <a href="https://publications.waset.org/abstracts/47244/a-case-study-of-the-saudi-arabian-investment-regime" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47244.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">409</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">16878</span> Mite Soil as Biological Indicators the Quality of the Soil in the Forested Area of the Coast of Algeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soumeya%20Fekkoun">Soumeya Fekkoun</a>, <a href="https://publications.waset.org/abstracts/search?q=Djelloul%20%20Ghezali"> Djelloul Ghezali</a>, <a href="https://publications.waset.org/abstracts/search?q=Doumandji%20Salaheddine"> Doumandji Salaheddine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The majority of the mite soil contributes to decompose the organic matter in the soil, the richness or poverty is a way of knowing the quality of the soil, in this regard we studied the ecological side of the soil mite in a forest park «coast of Algeria». 6 by taking soil samples every month for the year 2010/2011 .The samples are collected and extracted using the technique of Berlese Tullgren. It was obtained 604 individuals. These riches can indicate the fertility of soil and knead the high proportion of organic material in it. The largest number observed in the spring, followed by the separation of the 252 individuals fall 222 individuals and then the summer with 106 individuals and winter 80 individuals. Among the 18 families obtained. Scheloribatidae is the most dominant with 30.6% followed by Ceratozetidae with 16%, then Euphthiracaridae 14%. The families remain involved with low percentages. the diversity index Schanonweaver varied between 2.3 bits in the summer and 3.83 bits in the spring. As the results of the analysis statistic confirm the existence of a clear difference between the four seasons and the richness of soil mite and diversity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=soil%20mite" title="soil mite">soil mite</a>, <a href="https://publications.waset.org/abstracts/search?q=forest" title=" forest"> forest</a>, <a href="https://publications.waset.org/abstracts/search?q=coast%20of%20Algeria" title=" coast of Algeria"> coast of Algeria</a>, <a href="https://publications.waset.org/abstracts/search?q=diversity" title=" diversity"> diversity</a> </p> <a href="https://publications.waset.org/abstracts/23947/mite-soil-as-biological-indicators-the-quality-of-the-soil-in-the-forested-area-of-the-coast-of-algeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23947.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">407</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">16877</span> Reversible Information Hitting in Encrypted JPEG Bitstream by LSB Based on Inherent Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vaibhav%20Barve">Vaibhav Barve</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reversible information hiding has drawn a lot of interest as of late. Being reversible, we can restore unique computerized data totally. It is a plan where mystery data is put away in digital media like image, video, audio to maintain a strategic distance from unapproved access and security reason. By and large JPEG bit stream is utilized to store this key data, first JPEG bit stream is encrypted into all around sorted out structure and then this secret information or key data is implanted into this encrypted region by marginally changing the JPEG bit stream. Valuable pixels suitable for information implanting are computed and as indicated by this key subtle elements are implanted. In our proposed framework we are utilizing RC4 algorithm for encrypting JPEG bit stream. Encryption key is acknowledged by framework user which, likewise, will be used at the time of decryption. We are executing enhanced least significant bit supplanting steganography by utilizing genetic algorithm. At first, the quantity of bits that must be installed in a guaranteed coefficient is versatile. By utilizing proper parameters, we can get high capacity while ensuring high security. We are utilizing logistic map for shuffling of bits and utilization GA (Genetic Algorithm) to find right parameters for the logistic map. Information embedding key is utilized at the time of information embedding. By utilizing precise picture encryption and information embedding key, the beneficiary can, without much of a stretch, concentrate the incorporated secure data and totally recoup the first picture and also the original secret information. At the point when the embedding key is truant, the first picture can be recouped pretty nearly with sufficient quality without getting the embedding key of interest. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20embedding" title="data embedding">data embedding</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20data%20hiding" title=" reversible data hiding"> reversible data hiding</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a> </p> <a href="https://publications.waset.org/abstracts/32863/reversible-information-hitting-in-encrypted-jpeg-bitstream-by-lsb-based-on-inherent-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32863.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">288</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">16876</span> Larger Diameter 22 MM-PDC Cutter Greatly Improves Drilling Efficiency of PDC Bit</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fangyuan%20Shao">Fangyuan Shao</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei%20Liu"> Wei Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Deli%20Gao"> Deli Gao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the increasing speed of oil and gas exploration, development and production at home and abroad, the demand for drilling speed up technology is becoming more and more critical to reduce the development cost. Highly efficient and personalized PDC bit is important equipment in the bottom hole assembly (BHA). Therefore, improving the rock-breaking efficiency of PDC bits will help reduce drilling time and drilling cost. Advances in PDC bit technology have resulted in a leapfrogging improvement in the rate of penetration (ROP) of PDC bits over roller cone bits in soft to medium-hard formations. Recently, with the development of PDC technology, the diameter of the PDC tooth can be further expanded. The maximum diameter of the PDC cutter used in this paper is 22 mm. According to the theoretical calculation, under the same depth of cut (DOC), the 22mm-PDC cutter increases the exposure of the cutter, and the increase of PDC cutter diameter helps to increase the cutting area of the PDC cutter. In order to evaluate the cutting performance of the 22 mm-PDC cutter and the existing commonly used cutters, the 16 mm, 19 mm and 22 mm PDC cutter was selected put on a vertical turret lathe (VTL) in the laboratory for cutting tests under different DOCs. The DOCs were 0.5mm, 1.0 mm, 1.5 mm and 2.0 mm, 2.5 mm and 3 mm, respectively. The rock sample used in the experiment was limestone. Results of laboratory tests have shown the new 22 mm-PDC cutter technology greatly improved cutting efficiency. On the one hand, as the DOC increases, the mechanical specific energy (MSE) of all cutters decreases, which means that the cutting efficiency increases. On the other hand, under the same DOC condition, the larger the cutter diameter is, the larger the working area of the cutter is, which leads to higher the cutting efficiency. In view of the high performance of the 22 mm-PDC cutters, which was applied to carry out full-scale bit field experiments. The result shows that the bit with 22mm-PDC cutters achieves a breakthrough improvement of ROP than that with conventional 16mm and 19mm cutters in offset well drilling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=polycrystalline%20diamond%20compact" title="polycrystalline diamond compact">polycrystalline diamond compact</a>, <a href="https://publications.waset.org/abstracts/search?q=22%20mm-PDC%20cutters" title=" 22 mm-PDC cutters"> 22 mm-PDC cutters</a>, <a href="https://publications.waset.org/abstracts/search?q=cutting%20efficiency" title=" cutting efficiency"> cutting efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=mechanical%20specific%20energy" title=" mechanical specific energy"> mechanical specific energy</a> </p> <a href="https://publications.waset.org/abstracts/140607/larger-diameter-22-mm-pdc-cutter-greatly-improves-drilling-efficiency-of-pdc-bit" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140607.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">204</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">16875</span> Investigations of Bergy Bits and Ship Interactions in Extreme Waves Using Smoothed Particle Hydrodynamics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Islam">Mohammed Islam</a>, <a href="https://publications.waset.org/abstracts/search?q=Jungyong%20Wang"> Jungyong Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Dong%20Cheol%20Seo"> Dong Cheol Seo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Smoothed Particle Hydrodynamics (SPH) method is a novel, meshless, and Lagrangian technique based numerical method that has shown promises to accurately predict the hydrodynamics of water and structure interactions in violent flow conditions. The main goal of this study is to build confidence on the versatility of the Smoothed Particle Hydrodynamics (SPH) based tool, to use it as a complementary tool to the physical model testing capabilities and support research need for the performance evaluation of ships and offshore platforms exposed to an extreme and harsh environment. In the current endeavor, an open-sourced SPH-based tool was used and validated for modeling and predictions of the hydrodynamic interactions of a 6-DOF ship and bergy bits. The study involved the modeling of a modern generic drillship and simplified bergy bits in floating and towing scenarios and in regular and irregular wave conditions. The predictions were validated using the model-scale measurements on a moored ship towed at multiple oblique angles approaching a floating bergy bit in waves. Overall, this study results in a thorough comparison between the model scale measurements and the prediction outcomes from the SPH tool for performance and accuracy. The SPH predicted ship motions and forces were primarily within ±5% of the measurements. The velocity and pressure distribution and wave characteristics over the free surface depicts realistic interactions of the wave, ship, and the bergy bit. This work identifies and presents several challenges in preparing the input file, particularly while defining the mass properties of complex geometry, the computational requirements, and the post-processing of the outcomes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SPH" title="SPH">SPH</a>, <a href="https://publications.waset.org/abstracts/search?q=ship%20and%20bergy%20bit" title=" ship and bergy bit"> ship and bergy bit</a>, <a href="https://publications.waset.org/abstracts/search?q=hydrodynamic%20interactions" title=" hydrodynamic interactions"> hydrodynamic interactions</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20validation" title=" model validation"> model validation</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20model%20testing" title=" physical model testing"> physical model testing</a> </p> <a href="https://publications.waset.org/abstracts/125345/investigations-of-bergy-bits-and-ship-interactions-in-extreme-waves-using-smoothed-particle-hydrodynamics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125345.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">133</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">16874</span> Seismic Data Scaling: Uncertainties, Potential and Applications in Workstation Interpretation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ankur%20Mundhra">Ankur Mundhra</a>, <a href="https://publications.waset.org/abstracts/search?q=Shubhadeep%20Chakraborty"> Shubhadeep Chakraborty</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20R.%20Singh"> Y. R. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishal%20Das"> Vishal Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Seismic data scaling affects the dynamic range of a data and with present day lower costs of storage and higher reliability of Hard Disk data, scaling is not suggested. However, in dealing with data of different vintages, which perhaps were processed in 16 bits or even 8 bits and are need to be processed with 32 bit available data, scaling is performed. Also, scaling amplifies low amplitude events in deeper region which disappear due to high amplitude shallow events that saturate amplitude scale. We have focused on significance of scaling data to aid interpretation. This study elucidates a proper seismic loading procedure in workstations without using default preset parameters as available in most software suites. Differences and distribution of amplitude values at different depth for seismic data are probed in this exercise. Proper loading parameters are identified and associated steps are explained that needs to be taken care of while loading data. Finally, the exercise interprets the un-certainties which might arise when correlating scaled and unscaled versions of seismic data with synthetics. As, seismic well tie correlates the seismic reflection events with well markers, for our study it is used to identify regions which are enhanced and/or affected by scaling parameter(s). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clipping" title="clipping">clipping</a>, <a href="https://publications.waset.org/abstracts/search?q=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/abstracts/search?q=resolution" title=" resolution"> resolution</a>, <a href="https://publications.waset.org/abstracts/search?q=seismic%20scaling" title=" seismic scaling"> seismic scaling</a> </p> <a href="https://publications.waset.org/abstracts/24110/seismic-data-scaling-uncertainties-potential-and-applications-in-workstation-interpretation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24110.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">469</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">16873</span> Application of the Bionic Wavelet Transform and Psycho-Acoustic Model for Speech Compression </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chafik%20Barnoussi">Chafik Barnoussi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mourad%20Talbi"> Mourad Talbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Adnane%20Cherif"> Adnane Cherif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we propose a new speech compression system based on the application of the Bionic Wavelet Transform (BWT) combined with the psychoacoustic model. This compression system is a modified version of the compression system using a MDCT (Modified Discrete Cosine Transform) filter banks of 32 filters each and the psychoacoustic model. This modification consists in replacing the banks of the MDCT filter banks by the bionic wavelet coefficients which are obtained from the application of the BWT to the speech signal to be compressed. These two methods are evaluated and compared with each other by computing bits before and bits after compression. They are tested on different speech signals and the obtained simulation results show that the proposed technique outperforms the second technique and this in term of compressed file size. In term of SNR, PSNR and NRMSE, the outputs speech signals of the proposed compression system are with acceptable quality. In term of PESQ and speech signal intelligibility, the proposed speech compression technique permits to obtain reconstructed speech signals with good quality. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=speech%20compression" title="speech compression">speech compression</a>, <a href="https://publications.waset.org/abstracts/search?q=bionic%20wavelet%20transform" title=" bionic wavelet transform"> bionic wavelet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=filterbanks" title=" filterbanks"> filterbanks</a>, <a href="https://publications.waset.org/abstracts/search?q=psychoacoustic%20model" title=" psychoacoustic model"> psychoacoustic model</a> </p> <a href="https://publications.waset.org/abstracts/1921/application-of-the-bionic-wavelet-transform-and-psycho-acoustic-model-for-speech-compression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1921.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">384</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">16872</span> Proposal of Optimality Evaluation for Quantum Secure Communication Protocols by Taking the Average of the Main Protocol Parameters: Efficiency, Security and Practicality</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Georgi%20Bebrov">Georgi Bebrov</a>, <a href="https://publications.waset.org/abstracts/search?q=Rozalina%20Dimova"> Rozalina Dimova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the field of quantum secure communication, there is no evaluation that characterizes quantum secure communication (QSC) protocols in a complete, general manner. The current paper addresses the problem concerning the lack of such an evaluation for QSC protocols by introducing an optimality evaluation, which is expressed as the average over the three main parameters of QSC protocols: efficiency, security, and practicality. For the efficiency evaluation, the common expression of this parameter is used, which incorporates all the classical and quantum resources (bits and qubits) utilized for transferring a certain amount of information (bits) in a secure manner. By using criteria approach whether or not certain criteria are met, an expression for the practicality evaluation is presented, which accounts for the complexity of the QSC practical realization. Based on the error rates that the common quantum attacks (Measurement and resend, Intercept and resend, probe attack, and entanglement swapping attack) induce, the security evaluation for a QSC protocol is proposed as the minimum function taken over the error rates of the mentioned quantum attacks. For the sake of clarity, an example is presented in order to show how the optimality is calculated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20cryptography" title="quantum cryptography">quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20communcation" title=" quantum secure communcation"> quantum secure communcation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20direct%20communcation%20security" title=" quantum secure direct communcation security"> quantum secure direct communcation security</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20direct%20communcation%20efficiency" title=" quantum secure direct communcation efficiency"> quantum secure direct communcation efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20secure%20direct%20communcation%20practicality" title=" quantum secure direct communcation practicality"> quantum secure direct communcation practicality</a> </p> <a href="https://publications.waset.org/abstracts/104501/proposal-of-optimality-evaluation-for-quantum-secure-communication-protocols-by-taking-the-average-of-the-main-protocol-parameters-efficiency-security-and-practicality" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104501.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">184</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">16871</span> Secured Transmission and Reserving Space in Images Before Encryption to Embed Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20R.%20Navaneesh">G. R. Navaneesh</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Nagarajan"> E. Nagarajan</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20H.%20Rajam%20Raju"> C. H. Rajam Raju</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays the multimedia data are used to store some secure information. All previous methods allocate a space in image for data embedding purpose after encryption. In this paper, we propose a novel method by reserving space in image with a boundary surrounded before encryption with a traditional RDH algorithm, which makes it easy for the data hider to reversibly embed data in the encrypted images. The proposed method can achieve real time performance, that is, data extraction and image recovery are free of any error. A secure transmission process is also discussed in this paper, which improves the efficiency by ten times compared to other processes as discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secure%20communication" title="secure communication">secure communication</a>, <a href="https://publications.waset.org/abstracts/search?q=reserving%20room%20before%20encryption" title=" reserving room before encryption"> reserving room before encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits" title=" least significant bits"> least significant bits</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20data%20hiding" title=" reversible data hiding"> reversible data hiding</a> </p> <a href="https://publications.waset.org/abstracts/7321/secured-transmission-and-reserving-space-in-images-before-encryption-to-embed-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7321.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">412</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">16870</span> Isolated Iterating Fractal Independently Corresponds with Light and Foundational Quantum Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Blair%20D.%20Macdonald">Blair D. Macdonald</a> </p> <p class="card-text"><strong>Abstract:</strong></p> After nearly one hundred years of its origin, foundational quantum mechanics remains one of the greatest unexplained mysteries in physicists today. Within this time, chaos theory and its geometry, the fractal, has developed. In this paper, the propagation behaviour with an iteration of a simple fractal, the Koch Snowflake, was described and analysed. From an arbitrary observation point within the fractal set, the fractal propagates forward by oscillation—the focus of this study and retrospectively behind by exponential growth from a point beginning. It propagates a potentially infinite exponential oscillating sinusoidal wave of discrete triangle bits sharing many characteristics of light and quantum entities. The model's wave speed is potentially constant, offering insights into the perception and a direction of time where, to an observer, when travelling at the frontier of propagation, time may slow to a stop. In isolation, the fractal is a superposition of component bits where position and scale present a problem of location. In reality, this problem is experienced within fractal landscapes or fields where 'position' is only 'known' by the addition of information or markers. The quantum' measurement problem', 'uncertainty principle,' 'entanglement,' and the classical-quantum interface are addressed; these are a problem of scale invariance associated with isolated fractality. Dual forward and retrospective perspectives of the fractal model offer the opportunity for unification between quantum mechanics and cosmological mathematics, observations, and conjectures. Quantum and cosmological problems may be different aspects of the one fractal geometry. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=measurement%20problem" title="measurement problem">measurement problem</a>, <a href="https://publications.waset.org/abstracts/search?q=observer" title=" observer"> observer</a>, <a href="https://publications.waset.org/abstracts/search?q=entanglement" title=" entanglement"> entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=unification" title=" unification"> unification</a> </p> <a href="https://publications.waset.org/abstracts/151867/isolated-iterating-fractal-independently-corresponds-with-light-and-foundational-quantum-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151867.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">90</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">16869</span> Error Detection and Correction for Onboard Satellite Computers Using Hamming Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafsan%20Al%20Mamun">Rafsan Al Mamun</a>, <a href="https://publications.waset.org/abstracts/search?q=Md.%20Motaharul%20Islam"> Md. Motaharul Islam</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabana%20Tajrin"> Rabana Tajrin</a>, <a href="https://publications.waset.org/abstracts/search?q=Nabiha%20Noor"> Nabiha Noor</a>, <a href="https://publications.waset.org/abstracts/search?q=Shafinaz%20Qader"> Shafinaz Qader</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In an attempt to enrich the lives of billions of people by providing proper information, security and a way of communicating with others, the need for efficient and improved satellites is constantly growing. Thus, there is an increasing demand for better error detection and correction (EDAC) schemes, which are capable of protecting the data onboard the satellites. The paper is aimed towards detecting and correcting such errors using a special algorithm called the Hamming Code, which uses the concept of parity and parity bits to prevent single-bit errors onboard a satellite in Low Earth Orbit. This paper focuses on the study of Low Earth Orbit satellites and the process of generating the Hamming Code matrix to be used for EDAC using computer programs. The most effective version of Hamming Code generated was the Hamming (16, 11, 4) version using MATLAB, and the paper compares this particular scheme with other EDAC mechanisms, including other versions of Hamming Codes and Cyclic Redundancy Check (CRC), and the limitations of this scheme. This particular version of the Hamming Code guarantees single-bit error corrections as well as double-bit error detections. Furthermore, this version of Hamming Code has proved to be fast with a checking time of 5.669 nanoseconds, that has a relatively higher code rate and lower bit overhead compared to the other versions and can detect a greater percentage of errors per length of code than other EDAC schemes with similar capabilities. In conclusion, with the proper implementation of the system, it is quite possible to ensure a relatively uncorrupted satellite storage system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bit-flips" title="bit-flips">bit-flips</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamming%20code" title=" Hamming code"> Hamming code</a>, <a href="https://publications.waset.org/abstracts/search?q=low%20earth%20orbit" title=" low earth orbit"> low earth orbit</a>, <a href="https://publications.waset.org/abstracts/search?q=parity%20bits" title=" parity bits"> parity bits</a>, <a href="https://publications.waset.org/abstracts/search?q=satellite" title=" satellite"> satellite</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20error%20upset" title=" single error upset"> single error upset</a> </p> <a href="https://publications.waset.org/abstracts/122077/error-detection-and-correction-for-onboard-satellite-computers-using-hamming-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122077.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">130</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">16868</span> Initial Resistance Training Status Influences Upper Body Strength and Power Development</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stacey%20Herzog">Stacey Herzog</a>, <a href="https://publications.waset.org/abstracts/search?q=Mitchell%20McCleary"> Mitchell McCleary</a>, <a href="https://publications.waset.org/abstracts/search?q=Istvan%20Kovacs"> Istvan Kovacs</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Purpose: Maximal strength and maximal power are key athletic abilities in many sports disciplines. In recent years, velocity-based training (VBT) with a relatively high 75-85% 1RM resistance has been popularized in preparation for powerlifting and various other sports. The purpose of this study was to discover differences between beginner/intermediate and advanced lifters’ push/press performances after a heavy resistance-based BP training program. Methods: A six-week, three-workouts per week program was administered to 52 young, physically active adults (age: 22.4±5.1; 12 female). The majority of the participants (84.6%) had prior experience in bench pressing. Typical workouts began with BP using 75-95% 1RM in the 1-5 repetition range. The sets in the lower part of the range (75-80% 1RM) were performed with velocity-focus as well. The BP sets were followed by seated dumbbell presses and six additional upper-body assistance exercises. Pre- and post-tests were conducted on five test exercises: one-repetition maximum BP (1RM), calculated relative strength index: BP/BW (RSI), four-repetition maximal-effort dynamic BP for peak concentric velocity with 80% 1RM (4RV), 4-repetition ballistic pushups (BPU) for height (4PU), and seated medicine ball toss for distance (MBT). For analytic purposes, the participant group was divided into two subgroups: self-indicated beginner or intermediate initial resistance training status (BITS) [n=21, age: 21.9±3.6; 10 female] and advanced initial resistance training status (ATS) [n=31, age: 22.7±5.9; 2 female]. Pre- and post-test results were compared within subgroups. Results: Paired-sample t-tests indicated significant within-group improvements in all five test exercises in both groups (p < 0.05). BITS improved 18.1 lbs. (13.0%) in 1RM, 0.099 (12.8%) in RSI, 0.133 m/s (23.3%) in 4RV, 1.55 in. (27.1%) in BPU, and 1.00 ft. (5.8%) in MBT, while the ATS group improved 13.2 lbs. (5.7%) in 1RM, 0.071 (5.8%) in RSI, 0.051 m/s (9.1%) in 4RV, 1.20 in. (13.7%) in BPU, and 1.15 ft. (5.5%) in MBT. Conclusion: While the two training groups had different initial resistance training backgrounds, both showed significant improvements in all test exercises. As expected, the beginner/intermediate group displayed better relative improvements in four of the five test exercises. However, the medicine ball toss, which had the lightest resistance among the tests, showed similar relative improvements between the two groups. These findings relate to two important training principles: specificity and transfer. The ATS group had more specific experiences with heavy-resistance BP. Therefore, fewer improvements were detected in their test performances with heavy resistances. On the other hand, while the heavy resistance-based training transferred to increased power outcomes in light-resistance power exercises, the difference in the rate of improvement between the two groups disappeared. Practical applications: Based on initial training status, S&C coaches should expect different performance gains in maximal strength training-specific test exercises. However, the transfer from maximal strength to a non-training-specific performance category along the F-v curve continuum (i.e., light resistance and high velocity) might not depend on initial training status. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=exercise" title="exercise">exercise</a>, <a href="https://publications.waset.org/abstracts/search?q=power" title=" power"> power</a>, <a href="https://publications.waset.org/abstracts/search?q=resistance%20training" title=" resistance training"> resistance training</a>, <a href="https://publications.waset.org/abstracts/search?q=strength" title=" strength"> strength</a> </p> <a href="https://publications.waset.org/abstracts/183374/initial-resistance-training-status-influences-upper-body-strength-and-power-development" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183374.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">70</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">16867</span> Efficient Chess Board Representation: A Space-Efficient Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raghava%20Dhanya">Raghava Dhanya</a>, <a href="https://publications.waset.org/abstracts/search?q=Shashank%20S."> Shashank S.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper delves into the intersection of chess and computer science, specifically focusing on the efficient representation of chess game states. We propose two methods: the Static Method and the Dynamic Method, each offering unique advantages in terms of space efficiency and computational complexity. The Static Method aims to represent the game state using a fixedlength encoding, allocating 192 bits to capture the positions of all pieces on the board. This method introduces a protocol for ordering and encoding piece positions, ensuring efficient storage and retrieval. However, it faces challenges in representing pieces no longer in play. In contrast, the Dynamic Method adapts to the evolving game state by dynamically adjusting the encoding length based on the number of pieces in play. By incorporating Alive Bits for each piece kind, this method achieves greater flexibility and space efficiency. Additionally, it includes provisions for encoding additional game state information such as castling rights and en passant squares. Our findings demonstrate that the Dynamic Method offers superior space efficiency compared to traditional Forsyth-Edwards Notation (FEN), particularly as the game progresses and pieces are captured. However, it comes with increased complexity in encoding and decoding processes. In conclusion, this study provides insights into optimizing the representation of chess game states, offering potential applications in chess engines, game databases, and artificial intelligence research. The proposed methods offer a balance between space efficiency and computational overhead, paving the way for further advancements in the field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chess" title="chess">chess</a>, <a href="https://publications.waset.org/abstracts/search?q=optimisation" title=" optimisation"> optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=encoding" title=" encoding"> encoding</a>, <a href="https://publications.waset.org/abstracts/search?q=bit%20manipulation" title=" bit manipulation"> bit manipulation</a> </p> <a href="https://publications.waset.org/abstracts/183301/efficient-chess-board-representation-a-space-efficient-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183301.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">50</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">16866</span> An Embedded High Speed Adder for Arithmetic Computations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kala%20Bharathan">Kala Bharathan</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Seshasayanan"> R. Seshasayanan </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a 1-bit Embedded Logic Full Adder (EFA) circuit in transistor level is proposed, which reduces logic complexity, gives low power and high speed. The design is further extended till 64 bits. To evaluate the performance of EFA, a 16, 32, 64-bit both Linear and Square root Carry Select Adder/Subtractor (CSLAS) Structure is also proposed. Realistic testing of proposed circuits is done on 8 X 8 Modified Booth multiplier and comparison in terms of power and delay is done. The EFA is implemented for different multiplier architectures for performance parameter comparison. Overall delay for CSLAS is reduced to 78% when compared to conventional one. The circuit implementations are done on TSMC 28nm CMOS technology using Cadence Virtuoso tool. The EFA has power savings of up to 14% when compared to the conventional adder. The present implementation was found to offer significant improvement in terms of power and speed in comparison to other full adder circuits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=embedded%20logic" title="embedded logic">embedded logic</a>, <a href="https://publications.waset.org/abstracts/search?q=full%20adder" title=" full adder"> full adder</a>, <a href="https://publications.waset.org/abstracts/search?q=pdp" title=" pdp"> pdp</a>, <a href="https://publications.waset.org/abstracts/search?q=xor%20gate" title=" xor gate"> xor gate</a> </p> <a href="https://publications.waset.org/abstracts/30086/an-embedded-high-speed-adder-for-arithmetic-computations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30086.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">448</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">16865</span> Ni-Based Hardfacing Alloy Reinforced with Fused Eutectic Tungsten Carbide Deposited on Infiltrated WC-W-Ni Substrate by Oxyacetylene Welding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20Miroud">D. Miroud</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Mokaddem"> H. Mokaddem</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Tata"> M. Tata</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Foucha"> N. Foucha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The body of PDC (polycrystalline diamond compact) drill bit can be manufactured from two different materials, steel and tungsten carbide matrix. Commonly the steel body is produced by machining, thermal spraying a bonding layer and hardfacing of Ni-based matrix reinforced with fused eutectic tungsten carbide (WC/W2C). The matrix body bit is manufactured by infiltrating tungsten carbide particles, with a Copper binary or ternary alloy. By erosion-corrosion mechanisms, the PDC drill bits matrix undergoes severe damage, occurring particularly around the PDC inserts and near injection nozzles. In this study, we investigated the possibility to repair the damaged matrix regions by hardfacing technic. Ni-based hardfacing alloy reinforced with fused eutectic tungsten carbide is deposited on infiltrated WC-W-Ni substrate by oxyacetylene welding (OAW). The microstructure at the hardfacing / matrix interface is characterized by SEM- EDS, XRD and micro hardness Hv0.1. The hardfacing conditions greatly affect the dilution phenomenon and the distribution of carbides at the interface, without formation of transition zone. During OAW welding deposition, interdiffusion of atoms occurs: Cu and Sn diffuse from infiltrated matrix substrate into hardfacing and simultaneously Cr and Si alloy elements from hardfacing diffuse towards the substrate. The dilution zone consists of a nickel-rich phase with a heterogeneous distribution of eutectic spherical (Ni-based hardfacing alloy) and irregular (matrix) WC/W2C carbides and a secondary phase rich in Cr-W-Si. Hardfacing conditions cause the dissolution of banding around both spherical and irregular carbides. The micro-hardness of interface is signiﬁcantly improved by the presence of secondary phase in the inter-dendritic structure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dilution" title="dilution">dilution</a>, <a href="https://publications.waset.org/abstracts/search?q=dissolution" title=" dissolution"> dissolution</a>, <a href="https://publications.waset.org/abstracts/search?q=hardfacing" title=" hardfacing"> hardfacing</a>, <a href="https://publications.waset.org/abstracts/search?q=infiltrated%20matrix" title=" infiltrated matrix"> infiltrated matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=PDC%20drill%20bits" title=" PDC drill bits"> PDC drill bits</a> </p> <a href="https://publications.waset.org/abstracts/49707/ni-based-hardfacing-alloy-reinforced-with-fused-eutectic-tungsten-carbide-deposited-on-infiltrated-wc-w-ni-substrate-by-oxyacetylene-welding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49707.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">341</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=least%20significant%20bits&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&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=least%20significant%20bits&page=563">563</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&page=564">564</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=least%20significant%20bits&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>