• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.203-210
• /
• 2016

Korean is free of omission of sentence elements and modifying scope, so managing it on morphological analyzer is better than parser. In this paper, we propose functional expansion methods of the morphological analyzer to ease the burden of parsing. This method is a longest phrase matching method. When the series of several morpheme have one syntax category by processing of Unknown-words, Compound verbs, Compound nouns, Numbers and Symbols, our method combines them into a syntactic unit. And then, it is to treat by giving them a semantic features as syntax unit. The proposed morphological analysis method removes unnecessary morphological ambiguities and deceases results of morphological analysis, so improves accuracy of tagger and parser. By empirical results, we found that our method deceases 73.4% of Parsing tree and 52.4% of parsing time on average.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.125-138
• /
• 2016

The service identification in service-oriented developments has been conducted by based on workflow, goals, scenarios, usecases, components, features, and patterns. However, the identification of service by semantic approach at the business value view was not detailed yet. In order to enhance accuracy of identifying business service, this paper proposes a method for identifying business service by analyzing syntax and semantics in XL-BPMN model. The business processes based on business scenario are identified, and they are designed in a XL-BPMN business process model. In this business process model, an unit business service is identified through binding closely related activities by the integrated analysis result of syntax patterns and properties-based semantic similarities between activities. The method through XL-BPMN model at upper business levels can identify the reusable unit business service with high accuracy and modularity. It also can accelerate more service-oriented developments by reusing identified services.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.231-243
• /
• 2009

Many DSP systems are streaming applications in which streams of data constantly flow through a set of filters. Dataflow programming paradigm is one of effective methods for representing these streaming applications. Dataflow programming model explicitly exposes parallelisms within an application, which helps compiling of the application onto a multicore platform. We propose SPEX(Signal Processing Extension), a language extension to a standard imperative language based on the parameterized dataflow model. Parameterized dataflow model is a kind of dataflow model that can express a modest fashion of dynamism contrary to the synchronous dataflow that can represent only static dataflow. SPEX facilitates characterizing an application written in conventional imperative languages such C/C++ as a streaming application. SPEX is comprised of a few keywords augmented to the conventional C++ syntax for representing dataflow paradigm. SPEX also restricts the syntax and semantics of C++ in order to fit the program within a certain streaming programming category. In this paper, we focus on the capability of SPEX in representing streaming computations within filters and streaming communications among filters.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.36-43
• /
• 2017

Syntactic information represents the dependency relation between predicates and arguments, and it is helpful for improving the performance of Semantic Role Labeling systems. However, syntax analysis can cause computational overhead and inherit incorrect syntactic information. To solve this problem, we exclude syntactic information and use only morpheme information to construct Semantic Role Labeling systems. In this study, we propose an end-to-end SRL system that only uses morpheme information with Stacked Bidirectional LSTM-CRFs model by extending the LSTM RNN that is suitable for sequence labeling problem. Our experimental results show that our proposed model has better performance, as compare to other models.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.80-86
• /
• 2003

XML is being watched with keen interest for the communication and saving of information. Information represented in XML provides more accuracy and a higher-speed of reference after the process of being implication. But, it is difficult that XML document is exchanged or shared in different area such as electronic commerce or digital library. Because, XML document is being different in syntax but similar in logic, with using structured difference analysis. In this thesis, we converted object-oriented class diagram to XML DTD and designed an index mechanism based on the structure information for the converted XML DTD. With our methods, we could effectively and lastly retrieve the specific element and respect to usefully access element by simple operations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.807-825
• /
• 2020

In recent years, business environments have become more complex; therefore, enterprises must be capable of responding flexibly and agilely. For these purposes, effective enterprise systems service monitoring and early decision making based on the same, emerge as core competency of the enterprise. In addition, enterprise system techniques that filter meaningful data are needed to event processing. However, the existing study related with this is nothing but discovering of service faults by monitoring depending upon API of BPEL engine or middleware, or is nothing but processing of simple events based on low-level events. Accordingly, there would be limitations to provide useful business information. In this study, we present an extended event processing model that enables delivery of more valuable and useful business information through situation detection. Primarily, the event processing architecture in an enterprise system is proposed as a definite approach, and then define an event meta-model suitable for the proposed architecture. Based on the defined model, we propose the syntax and semantics of the elements that make up the event processing language include various and progressive event operators, the rules, complex event pattern, etc. In addition, an event context mechanism is proposed to analyze more delicate events. Finally, the effectiveness and applicability of proposed approach is presented through a case study.

