• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.102-108
• /
• 2010

The photovoltaic system changes solar energy into DC by solar cell and this DC is inverted into AC which is used in general houses by inverter. Recently, the use of power of the photovoltaic system is increased. Therefore, the study of 3 phase solar system to transmit large power is very important. This paper proposes a method that finds simply faults and diagnoses the switch open faults of 3-phase pulse width modulation (PWM) inverter of grid-connected photovoltaic system. The proposed method in $\alpha\beta$ plane uses the patterns of trajectory image as the characteristic parameters and differenciates a normal state and open states of switches. Then, the result is made into tree. The tree is composed of 21 fault patterns and the parameters to classify faults are a shape, a trajectory area, a distributed angle, and a typical vector angle. The result shows that the proposed method diagnosed fault diagnoses, classified correctly them, and made a pattern tree by fault patterns.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1997.04a
• /
• pp.301-304
• /
• 1997

Effects of volatile impurities on deterioration characteristics of XLPE were investigated. Block type plate with needle-plane electrode and artificial void filled with $N_2$gas or humidity was subjected under high electric field. The dyed region by oxidation reaction around the artificial void filled with humidity was detected before tee initiation. Electrical tree was started from the tip of void filled with $N_2$gas earlier than humidity.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1307-1318
• /
• 2009

An infinite locally finite plane graph is an LV-graph if it is 3-connected and VAP-free. In this paper, as a preparatory work for solving the problem concerning the existence of a spanning 3-tree in an LV-graph, we investigate the existence of a spanning 3-forest in a bridge of type 0,1 or 2 of a tight semi ring in an LV-graph satisfying certain conditions.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.7 no.3
• /
• pp.220-226
• /
• 2005

We investigated the effect of $O_3$ on the photosynthetic characteristics of oriental plane (Platanus orientalis L.) that is used as a side tree or ornamental tree in Korea. Two-year-old oriental plane seedlings were transplanted to pots and transferred into a closed $O_3$ chamber, Photosynthetic pigment content and photosynthetic characteristics of leaves were measured every three weeks during 100 ppb $O_3$ fumigation. There was no visible foliar injury by $O_3$ exposure and the content of photosynthetic pigments did not show significant differences between control and $O_3$-treated seedlings. But photosynthetic rate, stomatal conductance, and water use efficiency in leaves of $O_3$-treated seedlings were reduced after six weeks of ozone fumigation. In addition, reduction of carboxylation efficiency and photochemical efficiency was observed in leaves of $O_3$-treated seedlings after three weeks and six weeks. In accordance with our results, carboxylation efficiency, the most sensitive parameter to $O_3$ stress, was considered to be a suitable indicator of $O_3$ sensitivity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.5
• /
• pp.390-399
• /
• 1988

A conventional BTC has the merit of real time processing and simple computation, but has the problem that its compression rate is low. In this paper, a modified BTC using the Quad Tree which is frequently used in binary image is proposed. The method results in the low compression rate by decreasing the total number of subblocks by mean of making the size of a subblock large in the small variation area of graty level and the size af a subblock small in the large variation area of gary level. For the effective transmission of bit plane, the Huffman run-lengh code for the large size of a subblock and the lookup table for tha small size of a subblock are used. The proposed BTC method show the result of coding 256 level image at the average data rate of about 0.8 bit/pixel.

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

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.5
• /
• pp.439-444
• /
• 2009

This paper presents an efficient contact detection algorithm for the plane elastostatic contact problem of the boundary element method(BEM). The data structures of the boundary element method are dissected to develop an efficient contact detection algorithm. This algorithm is consists of three parts as global searching, local searching and contact relation setting to reflect the corner node problem. Contact master and slave type elements are used in global searching step and quad-tree is selected as the spatial decomposition method in local searching step. To set up contact relation equations, global contact searching is conducted at node level and local searching is performed at element level. To verify the efficiency of the proposed contact detection algorithm of BEM, numerical example is presented.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.90-95
• /
• 2022

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1496-1509
• /
• 2005

In this paper, an adaptive license plate recognition system which detects and recognizes license plate at real-time by using projected plane convolution and Decision Tree Classifier is proposed. And it was tested in circumstances which presence of complex background. Generally, in expressway tollgate or gateway of parking lots, it is very difficult to detect and segment license plate because of size, entry angle and noisy problem of vehicles due to CCD camera and road environment. In the proposed algorithm, we suggested to extract license plate candidate region after going through image acquisition process with inputted real-time image, and then to compensate license size as well as gradient of vehicle with change of vehicle entry position. The proposed algorithm can exactly detect license plate using accumulated edge, projected convolution and chain code labeling method. And it also segments letter of license plate using adaptive binary method. And then, it recognizes license plate letter by applying hybrid pattern vector method. Experimental results show that the proposed algorithm can recognize the front and rear direction license plate at real-time in the presence of complex background environments. Accordingly license plate detection rate displayed $98.8\%$ and $96.5\%$ successive rate respectively. And also, from the segmented letters, it shows $97.3\%$ and $96\%$ successive recognition rate respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.67-76
• /
• 2011

This paper describes the development of interactive visualization techniques and a program that allow us to visualize the structure of the volume data and interactively select and visualize the isosurface components using contour tree. The main characteristic of this technique is to provide an algorithm that draws the contour tree in 2D plane in a way that users easily understand the tree, and to provide an algorithm that can efficiently extract an isosurface component utilizing GPU's parallel architecture. The main characteristic of the program we developed through implementing the algorithms is to provide us with an interactive user interface based on the contour tree for extracting an isosurface component and visualization that integrates with previous isosurface and volume rendering techniques. To show the excelland vof our methods, we applied 3D biomedical volume data to our algorithms. The results show that we could interactively select the isosurface components that represent a polypeptide chain, a ventricle and a femur respectively using the user interface based on our contour tree layout method, and extract the isosurface components with 3x-4x higher speed compared to previous methods.