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: joint BS assignment and resource allocation (JBSRA)</title> <meta name="description" content="Search results for: joint BS assignment and resource allocation (JBSRA)"> <meta name="keywords" content="joint BS assignment and resource allocation (JBSRA)"> <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="joint BS assignment and resource allocation (JBSRA)" 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="joint BS assignment and resource allocation (JBSRA)"> <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> 4219</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: joint BS assignment and resource allocation (JBSRA)</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4219</span> AI-based Radio Resource and Transmission Opportunity Allocation for 5G-V2X HetNets: NR and NR-U Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Farshad%20Zeinali">Farshad Zeinali</a>, <a href="https://publications.waset.org/abstracts/search?q=Sajedeh%20Norouzi"> Sajedeh Norouzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Nader%20Mokari"> Nader Mokari</a>, <a href="https://publications.waset.org/abstracts/search?q=Eduard%20Jorswieck"> Eduard Jorswieck</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The capacity of fifth-generation (5G) vehicle-to-everything (V2X) networks poses significant challenges. To ad- dress this challenge, this paper utilizes New Radio (NR) and New Radio Unlicensed (NR-U) networks to develop a heterogeneous vehicular network (HetNet). We propose a new framework, named joint BS assignment and resource allocation (JBSRA) for mobile V2X users and also consider coexistence schemes based on flexible duty cycle (DC) mechanism for unlicensed bands. Our objective is to maximize the average throughput of vehicles while guaranteeing the WiFi users' throughput. In simulations based on deep reinforcement learning (DRL) algorithms such as deep deterministic policy gradient (DDPG) and deep Q network (DQN), our proposed framework outperforms existing solutions that rely on fixed DC or schemes without consideration of unlicensed bands. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle-to-everything%20%28V2X%29" title="vehicle-to-everything (V2X)">vehicle-to-everything (V2X)</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=BS%20assignment" title=" BS assignment"> BS assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=new%20radio%20%28NR%29" title=" new radio (NR)"> new radio (NR)</a>, <a href="https://publications.waset.org/abstracts/search?q=new%20radio%20unlicensed%20%28NR-U%29" title=" new radio unlicensed (NR-U)"> new radio unlicensed (NR-U)</a>, <a href="https://publications.waset.org/abstracts/search?q=coexistence%20NR-U%20and%20WiFi" title=" coexistence NR-U and WiFi"> coexistence NR-U and WiFi</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20deterministic%20policy%20gradient%20%28DDPG%29" title=" deep deterministic policy gradient (DDPG)"> deep deterministic policy gradient (DDPG)</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20Q-network%20%28DQN%29" title=" deep Q-network (DQN)"> deep Q-network (DQN)</a>, <a href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29" title=" joint BS assignment and resource allocation (JBSRA)"> joint BS assignment and resource allocation (JBSRA)</a>, <a href="https://publications.waset.org/abstracts/search?q=duty%20cycle%20mechanism" title=" duty cycle mechanism"> duty cycle mechanism</a> </p> <a href="https://publications.waset.org/abstracts/165699/ai-based-radio-resource-and-transmission-opportunity-allocation-for-5g-v2x-hetnets-nr-and-nr-u-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165699.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4218</span> Mathematical Model and Algorithm for the Berth and Yard Resource Allocation at Seaports</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ming%20Liu">Ming Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhihui%20Sun"> Zhihui Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoning%20Zhang"> Xiaoning Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. Because of the large scale, it is then transformed into a set partitioning formulation, and a framework of branchand- price algorithm is provided to solve it. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=branch-and-price" title="branch-and-price">branch-and-price</a>, <a href="https://publications.waset.org/abstracts/search?q=container%20terminal" title=" container terminal"> container terminal</a>, <a href="https://publications.waset.org/abstracts/search?q=joint%20scheduling" title=" joint scheduling"> joint scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=maritime%20logistics" title=" maritime logistics"> maritime logistics</a> </p> <a href="https://publications.waset.org/abstracts/69918/mathematical-model-and-algorithm-for-the-berth-and-yard-resource-allocation-at-seaports" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69918.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">293</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">4217</span> Resource Allocation and Task Scheduling with Skill Level and Time Bound Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salam%20Saudagar">Salam Saudagar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ankit%20Kamboj"> Ankit Kamboj</a>, <a href="https://publications.waset.org/abstracts/search?q=Niraj%20Mohan"> Niraj Mohan</a>, <a href="https://publications.waset.org/abstracts/search?q=Satgounda%20Patil"> Satgounda Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=Nilesh%20Powar"> Nilesh Powar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Task Assignment and Scheduling is a challenging Operations Research problem when there is a limited number of resources and comparatively higher number of tasks. The Cost Management team at Cummins needs to assign tasks based on a deadline and must prioritize some of the tasks as per business requirements. Moreover, there is a constraint on the resources that assignment of tasks should be done based on an individual skill level, that may vary for different tasks. Another constraint is for scheduling the tasks that should be evenly distributed in terms of number of working hours, which adds further complexity to this problem. The proposed greedy approach to solve assignment and scheduling problem first assigns the task based on management priority and then by the closest deadline. This is followed by an iterative selection of an available resource with the least allocated total working hours for a task, i.e. finding the local optimal choice for each task with the goal of determining the global optimum. The greedy approach task allocation is compared with a variant of Hungarian Algorithm, and it is observed that the proposed approach gives an equal allocation of working hours among the resources. The comparative study of the proposed approach is also done with manual task allocation and it is noted that the visibility of the task timeline has increased from 2 months to 6 months. An interactive dashboard app is created for the greedy assignment and scheduling approach and the tasks with more than 2 months horizon that were waiting in a queue without a delivery date initially are now analyzed effectively by the business with expected timelines for completion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assignment" title="assignment">assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=deadline" title=" deadline"> deadline</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20approach" title=" greedy approach"> greedy approach</a>, <a href="https://publications.waset.org/abstracts/search?q=Hungarian%20algorithm" title=" Hungarian algorithm"> Hungarian algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=operations%20research" title=" operations research"> operations research</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/128820/resource-allocation-and-task-scheduling-with-skill-level-and-time-bound-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128820.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">147</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">4216</span> Cross-Layer Design of Event-Triggered Adaptive OFDMA Resource Allocation Protocols with Application to Vehicle Clusters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaban%20Guma">Shaban Guma</a>, <a href="https://publications.waset.org/abstracts/search?q=Naim%20Bajcinca"> Naim Bajcinca</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an event-triggered algorithm for the solution of a distributed optimization problem by means of the projected subgradient method. Thereby, we invoke an OFDMA resource allocation scheme by applying an event-triggered sensitivity analysis at the access point. The optimal resource assignment of the subcarriers to the involved wireless nodes is carried out by considering the sensitivity analysis of the overall objective function as defined by the control of vehicle clusters with respect to the information exchange between the nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=consensus" title="consensus">consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-layer" title=" cross-layer"> cross-layer</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed" title=" distributed"> distributed</a>, <a href="https://publications.waset.org/abstracts/search?q=event-triggered" title=" event-triggered"> event-triggered</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-vehicle" title=" multi-vehicle"> multi-vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=protocol" title=" protocol"> protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=resource" title=" resource"> resource</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDMA" title=" OFDMA"> OFDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless" title=" wireless"> wireless</a> </p> <a href="https://publications.waset.org/abstracts/52766/cross-layer-design-of-event-triggered-adaptive-ofdma-resource-allocation-protocols-with-application-to-vehicle-clusters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52766.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">331</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4215</span> A New Method to Winner Determination for Economic Resource Allocation in Cloud Computing Systems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Behrouzian%20Nejad">Ebrahim Behrouzian Nejad</a>, <a href="https://publications.waset.org/abstracts/search?q=Rezvan%20Alipoor%20Sabzevari"> Rezvan Alipoor Sabzevari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways to resource allocation in cloud computing. One of the common methods to resource allocation are economic methods. Among these methods, the auction-based method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed the number of winner users is higher than genetic algorithm. On other hand, in proposed algorithm, the number of winner providers is higher in genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <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=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20auction" title=" double auction"> double auction</a>, <a href="https://publications.waset.org/abstracts/search?q=winner%20determination" title=" winner determination "> winner determination </a> </p> <a href="https://publications.waset.org/abstracts/35920/a-new-method-to-winner-determination-for-economic-resource-allocation-in-cloud-computing-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35920.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">359</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4214</span> A 15 Minute-Based Approach for Berth Allocation and Quay Crane Assignment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hoi-Lam%20Ma">Hoi-Lam Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Sai-Ho%20Chung"> Sai-Ho Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In traditional integrated berth allocation with quay crane assignment models, time dimension is usually assumed in hourly based. However, nowadays, transshipment becomes the main business to many container terminals, especially in Southeast Asia (e.g. Hong Kong and Singapore). In these terminals, vessel arrivals are usually very frequent with small handling volume and very short staying time. Therefore, the traditional hourly-based modeling approach may cause significant berth and quay crane idling, and consequently cannot meet their practical needs. In this connection, a 15-minute-based modeling approach is requested by industrial practitioners. Accordingly, a Three-level Genetic Algorithm (3LGA) with Quay Crane (QC) shifting heuristics is designed to fulfill the research gap. The objective function here is to minimize the total service time. Preliminary numerical results show that the proposed 15-minute-based approach can reduce the berth and QC idling significantly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transshipment" title="transshipment">transshipment</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated%20berth%20allocation" title=" integrated berth allocation"> integrated berth allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=variable-in-time%20quay%20crane%20assignment" title=" variable-in-time quay crane assignment"> variable-in-time quay crane assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=quay%20crane%20assignment" title=" quay crane assignment"> quay crane assignment</a> </p> <a href="https://publications.waset.org/abstracts/95988/a-15-minute-based-approach-for-berth-allocation-and-quay-crane-assignment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95988.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">169</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">4213</span> Study on Resource Allocation of Cloud Operating System Based on Multi-Tenant Data Resource Sharing Technology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lin%20Yunuo">Lin Yunuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Seow%20Xing%20Quan"> Seow Xing Quan</a>, <a href="https://publications.waset.org/abstracts/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this modern era, the cloud operating system is the world trend applied in various industries such as business, healthy, etc. In order to deal with the large capacity of requirements in cloud computing, research come up with multi-tenant cloud computing to maximize the benefits of server providers and clients. However, there are still issues in multi-tenant cloud computing especially regarding resource allocation. Issues such as inefficient resource utilization, large latency, lack of scalability and elasticity and poor data isolation had caused inefficient resource allocation in multi-tenant cloud computing. Without a doubt, these issues prevent multitenancy reaches its best condition. In fact, there are multiple studies conducted to determine the optimal resource allocation to solve these problems these days. This article will briefly introduce the cloud operating system, Multi-tenant cloud computing and resource allocation in cloud computing. It then discusses resource allocation in multi-tenant cloud computing and the current challenges it faces. According to the issue ‘ineffective resource utilization’, we will discuss an efficient dynamic scheduling technique for multitenancy, namely Multi-tenant Dynamic Resource Scheduling Model (MTDRSM). Moreover, there also have some recommendations to improve the shortcoming of this model in this paper’s final section. <p class="card-text"><strong>Keywords:</strong> <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=cloud%20operation%20system" title=" cloud operation system"> cloud operation system</a>, <a href="https://publications.waset.org/abstracts/search?q=multitenancy" title=" multitenancy"> multitenancy</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=utilization%20of%20cloud%20resources" title=" utilization of cloud resources"> utilization of cloud resources</a> </p> <a href="https://publications.waset.org/abstracts/168893/study-on-resource-allocation-of-cloud-operating-system-based-on-multi-tenant-data-resource-sharing-technology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168893.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">84</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">4212</span> A Resource Optimization Strategy for CPU (Central Processing Unit) Intensive Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Junjie%20Peng">Junjie Peng</a>, <a href="https://publications.waset.org/abstracts/search?q=Jinbao%20Chen"> Jinbao Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuai%20Kong"> Shuai Kong</a>, <a href="https://publications.waset.org/abstracts/search?q=Danxu%20Liu"> Danxu Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On the basis of traditional resource allocation strategies, the usage of resources on physical servers in cloud data center is great uncertain. It will cause waste of resources if the assignment of tasks is not enough. On the contrary, it will cause overload if the assignment of tasks is too much. This is especially obvious when the applications are the same type because of its resource preferences. Considering CPU intensive application is one of the most common types of application in the cloud, we studied the optimization strategy for CPU intensive applications on the same server. We used resource preferences to analyze the case that multiple CPU intensive applications run simultaneously, and put forward a model which can predict the execution time for CPU intensive applications which run simultaneously. Based on the prediction model, we proposed the method to select the appropriate number of applications for a machine. Experiments show that the model can predict the execution time accurately for CPU intensive applications. To improve the execution efficiency of applications, we propose a scheduling model based on priority for CPU intensive applications. Extensive experiments verify the validity of the scheduling model. <p class="card-text"><strong>Keywords:</strong> <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=CPU%20intensive%20applications" title=" CPU intensive applications"> CPU intensive applications</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20optimization" title=" resource optimization"> resource optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=strategy" title=" strategy"> strategy</a> </p> <a href="https://publications.waset.org/abstracts/58102/a-resource-optimization-strategy-for-cpu-central-processing-unit-intensive-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58102.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">278</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">4211</span> Understanding How Democratic Governance Influence Resource Allocation and Utilisation in Economies in Transition: The Case of Cameroon</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Terence%20Maisah%20Seka">Terence Maisah Seka </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines democratic governance within the private and public sectors in economies in transition (Cameroon) by exploring how they influence development in terms of resource allocation to priorities that are locally conceptualized. The benefit of this is an improvement in indigenous and the quality of life for the local population. Using an ethnographic approach, this paper suggests that institutional corruption and state bureaucracy has limited the impact of democratic governance in influencing development. This has seen funds for developments being embezzled; local projects are not being done to satisfaction among others. The paper contributes by proposing measures to eliminate corruption to improve democratic governance, which will improve resource allocation and utilization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=democratic%20governance" title="democratic governance">democratic governance</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=utilisation" title=" utilisation"> utilisation</a>, <a href="https://publications.waset.org/abstracts/search?q=Cameroon" title=" Cameroon"> Cameroon</a> </p> <a href="https://publications.waset.org/abstracts/105236/understanding-how-democratic-governance-influence-resource-allocation-and-utilisation-in-economies-in-transition-the-case-of-cameroon" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105236.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">188</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">4210</span> Resource Management Framework in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gagandeep%20Kaur">Gagandeep Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonal%20Chawla"> Sonal Chawla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a Cloud Computing environment, resource provisioning, resource allocation and resource scheduling is the most complex issues these days. Cloud User expects the best resource utilization and Cloud Provider expects revenue maximization by considering budget and time constraints. In this research paper, Resource Management Framework has been proposed to allocate the resources to Cloud Users and Cloud Providers in Cloud environment. The main aim of the proposed work is to provide the resources and services to Cloud Providers and Cloud Users in an efficient and effective manner. The proposed framework has been simulated and tested using the CloudSim simulator tool. <p class="card-text"><strong>Keywords:</strong> <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=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=auction" title=" auction"> auction</a>, <a href="https://publications.waset.org/abstracts/search?q=provisioning" title=" provisioning"> provisioning</a> </p> <a href="https://publications.waset.org/abstracts/145409/resource-management-framework-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145409.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">149</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">4209</span> An Improved VM Allocation Algorithm by Utilizing Combined Resource Allocation Mechanism and Released Resources in Cloud Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md%20Habibul%20Ansary">Md Habibul Ansary</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandan%20Garai"> Chandan Garai</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranjan%20Dasgupta"> Ranjan Dasgupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Utilization of resources is always a great challenge for any allocation problem, particularly when resource availability is dynamic in nature. In this work VM allocation mechanism has been augmented by providing resources in a combined manner. This approach has some inherent advantages in terms of reduction of wait state for the pending jobs of some users and better utilization of unused resources from the service providers’ point of view. Moreover the algorithm takes care of released resources from the finished jobs as soon as those become available. The proposed algorithm has been explained by suitable example to make the work complete. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bid%20ratio" title="Bid ratio">Bid ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20service" title=" cloud service"> cloud service</a>, <a href="https://publications.waset.org/abstracts/search?q=virtualization" title=" virtualization"> virtualization</a>, <a href="https://publications.waset.org/abstracts/search?q=VM%20allocation%20problem" title=" VM allocation problem"> VM allocation problem</a> </p> <a href="https://publications.waset.org/abstracts/34024/an-improved-vm-allocation-algorithm-by-utilizing-combined-resource-allocation-mechanism-and-released-resources-in-cloud-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34024.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">4208</span> Mobile Agents-Based Framework for Dynamic Resource Allocation in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safia%20Rabaaoui">Safia Rabaaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%A9la%20Hachicha"> Héla Hachicha</a>, <a href="https://publications.waset.org/abstracts/search?q=Ezzeddine%20Zagrouba"> Ezzeddine Zagrouba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, cloud computing is becoming the more popular technology to various companies and consumers, which benefit from its increased efficiency, cost optimization, data security, unlimited storage capacity, etc. One of the biggest challenges of cloud computing is resource allocation. Its efficiency directly influences the performance of the whole cloud environment. Finding an effective method to address these critical issues and increase cloud performance was necessary. This paper proposes a mobile agents-based framework for dynamic resource allocation in cloud computing to minimize both the cost of using virtual machines and the makespan. Furthermore, its impact on the best response time and power consumption has been studied. The simulation showed that our method gave better results than here. <p class="card-text"><strong>Keywords:</strong> <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=multi-agent%20system" title=" multi-agent system"> multi-agent system</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20agent" title=" mobile agent"> mobile agent</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20resource%20allocation" title=" dynamic resource allocation"> dynamic resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=cost" title=" cost"> cost</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/168460/mobile-agents-based-framework-for-dynamic-resource-allocation-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168460.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">102</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">4207</span> Resource Allocation Scheme For IEEE802.16 Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elmabruk%20Laias">Elmabruk Laias</a> </p> <p class="card-text"><strong>Abstract:</strong></p> IEEE Standard 802.16 provides QoS (Quality of Service) for the applications such as Voice over IP, video streaming and high bandwidth ﬁle transfer. With the ability of broadband wireless access of an IEEE 802.16 system, a WiMAX TDD frame contains one downlink subframe and one uplink subframe. The capacity allocated to each subframe is a system parameter that should be determined based on the expected traffic conditions. a proper resource allocation scheme for packet transmissions is imperatively needed. In this paper, we present a new resource allocation scheme, called additional bandwidth yielding (ABY), to improve transmission efﬁciency of an IEEE 802.16-based network. Our proposed scheme can be adopted along with the existing scheduling algorithms and the multi-priority scheme without any change. The experimental results show that by using our ABY, the packet queuing delay could be signiﬁcantly improved, especially for the service ﬂows of higher-priority classes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=IEEE%20802.16" title="IEEE 802.16">IEEE 802.16</a>, <a href="https://publications.waset.org/abstracts/search?q=WiMAX" title=" WiMAX"> WiMAX</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDMA" title=" OFDMA"> OFDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=uplink-downlink%20mapping" title=" uplink-downlink mapping"> uplink-downlink mapping</a> </p> <a href="https://publications.waset.org/abstracts/15555/resource-allocation-scheme-for-ieee80216-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15555.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">475</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">4206</span> Optimisation of B2C Supply Chain Resource Allocation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Firdaous%20Zair">Firdaous Zair</a>, <a href="https://publications.waset.org/abstracts/search?q=Zoubir%20Elfelsoufi"> Zoubir Elfelsoufi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Fourka"> Mohammed Fourka</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The allocation of resources is an issue that is needed on the tactical and operational strategic plan. This work considers the allocation of resources in the case of pure players, manufacturers and Click & Mortars that have launched online sales. The aim is to improve the level of customer satisfaction and maintaining the benefits of e-retailer and of its cooperators and reducing costs and risks. Our contribution is a decision support system and tool for improving the allocation of resources in logistics chains e-commerce B2C context. We first modeled the B2C chain with all operations that integrates and possible scenarios since online retailers offer a wide selection of personalized service. The personalized services that online shopping companies offer to the clients can be embodied in many aspects, such as the customizations of payment, the distribution methods, and after-sales service choices. In addition, every aspect of customized service has several modes. At that time, we analyzed the optimization problems of supply chain resource allocation in customized online shopping service mode, which is different from the supply chain resource allocation under traditional manufacturing or service circumstances. Then we realized an optimization model and algorithm for the development based on the analysis of the allocation of the B2C supply chain resources. It is a multi-objective optimization that considers the collaboration of resources in operations, time and costs but also the risks and the quality of services as well as dynamic and uncertain characters related to the request. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=e-commerce" title="e-commerce">e-commerce</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain" title=" supply chain"> supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=B2C" title=" B2C"> B2C</a>, <a href="https://publications.waset.org/abstracts/search?q=optimisation" title=" optimisation"> optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a> </p> <a href="https://publications.waset.org/abstracts/42106/optimisation-of-b2c-supply-chain-resource-allocation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42106.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4205</span> Enhancement of Capacity in a MC-CDMA based Cognitive Radio Network Using Non-Cooperative Game Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kalyani%20Kulkarni">Kalyani Kulkarni</a>, <a href="https://publications.waset.org/abstracts/search?q=Bharat%20Chaudhari"> Bharat Chaudhari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses the issue of resource allocation in the emerging cognitive technology. Focusing the quality of service (QoS) of primary users (PU), a novel method is proposed for the resource allocation of secondary users (SU). In this paper, we propose the unique utility function in the game theoretic model of Cognitive Radio which can be maximized to increase the capacity of the cognitive radio network (CRN) and to minimize the interference scenario. The utility function is formulated to cater the need of PUs by observing Signal to Noise ratio. The existence of Nash equilibrium is for the postulated game is established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20networks" title="cognitive networks">cognitive networks</a>, <a href="https://publications.waset.org/abstracts/search?q=game%20theory" title=" game theory"> game theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Nash%20equilibrium" title=" Nash equilibrium"> Nash equilibrium</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a> </p> <a href="https://publications.waset.org/abstracts/35688/enhancement-of-capacity-in-a-mc-cdma-based-cognitive-radio-network-using-non-cooperative-game-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35688.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">480</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4204</span> Resource Allocation of Small Agribusinesses and Entrepreneurship Development In Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Festus%20M.%20Epetimehin">Festus M. Epetimehin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Resources are essential materials required for production of goods and services. Effective allocation of these resources can engender the success of current business activities and its sustainability for future generation. The study examined effect of resource allocation of small agribusinesses on entrepreneurship development in Southwest Nigeria. Sample size of 385 was determined using Cochran’s formula. 350 valid copies of questionnaire were used in the analysis. In order to achieve the objective, research design (descriptive and cross sectional designs) was used to gather data for the study through the administration of questionnaire to respondents. Both descriptive and inferential statistics were used to investigate the objective of the study. The result obtained indicated that resource allocation by small agribusinesses had a substantial positive effect on entrepreneurship development with the p-value of (0.0000) which was less than the 5.0% critical value with a positive regression coefficient of 0.53. The implication of this is that the ability of the entrepreneurs to deploy their resources efficiently through adequate realization of better gross margin could enhance business activities and development. The study recommends that business owners still need some level of serious training and exposure on how to manage modern small agribusiness resources to enhance business performance. The intervention of Agricultural Development Programme (ADP) and other Agricultural institutions are needed in this regard. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=resource" title="resource">resource</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=small%20businesses" title=" small businesses"> small businesses</a>, <a href="https://publications.waset.org/abstracts/search?q=agriculture" title=" agriculture"> agriculture</a>, <a href="https://publications.waset.org/abstracts/search?q=entrepreneurship%20development" title=" entrepreneurship development"> entrepreneurship development</a> </p> <a href="https://publications.waset.org/abstracts/165736/resource-allocation-of-small-agribusinesses-and-entrepreneurship-development-in-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165736.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">51</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">4203</span> Optimization of Topology-Aware Job Allocation on a High-Performance Computing Cluster by Neural Simulated Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zekang%20Lan">Zekang Lan</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Xu"> Yan Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yingkun%20Huang"> Yingkun Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Dian%20Huang"> Dian Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shengzhong%20Feng"> Shengzhong Feng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Jobs on high-performance computing (HPC) clusters can suffer significant performance degradation due to inter-job network interference. Topology-aware job allocation problem (TJAP) is such a problem that decides how to dedicate nodes to specific applications to mitigate inter-job network interference. In this paper, we study the window-based TJAP on a fat-tree network aiming at minimizing the cost of communication hop, a defined inter-job interference metric. The window-based approach for scheduling repeats periodically, taking the jobs in the queue and solving an assignment problem that maps jobs to the available nodes. Two special allocation strategies are considered, i.e., static continuity assignment strategy (SCAS) and dynamic continuity assignment strategy (DCAS). For the SCAS, a 0-1 integer programming is developed. For the DCAS, an approach called neural simulated algorithm (NSA), which is an extension to simulated algorithm (SA) that learns a repair operator and employs them in a guided heuristic search, is proposed. The efficacy of NSA is demonstrated with a computational study against SA and SCIP. The results of numerical experiments indicate that both the model and algorithm proposed in this paper are effective. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high-performance%20computing" title="high-performance computing">high-performance computing</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20allocation" title=" job allocation"> job allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20simulated%20annealing" title=" neural simulated annealing"> neural simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=topology-aware" title=" topology-aware"> topology-aware</a> </p> <a href="https://publications.waset.org/abstracts/160964/optimization-of-topology-aware-job-allocation-on-a-high-performance-computing-cluster-by-neural-simulated-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160964.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">4202</span> Discretization of Cuckoo Optimization Algorithm for Solving Quadratic Assignment Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Kazemi">Elham Kazemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Quadratic%20Assignment%20Problem%20%28QAP%29" title="Quadratic Assignment Problem (QAP)">Quadratic Assignment Problem (QAP)</a>, <a href="https://publications.waset.org/abstracts/search?q=Discrete%20Cuckoo%20Optimization%20Algorithm%20%28DCOA%29" title=" Discrete Cuckoo Optimization Algorithm (DCOA)"> Discrete Cuckoo Optimization Algorithm (DCOA)</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithms" title=" meta-heuristic algorithms"> meta-heuristic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20algorithms" title=" optimization algorithms"> optimization algorithms</a> </p> <a href="https://publications.waset.org/abstracts/25249/discretization-of-cuckoo-optimization-algorithm-for-solving-quadratic-assignment-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25249.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">517</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">4201</span> Optimizing Resource Allocation and Indoor Location Using Bluetooth Low Energy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N%C3%A9stor%20%C3%81lvarez-D%C3%ADaz">Néstor Álvarez-Díaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Pino%20Caballero-Gil"> Pino Caballero-Gil</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%A9ctor%20Reboso-Morales"> Héctor Reboso-Morales</a>, <a href="https://publications.waset.org/abstracts/search?q=Francisco%20Mart%C3%ADn-Fern%C3%A1ndez"> Francisco Martín-Fernández</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The recent tendency of "Internet of Things" (IoT) has developed in the last years, causing the emergence of innovative communication methods among multiple devices. The appearance of Bluetooth Low Energy (BLE) has allowed a push to IoT in relation to smartphones. In this moment, a set of new applications related to several topics like entertainment and advertisement has begun to be developed but not much has been done till now to take advantage of the potential that these technologies can offer on many business areas and in everyday tasks. In the present work, the application of BLE technology and smartphones is proposed on some business areas related to the optimization of resource allocation in huge facilities like airports. An indoor location system has been developed through triangulation methods with the use of BLE beacons. The described system can be used to locate all employees inside the building in such a way that any task can be automatically assigned to a group of employees. It should be noted that this system cannot only be used to link needs with employees according to distances, but it also takes into account other factors like occupation level or category. In addition, it has been endowed with a security system to manage business and personnel sensitive data. The efficiency of communications is another essential characteristic that has been taken into account in this work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bluetooth%20low%20energy" title="bluetooth low energy">bluetooth low energy</a>, <a href="https://publications.waset.org/abstracts/search?q=indoor%20location" title=" indoor location"> indoor location</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20assignment" title=" resource assignment"> resource assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=smartphones" title=" smartphones"> smartphones</a> </p> <a href="https://publications.waset.org/abstracts/42890/optimizing-resource-allocation-and-indoor-location-using-bluetooth-low-energy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42890.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">394</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">4200</span> Qualitative Study Method on Case Assignment Adopted by Singapore Medical Social Workers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joleen%20L.%20H.%20Lee">Joleen L. H. Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20F.%20Yen"> K. F. Yen</a>, <a href="https://publications.waset.org/abstracts/search?q=Janette%20W.%20P.%20Ng"> Janette W. P. Ng</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Woon"> D. Woon</a>, <a href="https://publications.waset.org/abstracts/search?q=Mandy%20M.%20Y.%20Lau"> Mandy M. Y. Lau</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivan%20M.%20H.%20Woo"> Ivan M. H. Woo</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20N.%20Goh"> S. N. Goh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Case assignment systems are created to meet a need for equity in work distribution and better match between medical social workers' (MSWs) competencies and patients' problems. However, there is no known study that has explored how MSWs in Singapore assign cases to achieve equity in work distribution. Focus group discussions were conducted with MSWs from public hospitals to understand their perception on equitable workload and case allocation. Three approaches to case allocation were found. First is the point system where points are allocated to cases based on a checklist of presenting issues identified most of the time by non-MSWs. Intensity of case is taken into consideration, but allocation of points is often subject to variation in appreciation of roles of MSWs by the source of referral. Second is the round robin system, where all MSWs are allocated cases based on a roster. This approach resulted in perceived equity due to element of luck, but it does not match case complexity with competencies of MSWs. Third approach is unit-based allocation, where MSWs are assigned to attend to cases from specific unit. This approach helps facilitate specialization among MSWs but may result in MSWs having difficulty providing transdisciplinary care due to narrow set of knowledge and skills. Trade-offs resulted across existing approaches for case allocation by MSWs. Conversations are needed among Singapore MSWs to decide on a case allocation system that comes with trade-offs that are acceptable for patients and other key stakeholders of the care delivery system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=case%20allocation" title="case allocation">case allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=equity" title=" equity"> equity</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20social%20worker" title=" medical social worker"> medical social worker</a>, <a href="https://publications.waset.org/abstracts/search?q=work%20distribution" title=" work distribution"> work distribution</a> </p> <a href="https://publications.waset.org/abstracts/122201/qualitative-study-method-on-case-assignment-adopted-by-singapore-medical-social-workers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122201.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">125</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">4199</span> Optimal Resource Configuration and Allocation Planning Problem for Bottleneck Machines and Auxiliary Tools</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yin-Yann%20Chen">Yin-Yann Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Tzu-Ling%20Chen"> Tzu-Ling Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents the case of an actual Taiwanese semiconductor assembly and testing manufacturer. Three major bottleneck manufacturing processes, namely, die bond, wire bond, and molding, are analyzed to determine how to use finite resources to achieve the optimal capacity allocation. A medium-term capacity allocation planning model is developed by considering the optimal total profit to satisfy the promised volume demanded by customers and to obtain the best migration decision among production lines for machines and tools. Finally, sensitivity analysis based on the actual case is provided to explore the effect of various parameter levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacity%20planning" title="capacity planning">capacity planning</a>, <a href="https://publications.waset.org/abstracts/search?q=capacity%20allocation" title=" capacity allocation"> capacity allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20migration" title=" machine migration"> machine migration</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20configuration" title=" resource configuration"> resource configuration</a> </p> <a href="https://publications.waset.org/abstracts/49417/optimal-resource-configuration-and-allocation-planning-problem-for-bottleneck-machines-and-auxiliary-tools" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49417.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">460</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">4198</span> Performance Comparison of Resource Allocation without Feedback in Wireless Body Area Networks by Various Pseudo Orthogonal Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ojin%20Kwon">Ojin Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jin%20Yoon"> Yong-Jin Yoon</a>, <a href="https://publications.waset.org/abstracts/search?q=Liu%20Xin"> Liu Xin</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Hongbao"> Zhang Hongbao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Body Area Network (WBAN) is a short-range wireless communication around human body for various applications such as wearable devices, entertainment, military, and especially medical devices. WBAN attracts the attention of continuous health monitoring system including diagnostic procedure, early detection of abnormal conditions, and prevention of emergency situations. Compared to cellular network, WBAN system is more difficult to control inter- and inner-cell interference due to the limited power, limited calculation capability, mobility of patient, and non-cooperation among WBANs. In this paper, we compare the performance of resource allocation scheme based on several Pseudo Orthogonal Codewords (POCs) to mitigate inter-WBAN interference. Previously, the POCs are widely exploited for a protocol sequence and optical orthogonal code. Each POCs have different properties of auto- and cross-correlation and spectral efficiency according to its construction of POCs. To identify different WBANs, several different pseudo orthogonal patterns based on POCs exploits for resource allocation of WBANs. By simulating these pseudo orthogonal resource allocations of WBANs on MATLAB, we obtain the performance of WBANs according to different POCs and can analyze and evaluate the suitability of POCs for the resource allocation in the WBANs system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20body%20area%20network" title="wireless body area network">wireless body area network</a>, <a href="https://publications.waset.org/abstracts/search?q=body%20sensor%20network" title=" body sensor network"> body sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation%20without%20feedback" title=" resource allocation without feedback"> resource allocation without feedback</a>, <a href="https://publications.waset.org/abstracts/search?q=interference%20mitigation" title=" interference mitigation"> interference mitigation</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo%20orthogonal%20pattern" title=" pseudo orthogonal pattern"> pseudo orthogonal pattern</a> </p> <a href="https://publications.waset.org/abstracts/9490/performance-comparison-of-resource-allocation-without-feedback-in-wireless-body-area-networks-by-various-pseudo-orthogonal-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9490.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">353</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">4197</span> A QoE-driven Cross-layer Resource Allocation Scheme for High Traffic Service over Open Wireless Network Downlink</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liya%20Shan">Liya Shan</a>, <a href="https://publications.waset.org/abstracts/search?q=Qing%20Liao"> Qing Liao</a>, <a href="https://publications.waset.org/abstracts/search?q=Qinyue%20Hu"> Qinyue Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shantao%20Jiang"> Shantao Jiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Tao%20Wang"> Tao Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a Quality of Experience (QoE)-driven cross-layer resource allocation scheme for high traffic service over Open Wireless Network (OWN) downlink is proposed, and the related problem about the users in the whole cell including the users in overlap region of different cells has been solved.A method, in which assess models of the BestEffort service and the no-reference assess algorithm for video service are adopted, to calculate the Mean Opinion Score (MOS) value for high traffic service has been introduced. The cross-layer architecture considers the parameters in application layer, media access control layer and physical layer jointly. Based on this architecture and the MOS value, the Binary Constrained Particle Swarm Optimization (B_CPSO) algorithm is used to solve the cross-layer resource allocation problem. In addition,simulationresults show that the proposed scheme significantly outperforms other schemes in terms of maximizing average users’ MOS value for the whole system as well as maintaining fairness among users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high%20traffic%20service" title="high traffic service">high traffic service</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-layer%20resource%20allocation" title=" cross-layer resource allocation"> cross-layer resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=QoE" title=" QoE"> QoE</a>, <a href="https://publications.waset.org/abstracts/search?q=B_CPSO" title=" B_CPSO"> B_CPSO</a>, <a href="https://publications.waset.org/abstracts/search?q=OWN" title=" OWN"> OWN</a> </p> <a href="https://publications.waset.org/abstracts/20749/a-qoe-driven-cross-layer-resource-allocation-scheme-for-high-traffic-service-over-open-wireless-network-downlink" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20749.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">541</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">4196</span> Task Scheduling and Resource Allocation in Cloud-based on AHP Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Ahmadi">Zahra Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Fazlollah%20Adibnia"> Fazlollah Adibnia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling of tasks and the optimal allocation of resources in the cloud are based on the dynamic nature of tasks and the heterogeneity of resources. Applications that are based on the scientific workflow are among the most widely used applications in this field, which are characterized by high processing power and storage capacity. In order to increase their efficiency, it is necessary to plan the tasks properly and select the best virtual machine in the cloud. The goals of the system are effective factors in scheduling tasks and resource selection, which depend on various criteria such as time, cost, current workload and processing power. Multi-criteria decision-making methods are a good choice in this field. In this research, a new method of work planning and resource allocation in a heterogeneous environment based on the modified AHP algorithm is proposed. In this method, the scheduling of input tasks is based on two criteria of execution time and size. Resource allocation is also a combination of the AHP algorithm and the first-input method of the first client. Resource prioritization is done with the criteria of main memory size, processor speed and bandwidth. What is considered in this system to modify the AHP algorithm Linear Max-Min and Linear Max normalization methods are the best choice for the mentioned algorithm, which have a great impact on the ranking. The simulation results show a decrease in the average response time, return time and execution time of input tasks in the proposed method compared to similar methods (basic methods). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20analytical%20process" title="hierarchical analytical process">hierarchical analytical process</a>, <a href="https://publications.waset.org/abstracts/search?q=work%20prioritization" title=" work prioritization"> work prioritization</a>, <a href="https://publications.waset.org/abstracts/search?q=normalization" title=" normalization"> normalization</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20resource%20allocation" title=" heterogeneous resource allocation"> heterogeneous resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=scientific%20workflow" title=" scientific workflow"> scientific workflow</a> </p> <a href="https://publications.waset.org/abstracts/145792/task-scheduling-and-resource-allocation-in-cloud-based-on-ahp-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145792.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">4195</span> Predicting Data Center Resource Usage Using Quantile Regression to Conserve Energy While Fulfilling the Service Level Agreement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20I.%20Alutabi">Ahmed I. Alutabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Naghmeh%20Dezhabad"> Naghmeh Dezhabad</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudhakar%20Ganti"> Sudhakar Ganti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data centers have been growing in size and dema nd continuously in the last two decades. Planning for the deployment of resources has been shallow and always resorted to over-provisioning. Data center operators try to maximize the availability of their services by allocating multiple of the needed resources. One resource that has been wasted, with little thought, has been energy. In recent years, programmable resource allocation has paved the way to allow for more efficient and robust data centers. In this work, we examine the predictability of resource usage in a data center environment. We use a number of models that cover a wide spectrum of machine learning categories. Then we establish a framework to guarantee the client service level agreement (SLA). Our results show that using prediction can cut energy loss by up to 55%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=prediction" title=" prediction"> prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20center" title=" data center"> data center</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=green%20computing" title=" green computing"> green computing</a> </p> <a href="https://publications.waset.org/abstracts/147282/predicting-data-center-resource-usage-using-quantile-regression-to-conserve-energy-while-fulfilling-the-service-level-agreement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147282.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">108</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">4194</span> A Priority Based Imbalanced Time Minimization Assignment Problem: An Iterative Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ekta%20Jain">Ekta Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalpana%20Dahiya"> Kalpana Dahiya</a>, <a href="https://publications.waset.org/abstracts/search?q=Vanita%20Verma"> Vanita Verma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a priority based imbalanced time minimization assignment problem dealing with the allocation of n jobs to m < n persons in which the project is carried out in two stages, viz. Stage-I and Stage-II. Stage-I consists of n1 ( < m) primary jobs and Stage-II consists of remaining (n-n1) secondary jobs which are commenced only after primary jobs are finished. Each job is to be allocated to exactly one person, and each person has to do at least one job. It is assumed that nature of the Stage-I jobs is such that one person can do exactly one primary job whereas a person can do more than one secondary job in Stage-II. In a particular stage, all persons start doing the jobs simultaneously, but if a person is doing more than one job, he does them one after the other in any order. The aim of the proposed study is to find the feasible assignment which minimizes the total time for the two stage execution of the project. For this, an iterative algorithm is proposed, which at each iteration, solves a constrained imbalanced time minimization assignment problem to generate a pair of Stage-I and Stage-II times. For solving this constrained problem, an algorithm is developed in the current paper. Later, alternate combinations based method to solve the priority based imbalanced problem is also discussed and a comparative study is carried out. Numerical illustrations are provided in support of the theory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assignment" title="assignment">assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=imbalanced" title=" imbalanced"> imbalanced</a>, <a href="https://publications.waset.org/abstracts/search?q=priority" title=" priority"> priority</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20minimization" title=" time minimization"> time minimization</a> </p> <a href="https://publications.waset.org/abstracts/75198/a-priority-based-imbalanced-time-minimization-assignment-problem-an-iterative-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75198.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">234</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">4193</span> Nurse-Patient Assignment: Case of Pediatrics Department</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jihene%20Jlassi">Jihene Jlassi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Frikha"> Ahmed Frikha</a>, <a href="https://publications.waset.org/abstracts/search?q=Wazna%20Kortli"> Wazna Kortli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objectives of Nurse-Patient Assignment are the minimization of the overall hospital cost and the maximization of nurses ‘preferences. This paper aims to assess nurses' satisfaction related to the implementation of patient acuity tool-based assignments. So, we used an integer linear program that assigns patients to nurses while balancing nurse workloads. Then, the proposed model is applied to the Paediatrics Department at Kasserine Hospital Tunisia. Where patients need special acuities and high-level nursing skills and care. Hence, numerical results suggested that proposed nurse-patient assignment models can achieve a balanced assignment <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nurse-patient%20assignment" title="nurse-patient assignment">nurse-patient assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20model" title=" mathematical model"> mathematical model</a>, <a href="https://publications.waset.org/abstracts/search?q=logistics" title=" logistics"> logistics</a>, <a href="https://publications.waset.org/abstracts/search?q=pediatrics%20department" title=" pediatrics department"> pediatrics department</a>, <a href="https://publications.waset.org/abstracts/search?q=balanced%20assignment" title=" balanced assignment"> balanced assignment</a> </p> <a href="https://publications.waset.org/abstracts/148933/nurse-patient-assignment-case-of-pediatrics-department" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148933.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4192</span> Energy Efficient Resource Allocation and Scheduling in Cloud Computing Platform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shuen-Tai%20Wang">Shuen-Tai Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying-Chuan%20Chen"> Ying-Chuan Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu-Ching%20Lin"> Yu-Ching Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There has been renewal of interest in the relation between Green IT and cloud computing in recent years. Cloud computing has to be a highly elastic environment which provides stable services to users. The growing use of cloud computing facilities has caused marked energy consumption, putting negative pressure on electricity cost of computing center or data center. Each year more and more network devices, storages and computers are purchased and put to use, but it is not just the number of computers that is driving energy consumption upward. We could foresee that the power consumption of cloud computing facilities will double, triple, or even more in the next decade. This paper aims at resource allocation and scheduling technologies that are short of or have not well developed yet to reduce energy utilization in cloud computing platform. In particular, our approach relies on recalling services dynamically onto appropriate amount of the machines according to user’s requirement and temporarily shutting down the machines after finish in order to conserve energy. We present initial work on integration of resource and power management system that focuses on reducing power consumption such that they suffice for meeting the minimizing quality of service required by the cloud computing platform. <p class="card-text"><strong>Keywords:</strong> <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=energy%20utilization" title=" energy utilization"> energy utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20consumption" title=" power consumption"> power consumption</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a> </p> <a href="https://publications.waset.org/abstracts/55519/energy-efficient-resource-allocation-and-scheduling-in-cloud-computing-platform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55519.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">338</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">4191</span> Approaches and Implications of Working on Gender Equality under Corporate Social Responsibility: A Case Study of Two Corporate Social Responsibilities in India </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shilpa%20Vasavada">Shilpa Vasavada</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the 17 SustainableDevelopmentGoals focuses on gender equality. The paper is based on the learning derived from working with two Corporate Social Responsibility cases in India: one, CSR of an International Corporate and the other, CSR of a multi state national level corporate -on their efforts to integrate gender perspective in their agriculture and livestock based rural livelihood programs. The author tries to dissect how ‘gender equality’ is seen by these two CSRs, where the goals are different. The implications of a CSR’sunderstandingon ‘gender equality’ as a goal; versus CSR’s understanding of working 'with women for enhancing quantity or quality of production’ gets reflected in their orientation to staff, resource allocation, strategic level and in processes followed at the rural grassroots level. The paper comes up with examples of changes made at programmatic front when CSR understands and works with the focus on gender equality as a goal. On the other hand, the paper also explores the differential, at times, the negative impact on women and the programmes;- when the goals differ. The paper concludes with recommendations for CSRs to take up at their resource allocation and strategic level if gender equality is the goal- which has direct implication at their grassroots programmatic work. The author argues that if gender equality has to be implemented actually in spirit by a CSR, it requires change in mindset and thus an openness to changes in strategies and resource allocation pattern of the CSR and not simply adding on women in the way intervention has been going on. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gender%20equality" title="gender equality">gender equality</a>, <a href="https://publications.waset.org/abstracts/search?q=approaches" title=" approaches"> approaches</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20impact" title=" differential impact"> differential impact</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a> </p> <a href="https://publications.waset.org/abstracts/80690/approaches-and-implications-of-working-on-gender-equality-under-corporate-social-responsibility-a-case-study-of-two-corporate-social-responsibilities-in-india" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80690.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">196</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">4190</span> Exploring SSD Suitable Allocation Schemes Incompliance with Workload Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jae%20Young%20Park">Jae Young Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Hwansu%20Jung"> Hwansu Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Jong%20Tae%20Kim"> Jong Tae Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Whether the data has been well parallelized is an important factor in the Solid-State-Drive (SSD) performance. SSD parallelization is affected by allocation scheme and it is directly connected to SSD performance. There are dynamic allocation and static allocation in representative allocation schemes. Dynamic allocation is more adaptive in exploiting write operation parallelism, while static allocation is better in read operation parallelism. Therefore, it is hard to select the appropriate allocation scheme when the workload is mixed read and write operations. We simulated conditions on a few mixed data patterns and analyzed the results to help the right choice for better performance. As the results, if data arrival interval is long enough prior operations to be finished and continuous read intensive data environment static allocation is more suitable. Dynamic allocation performs the best on write performance and random data patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20allocation" title="dynamic allocation">dynamic allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=NAND%20flash%20based%20SSD" title=" NAND flash based SSD"> NAND flash based SSD</a>, <a href="https://publications.waset.org/abstracts/search?q=SSD%20parallelism" title=" SSD parallelism"> SSD parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20allocation" title=" static allocation"> static allocation</a> </p> <a href="https://publications.waset.org/abstracts/41931/exploring-ssd-suitable-allocation-schemes-incompliance-with-workload-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41931.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">339</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=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=140">140</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=141">141</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=joint%20BS%20assignment%20and%20resource%20allocation%20%28JBSRA%29&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>