• Structural Engineering and Mechanics
• /
• v.52 no.2
• /
• pp.405-426
• /
• 2014

In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

• Korean Journal of Remote Sensing
• /
• v.33 no.4
• /
• pp.437-444
• /
• 2017

Since land pixels often generate false alarms in ship detection using Synthetic Aperture Radar (SAR), land masking is a necessary step which can be processed by a land area map or water database. However, due to the continuous coastline changes caused by newport, bridge, etc., an updated data should be considered to mask either the land or the oceanic part of SAR. Furthermore, coastal concrete facilities make noise signals, mainly caused by side lobe effect. In this paper, we propose two methods. One is a semi-automatic water body data generation method that consists of terrain correction, thresholding, and median filter. Another is a dynamic land masking method based on water database. Based on water database, it uses a breadth-first search algorithm to find and mask noise signals from coastal concrete facilities. We verified our methods using Sentinel-1 SAR data. The result shows that proposed methods remove maximum 84.42% of false alarms.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.333-340
• /
• 1990

분산 송전송실정보에 의한 전력시스템의 경제운용=The transmission loss information produced in a line may be shared by both end buses connected to the line. Then, the loss may be seen as if it is discretely produced at both buses. Likewise, all transmission losses can be considered as if they are discretely produced at every bus distributed. The bus transmission loss equation can be defined, in which the loss information about connected lines are contained. This formulation can greatly enhance the computational efficiency for the economic control of both real powers and voltages. It requires solutions of two linear matrix equations, one for the calculation of incremental transmission losses and the other for the determination of voltage levels to be controlled. The Proposed approach is demonstrated through three sample systems and it is found that the solutions can be obtained after three iterations regardless of system sizes. This implies that only one-step search would be required for the solution if real informations would be available. Results are compared with those of optimal power flows.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.6
• /
• pp.845-851
• /
• 2000

In this paper, we show the numerical and the experimental results of two-dimensional fluid motions inside a rectangular container subjected to a background rotation added by a rotational oscillation. In the PlY experiment we apply a new algorithm, new three step search(NTSS), to the velocity calculation. In the numerical computation, the linear Ekman-pumping model was used to take the bottom friction effect into account. It was found that it well produces the experimental results at low e number.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.344-351
• /
• 2014

In order to accomplish complex navigational commands, humanoid robot should be able to modify its walking period, step length and direction independently. In this paper, a novel walking pattern generation algorithm is proposed to satisfy these requirements. Modification of the walking pattern can be considered as a transition between two periodic walking patterns, which follows each navigational command. By assuming the robot as a linear inverted pendulum, the equations of motion between ZMP(Zero Moment Point) and CM(Center of Mass) state is easily derived and analyzed. After navigational command is translated into the desired CM state, corresponding CM motion is generated to achieve the desired state by using simple ZMP functions. Moreover, when the command is not feasible, feasible command is alternated by using binary search algorithm. Subsequently, corresponding CM motion is generated. The effectiveness of the proposed algorithm is verified by computer simulation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.211-219
• /
• 1988

In this paper effective block matching algorithms are proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e.pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of this algorithm is the reduction of the computation time. In order to reduce the computation time, three mathods are proposed in this paper. These new algorithms are faster than other methods. Compared with the three step algorithm by Koga et al., the average ratio of the computational savings obtained from the proposed algorithm is about 3-4.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.2
• /
• pp.307-332
• /
• 2024

Two inertial extragradient-type algorithms are introduced for solving convex pseudomonotone variational inequalities with fixed point problems, where the associated mapping for the fixed point is a 𝜌-demicontractive mapping. The algorithm employs variable step sizes that are updated at each iteration, based on certain previous iterates. One notable advantage of these algorithms is their ability to operate without prior knowledge of Lipschitz-type constants and without necessitating any line search procedures. The iterative sequence constructed demonstrates strong convergence to the common solution of the variational inequality and fixed point problem under standard assumptions. In-depth numerical applications are conducted to illustrate theoretical findings and to compare the proposed algorithms with existing approaches.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.9
• /
• pp.243-250
• /
• 2021

Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.

• Korean Journal of Acupuncture
• /
• v.28 no.3
• /
• pp.1-12
• /
• 2011

Objectives : The purpose of this study is to review laser acupuncture studies to find possibility for applying high intensity laser to acupuncture and moxibustion treatment. Methods : Searching papers was performed using search engines of five electronic databases, including Pubmed, Thomson ISI, EMBASE, Sciencedirect, and EBSCO, from inception to May 2011 without language limitation. Inclusion criteria were clinical studies with human, randomized controlled trials (RCTs), case-control studies, and case reports. Selecting papers was performed with titles and abstracts in first step, scrutinize full text in second step, and then the extrated data was analyzed by two authors independently. The methodological quality for RCTs was evaluated using Jadad's scale. Results : Total 8 papers, (3 RCTs, 5 controlld studies, and 1 case reports), were finally selected. The study dealt with surgical laser, argon and $CO_2$ laser was one for each, with GaAs laser was two, and with new semiconductor laser, GaN, were four. The output range was from 110 mW to 15 W. The study diseases were alcohol addiction, knee osteoarthritis, bronchopneumonia and asthma for children, and circulation. All studies reported positive effect. The methodological quality in all RCTs was low because of below 3 points and all studies had few subject numbers. Conclusions : We suggest that high intensity laser can be applied to acupuncture and moxibustion. Further rigorous and well-designed study will be needed for various disease. The oriental medical society needs to take active measures to study and clinical application of acupuncture and moxibustion treatment with high intensity laser.

• The Journal of the Korea Contents Association
• /
• v.14 no.12
• /
• pp.555-564
• /
• 2014

The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.