• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2132-2139
• /
• 2006

A parallel program including a nested parallelism has a complex execution aspects and tasks are executed concurrently. This concurrency is a main cause raising most of errors. In this paper, a new method for checking concurrency between two tasks is proposed. The existing techniques for checking the concurrency have their limits to represent a global structure. A new labeling technique that appropriate for image visualization is proposed. To show the global structure by imaging of execution aspects through region partition on 2D plane. On the basis of it, each of the tasks that can distinguish the ordered relation create an independent image. Image information generated by the result simplifies semantic analysis of the related task, and provides an outline of a global execution aspects structure of the program to user effectively.

• 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.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.316-321
• /
• 2017

We analyze the online Hangul handwriting recognition problem (HHR) and present solutions based on recurrent neural networks. The solutions are organized according to the three kinds of sequence labeling problem - sequence classifications, segment classification, and temporal classification, with additional consideration of the structural constitution of Hangul characters. We present a stacked gated recurrent unit (GRU) based model as the natural HHR solution in the sequence classification level. The proposed model shows 86.2% accuracy for recognizing 2350 Hangul characters and 98.2% accuracy for recognizing the six types of Hangul characters. We show that the type recognizing model successfully follows the type change as strokes are sequentially written. These results show the potential for RNN models to learn high-level structural information from sequential data.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.219-225
• /
• 2000

In order to provide a proper mobile internet service, Mobile IP is necessary to support IP mobility. Service network should be a backbone network among mobile agents which support mobility, and MPLS(Multi-protocol Label Switching) of IETF(Internet Engineering Task Force) is being considered as a backbone network because of its speed, scalability and the excellent service capability. MPLS, however, doesn't provide a way to support the mobility of the nodes. In this paper, we present an efficient IMT-2000 network architecture using MPLS to handle Mobile IP. The proposed architecture combines the MPLS label distribution and Mobile IP registration. It doesn't use the layer 3 encapsulation, instead it uses layer 2 for tunneling the data, reduces the size of the header, and it can tunnel the data without delay, which is needed to look up the mobility binding list, as a result.

• Journal of the Korean Society for information Management
• /
• v.35 no.1
• /
• pp.231-250
• /
• 2018

In this paper, we propose a new methodology for extracting and formalizing subjective topics at a specific time using a set of keywords extracted automatically from online news articles. To do this, we first extracted a set of keywords by applying TF-IDF methods selected by a series of comparative experiments on various statistical weighting schemes that can measure the importance of individual words in a large set of texts. In order to effectively calculate the semantic relation between extracted keywords, a set of word embedding vectors was constructed by using about 1,000,000 news articles collected separately. Individual keywords extracted were quantified in the form of numerical vectors and clustered by K-means algorithm. As a result of qualitative in-depth analysis of each keyword cluster finally obtained, we witnessed that most of the clusters were evaluated as appropriate topics with sufficient semantic concentration for us to easily assign labels to them.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.513-525
• /
• 2006

Search results of XML keyword search are defined generally as the most specific elements containing all query keywords in the literature. The labels of XML elements and semantic information such as ontology, conceptual model, thesaurus, and so on, are used to improve the preciseness of the search results. This paper presents a hierarchical index for an efficient XML keyword query processing on the condition that returnable search concepts are defined and users' query concepts can be interpreted with the help of the semantic information. The hierarchical index separately stores the XML elements containing a keyword on the basis of the hierarchical relations of the concepts that the XML elements belong to, and makes it possible to obtain least common ancestors, which are candidates for the search results, with selectively reading the elements belonging to the concepts relevant to query concepts and without considering all the combinations of the elements having been read. This paper deals with how to organize the hierarchical index and how to process XML keyword queries with the index. In our experiment with the DBLP XML document and the XML documents in the INEX2003 test set, the hierarchical index worked well.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.215-222
• /
• 2002

This paper presents a reliable fully automatic labeling system which fits well with languages having well-developed syllables such as in Korean. The ASL System utilize DAC (Divide and Conquer), a control mechanism, based segmentation algorithm to use phonetic and acoustic information with greater efficiency. The segmentation algorithm is to devide speech signals into speechlets which is localized speech signal pieces and to segment each speechlet for speech boundaries. While HMM method has uniform and definite efficiencies, the suggested method gives framework to steadily develope and improve specified acoustic knowledges as a component. Without using statistical method such as HMM, this new method use only phonetic-acoustic information. Therefore, this method has high speed performance, is consistent extending the specific acoustic knowledge component, and can be applied in efficient way. we show experiment result to verify suggested method at the end.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.34-40
• /
• 2018

This paper presents a new method to estimate the pose of a moving object accurately using a monocular camera and a low-end GPS+IMU sensor system. For this goal, we adopted a deep neural network for the semantic segmentation of input images and compared the results with a semantic map of a neighborhood. In this map matching, we use weight tables to deal with label inconsistency effectively. Signals from a low-end GPS+IMU sensor system are used to limit search spaces and minimize the proposed function. For the evaluation, we added noise to the signals from a high-end GPS-IMU system. The results show that the pose can be recovered from the noisy signals. We also show that the proposed method is effective in handling non-open-sky situations.

• Korean Journal of Plant Taxonomy
• /
• v.36 no.3
• /
• pp.227-255
• /
• 2006

Takenoshin Nakai (1882-1952), Japanese taxonomist and professor of the University of Tokyo, who was one of Korean flora specialists, conducted his plant exploration from 1909 to 1942 after he completed two volumes of Flora Koreana. His collections, which are currently deposited at the University of Tokyo herbarium (TI), are important research resources. Since all collection sites were simply described in his collection sites in Romanized characters based on Japanese pronunciation, it is difficult for Korean as well as Japanese botanists to pinpoint those sites using the current or the old Korean maps. No single literature has been available regarding his collection routes and sites, although this information is essential to current plant systematic research in Korea. From this current study, all locality names were reviewed based on his own collections as well as his written literatures, and those were listed as the order of his collection dates with seven maps here.

• Korean Journal of Plant Taxonomy
• /
• v.42 no.4
• /
• pp.340-353
• /
• 2012

Records found on labels of specimens deposited at University of Tokyo herbarium (TI) and references about Japanese naturalist, Tamezo Mori (1884-1964) were assembled to produce collector's itineraries from 1909 to 1916 in Korea. Mori collected large numbers of botanical specimens from different parts of the country. In August 1911 and 1912, Mori conducted botanical collections in Jeju and southern parts of Korean Peninsula. In 1913 major collections in North Korea by Mori took place in Mt. Baekdusan, Hamkyongnam-do. Following this exploration, in August 1916 Mori conducted another major collections in Pyeongannam-do and Hamgyeongnam-do. It is estimated that approximately 966 Korean specimens collected by Mori are currently held within the collections of The University of Tokyo herbarium (TI). Significantly these holdings also contain 46 type specimens (11 holotypes, 23 syntypes and 12 paratypes).