• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.2
• /
• pp.87-93
• /
• 2014

Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.

• Molecules and Cells
• /
• v.39 no.6
• /
• pp.495-500
• /
• 2016

We have solved the crystal structure of a predicted fructose-specific enzyme $IIB^{fruc}$ from Escherichia coli ($EcEIIB^{fruc}$) involved in the phosphoenolpyruvate-carbohydrate phosphotransferase system transferring carbohydrates across the cytoplasmic membrane. $EcEIIB^{fruc}$ belongs to a sequence family with more than 5,000 sequence homologues with 25-99% amino-acid sequence identity. It reveals a conventional Rossmann-like ${\alpha}-{\beta}-{\alpha}$ sandwich fold with a unique ${\beta}$-sheet topology. Its C-terminus is longer than its closest relatives and forms an additional ${\beta}$-strand whereas the shorter C-terminus is random coil in the relatives. Interestingly, its core structure is similar to that of enzyme $IIB^{cellobiose}$ from E. coli ($EcIIB^{cel}$) transferring a phosphate moiety. In the active site of the closest $EcEIIB^{fruc}$ homologues, a unique motif CXXGXAHT comprising a P-loop like architecture including a histidine residue is found. The conserved cysteine on this loop may be deprotonated to act as a nucleophile similar to that of $EcIIB^{cel}$. The conserved histidine residue is presumed to bind the negatively charged phosphate. Therefore, we propose that the catalytic mechanism of $EcEIIB^{fruc}$ is similar to that of $EcIIB^{cel}$ transferring phosphoryl moiety to a specific carbohydrate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.178-185
• /
• 2005

NEMO basic support is a solution that provides network mobility in the Internet topology. Yet, when multiple mobile networks are nested, this basic solution suffers ken pinball-routing and a severe routing overhead. Therefore, several solutions for route optimization in a nested mobile network have already been suggested by the IETF NEMO WG. However, the current paper proposes Regional Information-based Route Optimization (RIRO) in which mobile routers maintain a Nested Router List (NRL) to obtain next-hop information, and packets are transmitted with a new routing header called an RIRO Routing Header (RIRO-RH). We showed that RIRO had the minimum packet overhead that remained constant, irrespective of how deep the mobile network was nested, in comparison with two earlier proposed schemes - Reverse Routing Header (RRH) and Bi-directional tunnel between HA and Top-Level mobile router (BHT).

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.123-132
• /
• 2018

Various methods have been proposed to efficiently animate the motion of soft objects in realtime. In order to maintain the topology between the elements of the objects, it is required to employ constraint forces, which limit the size of the time steps for the numerical integration and reduce the efficiency. To tackle this, an implicit method with larger steps was proposed. However, the method is, in essence, a linear system with a large matrix, of which solution requires heavy computations. Several approximate methods have been proposed, but the approximation is obtained with an increased damping and the loss of accuracy. In this paper, new integration method based on harmonic oscillation with better stability was proposed, and it was further stabilized with the hybridization with approximate implicit method. GPU parallelism can be easily implemented for the method, and large-scale soft objects can be simulated in realtime.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.1
• /
• pp.55-65
• /
• 2009

Due to the rapid increase of electricity demand, consideration of environmental constraints in optimal power flow (OPF) problems is increasingly important. In Algeria, up to 90% of electricity is produced by thermal generators (vapor, gas). In order to keep the emission of gaseous pollutants like sulfur dioxide (SO2) and Nitrogen (NO2) under the admissible ecological limits, many conventional and global optimization methods have been proposed to study the trade-off relation between fuel cost and emissions. This paper presents an efficient decomposed Parallel GA to solve the multi-objective environmental/economic dispatch problem. At the decomposed stage the length of the original chromosome is reduced successively and adapted to the topology of the new partition. Two subproblems are proposed: the first subproblem is related to the active power planning to minimize the total fuel cost, and the second subproblem is a reactive power planning design based in practical rules to make fine corrections to the voltage deviation and reactive power violation using a specified number of shunt dynamic compensators named Static Var Compensators (SVC). To validate the robustness of the proposed approach, the algorithm proposed was tested on the Algerian 59-bus network test and compared with conventional methods and with global optimization methods (GA, FGA, and ACO). The results show that the approach proposed can converge to the near solution and obtain a competitive solution at a critical situation and within a reasonable time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1007-1017
• /
• 2011

It is important to set the new interconnection system under NGN. The traditional interconnection system is based on traffic, but this is not suitable for IP based service. Therefore, it is needed to ensure the universal access to network without trouble about the network topology. This paper prepares the evaluation criteria and evaluates the alternatives. Specifically, we deduce the alternatives and evaluates the alternatives of interconnection settlement system based on the condition of efficient interconnection, the retail price and access charging model, and the previous studies evaluating and examining the various alternatives. Finally, we evaluate each alternatives by the criteria.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.11 no.4
• /
• pp.385-394
• /
• 2006

The application areas of traditional push-pull converters are limited because the voltage stress of switches is high (twice of the input voltage). But the push - pull converter topology is suitable for unregulated low-voltage to high-voltage power conversion such as the fuel cell. This paper presents a novel power converter structure that is very suitable for the DC/DC converter in fuel cell systems. Based on this structure, a ZVS- ZCS push-pull converter is proposed. The switches of the proposed push-pull converter can operate under ZVS or ZCS condition with the help of a new passive clamping circuit. The passive clamping techniques solves the voltage overshoot problem. Because the buck converter circuit operates at twice the synchronous switching frequency of the push-pull converter, the peak current in the current-fed inductor and transformer is reduced. The operation principle of the proposed converter is analyzed and verified by simulations and experimental results. A 1 kW DC/DC converter was implemented with DSP TMS320F2812, from which experimental results have shown that efficiency improvement and surge suppression can be achieved effectively.

• Journal of the Korean Society of Safety
• /
• v.11 no.1
• /
• pp.16-26
• /
• 1996

In a series of original papers, [1-17] efficient methods and algorithms have been presented, for the exact solution of many reliability problems represented by binary networks. A starting point of these methods was the concept of domination, firstly introduced in ,elation with reliability problems in [2]. It's application to directed networks resulted in the development of a topological formula for the classical problem of the two terminal reliability. This result was extended later to the all-terminal and the k-terminal reliability problems. All papers mentioned above use a path oriented representation for the network topology. In practical applications, however, it is common and often advantageous to work with cut sets. This article considers the Domination theory for reliability problem of a network. Some topological formula are derived and the power and the application of this formula are shown through the alternative proof of topological formula of A. Satyanarayana [2].

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.1001-1010
• /
• 2007

HMM tends to output high probability for not only the proper class data but confusable class data, since the modeling power increases as the number of parameters increases. Thus it may not be helpful for discrimination to simply increase the number of parameters of HMM. We proposed two methods in this paper. One is a CMC(Confusion Likelihood Model Selection Criterion) using confusion class data probability, the other is a new recognition method, RCM(Recognition Using Confusion Models). In the proposed recognition method, confusion models are constructed using confusable class data, then confusion models are used to depress misrecognition by confusion likelihood is subtracted from the corresponding standard model probability. We found that CMC showed better results using fewer number of parameters compared with ML, ALC2, and BIC. RCM recorded 93.08% recognition rate, which is 1.5% higher result by reducing 17.4% of errors than using standard model only.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.