• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.147-156
• /
• 2006

Event logging plays increasingly an important role in system and network management, and syslog is a de-facto standard for logging system events. However, due to the semi-structured features of Common Log Format data most studies on log analysis focus on the frequent patterns. The extensible Markup Language can provide a nice representation scheme for structure and search of formatted data found in syslog messages. However, previous XML-formatted schemes and applications for system logging are not suitable for semantic approach such as ranking based search or similarity measurement for log data. In this paper, based on ranked keyword search techniques over XML document, we propose an XML tree structure through a new data modeling approach for syslog data. Finally, we show suitability of proposed structure for semantic retrieval.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.615-616
• /
• 2016

최근 4차 산업으로 패러다임이 변화함에 따라 SW산업이 더욱 중요하게 되었다. 이에 따라 전 세계적으로 코딩 교육에 대한 수요도 증가하게 되었고 기업에서도 SW를 잘 만들기 위한 코드 관리 중요성도 증가하게 되었다. 많은 양의 프로그래밍 소스코드를 사람이 일일이 채점하고 관리하는 것은 사실상 불가능하기 때문에 이러한 문제를 해결할 수 있는 코드 평가 시스템이 요구되고 있다. 하지만 어떤 코드가 좋은 코드인지 코드를 어떻게 평가해야하는지에 대한 명확한 기준은 없으며 이에 대한 연구도 부족한 상황이다. 최근에 주목 받고 있는 Deep Learning 기술은 이미지 처리, 자연어 처리등 기존의 Machine Learning 알고리즘이 냈던 성과보다 훨씬 뛰어난 성과를 내고 있다. 하지만 Programming language 영역에서는 아직 깊이 연구된 바가 없다. 따라서 본 연구에서는 Deep Learning 기술로 알려진 Convolutional Neural Network의 변형된 형태엔 Tree-based Convolutional Neural Network를 사용하여 프로그래밍 소스코드를 분석, 분류하는 알고리즘 및 코드의 Representation Learning에 대한 연구를 진행함으로써 이러한 문제를 해결하고자 한다.

• Journal of the Society of Naval Architects of Korea
• /
• v.48 no.3
• /
• pp.207-214
• /
• 2011

Ship design requirements described in the building specification should be reflected in the design process. This paper identifies the configuration of requirements mentioned in the building specification using Ontology Representation Language (OWL). Ontology-based semantic search system specifies the requirement items. Through this extraction, building specifications mentioned for each entry are configured to the tree. Tracking requirements for ship design and a set of procedures to instruct is also used for the V model of systems engineering. The semantic search engine of robot agent and ontology can search the requirements specification document and extract the design information. Thereafter, design requirements for the tracking model that proposes the relationship between the associated BOM(bill of material) and product structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.785-804
• /
• 2017

Due to various factors such as postures, facial expressions and illuminations, face recognition by videos often suffer from poor recognition accuracy and generalization ability, since the within-class scatter might even be higher than the between-class one. Herein we address this problem by proposing a hierarchical cascaded classifier for video face recognition, which is a multi-layer algorithm and accounts for the misclassified samples plus their similar samples. Specifically, it can be decomposed into single classifier construction and multi-layer classifier design stages. In single classifier construction stage, classifier is created by clustering and the number of classes is computed by analyzing distance tree. In multi-layer classifier design stage, the next layer is created for the misclassified samples and similar ones, then cascaded to a hierarchical classifier. The experiments on the database collected by ourselves show that the recognition accuracy of the proposed classifier outperforms the compared recognition algorithms, such as neural network and sparse representation.

• Annual Conference on Human and Language Technology
• /
• 1999.10e
• /
• pp.297-303
• /
• 1999

오늘날 전산망을 통해 대량의 다양한 언어 정보가 일상 언어로 교환되고 있다. 따라서 대량의 이러한 정보를 효율적으로 처리할 수 있는 언어 정보 처리 시스템이 필요하다. Hausser (1999)와 이기용(1999)는 그러한 언어 정보 처리 시스템으로 데이터베이스 의미론을 주장하였다. 이 의미론의 특징은 자연언어의 정보 처리 시스템 구축에 상업용 데이터베이스 관리 시스템을 활용한다는 점이다. 이때 야기되는 문제 중의 하나가 표상(representation)의 문제이다. 그 이유는 언어학의 표상 방법이 데이터베이스 관리 시스템의 표상 방법과 다르기 때문이다. 특히, 관계형 데이터베이스 관리 시스템(RDBMS)에서는 테이블 (table) 형식으로 각종 정보를 표시한다. 따라서, 이 논문의 주안점(主眼点)은 언어학에서 흔히 쓰이는 표상 방법, 즉 문장의 통사 구조를 표시하는 수형(tree)이나 의미 구조를 표시하는 논리 형태(logical form), 또는 단어나 구의 특성을 나타내는 자질 구조(feature structure)를 테이블 형식으로 대체하는 방법을 모색하는 것이다. 더욱이 관계형 데이터베이스 관리 시스템에서는 테이블에 대한 각종 연산, 특히 두 테이블을 연결(link)하는 작업이 가능하고 이런 연산 과정을 통해 정보를 통합하거나 여과할 수 있기 때문에 관련 정보를 하나의 테이블에 표상하거나 정보 자료의 분산 저장과 자료의 순수성을 유지하는 것이 용이하다. 이 논문은 곧 이러한 점을 가급적 간단한 예를 들어 설명하는 데 그 목적이 있다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.2
• /
• pp.76-84
• /
• 2009

