• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제35권7A호
• /
• pp.646-653
• /
• 2010

This paper provides a unified framework for the joint optimal subchannel and power allocation in multi-hop relay network, where each node in the network has multiple parallel subchannels such as in OFDM or MIMO system. When there are multiple parallel subchannels between nodes, the relay node decides how to match the subchannel at the first hop with the one at the second hop aside from determining the power allocation. Joint optimal design of subchannel matching and power allocation is, in general, known to be very difficult to solve due to the combinatorial nature involved in subchannel matching. Despite this difficulty, we use a simple rearrangement inequality and show that seemingly difficult problems can be efficiently solved. This includes several existing solution methods as special cases. We also provide various design examples to show the effectiveness of the proposed framework.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제34권1C호
• /
• pp.90-97
• /
• 2009

The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, and lower multi-path distortion. To further utilize vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subchannel and bit allocation among users. In this paper, we propose an 0-1 integer programming model formulating the optimal subchannel and bit allocation problem of the multiuser OFDM. We employ a dual-decomposition method that provides a tight linear programming (LP) relaxation bound. Simulation results are provided to show the effectiveness of the 0-1 integer programming model. MATLAB simulation on a system employing M-ary quardarature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths are carried with the optimal subchannel and bit allocation solution generated by 0-1 integer programming model.

• Journal of Korean Library and Information Science Society
• /
• 제46권4호
• /
• pp.191-205
• /
• 2015

As the first step in developing the optimal co-authorship allocation method, this study investigated the co-authorship allocation standards of Korean Universities on journal publications. The study compared the standards of 27 Korean universities with Library and Information Science (LIS) departments, and analyzed author rankings generated by applying inflated, fractional, harmonic, and university standard method of co-authorship allocation to 189 Korean LIS faculty publications from 2001 to 2014. The university standards most similar to the standard co-authorship allocation method in bibliometrics(i.e. Vinkler) were those whose co-author credits summed up to 1. However, the university standards differed from Vinkler's in allocating author credits based on primary and secondary author classification instead of allocation based on author ranks. The statistical analysis of author rankings showed that the harmonic method was most similar to the university standards. However, the correlation between the university standards whose co-author credits summed up to greater than 1 and harmonic method was lower. The study results also suggested that middle-level authors are most sensitive to co-authorship allocation methods. However, even the most generous university standards of co-authorship allocation still penalizes collaborative research by reducing each co-authors credit below those of single authors. Follow-up studies will be needed to investigate the optimal method of co-authorship credit allocation.

• Proceedings of the Korea Water Resources Association Conference
• /
• 한국수자원학회 1989년도 수공학논총 제31권
• /
• pp.63-70
• /
• 1989

• Journal of the Korean Applied Science and Technology
• /
• 제28권1호
• /
• pp.6-9
• /
• 2011

Step feed process was analyzed stoichiometrically for the optimal operation conditions in this study. In case of optimal operation conditions, minimum R (sludge recycling) value, r (internal recycling ratio) value, and n (influent allocation ratio) value for the step feed process to acquire the maximum TN removal efficiency were identified by theoretical analysis. Maximum TN removal efficiency, based on stoichiometric reaction, can be obtained by controlling n value for the step feed process.

• Journal of Fisheries and Marine Sciences Education
• /
• 제26권2호
• /
• pp.444-454
• /
• 2014

The range of optimization problem in aquaculture is very wide, resulting from the range of species, mode of operation. Quite a few studies focus marine net-cages, but studies on land based culture farm are few or no. This paper considers a allocation problem to meet production planning in land based aquaculture system. A water pool allocation model in land based aquaculture system was developed. The solution finds the value of decision variable to minimize yearly production costs that sums up the water pool usage cost and sorting cost. The model inputs were (1) the fish growth rate (2) critical standing corp (3) number of water pool (4) number of fish. The model outputs were (5) number of water pool in growing phase (6) cost of cultivation (6) optimal facility allocation(number of water pool for each growing phase). To solve the problem, an efficient heuristic algorithm based on a greedy manner is developed. Branch and bound and heuristic is evaluated through numerical examples.

• Journal of the Korea Society of Computer and Information
• /
• 제4권1호
• /
• pp.7-14
• /
• 1999

In this paper, we deals with operator allocation and binding in high-level synthesis. We proposed a new methode to allocation and bind for scheduled operations on each control step after scheduling. Especially, we take account ILP formulation in order to get optimal allocation and binding result. Experiment was done on the HAL DFG model of Differential Equation, to show it's effectiveness.

• IEIE Transactions on Smart Processing and Computing
• /
• 제1권1호
• /
• pp.50-64
• /
• 2012

Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

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

In this paper, the optimal power allocation algorithm that minimizes the aggregate bit error rate (BER) of the secondary user (SU) in a downlink orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system, while subjecting to the interference power constraint and the transmit power constraint, is investigated under the assumption that the instantaneous channel state information (CSI) of the interference links between the secondary transmitter and the primary receiver, and between the primary transmitter and the secondary receiver is perfectly known. Besides, a suboptimal algorithm with less complexity is also proposed. In order to deal with more practical situations, we further assume that only the channel distribution information (CDI) of the interference links is available and propose heuristic power allocation algorithms based on bisection search method to minimize the aggregate BER under the interference outage constraint and the transmit power constraint. Simulation results are presented to verify the effectiveness of the proposed algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제26권4호
• /
• pp.125-132
• /
• 2001

Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.