• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.287-298
• /
• 2005

In this local self-government era, in order to achieve real local decentralization, it is guaranteed to establish self-finances of certain administration level. Nowadays Local equalization scheme is carried out for insuring regional equal development and efficiency and effectiveness of administration and for solving vertical horizontal problem of unequal finance in local government. Local equalization scheme is the system to guarantee the financial source so that all local self-governing organizations can obtain national minimum standard while correcting the unbalance of finance and maldistribution of tax revenue source between regions. This paper presents the directions of improvement so that national subsidy and local tax can contribute to the finance balance of local self-governing organization in the uncertainties of future finance with weak financial ability. Consequently, it is required to operate the system according to balance principle by adjusting the operation form and distribution type such as national subsidy and local tax.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.560-567
• /
• 1998

This paper concerned about a imputed color printed material image in camera to decrease noise and distortion by processing median filtering with input image to identical condition. Also this paper proposed the way of compares a normal printed material with an abnormal printed material color tone with trained a learning of the error back-propagation to block classification by extracting five place from identical block(3${\times}$3) of color printed material R, G, B value. As a representative algorithm of multi-layer perceptron the error Back-propagation technique used to solve complex problems. However, the Error Back-propagation is algorithm which basically used a gradient descent method which can be converged to local minimum and the Back Propagation train include problems, and that may converge in a local minimum rather than get a global minimum. The network structure appropriate for a given problem. In this paper, a good result is obtained by improve initial condition and adjust th number of hidden layer to solve the problem of real time process, learning and train.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.10
• /
• pp.41-52
• /
• 2019

The purpose of this study was to analyze the historical development of high-rise buildings-promoting policies in Seoul in terms of modern urban redevelopment. The results of this study were as follows; The maximum height of the buildings has been limited by National codes since 1934. But at the same time, Seoul Metropolitan government had limited the minimum building floors of roadside buildings through local regulations after the Korean War. The high-rise city had been regarded as a means of beautifying Seoul for a long time. However since the 2000s, the minimum height limit for buildings was removed from local regulations and the concept of high-rise restrictions was no longer significant as before.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1921-1926
• /
• 2003

We build a local minimum free motion planning for mobile robots considering dynamic environments by simple sensor fusion assuming that there are unknown obstacles which can be detected only partially at a time by proximity sensors and can be cleaned up or moved slowly (dynamic environments). Potential field is used as a basic platform for the motion planning. To clear local minimum problem, the partial information on the obstacles should be memorized and integrated effectively. Sets of linked line segments (SLLS) are proposed as the integration method. Then robot's target point is replaced by virtual target considering the integrated sensing information. As for the main proximity sensors, we use laser slit emission and simple web camera since the system gives more continuous data information. Also, we use ultrasonic sensors as the auxiliary sensors for simple sensor fusion considering the advantages in that they give exact information about the presence of any obstacle within certain range. By using this sensor fusion, the dynamic environments can be dealt easily. The performance of our algorithm is validated via simulations and experiments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.4
• /
• pp.317-322
• /
• 2002

The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1989-1990
• /
• 2006

This paper presents an escaping route method in a trap situation (a case that the robot is trapped in a local minimum by the potential of obstacles). In this scheme, the APFs for path planning have a multiplicative and auditive configuration between APFs for goal destination and APFs for obstacle avoidance unlike conventional configuration where APFs for obstacle avoidance is added to APFs for goal destination. The virtual escaping route method is proposed to allow a robot to escape from a local minimum in trap situation where the total forces composed of repulsive forces by obstacles and attractive force by a goal are zero.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.407-409
• /
• 2002

This paper proposes a process using the load shedding scenario method that determines the minimum local load shedding quantity considering the local DLC(Direct Load Control) potentials. So this method is applied to Kyung-In area and determined the load shedding of this area with comparison to its DLC potentials.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.8
• /
• pp.639-647
• /
• 1990

Dynamic time warp(DTW) needs for interative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at the real time recognition design which enables large dictionary hardware realization using DTW algorithm. The DTW PE cell is seperated into three large blocks. "MIN" is the one block for counting accumulated minimum distance, "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. We have accomplisehd circuit design and verification for the MIN blocks, and performed MIN layout and DRC(design rule check) using 3um CMOS N-Well rule base.ing 3um CMOS N-Well rule base.

• Journal of electromagnetic engineering and science
• /
• v.4 no.1
• /
• pp.1-7
• /
• 2004

In this paper the Individual tap - Least Mean Square(IT-LMS) algorithm is applied to the adaptive multipath channel equalization using hybrid-type Genetic Algorithm(GA) for achieving lower minimum Mean Squared Error(MSE). Owing to the global search performance of GA, LMS-type equalizers combined with it have shown preferable performance in both global and local search but those still have unsatisfying minimum MSE performance. In order to lower the minimum MSE we investigated excess MSE of IT-LMS algorithm and applied it to the hybrid GA equalizer. The high convergence rate and lower minimum MSE of the proposed system give us reason to expect that it will perform well in practical multi-path channel equalization systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1142-1147
• /
• 2015

As a method to increase the scalability and efficiency of wireless sensor networks, a scheme to construct networks hierarchically has received considerable attention among researchers. Researches on the methods to construct wireless networks hierarchically have been conducted focusing on how to select nodes such that they constitute a backbone network of wireless network. Nodes comprising the backbone network should be connected themselves and can cover other remaining nodes. A problem to find the minimum number of nodes which satisfy these conditions is known as the minimum connected dominating set (MCDS) problem. The MCDS problem is NP-hard, therefore there is no efficient algorithm which guarantee the optimal solutions for this problem at present. In this paper, we propose a novel multi-start local search algorithm to solve the MCDS problem efficiently. For the performance evaluation of the proposed method, we conduct extensive experiments and report the results.