Since too much information has been generated, it became very difficult to find out valuable and necessary information. In order to deal with the problem of information overload, the taxonomy for information visualization techniques has been based upon visualized shapes such as tree map, fisheye view and parallel coordinates, so that it was difficult to choose the right representation technique by data characteristics. Therefore, this study was designed to introduce a new taxonomy for the information visualization by data characteristics which defined by space (3D vs. multi-dimensions), time (continuous vs. discrete), and relations of data (qualitative vs. quantitative). To verify the new taxonomy, forensic data which were generated to investigate the culprit of network security was used. The result showed that the new taxonomy was found to be very efficient and effective to choose the right visualized shape for forensic data for network security. In conclusion, the new taxonomy was proven to be very helpful to choose the right information visualization technique by data characteristics.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.4
• /
• pp.289-293
• /
• 2009

This study proposes a novel double-base log encoder (DBLE) for flash Analog-to-Digital converters (ADCs). Analog inputs of flash ADCs are represented in logarithmic number systems with bases of 2 and 3 at the outputs of DBLE. A look up table stores the sets of exponents of base 2 and 3 values. This algorithm improves the performance of a DSP (Digital Signal Processor) system that takes outputs of a flash ADC, since the double-base log number representation does multiplication operation easily within negligible error range in ADC. We have designed and implemented 6 bits DBLE implemented with ROM (Read-Only Memory) architecture in a $0.18\;{\mu}m$ CMOS technology. The power consumption and speed of DBLE are better than the FAT tree and binary ROM encoders at the cost of more chip area. The DBLE can be implemented into SoC architecture with DSP to improve the processing speed.

• Journal of Ecology and Environment
• /
• v.44 no.3
• /
• pp.196-206
• /
• 2020

Background: The Himalayan forests are of great importance to sustain the nature and community resource demands. These forests are facing pressures both from anthropogenic activities and ongoing global climatic changes. Poor natural regeneration has been considered a major problem in mountainous forests. To understand the population structure and regeneration status of Larix (Larix griffithiana and Larix himalaica), we conducted systematic vegetation surveys in three high-altitude valleys namely Ghunsa (Kanchenjunga Conservation Area, KCA), Langtang (Langtang National Park, LNP), and Tsum (Manaslu Conservation Area, MCA) in Nepal Himalaya. The average values of diameter at breast height (DBH), height, and sapling height were compared for three sites and two species using Kruskal-Wallis test. Population structure was assessed in terms of proportion of seedlings, saplings, and trees. Regeneration was analyzed using graphical representation of frequencies of seedlings, saplings, and trees in histograms. Results: The results showed that the population structure of Larix in terms of the proportion of seedling, sapling, and tree varied greatly in the three study areas. KCA had the highest record of seedling, sapling, and tree compared to other two sites. Seedlings were the least among three forms and many plots were without seedlings. We found no seedling in MCA study plots. The plot level average DBH variation among sites was significant (Kruskal-Wallis χ² = 7.813, df = 2, p = 0.02) as was between species (Kruskal-Wallis χ² = 5.9829, df = 1, p = 0.014). Similarly, the variation in average tree height was significant (Kruskal-Wallis χ² = 134.23, df = 2, p < 0.001) among sites as well as between species (Kruskal-Wallis χ² = 128.01, df = 1, p < 0.001). All the sites showed reverse J-shaped curve but more pronounced for KCA and MCA. In comparing the two species, Larix griffithiana has clear reverse J-shaped diameter distribution but not Larix himalaica. Conclusion: The varied responses of Larix manifested through regeneration status from spatially distinct areas show that regeneration limitations might be more pronounced in the future. In all the three studied valleys, regeneration of Larix is found to be problematic and specifically for Larix griffithiana in MCA and Larix himalaica in LNP. To address the issues of disturbances, especially serious in LNP, management interventions are recommended to sustain the unique Himalayan endemic conifer.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.438-450
• /
• 2003

Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.15 no.1
• /
• pp.61-74
• /
• 2004

Objectives：This study was performed to introduce a psychoeducational family therapy model for the families of schizophrenic patient and to investigate the effect of this model on the changes in coping style and depressive symptoms of the family members, and in perception of emotional support by families and depressive symptoms of patients. Methods：Nine preschool children, 3-5 years old, experiencing physical injuries caused by attack from a psychotic patient at kindergarten, were evaluated for psychological assessments；Intelligence test, MSSB(MacArthur Story-Stem Battery), H-T-P test(House-Tree-Person test). And their parents completed rating scale, KPI-C(Korean Personality Inventory for Children about children’s psychological conditions). Results：With respects to the contents and emotional reactions of MSSB, 9 preschool children showed generally high levels of anxiety, depression, avoidance, aggression, probably related to the traumatic experiences. Even though children couldn't verbally report directly about their traumatic experiences, in both MSSB, structured play narrative assessment tool, and HPT, free drawing and association test, they demonstrated psychiatric problems through reenactment plays, regardless of clinical diagnoses. Conclusion：Present study allowed us the chance to see beyond the outer pathological behaviors of PTSD in preschool children, through deeper evaluations of their mental representation. These preliminary data suggest deep understanding of internal representation would be of help for thorough evaluations and treatment plan for preschool children, experiencing severe trauma.