Search results for: free allocation
4146 Power Allocation in User-Centric Cell-Free Massive Multiple-Input Multiple-Output Systems with Limited Fronthaul Capacity
Authors: Siminfar Samakoush Galougah
Abstract:
In this paper, we study two power allocation problems for an uplink user-centric (UC) cell-free massive multiple-input multiple-output (CF-mMIMO) system. Besides, we assume each access point (AP) is connected to a central processing unit (CPU) via a fronthaul link with limited capacity. To efficiently use the fronthaul capacity, two strategies for transmitting signals from APs to the CPU are employed, namely, compress-forward estimate (CFE), estimate-compress-forward (ECF). The capacity of the aforementioned strategies in user-centric CF-mMIMO is drived. Then, we solved the two power allocation problems with minimum Spectral Efficiency (SE) and sum-SE maximization objectives for ECF and CFE strategies.Keywords: cell-free massive MIMO, limited capacity fronthaul, spectral efficiency
Procedia PDF Downloads 774145 Exploring SSD Suitable Allocation Schemes Incompliance with Workload Patterns
Authors: Jae Young Park, Hwansu Jung, Jong Tae Kim
Abstract:
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.Keywords: dynamic allocation, NAND flash based SSD, SSD parallelism, static allocation
Procedia PDF Downloads 3434144 The Lexicographic Serial Rule
Authors: Thi Thao Nguyen, Andrew McLennan, Shino Takayama
Abstract:
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.Keywords: Efficiency, Envy free, Lexicographic, Probabilistic Serial Rule
Procedia PDF Downloads 1544143 Loss Allocation in Radial Distribution Networks for Loads of Composite Types
Authors: Sumit Banerjee, Chandan Kumar Chanda
Abstract:
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.Keywords: composite type, deregulation, loss allocation, radial distribution networks
Procedia PDF Downloads 2914142 Providing a Road Pricing and Toll Allocation Method for Toll Roads
Authors: Ali Babaei
Abstract:
There is a worldwide growing tendency toward construction of infrastructures with the possibility of private sector participation instead of free exploitation of public infrastructures. The construction and development of roads through private sector participation is performed by different countries because of appropriate results and benefits such as compensation of public budget deficit in road construction and maintenance and responding to traffic growth (demand). Toll is the most definite form of budget provision in road development. There are two issues in the toll rate assignment: A. costing of transport, B. Cost allocation and distribution of cost between different types of vehicles as each vehicle pay its own share. There can be different goals in toll collection and its extent is variable according to the strategy of toll collection. Costing principles in different countries are based on inclusion of the whole transport and not peculiar to the toll roads. For example, fuel tax policy functions where the road network users pay transportation cost (not just users of toll road). Whereas transportation infrastructures in Iran are free, these methods are not applicable. In Iran, different toll freeways have built by public investment and government provides participation in the road construction through encouragement of financial institutions. In this paper, the existing policies about the toll roads are studied and then the appropriate method of costing and cost allocation to different vehicles is introduced.Keywords: toll allocation, road pricing, transportation, financial and industrial systems
Procedia PDF Downloads 3684141 Understanding the Nature of Capital Allocation Problem in Corporate Finance
Authors: Meltem Gurunlu
Abstract:
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.Keywords: internal capital markets, external capital markets, capital structure, capital allocation, business groups, corporate finance
Procedia PDF Downloads 2004140 A New Reliability Allocation Method Based on Fuzzy Numbers
Authors: Peng Li, Chuanri Li, Tao Li
Abstract:
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.Keywords: reliability allocation, fuzzy arithmetic, allocation weight, linear programming
Procedia PDF Downloads 3484139 Spectrum Allocation Using Cognitive Radio in Wireless Mesh Networks
Authors: Ayoub Alsarhan, Ahmed Otoom, Yousef Kilani, Abdel-Rahman al-GHuwairi
Abstract:
Wireless mesh networks (WMNs) have emerged recently to improve internet access and other networking services. WMNs provide network access to the clients and other networking functions such as routing, and packet forwarding. Spectrum scarcity is the main challenge that limits the performance of WMNs. Cognitive radio is proposed to solve spectrum scarcity problem. In this paper, we consider a cognitive wireless mesh network where unlicensed users (secondary users, SUs) can access free spectrum that is allocated to spectrum owners (primary users, PUs). Although considerable research has been conducted on spectrum allocation, spectrum assignment is still considered an important challenging problem. This problem can be solved using cognitive radio technology that allows SUs to intelligently locate free bands and access them without interfering with PUs. Our scheme considers several heuristics for spectrum allocation. These heuristics include: channel error rate, PUs activities, channel capacity and channel switching time. Performance evaluation of the proposed scheme shows that the scheme is able to allocate the unused spectrum for SUs efficiently.Keywords: cognitive radio, dynamic spectrum access, spectrum management, spectrum sharing, wireless mesh networks
Procedia PDF Downloads 5334138 An Improved VM Allocation Algorithm by Utilizing Combined Resource Allocation Mechanism and Released Resources in Cloud Environment
Authors: Md Habibul Ansary, Chandan Garai, Ranjan Dasgupta
Abstract:
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.Keywords: Bid ratio, cloud service, virtualization, VM allocation problem
Procedia PDF Downloads 4014137 A New Method to Winner Determination for Economic Resource Allocation in Cloud Computing Systems
Authors: Ebrahim Behrouzian Nejad, Rezvan Alipoor Sabzevari
Abstract:
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.Keywords: cloud computing, resource allocation, double auction, winner determination
Procedia PDF Downloads 3694136 Dynamic Bandwidth Allocation in Fiber-Wireless (FiWi) Networks
Authors: Eman I. Raslan, Haitham S. Hamza, Reda A. El-Khoribi
Abstract:
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.Keywords: fiber-wireless (FiWi), dynamic bandwidth allocation (DBA), passive optical networks (PON), media access control (MAC)
Procedia PDF Downloads 5344135 Design Criteria for an Internal Information Technology Cost Allocation to Support Business Information Technology Alignment
Authors: Andrea Schnabl, Mario Bernhart
Abstract:
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.Keywords: accounting for IT services, Business IT Alignment, internal cost allocation, IT controlling, IT governance, strategic IT management
Procedia PDF Downloads 1574134 A Fuzzy Multiobjective Model for Bed Allocation Optimized by Artificial Bee Colony Algorithm
Authors: Jalal Abdulkareem Sultan, Abdulhakeem Luqman Hasan
Abstract:
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.Keywords: bed allocation problem, fuzzy logic, artificial bee colony, multi-objective optimization
Procedia PDF Downloads 3304133 Mathematical Model and Algorithm for the Berth and Yard Resource Allocation at Seaports
Authors: Ming Liu, Zhihui Sun, Xiaoning Zhang
Abstract:
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.Keywords: branch-and-price, container terminal, joint scheduling, maritime logistics
Procedia PDF Downloads 2964132 A Succinct Method for Allocation of Reactive Power Loss in Deregulated Scenario
Authors: J. S. Savier
Abstract:
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.Keywords: deregulation, reactive power loss allocation, radial distribution systems, succinct method
Procedia PDF Downloads 3824131 Optimisation of B2C Supply Chain Resource Allocation
Authors: Firdaous Zair, Zoubir Elfelsoufi, Mohammed Fourka
Abstract:
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.Keywords: e-commerce, supply chain, B2C, optimisation, resource allocation
Procedia PDF Downloads 2784130 Optimal Resource Configuration and Allocation Planning Problem for Bottleneck Machines and Auxiliary Tools
Authors: Yin-Yann Chen, Tzu-Ling Chen
Abstract:
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.Keywords: capacity planning, capacity allocation, machine migration, resource configuration
Procedia PDF Downloads 4634129 Understanding How Democratic Governance Influence Resource Allocation and Utilisation in Economies in Transition: The Case of Cameroon
Authors: Terence Maisah Seka
Abstract:
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.Keywords: democratic governance, resource allocation, utilisation, Cameroon
Procedia PDF Downloads 1934128 Study on Resource Allocation of Cloud Operating System Based on Multi-Tenant Data Resource Sharing Technology
Authors: Lin Yunuo, Seow Xing Quan, Burra Venkata Durga Kumar
Abstract:
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.Keywords: cloud computing, cloud operation system, multitenancy, resource allocation, utilization of cloud resources
Procedia PDF Downloads 934127 A Simulation Modeling Approach for Optimization of Storage Space Allocation in Container Terminal
Authors: Gamal Abd El-Nasser A. Said, El-Sayed M. El-Horbaty
Abstract:
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.Keywords: container terminal, discrete-event simulation, optimization, storage space allocation
Procedia PDF Downloads 3324126 Power Allocation Algorithm for Orthogonal Frequency Division Multiplexing Based Cognitive Radio Networks
Authors: Bircan Demiral
Abstract:
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.Keywords: cognitive radio network, OFDM, power allocation, water filling
Procedia PDF Downloads 1434125 Mobile Agents-Based Framework for Dynamic Resource Allocation in Cloud Computing
Authors: Safia Rabaaoui, Héla Hachicha, Ezzeddine Zagrouba
Abstract:
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.Keywords: cloud computing, multi-agent system, mobile agent, dynamic resource allocation, cost, makespan
Procedia PDF Downloads 1114124 Virtual Routing Function Allocation Method for Minimizing Total Network Power Consumption
Authors: Kenichiro Hida, Shin-Ichi Kuribayashi
Abstract:
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.Keywords: NFV, resource allocation, virtual routing function, minimum power consumption
Procedia PDF Downloads 3484123 Resource Allocation Scheme For IEEE802.16 Networks
Authors: Elmabruk Laias
Abstract:
IEEE Standard 802.16 provides QoS (Quality of Service) for the applications such as Voice over IP, video streaming and high bandwidth file 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 efficiency 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 significantly improved, especially for the service flows of higher-priority classes.Keywords: IEEE 802.16, WiMAX, OFDMA, resource allocation, uplink-downlink mapping
Procedia PDF Downloads 4794122 Covariate-Adjusted Response-Adaptive Designs for Semi-Parametric Survival Responses
Authors: Ayon Mukherjee
Abstract:
Covariate-adjusted response-adaptive (CARA) designs use the available responses to skew the treatment allocation in a clinical trial in towards treatment found at an interim stage to be best for a given patient's covariate profile. Extensive research has been done on various aspects of CARA designs with the patient responses assumed to follow a parametric model. However, ranges of application for such designs are limited in real-life clinical trials where the responses infrequently fit a certain parametric form. On the other hand, robust estimates for the covariate-adjusted treatment effects are obtained from the parametric assumption. To balance these two requirements, designs are developed which are free from distributional assumptions about the survival responses, relying only on the assumption of proportional hazards for the two treatment arms. The proposed designs are developed by deriving two types of optimum allocation designs, and also by using a distribution function to link the past allocation, covariate and response histories to the present allocation. The optimal designs are based on biased coin procedures, with a bias towards the better treatment arm. These are the doubly-adaptive biased coin design (DBCD) and the efficient randomized adaptive design (ERADE). The treatment allocation proportions for these designs converge to the expected target values, which are functions of the Cox regression coefficients that are estimated sequentially. These expected target values are derived based on constrained optimization problems and are updated as information accrues with sequential arrival of patients. The design based on the link function is derived using the distribution function of a probit model whose parameters are adjusted based on the covariate profile of the incoming patient. To apply such designs, the treatment allocation probabilities are sequentially modified based on the treatment allocation history, response history, previous patients’ covariates and also the covariates of the incoming patient. Given these information, an expression is obtained for the conditional probability of a patient allocation to a treatment arm. Based on simulation studies, it is found that the ERADE is preferable to the DBCD when the main aim is to minimize the variance of the observed allocation proportion and to maximize the power of the Wald test for a treatment difference. However, the former procedure being discrete tends to be slower in converging towards the expected target allocation proportion. The link function based design achieves the highest skewness of patient allocation to the best treatment arm and thus ethically is the best design. Other comparative merits of the proposed designs have been highlighted and their preferred areas of application are discussed. It is concluded that the proposed CARA designs can be considered as suitable alternatives to the traditional balanced randomization designs in survival trials in terms of the power of the Wald test, provided that response data are available during the recruitment phase of the trial to enable adaptations to the designs. Moreover, the proposed designs enable more patients to get treated with the better treatment during the trial thus making the designs more ethically attractive to the patients. An existing clinical trial has been redesigned using these methods.Keywords: censored response, Cox regression, efficiency, ethics, optimal allocation, power, variability
Procedia PDF Downloads 1674121 Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem
Authors: Vijaya K. Srivastava, Davide Spinello
Abstract:
This paper presents established 3n 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.Keywords: integer programming, mixed integer programming, multi-objective optimization, Reliability Redundancy Allocation
Procedia PDF Downloads 1754120 Qualitative Study Method on Case Assignment Adopted by Singapore Medical Social Workers
Authors: Joleen L. H. Lee, K. F. Yen, Janette W. P. Ng, D. Woon, Mandy M. Y. Lau, Ivan M. H. Woo, S. N. Goh
Abstract:
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.Keywords: case allocation, equity, medical social worker, work distribution
Procedia PDF Downloads 1324119 Enhancement of Capacity in a MC-CDMA based Cognitive Radio Network Using Non-Cooperative Game Model
Authors: Kalyani Kulkarni, Bharat Chaudhari
Abstract:
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.Keywords: cognitive networks, game theory, Nash equilibrium, resource allocation
Procedia PDF Downloads 4854118 Resource Allocation of Small Agribusinesses and Entrepreneurship Development In Nigeria
Authors: Festus M. Epetimehin
Abstract:
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.Keywords: resource, resource allocation, small businesses, agriculture, entrepreneurship development
Procedia PDF Downloads 584117 A Novel Meta-Heuristic Algorithm Based on Cloud Theory for Redundancy Allocation Problem under Realistic Condition
Authors: H. Mousavi, M. Sharifi, H. Pourvaziri
Abstract:
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.Keywords: redundancy allocation problem, simulated annealing, cloud theory, monte carlo simulation
Procedia PDF Downloads 416