CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: web server</title> <meta name="description" content="Search results for: web server"> <meta name="keywords" content="web server"> <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="web server" 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="web server"> <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> 294</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: web server</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">294</span> On Four Models of a Three Server Queue with Optional Server Vacations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kailash%20C.%20Madan">Kailash C. Madan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study four models of a three server queueing system with Bernoulli schedule optional server vacations. Customers arriving at the system one by one in a Poisson process are provided identical exponential service by three parallel servers according to a first-come, first served queue discipline. In model A, all three servers may be allowed a vacation at one time, in Model B at the most two of the three servers may be allowed a vacation at one time, in model C at the most one server is allowed a vacation, and in model D no server is allowed a vacation. We study steady the state behavior of the four models and obtain steady state probability generating functions for the queue size at a random point of time for all states of the system. In model D, a known result for a three server queueing system without server vacations is derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=a%20three%20server%20queue" title="a three server queue">a three server queue</a>, <a href="https://publications.waset.org/abstracts/search?q=Bernoulli%20schedule%20server%20vacations" title=" Bernoulli schedule server vacations"> Bernoulli schedule server vacations</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20size%20distribution%20at%20a%20random%20epoch" title=" queue size distribution at a random epoch"> queue size distribution at a random epoch</a>, <a href="https://publications.waset.org/abstracts/search?q=steady%20state" title=" steady state"> steady state</a> </p> <a href="https://publications.waset.org/abstracts/50668/on-four-models-of-a-three-server-queue-with-optional-server-vacations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50668.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">296</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">293</span> Client Hacked Server</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bagul%20Abhijeet">Bagul Abhijeet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Client-Server model is the backbone of today’s internet communication. In which normal user can not have control over particular website or server? By using the same processing model one can have unauthorized access to particular server. In this paper, we discussed about application scenario of hacking for simple website or server consist of unauthorized way to access the server database. This application emerges to autonomously take direct access of simple website or server and retrieve all essential information maintain by administrator. In this system, IP address of server given as input to retrieve user-id and password of server. This leads to breaking administrative security of server and acquires the control of server database. Whereas virus helps to escape from server security by crashing the whole server. Objective: To control malicious attack and preventing all government website, and also find out illegal work to do hackers activity. Results: After implementing different hacking as well as non-hacking techniques, this system hacks simple web sites with normal security credentials. It provides access to server database and allow attacker to perform database operations from client machine. Above Figure shows the experimental result of this application upon different servers and provides satisfactory results as required. Conclusion: In this paper, we have presented a to view to hack the server which include some hacking as well as non-hacking methods. These algorithms and methods provide efficient way to hack server database. By breaking the network security allow to introduce new and better security framework. The terms “Hacking” not only consider for its illegal activities but also it should be use for strengthen our global network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hacking" title="Hacking">Hacking</a>, <a href="https://publications.waset.org/abstracts/search?q=Vulnerabilities" title=" Vulnerabilities"> Vulnerabilities</a>, <a href="https://publications.waset.org/abstracts/search?q=Dummy%20request" title=" Dummy request"> Dummy request</a>, <a href="https://publications.waset.org/abstracts/search?q=Virus" title=" Virus"> Virus</a>, <a href="https://publications.waset.org/abstracts/search?q=Server%20monitoring" title=" Server monitoring"> Server monitoring</a> </p> <a href="https://publications.waset.org/abstracts/36777/client-hacked-server" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36777.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">251</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">292</span> Computer Server Virtualization </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pradeep%20M.%20C.%20Chand">Pradeep M. C. Chand </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Virtual infrastructure initiatives often spring from data center server consolidation projects, which focus on reducing existing infrastructure “box count”, retiring older hardware or life-extending legacy applications. Server consolidation benefits result from a reduction in the overall number of systems and related recurring costs (power, cooling, rack space, etc.) and also helps in the reduction of heat to the environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=server%20virtualization" title="server virtualization">server virtualization</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20center" title=" data center"> data center</a>, <a href="https://publications.waset.org/abstracts/search?q=consolidation" title=" consolidation"> consolidation</a>, <a href="https://publications.waset.org/abstracts/search?q=project" title=" project"> project</a> </p> <a href="https://publications.waset.org/abstracts/20268/computer-server-virtualization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20268.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">530</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">291</span> A Non-Invasive Blood Glucose Monitoring System Using near-Infrared Spectroscopy with Remote Data Logging</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bodhayan%20Nandi">Bodhayan Nandi</a>, <a href="https://publications.waset.org/abstracts/search?q=Shubhajit%20Roy%20Chowdhury"> Shubhajit Roy Chowdhury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the development of a portable blood glucose monitoring device based on Near-Infrared Spectroscopy. The system supports Internet connectivity through WiFi and uploads the time series data of glucose concentration of patients to a server. In addition, the server is given sufficient intelligence to predict the future pathophysiological state of a patient given the current and past pathophysiological data. This will enable to prognosticate the approaching critical condition of the patient much before the critical condition actually occurs.The server hosts web applications to allow authorized users to monitor the data remotely. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non%20invasive" title="non invasive">non invasive</a>, <a href="https://publications.waset.org/abstracts/search?q=blood%20glucose%20concentration" title=" blood glucose concentration"> blood glucose concentration</a>, <a href="https://publications.waset.org/abstracts/search?q=microcontroller" title=" microcontroller"> microcontroller</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=application%20server" title=" application server"> application server</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20server" title=" database server"> database server</a> </p> <a href="https://publications.waset.org/abstracts/85488/a-non-invasive-blood-glucose-monitoring-system-using-near-infrared-spectroscopy-with-remote-data-logging" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85488.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">218</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">290</span> Automated Server Configuration Management using Ansible</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kartik%20Mahajan">Kartik Mahajan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> DevOps methodologies streamline software development and operations, promoting collaboration and automation. Traditional server management often relies on manual, repetitive tasks, leading to inefficiencies, potential errors, and increased operational costs. Ansible, as a configuration management tool, presents a compelling solution for automating infrastructure management processes. This review paper explores the implementation and testing of Ansible for server management, specifically focusing on automated user account configuration. By replacing manual procedures with Ansible playbooks, we aim to optimize server management, reduce human error, and potentially mitigate operational expenses. This study offers insights into Ansible’s efficacy within a DevOps context, highlighting its potential to transform server administration practices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud" title="cloud">cloud</a>, <a href="https://publications.waset.org/abstracts/search?q=Devops" title=" Devops"> Devops</a>, <a href="https://publications.waset.org/abstracts/search?q=automation" title=" automation"> automation</a>, <a href="https://publications.waset.org/abstracts/search?q=ansible" title=" ansible"> ansible</a> </p> <a href="https://publications.waset.org/abstracts/184587/automated-server-configuration-management-using-ansible" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184587.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">44</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">289</span> Performance Evaluation of a Prioritized, Limited Multi-Server Processor-Sharing System that Includes Servers with Various Capacities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yoshiaki%20Shikata">Yoshiaki Shikata</a>, <a href="https://publications.waset.org/abstracts/search?q=Nobutane%20Hanayama"> Nobutane Hanayama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a prioritized, limited multi-server processor sharing (PS) system where each server has various capacities, and N (≥2) priority classes are allowed in each PS server. In each prioritized, limited server, different service ratio is assigned to each class request, and the number of requests to be processed is limited to less than a certain number. Routing strategies of such prioritized, limited multi-server PS systems that take into account the capacity of each server are also presented, and a performance evaluation procedure for these strategies is discussed. Practical performance measures of these strategies, such as loss probability, mean waiting time, and mean sojourn time, are evaluated via simulation. In the PS server, at the arrival (or departure) of a request, the extension (shortening) of the remaining sojourn time of each request receiving service can be calculated by using the number of requests of each class and the priority ratio. Utilising a simulation program which executes these events and calculations, the performance of the proposed prioritized, limited multi-server PS rule can be analyzed. From the evaluation results, most suitable routing strategy for the loss or waiting system is clarified. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=processor%20sharing" title="processor sharing">processor sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-server" title=" multi-server"> multi-server</a>, <a href="https://publications.waset.org/abstracts/search?q=various%20capacity" title=" various capacity"> various capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=N-priority%20classes" title=" N-priority classes"> N-priority classes</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20strategy" title=" routing strategy"> routing strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=loss%20probability" title=" loss probability"> loss probability</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20sojourn%20time" title=" mean sojourn time"> mean sojourn time</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20waiting%20time" title=" mean waiting time"> mean waiting time</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/45569/performance-evaluation-of-a-prioritized-limited-multi-server-processor-sharing-system-that-includes-servers-with-various-capacities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45569.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">331</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">288</span> Autonomic Recovery Plan with Server Virtualization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Hameed">S. Hameed</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Anwer"> S. Anwer</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Saad"> M. Saad</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Saady"> M. Saady</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For autonomic recovery with server virtualization, a cogent plan that includes recovery techniques and backups with virtualized servers can be developed instead of assigning an idle server to backup operations. In addition to hardware cost reduction and data center trail, the disaster recovery plan can ensure system uptime and to meet objectives of high availability, recovery time, recovery point, server provisioning, and quality of services. This autonomic solution would also support disaster management, testing, and development of the recovery site. In this research, a workflow plan is proposed for supporting disaster recovery with virtualization providing virtual monitoring, requirements engineering, solution decision making, quality testing, and disaster management. This recovery model would make disaster recovery a lot easier, faster, and less error prone. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomous%20intelligence" title="autonomous intelligence">autonomous intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=disaster%20recovery" title=" disaster recovery"> disaster recovery</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=server%20virtualization" title=" server virtualization"> server virtualization</a> </p> <a href="https://publications.waset.org/abstracts/129654/autonomic-recovery-plan-with-server-virtualization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129654.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">162</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">287</span> Privacy-Preserving Location Sharing System with Client/Server Architecture in Mobile Online Social Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xi%20Xiao">Xi Xiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Chunhui%20Chen"> Chunhui Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinyu%20Liu"> Xinyu Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Guangwu%20Hu"> Guangwu Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong%20Jiang"> Yong Jiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Location sharing is a fundamental service in mobile Online Social Networks (mOSNs), which raises significant privacy concerns in recent years. Now, most location-based service applications adopt client/server architecture. In this paper, a location sharing system, named CSLocShare, is presented to provide flexible privacy-preserving location sharing with client/server architecture in mOSNs. CSLocShare enables location sharing between both trusted social friends and untrusted strangers without the third-party server. In CSLocShare, Location-Storing Social Network Server (LSSNS) provides location-based services but do not know the users’ real locations. The thorough analysis indicates that the users’ location privacy is protected. Meanwhile, the storage and the communication cost are saved. CSLocShare is more suitable and effective in reality. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20online%20social%20networks" title="mobile online social networks">mobile online social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=client%2Fserver%20architecture" title=" client/server architecture"> client/server architecture</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20sharing" title=" location sharing"> location sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy-preserving" title=" privacy-preserving"> privacy-preserving</a> </p> <a href="https://publications.waset.org/abstracts/57662/privacy-preserving-location-sharing-system-with-clientserver-architecture-in-mobile-online-social-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57662.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">330</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">286</span> Analysis of the Unreliable M/G/1 Retrial Queue with Impatient Customers and Server Vacation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fazia%20Rahmoune">Fazia Rahmoune</a>, <a href="https://publications.waset.org/abstracts/search?q=Sofiane%20Ziani"> Sofiane Ziani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Retrial queueing systems have been extensively used to stochastically model many problems arising in computer networks, telecommunication, telephone systems, among others. In this work, we consider a $M/G/1$ retrial queue with an unreliable server with random vacations and two types of primary customers, persistent and impatient. This model involves the unreliability of the server, which can be subject to physical breakdowns and takes into account the correctives maintenances for restoring the service when a failure occurs. On the other hand, we consider random vacations, which can model the preventives maintenances for improving system performances and preventing breakdowns. We give the necessary and sufficient stability condition of the system. Then, we obtain the joint probability distribution of the server state and the number of customers in orbit and derive the more useful performance measures analytically. Moreover, we also analyze the busy period of the system. Finally, we derive the stability condition and the generating function of the stationary distribution of the number of customers in the system when there is no vacations and impatient customers, and when there is no vacations, server failures and impatient customers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modeling" title="modeling">modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=retrial%20queue" title=" retrial queue"> retrial queue</a>, <a href="https://publications.waset.org/abstracts/search?q=unreliable%20server" title=" unreliable server"> unreliable server</a>, <a href="https://publications.waset.org/abstracts/search?q=vacation" title=" vacation"> vacation</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20analysis" title=" stochastic analysis"> stochastic analysis</a> </p> <a href="https://publications.waset.org/abstracts/109241/analysis-of-the-unreliable-mg1-retrial-queue-with-impatient-customers-and-server-vacation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109241.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">186</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">285</span> Reliability Analysis of Computer Centre at Yobe State University Nigeria under Different Repair Policies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijay%20Vir%20Singh">Vijay Vir Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we focus on the reliability and performance analysis of Computer Centre (CC) at Yobe State University, Damaturu, Nigeria. The CC consists of three servers: one database mail server, one redundant and one for sharing with the client computers in the CC (called as local server). Observing the different possibilities of functioning of the CC, analysis has been done to evaluate the various reliability characteristics of the system. The system can completely fail due to failure of router, redundant server before repairing the mail server, and switch failure. The system can also partially fail when local server fails. The system can also fail completely due to a cooling failure, electricity failure or some natural calamity like earthquake, fire etc. All the failure rates are assumed to be constant while repair follows two types of distributions: general and Gumbel-Hougaard family copula. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=availability%20Gumbel-Hougaard%20family%20copula" title=" availability Gumbel-Hougaard family copula"> availability Gumbel-Hougaard family copula</a>, <a href="https://publications.waset.org/abstracts/search?q=MTTF" title=" MTTF"> MTTF</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20data%20centre" title=" internet data centre "> internet data centre </a> </p> <a href="https://publications.waset.org/abstracts/32380/reliability-analysis-of-computer-centre-at-yobe-state-university-nigeria-under-different-repair-policies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32380.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">461</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">284</span> Hardware Error Analysis and Severity Characterization in Linux-Based Server Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nikolaos%20Georgoulopoulos">Nikolaos Georgoulopoulos</a>, <a href="https://publications.waset.org/abstracts/search?q=Alkis%20Hatzopoulos"> Alkis Hatzopoulos</a>, <a href="https://publications.waset.org/abstracts/search?q=Konstantinos%20Karamitsios"> Konstantinos Karamitsios</a>, <a href="https://publications.waset.org/abstracts/search?q=Konstantinos%20Kotrotsios"> Konstantinos Kotrotsios</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexandros%20I.%20Metsai"> Alexandros I. Metsai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In modern server systems, business critical applications run in different types of infrastructure, such as cloud systems, physical machines and virtualization. Often, due to high load and over time, various hardware faults occur in servers that translate to errors, resulting to malfunction or even server breakdown. CPU, RAM and hard drive (HDD) are the hardware parts that concern server administrators the most regarding errors. In this work, selected RAM, HDD and CPU errors, that have been observed or can be simulated in kernel ring buffer log files from two groups of Linux servers, are investigated. Moreover, a severity characterization is given for each error type. Better understanding of such errors can lead to more efficient analysis of kernel logs that are usually exploited for fault diagnosis and prediction. In addition, this work summarizes ways of simulating hardware errors in RAM and HDD, in order to test the error detection and correction mechanisms of a Linux server. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hardware%20errors" title="hardware errors">hardware errors</a>, <a href="https://publications.waset.org/abstracts/search?q=Kernel%20logs" title=" Kernel logs"> Kernel logs</a>, <a href="https://publications.waset.org/abstracts/search?q=Linux%20servers" title=" Linux servers"> Linux servers</a>, <a href="https://publications.waset.org/abstracts/search?q=RAM" title=" RAM"> RAM</a>, <a href="https://publications.waset.org/abstracts/search?q=hard%20disk" title=" hard disk"> hard disk</a>, <a href="https://publications.waset.org/abstracts/search?q=CPU" title=" CPU"> CPU</a> </p> <a href="https://publications.waset.org/abstracts/140496/hardware-error-analysis-and-severity-characterization-in-linux-based-server-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140496.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">154</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">283</span> An Internet of Things Based Home Automation Based on Raspberry Pi and Node JS Server</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Khattab">Ahmed Khattab</a>, <a href="https://publications.waset.org/abstracts/search?q=Bassem%20Shetta"> Bassem Shetta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, there are many branches of technology, one of them is the internet of things. In this paper, it's focused specifically on automating all the home appliances through E-mail using Node JS server, the server side stores, and processes this data. The server side contains user interface and notification system functionalities which is operated by Raspberry Pi. It will present the security requirements for the smart home. In this application, the privilege of home control including special persons to use it, using the hardware appliances through mobiles and tablets is achieved. The proposed application delivers high quality of service, long lifetime, low maintenance, fast deployment, and low power requirements with low cost needed for development. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raspberry%20Pi" title="Raspberry Pi">Raspberry Pi</a>, <a href="https://publications.waset.org/abstracts/search?q=E-mail" title=" E-mail"> E-mail</a>, <a href="https://publications.waset.org/abstracts/search?q=home%20automation" title=" home automation"> home automation</a>, <a href="https://publications.waset.org/abstracts/search?q=temperature%20sensor" title=" temperature sensor"> temperature sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=PIR%20sensor" title=" PIR sensor"> PIR sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=actuators" title=" actuators"> actuators</a>, <a href="https://publications.waset.org/abstracts/search?q=relay" title=" relay"> relay</a> </p> <a href="https://publications.waset.org/abstracts/93961/an-internet-of-things-based-home-automation-based-on-raspberry-pi-and-node-js-server" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93961.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">262</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">282</span> Reliability Analysis of Computer Centre at Yobe State University Using LRU Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20V.%20Singh">V. V. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Yusuf%20Ibrahim%20Gwanda"> Yusuf Ibrahim Gwanda</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajesh%20Prasad"> Rajesh Prasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we focus on the reliability and performance analysis of Computer Centre (CC) at Yobe State University, Damaturu, Nigeria. The CC consists of three servers: one database mail server, one redundant and one for sharing with the client computers in the CC (called as a local server). Observing the different possibilities of the functioning of the CC, the analysis has been done to evaluate the various popular measures of reliability such as availability, reliability, mean time to failure (MTTF), profit analysis due to the operation of the system. The system can ultimately fail due to the failure of router, redundant server before repairing the mail server and switch failure. The system can also partially fail when a local server fails. The failed devices have restored according to Least Recently Used (LRU) techniques. The system can also fail entirely due to a cooling failure of the server, electricity failure or some natural calamity like earthquake, fire tsunami, etc. All the failure rates are assumed to be constant and follow exponential time distribution, while the repair follows two types of distributions: i.e. general and Gumbel-Hougaard family copula distribution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=availability%20Gumbel-Hougaard%20family%20copula" title=" availability Gumbel-Hougaard family copula"> availability Gumbel-Hougaard family copula</a>, <a href="https://publications.waset.org/abstracts/search?q=MTTF" title=" MTTF"> MTTF</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20data%20centre" title=" internet data centre"> internet data centre</a> </p> <a href="https://publications.waset.org/abstracts/17889/reliability-analysis-of-computer-centre-at-yobe-state-university-using-lru-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17889.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">530</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">281</span> Presenting Internals of Networks Using Bare Machine Technology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joel%20Weymouth">Joel Weymouth</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramesh%20K.%20Karne"> Ramesh K. Karne</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20L.%20Wijesinha"> Alexander L. Wijesinha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bare Machine Internet is part of the Bare Machine Computing (BMC) paradigm. It is used in programming application ns to run directly on a device. It is software that runs directly against the hardware using CPU, Memory, and I/O. The software application runs without an Operating System and resident mass storage. An important part of the BMC paradigm is the Bare Machine Internet. It utilizes an Application Development model software that interfaces directly with the hardware on a network server and file server. Because it is “bare,” it is a powerful teaching and research tool that can readily display the internals of the network protocols, software, and hardware of the applications running on the Bare Server. It was also demonstrated that the bare server was accessible by laptop and by smartphone/android. The purpose was to show the further practicality of Bare Internet in Computer Engineering and Computer Science Education and Research. It was also to show that an undergraduate student could take advantage of a bare server with any device and any browser at any release version connected to the internet. This paper presents the Bare Web Server as an educational tool. We will discuss possible applications of this paradigm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bare%20machine%20computing" title="bare machine computing">bare machine computing</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20research" title=" online research"> online research</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20technology" title=" network technology"> network technology</a>, <a href="https://publications.waset.org/abstracts/search?q=visualizing%20network%20internals" title=" visualizing network internals"> visualizing network internals</a> </p> <a href="https://publications.waset.org/abstracts/142622/presenting-internals-of-networks-using-bare-machine-technology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142622.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">172</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">280</span> Searching for Forensic Evidence in a Compromised Virtual Web Server against SQL Injection Attacks and PHP Web Shell</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gigih%20Supriyatno">Gigih Supriyatno</a> </p> <p class="card-text"><strong>Abstract:</strong></p> SQL injection is one of the most common types of attacks and has a very critical impact on web servers. In the worst case, an attacker can perform post-exploitation after a successful SQL injection attack. In the case of forensics web servers, web server analysis is closely related to log file analysis. But sometimes large file sizes and different log types make it difficult for investigators to look for traces of attackers on the server. The purpose of this paper is to help investigator take appropriate steps to investigate when the web server gets attacked. We use attack scenarios using SQL injection attacks including PHP backdoor injection as post-exploitation. We perform post-mortem analysis of web server logs based on Hypertext Transfer Protocol (HTTP) POST and HTTP GET method approaches that are characteristic of SQL injection attacks. In addition, we also propose structured analysis method between the web server application log file, database application, and other additional logs that exist on the webserver. This method makes the investigator more structured to analyze the log file so as to produce evidence of attack with acceptable time. There is also the possibility that other attack techniques can be detected with this method. On the other side, it can help web administrators to prepare their systems for the forensic readiness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=web%20forensic" title="web forensic">web forensic</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL%20injection" title=" SQL injection"> SQL injection</a>, <a href="https://publications.waset.org/abstracts/search?q=investigation" title=" investigation"> investigation</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20shell" title=" web shell"> web shell</a> </p> <a href="https://publications.waset.org/abstracts/95122/searching-for-forensic-evidence-in-a-compromised-virtual-web-server-against-sql-injection-attacks-and-php-web-shell" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95122.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">148</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">279</span> 3D Remote Sensing Images Parallax Refining Based On HTML5</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qian%20Pei">Qian Pei</a>, <a href="https://publications.waset.org/abstracts/search?q=Hengjian%20Tong"> Hengjian Tong</a>, <a href="https://publications.waset.org/abstracts/search?q=Weitao%20Chen"> Weitao Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Hai%20Wang"> Hai Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yanrong%20Feng"> Yanrong Feng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Horizontal parallax is the foundation of stereoscopic viewing. However, the human eye will feel uncomfortable and it will occur diplopia if horizontal parallax is larger than eye separation. Therefore, we need to do parallax refining before conducting stereoscopic observation. Although some scholars have been devoted to online remote sensing refining, the main work of image refining is completed on the server side. There will be a significant delay when multiple users access the server at the same time. The emergence of HTML5 technology in recent years makes it possible to develop rich browser web application. Authors complete the image parallax refining on the browser side based on HTML5, while server side only need to transfer image data and parallax file to browser side according to the browser’s request. In this way, we can greatly reduce the server CPU load and allow a large number of users to access server in parallel and respond the user’s request quickly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3D%20remote%20sensing%20images" title="3D remote sensing images">3D remote sensing images</a>, <a href="https://publications.waset.org/abstracts/search?q=parallax" title=" parallax"> parallax</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20refining" title=" online refining"> online refining</a>, <a href="https://publications.waset.org/abstracts/search?q=rich%20browser%20web%20application" title=" rich browser web application"> rich browser web application</a>, <a href="https://publications.waset.org/abstracts/search?q=HTML5" title=" HTML5"> HTML5</a> </p> <a href="https://publications.waset.org/abstracts/19927/3d-remote-sensing-images-parallax-refining-based-on-html5" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19927.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">461</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">278</span> On a Single Server Queue with Arrivals in Batches of Variable Size, Generalized Coxian-2 Service and Compulsory Server Vacations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kailash%20C.%20Madan">Kailash C. Madan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the steady state behaviour of a batch arrival single server queue in which the first service with general service times is compulsory and the second service with general service times is optional. We term such a two phase service as generalized Coxian-2 service. Just after completion of a service the server must take a vacation of random length of time with general vacation times. We obtain steady state probability generating functions for the queue size as well as the steady state mean queue size at a random epoch of time in explicit and closed forms. Some particular cases of interest including some known results have been derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=batch%20arrivals" title="batch arrivals">batch arrivals</a>, <a href="https://publications.waset.org/abstracts/search?q=compound%20Poisson%20process" title=" compound Poisson process"> compound Poisson process</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Coxian-2%20service" title=" generalized Coxian-2 service"> generalized Coxian-2 service</a>, <a href="https://publications.waset.org/abstracts/search?q=steady%20state" title=" steady state"> steady state</a> </p> <a href="https://publications.waset.org/abstracts/35090/on-a-single-server-queue-with-arrivals-in-batches-of-variable-size-generalized-coxian-2-service-and-compulsory-server-vacations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35090.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">455</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">277</span> Thermal Performance of Fully Immersed Naturally Cooled Server</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yaser%20Al-Anii">Yaser Al-Anii</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdulmajeed%20Almaneea"> Abdulmajeed Almaneea</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonathan%20L.%20Summers"> Jonathan L. Summers</a>, <a href="https://publications.waset.org/abstracts/search?q=Harvey%20M.%20Thompson"> Harvey M. Thompson</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikil%20Kapur"> Nikil Kapur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The natural convection cooling system of a fully immersed server in a dielectric liquid is studied numerically. In the present case study, the dielectric liquid represents working fluid and it is in contact with server inside capsule. The capsule includes electronic component and fluid which can be modeled as saturated porous media. This medium follow Darcy flow regime and assumed to be in balance between its components. The study focus is on role of spatial parameters on thermal behavior of convective heat transfer. Based on server known unit, which is 1U, two parameters Ly and S are changed to test their effect. Meanwhile, wide-range of modified Rayleigh number, which is 0.5 to 300, are covered to better understand thermal performance. Navier-Stokes equations are used to model physical domain. Furthermore, successive over-relaxation and time marching techniques are used to solve momentum and energy equation. From obtained correlation, the in-between distance S is more effective on Nusselt number than distance to edge Ly by approximately 14%. In addition, as S increases, the average Nusselt number of the upper unit increases sharply, whereas the lower one keeps on the same level. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convective%20cooling%20of%20server" title="convective cooling of server">convective cooling of server</a>, <a href="https://publications.waset.org/abstracts/search?q=Darcy%20flow" title=" Darcy flow"> Darcy flow</a>, <a href="https://publications.waset.org/abstracts/search?q=liquid-immersed%20server" title=" liquid-immersed server"> liquid-immersed server</a>, <a href="https://publications.waset.org/abstracts/search?q=porous%20media" title=" porous media"> porous media</a> </p> <a href="https://publications.waset.org/abstracts/24866/thermal-performance-of-fully-immersed-naturally-cooled-server" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24866.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">401</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">276</span> Exploiting SLMail Server with a Developed Buffer Overflow with Kali Linux</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Senesh%20Wijayarathne">Senesh Wijayarathne</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study focuses on how someone could develop a Buffer Overflow and could use that to exploit the SLMail Server. This study uses a Kali Linux V2018.4 Virtual Machine and Windows 7 - Internet Explorer V8 Virtual Machine (IPv4 Address - 192.168.56.107). This study starts by sending continued bytes to the SLMail Server to find the crashing point range and creating a unique pattern of the length of the crashing point range to control the Extended Instruction Pointer (EIP). Then by sending all characters to SLMail Server, we could observe and find which characters are not rendered properly by the software, also known as Bad Characters. By finding the ‘Jump to the ESP register (JMP ESP) and with the help of ‘Mona Modules’, we could use msfvenom to create a non-stage windows reverse shell payload. By including all the details gathered previously on one script, we could get a system-level reverse shell of the Windows 7 PC. The end of this paper will discuss how to mitigate this vulnerability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=slmail%20server" title="slmail server">slmail server</a>, <a href="https://publications.waset.org/abstracts/search?q=extended%20instruction%20pointer" title=" extended instruction pointer"> extended instruction pointer</a>, <a href="https://publications.waset.org/abstracts/search?q=jump%20to%20the%20esp%20register" title=" jump to the esp register"> jump to the esp register</a>, <a href="https://publications.waset.org/abstracts/search?q=bad%20characters" title=" bad characters"> bad characters</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20machine" title=" virtual machine"> virtual machine</a>, <a href="https://publications.waset.org/abstracts/search?q=windows%207" title=" windows 7"> windows 7</a>, <a href="https://publications.waset.org/abstracts/search?q=kali%20Linux" title=" kali Linux"> kali Linux</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer%20overflow" title=" buffer overflow"> buffer overflow</a>, <a href="https://publications.waset.org/abstracts/search?q=Seattle%20lab" title=" Seattle lab"> Seattle lab</a>, <a href="https://publications.waset.org/abstracts/search?q=vulnerability" title=" vulnerability"> vulnerability</a> </p> <a href="https://publications.waset.org/abstracts/150375/exploiting-slmail-server-with-a-developed-buffer-overflow-with-kali-linux" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150375.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">165</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">275</span> Thermal Performance of Fully Immersed Server into Saturated Fluid Porous Medium</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yaser%20Al-Anii">Yaser Al-Anii</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdulmajeed%20Almaneea"> Abdulmajeed Almaneea</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonathan%20L.%20Summers"> Jonathan L. Summers</a>, <a href="https://publications.waset.org/abstracts/search?q=Harvey%20M.%20Thompson"> Harvey M. Thompson</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikil%20Kapur"> Nikil Kapur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The natural convection cooling system of a fully immersed server in dielectric liquid is studied numerically. In present case study, the dielectric liquid represents working fluid and it is in contact with server inside capsule. The capsule includes electronic component and fluid, which can be modelled as saturated porous media. This medium follow Darcy flow regime and assumed to be in balance between its components. The study focus is on role of spatial parameters on thermal behavior of convective heat transfer. Based on server known unit, which is 1U, two parameters Ly and S are changed to test their effect. Meanwhile, wide range of modified Rayleigh number, which is 0.5 to 300, are covered to better understand thermal performance. Navier-Stokes equations are used to model physical domain. Furthermore, successive over relaxation and time marching techniques are used to solve momentum and energy equation. From obtained correlation, the in-between distance S is more effective on Nusselt number than distance to edge Ly by approximately 14%. In addition, as S increase, the average Nusselt number of the upper unit is increased sharply, whereas the lower one keeps on same level. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convective%20cooling%20of%20server" title="convective cooling of server">convective cooling of server</a>, <a href="https://publications.waset.org/abstracts/search?q=darcy%20flow" title=" darcy flow"> darcy flow</a>, <a href="https://publications.waset.org/abstracts/search?q=liquid-immersed%20server" title=" liquid-immersed server"> liquid-immersed server</a>, <a href="https://publications.waset.org/abstracts/search?q=porous%20media" title=" porous media"> porous media</a> </p> <a href="https://publications.waset.org/abstracts/24864/thermal-performance-of-fully-immersed-server-into-saturated-fluid-porous-medium" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24864.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">397</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">274</span> A Security Cloud Storage Scheme Based Accountable Key-Policy Attribute-Based Encryption without Key Escrow</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ming%20Lun%20Wang">Ming Lun Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Wang"> Yan Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ning%20Ruo%20Sun"> Ning Ruo Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the development of cloud computing, more and more users start to utilize the cloud storage service. However, there exist some issues: 1) cloud server steals the shared data, 2) sharers collude with the cloud server to steal the shared data, 3) cloud server tampers the shared data, 4) sharers and key generation center (KGC) conspire to steal the shared data. In this paper, we use advanced encryption standard (AES), hash algorithms, and accountable key-policy attribute-based encryption without key escrow (WOKE-AKP-ABE) to build a security cloud storage scheme. Moreover, the data are encrypted to protect the privacy. We use hash algorithms to prevent the cloud server from tampering the data uploaded to the cloud. Analysis results show that this scheme can resist conspired attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20storage%20security" title="cloud storage security">cloud storage security</a>, <a href="https://publications.waset.org/abstracts/search?q=sharing%20storage" title=" sharing storage"> sharing storage</a>, <a href="https://publications.waset.org/abstracts/search?q=attributes" title=" attributes"> attributes</a>, <a href="https://publications.waset.org/abstracts/search?q=Hash%20algorithm" title=" Hash algorithm"> Hash algorithm</a> </p> <a href="https://publications.waset.org/abstracts/52205/a-security-cloud-storage-scheme-based-accountable-key-policy-attribute-based-encryption-without-key-escrow" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52205.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">390</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">273</span> Interplay of Power Management at Core and Server Level</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J%C3%B6rg%20Lenhardt">Jörg Lenhardt</a>, <a href="https://publications.waset.org/abstracts/search?q=Wolfram%20Schiffmann"> Wolfram Schiffmann</a>, <a href="https://publications.waset.org/abstracts/search?q=J%C3%B6rg%20Keller"> Jörg Keller</a> </p> <p class="card-text"><strong>Abstract:</strong></p> While the feature sizes of recent Complementary Metal Oxid Semiconductor (CMOS) devices decrease the influence of static power prevails their energy consumption. Thus, power savings that benefit from Dynamic Frequency and Voltage Scaling (DVFS) are diminishing and temporal shutdown of cores or other microchip components become more worthwhile. A consequence of powering off unused parts of a chip is that the relative difference between idle and fully loaded power consumption is increased. That means, future chips and whole server systems gain more power saving potential through power-aware load balancing, whereas in former times this power saving approach had only limited effect, and thus, was not widely adopted. While powering off complete servers was used to save energy, it will be superfluous in many cases when cores can be powered down. An important advantage that comes with that is a largely reduced time to respond to increased computational demand. We include the above developments in a server power model and quantify the advantage. Our conclusion is that strategies from datacenters when to power off server systems might be used in the future on core level, while load balancing mechanisms previously used at core level might be used in the future at server level. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=power%20efficiency" title="power efficiency">power efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20power%20consumption" title=" static power consumption"> static power consumption</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20power%20consumption" title=" dynamic power consumption"> dynamic power consumption</a>, <a href="https://publications.waset.org/abstracts/search?q=CMOS" title=" CMOS"> CMOS</a> </p> <a href="https://publications.waset.org/abstracts/42439/interplay-of-power-management-at-core-and-server-level" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42439.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">221</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">272</span> Night Patrolling Robot for Suspicious Activity Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amruta%20Amune">Amruta Amune</a>, <a href="https://publications.waset.org/abstracts/search?q=Rohit%20Agrawal"> Rohit Agrawal</a>, <a href="https://publications.waset.org/abstracts/search?q=Yashashree%20Shastri"> Yashashree Shastri</a>, <a href="https://publications.waset.org/abstracts/search?q=Syeda%20Zarah%20Aiman"> Syeda Zarah Aiman</a>, <a href="https://publications.waset.org/abstracts/search?q=Rutuja%20Rathi"> Rutuja Rathi</a>, <a href="https://publications.waset.org/abstracts/search?q=Vaishnav%20Suryawanshi"> Vaishnav Suryawanshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sameer%20Sumbhe"> Sameer Sumbhe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Every human being needs a sense of security. The requirement for security has risen in proportion with the population growth. However, because of a scarcity of resources, effective protection is not possible. It costs a lot of money to get appropriate security that not many can handle or afford. The goal of the study was to find a solution to the issue by developing a system capable of providing strong protection at a very low cost when long-term benefits are taken into account. The objective was to design and develop a robot that could travel around and survey the region and inform the command center if anything unusual was found. The system will be controlled manually on the server to find out its workplace's paths. The system is outfitted with a camera so that it can be used to capture built-in live video of the attacker and display it on the server. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=night%20patrolling" title="night patrolling">night patrolling</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20MCU" title=" node MCU"> node MCU</a>, <a href="https://publications.waset.org/abstracts/search?q=server" title=" server"> server</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/157179/night-patrolling-robot-for-suspicious-activity-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157179.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">271</span> Distributed Framework for Pothole Detection and Monitoring Using Federated Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ezil%20Sam%20Leni">Ezil Sam Leni</a>, <a href="https://publications.waset.org/abstracts/search?q=Shalen%20S."> Shalen S.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transport service monitoring and upkeep are essential components of smart city initiatives. The main risks to the relevant departments and authorities are the ever-increasing vehicular traffic and the conditions of the roads. In India, the economy is greatly impacted by the road transport sector. In 2021, the Ministry of Road Transport and Highways Transport, Government of India, produced a report with statistical data on traffic accidents. The data included the number of fatalities, injuries, and other pertinent criteria. This study proposes a distributed infrastructure for the monitoring, detection, and reporting of potholes to the appropriate authorities. In a distributed environment, the nodes are the edge devices, and local edge servers, and global servers. The edge devices receive the initial model to be employed from the global server. The YOLOv8 model for pothole detection is used in the edge devices. The edge devices run the pothole detection model, gather the pothole images on their path, and send the updates to the nearby edge server. The local edge server selects the clients for its aggregation process, aggregates the model updates and sends the updates to the global server. The global server collects the updates from the local edge servers, performs aggregation and derives the updated model. The updated model has the information about the potholes received from the local edge servers and notifies the updates to the local edge servers and concerned authorities for monitoring and maintenance of road conditions. The entire process is implemented in FedCV distributed environment with the implementation using the client-server model and aggregation entities. After choosing the clients for its aggregation process, the local edge server gathers the model updates and transmits them to the global server. After gathering the updates from the regional edge servers, the global server aggregates them and creates the updated model. Performance indicators and the experimentation environment are assessed, discussed, and presented. Accelerometer data may be taken into consideration for improved performance in the future development of this study, in addition to the images captured from the transportation routes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=federated%20Learning" title="federated Learning">federated Learning</a>, <a href="https://publications.waset.org/abstracts/search?q=pothole%20detection" title=" pothole detection"> pothole detection</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20framework" title=" distributed framework"> distributed framework</a>, <a href="https://publications.waset.org/abstracts/search?q=federated%20averaging" title=" federated averaging"> federated averaging</a> </p> <a href="https://publications.waset.org/abstracts/176254/distributed-framework-for-pothole-detection-and-monitoring-using-federated-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176254.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">103</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">270</span> Tracy: A Java Library to Render a 3D Graphical Human Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sina%20Saadati">Sina Saadati</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammadreza%20Razzazi"> Mohammadreza Razzazi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since Java is an object-oriented language, It can be used to solve a wide range of problems. One of the considerable usages of this language can be found in Agent-based modeling and simulation. Despite the significant power of Java, There is not an easy method to render a 3-dimensional human model. In this article, we are about to develop a library which helps modelers present a 3D human model and control it with Java. The library runs two server programs. The first one is a web page server that can connect to any browser and present an HTML code. The second server connects to the browser and controls the movement of the model. So, the modeler will be able to develop a simulation and display a good-looking human model without any knowledge of any graphical tools. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agent-based%20modeling%20and%20simulation" title="agent-based modeling and simulation">agent-based modeling and simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20model" title=" human model"> human model</a>, <a href="https://publications.waset.org/abstracts/search?q=graphics" title=" graphics"> graphics</a>, <a href="https://publications.waset.org/abstracts/search?q=Java" title=" Java"> Java</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title=" distributed systems"> distributed systems</a> </p> <a href="https://publications.waset.org/abstracts/150176/tracy-a-java-library-to-render-a-3d-graphical-human-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150176.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">111</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">269</span> A Two Server Poisson Queue Operating under FCFS Discipline with an ‘m’ Policy </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Sivasamy">R. Sivasamy</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Paulraj"> G. Paulraj</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Kalaimani"> S. Kalaimani</a>, <a href="https://publications.waset.org/abstracts/search?q=N.Thillaigovindan"> N.Thillaigovindan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For profitable businesses, queues are double-edged swords and hence the pain of long wait times in a queue often frustrates customers. This paper suggests a technical way of reducing the pain of lines through a Poisson M/M1, M2/2 queueing system operated by two heterogeneous servers with an objective of minimising the mean sojourn time of customers served under the queue discipline ‘First Come First Served with an ‘m’ policy, i.e. FCFS-m policy’. Arrivals to the system form a Poisson process of rate λ and are served by two exponential servers. The service times of successive customers at server ‘j’ are independent and identically distributed (i.i.d.) random variables and each of it is exponentially distributed with rate parameter μj (j=1, 2). The primary condition for implementing the queue discipline ‘FCFS-m policy’ on these service rates μj (j=1, 2) is that either (m+1) µ2 > µ1> m µ2 or (m+1) µ1 > µ2> m µ1 must be satisfied. Further waiting customers prefer the server-1 whenever it becomes available for service, and the server-2 should be installed if and only if the queue length exceeds the value ‘m’ as a threshold. Steady-state results on queue length and waiting time distributions have been obtained. A simple way of tracing the optimal service rate μ*2 of the server-2 is illustrated in a specific numerical exercise to equalize the average queue length cost with that of the service cost. Assuming that the server-1 has to dynamically adjust the service rates as μ1 during the system size is strictly less than T=(m+2) while μ2=0, and as μ1 +μ2 where μ2>0 if the system size is more than or equal to T, corresponding steady state results of M/M1+M2/1 queues have been deduced from those of M/M1,M2/2 queues. To conclude this investigation has a viable application, results of M/M1+M2/1 queues have been used in processing of those waiting messages into a single computer node and to measure the power consumption by the node. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=two%20heterogeneous%20servers" title="two heterogeneous servers">two heterogeneous servers</a>, <a href="https://publications.waset.org/abstracts/search?q=M%2FM1" title=" M/M1"> M/M1</a>, <a href="https://publications.waset.org/abstracts/search?q=M2%2F2%20queue" title="M2/2 queue">M2/2 queue</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20cost%20and%20queue%20length%20cost" title=" service cost and queue length cost"> service cost and queue length cost</a>, <a href="https://publications.waset.org/abstracts/search?q=M%2FM1%2BM2%2F1%20queue" title=" M/M1+M2/1 queue"> M/M1+M2/1 queue</a> </p> <a href="https://publications.waset.org/abstracts/42944/a-two-server-poisson-queue-operating-under-fcfs-discipline-with-an-m-policy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42944.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">362</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">268</span> The Management Information System for Convenience Stores: Case Study in 7 Eleven Shop in Bangkok</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Supattra%20Kanchanopast">Supattra Kanchanopast</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research is to develop and design a management information system for 7 eleven shop in Bangkok. The system was designed and developed to meet users’ requirements via the internet network by use of application software such as My SQL for database management, Apache HTTP Server for Web Server and PHP Hypertext Preprocessor for an interface between web server, database and users. The system was designed into two subsystems as the main system, or system for head office, and the branch system for branch shops. These consisted of three parts which are classified by user management as shop management, inventory management and Point of Sale (POS) management. The implementation of the MIS for the mini-mart shop, can lessen the amount of paperwork and reduce repeating tasks so it may decrease the capital of the business and support an extension of branches in the future as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convenience%20store" title="convenience store">convenience store</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20management%20information%20system" title=" the management information system"> the management information system</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory%20management" title=" inventory management"> inventory management</a>, <a href="https://publications.waset.org/abstracts/search?q=7%20eleven%20shop" title=" 7 eleven shop"> 7 eleven shop</a> </p> <a href="https://publications.waset.org/abstracts/56141/the-management-information-system-for-convenience-stores-case-study-in-7-eleven-shop-in-bangkok" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56141.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">482</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">267</span> DCASH: Dynamic Cache Synchronization Algorithm for Heterogeneous Reverse Y Synchronizing Mobile Database Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gunasekaran%20Raja">Gunasekaran Raja</a>, <a href="https://publications.waset.org/abstracts/search?q=Kottilingam%20Kottursamy"> Kottilingam Kottursamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajakumar%20Arul"> Rajakumar Arul</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramkumar%20Jayaraman"> Ramkumar Jayaraman</a>, <a href="https://publications.waset.org/abstracts/search?q=Krithika%20Sairam"> Krithika Sairam</a>, <a href="https://publications.waset.org/abstracts/search?q=Lakshmi%20Ravi"> Lakshmi Ravi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The synchronization server maintains a dynamically changing cache, which contains the data items which were requested and collected by the mobile node from the server. The order and presence of tuples in the cache changes dynamically according to the frequency of updates performed on the data, by the server and client. To synchronize, the data which has been modified by client and the server at an instant are collected, batched together by the type of modification (insert/ update/ delete), and sorted according to their update frequencies. This ensures that the DCASH (Dynamic Cache Synchronization Algorithm for Heterogeneous Reverse Y synchronizing Mobile Database Systems) gives priority to the frequently accessed data with high usage. The optimal memory management algorithm is proposed to manage data items according to their frequency, theorems were written to show the current mobile data activity is reverse Y in nature and the experiments were tested with 2g and 3g networks for various mobile devices to show the reduced response time and energy consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20databases" title="mobile databases">mobile databases</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization" title=" synchronization"> synchronization</a>, <a href="https://publications.waset.org/abstracts/search?q=cache" title=" cache"> cache</a>, <a href="https://publications.waset.org/abstracts/search?q=response%20time" title=" response time"> response time</a> </p> <a href="https://publications.waset.org/abstracts/48854/dcash-dynamic-cache-synchronization-algorithm-for-heterogeneous-reverse-y-synchronizing-mobile-database-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48854.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">405</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">266</span> SISSLE in Consensus-Based Ripple: Some Improvements in Speed, Security, Last Mile Connectivity and Ease of Use</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mayank%20Mundhra">Mayank Mundhra</a>, <a href="https://publications.waset.org/abstracts/search?q=Chester%20Rebeiro"> Chester Rebeiro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cryptocurrencies are rapidly finding wide application in areas such as Real Time Gross Settlements and Payments Systems. Ripple is a cryptocurrency that has gained prominence with banks and payment providers. It solves the Byzantine General’s Problem with its Ripple Protocol Consensus Algorithm (RPCA), where each server maintains a list of servers, called Unique Node List (UNL) that represents the network for the server, and will not collectively defraud it. The server believes that the network has come to a consensus when members of the UNL come to a consensus on a transaction. In this paper we improve Ripple to achieve better speed, security, last mile connectivity and ease of use. We implement guidelines and automated systems for building and maintaining UNLs for resilience, robustness, improved security, and efficient information propagation. We enhance the system so as to ensure that each server receives information from across the whole network rather than just from the UNL members. We also introduce the paradigm of UNL overlap as a function of information propagation and the trust a server assigns to its own UNL. Our design not only reduces vulnerabilities such as eclipse attacks, but also makes it easier to identify malicious behaviour and entities attempting to fraudulently Double Spend or stall the system. We provide experimental evidence of the benefits of our approach over the current Ripple scheme. We observe ≥ 4.97x and 98.22x in speedup and success rate for information propagation respectively, and ≥ 3.16x and 51.70x in speedup and success rate in consensus. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ripple" title="Ripple">Ripple</a>, <a href="https://publications.waset.org/abstracts/search?q=Kelips" title=" Kelips"> Kelips</a>, <a href="https://publications.waset.org/abstracts/search?q=unique%20node%20list" title=" unique node list"> unique node list</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20propagation" title=" information propagation"> information propagation</a> </p> <a href="https://publications.waset.org/abstracts/130100/sissle-in-consensus-based-ripple-some-improvements-in-speed-security-last-mile-connectivity-and-ease-of-use" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130100.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">145</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">265</span> Enhanced Planar Pattern Tracking for an Outdoor Augmented Reality System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=L.%20Yu">L. Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20K.%20Li"> W. K. Li</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20K.%20Ong"> S. K. Ong</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Y.%20C.%20Nee"> A. Y. C. Nee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a scalable augmented reality framework for handheld devices is presented. The presented framework is enabled by using a server-client data communication structure, in which the search for tracking targets among a database of images is performed on the server-side while pixel-wise 3D tracking is performed on the client-side, which, in this case, is a handheld mobile device. Image search on the server-side adopts a residual-enhanced image descriptors representation that gives the framework a scalability property. The tracking algorithm on the client-side is based on a gravity-aligned feature descriptor which takes the advantage of a sensor-equipped mobile device and an optimized intensity-based image alignment approach that ensures the accuracy of 3D tracking. Automatic content streaming is achieved by using a key-frame selection algorithm, client working phase monitoring and standardized rules for content communication between the server and client. The recognition accuracy test performed on a standard dataset shows that the method adopted in the presented framework outperforms the Bag-of-Words (BoW) method that has been used in some of the previous systems. Experimental test conducted on a set of video sequences indicated the real-time performance of the tracking system with a frame rate at 15-30 frames per second. The presented framework is exposed to be functional in practical situations with a demonstration application on a campus walk-around. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=augmented%20reality%20framework" title="augmented reality framework">augmented reality framework</a>, <a href="https://publications.waset.org/abstracts/search?q=server-client%20model" title=" server-client model"> server-client model</a>, <a href="https://publications.waset.org/abstracts/search?q=vision-based%20tracking" title=" vision-based tracking"> vision-based tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20search" title=" image search"> image search</a> </p> <a href="https://publications.waset.org/abstracts/53214/enhanced-planar-pattern-tracking-for-an-outdoor-augmented-reality-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53214.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">275</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=web%20server&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>