• 보건행정학회지
• /
• 제10권4호
• /
• pp.99-115
• /
• 2000

This study was conducted to get a resonable set of budget allocation to public health programs. Matrix Delphi technique was used to obtain the logic of study results and eventually to form a human model which could predict opinion of professionals on budget allocation. Thirty-two professionals in academic and governmental area responded to Delphi survey. Questionnaire was developed using matrix formation, and the matrix was formed by 6 decision criteria on budget allocation and 26 public health programs. The decision criteria are as following: size of problem(morbidity), severity of problem, social equity, importance of prevention, technical feasibility and efficiency of programs. Severity of problem dropped out of the model because it had significant correlation with the size of problem. A total score of each program was obtained by weighting the relative importance of each criteria which also were given by survey respondents. These total scores indicate that the most important public health program is vaccination for infants and children in terms of budget allocation. Monitoring communicable diseases, mental health program, and anti-smoking program are the next. In addition, respondents were asked of the desirable budget size of each program. The result was rearranged by multiple regression model using the scores of each decision criteria. In this process, the current budget size of central government was provided to the respondents, and included in the model. h set of desirable budgets modified using tile model was obtained. Considering the current size of budget, tile results of the model is very different from that of the total score. Managing dementia is ranked the first. Health promotion program for the elderly, rehabilitation of the disabled and monitoring communicable diseases are the next. The need to increase the budget of vaccination for the infants and children was not found as so high. The matrix structure in Delphi survey gave us the precise basis to make optimal decision, and made it possible to develop an opinion predicting model. However the plentifulness and diversity of professional opinions were not fully obtained due to the limited number of decision criteria.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• Industrial Engineering and Management Systems
• /
• 제9권3호
• /
• pp.227-241
• /
• 2010

A memory module industry's supply chain usually consists of multiple manufacturing sites and multiple distribution centers. In order to fulfill the variety of demands from downstream customers, production planners need not only to decide the order allocation among multiple manufacturing sites but also to consider memory module industrial characteristics and supply chain constraints, such as multiple material substitution relationships, capacity, and transportation lead time, fluctuation of component purchasing prices and available supply quantities of critical materials (e.g., DRAM, chip), based on human experience. In this research, a directed graph-based supply network planning (DGSNP) model is developed for memory module industry. In addition to multi-site order allocation, the DGSNP model explicitly considers production planning for each manufacturing site, and purchasing planning from each supplier. First, the research formulates the supply network's structure and constraints in a directed-graph form. Then, a proposed genetic algorithm (GA) solves the matrix form which is transformed from the directed-graph model. Finally, the final matrix, with a calculated maximum profit, can be transformed back to a directed-graph based supply network plan as a reference for planners. The results of the illustrative experiments show that the DGSNP model, compared to current memory module industry practices, determines a convincing supply network planning solution, as measured by total profit.

• 한국산림과학회지
• /
• 제86권2호
• /
• pp.208-213
• /
• 1997

산림자원 관리에 필요한 정보를 얻기 위하여 우리나라의 주요 수종인 참나무류(Quercus spp), 낙엽송(Larix leptolepis) 및 잣나무(Pinus koraiensis)에 대해 경기도 광주지방에서 수형특성, 물질분배량 및 재적 생장량을 측정하였다. 수형특성으로서는 잣나무가 수관비율 및 수관확장비가 높게 나타났으며 참나무류도 수관비율이 높게 나타나 양수임을 나타냈다. 기관별 물질분배는 줄기의 경우 밑에서 위로 갈수록 감소하였으며 이러한 감소율은 낙엽송보다 잣나무 및 참나무류가 높게 나타났다. 가지 및 엽은 세 수종 모두 정규분포 특성을 보였으나 가지보다는 엽이 더 높은 정규분포 특성을 나타내었고 수종별로는 참나무류보다 잣나무, 낙엽송이 높게 나타났다. 세 임분의 물질현존량은 낙엽송림, 잣나무림, 참나무림의 순으로 각각 171.1ton/ha, 75.3ton/ha, 61.6ton/ha로 나타났다. 이에 따라 참나무류 및 잣나무림은 초기밀도를 높여줌으로서 biomass 생산 증진뿐만 아니라 수간형질 개선을 높일 수 있을 것으로 판단된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1325-1344
• /
• 2019

