CINXE.COM

Search results for: GPS code data smoothing

<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: GPS code data smoothing</title> <meta name="description" content="Search results for: GPS code data smoothing"> <meta name="keywords" content="GPS code data smoothing"> <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="GPS code data smoothing" 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="GPS code data smoothing"> <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> 26099</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: GPS code data smoothing</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26039</span> JaCoText: A Pretrained Model for Java Code-Text Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jessica%20Lopez%20Espejel">Jessica Lopez Espejel</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahaman%20Sanoussi%20Yahaya%20Alassan"> Mahaman Sanoussi Yahaya Alassan</a>, <a href="https://publications.waset.org/abstracts/search?q=Walid%20Dahhane"> Walid Dahhane</a>, <a href="https://publications.waset.org/abstracts/search?q=El%20Hassane%20Ettifouri"> El Hassane Ettifouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pretrained transformer-based models have shown high performance in natural language generation tasks. However, a new wave of interest has surged: automatic programming language code generation. This task consists of translating natural language instructions to a source code. Despite the fact that well-known pre-trained models on language generation have achieved good performance in learning programming languages, effort is still needed in automatic code generation. In this paper, we introduce JaCoText, a model based on Transformer neural network. It aims to generate java source code from natural language text. JaCoText leverages the advantages of both natural language and code generation models. More specifically, we study some findings from state of the art and use them to (1) initialize our model from powerful pre-trained models, (2) explore additional pretraining on our java dataset, (3) lead experiments combining the unimodal and bimodal data in training, and (4) scale the input and output length during the fine-tuning of the model. Conducted experiments on CONCODE dataset show that JaCoText achieves new state-of-the-art results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=java%20code%20generation" title="java code generation">java code generation</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20processing" title=" natural language processing"> natural language processing</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence-to-sequence%20models" title=" sequence-to-sequence models"> sequence-to-sequence models</a>, <a href="https://publications.waset.org/abstracts/search?q=transformer%20neural%20networks" title=" transformer neural networks"> transformer neural networks</a> </p> <a href="https://publications.waset.org/abstracts/156766/jacotext-a-pretrained-model-for-java-code-text-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156766.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">284</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">26038</span> A Characterization of Skew Cyclic Code with Complementary Dual</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eusebio%20Jr.%20Lina">Eusebio Jr. Lina</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20Nocon"> Ederlina Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cyclic codes are a fundamental subclass of linear codes that enjoy a very interesting algebraic structure. The class of skew cyclic codes (or θ-cyclic codes) is a generalization of the notion of cyclic codes. This a very large class of linear codes which can be used to systematically search for codes with good properties. A linear code with complementary dual (LCD code) is a linear code C satisfying C ∩ C^⊥ = {0}. This subclass of linear codes provides an optimum linear coding solution for a two-user binary adder channel and plays an important role in countermeasures to passive and active side-channel analyses on embedded cryptosystems. This paper aims to identify LCD codes from the class of skew cyclic codes. Let F_q be a finite field of order q, and θ be an automorphism of F_q. Some conditions for a skew cyclic code to be LCD were given. To this end, the properties of a noncommutative skew polynomial ring F_q[x, θ] of automorphism type were revisited, and the algebraic structure of skew cyclic code using its skew polynomial representation was examined. Using the result that skew cyclic codes are left ideals of the ring F_q[x, θ]/⟨x^n-1⟩, a characterization of a skew cyclic LCD code of length n was derived. A necessary condition for a skew cyclic code to be LCD was also given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LCD%20cyclic%20codes" title="LCD cyclic codes">LCD cyclic codes</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20LCD%20codes" title=" skew cyclic LCD codes"> skew cyclic LCD codes</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20complementary%20dual%20codes" title=" skew cyclic complementary dual codes"> skew cyclic complementary dual codes</a>, <a href="https://publications.waset.org/abstracts/search?q=theta-cyclic%20codes%20with%20complementary%20duals" title=" theta-cyclic codes with complementary duals"> theta-cyclic codes with complementary duals</a> </p> <a href="https://publications.waset.org/abstracts/56575/a-characterization-of-skew-cyclic-code-with-complementary-dual" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56575.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">345</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">26037</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">26036</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">26035</span> The Effect of the 2015 Revision to the Corporate Governance Code on Japanese Listed Firms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tomotaka%20Yanagida">Tomotaka Yanagida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Corporate Governance Code, revised in 2015, requires firms listed within the first and second sections of Japan’s Tokyo stock exchange to select two or more independent outside directors (the Corporate Governance Code4-8). Therefore, Japanese listed firms must do this or explain the reason why they are not able to do so. This study investigates how the Corporate Governance Code affects Japanese listed firms. We find that the Corporate Governance Code increases the ratio of outside directors by nearly 8.8% for a sample of Japanese firms comprising nearly 4,200 firm-year observations from 2014 to 2015 using a difference-in-differences approach. This implies that they felt it would have been difficult to explain why it was not appropriate to have an outside director at the annual shareholders' meeting. Moreover, this suggests that they appoint outside directors as defined by the Corporate Governance Code, but maintain board size. This situation shows that compliance in Japan may simply be 'window dressing,' that is, more form than substance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=board%20structure" title="board structure">board structure</a>, <a href="https://publications.waset.org/abstracts/search?q=comply%20or%20explain" title=" comply or explain"> comply or explain</a>, <a href="https://publications.waset.org/abstracts/search?q=corporate%20governance%20code" title=" corporate governance code"> corporate governance code</a>, <a href="https://publications.waset.org/abstracts/search?q=soft%20law" title=" soft law"> soft law</a> </p> <a href="https://publications.waset.org/abstracts/131186/the-effect-of-the-2015-revision-to-the-corporate-governance-code-on-japanese-listed-firms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131186.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">173</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26034</span> Code Switching and Language Attitudes of Two 10-11 Years Old Bilingual Child</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kristiina%20Teiss">Kristiina Teiss</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Estonians and children having Estonian as a one of their languages have lately become the fastest growing minority or bilingual group in Finland which underlines the importance of studying this target group. The acquisition of bilingualism by an infant is affected by many different issues like the child’s personal traits, language differences, and different environmental factors such as people´s attitudes towards languages and bilingualism. In the early years the most important factor is the children’s interaction with their parents and siblings. This poster gives an overview to the material and some preliminary findings of ongoing PhD study concerning code-mixing, code-switching and language attitudes of two bilingual 10-11 year old children. Data was collected from two different bilingual families, one of them living in Tampere, Finland and one of them moved during the study to Tallinn, Estonia. The data includes audio recordings of the families’ interactions with their children when they were aged 2-3 years old and then when they were 10-11 years old. The data also includes recorded semi-structured queries of the parents, as well as recorded semi-structured queries of the children when they were in the age of 10-11 years. The features of code-mixing can vary depending on norms or models in the families, or even according to its use by two parents in same family. The practices studied in the ongoing longitudinal case study, based on a framework of ethnography, contain parental conversational strategies and family attitudes as well as CS (code-switching and code-mixing) cases occurring both in children and adult language. The aim of this paper is to find out whether there is a connection between children’s attitudes and their daily language use. It would be also interesting to find some evidence, as to whether living in different countries has different impacts on using two languages. The results of dissertation maid give some directional suggestions on how language maintenance of Estonian-Finnish bilinguals could be supported, although generalizations on the base of case study could not be done. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=code%20switching" title="code switching">code switching</a>, <a href="https://publications.waset.org/abstracts/search?q=Estonian" title=" Estonian"> Estonian</a>, <a href="https://publications.waset.org/abstracts/search?q=Finnish" title=" Finnish"> Finnish</a>, <a href="https://publications.waset.org/abstracts/search?q=language%20attitudes" title=" language attitudes "> language attitudes </a> </p> <a href="https://publications.waset.org/abstracts/38639/code-switching-and-language-attitudes-of-two-10-11-years-old-bilingual-child" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38639.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">371</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">26033</span> Code Embedding for Software Vulnerability Discovery Based on Semantic Information</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joseph%20Gear">Joseph Gear</a>, <a href="https://publications.waset.org/abstracts/search?q=Yue%20Xu"> Yue Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Ernest%20Foo"> Ernest Foo</a>, <a href="https://publications.waset.org/abstracts/search?q=Praveen%20Gauravaran"> Praveen Gauravaran</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Jadidi"> Zahra Jadidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonie%20Simpson"> Leonie Simpson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Deep learning methods have been seeing an increasing application to the long-standing security research goal of automatic vulnerability detection for source code. Attention, however, must still be paid to the task of producing vector representations for source code (code embeddings) as input for these deep learning models. Graphical representations of code, most predominantly Abstract Syntax Trees and Code Property Graphs, have received some use in this task of late; however, for very large graphs representing very large code snip- pets, learning becomes prohibitively computationally expensive. This expense may be reduced by intelligently pruning this input to only vulnerability-relevant information; however, little research in this area has been performed. Additionally, most existing work comprehends code based solely on the structure of the graph at the expense of the information contained by the node in the graph. This paper proposes Semantic-enhanced Code Embedding for Vulnerability Discovery (SCEVD), a deep learning model which uses semantic-based feature selection for its vulnerability classification model. It uses information from the nodes as well as the structure of the code graph in order to select features which are most indicative of the presence or absence of vulnerabilities. This model is implemented and experimentally tested using the SARD Juliet vulnerability test suite to determine its efficacy. It is able to improve on existing code graph feature selection methods, as demonstrated by its improved ability to discover vulnerabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=code%20representation" title="code representation">code representation</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title=" deep learning"> deep learning</a>, <a href="https://publications.waset.org/abstracts/search?q=source%20code%20semantics" title=" source code semantics"> source code semantics</a>, <a href="https://publications.waset.org/abstracts/search?q=vulnerability%20discovery" title=" vulnerability discovery"> vulnerability discovery</a> </p> <a href="https://publications.waset.org/abstracts/157454/code-embedding-for-software-vulnerability-discovery-based-on-semantic-information" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157454.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">158</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">26032</span> Enhancing Code Security with AI-Powered Vulnerability Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zzibu%20Mark%20Brian">Zzibu Mark Brian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As software systems become increasingly complex, ensuring code security is a growing concern. Traditional vulnerability detection methods often rely on manual code reviews or static analysis tools, which can be time-consuming and prone to errors. This paper presents a distinct approach to enhancing code security by leveraging artificial intelligence (AI) and machine learning (ML) techniques. Our proposed system utilizes a combination of natural language processing (NLP) and deep learning algorithms to identify and classify vulnerabilities in real-world codebases. By analyzing vast amounts of open-source code data, our AI-powered tool learns to recognize patterns and anomalies indicative of security weaknesses. We evaluated our system on a dataset of over 10,000 open-source projects, achieving an accuracy rate of 92% in detecting known vulnerabilities. Furthermore, our tool identified previously unknown vulnerabilities in popular libraries and frameworks, demonstrating its potential for improving software security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AI" title="AI">AI</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20language" title=" machine language"> machine language</a>, <a href="https://publications.waset.org/abstracts/search?q=cord%20security" title=" cord security"> cord security</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20leaning" title=" machine leaning"> machine leaning</a> </p> <a href="https://publications.waset.org/abstracts/189193/enhancing-code-security-with-ai-powered-vulnerability-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189193.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">36</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">26031</span> Code – Switching in a Flipped Classroom for Foreign Students</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Tutova">E. Tutova</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Ebzeeva"> Y. Ebzeeva</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Gishkaeva"> L. Gishkaeva</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.Smirnova"> Y.Smirnova</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Dubinina"> N. Dubinina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We have been working with students from different countries and found it crucial to switch the languages to explain something. Whether it is Russian, or Chinese, explaining in a different language plays an important role for students’ cognitive abilities. In this work we are going to explore how code switching may impact the student’s perception of information. Code-switching is a tool defined by linguists as a switch from one language to another for convenience, explanation of terms unavailable in an initial language or sometimes prestige. In our case, we are going to consider code-switching from the function of convenience. As a rule, students who come to study Russian in a language environment, lack many skills in speaking the language. Thus, it is made harder to explain the rules for them of another language, which is English. That is why switching between English, Russian and Mandarin is crucial for their better understanding. In this work we are going to explore the code-switching as a tool which can help a teacher in a flipped classroom. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilingualism" title="bilingualism">bilingualism</a>, <a href="https://publications.waset.org/abstracts/search?q=psychological%20linguistics" title=" psychological linguistics"> psychological linguistics</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=social%20linguistics" title=" social linguistics"> social linguistics</a> </p> <a href="https://publications.waset.org/abstracts/163259/code-switching-in-a-flipped-classroom-for-foreign-students" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163259.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">81</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">26030</span> Enhancing the Network Security with Gray Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Adi%20Purnomo%20Sidhi">Thomas Adi Purnomo Sidhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, network is an essential need in almost every part of human daily activities. People now can seamlessly connect to others through the Internet. With advanced technology, our personal data now can be more easily accessed. One of many components we are concerned for delivering the best network is a security issue. This paper is proposing a method that provides more options for security. This research aims to improve network security by focusing on the physical layer which is the first layer of the OSI model. The layer consists of the basic networking hardware transmission technologies of a network. With the use of observation method, the research produces a schematic design for enhancing the network security through the gray code converter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=network" title="network">network</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a>, <a href="https://publications.waset.org/abstracts/search?q=grey%20code" title=" grey code"> grey code</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20layer" title=" physical layer"> physical layer</a> </p> <a href="https://publications.waset.org/abstracts/41361/enhancing-the-network-security-with-gray-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41361.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">503</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">26029</span> Optimization of Steel Moment Frame Structures Using Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Befkin">Mohammad Befkin</a>, <a href="https://publications.waset.org/abstracts/search?q=Alireza%20Momtaz"> Alireza Momtaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Structural design is the challenging aspect of every project due to limitations in dimensions, functionality of the structure, and more importantly, the allocated budget for construction. This research study aims to investigate the optimized design for three steel moment frame buildings with different number of stories using genetic algorithm code. The number and length of spans, and height of each floor were constant in all three buildings. The design of structures are carried out according to AISC code within the provisions of plastic design with allowable stress values. Genetic code for optimization is produced using MATLAB program, while buildings modeled in Opensees program and connected to the MATLAB code to perform iterations in optimization steps. In the end designs resulted from genetic algorithm code were compared with the analysis of buildings in ETABS program. The results demonstrated that suggested structural elements by the code utilize their full capacity, indicating the desirable efficiency of produced code. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20analysis" title=" structural analysis"> structural analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=steel%20moment%20frame" title=" steel moment frame"> steel moment frame</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20design" title=" structural design"> structural design</a> </p> <a href="https://publications.waset.org/abstracts/166927/optimization-of-steel-moment-frame-structures-using-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166927.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">118</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26028</span> Analyzing Students&#039; Writing in an English Code-Mixing Context in Nepali: An Ecological and Systematic Functional Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Binod%20Duwadi">Binod Duwadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article examines the language and literacy practices of English Code-mixing in Nepalese Classroom. Situating the study within an ecological framework, a systematic functional linguistic (SFL) approach was used to analyze students writing in two Neplease schools. Data collection included interviews with teachers, classroom observations, instructional materials, and focal students’ writing samples. Data analyses revealed vastly different language ecologies between the schools owing to sharp socioeconomic stratification, the structural organization of schools, and the pervasiveness of standard language ideology, with stigmatizes English code mixing (ECM) and privileges Standard English in schools. Functional analysis of students’ writing showed that the nature of the writing tasks at the schools created different affordances for exploiting lexicogrammatically choices for meaning making-enhancing them in the case of one school but severely restricting them in the case of another- perpetuating the academic disadvantage for code mixing speakers. Recommendations for structural and attitudinal changes through teacher training and implementation of approaches that engage students’ bidialectal competence for learning are made as important first steps towards addressing educational inequities in Nepalese schools. <p class="card-text"><strong>Keywords:</strong> <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=ecological%20perspective" title=" ecological perspective"> ecological perspective</a>, <a href="https://publications.waset.org/abstracts/search?q=systematic%20functional%20approach" title=" systematic functional approach"> systematic functional approach</a>, <a href="https://publications.waset.org/abstracts/search?q=language%20and%20identity" title=" language and identity"> language and identity</a> </p> <a href="https://publications.waset.org/abstracts/130320/analyzing-students-writing-in-an-english-code-mixing-context-in-nepali-an-ecological-and-systematic-functional-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130320.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">124</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">26027</span> Colour Quick Response Code with High Damage Resistance Capability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Minh%20Nguyen">Minh Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, QR or Quick Response Codes are prevalent, and mobile/smart devices can efficiently read and understand them. Therefore, we can see their appearance in many areas, such as storing web pages/websites, business phone numbers, redirecting to an app download, business location, social media. The popularity of the QR Code is mainly because of its many advantages, such as it can hold a good amount of information, is small, easy to scan and read by a general RGB camera, and it can still work with some damages on its surface. However, there are still some issues. For instance, some areas needed to be kept untouched for its successful decode (e.g., the “Finder Patterns,” the “Quiet Zone,” etc.), the capability of built-in auto-correction is not robust enough, and it is not flexible enough for many application such as Augment Reality (AR). We proposed a new Colour Quick Response Code that has several advantages over the original ones: (1) there is no untouchable area, (2) it allows up to 40% of the entire code area to be damaged, (3) it is more beneficial for Augmented Reality applications, and (4) it is back-compatible and readable by available QR Code scanners such as Pyzbar. From our experience, our Colour Quick Response Code is significantly more flexible on damage compared to the original QR Code. Our code is believed to be suitable in situations where standard 2D Barcodes fail to work, such as curved and shiny surfaces, for instance, medical blood test sample tubes and syringes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=QR%20code" title="QR code">QR code</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20vision" title=" computer vision"> computer vision</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=2D%20barcode" title=" 2D barcode"> 2D barcode</a> </p> <a href="https://publications.waset.org/abstracts/148450/colour-quick-response-code-with-high-damage-resistance-capability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148450.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">118</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26026</span> Simulation of 140 Kv X– Ray Tube by MCNP4C Code </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amin%20Sahebnasagh">Amin Sahebnasagh</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Adinehvand"> Karim Adinehvand</a>, <a href="https://publications.waset.org/abstracts/search?q=Bakhtiar%20Azadbakht"> Bakhtiar Azadbakht</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we used Monte Carlo code (MCNP4C) that is a general method, for simulation, electron source and electric field, a disc source with 0.05 cm radius in direct of anode are used, radius of disc source show focal spot of x-ray tube that here is 0.05 cm. In this simulation, anode is from tungsten with 18.9 g/cm3 density and angle of anode is 180. we simulated x-ray tube for 140 kv. For increasing of speed data acquisition we use F5 tally. With determination the exact position of F5 tally in program, outputs are acquired. In this spectrum the start point is about 0.02 Mev, the absorption edges are about 0.06 Mev and 0.07 Mev and average energy is about 0.05 Mev. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=x-spectrum" title="x-spectrum">x-spectrum</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo" title=" Monte Carlo"> Monte Carlo</a>, <a href="https://publications.waset.org/abstracts/search?q=MCNP4C%20code" title=" MCNP4C code"> MCNP4C code</a> </p> <a href="https://publications.waset.org/abstracts/23579/simulation-of-140-kv-x-ray-tube-by-mcnp4c-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23579.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">646</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">26025</span> ROOP: Translating Sequential Code Fragments to Distributed Code Fragments Using Deep Reinforcement Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arun%20Sanjel">Arun Sanjel</a>, <a href="https://publications.waset.org/abstracts/search?q=Greg%20Speegle"> Greg Speegle</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Every second, massive amounts of data are generated, and Data Intensive Scalable Computing (DISC) frameworks have evolved into effective tools for analyzing such massive amounts of data. Since the underlying architecture of these distributed computing platforms is often new to users, building a DISC application can often be time-consuming and prone to errors. The automated conversion of a sequential program to a DISC program will consequently significantly improve productivity. However, synthesizing a user’s intended program from an input specification is complex, with several important applications, such as distributed program synthesizing and code refactoring. Existing works such as Tyro and Casper rely entirely on deductive synthesis techniques or similar program synthesis approaches. Our approach is to develop a data-driven synthesis technique to identify sequential components and translate them to equivalent distributed operations. We emphasize using reinforcement learning and unit testing as feedback mechanisms to achieve our objectives. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=program%20synthesis" title="program synthesis">program synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20computing" title=" distributed computing"> distributed computing</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforcement%20learning" title=" reinforcement learning"> reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=unit%20testing" title=" unit testing"> unit testing</a>, <a href="https://publications.waset.org/abstracts/search?q=DISC" title=" DISC"> DISC</a> </p> <a href="https://publications.waset.org/abstracts/158356/roop-translating-sequential-code-fragments-to-distributed-code-fragments-using-deep-reinforcement-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158356.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">106</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">26024</span> On the Construction of Some Optimal Binary Linear Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Skezeer%20John%20B.%20Paz">Skezeer John B. Paz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20G.%20Nocon"> Ederlina G. Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n, k, d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of fixed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound. One way to find an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer in his published table on bounds of the minimum distance d of binary linear codes for 1 ≤ n ≤ 256 and k ≤ n. This was further improved by Markus Grassl by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 ≤ n ≤ 300 for k ≤ 7. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes" title="bounds of linear codes">bounds of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=Griesmer%20bound" title=" Griesmer bound"> Griesmer bound</a>, <a href="https://publications.waset.org/abstracts/search?q=construction%20of%20linear%20codes" title=" construction of linear codes"> construction of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20binary%20linear%20codes" title=" optimal binary linear codes"> optimal binary linear codes</a> </p> <a href="https://publications.waset.org/abstracts/31628/on-the-construction-of-some-optimal-binary-linear-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31628.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">755</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">26023</span> Challenges in Teaching Code of Ethics and Professional Conduct</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rasika%20Dayarathna">Rasika Dayarathna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computing has reached every corner of our lives in many forms. The Internet, particularly Social Media, Artificial Intelligence, are prominent among them. As a result, computing has changed our lives and it is expected that severe changes will take place in the coming years. It has introduced a new set of ethical challenges and amplified the existing ethical challenges. It is the duty of everyone involved from conceptualizing, designing, implementing, deploying, and using to follow generally accepted practices in order to avoid or minimize harm and improve the quality of life. Since computing in various forms mentioned above has a significant impact on our lives, various codes of conduct and standards have been introduced. Among many, the ACM (Association of Computing Machinery) Code of Ethics and Professional Conduct is a leading one. This was drafted for everyone, including aspiring computing professionals. However, teaching a code of conduct for aspiring computing professionals is very challenging since this universal code needs to be taught for young computing professionals in a local setting where there are value mismatches and exposure to information systems. This paper discusses the importance of teaching the code, how to overcome the challenges, and suggestions to improve the code to make it more appealing and buying in. It is expected that the improved approach would contribute to improving the quality of life. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=code%20of%20conduct" title="code of conduct">code of conduct</a>, <a href="https://publications.waset.org/abstracts/search?q=professionalism" title=" professionalism"> professionalism</a>, <a href="https://publications.waset.org/abstracts/search?q=ethics" title=" ethics"> ethics</a>, <a href="https://publications.waset.org/abstracts/search?q=code%20of%20ethics" title=" code of ethics"> code of ethics</a>, <a href="https://publications.waset.org/abstracts/search?q=ethics%20education" title=" ethics education"> ethics education</a>, <a href="https://publications.waset.org/abstracts/search?q=moral%20development" title=" moral development"> moral development</a> </p> <a href="https://publications.waset.org/abstracts/143823/challenges-in-teaching-code-of-ethics-and-professional-conduct" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143823.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">26022</span> Secure Content Centric Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Umair%20Aziz">Syed Umair Aziz</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Faheem"> Muhammad Faheem</a>, <a href="https://publications.waset.org/abstracts/search?q=Sameer%20Hussain"> Sameer Hussain</a>, <a href="https://publications.waset.org/abstracts/search?q=Faraz%20Idris"> Faraz Idris</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Content centric network is the network based on the mechanism of sending and receiving the data based on the interest and data request to the specified node (which has cached data). In this network, the security is bind with the content not with the host hence making it host independent and secure. In this network security is applied by taking content’s MAC (message authentication code) and encrypting it with the public key of the receiver. On the receiver end, the message is first verified and after verification message is saved and decrypted using the receiver's private key. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=content%20centric%20network" title="content centric network">content centric network</a>, <a href="https://publications.waset.org/abstracts/search?q=client-server" title=" client-server"> client-server</a>, <a href="https://publications.waset.org/abstracts/search?q=host%20security%20threats" title=" host security threats"> host security threats</a>, <a href="https://publications.waset.org/abstracts/search?q=message%20authentication%20code" title=" message authentication code"> message authentication code</a>, <a href="https://publications.waset.org/abstracts/search?q=named%20data%20network" title=" named data network"> named data network</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20caching" title=" network caching"> network caching</a>, <a href="https://publications.waset.org/abstracts/search?q=peer-to-peer" title=" peer-to-peer"> peer-to-peer</a> </p> <a href="https://publications.waset.org/abstracts/32149/secure-content-centric-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32149.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">644</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">26021</span> Orthogonal Regression for Nonparametric Estimation of Errors-In-Variables Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anastasiia%20Yu.%20Timofeeva">Anastasiia Yu. Timofeeva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two new algorithms for nonparametric estimation of errors-in-variables models are proposed. The first algorithm is based on penalized regression spline. The spline is represented as a piecewise-linear function and for each linear portion orthogonal regression is estimated. This algorithm is iterative. The second algorithm involves locally weighted regression estimation. When the independent variable is measured with error such estimation is a complex nonlinear optimization problem. The simulation results have shown the advantage of the second algorithm under the assumption that true smoothing parameters values are known. Nevertheless the use of some indexes of fit to smoothing parameters selection gives the similar results and has an oversmoothing effect. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grade%20point%20average" title="grade point average">grade point average</a>, <a href="https://publications.waset.org/abstracts/search?q=orthogonal%20regression" title=" orthogonal regression"> orthogonal regression</a>, <a href="https://publications.waset.org/abstracts/search?q=penalized%20regression%20spline" title=" penalized regression spline"> penalized regression spline</a>, <a href="https://publications.waset.org/abstracts/search?q=locally%20weighted%20regression" title=" locally weighted regression"> locally weighted regression</a> </p> <a href="https://publications.waset.org/abstracts/11927/orthogonal-regression-for-nonparametric-estimation-of-errors-in-variables-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11927.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">416</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">26020</span> Investigation of the Capability of REALP5 to Solve Complex Fuel Geometry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20Abdelrazek">D. Abdelrazek</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20NaguibAly"> M. NaguibAly</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20Badawi"> A. A. Badawi</a>, <a href="https://publications.waset.org/abstracts/search?q=Asmaa%20G.%20Abo%20Elnour"> Asmaa G. Abo Elnour</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20El-Kafas"> A. A. El-Kafas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work is developed within IAEA Coordinated Research Program 1496, “Innovative methods in research reactor analysis: Benchmark against experimental data on neutronics and thermal-hydraulic computational methods and tools for operation and safety analysis of research reactors.” The study investigates the capability of Code RELAP5/Mod3.4 to solve complex geometry complexity. Its results are compared to the results of PARET, a common code in thermal hydraulic analysis for research reactors, belonging to MTR-PC groups. The WWR-SM reactor at the Institute of Nuclear Physics (INP) in the Republic of Uzbekistan is simulated using both PARET and RELAP5 at steady state. Results from the two codes are compared. REALP5 code succeeded in solving the complex fuel geometry. The PARET code needed some calculations to obtain the final result. Although the final results from the PARET are more accurate, the small differences in both results makes using RELAP5 code recommended in case of complex fuel assemblies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complex%20fuel%20geometry" title="complex fuel geometry">complex fuel geometry</a>, <a href="https://publications.waset.org/abstracts/search?q=PARET" title=" PARET"> PARET</a>, <a href="https://publications.waset.org/abstracts/search?q=RELAP5" title=" RELAP5"> RELAP5</a>, <a href="https://publications.waset.org/abstracts/search?q=WWR-SM%20reactor" title=" WWR-SM reactor"> WWR-SM reactor</a> </p> <a href="https://publications.waset.org/abstracts/4164/investigation-of-the-capability-of-realp5-to-solve-complex-fuel-geometry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4164.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">333</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">26019</span> Forecasting Model for Rainfall in Thailand: Case Study Nakhon Ratchasima Province</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Sopipan">N. Sopipan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we study of rainfall time series of weather stations in Nakhon Ratchasima province in Thailand using various statistical methods enabled to analyse the behaviour of rainfall in the study areas. Time-series analysis is an important tool in modelling and forecasting rainfall. ARIMA and Holt-Winter models based on exponential smoothing were built. All the models proved to be adequate. Therefore, could give information that can help decision makers establish strategies for proper planning of agriculture, drainage system and other water resource applications in Nakhon Ratchasima province. We found the best perform for forecasting is ARIMA(1,0,1)(1,0,1)12. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ARIMA%20Models" title="ARIMA Models">ARIMA Models</a>, <a href="https://publications.waset.org/abstracts/search?q=exponential%20smoothing" title=" exponential smoothing"> exponential smoothing</a>, <a href="https://publications.waset.org/abstracts/search?q=Holt-Winter%20model" title=" Holt-Winter model"> Holt-Winter model</a> </p> <a href="https://publications.waset.org/abstracts/14834/forecasting-model-for-rainfall-in-thailand-case-study-nakhon-ratchasima-province" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14834.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">300</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">26018</span> Jopara: Conversational Code Switching Between Spanish and Guarani a Sociolinguistic Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maria%20Alejandra%20Mareco">Maria Alejandra Mareco</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to explore a communicative strategy used by Guaraní-Spanish bilingual speakers. It will be presented in English or Spanish. This strategy is conversational code-switching, which is used by people from rural as well as urban areas in Formosa, Argentina and Paraguay. Guarani is an Aboriginal Language that is the official language in Paraguay. Code-switching is a language-processing phenomenon that creates communicative and social meaning in a given community. This paper poses a broad question at the onset of this study: Spanish-Guaraní speakers tend to use four different conversational code-switching patterns in their oral alternations, these four categories being: quotation, addressee specification, reiteration, and interjections. Later, spoken data were prioritized in terms of their importance and potential impact on the hypothesis outlined. Different groups of people were observed in real-world settings. They consisted of fourteen proficient Spanish Guaraní bilingual speakers from different social groups and ages. Afterward, a group of informants was chosen to obtain a wide range of natural encounters. Informants were observed with special attention to their natural communication, particularly oral interactions. Furthermore, the relationship between interlocutors during code-switching, as based on a negotiation between them, was considered of most relevance. Results were evaluated according to the interpretative method by testing the co-occurrence of the four conversational categories described above. The testing instruments identified that the four aspects of Spanish Guaraní code-switching introduced above were applied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilingualism" title="bilingualism">bilingualism</a>, <a href="https://publications.waset.org/abstracts/search?q=code%20switching" title=" code switching"> code switching</a>, <a href="https://publications.waset.org/abstracts/search?q=aboriginal%20language" title=" aboriginal language"> aboriginal language</a>, <a href="https://publications.waset.org/abstracts/search?q=language%20contact" title=" language contact"> language contact</a> </p> <a href="https://publications.waset.org/abstracts/194124/jopara-conversational-code-switching-between-spanish-and-guarani-a-sociolinguistic-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194124.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">5</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26017</span> The Effect of the Vernacular on Code-Switching Hebrew into Palestinian Arabic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ward%20Makhoul">Ward Makhoul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Code-switching (CS) is known as a ubiquitous phenomenon in multilingual societies and countries. Vernacular Palestinian Arabic (PA) variety spoken in Israel is among these languages, informally used for day-to-day conversations only. Such conversations appear to contain code-switched instances from Hebrew, the formal and dominant language of the country, even in settings where the need for CS seems to be unnecessary. This study examines the CS practices in PA and investigates the reason behind these CS instances in controlled settings and the correlation between bilingual dominance and CS. In the production-task interviews and Bilingual Language Profile test (BLP), there was a correlation between language dominance and CS; 13 participants were interviewed to elicit and analyze natural speech-containing CS instances, along with undergoing a BLP test. The acceptability judgment task observed the limits and boundaries of different code-switched linguistic structures. <p class="card-text"><strong>Keywords:</strong> <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=Hebrew" title=" Hebrew"> Hebrew</a>, <a href="https://publications.waset.org/abstracts/search?q=Palestinian-Arabic" title=" Palestinian-Arabic"> Palestinian-Arabic</a>, <a href="https://publications.waset.org/abstracts/search?q=vernacular" title=" vernacular"> vernacular</a> </p> <a href="https://publications.waset.org/abstracts/158189/the-effect-of-the-vernacular-on-code-switching-hebrew-into-palestinian-arabic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158189.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">118</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26016</span> Parallel Vector Processing Using Multi Level Orbital DATA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nagi%20Mekhiel">Nagi Mekhiel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many applications use vector operations by applying single instruction to multiple data that map to different locations in conventional memory. Transferring data from memory is limited by access latency and bandwidth affecting the performance gain of vector processing. We present a memory system that makes all of its content available to processors in time so that processors need not to access the memory, we force each location to be available to all processors at a specific time. The data move in different orbits to become available to other processors in higher orbits at different time. We use this memory to apply parallel vector operations to data streams at first orbit level. Data processed in the first level move to upper orbit one data element at a time, allowing a processor in that orbit to apply another vector operation to deal with serial code limitations inherited in all parallel applications and interleaved it with lower level vector operations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Memory%20Organization" title="Memory Organization">Memory Organization</a>, <a href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors" title=" Parallel Processors"> Parallel Processors</a>, <a href="https://publications.waset.org/abstracts/search?q=Serial%0D%0ACode" title=" Serial Code"> Serial Code</a>, <a href="https://publications.waset.org/abstracts/search?q=Vector%20Processing" title=" Vector Processing"> Vector Processing</a> </p> <a href="https://publications.waset.org/abstracts/59115/parallel-vector-processing-using-multi-level-orbital-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59115.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">270</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">26015</span> Methodology for Temporary Analysis of Production and Logistic Systems on the Basis of Distance Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Mueller">M. Mueller</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Kuehn"> M. Kuehn</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Voelker"> M. Voelker</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In small and medium-sized enterprises (SMEs), the challenge is to create a well-grounded and reliable basis for process analysis, optimization and planning due to a lack of data. SMEs have limited access to methods with which they can effectively and efficiently analyse processes and identify cause-and-effect relationships in order to generate the necessary database and derive optimization potential from it. The implementation of digitalization within the framework of Industry 4.0 thus becomes a particular necessity for SMEs. For these reasons, the abstract presents an analysis methodology that is subject to the objective of developing an SME-appropriate methodology for efficient, temporarily feasible data collection and evaluation in flexible production and logistics systems as a basis for process analysis and optimization. The overall methodology focuses on retrospective, event-based tracing and analysis of material flow objects. The technological basis consists of Bluetooth low energy (BLE)-based transmitters, so-called beacons, and smart mobile devices (SMD), e.g. smartphones as receivers, between which distance data can be measured and derived motion profiles. The distance is determined using the Received Signal Strength Indicator (RSSI), which is a measure of signal field strength between transmitter and receiver. The focus is the development of a software-based methodology for interpretation of relative movements of transmitters and receivers based on distance data. The main research is on selection and implementation of pattern recognition methods for automatic process recognition as well as methods for the visualization of relative distance data. Due to an existing categorization of the database regarding process types, classification methods (e.g. Support Vector Machine) from the field of supervised learning are used. The necessary data quality requires selection of suitable methods as well as filters for smoothing occurring signal variations of the RSSI, the integration of methods for determination of correction factors depending on possible signal interference sources (columns, pallets) as well as the configuration of the used technology. The parameter settings on which respective algorithms are based have a further significant influence on result quality of the classification methods, correction models and methods for visualizing the position profiles used. The accuracy of classification algorithms can be improved up to 30% by selected parameter variation; this has already been proven in studies. Similar potentials can be observed with parameter variation of methods and filters for signal smoothing. Thus, there is increased interest in obtaining detailed results on the influence of parameter and factor combinations on data quality in this area. The overall methodology is realized with a modular software architecture consisting of independently modules for data acquisition, data preparation and data storage. The demonstrator for initialization and data acquisition is available as mobile Java-based application. The data preparation, including methods for signal smoothing, are Python-based with the possibility to vary parameter settings and to store them in the database (SQLite). The evaluation is divided into two separate software modules with database connection: the achievement of an automated assignment of defined process classes to distance data using selected classification algorithms and the visualization as well as reporting in terms of a graphical user interface (GUI). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=event-based%20tracing" title="event-based tracing">event-based tracing</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20classification" title=" process classification"> process classification</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20settings" title=" parameter settings"> parameter settings</a>, <a href="https://publications.waset.org/abstracts/search?q=RSSI" title=" RSSI"> RSSI</a>, <a href="https://publications.waset.org/abstracts/search?q=signal%20smoothing" title=" signal smoothing"> signal smoothing</a> </p> <a href="https://publications.waset.org/abstracts/103906/methodology-for-temporary-analysis-of-production-and-logistic-systems-on-the-basis-of-distance-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103906.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">26014</span> New Result for Optical OFDM in Code Division Multiple Access Systems Using Direct Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cherifi%20Abdelhamid">Cherifi Abdelhamid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In optical communication systems, OFDM has received increased attention as a means to overcome various limitations of optical transmission systems such as modal dispersion, relative intensity noise, chromatic dispersion, polarization mode dispersion and self-phase modulation. The multipath dispersion limits the maximum transmission data rates. In this paper we investigate OFDM system where multipath induced intersymbol interference (ISI) is reduced and we increase the number of users by combining OFDM system with OCDMA system using direct detection Incorporate OOC (orthogonal optical code) for minimize a bit error rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDM" title="OFDM">OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OOC%20%28orthogonal%20optical%20code%29" title=" OOC (orthogonal optical code)"> OOC (orthogonal optical code)</a>, <a href="https://publications.waset.org/abstracts/search?q=%28ISI%29" title=" (ISI)"> (ISI)</a>, <a href="https://publications.waset.org/abstracts/search?q=prim%20codes%20%28Pc%29" title=" prim codes (Pc)"> prim codes (Pc)</a> </p> <a href="https://publications.waset.org/abstracts/19156/new-result-for-optical-ofdm-in-code-division-multiple-access-systems-using-direct-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19156.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">652</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">26013</span> Energy Efficiency in Hot Arid Climates Code Compliance and Enforcement for Residential Buildings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Edesy">Mohamed Edesy</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlo%20Cecere"> Carlo Cecere</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is a part of an ongoing research that proposes energy strategies for residential buildings in hot arid climates. In Egypt, the residential sector is dominated by increase in consumption rates annually. A building energy efficiency code was introduced by the government in 2005; it indicates minimum design and application requirements for residential buildings. Submission is mandatory and should lead to about 20% energy savings with an increase in comfort levels. However, compliance is almost nonexistent, electricity is subsidized and incentives to adopt energy efficient patterns are very low. This work presents an overview of the code and analyzes the impact of its introduction on different sectors. It analyses compliance barriers and indicates challenges that stand in the way of a realistic enforcement. It proposes an action plan for immediate code enforcement, updating current code to include retrofit, and development of rating systems for buildings. This work presents a broad national plan for energy efficiency empowerment in the residential sector. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy%20efficiency" title="energy efficiency">energy efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=housing" title=" housing"> housing</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20policies" title=" energy policies"> energy policies</a>, <a href="https://publications.waset.org/abstracts/search?q=code%20enforcement" title=" code enforcement"> code enforcement</a> </p> <a href="https://publications.waset.org/abstracts/42744/energy-efficiency-in-hot-arid-climates-code-compliance-and-enforcement-for-residential-buildings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42744.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">347</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">26012</span> Upon One Smoothing Problem in Project Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitri%20Golenko-Ginzburg">Dimitri Golenko-Ginzburg</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A CPM network project with deterministic activity durations, in which activities require homogenous resources with fixed capacities, is considered. The problem is to determine the optimal schedule of starting times for all network activities within their maximal allowable limits (in order not to exceed the network's critical time) to minimize the maximum required resources for the project at any point in time. In case when a non-critical activity may start only at discrete moments with the pregiven time span, the problem becomes NP-complete and an optimal solution may be obtained via a look-over algorithm. For the case when a look-over requires much computational time an approximate algorithm is suggested. The algorithm's performance ratio, i.e., the relative accuracy error, is determined. Experimentation has been undertaken to verify the suggested algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=resource%20smoothing%20problem" title="resource smoothing problem">resource smoothing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=CPM%20network" title=" CPM network"> CPM network</a>, <a href="https://publications.waset.org/abstracts/search?q=lookover%20algorithm" title=" lookover algorithm"> lookover algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=lexicographical%20order" title=" lexicographical order"> lexicographical order</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20algorithm" title=" approximate algorithm"> approximate algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=accuracy%20estimate" title=" accuracy estimate"> accuracy estimate</a> </p> <a href="https://publications.waset.org/abstracts/15779/upon-one-smoothing-problem-in-project-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15779.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">302</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">26011</span> Simulation of Hamming Coding and Decoding for Microcontroller Radiation Hardening</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rehab%20I.%20Abdul%20Rahman">Rehab I. Abdul Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=Mazhar%20B.%20Tayel"> Mazhar B. Tayel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a method of hardening the 8051 microcontroller, that able to assure reliable operation in the presence of bit flips caused by radiation. Aiming at avoiding such faults in the 8051 microcontroller, Hamming code protection was used in its SRAM memory and registers. A VHDL code and its simulation have been used for this hamming code protection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=radiation" title="radiation">radiation</a>, <a href="https://publications.waset.org/abstracts/search?q=hardening" title=" hardening"> hardening</a>, <a href="https://publications.waset.org/abstracts/search?q=bitflip" title=" bitflip"> bitflip</a>, <a href="https://publications.waset.org/abstracts/search?q=hamming" title=" hamming"> hamming</a> </p> <a href="https://publications.waset.org/abstracts/20963/simulation-of-hamming-coding-and-decoding-for-microcontroller-radiation-hardening" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20963.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">499</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">26010</span> The Concentration Analysis of CO2 Using ALOHA Code for Kuosheng Nuclear Power Plant</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=W.%20S.%20Hsu">W. S. Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Chiang"> Y. Chiang</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20C.%20Chen"> H. C. Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20R.%20Wang"> J. R. Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20W.%20Chen"> S. W. Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20H.%20Yang"> J. H. Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Shih"> C. Shih </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Not only radiation materials, but also the normal chemical material stored in the power plant can cause a risk to the residents. In this research, the ALOHA code was used to perform the concentration analysis under the CO<sub>2</sub> storage burst or leakage conditions for Kuosheng nuclear power plant (NPP). The Final Safety Analysis Report (FSAR) and data were used in this study. Additionally, the analysis results of ALOHA code were compared with the R.G. 1.78 failure criteria in order to confirm the control room habitability. The comparison results show that the ALOHA result for burst case was 0.923 g/m<sup>3</sup> which was below the criteria. However, the ALOHA results for leakage case was 11.3 g/m<sup>3</sup>. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=BWR" title="BWR">BWR</a>, <a href="https://publications.waset.org/abstracts/search?q=ALOHA" title=" ALOHA"> ALOHA</a>, <a href="https://publications.waset.org/abstracts/search?q=habitability" title=" habitability"> habitability</a>, <a href="https://publications.waset.org/abstracts/search?q=Kuosheng" title=" Kuosheng"> Kuosheng</a> </p> <a href="https://publications.waset.org/abstracts/89156/the-concentration-analysis-of-co2-using-aloha-code-for-kuosheng-nuclear-power-plant" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89156.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">359</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=2" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=2">2</a></li> <li class="page-item active"><span class="page-link">3</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;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=GPS%20code%20data%20smoothing&amp;page=869">869</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=870">870</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=GPS%20code%20data%20smoothing&amp;page=4" 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">&copy; 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">&times;</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>

Pages: 1 2 3 4 5 6 7 8 9 10