• Title/Summary/Keyword: Allocation methods

Search Result 703, Processing Time 0.03 seconds

LS code pair setting and sequential allocation methods

  • Wook, Roh-Dong
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.221-224
    • /
    • 2001
  • A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

  • PDF

The Study on the Dynamic Bandwidth Allocation Algorithm using by Cell Delay Variation (셀지연변이를 이용한 동적 대역폭 할당 알고리즘에 관한 연구)

  • 신승호;박상민
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.131-134
    • /
    • 2000
  • Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

  • PDF

Efficient Slice Allocation Method using Cluster Technology in Fifth-Generation Core Networks

  • Park, Sang-Myeon;Mun, Young-Song
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.3
    • /
    • pp.185-190
    • /
    • 2019
  • The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

Dynamic power and bandwidth allocation for DVB-based LEO satellite systems

  • Satya Chan;Gyuseong Jo;Sooyoung Kim;Daesub Oh;Bon-Jun Ku
    • ETRI Journal
    • /
    • v.44 no.6
    • /
    • pp.955-965
    • /
    • 2022
  • A low Earth orbit (LEO) satellite constellation could be used to provide network coverage for the entire globe. This study considers multi-beam frequency reuse in LEO satellite systems. In such a system, the channel is time-varying due to the fast movement of the satellite. This study proposes an efficient power and bandwidth allocation method that employs two linear machine learning algorithms and take channel conditions and traffic demand (TD) as input. With the aid of a simple linear system, the proposed scheme allows for the optimum allocation of resources under dynamic channel and TD conditions. Additionally, efficient projection schemes are added to the proposed method so that the provided capacity is best approximated to TD when TD exceeds the maximum allowable system capacity. The simulation results show that the proposed method outperforms existing methods.

Computation Offloading with Resource Allocation Based on DDPG in MEC

  • Sungwon Moon;Yujin Lim
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.226-238
    • /
    • 2024
  • Recently, multi-access edge computing (MEC) has emerged as a promising technology to alleviate the computing burden of vehicular terminals and efficiently facilitate vehicular applications. The vehicle can improve the quality of experience of applications by offloading their tasks to MEC servers. However, channel conditions are time-varying due to channel interference among vehicles, and path loss is time-varying due to the mobility of vehicles. The task arrival of vehicles is also stochastic. Therefore, it is difficult to determine an optimal offloading with resource allocation decision in the dynamic MEC system because offloading is affected by wireless data transmission. In this paper, we study computation offloading with resource allocation in the dynamic MEC system. The objective is to minimize power consumption and maximize throughput while meeting the delay constraints of tasks. Therefore, it allocates resources for local execution and transmission power for offloading. We define the problem as a Markov decision process, and propose an offloading method using deep reinforcement learning named deep deterministic policy gradient. Simulation shows that, compared with existing methods, the proposed method outperforms in terms of throughput and satisfaction of delay constraints.

A Study on Sample Allocation for Stratified Sampling (층화표본에서의 표본 배분에 대한 연구)

  • Lee, Ingue;Park, Mingue
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.6
    • /
    • pp.1047-1061
    • /
    • 2015
  • Stratified random sampling is a powerful sampling strategy to reduce variance of the estimators by incorporating useful auxiliary information to stratify the population. Sample allocation is the one of the important decisions in selecting a stratified random sample. There are two common methods, the proportional allocation and Neyman allocation if we could assume data collection cost for different observation units equal. Theoretically, Neyman allocation considering the size and standard deviation of each stratum, is known to be more effective than proportional allocation which incorporates only stratum size information. However, if the information on the standard deviation is inaccurate, the performance of Neyman allocation is in doubt. It has been pointed out that Neyman allocation is not suitable for multi-purpose sample survey that requires the estimation of several characteristics. In addition to sampling error, non-response error is another factor to evaluate sampling strategy that affects the statistical precision of the estimator. We propose new sample allocation methods using the available information about stratum response rates at the designing stage to improve stratified random sampling. The proposed methods are efficient when response rates differ considerably among strata. In particular, the method using population sizes and response rates improves the Neyman allocation in multi-purpose sample survey.

A Study on Risk Parity Asset Allocation Model with XGBoos (XGBoost를 활용한 리스크패리티 자산배분 모형에 관한 연구)

  • Kim, Younghoon;Choi, HeungSik;Kim, SunWoong
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.1
    • /
    • pp.135-149
    • /
    • 2020
  • Artificial intelligences are changing world. Financial market is also not an exception. Robo-Advisor is actively being developed, making up the weakness of traditional asset allocation methods and replacing the parts that are difficult for the traditional methods. It makes automated investment decisions with artificial intelligence algorithms and is used with various asset allocation models such as mean-variance model, Black-Litterman model and risk parity model. Risk parity model is a typical risk-based asset allocation model which is focused on the volatility of assets. It avoids investment risk structurally. So it has stability in the management of large size fund and it has been widely used in financial field. XGBoost model is a parallel tree-boosting method. It is an optimized gradient boosting model designed to be highly efficient and flexible. It not only makes billions of examples in limited memory environments but is also very fast to learn compared to traditional boosting methods. It is frequently used in various fields of data analysis and has a lot of advantages. So in this study, we propose a new asset allocation model that combines risk parity model and XGBoost machine learning model. This model uses XGBoost to predict the risk of assets and applies the predictive risk to the process of covariance estimation. There are estimated errors between the estimation period and the actual investment period because the optimized asset allocation model estimates the proportion of investments based on historical data. these estimated errors adversely affect the optimized portfolio performance. This study aims to improve the stability and portfolio performance of the model by predicting the volatility of the next investment period and reducing estimated errors of optimized asset allocation model. As a result, it narrows the gap between theory and practice and proposes a more advanced asset allocation model. In this study, we used the Korean stock market price data for a total of 17 years from 2003 to 2019 for the empirical test of the suggested model. The data sets are specifically composed of energy, finance, IT, industrial, material, telecommunication, utility, consumer, health care and staple sectors. We accumulated the value of prediction using moving-window method by 1,000 in-sample and 20 out-of-sample, so we produced a total of 154 rebalancing back-testing results. We analyzed portfolio performance in terms of cumulative rate of return and got a lot of sample data because of long period results. Comparing with traditional risk parity model, this experiment recorded improvements in both cumulative yield and reduction of estimated errors. The total cumulative return is 45.748%, about 5% higher than that of risk parity model and also the estimated errors are reduced in 9 out of 10 industry sectors. The reduction of estimated errors increases stability of the model and makes it easy to apply in practical investment. The results of the experiment showed improvement of portfolio performance by reducing the estimated errors of the optimized asset allocation model. Many financial models and asset allocation models are limited in practical investment because of the most fundamental question of whether the past characteristics of assets will continue into the future in the changing financial market. However, this study not only takes advantage of traditional asset allocation models, but also supplements the limitations of traditional methods and increases stability by predicting the risks of assets with the latest algorithm. There are various studies on parametric estimation methods to reduce the estimated errors in the portfolio optimization. We also suggested a new method to reduce estimated errors in optimized asset allocation model using machine learning. So this study is meaningful in that it proposes an advanced artificial intelligence asset allocation model for the fast-developing financial markets.

