• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2118-2126
• /
• 2017

The large-scale power system blackouts have indicated that conventional protection relays that based on local signals cannot fit for modern power grids with complicated setting or heavily loaded-flow transfer. In order to accurately detect various faulted lines and improve the fault-tolerance of wide-area protection, a novel multi-section weighed fault matching and detecting algorithm is proposed. The real protection vector (RPV) and expected section protection vectors (ESPVs) for five fault sections are constructed respectively. The function of multi-section weighed fault matching is established to calculate the section fault matching degrees between RPV and five ESPVs. Then the fault degree of protected line based on five section fault degrees can be obtained. Two fault detecting criterions are given to support the higher accuracy rate of detecting fault. With the enumerating method, the simulation tests illustrate the correctness and fault-tolerance of proposed algorithm. It can reach the target of 100% accuracy rate under 5 bits error of wide-area protections. The influence factors of fault-tolerance are analyzed, which include the choosing of wide-area protections, as well as the topological structures of power grid and fault threshold.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.89-97
• /
• 1997

A genetic algorithm (GA) is a stochastic direct search strategy that mimics the process of genetic evolution. The GA applied herein works on a population of structural designs at any one time, and uses a structured information exchange based on the principles of natural selection and wurvival of the fittest to recombine the most desirable features of the designs over a sequence of generations until the process converges to a "maximum fitness" design. Principles of genetics are adapted into a search procedure for structural optimization. The methods consist of three genetics operations mainly named selection, cross- over and mutation. In this study, a method of finding the optimum topology of truss/beam structure is pro- posed by using the GA. In order to use GA in the optimum topology problem, chromosomes to FEM elements are assigned, and a penalty function is used to include constraints into fitness function. The results show that the GA has the potential to be an effective tool for the optimal design of structures accounting for sizing, geometrical and topological variables.variables.

• Progress in Superconductivity
• /
• v.6 no.1
• /
• pp.13-18
• /
• 2004

High-.ate in-situ$ YBa_2$Cu$Cu_3$$O_{7-x}$ (YBCO) film growth was demonstrated by means of the electron beam co-evaporation. Even though our oxygen pressure is low, ∼$5 ${\times}$10^{-5}$ Torr, we can synthesize as-grown superconducting YBCO films at a deposition rate of around 10 nm/s. Relatively high temperatures of around 90$0^{\circ}C$ was necessary in this process so far, and it suggests that this temperature at a given oxygen activity allows a Ba-Cu-O liquid formation along with an YBCO epitaxy. Local critical current density shows a clear correlation with local resistivity. Homogeneous transport properties with a large critical current density ($4 ∼ 5 MA/\textrm{cm}^2$ at 77K, 0T) are observed in top faulted region while it is found that the bottom part carries little supercurrent with a large local resistivity. Therefore, it is possible that thickness dependence of critical current density is closely related with a topological variation of good superconducting paths and/or grains in the film bodies. The information derived from it may be useful in the characterization and optimization of superconducting films for electrical power and other applications.

• Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• Journal of architectural history
• /
• v.7 no.1 s.14
• /
• pp.31-48
• /
• 1998

Soengyo-jang has some characteristics as the most great house, the special functions, and the non-regional type of house form. And it has constructed continuously for two centuries by many owners in the different generations, It needs a special research method ; which are consist of a) comprehension of background information from documents and oral instructed materials, b) pursuit of design process through the building survey, and c) theoretical interpretation about 'collectivism'. From the results of this research, it is revealed that the architectural purpose of this house was constructing 'a great manor'. At first phase, it had been a single ordinary house, at second, it had expanded to a complex including many housing clusters, and finally became to expand its dwelling territory into whole village. Its expansion was progressed by the four collecting phases of which were building, building cluster, group of clusters, and topological setting. Main design elements operated in each of collecting phases ; they were partial element of , exterior spaces of , a linear building of , and a pavilion of . The last two elements were also powerful datum.

• Convergence Security Journal
• /
• v.10 no.3
• /
• pp.29-41
• /
• 2010

Survelliance and Reconnaissance Sensor Network(SRSN) which can collect various tactical information within battlefield in real time plays an important role in NCW environment, of sensor to shooter architecture. However, due to the resource-limited characteristics of sensor nodes and the intrinsic attributes of sensor network such as wireless communication, the SRSN may be vulnerable to various attacks compared to traditional networks. Therefore, in this paper, we propose a new group key management scheme to guarantee confidentiality, integrity, availability, and authentication during the operation of the SRSN. Proposed scheme generates and distributes the group key based on the topological characteristic of the SRSN and the probabilistic key sharing. The communication cost for distributing the group key is O(logn).

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.15-22
• /
• 1989

This paper presents a distributed routing scheme for allowing network control to be distributed through the switching elements of a multistage baseline network. The routing technique we use here is the destination tag scheme which uses the binary representation of a destination address as the reuting tag. With the topological properties of the network, we introduce a distributed algorithm which allows any connection from a source to arbitrary number of destinations. Also, the performance of the proposed method is evaluated by computer simulation, and the results of the method is compared to other schemes in terms of time complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.6
• /
• pp.259-265
• /
• 2000

The purpose of this paper is to detect and identify topological errors in order to maintain a reliable database for the state estimator. In this paper, a two stage estimation procedure is used to identify the topology errors. At the first stage, the WSAV state estimator which has characteristics to remove bad data during the estimation procedure is run for finding out the suspected branches at which topology errors take place. The resulting residuals are normalized and the measurements with significant normalized residuals are selected. A set of suspected branches is formed based on these selected measurements; if the selected measurement is a line flow, the corresponding branch is suspected; if it is an injection, then all the branches connecting the injection bus to its immediate neighbors are suspected. A new WLAV state estimator adding the branch flow errors in the state vector is developed to identify the branch topology errors. Sample cases of single topology error and topology error with a measurement error are applied to IEEE 14 bus test system.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.10 no.2
• /
• pp.37-44
• /
• 1992

Although scanners are much more expensive than other input devices expect for some low quality devices, raster scanner and vectorizing softwares have been used and will be used as a means for the data entry in GIS. In this study, the accuracy of raster data and vectorizing in data entry by scanning technology, the coverage generation are investigated. As a result, the deterioration of spatial resolution can be improved by using the histogram analysis and the line enhancement when we scan a map at a lower dpi. It is to be desired that a raster scanner dpi is selected 150 dpi or 200 dpi among five densities (75 dpi, 150, dpi, 200 dpi, 300 dpi, 400 dpi) in view of the storage of raster data and the RMSE of coverage generation. Also, it was very important role of the choice of trace parameters to trace raster data in the vectorizing procedure.