Recently, to satisfy mobile users' increasing data transmission requirement, energy efficiency (EE) resource allocation in distributed antenna systems (DASs) has become a hot topic. In this paper, we aim to maximize EE in DASs subject to constraints of the minimum data rate requirement and the maximum transmission power of distributed antenna units (DAUs) with different density distributions. Virtual cell is defined as DAUs selected by the same user equipment (UE) and the size of virtual cells is dependent on the number of subcarriers and the transmission power. Specifically, the selection rule of DAUs is depended on different scenarios. We develop two scenarios based on the density of DAUs, namely, the sparse scenario and the dense scenario. In the sparse scenario, each DAU can only be selected by one UE to avoid co-channel interference. In order to make the original non-convex optimization problem tractable, we transform it into an equivalent fractional programming and solve by the following two sub-problems: optimal subcarrier allocation to find suitable DAUs; optimal power allocation for each subcarrier. Moreover, in the dense scenario, we consider UEs could access the same channel and generate co-channel interference. The optimization problem could be transformed into a convex form based on interference upper bound and fractional programming. In addition, an energy-efficient DAU selection scheme based on the large scale fading is developed to maximize EE. Finally, simulation results demonstrate the effectiveness of the proposed algorithm for both sparse and dense scenarios.

• 한국정보통신학회논문지
• /
• 제24권12호
• /
• pp.1632-1638
• /
• 2020

본 논문은 다수의 단말이 다중 빔 위성을 통해 정보를 중심국으로 전송하는 위성 통신 시스템을 고려한다. 위성은 위상 배열 안테나를 탑재하여 서로 다른 대역폭을 가지는 다수의 스팟 빔을 형성한다. 빔 대역폭 할당의 공평성을 최대화하는 최적화 문제를 형성하고 해를 얻기 위한 두 가지 휴리스틱 알고리즘(반복적 빔 대역폭 할당, 자원 요청 비율 기반 빔 대역폭 할당)을 제안한다. 반복적 빔 대역폭 할당 알고리즘은 반복적으로 자원 요청량 대비 할당 대역폭의 비율을 균등화시키며, 자원 요청 비율 기반 빔 대역폭 할당 알고리즘은 요청량 대비 할당량 비율을 이용해 빔 대역폭을 계산한다. 모의실험을 통해서 반복적 빔 대역폭 할당 알고리즘이 최적의 해와 매우 가까운 공평성 성능을 가진다는 것을 확인하였다. 또한, 자원 요청 비율 기반 빔 대역폭 할당 알고리즘은 반복적 빔 대역폭 할당 알고리즘보다 계산 복잡도가 낮은 대신 더 낮은 공평성 성능을 가진다는 것을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1357-1372
• /
• 2017

Energy harvesting techniques, particularly radio frequency energy harvesting (RF-EH) techniques, which are known to provide feasible solutions to enhance the performance of energy constrained wireless communication systems, have gained increasing attention. In this paper, we consider a wireless-powered cooperative communication network (WPCCN) for transferring energy in the downlink and forwarding signals in the uplink. The objective is to maximize the average transmission rate of the system, subject to the total network power constraint. We formulate such a problem as a form of wireless energy transmission based on resource allocation that searches for the joint subcarrier pairing and the time and power allocation, and this can be solved by using a dual approach. Simulation results show that the proposed joint optimal scheme can efficiently improve system performance with an increase in the number of subcarriers and relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3312-3334
• /
• 2015

In this paper, a mechanism for spectrum allocation in overlay cognitive radio networks is proposed. In overlay cognitive radio networks, the secondary users (SUs) must first sense the activity of primary users (PUs) to identify unoccupied spectrum bands. Based on their different contributions for the spectrum sensing, the SUs get payoffs that are computed by the fusion center (FC). The unoccupied bands will be auctioned and SUs are asked to bid using payoffs they earned or saved. Coalitions are allowed to form among SUs because each SU may only need a portion of the bands. We formulate the coalition forming process as a coalition forming game and analyze it by game theory. In the coalition formation game, debtor-creditor relationship may occur among the SUs because of their limited payoff storage. A debtor asks a creditor for payoff help, and in return provides the creditor with a portion of transmission time to relay data for the creditor. The negotiations between debtors and creditors can be modeled as a Bayesian game because they lack complete information of each other, and the equilibria of the game is investigated. Theoretical analysis and numerical results show that the proposed auction yields data rate improvement and certain fairness among all SUs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3542-3566
• /
• 2018

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.