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: partial modified prime code (PMP)</title> <meta name="description" content="Search results for: partial modified prime code (PMP)"> <meta name="keywords" content="partial modified prime code (PMP)"> <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="partial modified prime code (PMP)" 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="partial modified prime code (PMP)"> <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> 5310</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: partial modified prime code (PMP)</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5310</span> Performance Analysis and Comparison of Various 1-D and 2-D Prime Codes for OCDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gurjit%20Kaur">Gurjit Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Shashank%20Johri"> Shashank Johri</a>, <a href="https://publications.waset.org/abstracts/search?q=Arpit%20Mehrotra"> Arpit Mehrotra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we have analyzed and compared the performance of various coding schemes. The basic ID prime sequence codes are unique in only dimension i.e. time slots whereas 2D coding techniques are not unique by their time slots but with their wavelengths also. In this research we have evaluated and compared the performance of 1D and 2D coding techniques constructed using prime sequence coding pattern for OCDMA system on a single platform. Results shows that 1D Extended Prime Code (EPC) can support more number of active users compared to other codes but at the expense of larger code length which further increases the complexity of the code. Modified Prime Code (MPC) supports lesser number of active users at λc=2 but it has a lesser code length as compared to 1D prime code. Analysis shows that 2D prime code supports lesser number of active users than 1D codes but they are having large code family and are the most secure codes compared to other codes. The performance of all these codes is analyzed on basis of number of active users supported at a Bit Error Rate (BER) of 10-9. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=OOC" title=" OOC"> OOC</a>, <a href="https://publications.waset.org/abstracts/search?q=PC" title=" PC"> PC</a>, <a href="https://publications.waset.org/abstracts/search?q=EPC" title=" EPC"> EPC</a>, <a href="https://publications.waset.org/abstracts/search?q=MPC" title=" MPC"> MPC</a>, <a href="https://publications.waset.org/abstracts/search?q=2-D%20PC%2FPC" title=" 2-D PC/PC"> 2-D PC/PC</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBc" title=" λc"> λc</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBa" title=" λa"> λa</a> </p> <a href="https://publications.waset.org/abstracts/35194/performance-analysis-and-comparison-of-various-1-d-and-2-d-prime-codes-for-ocdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35194.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">510</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">5309</span> Reduction of Multiple User Interference for Optical CDMA Systems Using Successive Interference Cancellation Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tawfig%20Eltaif">Tawfig Eltaif</a>, <a href="https://publications.waset.org/abstracts/search?q=Hesham%20A.%20Bakarman"> Hesham A. Bakarman</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Alsowaidi"> N. Alsowaidi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Mokhtar"> M. R. Mokhtar</a>, <a href="https://publications.waset.org/abstracts/search?q=Malek%20Harbawi"> Malek Harbawi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Commonly, it is primary problem that there is multiple user interference (MUI) noise resulting from the overlapping among the users in optical code-division multiple access (OCDMA) system. In this article, we aim to mitigate this problem by studying an interference cancellation scheme called successive interference cancellation (SIC) scheme. This scheme will be tested on two different detection schemes, spectral amplitude coding (SAC) and direct detection systems (DS), using partial modified prime (PMP) as the signature codes. It was found that SIC scheme based on both SAC and DS methods had a potential to suppress the intensity noise, that is to say, it can mitigate MUI noise. Furthermore, SIC/DS scheme showed much lower bit error rate (BER) performance relative to SIC/SAC scheme for different magnitude of effective power. Hence, many more users can be supported by SIC/DS receiver system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optical%20code-division%20multiple%20access%20%28OCDMA%29" title="optical code-division multiple access (OCDMA)">optical code-division multiple access (OCDMA)</a>, <a href="https://publications.waset.org/abstracts/search?q=successive%20interference%20cancellation%20%28SIC%29" title=" successive interference cancellation (SIC)"> successive interference cancellation (SIC)</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20user%20interference%20%28MUI%29" title=" multiple user interference (MUI)"> multiple user interference (MUI)</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20amplitude%20coding%20%28SAC%29" title=" spectral amplitude coding (SAC)"> spectral amplitude coding (SAC)</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29" title=" partial modified prime code (PMP)"> partial modified prime code (PMP)</a> </p> <a href="https://publications.waset.org/abstracts/33603/reduction-of-multiple-user-interference-for-optical-cdma-systems-using-successive-interference-cancellation-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33603.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">521</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">5308</span> Design and Performance Improvement of Three-Dimensional Optical Code Division Multiple Access Networks with NAND Detection Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Satyasen%20Panda">Satyasen Panda</a>, <a href="https://publications.waset.org/abstracts/search?q=Urmila%20Bhanja"> Urmila Bhanja</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have presented and analyzed three-dimensional (3-D) matrices of wavelength/time/space code for optical code division multiple access (OCDMA) networks with NAND subtraction detection technique. The 3-D codes are constructed by integrating a two-dimensional modified quadratic congruence (MQC) code with one-dimensional modified prime (MP) code. The respective encoders and decoders were designed using fiber Bragg gratings and optical delay lines to minimize the bit error rate (BER). The performance analysis of the 3D-OCDMA system is based on measurement of signal to noise ratio (SNR), BER and eye diagram for a different number of simultaneous users. Also, in the analysis, various types of noises and multiple access interference (MAI) effects were considered. The results obtained with NAND detection technique were compared with those obtained with OR and AND subtraction techniques. The comparison results proved that the NAND detection technique with 3-D MQC\MP code can accommodate more number of simultaneous users for longer distances of fiber with minimum BER as compared to OR and AND subtraction techniques. The received optical power is also measured at various levels of BER to analyze the effect of attenuation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cross%20Correlation%20%28CC%29" title="Cross Correlation (CC)">Cross Correlation (CC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Three%20dimensional%20Optical%20Code%20Division%20Multiple%20Access%20%283-D%20OCDMA%29" title=" Three dimensional Optical Code Division Multiple Access (3-D OCDMA)"> Three dimensional Optical Code Division Multiple Access (3-D OCDMA)</a>, <a href="https://publications.waset.org/abstracts/search?q=Spectral%20Amplitude%20Coding%20Optical%20Code%20Division%20Multiple%20Access%20%28SAC-OCDMA%29" title=" Spectral Amplitude Coding Optical Code Division Multiple Access (SAC-OCDMA)"> Spectral Amplitude Coding Optical Code Division Multiple Access (SAC-OCDMA)</a>, <a href="https://publications.waset.org/abstracts/search?q=Multiple%20Access%20Interference%20%28MAI%29" title=" Multiple Access Interference (MAI)"> Multiple Access Interference (MAI)</a>, <a href="https://publications.waset.org/abstracts/search?q=Phase%20Induced%20Intensity%20Noise%20%28PIIN%29" title=" Phase Induced Intensity Noise (PIIN)"> Phase Induced Intensity Noise (PIIN)</a>, <a href="https://publications.waset.org/abstracts/search?q=Three%20Dimensional%20Modified%20Quadratic%20Congruence%2FModified%20Prime%20%283-D%20MQC%2FMP%29%20code" title=" Three Dimensional Modified Quadratic Congruence/Modified Prime (3-D MQC/MP) code"> Three Dimensional Modified Quadratic Congruence/Modified Prime (3-D MQC/MP) code</a> </p> <a href="https://publications.waset.org/abstracts/57485/design-and-performance-improvement-of-three-dimensional-optical-code-division-multiple-access-networks-with-nand-detection-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57485.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">5307</span> Performance Evaluation of One and Two Dimensional Prime Codes for Optical Code Division Multiple Access Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gurjit%20Kaur">Gurjit Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Neena%20Gupta"> Neena Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have analyzed and compared the performance of various coding schemes. The basic ID prime sequence codes are unique in only dimension, i.e. time slots, whereas 2D coding techniques are not unique by their time slots but with their wavelengths also. In this research, we have evaluated and compared the performance of 1D and 2D coding techniques constructed using prime sequence coding pattern for Optical Code Division Multiple Access (OCDMA) system on a single platform. Analysis shows that 2D prime code supports lesser number of active users than 1D codes, but they are having large code family and are the most secure codes compared to other codes. The performance of all these codes is analyzed on basis of number of active users supported at a Bit Error Rate (BER) of 10-9. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=OOC" title=" OOC"> OOC</a>, <a href="https://publications.waset.org/abstracts/search?q=PC" title=" PC"> PC</a>, <a href="https://publications.waset.org/abstracts/search?q=EPC" title=" EPC"> EPC</a>, <a href="https://publications.waset.org/abstracts/search?q=MPC" title=" MPC"> MPC</a>, <a href="https://publications.waset.org/abstracts/search?q=2-D%20PC%2FPC" title=" 2-D PC/PC"> 2-D PC/PC</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBc" title=" λc"> λc</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBa" title=" λa"> λa</a> </p> <a href="https://publications.waset.org/abstracts/45035/performance-evaluation-of-one-and-two-dimensional-prime-codes-for-optical-code-division-multiple-access-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45035.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">5306</span> Union-Primes and Immediate Neighbors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shai%20Sarussi">Shai Sarussi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The union of a nonempty chain of prime ideals in a noncommutative ring is not necessarily a prime ideal. An ideal is called union-prime if it is a union of a nonempty chain of prime ideals but is not a prime. In this paper, some relations between chains of prime ideals and the induced chains of union-prime ideals are shown; in particular, the cardinality of such chains and the cardinality of the sets of cuts of such chains are discussed. For a ring R and a nonempty full chain of prime ideals C of R, several characterizations for the property of immediate neighbors in C are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prime%20ideals" title="prime ideals">prime ideals</a>, <a href="https://publications.waset.org/abstracts/search?q=union-prime%20ideals" title=" union-prime ideals"> union-prime ideals</a>, <a href="https://publications.waset.org/abstracts/search?q=immediate%20neighbors" title=" immediate neighbors"> immediate neighbors</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaplansky%27s%20conjecture" title=" Kaplansky's conjecture"> Kaplansky's conjecture</a> </p> <a href="https://publications.waset.org/abstracts/131024/union-primes-and-immediate-neighbors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131024.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">131</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">5305</span> Developing a Modified Version of KIVA-3V, Enabling Gaseous Injections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Keshtkar">Hossein Keshtkar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Nasiri%20Toosi"> Ali Nasiri Toosi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the growing concerns about gasoline environmental pollution and also the need for a more widely available fuel source, natural gas is finding its way to the automotive engines. But before this could happen industrially, simulations of natural gas direct injection need to take place to maximize and optimize power output. KIVA is one of the most powerful tools when it comes to engine simulation. Widely accepted by both researchers and the industry, KIVA an open-source code, offers great in-depth simulation and analyzation. KIVA can compute complex phenomena’s which can occur inside the chamber before, whilst and after ignition. One downside to KIVA, is its in-capability of simulating gaseous injections, making it useful for only liquidized fuel. In this study, we developed a numerical code, to enable the simulation of gaseous injection within the KIVA code. By introducing our code as a subroutine, we modified the original KIVA program. To ensure the correct application of gaseous fuel injection using our modified KIVA code, we simulated two different cases and compared them with their experimental data. We concluded our modified version of KIVA’s simulation results came in very close to those measured experimentally. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gaseous%20injections" title="gaseous injections">gaseous injections</a>, <a href="https://publications.waset.org/abstracts/search?q=KIVA" title=" KIVA"> KIVA</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20gas%20direct%20injection" title=" natural gas direct injection"> natural gas direct injection</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20code" title=" numerical code"> numerical code</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/74309/developing-a-modified-version-of-kiva-3v-enabling-gaseous-injections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74309.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">286</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">5304</span> Maximum Distance Separable b-Symbol Repeated-Root γ-Constacylic Codes over a Finite Chain Ring of Length 2</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jamal%20Laaouine">Jamal Laaouine</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Elhassani%20Charkani"> Mohammed Elhassani Charkani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let p be a prime and let b be an integer. MDS b-symbol codes are a direct generalization of MDS codes. The γ-constacyclic codes of length pˢ over the finite commutative chain ring Fₚm [u]/ < u² > had been classified into four distinct types, where is a nonzero element of the field Fₚm. Let C₃ be a code of Type 3. In this paper, we obtain the b-symbol distance db(C₃) of the code C₃. Using this result, necessary and sufficient conditions under which C₃ is an MDS b-symbol code are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constacyclic%20code" title="constacyclic code">constacyclic code</a>, <a href="https://publications.waset.org/abstracts/search?q=repeated-root%20code" title=" repeated-root code"> repeated-root code</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20distance%20separable" title=" maximum distance separable"> maximum distance separable</a>, <a href="https://publications.waset.org/abstracts/search?q=MDS%20codes" title=" MDS codes"> MDS codes</a>, <a href="https://publications.waset.org/abstracts/search?q=b-symbol%20distance" title=" b-symbol distance"> b-symbol distance</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20chain%20rings" title=" finite chain rings"> finite chain rings</a> </p> <a href="https://publications.waset.org/abstracts/131201/maximum-distance-separable-b-symbol-repeated-root-gh-constacylic-codes-over-a-finite-chain-ring-of-length-2" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131201.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">137</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">5303</span> Construction and Analysis of Partially Balanced Sudoku Design of Prime Order</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abubakar%20Danbaba">Abubakar Danbaba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sudoku squares have been widely used to design an experiment where each treatment occurs exactly once in each row, column or sub-block. For some experiments, the size of row (or column or sub-block) may be larger than the number of treatments. Since each treatment appears only once in each row (column or sub-block) with an additional empty cell such designs are partially balanced Sudoku designs (PBSD) with NP-complete structures. This paper proposed methods for constructing PBSD of prime order of treatments by a modified Kronecker product and swap of matrix row (or column) in cyclic order. In addition, linear model and procedure for the analysis of data for PBSD are proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sudoku%20design" title="sudoku design">sudoku design</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20sudoku" title=" partial sudoku"> partial sudoku</a>, <a href="https://publications.waset.org/abstracts/search?q=NP-complete" title=" NP-complete"> NP-complete</a>, <a href="https://publications.waset.org/abstracts/search?q=Kronecker%20product" title=" Kronecker product"> Kronecker product</a>, <a href="https://publications.waset.org/abstracts/search?q=row%20and%20column%20swap" title=" row and column swap"> row and column swap</a> </p> <a href="https://publications.waset.org/abstracts/47207/construction-and-analysis-of-partially-balanced-sudoku-design-of-prime-order" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47207.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5302</span> Bit Error Rate (BER) Performance of Coherent Homodyne BPSK-OCDMA Network for Multimedia Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Morsy%20Ahmed%20Morsy%20Ismail">Morsy Ahmed Morsy Ismail</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the structure of a coherent homodyne receiver for the Binary Phase Shift Keying (BPSK) Optical Code Division Multiple Access (OCDMA) network is introduced based on the Multi-Length Weighted Modified Prime Code (ML-WMPC) for multimedia applications. The Bit Error Rate (BER) of this homodyne detection is evaluated as a function of the number of active users and the signal to noise ratio for different code lengths according to the multimedia application such as audio, voice, and video. Besides, the Mach-Zehnder interferometer is used as an external phase modulator in homodyne detection. Furthermore, the Multiple Access Interference (MAI) and the receiver noise in a shot-noise limited regime are taken into consideration in the BER calculations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OCDMA%20networks" title="OCDMA networks">OCDMA networks</a>, <a href="https://publications.waset.org/abstracts/search?q=bit%20error%20rate" title=" bit error rate"> bit error rate</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20access%20interference" title=" multiple access interference"> multiple access interference</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20phase-shift%20keying" title=" binary phase-shift keying"> binary phase-shift keying</a>, <a href="https://publications.waset.org/abstracts/search?q=multimedia" title=" multimedia"> multimedia</a> </p> <a href="https://publications.waset.org/abstracts/142901/bit-error-rate-ber-performance-of-coherent-homodyne-bpsk-ocdma-network-for-multimedia-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142901.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">175</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">5301</span> Recycled Waste Glass Powder as a Partial Cement Replacement in Polymer-Modified Mortars</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nikol%20%C5%BDi%C5%BEkov%C3%A1">Nikol Žižková</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this study was to observe the behavior of polymer-modified cement mortars with regard to the use of a pozzolanic admixture. Polymer-modified mortars (PMMs) containing various types of waste glass (waste packing glass and fluorescent tube glass) were produced always with 20% of cement substituted with a pozzolanic-active material. Ethylene/vinyl acetate copolymer (EVA) was used for polymeric modification. The findings confirm the possibility of using the waste glass examined herein as a partial substitute for cement in the production of PMM, which contributes to the preservation of non-renewable raw material resources and to the efficiency of waste glass material reuse. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=recycled%20waste%20glass" title="recycled waste glass">recycled waste glass</a>, <a href="https://publications.waset.org/abstracts/search?q=polymer-modified%20mortars" title=" polymer-modified mortars"> polymer-modified mortars</a>, <a href="https://publications.waset.org/abstracts/search?q=pozzolanic%20admixture" title=" pozzolanic admixture"> pozzolanic admixture</a>, <a href="https://publications.waset.org/abstracts/search?q=ethylene%2Fvinyl%20acetate%20copolymer" title=" ethylene/vinyl acetate copolymer"> ethylene/vinyl acetate copolymer</a> </p> <a href="https://publications.waset.org/abstracts/58596/recycled-waste-glass-powder-as-a-partial-cement-replacement-in-polymer-modified-mortars" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58596.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">255</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">5300</span> Pairwise Relative Primality of Integers and Independent Sets of Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jerry%20Hu">Jerry Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G = (V, E) with V = {1, 2, ..., k} be a graph, the k positive integers a₁, a₂, ..., ak are G-wise relatively prime if (aᵢ, aⱼ ) = 1 for {i, j} ∈ E. We use an inductive approach to give an asymptotic formula for the number of k-tuples of integers that are G-wise relatively prime. An exact formula is obtained for the probability that k positive integers are G-wise relatively prime. As a corollary, we also provide an exact formula for the probability that k positive integers have exactly r relatively prime pairs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph" title="graph">graph</a>, <a href="https://publications.waset.org/abstracts/search?q=independent%20set" title=" independent set"> independent set</a>, <a href="https://publications.waset.org/abstracts/search?q=G-wise%20relatively%20prime" title=" G-wise relatively prime"> G-wise relatively prime</a>, <a href="https://publications.waset.org/abstracts/search?q=probability" title=" probability"> probability</a> </p> <a href="https://publications.waset.org/abstracts/162507/pairwise-relative-primality-of-integers-and-independent-sets-of-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162507.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">92</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">5299</span> Code-Switching and Code Mixing among Ogba-English Bilingual Conversations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ben-Fred%20Ohia">Ben-Fred Ohia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Code-switching and code-mixing are linguistic behaviours that arise in a bilingual situation. They limit speakers in a conversation to decide which code they should use to utter particular phrases or words in the course of carrying out their utterance. Every human society is characterized by the existence of diverse linguistic varieties. The speakers of these varieties at some points have various degrees of contact with the non-speakers of their variety, which one of the outcomes of the linguistic contact is code-switching or code-mixing. The work discusses the nature of code-switching and code-mixing in Ogba-English bilinguals’ speeches. It provides a detailed explanation of the concept of code-switching and code-mixing and explains the typology of code-switching and code-mixing and their manifestation in Ogba-English bilingual speakers’ speeches. The findings reveal that code-switching and code-mixing are functionally motivated and being triggered by various conversational contexts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilinguals" title="bilinguals">bilinguals</a>, <a href="https://publications.waset.org/abstracts/search?q=code-mixing" title=" code-mixing"> code-mixing</a>, <a href="https://publications.waset.org/abstracts/search?q=code-switching" title=" code-switching"> code-switching</a>, <a href="https://publications.waset.org/abstracts/search?q=Ogba" title=" Ogba"> Ogba</a> </p> <a href="https://publications.waset.org/abstracts/122982/code-switching-and-code-mixing-among-ogba-english-bilingual-conversations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122982.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">181</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">5298</span> Nadler's Fixed Point Theorem on Partial Metric Spaces and its Application to a Homotopy Result</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hemant%20Kumar%20Pathak">Hemant Kumar Pathak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 1994, Matthews (S.G. Matthews, Partial metric topology, in: Proc. 8th Summer Conference on General Topology and Applications, in: Ann. New York Acad. Sci., vol. 728, 1994, pp. 183-197) introduced the concept of a partial metric as a part of the study of denotational semantics of data flow networks. He gave a modified version of the Banach contraction principle, more suitable in this context. In fact, (complete) partial metric spaces constitute a suitable framework to model several distinguished examples of the theory of computation and also to model metric spaces via domain theory. In this paper, we introduce the concept of almost partial Hausdorff metric. We prove a fixed point theorem for multi-valued mappings on partial metric space using the concept of almost partial Hausdorff metric and prove an analogous to the well-known Nadler’s fixed point theorem. In the sequel, we derive a homotopy result as an application of our main result. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title="fixed point">fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20metric%20space" title=" partial metric space"> partial metric space</a>, <a href="https://publications.waset.org/abstracts/search?q=homotopy" title=" homotopy"> homotopy</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20sciences" title=" physical sciences"> physical sciences</a> </p> <a href="https://publications.waset.org/abstracts/5182/nadlers-fixed-point-theorem-on-partial-metric-spaces-and-its-application-to-a-homotopy-result" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5182.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">441</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">5297</span> Application of a Modified Crank-Nicolson Method in Metallurgy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kobamelo%20Mashaba">Kobamelo Mashaba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The molten slag has a high substantial temperatures range between 1723-1923, carrying a huge amount of useful energy for reducing energy consumption and CO₂ emissions under the heat recovery process. Therefore in this study, we investigated the performance of the modified crank Nicolson method for a delayed partial differential equation on the heat recovery of molten slag in the metallurgical mining environment. It was proved that the proposed method converges quickly compared to the classic method with the existence of a unique solution. It was inferred from numerical result that the proposed methodology is more viable and profitable for the mining industry. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=delayed%20partial%20differential%20equation" title="delayed partial differential equation">delayed partial differential equation</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20Crank-Nicolson%20Method" title=" modified Crank-Nicolson Method"> modified Crank-Nicolson Method</a>, <a href="https://publications.waset.org/abstracts/search?q=molten%20slag" title=" molten slag"> molten slag</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20recovery" title=" heat recovery"> heat recovery</a>, <a href="https://publications.waset.org/abstracts/search?q=parabolic%20equation" title=" parabolic equation"> parabolic equation</a> </p> <a href="https://publications.waset.org/abstracts/152073/application-of-a-modified-crank-nicolson-method-in-metallurgy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152073.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">101</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">5296</span> Algorithms Utilizing Wavelet to Solve Various Partial Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20P.%20Mredula">K. P. Mredula</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20C.%20Vakaskar"> D. C. Vakaskar </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article traces developments and evolution of various algorithms developed for solving partial differential equations using the significant combination of wavelet with few already explored solution procedures. The approach depicts a study over a decade of traces and remarks on the modifications in implementing multi-resolution of wavelet, finite difference approach, finite element method and finite volume in dealing with a variety of partial differential equations in the areas like plasma physics, astrophysics, shallow water models, modified Burger equations used in optical fibers, biology, fluid dynamics, chemical kinetics etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-resolution" title="multi-resolution">multi-resolution</a>, <a href="https://publications.waset.org/abstracts/search?q=Haar%20Wavelet" title=" Haar Wavelet"> Haar Wavelet</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20differential%20equation" title=" partial differential equation"> partial differential equation</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20methods" title=" numerical methods"> numerical methods</a> </p> <a href="https://publications.waset.org/abstracts/59280/algorithms-utilizing-wavelet-to-solve-various-partial-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59280.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">299</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">5295</span> Skew Cyclic Codes over Fq+uFq+…+uk-1Fq</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Li">Jing Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiuli%20Li"> Xiuli Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a special class of linear codes, called skew cyclic codes, over the ring <em>R</em>= <em>F<sub>q</sub></em>+<em>uF<sub>q</sub></em>+…+<em>u<sup>k-</sup></em><sup>1</sup><em>F<sub>q</sub></em>, where <em>q</em> is a prime power. A Gray map <em>ɸ</em> from <em>R</em> to <em>F<sub>q</sub></em> and a Gray map <em>ɸ'</em> from <em>R<sup>n</sup></em> to <em>F<sup>n</sup><sub>q</sub></em> are defined, as well as an automorphism <em>Θ</em> over <em>R</em>. It is proved that the images of skew cyclic codes over <em>R</em> under map <em>ɸ'</em> and <em>Θ</em> are cyclic codes over <em>F<sub>q</sub></em>, and they still keep the dual relation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20code" title="skew cyclic code">skew cyclic code</a>, <a href="https://publications.waset.org/abstracts/search?q=gray%20map" title=" gray map"> gray map</a>, <a href="https://publications.waset.org/abstracts/search?q=automorphism" title=" automorphism"> automorphism</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20code" title=" cyclic code"> cyclic code</a> </p> <a href="https://publications.waset.org/abstracts/70707/skew-cyclic-codes-over-fqufquk-1fq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70707.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">297</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">5294</span> A Rapid Code Acquisition Scheme in OOC-Based CDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keunhong%20Chae">Keunhong Chae</a>, <a href="https://publications.waset.org/abstracts/search?q=Seokho%20Yoon"> Seokho Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=code%20acquisition" title="code acquisition">code acquisition</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20CDMA" title=" optical CDMA"> optical CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20orthogonal%20code" title=" optical orthogonal code"> optical orthogonal code</a>, <a href="https://publications.waset.org/abstracts/search?q=serial%20algorithm" title=" serial algorithm"> serial algorithm</a> </p> <a href="https://publications.waset.org/abstracts/23348/a-rapid-code-acquisition-scheme-in-ooc-based-cdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23348.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">540</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">5293</span> A Discovery of the Dual Sequential Pattern of Prime Numbers in P x P: Applications in a Formal Proof of the Twin-Prime Conjecture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yingxu%20Wang">Yingxu Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work presents basic research on the recursive structures and dual sequential patterns of primes for the formal proof of the Twin-Prime Conjecture (TPC). A rigorous methodology of Twin-Prime Decomposition (TPD) is developed in MATLAB to inductively verify potential twins in the dual sequences of primes. The key finding of this basic study confirms that the dual sequences of twin primes are not only symmetric but also infinitive in the unique base 6 cycle, except a limited subset of potential pairs is eliminated by the lack of dual primality. Both theory and experiments have formally proven that the infinity of twin primes stated in TPC holds in the P x P space. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=number%20theory" title="number theory">number theory</a>, <a href="https://publications.waset.org/abstracts/search?q=primes" title=" primes"> primes</a>, <a href="https://publications.waset.org/abstracts/search?q=twin-prime%20conjecture" title=" twin-prime conjecture"> twin-prime conjecture</a>, <a href="https://publications.waset.org/abstracts/search?q=dual%20primes%20%28P%20x%20P%29" title=" dual primes (P x P)"> dual primes (P x P)</a>, <a href="https://publications.waset.org/abstracts/search?q=twin%20prime%20decomposition" title=" twin prime decomposition"> twin prime decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20proof" title=" formal proof"> formal proof</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm" title=" algorithm"> algorithm</a> </p> <a href="https://publications.waset.org/abstracts/182326/a-discovery-of-the-dual-sequential-pattern-of-prime-numbers-in-p-x-p-applications-in-a-formal-proof-of-the-twin-prime-conjecture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182326.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">64</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">5292</span> On Modules over Dedekind Prime Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elvira%20Kusniyanti">Elvira Kusniyanti</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanni%20Garminia"> Hanni Garminia</a>, <a href="https://publications.waset.org/abstracts/search?q=Pudji%20Astuti"> Pudji Astuti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research studies an interconnection between finitely generated uniform modules and Dedekind prime rings. The characterization of modules over Dedekind prime rings that will be investigated is an adoption of Noetherian and hereditary concept. Dedekind prime rings are Noetherian and hereditary rings. This property of Dedekind prime rings is a background of the idea of adopting arises. In Noetherian area, it was known that a ring R is Noetherian ring if and only if every finitely generated R-module is a Noetherian module. Similar to that result, a characterization of the hereditary ring is related to its projective modules. That is, a ring R is hereditary ring if and only if every projective R-module is a hereditary module. Due to the above two results, we suppose that characterization of a Dedekind prime ring can be analyzed from finitely generated modules over it. We propose a conjecture: a ring R is a Dedekind prime ring if and only if every finitely generated uniform R-module is a Dedekind module. In this article, we will generalize a concept of the Dedekind module for non-commutative ring case and present a part of the above conjecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dedekind%20domains" title="dedekind domains">dedekind domains</a>, <a href="https://publications.waset.org/abstracts/search?q=dedekind%20prime%20rings" title=" dedekind prime rings"> dedekind prime rings</a>, <a href="https://publications.waset.org/abstracts/search?q=dedekind%20modules" title=" dedekind modules"> dedekind modules</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20modules" title=" uniform modules"> uniform modules</a> </p> <a href="https://publications.waset.org/abstracts/32475/on-modules-over-dedekind-prime-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32475.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">441</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">5291</span> Pythagorean-Platonic Lattice Method for Finding all Co-Prime Right Angle Triangles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anthony%20Overmars">Anthony Overmars</a>, <a href="https://publications.waset.org/abstracts/search?q=Sitalakshmi%20Venkatraman"> Sitalakshmi Venkatraman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pythagorean%20triples" title="Pythagorean triples">Pythagorean triples</a>, <a href="https://publications.waset.org/abstracts/search?q=platonic%20triples" title=" platonic triples"> platonic triples</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20angle%20triangles" title=" right angle triangles"> right angle triangles</a>, <a href="https://publications.waset.org/abstracts/search?q=co-prime%20numbers" title=" co-prime numbers"> co-prime numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a> </p> <a href="https://publications.waset.org/abstracts/80590/pythagorean-platonic-lattice-method-for-finding-all-co-prime-right-angle-triangles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80590.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">239</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5290</span> Partial M-Sequence Code Families Applied in Spectral Amplitude Coding Fiber-Optic Code-Division Multiple-Access Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shin-Pin%20Tseng">Shin-Pin Tseng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, numerous spectral amplitude coding (SAC) fiber-optic code-division-multiple-access (FO-CDMA) techniques were appealing due to their capable of providing moderate security and relieving the effects of multiuser interference (MUI). Nonetheless, the performance of the previous network is degraded due to fixed in-phase cross-correlation (IPCC) value. Based on the above problems, a new SAC FO-CDMA network using partial M-sequence (PMS) code is presented in this study. Because the proposed PMS code is originated from M-sequence code, the system using the PMS code could effectively suppress the effects of MUI. In addition, two-code keying (TCK) scheme can applied in the proposed SAC FO-CDMA network and enhance the whole network performance. According to the consideration of system flexibility, simple optical encoders/decoders (codecs) using fiber Bragg gratings (FBGs) were also developed. First, we constructed a diagram of the SAC FO-CDMA network, including (N/2-1) optical transmitters, (N/2-1) optical receivers, and one N×N star coupler for broadcasting transmitted optical signals to arrive at the input port of each optical receiver. Note that the parameter N for the PMS code was the code length. In addition, the proposed SAC network was using superluminescent diodes (SLDs) as light sources, which then can save a lot of system cost compared with the other FO-CDMA methods. For the design of each optical transmitter, it is composed of an SLD, one optical switch, and two optical encoders according to assigned PMS codewords. On the other hand, each optical receivers includes a 1 × 2 splitter, two optical decoders, and one balanced photodiode for mitigating the effect of MUI. In order to simplify the next analysis, the some assumptions were used. First, the unipolarized SLD has flat power spectral density (PSD). Second, the received optical power at the input port of each optical receiver is the same. Third, all photodiodes in the proposed network have the same electrical properties. Fourth, transmitting '1' and '0' has an equal probability. Subsequently, by taking the factors of phase‐induced intensity noise (PIIN) and thermal noise, the corresponding performance was displayed and compared with the performance of the previous SAC FO-CDMA networks. From the numerical result, it shows that the proposed network improved about 25% performance than that using other codes at BER=10-9. This is because the effect of PIIN was effectively mitigated and the received power was enhanced by two times. As a result, the SAC FO-CDMA network using PMS codes has an opportunity to apply in applications of the next-generation optical network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spectral%20amplitude%20coding" title="spectral amplitude coding">spectral amplitude coding</a>, <a href="https://publications.waset.org/abstracts/search?q=SAC" title=" SAC"> SAC</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber-optic%20code-division%20multiple-access" title=" fiber-optic code-division multiple-access"> fiber-optic code-division multiple-access</a>, <a href="https://publications.waset.org/abstracts/search?q=FO-CDMA" title=" FO-CDMA"> FO-CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20M-sequence" title=" partial M-sequence"> partial M-sequence</a>, <a href="https://publications.waset.org/abstracts/search?q=PMS%20code" title=" PMS code"> PMS code</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber%20Bragg%20grating" title=" fiber Bragg grating"> fiber Bragg grating</a>, <a href="https://publications.waset.org/abstracts/search?q=FBG" title=" FBG"> FBG</a> </p> <a href="https://publications.waset.org/abstracts/92764/partial-m-sequence-code-families-applied-in-spectral-amplitude-coding-fiber-optic-code-division-multiple-access-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92764.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">5289</span> Numerical Solutions of Generalized Burger-Fisher Equation by Modified Variational Iteration Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20O.%20Olayiwola">M. O. Olayiwola</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Numerical solutions of the generalized Burger-Fisher are obtained using a Modified Variational Iteration Method (MVIM) with minimal computational efforts. The computed results with this technique have been compared with other results. The present method is seen to be a very reliable alternative method to some existing techniques for such nonlinear problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=burger-fisher" title="burger-fisher">burger-fisher</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20variational%20iteration%20method" title=" modified variational iteration method"> modified variational iteration method</a>, <a href="https://publications.waset.org/abstracts/search?q=lagrange%20multiplier" title=" lagrange multiplier"> lagrange multiplier</a>, <a href="https://publications.waset.org/abstracts/search?q=Taylor%E2%80%99s%20series" title=" Taylor’s series"> Taylor’s series</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20differential%20equation" title=" partial differential equation"> partial differential equation</a> </p> <a href="https://publications.waset.org/abstracts/3943/numerical-solutions-of-generalized-burger-fisher-equation-by-modified-variational-iteration-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3943.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">430</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5288</span> A Proof for Goldbach's Conjecture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hashem%20Sazegar">Hashem Sazegar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 1937, Vinograd of Russian Mathematician proved that each odd large number can be shown by three primes. In 1973, Chen Jingrun proved that each odd number can be shown by one prime plus a number that has maximum two primes. In this article, we state one proof for Goldbach’conjecture. Introduction: Bertrand’s postulate state for every positive integer n, there is always at least one prime p, such that n < p < 2n. This was first proved by Chebyshev in 1850, which is why postulate is also called the Bertrand-Chebyshev theorem. Legendre’s conjecture states that there is a prime between n2 and (n+1)2 for every positive integer n, which is one of the four Landau’s problems. The rest of these four basic problems are; (i) Twin prime conjecture: There are infinitely many primes p such that p+2 is a prime. (ii) Goldbach’s conjecture: Every even integer n > 2 can be written asthe sum of two primes. (iii) Are there infinitely many primes p such that p−1 is a perfect square? Problems (i), (ii), and (iii) are open till date. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bertrand-Chebyshev%20theorem" title="Bertrand-Chebyshev theorem">Bertrand-Chebyshev theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=Landau%E2%80%99s%20problems" title=" Landau’s problems"> Landau’s problems</a>, <a href="https://publications.waset.org/abstracts/search?q=twin%20prime" title=" twin prime"> twin prime</a>, <a href="https://publications.waset.org/abstracts/search?q=Legendre%E2%80%99s%20conjecture" title=" Legendre’s conjecture"> Legendre’s conjecture</a>, <a href="https://publications.waset.org/abstracts/search?q=Oppermann%E2%80%99s%20conjecture" title=" Oppermann’s conjecture"> Oppermann’s conjecture</a> </p> <a href="https://publications.waset.org/abstracts/30678/a-proof-for-goldbachs-conjecture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30678.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">5287</span> Modeling of Nitrogen Solubility in Stainless Steel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saeed%20Ghali">Saeed Ghali</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoda%20El-Faramawy"> Hoda El-Faramawy</a>, <a href="https://publications.waset.org/abstracts/search?q=Mamdouh%20Eissa"> Mamdouh Eissa</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Mishreky"> Michael Mishreky</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scale-resistant austenitic stainless steel, X45CrNiW 18-9, has been developed, and modified steels produced through partial and total nickel replacement by nitrogen. These modified steels were produced in a 10 kg induction furnace under different nitrogen pressures and were cast into ingots. The produced modified stainless steels were forged, followed by air cooling. The phases of modified stainless steels have been investigated using the Schaeffler diagram, dilatometer, and microstructure observations. Both partial and total replacement of nickel using 0.33-0.50% nitrogen are effective in producing fully austenitic stainless steels. The nitrogen contents were determined and compared with those calculated using the Institute of Metal Science (IMS) equation. The results showed great deviations between the actual nitrogen contents and predicted values through IMS equation. So, an equation has been derived based on chemical composition, pressure, and temperature at 1600oC. [N%] = 0.0078 + 0.0406*X, where X is a function of chemical composition and nitrogen pressure. The derived equation has been used to calculate the nitrogen content of different steels using published data. The results reveal the difficulty of deriving a general equation for the prediction of nitrogen content covering different steel compositions. So, it is necessary to use a narrow composition range. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=solubility" title="solubility">solubility</a>, <a href="https://publications.waset.org/abstracts/search?q=nitrogen" title=" nitrogen"> nitrogen</a>, <a href="https://publications.waset.org/abstracts/search?q=stainless%20steel" title=" stainless steel"> stainless steel</a>, <a href="https://publications.waset.org/abstracts/search?q=Schaeffler" title=" Schaeffler"> Schaeffler</a> </p> <a href="https://publications.waset.org/abstracts/155322/modeling-of-nitrogen-solubility-in-stainless-steel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155322.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">238</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">5286</span> Comparative Safety Performance Evaluation of Profiled Deck Composite Slab from the Use of Slope-Intercept and Partial Shear Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Izian%20Abd.%20Karim">Izian Abd. Karim</a>, <a href="https://publications.waset.org/abstracts/search?q=Kachalla%20Mohammed"> Kachalla Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Nora%20Farah%20Abd%20Aznieta%20Aziz"> Nora Farah Abd Aznieta Aziz</a>, <a href="https://publications.waset.org/abstracts/search?q=Law%20Teik%20Hua"> Law Teik Hua </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The economic use and ease of construction of profiled deck composite slab is marred with the complex and un-economic strength verification required for the serviceability and general safety considerations. Beside these, albeit factors such as shear span length, deck geometries and mechanical frictions greatly influence the longitudinal shear strength, that determines the ultimate strength of profiled deck composite slab, and number of methods available for its determination; partial shear and slope-intercept are the two methods according to Euro-code 4 provision. However, the complexity associated with shear behavior of profiled deck composite slab, the use of these methods in determining the load carrying capacities of such slab yields different and conflicting values. This couple with the time and cost constraint associated with the strength verification is a source of concern that draws more attentions nowadays, the issue is critical. Treating some of these known shear strength influencing factors as random variables, the load carrying capacity violation of profiled deck composite slab from the use of the two-methods defined according to Euro-code 4 are determined using reliability approach, and comparatively studied. The study reveals safety values from the use of m-k method shows good standing compared with that from the partial shear method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=composite%20slab" title="composite slab">composite slab</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20order%20reliability%20method" title=" first order reliability method"> first order reliability method</a>, <a href="https://publications.waset.org/abstracts/search?q=longitudinal%20shear" title=" longitudinal shear"> longitudinal shear</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20shear%20connection" title=" partial shear connection"> partial shear connection</a>, <a href="https://publications.waset.org/abstracts/search?q=slope-intercept" title=" slope-intercept"> slope-intercept</a> </p> <a href="https://publications.waset.org/abstracts/29262/comparative-safety-performance-evaluation-of-profiled-deck-composite-slab-from-the-use-of-slope-intercept-and-partial-shear-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29262.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">355</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">5285</span> Prime Graphs of Polynomials and Power Series Over Non-Commutative Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walaa%20Obaidallah%20Alqarafi">Walaa Obaidallah Alqarafi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wafaa%20Mohammed%20Fakieh"> Wafaa Mohammed Fakieh</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Abdallah%20Altassan"> Alaa Abdallah Altassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebraic graph theory is defined as a bridge between algebraic structures and graphs. It has several uses in many fields, including chemistry, physics, and computer science. The prime graph is a type of graph associated with a ring R, where the vertex set is the whole ring R, and two vertices x and y are adjacent if either xRy=0 or yRx=0. However, the investigation of the prime graph over rings remains relatively limited. The behavior of this graph in extended rings, like R[x] and R[[x]], where R is a non-commutative ring, deserves more attention because of the wider applicability in algebra and other mathematical fields. To study the prime graphs over polynomials and power series rings, we used a combination of ring-theoretic and graph-theoretic techniques. This paper focuses on two invariants: the diameter and the girth of these graphs. Furthermore, the work discusses how the graph structures change when passing from R to R[x] and R[[x]]. In our study, we found that the set of strong zero-divisors of ring R represents the set of vertices in prime graphs. Based on this discovery, we redefined the vertices of prime graphs using the definition of strong zero divisors. Additionally, our results show that although the prime graphs of R[x] and R[[x]] are comparable to the graph of R, they have different combinatorial characteristics since these extensions contain new strong zero-divisors. In particular, we find conditions in which the diameter and girth of the graphs, as they expand from R to R[x] and R[[x]], do not change or do change. In conclusion, this study shows how extending a non-commutative ring R to R[x] and R[[x]] affects the structure of their prime graphs, particularly in terms of diameter and girth. These findings enhance the understanding of the relationship between ring extensions and graph properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prime%20graph" title="prime graph">prime graph</a>, <a href="https://publications.waset.org/abstracts/search?q=diameter" title=" diameter"> diameter</a>, <a href="https://publications.waset.org/abstracts/search?q=girth" title=" girth"> girth</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20series%20ring" title=" power series ring"> power series ring</a> </p> <a href="https://publications.waset.org/abstracts/192430/prime-graphs-of-polynomials-and-power-series-over-non-commutative-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192430.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">18</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">5284</span> Preliminary Geophysical Assessment of Soil Contaminants around Wacot Rice Factory Argungu, North-Western Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20I.%20Augie">A. I. Augie</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Alhassan"> Y. Alhassan</a>, <a href="https://publications.waset.org/abstracts/search?q=U.%20Z.%20Magawata"> U. Z. Magawata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Geophysical investigation was carried out at wacot rice factory Argungu north-western Nigeria, using the 2D electrical resistivity method. The area falls between latitude 12˚44′23ʺN to 12˚44′50ʺN and longitude 4032′18′′E to 4032′39′′E covering a total area of about 1.85 km. Two profiles were carried out with Wenner configuration using resistivity meter (Ohmega). The data obtained from the study area were modeled using RES2DIVN software which gave an automatic interpretation of the apparent resistivity data. The inverse resistivity models of the profiles show the high resistivity values ranging from 208 Ωm to 651 Ωm. These high resistivity values in the overburden were due to dryness and compactness of the strata that lead to consolidation, which is an indication that the area is free from leachate contaminations. However, from the inverse model, there are regions of low resistivity values (1 Ωm to 18 Ωm), these zones were observed and identified as clayey and the most contaminated zones. The regions of low resistivity thereby indicated the leachate plume or the highly leachate concentrated zones due to similar resistivity values in both clayey and leachate. The regions of leachate are mainly from the factory into the surrounding area and its groundwater. The maximum leachate infiltration was found at depths 1 m to 15.9 m (P1) and 6 m to 15.9 m (P2) vertically, as well as distance along the profiles from 67 m to 75 m (P1), 155 m to 180 m (P1), and 115 m to 192 m (P2) laterally. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contaminant" title="contaminant">contaminant</a>, <a href="https://publications.waset.org/abstracts/search?q=leachate" title=" leachate"> leachate</a>, <a href="https://publications.waset.org/abstracts/search?q=soil" title=" soil"> soil</a>, <a href="https://publications.waset.org/abstracts/search?q=groundwater" title=" groundwater"> groundwater</a>, <a href="https://publications.waset.org/abstracts/search?q=electrical" title=" electrical"> electrical</a>, <a href="https://publications.waset.org/abstracts/search?q=resistivity" title=" resistivity"> resistivity</a> </p> <a href="https://publications.waset.org/abstracts/114399/preliminary-geophysical-assessment-of-soil-contaminants-around-wacot-rice-factory-argungu-north-western-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/114399.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">160</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5283</span> Evaluation of Response Modification Factors in Moment Resisting Frame Buildings Considering Soil Structure Interaction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Farheen">K. Farheen</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Munir"> A. Munir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Seismic response of the multi-storey buildings is created by the interaction of both the structure and underlying soil medium. The seismic design philosophy is incorporated using response modification factor 'R'. Current code based values of 'R' factor does not reflect the SSI problem as it is based on fixed base condition. In this study, the modified values of 'R' factor for moment resisting frame (MRF) considering SSI are evaluated. The response of structure with and without SSI has been compared using equivalent linear static and nonlinear static pushover analyses for 10-storied moment resisting frame building. The building is located in seismic zone 2B situated on different soils with shear wave velocity (Vₛ) of 300m/sec (SD) and 1200m/s (SB). Code based 'R' factor value for building frame system has been taken as 5.5. Soil medium is modelled using identical but mutually independent horizontal and vertical springs. It was found that the modified 'R' factor values have been decreased by 47% and 43% for soil SD and SB respectively as compared to that of code based 'R' factor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buildings" title="buildings">buildings</a>, <a href="https://publications.waset.org/abstracts/search?q=SSI" title=" SSI"> SSI</a>, <a href="https://publications.waset.org/abstracts/search?q=shear%20wave%20velocity" title=" shear wave velocity"> shear wave velocity</a>, <a href="https://publications.waset.org/abstracts/search?q=R%20factor" title=" R factor"> R factor</a> </p> <a href="https://publications.waset.org/abstracts/100311/evaluation-of-response-modification-factors-in-moment-resisting-frame-buildings-considering-soil-structure-interaction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100311.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">212</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5282</span> Characterization of Onboard Reliable Error Correction Code FORSDRAM Controller</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Pitcheswara%20Rao">N. Pitcheswara Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the process of conveying the information there may be a chance of signal being corrupted which leads to the erroneous bits in the message. The message may consist of single, double and multiple bit errors. In high-reliability applications, memory can sustain multiple soft errors due to single or multiple event upsets caused by environmental factors. The traditional hamming code with SEC-DED capability cannot be address these types of errors. It is possible to use powerful non-binary BCH code such as Reed-Solomon code to address multiple errors. However, it could take at least a couple dozen cycles of latency to complete first correction and run at a relatively slow speed. In order to overcome this drawback i.e., to increase speed and latency we are using reed-Muller code. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SEC-DED" title="SEC-DED">SEC-DED</a>, <a href="https://publications.waset.org/abstracts/search?q=BCH%20code" title=" BCH code"> BCH code</a>, <a href="https://publications.waset.org/abstracts/search?q=Reed-Solomon%20code" title=" Reed-Solomon code"> Reed-Solomon code</a>, <a href="https://publications.waset.org/abstracts/search?q=Reed-Muller%20code" title=" Reed-Muller code"> Reed-Muller code</a> </p> <a href="https://publications.waset.org/abstracts/33706/characterization-of-onboard-reliable-error-correction-code-forsdram-controller" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33706.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">428</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">5281</span> Characterization of Onboard Reliable Error Correction Code for SDRAM Controller</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pitcheswara%20Rao%20Nelapati">Pitcheswara Rao Nelapati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the process of conveying the information there may be a chance of signal being corrupted which leads to the erroneous bits in the message. The message may consist of single, double and multiple bit errors. In high-reliability applications, memory can sustain multiple soft errors due to single or multiple event upsets caused by environmental factors. The traditional hamming code with SEC-DED capability cannot be address these types of errors. It is possible to use powerful non-binary BCH code such as Reed-Solomon code to address multiple errors. However, it could take at least a couple dozen cycles of latency to complete first correction and run at a relatively slow speed. In order to overcome this drawback i.e., to increase speed and latency we are using reed-Muller code. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SEC-DED" title="SEC-DED">SEC-DED</a>, <a href="https://publications.waset.org/abstracts/search?q=BCH%20code" title=" BCH code"> BCH code</a>, <a href="https://publications.waset.org/abstracts/search?q=Reed-Solomon%20code" title=" Reed-Solomon code"> Reed-Solomon code</a>, <a href="https://publications.waset.org/abstracts/search?q=Reed-Muller%20code" title=" Reed-Muller code"> Reed-Muller code</a> </p> <a href="https://publications.waset.org/abstracts/32965/characterization-of-onboard-reliable-error-correction-code-for-sdram-controller" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32965.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">429</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=partial%20modified%20prime%20code%20%28PMP%29&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&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=partial%20modified%20prime%20code%20%28PMP%29&page=176">176</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&page=177">177</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=partial%20modified%20prime%20code%20%28PMP%29&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>