An Dynamic Optimal Allocation for the Stratified Randomized Response Technique (층화확률화 응답기법에 대한 동적 최적배분)

  • Son, Chang-Kyoon;Hong, Ki-Hak;Lee, Gi-Sung
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.4
    • /
    • pp.595-603
    • /
    • 2009
  • Typically the standard optimal allocation method distributes the sample for each stratum considering survey cost. In case of varying survey cost for each survey unit, we need to consider more practical allocation method. In other words, according to characteristics of an individual unit, we consider the optimal dynamic allocation method which first selects the survey unit having maximum value of benefit cost ratio. In terms of this, the proposed allocation method is different from standard optimal allocation method which allocate samples for each stratum and selects the random sample according to each size of sample. This paper is considered the dynamic optimal allocation method for the stratified randomized response technique which surveys for sensitive characteristic of survey units such as drug abuse, abortion, alcoholic. We prove the practical usefulness of proposed method using the numerical example.

A Study on the Spatial Allocation Planning of Dental Care Departments in Dental Hospital in Korea (한국 치과병원내 진료과목의 공간배분계획에 관한 연구)

  • Jeong, Taejong;Choi, Jaepil
    • Journal of The Korea Institute of Healthcare Architecture
    • /
    • v.23 no.4
    • /
    • pp.27-36
    • /
    • 2017
  • Purpose: The characteristics of spatial allocation planning in dentistry through examining the dental hospitals in Korea and comparison between them are necessary for the development of planning of the dental healthcare system. This study has been started to provide basic informations such as zoning, allocation distribution, and space configuration for the planning of dental hospital architecture. Methods: Literature review of dental care departments and investigation on current status of dental hospital in Korea have been conducted. The spatial allocation and space configuration of eleven dental hospitals have been analyzed. Results: The result of this study can be summarized in three points. The first one is that dental hospitals in Korea are consisted with eight to eleven dental care departments and they are divided with the horizontal allocation type with three to four departments in a floor for the spatial communication or the vertical allocation type with a department in each floor for the independent space. The second one is that oral medicine and oral maxillofacial radiology are located near the main entrance, orthodontics and pedodontic dentistry in lower level, prosthodontics in upper level, and conservative dentistry and periodontics have no specific spatial consideration. The third one is that the factors to consider the allocation planning are zoning for examination & diagnosis, basic practice, adolescence, surgery, circulations for patient, dentist, staff, different access for department like as easy access for reception and pedodontic dentistry, enclosure space for prosthodontics and surgery, frequency of visit and treatment care time, and change of treatment concept from treatment department to disease control corporative practice. Implications: This study is the starting point for the research of spatial configuration in dentistry and it is necessary to analyze the architectural planning to develop the dental healthcare system.

Analysis of Productivity Differences in Steel Bridge Manufacturing Plants According to Resource Allocation Methods for the Bottleneck (병목공정 자원할당 방식에 따른 강교 제작공장 생산성 차이 분석)

  • Lee, Jaeil;Jeong, Eunji;Jeong, Keunchae
    • Korean Journal of Construction Engineering and Management
    • /
    • v.24 no.2
    • /
    • pp.37-49
    • /
    • 2023
  • In this study, we proposed resource allocation methodologies to improve the productivity of steel bridge manufacturing plants based on the constraint theory which is very popular in the area of manufacturing industries. To this end, after defining the painting process as a bottleneck, three resource allocation methodologies were developed: Operation Specific Resource Allocation (OSRA), Product Specific Resource Allocation (PSRA), and General Resource Allocation (GRA). As a result of experiments for performance evaluation using a simulation model of the steel bridge supply chain, GRA showed the best performance in terms of the Number of Work-In-Process (NWIP) and Waiting Time (WT), in particular, as workload itself and its variability were increased, the performance gap with the specific resource allocation became further deepened. On average, GRA reduced NWIP by 36.2% and WT by 34.6% compared to OSRA, and reduced NWIP by 71.0% and WT by 70.4% compared to PSRA. The reduction of NWIP and WT means alleviating the bottleneck of the painting process, which eventually means that the productivity of the steel bridge manufacturing plant has improved.