• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.976-998
• /
• 2011

This paper attempts to maximize the operator's revenue while simultaneously providing a multi-constraint, multi-hop and deterministic QoS provisioning for real time traffic in IEEE 802.16m based 4G networks. The optimal solution to such a problem is NP-complete and therefore not feasible to be solved in a tolerable polynomial time. For this reason, we also provide a simple price based greedy heuristic to be used along with the admission control. Simulation results for different QoS schemes show that the heuristic produces a revenue that is very close to the optimal revenue, and is far more aggressive than the size based and other common algorithms that are computationally feasible to be implemented in IEEE 802.16m.

• Journal of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1435-1458
• /
• 2018

In this paper, we would like to give an answer to Problem 1 below issued firstly in [17]. In fact, by imposing some conditions on the mean curvature of the initial hypersurface and the coefficient function of the forcing term of a forced mean curvature flow considered here, we can obtain that the first eigenvalues of the Laplace and the p-Laplace operators are monotonic under this flow. Surprisingly, during this process, we get an interesting byproduct, that is, without any complicate constraint, we can give lower bounds for the first nonzero closed eigenvalue of the Laplacian provided additionally the second fundamental form of the initial hypersurface satisfies a pinching condition.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.4
• /
• pp.341-349
• /
• 2013

This paper considers the optimum design of flexbeam cross-sections for a full-scale bearingless helicopter rotor, using an efficient hybrid optimization algorithm based on particle swarm optimization, and an improved genetic algorithm, with an effective constraint handling scheme for constrained nonlinear optimization. The basic operators of the genetic algorithm, of crossover and mutation, are revisited, and a new rank-based multi-parent crossover operator is utilized. The rank-based crossover operator simultaneously enhances both the local, and the global exploration. The benchmark results demonstrate remarkable improvements, in terms of efficiency and robustness, as compared to other state-of-the-art algorithms. The developed algorithm is adopted for two baseline flexbeam section designs, and optimum cross-section configurations are obtained with less function evaluations, and less computation time.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2101-2106
• /
• 2009

The power system state estimation and prediction are very important for operation. Because that accidents of the Power system are the cause that many devices and etc are damaged. Currently, almost every power systems have 2nd,3rd back-upsystem for prevention of accident. But prevention of accident by miss-operation, due to operator or miss data, has not acounter plan. Because, we need to estimate the power system for correcting miss data and preventing miss operation by operator. We suggest algorithm for integrity of power system network data.

• Coupled systems mechanics
• /
• v.8 no.2
• /
• pp.111-127
• /
• 2019

In this paper, we present a 2D multi-scale coupling computation procedure for localized failure. When modeling the behavior of a structure by a multi-scale method, the macro-scale is used to describe the homogenized response of the structure, and the micro-scale to describe the details of the behavior on the smaller scale of the material where some inelastic mechanisms, like damage or plasticity, can be defined. The micro-scale mesh is defined for each multi-scale element in a way to fit entirely inside it. The two scales are coupled by imposing the constraint on the displacement field over their interface. An embedded discontinuity is implemented in the macro-scale element to capture the softening behavior happening on the micro-scale. The computation is performed using the operator split solution procedure on both scales.

• The Journal of Information Technology
• /
• v.4 no.1
• /
• pp.9-22
• /
• 2001

In this paper, We control remote robot using web browser. This system used independent four PC and each PC is used to operator PC, database server, web server and robot control PC. Remote control can escape the operator from constraint the time and workspace. If operator inputting control data in web browse then the control data is saved the data base server. The robot control PC is inputted control data from database at access intervals of 1ms. Also, if the control data is changed then robot is operated. It made simple robot using step-motor and the robot is operated by web browser. Finally, Robot system is exactly operated using control data and certificate of possibility the remote robot control using web browser.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.149-155
• /
• 2005

In this paper, we optimize simulation model of a manufacturing system using the real-coded genetic algorithm. Because the manufacturing system expressed by simulation model has stochastic process, the objective functions such as the throughput of a manufacturing system or the resource utilization are not optimized by simulation itself. So, in order to solve it, we apply optimization methods such as a genetic algorithm to simulation method. Especially, the genetic algorithm is known to more effective method than other methods to find global optimum, because the genetic algorithm uses entity pools to find the optimum. In this study, therefore, we apply the real-coded genetic algorithm to simulation optimization of a manufacturing system, which is known to more effective method than the binary-coded genetic algorithm when we optimize the constraint problems. We use the reproduction operator of the applied real-coded genetic algorithm as technique of the remainder stochastic sample with replacement and the crossover operator as the technique of simple crossover. Also, we use the mutation operator as the technique of the dynamic mutation that configures the searching area with generations.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.1-16
• /
• 2008

Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.1-8
• /
• 2004

In this paper, we propose a method for restoring trademark and caption areas using an isophote. In our method, the image restoration problem is modeled as an optimization problem, which in our case, is solved by a cost function with isophote constraint that is minimized using a GA The technique creates an optimal connection of all pairs of isophotes disconnected by a caption in the frame. For connecting the disconnected isophotes, we estimate the value of the smoothness, given by the best chromosomes of the GA and project this value in the isophote direction. Experimental results show that the isophote operator worked better than Laplacian operator for image restoration, and the proposed method has a great possibility for automatic restoration of a region in an advertisement scene.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.223-227
• /
• 1996

In this paper we propose an adaptive fast image restoration filter, which is suitable for reducing the blocking artifacts in the compressed image in real-time. The proposed restoration filter is based on the observation that quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space varying degradation operator. We also propose a novel block classification method for adaptively choosing the direction of a highpass filter, which serves as a constraint in the optimization process. The proposed classification method adopts the bias-corrected maximized likelihood, which is used to determine the number of regions in the image for the unsupervised segmentation. The proposed restoration filter can be realized either in the discrete Fourier transform domain or in the spatial domain in the form of a truncated finite impulse response (FIR) filter structure for real-time processing. In order to demonstrate the validity of the proposed restoration filter experimental results will be shown.