• ETRI Journal
• /
• v.45 no.5
• /
• pp.874-886
• /
• 2023

A joint resource-optimization scheme is investigated for nonorthogonal multiple access (NOMA)-enhanced scalable video coding (SVC) multicast in unmanned aerial vehicle (UAV)-assisted radio-access networks (RANs). This scheme allows a ground base station and UAVs to simultaneously multicast successive video layers in SVC with successive interference cancellation in NOMA. A video quality-maximization problem is formulated as a mixed-integer nonlinear programming problem to determine the UAV deployment and association, RAN spectrum allocation for multicast groups, and UAV transmit power. The optimization problem is decoupled into the UAV deployment-association, spectrum-partition, and UAV transmit-power-control subproblems. A heuristic strategy is designed to determine the UAV deployment and association patterns. An upgraded knapsack algorithm is developed to solve spectrum partition, followed by fast UAV power fine-tuning to further boost the performance. The simulation results confirm that the proposed scheme improves the average peak signal-to-noise ratio, aggregate videoreception rate, and spectrum utilization over various baselines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2372-2380
• /
• 2015

In this paper, we propose frequency allocation and path selection scheme in underlay cognitive radio (CR) networks using network coding. In the proposed scheme, we choose the path with consideration of network coding and interference temperature in underlay CR networks and propose an optimization problem to maximize the system throughput of secondary users (SUs). Then, we represent the proposed optimization problem as the multi-dimensional multiple-choice knapsack problem and give the theoretical upper bound for the system throughput of SUs by using linear programming. Finally, we compute the system throughput of SUs by using brute-force search (BFS) and link quality first (LQF) scheme in underlay CR networks. Simulation results show that the system throughput of SUs with BFS is higher than that with LQF in underlay CR networks with and without application of network coding, respectively.

• Journal of Biosystems Engineering
• /
• v.7 no.2
• /
• pp.36-44
• /
• 1983

Farm population was rapidly decreasing due to shift of the people from farm sector to the non-farm sector caused by the economic growth of the country. Especially, a great shortage of farm labor in busy farming period in June and October is becoming a serious problem in maintaining or promoting land productivity. The peak of labor requirement in summer is caused by rice transplanting and barley harvesting. In order to reduce the restrictions imposed on farm management by the concurrence of labor requirement and the lack of labor, the experimental study for mechanization of barley harvesting has been carried out in the fields. 1. The machines for barley harvesting were knap-sack type reapers, windrow reaper (power tiller attachment), binder and combine. The order of higher efficiency of machine for barley harvesting was combine, binder, windrow reaper (WR), knapsack type reaper 1(KSTR1), and knap sack type reaper 2(KSTR2; mist and duster attachment). 2. The ratio of grain loss for the manual, binder, and combine plot was about four percent of total field yield. 3. The total yield of barley in 35 days and 40 days harvesting after heading were 514 kg and 507kg per 10 ares respectively. The yield of 35 days-plot was higher than other experimental plots. 4. The lowest yield was recorded in 30 days-plot due to the large quantity of immatured grains and having lighter 1000-grain weight. The ratio of immatured grains was 2.66 percent and 1000-grain weight was 29.4 grams. 5. The total harvesting cost of the windrow reaper was 10,178 won per 10 ares. It was the lowest value compared to other machines. The next were combine, binder, KSTR1, KSTR2, and manual in sequence. As a result, the optimum time of barley harvesting for mechanization was 35-40 days after heading. Combine, binder, and windrow reaper were recommended as the suitable machines for barley harvesting in the work efficiency. However, in total harvesting cost, the windrow reaper was the most promising machine for barley harvesting.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.414-424
• /
• 2012

Finding or automatically generating problem instance is useful for algorithm analysis/test. The topic has been of interest in the field of hardware/software engineering and theory of computation. We apply objective value-distance correlation analysis to problem spaces, as previous researchers applied it to solution spaces. According to problems, we define the objective function by (1) execution time of tested algorithm or (2) its optimality; this definition is interpreted as difficulty of the problem instance being solved. Our correlation analysis is based on the following aspects: (1) change of correlation when we use different algorithms or different distance functions for the same problem, (2) change of that when we improve the tested algorithm, (3) relation between a problem instance space and the solution space for the same problem. Our research demonstrates the way of problem instance space analysis and will accelerate the problem instance space analysis as an initiative research.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.82-91
• /
• 2009

Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

• Journal of Digital Contents Society
• /
• v.17 no.4
• /
• pp.257-263
• /
• 2016

Cable drum schedule is the final step for the electrical equipment of the power plant, and is assigned cables to efficiently cable drum. In this paper, we have implemented an automated program which cables are scheduled in accordance with the capacity of the cable drum for each cable code. Proposed cable drum schedule was applied to the dynamic programming algorithm to effectively solve the optimization problem, and the implemented program is conducted so as to verify the proposed model. The experiment results show that implemented program eliminates the errors that can occur existing method, so we were able to reduce the design time of cable drum schedule. Cables for the electrical equipment of the power plant is designed to at least 2 million units or more. Thus the automation program to provide applies, it is considered that the design time of the cable drum schedule can be greatly reduced without serious error.

• The Journal of Information Technology
• /
• v.6 no.4
• /
• pp.59-68
• /
• 2003

In this paper, a public key kanpsack cryptosystem algorithm is based on the security to a difficulty of polynomial factorization in computer communication is proposed. For the proposed public key kanpsack cryptosystem, a polynomial vector B(x,y,z) is formed by transform of superincreasing vector A, a polynomial f(x,y,z) is selected. Next then, the two polynomials B(x,y,z) and f(x,y,z) is decided on the public key. Therefore a public key knapsack cryptosystem is based on the security to a difficulty of factorization of a polynomial f(x,y,z)=0 with three variables. In this paper, a public key encryption algorithm for data security of computer network is proposed. This is based on the security to a difficulty of factorization. For the proposed public key encryption, the public key generation algorithm selects two polynomials f(x,y,z) and g(x,y,z). The propriety of the proposed public key cryptosystem algorithm is verified with the computer simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.325-328
• /
• 2013

Recently, the national carrier of the next-generation growth engine of M2M (machine to Machine) is attracting attention. Therefore, its uses and utilization of the various disciplines is getting wider, and the increasing number of terminals to be used compared to the existing communication of the information that is sent in every object may have increased. Each data transfer from the bulk terminal to a mobile network, if the traffic situation reaches this limit does not facilitate the processing of M2M communication services, this situation can occur. This study measures the mobile networks will be used in M2M communications when it reaches the breaking point for the smooth processing of M2M services are presented. Things grows increasingly smaller the further development of M2M technology, the explosion in mobile communication network, the data traffic will reach the limitations of these methods will be used in determining the ranking of the M2M communication services should be treated as a priority, to beM2M services to mobile networks will help to facilitate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.61-69
• /
• 2015

Through Virtual Machine technology(VM), VMs can be packed into much fewer number of physical servers than that of VMs. Since even an idle physical server wastes more than 60% of max power consumption, it has been considered as one of energy saving technologies to minimize the number of physical servers by using the knapsack problem solution based on the computing resources. However, this paper shows that this tightly packed consolidation may not achieve the efficient energy saving. Instead, a service pattern-based VM consolidation algorithm is proposed. The proposed algorithm takes the service time of each VM into account, and consolidates VMs to physical servers in the way to minimize energy consumption. The comprehensive simulation results show that the proposed algorithm gains more than 30% power saving.