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: tandem queue</title> <meta name="description" content="Search results for: tandem queue"> <meta name="keywords" content="tandem queue"> <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="tandem queue" 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="tandem queue"> <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> 226</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: tandem queue</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">226</span> The Fluid Limit of the Critical Processor Sharing Tandem Queue</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amal%20Ezzidani">Amal Ezzidani</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelghani%20Ben%20Tahar"> Abdelghani Ben Tahar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Hanini"> Mohamed Hanini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A sequence of finite tandem queue is considered for this study. Each one has a single server, which operates under the egalitarian processor sharing discipline. External customers arrive at each queue according to a renewal input process and having a general service times distribution. Upon completing service, customers leave the current queue and enter to the next. Under mild assumptions, including critical data, we prove the existence and the uniqueness of the fluid solution. For asymptotic behavior, we provide necessary and sufficient conditions for the invariant state and the convergence to this invariant state. In the end, we establish the convergence of a correctly normalized state process to a fluid limit characterized by a system of algebraic and integral equations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fluid%20limit" title="fluid limit">fluid limit</a>, <a href="https://publications.waset.org/abstracts/search?q=fluid%20model" title=" fluid model"> fluid model</a>, <a href="https://publications.waset.org/abstracts/search?q=measure%20valued%20process" title=" measure valued process"> measure valued process</a>, <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=tandem%20queue" title=" tandem queue"> tandem queue</a> </p> <a href="https://publications.waset.org/abstracts/130452/the-fluid-limit-of-the-critical-processor-sharing-tandem-queue" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130452.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">323</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">225</span> Discrete-Time Bulk Queue with Service Capacity Depending on Previous Service Time</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yutae%20Lee">Yutae Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a discrete-time bulk-arrival bulkservice queueing system, where service capacity varies depending on the previous service time. By using the generating function technique and the supplementary variable method, we compute the distributions of the queue length at an arbitrary slot boundary and a departure time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete-time%20queue" title="discrete-time queue">discrete-time queue</a>, <a href="https://publications.waset.org/abstracts/search?q=bulk%20queue" title=" bulk queue"> bulk queue</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20service%20capacity" title=" variable service capacity"> variable service capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20length%20distribution" title=" queue length distribution"> queue length distribution</a> </p> <a href="https://publications.waset.org/abstracts/4113/discrete-time-bulk-queue-with-service-capacity-depending-on-previous-service-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4113.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">476</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">224</span> On the Use of Analytical Performance Models to Design a High-Performance Active Queue Management Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahram%20Jamali">Shahram Jamali</a>, <a href="https://publications.waset.org/abstracts/search?q=Samira%20Hamed"> Samira Hamed </a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the open issues in Random Early Detection (RED) algorithm is how to set its parameters to reach high performance for the dynamic conditions of the network. Although original RED uses fixed values for its parameters, this paper follows a model-based approach to upgrade performance of the RED algorithm. It models the routers queue behavior by using the Markov model and uses this model to predict future conditions of the queue. This prediction helps the proposed algorithm to make some tunings over RED's parameters and provide efficiency and better performance. Widespread packet level simulations confirm that the proposed algorithm, called Markov-RED, outperforms RED and FARED in terms of queue stability, bottleneck utilization and dropped packets count. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=active%20queue%20management" title="active queue management">active queue management</a>, <a href="https://publications.waset.org/abstracts/search?q=RED" title=" RED"> RED</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20model" title=" Markov model"> Markov model</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20early%20detection%20algorithm" title=" random early detection algorithm "> random early detection algorithm </a> </p> <a href="https://publications.waset.org/abstracts/33934/on-the-use-of-analytical-performance-models-to-design-a-high-performance-active-queue-management-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33934.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">539</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">223</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">222</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">221</span> Modelling and Optimization Analysis of Silicon/MgZnO-CBTSSe Tandem Solar Cells</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vallisree%20Sivathanu">Vallisree Sivathanu</a>, <a href="https://publications.waset.org/abstracts/search?q=Kumaraswamidhas%20Lakshmi%20Annamalai"> Kumaraswamidhas Lakshmi Annamalai</a>, <a href="https://publications.waset.org/abstracts/search?q=Trupti%20Ranjan%20Lenka"> Trupti Ranjan Lenka</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We report a tandem solar cell model with Silicon as the bottom cell absorber material and Cu₂BaSn(S, Se)₄(CBTSSe) as absorber material for the top cell. As a first step, the top and bottom cells were modelled and validated by comparison with the experiment. Once the individual cells are validated, then the tandem structure is modelled with Indium Tin Oxide(ITO) as conducting layer between the top and bottom cells. The tandem structure yielded better open circuit voltage and fill factor; however, the efficiency obtained is 7.01%. The top cell and the bottom cells are investigated with the help of electron-hole current density, photogeneration rate, and external quantum efficiency profiles. In order to minimize the various loss mechanisms in the tandem solar cell, the material parameters are optimized within experimentally achievable limits. Initially, the top cell optimization was carried out; then, the bottom cell is optimized for maximizing the light absorption, and upon minimizing the current and photon losses in the tandem structure, the maximum achievable efficiency is predicted to be 19.52%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CBTSSe" title="CBTSSe">CBTSSe</a>, <a href="https://publications.waset.org/abstracts/search?q=silicon" title=" silicon"> silicon</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem" title=" tandem"> tandem</a>, <a href="https://publications.waset.org/abstracts/search?q=solar%20cell" title=" solar cell"> solar cell</a>, <a href="https://publications.waset.org/abstracts/search?q=device%20modeling" title=" device modeling"> device modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=current%20losses" title=" current losses"> current losses</a>, <a href="https://publications.waset.org/abstracts/search?q=photon%20losses" title=" photon losses"> photon losses</a> </p> <a href="https://publications.waset.org/abstracts/177529/modelling-and-optimization-analysis-of-siliconmgzno-cbtsse-tandem-solar-cells" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177529.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">117</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">220</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">219</span> Scheduling Algorithm Based on Load-Aware Queue Partitioning in Heterogeneous Multi-Core Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hong%20Kai">Hong Kai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhong%20Jun%20Jie"> Zhong Jun Jie</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Lin%20Qi"> Chen Lin Qi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Chen%20Guang"> Wang Chen Guang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are inefficient global scheduling parallelism and local scheduling parallelism prone to processor starvation in current scheduling algorithms. Regarding this issue, this paper proposed a load-aware queue partitioning scheduling strategy by first allocating the queues according to the number of processor cores, calculating the load factor to specify the load queue capacity, and it assigned the awaiting nodes to the appropriate perceptual queues through the precursor nodes and the communication computation overhead. At the same time, real-time computation of the load factor could effectively prevent the processor from being starved for a long time. Experimental comparison with two classical algorithms shows that there is a certain improvement in both performance metrics of scheduling length and task speedup ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load-aware" title="load-aware">load-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=perceptual%20queue" title=" perceptual queue"> perceptual queue</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20multi-core" title=" heterogeneous multi-core"> heterogeneous multi-core</a> </p> <a href="https://publications.waset.org/abstracts/162110/scheduling-algorithm-based-on-load-aware-queue-partitioning-in-heterogeneous-multi-core-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162110.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">218</span> On the Inequality between Queue Length and Virtual Waiting Time in Open Queueing Networks under Conditions of Heavy Traffic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saulius%20Minkevicius">Saulius Minkevicius</a>, <a href="https://publications.waset.org/abstracts/search?q=Edvinas%20Greicius"> Edvinas Greicius</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper is devoted to the analysis of queueing systems in the context of the network and communications theory. We investigate the inequality in an open queueing network and its applications to the theorems in heavy traffic conditions (fluid approximation, functional limit theorem, and law of the iterated logarithm) for a queue of customers in an open queueing network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fluid%20approximation" title="fluid approximation">fluid approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=heavy%20traffic" title=" heavy traffic"> heavy traffic</a>, <a href="https://publications.waset.org/abstracts/search?q=models%20of%20information%20systems" title=" models of information systems"> models of information systems</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20queueing%20network" title=" open queueing network"> open queueing network</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20length%20of%20%20customers" title=" queue length of customers"> queue length of customers</a>, <a href="https://publications.waset.org/abstracts/search?q=queueing%20theory" title=" queueing theory"> queueing theory</a> </p> <a href="https://publications.waset.org/abstracts/76784/on-the-inequality-between-queue-length-and-virtual-waiting-time-in-open-queueing-networks-under-conditions-of-heavy-traffic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76784.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">286</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">217</span> Epistemic Uncertainty Analysis of Queue with Vacations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Baya%20Takhedmit">Baya Takhedmit</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Abbas"> Karim Abbas</a>, <a href="https://publications.waset.org/abstracts/search?q=Sofiane%20Ouazine"> Sofiane Ouazine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vacations queues are often employed to model many real situations such as computer systems, communication networks, manufacturing and production systems, transportation systems and so forth. These queueing models are solved at fixed parameters values. However, the parameter values themselves are determined from a finite number of observations and hence have uncertainty associated with them (epistemic uncertainty). In this paper, we consider the M/G/1/N queue with server vacation and exhaustive discipline where we assume that the vacation parameter values have uncertainty. We use the Taylor series expansions approach to estimate the expectation and variance of model output, due to epistemic uncertainties in the model input parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=epistemic%20uncertainty" title="epistemic uncertainty">epistemic uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=M%2FG%2F1%2FN%20queue%20with%20vacations" title=" M/G/1/N queue with vacations"> M/G/1/N queue with vacations</a>, <a href="https://publications.waset.org/abstracts/search?q=non-parametric%20sensitivity%20analysis" title=" non-parametric sensitivity analysis"> non-parametric sensitivity analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=Taylor%20series%20expansion" title=" Taylor series expansion"> Taylor series expansion</a> </p> <a href="https://publications.waset.org/abstracts/63375/epistemic-uncertainty-analysis-of-queue-with-vacations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63375.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">433</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">216</span> Practical Evaluation of High-Efficiency Si-based Tandem Solar Cells</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sue-Yi%20Chen">Sue-Yi Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei-Chun%20Hsu"> Wei-Chun Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jon-Yiew%20Gan"> Jon-Yiew Gan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Si-based double-junction tandem solar cells have become a popular research topic because of the advantages of low manufacturing cost and high energy conversion efficiency. However, there is no set of calculations to select the appropriate top cell materials. Therefore, this paper will propose a simple but practical selection method. First of all, we calculate the S-Q limit and explain the reasons for developing tandem solar cells. Secondly, we calculate the theoretical energy conversion efficiency of the double-junction tandem solar cells while combining the commercial monocrystalline Si and materials' practical efficiency to consider the actual situation. Finally, we conservatively conclude that if considering 75% performance of the theoretical energy conversion efficiency of the top cell, the suitable bandgap energy range will fall between 1.38eV to 2.5eV. Besides, we also briefly describe some improvements of several proper materials, CZTS, CdSe, Cu2O, ZnTe, and CdS, hoping that future research can select and manufacture high-efficiency Si-based tandem solar cells based on this paper successfully. Most importantly, our calculation method is not limited to silicon solely. If other materials’ performances match or surpass silicon's ability in the future, researchers can also apply this set of deduction processes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high-efficiency%20solar%20cells" title="high-efficiency solar cells">high-efficiency solar cells</a>, <a href="https://publications.waset.org/abstracts/search?q=material%20selection" title=" material selection"> material selection</a>, <a href="https://publications.waset.org/abstracts/search?q=Si-based%20double-junction%20solar%20cells" title=" Si-based double-junction solar cells"> Si-based double-junction solar cells</a>, <a href="https://publications.waset.org/abstracts/search?q=Tandem%20solar%20cells" title=" Tandem solar cells"> Tandem solar cells</a>, <a href="https://publications.waset.org/abstracts/search?q=photovoltaics." title=" photovoltaics."> photovoltaics.</a> </p> <a href="https://publications.waset.org/abstracts/147639/practical-evaluation-of-high-efficiency-si-based-tandem-solar-cells" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147639.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">116</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">215</span> Language and Culture Exchange: Tandem Language Learning for University Students</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hebe%20Wong">Hebe Wong</a>, <a href="https://publications.waset.org/abstracts/search?q=Luz%20Fernandez%20Calventos"> Luz Fernandez Calventos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tandem language learning, a language exchange process based on the principles of autonomy and reciprocity, provides opportunities for interlocutors to learn each other’s language by communicating online or face-to-face. While much attention has been paid to the process and outcomes of tandem learning via email, little has been discussed about the effectiveness of face-to-face tandem learning on language and culture exchange for university students. The LACTS (Language and Culture Tandem Scheme), an 8-week project, was set up to study students’ perceptions of conducting tandem learning to assist their language and culture exchange. Students of both post-graduate and undergraduate programmes (N=103) from a Hong Kong SAR university were put in groups of 4 to 6 according to their availability and language preferences and met for an hour a week. While sample task sheets on a range of topics were provided to assist the language exchange, all groups were encouraged to take charge of their meeting format and choose their own topics. At the end of the project, a 19-item questionnaire, which included both open-and closed-ended questions investigating students’ perceptions of reciprocal teaching and cultural exchange, was administered. Thirty-minute individual interviews were conducted to elicit students’ views and experiences in the LACTS activities. Quantitative and qualitative data analysis showed that most students agreed that the project had enhanced their cultural awareness and helped create an inclusive and participatory learning environment. Significant differences were found in students’ confidence in speaking their targeted language after joining the scheme. The interviews also provided rich data on the variety of formats and leadership patterns in student-led meetings, which could shed light on student autonomy and future tandem language learning projects. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomy" title="autonomy">autonomy</a>, <a href="https://publications.waset.org/abstracts/search?q=reciprocity" title=" reciprocity"> reciprocity</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem%20language%20learning" title=" tandem language learning"> tandem language learning</a>, <a href="https://publications.waset.org/abstracts/search?q=university%20students" title=" university students"> university students</a> </p> <a href="https://publications.waset.org/abstracts/182907/language-and-culture-exchange-tandem-language-learning-for-university-students" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182907.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">58</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">214</span> A Two Level Load Balancing Approach for Cloud Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anurag%20Jain">Anurag Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajneesh%20Kumar"> Rajneesh Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing is the outcome of rapid growth of internet. Due to elastic nature of cloud computing and unpredictable behavior of user, load balancing is the major issue in cloud computing paradigm. An efficient load balancing technique can improve the performance in terms of efficient resource utilization and higher customer satisfaction. Load balancing can be implemented through task scheduling, resource allocation and task migration. Various parameters to analyze the performance of load balancing approach are response time, cost, data processing time and throughput. This paper demonstrates a two level load balancer approach by combining join idle queue and join shortest queue approach. Authors have used cloud analyst simulator to test proposed two level load balancer approach. The results are analyzed and compared with the existing algorithms and as observed, proposed work is one step ahead of existing techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20analyst" title="cloud analyst">cloud analyst</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=join%20idle%20queue" title=" join idle queue"> join idle queue</a>, <a href="https://publications.waset.org/abstracts/search?q=join%20shortest%20queue" title=" join shortest queue"> join shortest queue</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20scheduling" title=" task scheduling"> task scheduling</a> </p> <a href="https://publications.waset.org/abstracts/46562/a-two-level-load-balancing-approach-for-cloud-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46562.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">431</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">213</span> Modeling of Production Lines Systems with Layout Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sadegh%20Abebi">Sadegh Abebi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are problems with estimating time of product process of products, especially when there is variable serving time, like control stage. These problems will cause overestimation of process time. Layout constraints, reworking constraints and inflexible product schedule in multi product lines, needs a precise planning to reduce volume in particular situation of line stock. In this article, by analyzing real queue systems with layout constraints and by using concepts and principles of Markov chain in queue theory, a hybrid model has been presented. This model can be a base to assess queue systems with probable parameters of service. Here by presenting a case study, the proposed model will be described. so, production lines of a home application manufacturer will be analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Queuing%20theory" title="Queuing theory">Queuing theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20Chain" title=" Markov Chain"> Markov Chain</a>, <a href="https://publications.waset.org/abstracts/search?q=layout" title=" layout"> layout</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20balance" title=" line balance"> line balance</a> </p> <a href="https://publications.waset.org/abstracts/26003/modeling-of-production-lines-systems-with-layout-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26003.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">625</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">212</span> Effects of Viscous and Pressure Forces in Vortex and Wake Induced Vibrations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ravi%20Chaithanya%20Mysa">Ravi Chaithanya Mysa</a>, <a href="https://publications.waset.org/abstracts/search?q=Abouzar%20Kaboudian"> Abouzar Kaboudian</a>, <a href="https://publications.waset.org/abstracts/search?q=Boo%20Cheong%20Khoo"> Boo Cheong Khoo</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajeev%20Kumar%20Jaiman"> Rajeev Kumar Jaiman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cross-flow vortex-induced vibrations of a circular cylinder are compared with the wake-induced oscillations of the downstream cylinder of a tandem cylinder arrangement. It is known that the synchronization of the frequency of vortex shedding with the natural frequency of the structure leads to large amplitude motions. In the case of tandem cylinders, the large amplitudes of the downstream cylinder found are compared to single cylinder setup. In this work, in the tandem arrangement, the upstream cylinder is fixed and the downstream cylinder is free to oscillate in transverse direction. We show that the wake from the upstream cylinder interacts with the downstream cylinder which influences the response of the coupled system. Extensive numerical experiments have been performed on single cylinder as well as tandem cylinder arrangements in cross-flow. Here, the wake interactions in connection to the forces generated are systematically studied. The ratio of the viscous loads to the pressure loads is found to play a major role in the displacement response of the single and tandem cylinder arrangements, as the viscous forces dissipate the energy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=circular%20cylinder" title="circular cylinder">circular cylinder</a>, <a href="https://publications.waset.org/abstracts/search?q=vortex-shedding" title=" vortex-shedding"> vortex-shedding</a>, <a href="https://publications.waset.org/abstracts/search?q=VIV" title=" VIV"> VIV</a>, <a href="https://publications.waset.org/abstracts/search?q=wake-induced" title=" wake-induced"> wake-induced</a>, <a href="https://publications.waset.org/abstracts/search?q=vibrations" title=" vibrations "> vibrations </a> </p> <a href="https://publications.waset.org/abstracts/25526/effects-of-viscous-and-pressure-forces-in-vortex-and-wake-induced-vibrations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25526.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">366</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">211</span> A Hybrid Derivative-Free Optimization Method for Pass Schedule Calculation in Cold Rolling Mill</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammadhadi%20Mirmohammadi">Mohammadhadi Mirmohammadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Safian"> Reza Safian</a>, <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Haddad"> Hossein Haddad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an innovative solution for complex multi-objective optimization problem which is a part of efforts toward maximizing rolling mill throughput and minimizing processing costs in tandem cold rolling. This computational intelligence based optimization has been applied to the rolling schedules of tandem cold rolling mill. This method involves the combination of two derivative-free optimization procedures in the form of nested loops. The first optimization loop is based on Improving Hit and Run method which focus on balance of power, force and reduction distribution in rolling schedules. The second loop is a real-coded genetic algorithm based optimization procedure which optimizes energy consumption and productivity. An experimental result of application to five stand tandem cold rolling mill is presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=derivative-free%20optimization" title="derivative-free optimization">derivative-free optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Improving%20Hit%20and%20Run%20method" title=" Improving Hit and Run method"> Improving Hit and Run method</a>, <a href="https://publications.waset.org/abstracts/search?q=real-coded%20genetic%20algorithm" title=" real-coded genetic algorithm"> real-coded genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=rolling%20schedules%20of%20tandem%20cold%20rolling%20mill" title=" rolling schedules of tandem cold rolling mill"> rolling schedules of tandem cold rolling mill</a> </p> <a href="https://publications.waset.org/abstracts/18442/a-hybrid-derivative-free-optimization-method-for-pass-schedule-calculation-in-cold-rolling-mill" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18442.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">696</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">210</span> Repair Workshop Queue System Modification Using Priority Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Okonkwo%20Ugochukwu">C. Okonkwo Ugochukwu</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Sinebe%20Jude"> E. Sinebe Jude</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Odoh%20Blessing"> N. Odoh Blessing</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Okafor%20Christian"> E. Okafor Christian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a modification on repair workshop queuing system using multi priority scheme was carried out. Chi square goodness of fit test was used to determine the random distribution of the inter arrival time and service time of crankshafts that come for maintenance in the workshop. The chi square values obtained for all the prioritized classes show that the distribution conforms to Poisson distribution. The mean waiting time in queue results of non-preemptive priority for 1st, 2nd and 3rd classes show 0.066, 0.09, and 0.224 day respectively, while preemptive priority show 0.007, 0.036 and 0.258 day. However, when non priority is used, which obviously has no class distinction it amounts to 0.17 days. From the results, one can observe that the preemptive priority system provides a very dramatic improvement over the non preemptive priority as it concerns arrivals that are of higher priority. However, the improvement has a detrimental effect on the low priority class. The trend of the results is similar to the mean waiting time in the system as a result of addition of the actual service time. Even though the mean waiting time for the queue and that of the system for no priority takes the least time when compared with the least priority, urgent and semi-urgent jobs will terribly suffer which will most likely result in reneging or balking of many urgent jobs. Hence, the adoption of priority scheme in this type of scenario will result in huge profit to the Company and more customer satisfaction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=queue" title="queue">queue</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20class" title=" priority class"> priority class</a>, <a href="https://publications.waset.org/abstracts/search?q=preemptive" title=" preemptive"> preemptive</a>, <a href="https://publications.waset.org/abstracts/search?q=non-preemptive" title=" non-preemptive"> non-preemptive</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20waiting%20time" title=" mean waiting time"> mean waiting time</a> </p> <a href="https://publications.waset.org/abstracts/69985/repair-workshop-queue-system-modification-using-priority-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69985.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">396</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">209</span> Avoiding Packet Drop for Improved through Put in the Multi-Hop Wireless N/W</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manish%20Kumar%20Rajak">Manish Kumar Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20Gupta"> Sanjay Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile ad hoc networks (MANETs) are infrastructure less and intercommunicate using single-hop and multi-hop paths. Network based congestion avoidance which involves managing the queues in the network devices is an integral part of any network. QoS: A set of service requirements that are met by the network while transferring a packet stream from a source to a destination. Especially in MANETs, packet loss results in increased overheads. This paper presents a new algorithm to avoid congestion using one or more queue on nodes and corresponding flow rate decided in advance for each node. When any node attains an initial value of queue then it sends this status to its downstream nodes which in turn uses the pre-decided flow rate of packet transfer to its upstream nodes. The flow rate on each node is adjusted according to the status received from its upstream nodes. This proposed algorithm uses the existing infrastructure to inform to other nodes about its current queue status. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mesh%20networks" title="mesh networks">mesh networks</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=packet%20count" title=" packet count"> packet count</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold" title=" threshold"> threshold</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a> </p> <a href="https://publications.waset.org/abstracts/23702/avoiding-packet-drop-for-improved-through-put-in-the-multi-hop-wireless-nw" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23702.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">474</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">208</span> Analysis of Tandem Detonator Algorithm Optimized by Quantum Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tomasz%20Robert%20Kuczerski">Tomasz Robert Kuczerski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The high complexity of the algorithm of the autonomous tandem detonator system creates an optimization problem due to the parallel operation of several machine states of the system. Many years of experience and classic analyses have led to a partially optimized model. Limitations on the energy resources of this class of autonomous systems make it necessary to search for more effective methods of optimisation. The use of the Quantum Approximate Optimization Algorithm (QAOA) in these studies shows the most promising results. With the help of multiple evaluations of several qubit quantum circuits, proper results of variable parameter optimization were obtained. In addition, it was observed that the increase in the number of assessments does not result in further efficient growth due to the increasing complexity of optimising variables. The tests confirmed the effectiveness of the QAOA optimization method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithm%20analysis" title="algorithm analysis">algorithm analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=autonomous%20system" title=" autonomous system"> autonomous system</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20optimization" title=" quantum optimization"> quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem%20detonator" title=" tandem detonator"> tandem detonator</a> </p> <a href="https://publications.waset.org/abstracts/161188/analysis-of-tandem-detonator-algorithm-optimized-by-quantum-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161188.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">92</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">207</span> Numerical Simulation of Turbulent Flow around Two Cam Shaped Cylinders in Tandem Arrangement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arash%20Mir%20Abdolah%20Lavasani">Arash Mir Abdolah Lavasani</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Ebrahimisabet"> M. Ebrahimisabet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the 2-D unsteady viscous flow around two cam shaped cylinders in tandem arrangement is numerically simulated in order to study the characteristics of the flow in turbulent regimes. The investigation covers the effects of high subcritical and supercritical Reynolds numbers and L/D ratio on total drag coefficient. The equivalent diameter of cylinders is 27.6 mm The space between center to center of two cam shaped cylinders is define as longitudinal pitch ratio and it varies in range of 1.5 < L/D < 6. Reynolds number base on equivalent circular cylinder varies in range of 27×103 < Re < 166×103 Results show that drag coefficient of both cylinders depends on pitch ratio. However drag coefficient of downstream cylinder is more dependent on the pitch ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cam%20shaped" title="cam shaped">cam shaped</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem" title=" tandem"> tandem</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical" title=" numerical"> numerical</a>, <a href="https://publications.waset.org/abstracts/search?q=drag%20coefficient" title=" drag coefficient"> drag coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=turbulent" title=" turbulent"> turbulent</a> </p> <a href="https://publications.waset.org/abstracts/36258/numerical-simulation-of-turbulent-flow-around-two-cam-shaped-cylinders-in-tandem-arrangement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36258.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">463</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">206</span> Steady-State Behavior of a Multi-Phase M/M/1 Queue in Random Evolution Subject to Catastrophe Failure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reni%20M.%20Sagayaraj">Reni M. Sagayaraj</a>, <a href="https://publications.waset.org/abstracts/search?q=Anand%20Gnana%20S.%20Selvam"> Anand Gnana S. Selvam</a>, <a href="https://publications.waset.org/abstracts/search?q=Reynald%20R.%20Susainathan"> Reynald R. Susainathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider stochastic queueing models for Steady-state behavior of a multi-phase M/M/1 queue in random evolution subject to catastrophe failure. The arrival flow of customers is described by a marked Markovian arrival process. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation of the system we use a generalized phase-type service time distribution. This model contains a repair state, when a catastrophe occurs the system is transferred to the failure state. The paper focuses on the steady-state equation, and observes that, the steady-state behavior of the underlying queueing model along with the average queue size is analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=M%2FG%2F1%20queuing%20system" title="M/G/1 queuing system">M/G/1 queuing system</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-phase" title=" multi-phase"> multi-phase</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20evolution" title=" random evolution"> random evolution</a>, <a href="https://publications.waset.org/abstracts/search?q=steady-state%20equation" title=" steady-state equation"> steady-state equation</a>, <a href="https://publications.waset.org/abstracts/search?q=catastrophe%20failure" title=" catastrophe failure"> catastrophe failure</a> </p> <a href="https://publications.waset.org/abstracts/53659/steady-state-behavior-of-a-multi-phase-mm1-queue-in-random-evolution-subject-to-catastrophe-failure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53659.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">328</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">205</span> Comparison of the Dose Reached to the Rectum and Bladder in Two Treatment Methods by Tandem and Ovoid and Tandem and Ring in the High Dose Rate Brachytherapy of Cervical Cancer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akbar%20Haghzadeh%20Saraskanroud">Akbar Haghzadeh Saraskanroud</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Hossein%20Yahyavi%20Zanjani"> Amir Hossein Yahyavi Zanjani</a>, <a href="https://publications.waset.org/abstracts/search?q=Niloofar%20Kargar"> Niloofar Kargar</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanieh%20Ahrabi"> Hanieh Ahrabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cervical cancer refers to an unusual growth of cells in the cervix. The cervix is the lower part of the uterus, which connects to the vagina. Various risk factors such as human papillomavirus (HPV), having a weakened immune system, smoking or breathing in secondhand smoke, reproductive factors, and obesity play important roles in causing most cervical cancers. When cervical cancer happens, surgery is often the first treatment option to remove it. Other treatments might include chemotherapy and targeted therapy medicines. Radiation therapy with high-energy photon beams also may be used. Sometimes combined treatment, including radiation with low-dose chemotherapy, was applied. Intracavitary brachytherapy is an integral part of radiotherapy for locally advanced gynecologic malignancies such as cervical cancer. In the treatment of cervical cancer, there are different tools for doing brachytherapy. Two combinations of different applicators for this purpose are Tandem and Ovoid and Tandem and Ring. This study evaluated the dose differences between these two methods in the organs at risk of the rectum, sigmoid, and bladder. In this study, the treatment planswere simulated by the Oncentra treatment planning system and Tandem, Ovid, and Rings of different sizes. CT scan images of 23 patients were treated with HDR_BT Elekta Flexitron system were used for this study. Contouring of HR-CTV, rectum and bladder was performed for all patients. Then, the received dose of 0.1 and 0.2cc volumes of organs at risk were obtained and compared for these two methods: T-Ovoid and T-Ring. By doing investigations and dose measurements of points A and B and the volumes specified by ICRU, it seems that when comparing ring and ovoid to tandem and ovoid, the total dose to the rectum was lower by about 11%, and the bladder was 7%. In the case of HR CTV, this comparison showed that this ratio is about 7% better. Figure 1 shows the amount of decrease in rectum dose in the T-Ring method compared to T-Ovoid. Figure 2 indicates the amount of decrease in bladder dose in the T-Ring method compared to T-Ovoid. Finally, figure 3 illustrates the amount of HR-CTV coverage in the T-Ring method compared to the T-Ovoid. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cervical%20cancer" title="cervical cancer">cervical cancer</a>, <a href="https://publications.waset.org/abstracts/search?q=brachytherapy" title=" brachytherapy"> brachytherapy</a>, <a href="https://publications.waset.org/abstracts/search?q=rectum" title=" rectum"> rectum</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem%20and%20ovoid" title=" tandem and ovoid"> tandem and ovoid</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem%20and%20ring." title=" tandem and ring."> tandem and ring.</a> </p> <a href="https://publications.waset.org/abstracts/187948/comparison-of-the-dose-reached-to-the-rectum-and-bladder-in-two-treatment-methods-by-tandem-and-ovoid-and-tandem-and-ring-in-the-high-dose-rate-brachytherapy-of-cervical-cancer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187948.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">43</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">204</span> Performance and Lifetime of Tandem Organic Solar Cells</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guillaume%20Schuchardt">Guillaume Schuchardt</a>, <a href="https://publications.waset.org/abstracts/search?q=Solenn%20Berson"> Solenn Berson</a>, <a href="https://publications.waset.org/abstracts/search?q=Gerard%20Perrier"> Gerard Perrier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multi-junction solar cell configurations, where two sub-cells with complementary absorption are stacked and connected in series, offer an exciting approach to tackle the single junction limitations of organic solar cells and improve their power conversion efficiency. However, the augmentation of the number of layers has, as a consequence, to increase the risk of reducing the lifetime of the cell due to the ageing phenomena present at the interfaces. In this work, we study the intrinsic degradation mechanisms, under continuous illumination AM1.5G, inert atmosphere and room temperature, in single and tandem organic solar cells using Impedance Spectroscopy, IV Curves, External Quantum Efficiency, Steady-State Photocarrier Grating, Scanning Kelvin Probe and UV-Visible light. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=single%20and%20tandem%20organic%20solar%20cells" title="single and tandem organic solar cells">single and tandem organic solar cells</a>, <a href="https://publications.waset.org/abstracts/search?q=intrinsic%20degradation%20mechanisms" title=" intrinsic degradation mechanisms"> intrinsic degradation mechanisms</a>, <a href="https://publications.waset.org/abstracts/search?q=characterization%3A%20SKP" title=" characterization: SKP"> characterization: SKP</a>, <a href="https://publications.waset.org/abstracts/search?q=EQE" title=" EQE"> EQE</a>, <a href="https://publications.waset.org/abstracts/search?q=SSPG" title=" SSPG"> SSPG</a>, <a href="https://publications.waset.org/abstracts/search?q=UV-Visible" title=" UV-Visible"> UV-Visible</a>, <a href="https://publications.waset.org/abstracts/search?q=Impedance%20Spectroscopy" title=" Impedance Spectroscopy"> Impedance Spectroscopy</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20simulation" title=" optical simulation"> optical simulation</a> </p> <a href="https://publications.waset.org/abstracts/46112/performance-and-lifetime-of-tandem-organic-solar-cells" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46112.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">203</span> Effective Tandem Mesh Nebulisation of Pulmonary Vasodilator and Bronchodilators in Critical Respiratory Failure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nathalie%20Bolding">Nathalie Bolding</a>, <a href="https://publications.waset.org/abstracts/search?q=Marta%20Montero"> Marta Montero</a>, <a href="https://publications.waset.org/abstracts/search?q=Joaquim%20Cevallos"> Joaquim Cevallos</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20F.%20Martin-Lazaro"> Juan F. Martin-Lazaro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Inhaled epoprostenol (iEPO) have been shown to improve PaO2:FiO2 (PF) in combination with bronchodilators (BD). However, there is not an available device to deliver these two therapies concomitantly. We describe a new method to provide this therapy successfully. Objective: To evaluate the response to continuous nebulization of iEPO and intermittent nebulization of Salbutamol/Ipratropium bromide in adults with severe respiratory failure through a double mesh nebulisation in tandem. Methods: This observational study included two mechanical ventilated adults under hourly ventilatory, gasometrical and clinical measurements during 48h. Both had severe respiratory failure treated with continuous iEPO (50 – 200 micrograms/h) and BD (Salbutamol 2.5 mg and Ipratropium bromide 500 mcg every 6 hours) through double mesh nebulisation (Aerogen solo®) placed in tandem in the dry side of the humidificator. The primary endpoints were the variables associated with a positive response to this tandem nebulised therapy (PaFiO2 index, ROX index). Secondary endpoints were laboratory (ABG) clinical and ventilatory variables. Statistical analysis (SPSS v29) included linear regression and ANOVA. Results: The patients included (n=2) survived, both extubated, one after ECMO therapy. Severe acute respiratory failure had a positive response rate to continuous iEPO and intermittent BD: PaFiO2 increased (7.40 to 30.91; P75: 27%) as well as ROX index (2.91 to 11.43; P75: 33%). There was a linear correlation of improvement between iEPO with PaFiO2 (ANOVA, r=0.393, p<0.002) and ROX (r=0.419, p<0.001). iEPO+BD therapy did not show any complications. Conclusion: Continuous and intermittent mesh tandem nebulisation can be effectively delivered with this method with a positive effect in ventilatory parameters without observed complications. Randomised studies will be able to provide reassurance in this new therapy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tandem" title="tandem">tandem</a>, <a href="https://publications.waset.org/abstracts/search?q=mesh" title=" mesh"> mesh</a>, <a href="https://publications.waset.org/abstracts/search?q=nebulisers" title=" nebulisers"> nebulisers</a>, <a href="https://publications.waset.org/abstracts/search?q=pulmonary" title=" pulmonary"> pulmonary</a>, <a href="https://publications.waset.org/abstracts/search?q=vasoldilators" title=" vasoldilators"> vasoldilators</a>, <a href="https://publications.waset.org/abstracts/search?q=bronchodilators" title=" bronchodilators"> bronchodilators</a>, <a href="https://publications.waset.org/abstracts/search?q=respiratory" title=" respiratory"> respiratory</a>, <a href="https://publications.waset.org/abstracts/search?q=failure" title=" failure"> failure</a> </p> <a href="https://publications.waset.org/abstracts/173820/effective-tandem-mesh-nebulisation-of-pulmonary-vasodilator-and-bronchodilators-in-critical-respiratory-failure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173820.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">83</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">202</span> Hierarchical Queue-Based Task Scheduling with CloudSim</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wanqing%20You">Wanqing You</a>, <a href="https://publications.waset.org/abstracts/search?q=Kai%20Qian"> Kai Qian</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Qian"> Ying Qian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concepts of Cloud Computing provide users with infrastructure, platform and software as service, which make those services more accessible for people via Internet. To better analysis the performance of Cloud Computing provisioning policies as well as resources allocation strategies, a toolkit named CloudSim proposed. With CloudSim, the Cloud Computing environment can be easily constructed by modelling and simulating cloud computing components, such as datacenter, host, and virtual machine. A good scheduling strategy is the key to achieve the load balancing among different machines as well as to improve the utilization of basic resources. Recently, the existing scheduling algorithms may work well in some presumptive cases in a single machine; however they are unable to make the best decision for the unforeseen future. In real world scenario, there would be numbers of tasks as well as several virtual machines working in parallel. Based on the concepts of multi-queue, this paper presents a new scheduling algorithm to schedule tasks with CloudSim by taking into account several parameters, the machines’ capacity, the priority of tasks and the history log. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20queue" title="hierarchical queue">hierarchical queue</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=CloudSim" title=" CloudSim"> CloudSim</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20technology" title=" information technology"> information technology</a> </p> <a href="https://publications.waset.org/abstracts/2721/hierarchical-queue-based-task-scheduling-with-cloudsim" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2721.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">422</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">201</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">187</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">200</span> New Method for the Determination of Montelukast in Human Plasma by Solid Phase Extraction Using Liquid Chromatography Tandem Mass Spectrometry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijayalakshmi%20Marella">Vijayalakshmi Marella</a>, <a href="https://publications.waset.org/abstracts/search?q=NageswaraRaoPilli"> NageswaraRaoPilli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a simple, rapid and sensitive liquid chromatography / tandem mass spectrometry assay for the determination of montelukast in human plasma using montelukast d6 as an internal standard. Analyte and the internal standard were extracted from 50 µL of human plasma via solid phase extraction technique without evaporation, drying and reconstitution steps. The chromatographic separation was achieved on a C18 column by using a mixture of methanol and 5mM ammonium acetate (80:20, v/v) as the mobile phase at a flow rate of 0.8 mL/min. Good linearity results were obtained during the entire course of validation. Method validation was performed as per FDA guidelines and the results met the acceptance criteria. A run time of 2.5 min for each sample made it possible to analyze more number of samples in short time, thus increasing the productivity. The proposed method was found to be applicable to clinical studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Montelukast" title="Montelukast">Montelukast</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem%20mass%20spectrometry" title=" tandem mass spectrometry"> tandem mass spectrometry</a>, <a href="https://publications.waset.org/abstracts/search?q=montelukast%20d6" title=" montelukast d6"> montelukast d6</a>, <a href="https://publications.waset.org/abstracts/search?q=FDA%20guidelines" title=" FDA guidelines"> FDA guidelines</a> </p> <a href="https://publications.waset.org/abstracts/29304/new-method-for-the-determination-of-montelukast-in-human-plasma-by-solid-phase-extraction-using-liquid-chromatography-tandem-mass-spectrometry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29304.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">315</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">199</span> Performance Evaluation of Diverging Diamond Interchange Compared to Single Point Diamond Interchange in Riyadh City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maged%20A.%20Mogalli">Maged A. Mogalli</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20I.%20Al-Mansour"> Abdullah I. Al-Mansour</a>, <a href="https://publications.waset.org/abstracts/search?q=Seongkwan%20Mark%20Lee"> Seongkwan Mark Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the last decades, population growth has gradually exceeded transportation infrastructure growth, and today’s transportation professionals are facing challenge on how to meet the mobility needs of a rising population especially in the absence of adequate public transport, as is the case in Saudi Arabia. The traffic movement congestion can be decreased by carrying out some appropriate alternative designs of interchanges such as diverging diamond interchange (DDI) and single diamond interchange (SPDI). In this paper, evaluation of newly implemented DDIs at the interchange of Makkah road with Prince Turki road and the interchange of King Khaled road with Prince Saud Ibn Mohammed Ibn Mugrin road in Riyadh city was carried out. The comparison between the DDI and SPDI is conducted by evaluating different measures of effectiveness (MOE) such as stop delay, average queue length, and number of stops. In this connection, each interchange type was evaluated for traffic flow at peak hours using micro-simulation program namely 'Synchro/SimTarffic' to measure its effectiveness such as stop delay, average queue length, and number of stops. The results of this study show that DDI provides a better result when compared with SPDI in terms of stope delay, average queue length, and number of stops. The stop delay for the SPDI is greater than DDI by three times. Also, the average queue length is approximately twice that of the SPDI when compared to the DDI. Furthermore, the number of stops for the SPDI is about twice as the DDI. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=single%20point%20diamond%20interchange" title="single point diamond interchange">single point diamond interchange</a>, <a href="https://publications.waset.org/abstracts/search?q=diverging%20diamond%20interchange" title=" diverging diamond interchange"> diverging diamond interchange</a>, <a href="https://publications.waset.org/abstracts/search?q=measures%20of%20effectiveness" title=" measures of effectiveness"> measures of effectiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/105752/performance-evaluation-of-diverging-diamond-interchange-compared-to-single-point-diamond-interchange-in-riyadh-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105752.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">258</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">198</span> Algorithms for Fast Computation of Pan Matrix Profiles of Time Series Under Unnormalized Euclidean Distances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Zhang">Jing Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Nikovski"> Daniel Nikovski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an approximation algorithm called LINKUMP to compute the Pan Matrix Profile (PMP) under the unnormalized l∞ distance (useful for value-based similarity search) using double-ended queue and linear interpolation. The algorithm has comparable time/space complexities as the state-of-the-art algorithm for typical PMP computation under the normalized l₂ distance (useful for shape-based similarity search). We validate its efficiency and effectiveness through extensive numerical experiments and a real-world anomaly detection application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pan%20matrix%20profile" title="pan matrix profile">pan matrix profile</a>, <a href="https://publications.waset.org/abstracts/search?q=unnormalized%20euclidean%20distance" title=" unnormalized euclidean distance"> unnormalized euclidean distance</a>, <a href="https://publications.waset.org/abstracts/search?q=double-ended%20queue" title=" double-ended queue"> double-ended queue</a>, <a href="https://publications.waset.org/abstracts/search?q=discord%20discovery" title=" discord discovery"> discord discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title=" anomaly detection"> anomaly detection</a> </p> <a href="https://publications.waset.org/abstracts/144363/algorithms-for-fast-computation-of-pan-matrix-profiles-of-time-series-under-unnormalized-euclidean-distances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144363.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">247</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">197</span> Multi Tier Data Collection and Estimation, Utilizing Queue Model in Wireless Sensor Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amirhossein%20Mohajerzadeh">Amirhossein Mohajerzadeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Abolghasem%20Mohajerzadeh"> Abolghasem Mohajerzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, target parameter is estimated with desirable precision in hierarchical wireless sensor networks (WSN) while the proposed algorithm also tries to prolong network lifetime as much as possible, using efficient data collecting algorithm. Target parameter distribution function is considered unknown. Sensor nodes sense the environment and send the data to the base station called fusion center (FC) using hierarchical data collecting algorithm. FC builds underlying phenomena based on collected data. Considering the aggregation level, x, the goal is providing the essential infrastructure to find the best value for aggregation level in order to prolong network lifetime as much as possible, while desirable accuracy is guaranteed (required sample size is fully depended on desirable precision). First, the sample size calculation algorithm is discussed, second, the average queue length based on M/M[x]/1/K queue model is determined and it is used for energy consumption calculation. Nodes can decrease transmission cost by aggregating incoming data. Furthermore, the performance of the new algorithm is evaluated in terms of lifetime and estimation accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aggregation" title="aggregation">aggregation</a>, <a href="https://publications.waset.org/abstracts/search?q=estimation" title=" estimation"> estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=queuing" title=" queuing"> queuing</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a> </p> <a href="https://publications.waset.org/abstracts/92838/multi-tier-data-collection-and-estimation-utilizing-queue-model-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92838.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> <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=tandem%20queue&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=tandem%20queue&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>