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: allocation weight</title> <meta name="description" content="Search results for: allocation weight"> <meta name="keywords" content="allocation weight"> <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="allocation weight" 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="allocation weight"> <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> 4522</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: allocation weight</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4522</span> A New Reliability Allocation Method Based on Fuzzy Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Peng%20Li">Peng Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Chuanri%20Li"> Chuanri Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Tao%20Li"> Tao Li </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reliability allocation is quite important during early design and development stages for a system to apportion its specified reliability goal to subsystems. This paper improves the reliability fuzzy allocation method and gives concrete processes on determining the factor set, the factor weight set, judgment set, and multi-grade fuzzy comprehensive evaluation. To determine the weight of factor set, the modified trapezoidal numbers are proposed to reduce errors caused by subjective factors. To decrease the fuzziness in the fuzzy division, an approximation method based on linear programming is employed. To compute the explicit values of fuzzy numbers, centroid method of defuzzification is considered. An example is provided to illustrate the application of the proposed reliability allocation method based on fuzzy arithmetic. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability%20allocation" title="reliability allocation">reliability allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20arithmetic" title=" fuzzy arithmetic"> fuzzy arithmetic</a>, <a href="https://publications.waset.org/abstracts/search?q=allocation%20weight" title=" allocation weight"> allocation weight</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming "> linear programming </a> </p> <a href="https://publications.waset.org/abstracts/27101/a-new-reliability-allocation-method-based-on-fuzzy-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27101.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">342</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">4521</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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4520</span> Loss Allocation in Radial Distribution Networks for Loads of Composite Types</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sumit%20Banerjee">Sumit Banerjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandan%20Kumar%20Chanda"> Chandan Kumar Chanda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper presents allocation of active power losses and energy losses to consumers connected to radial distribution networks in a deregulated environment for loads of composite types. A detailed comparison among four algorithms, namely quadratic loss allocation, proportional loss allocation, pro rata loss allocation and exact loss allocation methods are presented. Quadratic and proportional loss allocations are based on identifying the active and reactive components of current in each branch and the losses are allocated to each consumer, pro rata loss allocation method is based on the load demand of each consumer and exact loss allocation method is based on the actual contribution of active power loss by each consumer. The effectiveness of the proposed comparison among four algorithms for composite load is demonstrated through an example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=composite%20type" title="composite type">composite type</a>, <a href="https://publications.waset.org/abstracts/search?q=deregulation" title=" deregulation"> deregulation</a>, <a href="https://publications.waset.org/abstracts/search?q=loss%20allocation" title=" loss allocation"> loss allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20distribution%20networks" title=" radial distribution networks"> radial distribution networks</a> </p> <a href="https://publications.waset.org/abstracts/42700/loss-allocation-in-radial-distribution-networks-for-loads-of-composite-types" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42700.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">286</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4519</span> Understanding the Nature of Capital Allocation Problem in Corporate Finance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meltem%20Gurunlu">Meltem Gurunlu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the central problems in corporate finance is the allocation of funds. This usually takes two forms: allocation of funds across firms in an economy or allocation of funds across projects or business units within a firm. The first one is typically related to the external markets (the bond market, the stock market, banks and finance companies) whereas the second form of the capital allocation is related to the internal capital markets in which corporate headquarters allocate capital to their business units. (within-group transfers, within-group credit markets, and within-group equity market). The main aim of this study is to investigate the nature of capital allocation dynamics by comparing the relevant studies carried out on external and internal capital markets with paying special significance to the business groups. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=internal%20capital%20markets" title="internal capital markets">internal capital markets</a>, <a href="https://publications.waset.org/abstracts/search?q=external%20capital%20markets" title=" external capital markets"> external capital markets</a>, <a href="https://publications.waset.org/abstracts/search?q=capital%20structure" title=" capital structure"> capital structure</a>, <a href="https://publications.waset.org/abstracts/search?q=capital%20allocation" title=" capital allocation"> capital allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=business%20groups" title=" business groups"> business groups</a>, <a href="https://publications.waset.org/abstracts/search?q=corporate%20finance" title=" corporate finance"> corporate finance</a> </p> <a href="https://publications.waset.org/abstracts/89423/understanding-the-nature-of-capital-allocation-problem-in-corporate-finance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89423.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">195</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">4518</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">4517</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">4516</span> Dynamic Bandwidth Allocation in Fiber-Wireless (FiWi) Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eman%20I.%20Raslan">Eman I. Raslan</a>, <a href="https://publications.waset.org/abstracts/search?q=Haitham%20S.%20Hamza"> Haitham S. Hamza</a>, <a href="https://publications.waset.org/abstracts/search?q=Reda%20A.%20El-Khoribi"> Reda A. El-Khoribi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fiber-Wireless (FiWi) networks are a promising candidate for future broadband access networks. These networks combine the optical network as the back end where different passive optical network (PON) technologies are realized and the wireless network as the front end where different wireless technologies are adopted, e.g. LTE, WiMAX, Wi-Fi, and Wireless Mesh Networks (WMNs). The convergence of both optical and wireless technologies requires designing architectures with robust efficient and effective bandwidth allocation schemes. Different bandwidth allocation algorithms have been proposed in FiWi networks aiming to enhance the different segments of FiWi networks including wireless and optical subnetworks. In this survey, we focus on the differentiating between the different bandwidth allocation algorithms according to their enhancement segment of FiWi networks. We classify these techniques into wireless, optical and Hybrid bandwidth allocation techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fiber-wireless%20%28FiWi%29" title="fiber-wireless (FiWi)">fiber-wireless (FiWi)</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20bandwidth%20allocation%20%28DBA%29" title=" dynamic bandwidth allocation (DBA)"> dynamic bandwidth allocation (DBA)</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20optical%20networks%20%28PON%29" title=" passive optical networks (PON)"> passive optical networks (PON)</a>, <a href="https://publications.waset.org/abstracts/search?q=media%20access%20control%20%28MAC%29" title=" media access control (MAC)"> media access control (MAC)</a> </p> <a href="https://publications.waset.org/abstracts/43649/dynamic-bandwidth-allocation-in-fiber-wireless-fiwi-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43649.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">531</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">4515</span> Design Criteria for an Internal Information Technology Cost Allocation to Support Business Information Technology Alignment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrea%20Schnabl">Andrea Schnabl</a>, <a href="https://publications.waset.org/abstracts/search?q=Mario%20Bernhart"> Mario Bernhart</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The controlling instrument of an internal cost allocation (IT chargeback) is commonly used to make IT costs transparent and controllable. Information Technology (IT) became, especially for information industries, a central competitive factor. Consequently, the focus is not on minimizing IT costs but on the strategic aligned application of IT. Hence, an internal IT cost allocation should be designed to enhance the business-IT alignment (strategic alignment of IT) in order to support the effective application of IT from a company’s point of view. To identify design criteria for an internal cost allocation to support business alignment a case study analysis at a typical medium-sized firm in information industry is performed. Documents, Key Performance Indicators, and cost accounting data over a period of 10 years are analyzed and interviews are performed. The derived design criteria are evaluated by 6 heads of IT departments from 6 different companies, which have an internal IT cost allocation at use. By applying these design criteria an internal cost allocation serves not only for cost controlling but also as an instrument in strategic IT management. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accounting%20for%20IT%20services" title="accounting for IT services">accounting for IT services</a>, <a href="https://publications.waset.org/abstracts/search?q=Business%20IT%20Alignment" title=" Business IT Alignment"> Business IT Alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=internal%20cost%20allocation" title=" internal cost allocation"> internal cost allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=IT%20controlling" title=" IT controlling"> IT controlling</a>, <a href="https://publications.waset.org/abstracts/search?q=IT%20governance" title=" IT governance"> IT governance</a>, <a href="https://publications.waset.org/abstracts/search?q=strategic%20IT%20management" title=" strategic IT management"> strategic IT management</a> </p> <a href="https://publications.waset.org/abstracts/93449/design-criteria-for-an-internal-information-technology-cost-allocation-to-support-business-information-technology-alignment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93449.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">155</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">4514</span> A Fuzzy Multiobjective Model for Bed Allocation Optimized by Artificial Bee Colony Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jalal%20Abdulkareem%20Sultan">Jalal Abdulkareem Sultan</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdulhakeem%20Luqman%20Hasan"> Abdulhakeem Luqman Hasan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the development of health care systems competition, hospitals face more and more pressures. Meanwhile, resource allocation has a vital effect on achieving competitive advantages in hospitals. Selecting the appropriate number of beds is one of the most important sections in hospital management. However, in real situation, bed allocation selection is a multiple objective problem about different items with vagueness and randomness of the data. It is very complex. Hence, research about bed allocation problem is relatively scarce under considering multiple departments, nursing hours, and stochastic information about arrival and service of patients. In this paper, we develop a fuzzy multiobjective bed allocation model for overcoming uncertainty and multiple departments. Fuzzy objectives and weights are simultaneously applied to help the managers to select the suitable beds about different departments. The proposed model is solved by using Artificial Bee Colony (ABC), which is a very effective algorithm. The paper describes an application of the model, dealing with a public hospital in Iraq. The results related that fuzzy multi-objective model was presented suitable framework for bed allocation and optimum use. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bed%20allocation%20problem" title="bed allocation problem">bed allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony" title=" artificial bee colony"> artificial bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a> </p> <a href="https://publications.waset.org/abstracts/45374/a-fuzzy-multiobjective-model-for-bed-allocation-optimized-by-artificial-bee-colony-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45374.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">324</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">4513</span> Game-Theory-Based on Downlink Spectrum Allocation in Two-Tier Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu%20Zhang">Yu Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ye%20Tian"> Ye Tian</a>, <a href="https://publications.waset.org/abstracts/search?q=Fang%20Ye%20Yixuan%20Kang"> Fang Ye Yixuan Kang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The capacity of conventional cellular networks has reached its upper bound and it can be well handled by introducing femtocells with low-cost and easy-to-deploy. Spectrum interference issue becomes more critical in peace with the value-added multimedia services growing up increasingly in two-tier cellular networks. Spectrum allocation is one of effective methods in interference mitigation technology. This paper proposes a game-theory-based on OFDMA downlink spectrum allocation aiming at reducing co-channel interference in two-tier femtocell networks. The framework is formulated as a non-cooperative game, wherein the femto base stations are players and frequency channels available are strategies. The scheme takes full account of competitive behavior and fairness among stations. In addition, the utility function reflects the interference from the standpoint of channels essentially. This work focuses on co-channel interference and puts forward a negative logarithm interference function on distance weight ratio aiming at suppressing co-channel interference in the same layer network. This scenario is more suitable for actual network deployment and the system possesses high robustness. According to the proposed mechanism, interference exists only when players employ the same channel for data communication. This paper focuses on implementing spectrum allocation in a distributed fashion. Numerical results show that signal to interference and noise ratio can be obviously improved through the spectrum allocation scheme and the users quality of service in downlink can be satisfied. Besides, the average spectrum efficiency in cellular network can be significantly promoted as simulations results shown. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=femtocell%20networks" title="femtocell networks">femtocell 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=interference%20mitigation" title=" interference mitigation"> interference mitigation</a>, <a href="https://publications.waset.org/abstracts/search?q=spectrum%20allocation" title=" spectrum allocation"> spectrum allocation</a> </p> <a href="https://publications.waset.org/abstracts/101456/game-theory-based-on-downlink-spectrum-allocation-in-two-tier-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101456.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">156</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">4512</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">4511</span> The Lexicographic Serial Rule</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thi%20Thao%20Nguyen">Thi Thao Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrew%20McLennan"> Andrew McLennan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shino%20Takayama"> Shino Takayama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the probabilistic allocation of finitely many indivisible objects to finitely many agents. Well known allocation rules for this problem include random priority, the market mechanism proposed by Hylland and Zeckhauser [1979], and the probabilistic serial rule of Bogomolnaia and Moulin [2001]. We propose a new allocation rule, which we call the lexico-graphic (serial) rule, that is tailored for situations in which each agent's primary concern is to maximize the probability of receiving her favourite object. Three axioms, lex efficiency, lex envy freeness and fairness, are proposed and fully characterize the lexicographic serial rule. We also discuss how our axioms and the lexicographic rule are related to other allocation rules, particularly the probabilistic serial rule. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Efficiency" title="Efficiency">Efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=Envy%20free" title=" Envy free"> Envy free</a>, <a href="https://publications.waset.org/abstracts/search?q=Lexicographic" title=" Lexicographic"> Lexicographic</a>, <a href="https://publications.waset.org/abstracts/search?q=Probabilistic%20Serial%20Rule" title=" Probabilistic Serial Rule"> Probabilistic Serial Rule</a> </p> <a href="https://publications.waset.org/abstracts/124573/the-lexicographic-serial-rule" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124573.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">4510</span> A Succinct Method for Allocation of Reactive Power Loss in Deregulated Scenario</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20S.%20Savier">J. S. Savier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Real power is the component power which is converted into useful energy whereas reactive power is the component of power which cannot be converted to useful energy but it is required for the magnetization of various electrical machineries. If the reactive power is compensated at the consumer end, the need for reactive power flow from generators to the load can be avoided and hence the overall power loss can be reduced. In this scenario, this paper presents a succinct method called JSS method for allocation of reactive power losses to consumers connected to radial distribution networks in a deregulated environment. The proposed method has the advantage that no assumptions are made while deriving the reactive power loss allocation method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deregulation" title="deregulation">deregulation</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20power%20loss%20allocation" title=" reactive power loss allocation"> reactive power loss allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20distribution%20systems" title=" radial distribution systems"> radial distribution systems</a>, <a href="https://publications.waset.org/abstracts/search?q=succinct%20method" title=" succinct method"> succinct method</a> </p> <a href="https://publications.waset.org/abstracts/47667/a-succinct-method-for-allocation-of-reactive-power-loss-in-deregulated-scenario" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47667.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">376</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">4509</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">4508</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">461</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4507</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">4506</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">4505</span> A Simulation Modeling Approach for Optimization of Storage Space Allocation in Container Terminal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gamal%20Abd%20El-Nasser%20A.%20Said">Gamal Abd El-Nasser A. Said</a>, <a href="https://publications.waset.org/abstracts/search?q=El-Sayed%20M.%20El-Horbaty"> El-Sayed M. El-Horbaty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Container handling problems at container terminals are NP-hard problems. This paper presents an approach using discrete-event simulation modeling to optimize solution for storage space allocation problem, taking into account all various interrelated container terminal handling activities. The proposed approach is applied on a real case study data of container terminal at Alexandria port. The computational results show the effectiveness of the proposed model for optimization of storage space allocation in container terminal where 54% reduction in containers handling time in port is achieved. <p class="card-text"><strong>Keywords:</strong> <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=discrete-event%20simulation" title=" discrete-event simulation"> discrete-event simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=storage%20space%20allocation" title=" storage space allocation "> storage space allocation </a> </p> <a href="https://publications.waset.org/abstracts/19699/a-simulation-modeling-approach-for-optimization-of-storage-space-allocation-in-container-terminal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19699.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">325</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">4504</span> Power Allocation Algorithm for Orthogonal Frequency Division Multiplexing Based Cognitive Radio Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bircan%20Demiral">Bircan Demiral</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cognitive radio (CR) is the promising technology that addresses the spectrum scarcity problem for future wireless communications. Orthogonal Frequency Division Multiplexing (OFDM) technology provides more power band ratios for cognitive radio networks (CRNs). While CR is a solution to the spectrum scarcity, it also brings up the capacity problem. In this paper, a novel power allocation algorithm that aims at maximizing the sum capacity in the OFDM based cognitive radio networks is proposed. Proposed allocation algorithm is based on the previously developed water-filling algorithm. To reduce the computational complexity calculating in water filling algorithm, proposed algorithm allocates the total power according to each subcarrier. The power allocated to the subcarriers increases sum capacity. To see this increase, Matlab program was used, and the proposed power allocation was compared with average power allocation, water filling and general power allocation algorithms. The water filling algorithm performed worse than the proposed algorithm while it performed better than the other two algorithms. The proposed algorithm is better than other algorithms in terms of capacity increase. In addition the effect of the change in the number of subcarriers on capacity was discussed. Simulation results show that the increase in the number of subcarrier increases the capacity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio%20network" title="cognitive radio network">cognitive radio network</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20allocation" title=" power allocation"> power allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20filling" title=" water filling"> water filling</a> </p> <a href="https://publications.waset.org/abstracts/92207/power-allocation-algorithm-for-orthogonal-frequency-division-multiplexing-based-cognitive-radio-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92207.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">137</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4503</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">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">4502</span> Virtual Routing Function Allocation Method for Minimizing Total Network Power Consumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kenichiro%20Hida">Kenichiro Hida</a>, <a href="https://publications.waset.org/abstracts/search?q=Shin-Ichi%20Kuribayashi"> Shin-Ichi Kuribayashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of network functions virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select their capacities and locations without any constraints. This paper focuses on the allocation of NFV-based routing functions which are one of critical network functions, and presents the virtual routing function allocation algorithm that minimizes the total power consumption. In addition, this study presents the useful allocation policy of virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy takes the ratio of the power consumption of a routing function to that of a circuit and traffic distribution between areas into consideration. Furthermore, the present paper shows that there are cases where the use of NFV-based routing functions makes it possible to reduce the total power consumption dramatically, in comparison to a conventional network, in which it is not economically viable to distribute small-capacity routing functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NFV" title="NFV">NFV</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=virtual%20routing%20function" title=" virtual routing function"> virtual routing function</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20power%20consumption" title=" minimum power consumption"> minimum power consumption</a> </p> <a href="https://publications.waset.org/abstracts/52508/virtual-routing-function-allocation-method-for-minimizing-total-network-power-consumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52508.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">341</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">4501</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">4500</span> Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijaya%20K.%20Srivastava">Vijaya K. Srivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=Davide%20Spinello"> Davide Spinello</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents established 3<strong><sup>n</sup></strong> enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Reliability%20Redundancy%20Allocation" title=" Reliability Redundancy Allocation"> Reliability Redundancy Allocation</a> </p> <a href="https://publications.waset.org/abstracts/107208/multi-objective-optimization-of-combined-system-reliability-and-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107208.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">172</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4499</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">4498</span> Body Weight Variation in Indian Heterogeneous Group-An Analytical Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20K.%20Srivastva">A. K. Srivastva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Body weight is considered as an important factor in health and fitness. It is an index of one's health. Considering significance of body weight and its wider application in various fields in general and sports in particular, it is made a point of enquiry in the present study. The purpose of the study to observe over all weight pattern of Indian youths in the age group of 15 through 20 years. Total 7500 samples pooled from ten Indian states ranging in their age 15 to 20 years were examined in six age categories. Conclusion: 1. The period between 15 to 20 year of age is a growing period and that body weight is gained during this period. 2. Statewise difference is observed in body-weight during the period, which is significant. 3. PRG indicated by higher rate of weight gain varies from state to state. 4. Sportsman possess comparatively higer level of body-weight than other student of same age group. 5. Tribal youths show comparatively better status in their weight gain than the untrained uraban dwellers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PRG%20%28period%20of%20rapid%20growth%29" title="PRG (period of rapid growth)">PRG (period of rapid growth)</a>, <a href="https://publications.waset.org/abstracts/search?q=HG%20%28heterogeneous%20group%29" title=" HG (heterogeneous group)"> HG (heterogeneous group)</a>, <a href="https://publications.waset.org/abstracts/search?q=WP%20%28weight%20pattern%29" title=" WP (weight pattern)"> WP (weight pattern)</a>, <a href="https://publications.waset.org/abstracts/search?q=MBW%20%28mean%20body%20weight%29" title=" MBW (mean body weight)"> MBW (mean body weight)</a> </p> <a href="https://publications.waset.org/abstracts/39375/body-weight-variation-in-indian-heterogeneous-group-an-analytical-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39375.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4497</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">4496</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">4495</span> A Novel Meta-Heuristic Algorithm Based on Cloud Theory for Redundancy Allocation Problem under Realistic Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Mousavi">H. Mousavi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharifi"> M. Sharifi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Pourvaziri"> H. Pourvaziri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Redundancy Allocation Problem (RAP) is a well-known mathematical problem for modeling series-parallel systems. It is a combinatorial optimization problem which focuses on determining an optimal assignment of components in a system design. In this paper, to be more practical, we have considered the problem of redundancy allocation of series system with interval valued reliability of components. Therefore, during the search process, the reliabilities of the components are considered as a stochastic variable with a lower and upper bounds. In order to optimize the problem, we proposed a simulated annealing based on cloud theory (CBSAA). Also, the Monte Carlo simulation (MCS) is embedded to the CBSAA to handle the random variable components’ reliability. This novel approach has been investigated by numerical examples and the experimental results have shown that the CBSAA combining MCS is an efficient tool to solve the RAP of systems with interval-valued component reliabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=redundancy%20allocation%20problem" title="redundancy allocation problem">redundancy allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20theory" title=" cloud theory"> cloud theory</a>, <a href="https://publications.waset.org/abstracts/search?q=monte%20carlo%20simulation" title=" monte carlo simulation"> monte carlo simulation</a> </p> <a href="https://publications.waset.org/abstracts/33681/a-novel-meta-heuristic-algorithm-based-on-cloud-theory-for-redundancy-allocation-problem-under-realistic-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33681.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4494</span> A Location-Allocation-Routing Model for a Home Health Care Supply Chain Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amir%20Mohammad%20Fathollahi%20Fard">Amir Mohammad Fathollahi Fard</a>, <a href="https://publications.waset.org/abstracts/search?q=Mostafa%20Hajiaghaei-Keshteli"> Mostafa Hajiaghaei-Keshteli</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Mahdi%20Paydar"> Mohammad Mahdi Paydar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With increasing life expectancy in developed countries, the role of home care services is highlighted by both academia and industrial contributors in Home Health Care Supply Chain (HHCSC) companies. The main decisions in such supply chain systems are the location of pharmacies, the allocation of patients to these pharmacies and also the routing and scheduling decisions of nurses to visit their patients. In this study, for the first time, an integrated model is proposed to consist of all preliminary and necessary decisions in these companies, namely, location-allocation-routing model. This model is a type of NP-hard one. Therefore, an Imperialist Competitive Algorithm (ICA) is utilized to solve the model, especially in large sizes. Results confirm the efficiency of the developed model for HHCSC companies as well as the performance of employed ICA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=home%20health%20care%20supply%20chain" title="home health care supply chain">home health care supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=location-allocation-routing%20problem" title=" location-allocation-routing problem"> location-allocation-routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=imperialist%20competitive%20algorithm" title=" imperialist competitive algorithm"> imperialist competitive algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/82335/a-location-allocation-routing-model-for-a-home-health-care-supply-chain-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82335.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">397</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4493</span> Weight Comparison of Oil and Dry Type Distribution Transformers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Murat%20Toren">Murat Toren</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20%C3%87elebi"> Mehmet Çelebi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reducing the weight of transformers while providing good performance, cost reduction and increased efficiency is important. Weight is one of the most significant factors in all electrical machines, and as such, many transformer design parameters are related to weight calculations. This study presents a comparison of the weight of oil type transformers and dry type transformer weight. Oil type transformers are mainly used in industry; however, dry type transformers are becoming more widespread in recent years. MATLAB is typically used for designing transformers and design parameters (rated voltages, core loss, etc.) along with design in ANSYS Maxwell. Similar to other studies, this study presented that the dry type transformer option is limited. Moreover, the commonly-used 50 kVA distribution transformers in the industry are oil type and dry type transformers are designed and considered in terms of weight. Currently, the preference for low-cost oil-type transformers would change if costs for dry-type transformer were more competitive. The aim of this study was to compare the weight of transformers, which is a substantial cost factor, and to provide an evaluation about increasing the use of dry type transformers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weight" title="weight">weight</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=oil-type%20transformers" title=" oil-type transformers"> oil-type transformers</a>, <a href="https://publications.waset.org/abstracts/search?q=dry-type%20transformers" title=" dry-type transformers"> dry-type transformers</a> </p> <a href="https://publications.waset.org/abstracts/49059/weight-comparison-of-oil-and-dry-type-distribution-transformers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49059.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">354</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=allocation%20weight&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&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=allocation%20weight&page=150">150</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&page=151">151</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=allocation%20weight&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>