• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.60-73
• /
• 2010

This paper aims to describe KorLexClas 1.5 which provides us with a very large list of Korean numeral classifiers, and with the co-occurring noun categories that select each numeral classifier. Differently from KorLex of other POS, of which the structure depends largely on their reference model (Princeton WordNet), KorLexClas 1.0 and its extended version 1.5 adopt a direct building method. They demand a considerable time and expert knowledge to establish the hierarchies of numeral classifiers and the relationships between lexical items. For the efficiency of construction as well as the reliability of KorLexClas 1.5, we use following processes: (1) to use various language resources while their cross-checking for the selection of classifier candidates; (2) to extend the list of numeral classifiers by using a shallow parsing techniques; (3) to set up the hierarchies of the numeral classifiers based on the previous linguistic studies; and (4) to determine LUB(Least Upper Bound) of the numeral classifiers in KorLexNoun 1.5. The last process provides the open list of the co-occurring nouns for KorLexClas 1.5 with the extensibility. KorLexClas 1.5 is expected to be used in a variety of NLP applications, including MT.

• Journal of Navigation and Port Research
• /
• v.38 no.4
• /
• pp.343-348
• /
• 2014

A routing scheme called MCS-NLTC using a self-configuration marine network model and the diversity and heterogeneity of broadband wireless access technologies is newly proposed. The MCS-NLTC algorithm selects optimal nodes and carriers for every hop in optimal routes based on not conventional hop counts but normalized distances to destination ships (location information of destination ships). Normalized transmission characteristics of applications and carriers are considered to get optimal routes as well. The location information enhances convergence speed to get destinations, which makes the route search time faster. Evaluated performances are compared with those of the schemes based on max-win (OMH-MW), and normalized transmission characteristics (MCS-NTC).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.374-382
• /
• 2020

The purpose of this study is to improve the learning speed of an ammunition stockpile reliability classification artificial neural network model by proposing a normalization method that reduces the number of input variables based on the characteristic of Ammunition Stockpile Reliability Program (ASRP) data without loss of classification performance. Ammunition's performance requirements are specified in the Korea Defense Specification (KDS) and Ammunition Stockpile reliability Test Procedure (ASTP). Based on the characteristic of the ASRP data, input variables can be normalized to estimate the lot percent nonconforming or failure rate. To maintain the unitary hypercube condition of the input variables, min-max normalization method is also used. Area Under the ROC Curve (AUC) of general min-max normalization and proposed 2-step normalization is over 0.95 and speed-up for marching learning based on ASRP field data is improved 1.74 ~ 1.99 times depending on the numbers of training data and of hidden layer's node.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.2
• /
• pp.17-26
• /
• 2011

This paper presents an interactive progressive image transmission method, which enables a remote user to interactively select and transmit preferred regions from an index image. Our enhanced quadtree decomposition using PSNR-based rules and new implicit quadtree coding provide better rate-distortion performance than previous quadtree coders as well as leading bit plane methods. An adaptive traversal of child nodes is introduced for better visual display of restored images. Depth-first traversal combined with breadth-first traversal of the quadtree to accomplish interactive transmission as presented, results in a method that provides competitive performance at a low level of computational complexity. Moreover, our decoding requires only simple arithmetic which is enabling our method to be used for real-time mobile applications.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.485-491
• /
• 2012

This paper proposes 'Coding Unit Tree' based on quadtree efficiently with motion vector to represent splitting information of a Coding Unit (CU) in HEVC. The new international video coding, High Efficiency Video Coding (HEVC), adopts various techniques and new unit concept: CU, Prediction Unit (PU), and Transform Unit (TU). The basic coding unit, CU is larger than macroblock of H.264/AVC and it splits to process image-based quadtree with a hierarchical structure. However, in case that there are complex motions in CU, the more signaling bits with motion information need to be transmitted. This structure provides a flexibility and a base for a optimization, but there are overhead about splitting information. This paper analyzes those signals and proposes a new algorithm which removes those redundancy. The proposed algorithm utilizes a type code, a dominant value, and residue values at a node in quadtree to remove the addition bits. Type code represents a structure of an image tree and the two values represent a node value. The results show that the proposed algorithm gains 13.6% bit-rate reduction over the HM-1.0.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.332-340
• /
• 2013

As a means for users to interact online, Social Network Service focuses on facilitating the building of social relation. Also, Social Network Service(SNS) provides various functions for managing relationships and sharing information based on relationships. Analyzing behavioral characteristics and the process of relationship formation can help to identify the characteristics of the model for online human relationship. In this paper, we analyze usage pattern based on characteristics posted messages of influential users in Twitter. Also, classifying Facebook users into influential group and uninfluential group based on the number of their social relations, we analyze and compare characteristics of relationship formation patterns of the two classified groups. In addition, we present characteristics of human relation model in social network according to the pattern analysis.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.708-714
• /
• 2006

The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.

• Korean Journal of Cognitive Science
• /
• v.27 no.1
• /
• pp.43-60
• /
• 2016

Recently, Unsupervised Word Sense Disambiguation research has focused on Graph based disambiguation. Graph-based disambiguation has built a semantic graph based on words collocated in context or sentence. However, building such a graph over all ambiguous word lead to unnecessary addition of edges and nodes (and hence increasing the error). In contrast, our work uses Word2Vec to consider the most similar words to an ambiguous word in the context or sentences, to rebuild a graph of the matched words. As a result, we show a higher F1-Measure value than the previous methods by using Word2Vec.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.769-780
• /
• 2005

This paper addresses a novel application of meshes to analyzing the deformation patterns of 2D signals. The proposed mesh is distinguished form the previous models in that it includes simulated charges in each node that interact with external charges comprising an input pattern. Therelaxation of the mesh given an input is carried out by any of the well-known numerical integration techniques. The result of the relaxation is a deformed mesh. This Paper provides four criterion functions for measuring the pattern deformation. A set of trained meshes was created from the simple average of target patterns. Experimental results show that these measures, although highly intuitive, are not good enough to capture the amount and characteristics of pattern deformation. If more sophisticated measures are found and incorporated into the relaxation process, we expect that a better and high-performance mesh framework is realized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1689-1700
• /
• 1993

WDM(Wavelength Division Multiplexing) based-on fixed wavelengths is a new means of utilizing the bandwidth of optical fibers. In this Paper, an improved virtual topology called "(a, $\beta$,${\gamma}$) ShuffleNet " is introdced for designing large-scale WDM switches. The proposed one is an architecture created by vertically stacking x planes of a ($\beta$,${\gamma}$) ShuffleNet in parallel via $\beta$r nodes called "bridge nodes" so that N-by-N(N=(x*$\beta$${\gamma}$*${\gamma}$) switching is achieved based on the self-routing algorithm for each ($\beta$,${\gamma}$) ShuffleNet. With the topological parallelism, in contrast to the conventional virtual topologies, the diameter of 2${\gamma}$ hops can be fixed and high utilization and performance are provided while N increases. Such a scalability characteristic allows to design a growable broadband switch. As for the delay, we show that the traffic locality, due to the topological feature. result in low delay characteristics.lay characteristics.