• Journal of Information Processing Systems
• /
• v.4 no.2
• /
• pp.61-66
• /
• 2008

In recent years, numerous studies have been attempted to exploit ontology in the area of ubiquitous computing. Especially, some kinds of ontologies written in OWL are proposed for major issues in ubiquitous computing such like context-awareness. OWL is recommended by W3C as a descriptive language for representing ontology with rich vocabularies. However, developers struggle to design ontology using OWL, because of the complex syntax of OWL. The research for OWL visualization aims to overcome this problem, but most of the existing approaches unfortunately do not provide efficient interface to visualize OWL ontology. Moreover, as the size of ontology grows bigger, each class and relation are difficult to represent on the editing window due to the small size limitation of screen. In this paper, we present OWL visualization scheme that supports class information in detail. This scheme is based on concept of social network, and we implement OWL visualization plug-in on $Prot{\acute{e}}g{\acute{e}}$ that is the most famous ontology editor.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.109-119
• /
• 2017

In recent through development of IOT owing to that mass stream data is being generated in variety of application complex event processing technology is being watched with keen interest as a technology to analyze this kind of real-time continuous data. However, the existing study related with complex event processing only comes to an end at simple event processing based on low-level event or comes to an end at service defect discovery with providing limited operator and so on. Accordingly, there would be limitation to provide useful analysis information. In this paper in consideration of complex event along with aspect-oriented programming an extended complex event model is provided, which is possible to provide more valuable and useful information. Specifically, we extend the model to support hierarchical event structures and let the model recognize point-cuts of aspect-oriented programming as events. We provide the event operators designed to specify the events on instances and handle temporal relations of the instances. It is presented that syntax and semantics of constructs in our event processing language including various and progressive event operators, complex event pattern, etc. In addition, an event context mechanism is proposed to analyze more delicate events. Finally, through application studies application possibility of this study would be shown and merits of this event model would be present through comparison with other event model.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.1240-1245
• /
• 2006

한국어 문장을 구조 분석할 때에 모호성을 발생시키는 유형 중의 하나가 나열 및 병렬형이다. 문장 구조 복잡도를 증가시키는 나열 및 병렬형을 구조 분석 전에 미리 하나의 단위로 묶어서 처리하는 것이 문장 구조 분석의 정확도를 높이는데 중요하다. 본 연구에서는 형태소 태그를 이용한 기본 규칙으로 문장을 청크 단위로 분할하고 분할된 청크 중에서 나열형을 인식하여 해당되는 청크들을 하나의 나열 청크로 통합하여 청크의 개수를 줄인다. 병렬형에 대해서는 반복되는 병렬 청크의 범위와 생략된 용언을 복원한다. 이러한 인식은 첫 단계로 기호(symbol)를 중심으로 구축된 간단한 규칙으로 인식을 하고 이러한 규칙에 해당되지 않는 형태의 나열 및 병렬형은 Maximum Entropy 모델을 이용하여 적용한다. ME모델은 어휘자질, 형태소 품사 자질, 거리 자질, 의미자질, 구 단위 태그 자질(NP:명사구, VP:동사구, AP:형용사구), BIO 태그(Begin, Inside, Outside) 자질에 대한 ME(Maximum Entropy) 모델을 이용하여 구축되었다.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.222-229
• /
• 2016

Linked Data is a powerful technology for storing and publishing the structures of data. It is helpful for web applications because of its usefulness through semantic query data. However, using Linked Data is not easy for ordinary users who lack knowledge about the structure of data or the query syntax of Linked Data. For that problem, we propose a translator component that is used for translating RESTful/JSON request messages into SPARQL commands based on ontology - a metadata that describes the structure of data. Clients do not need to worry about the structure of stored data or SPARQL, a kind of query language used for querying linked data that not many people know, when they insert a new instance or query for all instances of any specific class with those complex structure data. In addition, the translator component has the search function that can find a set of data from multiple classes based on finding the shortest paths between the target classes - the original set that user provide, and target classes- the users want to get. This translator component will be applied for any dynamic ontological structure as well as automatically generate a SPARQL command based on users' request message.