• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.385-396
• /
• 2005

In this paper, a new structural approach to on-line signature verification is presented. A primitive pattern is defined as a part segmented by a local minimal position of speed. And a structural description of signature is composed of subpatterns which are defined as such forms as rotation shape, cusp shape and bell shape, acquired by composition of the primitives regarding the directional changes. As the matching method to find identical parts between two signatures, a modified DP(dynamic programming) matching algorithm is presented. And also, variation and complexity of local parts are computed from the training samples, and reference model and decision boundary are derived from these. Error rate, execution time and memory usage are compared among the functional approach, the parametric approach and the proposed structural approach. It is found that the average error rate can be reduced from 14.2% to 4.05% when the local parts of a signature are weighted and the complexity is used as a factor of decision threshold. Though the error rate is similar to that of functional approaches. time consumption and memory usage of the proposed structural approach are shown to be very effective.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4
• /
• pp.43-49
• /
• 1996

This research proposes a system for speaker independent Korean continuous speech recognition with 247 DDD area names using keyword spotting technique. The applied recognition algorithm is the Dynamic Programming Neural Network(DPNN) based on the integration of DP and multi-layer perceptron as model that solves time axis distortion and spectral pattern variation in the speech. To improve performance, we classify word model into keyword model and non-keyword model. We make an experiment on postprocessing procedure for the evaluation of system performance. Experiment results are as follows. The recognition rate of the isolated word is 93.45% in speaker dependent case. The recognition rate of the isolated word is 84.05% in speaker independent case. The recognition rate of simple dialogic sentence in keyword spotting experiment is 77.34% as speaker dependent, and 70.63% as speaker independent.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.418-425
• /
• 2005

3D surface reconstruction is to make the original geometry of 3D objects from 2D geometric information. Barequet's algorithm is well known and most widely used in surface reconstruction. It tiles matched regions first, then triangulates clefts using dynamic programming. However it takes considerably long processing time while manipulating complex model. Our method tiles a simple region that does not have branches along minimally distant vertex pairs at once. When there are branches, our method divides contour lines into a simple region and clefts. We propose a fast and simple method that calculates medial axes using a minimum distance in cleft region. Experimental results show that our method can produce accurate models than the previous method within short time.

• Journal of the Korea Society for Simulation
• /
• v.26 no.3
• /
• pp.105-113
• /
• 2017

This study considers an optimal investment planning for improving survivability from an air threat in the layered air defense system. To establish an optimization model, we first represent the layered air defense system as a network model, and then, present two optimization models minimizing the failure probability of counteracting an air threat subject to budget limitation, in which one deals with whether to invest and the other enables continuous investment on the subset of nodes. Nonlinear objective functions are linearized using log function, and we suggest dynamic programming algorithm and linear programing for solving the proposed models. After designing a layered air defense system based on a virtual scenario, we solve the two optimization problems and analyze the corresponding optimal solutions. This provides necessity and an approach for an effective investment planning of the layered air defense system.

• Journal of Korean Port Research
• /
• v.3 no.1
• /
• pp.35-55
• /
• 1989

Today, about 99% of total import and export cargo in Korea is being transported through the port. The general trends of cargo handling show increases in capacity and speed, In order to cope with these trends, it is not only required to raise the efficiencies of port operation and function but also necessary to decide the optimal amount of the skilled labor force for cargo handling in the port. Cargo handling in the port is basically relied on the cargo handling facilities. Therefore, it is very important to reserve the amount of labor force for cargo handling system has been developed up to a certain level but the personnel management system which is the superior structure has not been followed well. In this study, therefore, we show a method to determine the required amount of labor force for cargo handling considering the amount of cargo and type of cargo handling work per each cargo, and the optimal amount labor force in cope with the fluctuation of the basic cargo handling labor force with respect to the time of in and out cargo flow in the viewpoint of minimizing the expences due to reservation of extra labor force than needed and firing employment of labor force using the Dynamic Programming. The derived algorithm is introduced into the computer simulation for Pusan port with the analyzed real data such as amount of cargo handling in the port with respect to working hour, cargo capacity, working step, the ratio of cargo handling facility and actual number of workers and we estimated the required labor force. As a result of analysis the labor force of Pusan port showed the over-employment such as maximum 21.4%, minimum 8.2% when we assumed that the averages of actual working hours and days were 8 hours in a day and 20 day in a month.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.10 no.2
• /
• pp.123-133
• /
• 2006

The main objective of this study is to develop an optimization algorithm of framed structures with rigid and various semi-rigid connections using the multilevel dynamic programming and the sequential unconstrained minimization techniques (SUMT). The second-order elastic analysis is performed for steel framed structures. The second order elastic analysis is developed based on nonlinear beam-column theory considering the bowing effect. The following semi-rigid connections are considered; double web angle, top-seat angle and top-seat angle with web angle. We considered the three connection models, such as modified exponential, polynomial and three parameter model. The total weight of the structural steel is used as the objective function in the optimization process. The dimensions of steel cross section are selected as the design variables. The design constraints consist of strength requirements for axial, shear and flexural resistance and serviceability requirements.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.582-594
• /
• 2016

Most studies on hybrid buses are on large-sized buses and not mid-sized low-floor buses. This study uses MATLAB simulation to evaluate the fuel efficiency of such buses powered by diesel. Based on the results, a hybrid electric vehicle system is recommended for the best combination of power and gear ratio. A parallel hybrid system was selected for the hybridization, which transmits front and rear wheel power independently. The necessary power to satisfy the target performance was calculated, and the applicable capacity area was designed. Dynamic programing was used to create and optimize a component sizing algorithm, which was used to scale the capacity of each component of the power source to satisfy the design criteria. The fuel efficiency rate, optimum power source capacity, and gear ratio can be improved by converting a conventional bus into a parallel hybrid bus.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.5
• /
• pp.21-27
• /
• 1999

In this paper, we propose an improved MLP-based English pronunciation dictionary generator to apply to the variable vocabulary word recognizer. The variable vocabulary word recognizer can process any words specified in Korean word lexicon dynamically determined according to the current recognition task. To extend the ability of the system to task for English words, it is necessary to build a pronunciation dictionary generator to be able to process words not included in a predefined lexicon, such as proper nouns. In order to build the English pronunciation dictionary generator, we use context-dependent grapheme-to-phoneme multi-layer perceptron(MLP) architecture for each grapheme. To train each MLP, it is necessary to obtain grapheme-to-phoneme training data from general pronunciation dictionary. To automate the process, we use dynamic programming(DP) algorithm with some distance metrics. For training and testing the grapheme-to-phoneme MLPs, we use general English pronunciation dictionary with about 110 thousand words. With 26 MLPs each having 30 to 50 hidden nodes and the exception grapheme lexicon, we obtained the word accuracy of 72.8% for the 110 thousand words superior to rule-based method showing the word accuracy of 24.0%.