• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1310-1323
• /
• 2008

Recently, many studies on automated generation of composite Web services have been done. Most of these works compose Web services by chaining their inputs and outputs, but do not consider the functional semantics. Therefore, they may construct unsatisfied composite services against users' intention. Futhermore, they have high time-complexity since every possible combinations of available services should be considered. To resolve these problems, this paper proposes a sophisticated composition method that explicitly specifies and uses the functional semantics of Web services. Specifically, A graph model is constructed to represent the functional semantics of Web services as well as the dependency among inputs and outputs. On the graph, we search core services which provide the requested function ality and additional services which transform between I/O types of the user request and the core services. Then, composite services are built from combinations of the discovered services. The proposed method improves the semantic correctness of composite services by the functional semantics of Web services, and reduces the time complexity by combinations of functionally related services.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.711-720
• /
• 2000

BADA-IV/XML is a system designed specifically for managing XML. Documents and is essential to various electronic document applications as a fundamental system. BADA-IV/XML supports all of aspects of data model, querying and manipulation operations for managing XML documents. This paper provides an overview of these aspects of the BADA-IV/XML, as well as defines schema classes for stroing, querying and maintaining hierarchical semantics of multimedia documents and structural semantics of complex documents linked with each other, Also a multimedia document query language is designed and implemented to support essential operations for efficient searching and managing multimedia documents. Finally, some simulation results show the performance of the paged VF(Virtual Fragmentation) model and the search model using element's identifier as compared with a general model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1680-1691
• /
• 1994

We propose an extended hypertext data model based on object oriented paradigm that can easily the real world and semantics. We use the BNF notation to formalize the model. In our model, We introduce conceptional navigation by associating semantics on links and drive intelligent navigation using weights on links to alleviate user disorientation problem which is currently somewhat vague. We functionally classify the hypertext node into three types:Indexing node, Content node, Extract node and likewise classify the link into Alink type, Rlink type, Slink type. We believe that the typed node and typed link approach accommodate efficient query/search in hypertext.

• Asia pacific journal of information systems
• /
• v.9 no.1
• /
• pp.115-142
• /
• 1999

Legacy applications are valuable assets that should be integrated into next generation business systems. To gain this advantage, progressive companies can reverse engineer the legacy business operations. This paper presents a form-driven object-oriented reverse engineering(FORE) methodology by the use of business forms to recover semantics of legacy applications. They retain the user-oriented contents of business and thus are easily understandable. Our form driven object-oriented reverse engineering methodology consists of five phases: form and usage analysis, form object slicing, object structure modeling, scenario design, and model integration. Knowledge about form structure and user interaction with legacy applications is used to capture the design semantics. An object model, which consists of an object structure model and scenario results from such form knowledge. The resulting object model is more likely to help reverse engineers understand and reuse legacy systems.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.2-27
• /
• 2002

As pact of a long-ranged project that aims at establishing database-theoretic semantics as a model of computational semantics, this presentation focuses on the development of a syntactic component for processing strings of words or sentences to construct semantic data structures. For design arid modeling purposes, the present treatment will be restricted to the analysis of some problematic constructions of Korean involving semi-free word order, conjunction arid temporal anchoring, and adnominal modification and antecedent binding. The present work heavily relies on Hausser's (1999, 2000) SLIM theory for language that is based on surface compositionality, time-linearity arid two other conditions on natural language processing. Time-linear syntax for natural language has been shown to be conceptually simple and computationally efficient. The associated semantics is complex, however, because it must deal with situated language involving interactive multi-agents. Nevertheless, by processing input word strings in a time-linear mode, the syntax cart incrementally construct the necessary semantic structures for relevant queries and valid inferences. The fragment of Korean syntax will be implemented in Malaga, a C-type implementation language that was enriched for both programming and debugging purposes arid that was particluarly made suitable for implementing in Left-Associative Grammar. This presentation will show how the system of syntactic rules with constraining subrules processes Korean sentences in a step-by-step time-linear manner to incrementally construct semantic data structures that mainly specify relations with their argument, temporal, and binding structures.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.42-53
• /
• 2007

Looking back the history of formal treatment of linguistics, we cannot disregard the contribution of possible world semantics. Intensional logic of Montague semantics, DRT (Discourse Representation Theory), mental space, and situation theory are closely related to or compared with the notion of possible world. All these theories have commonly clarified the structure of belief context or uncertain knowledge, employing hypothesized worlds. In this talk, I firstly brief the pedigree of these theories. Next, I will introduce the recent development of modal logic for the representation of (i) knowledge and belief and (ii) time, in which belief modality is precisely discussed together with the accessibility among possible worlds. I will refer to BDI (belief-desire-intention) logic, CTL (computational tree logic), and sphere-based model in belief revision. Finally, I will discuss how these theories could be applied to the further development of analyses of natural language.

• Language and Information
• /
• v.8 no.1
• /
• pp.1-26
• /
• 2004

This paper investigates the nature of the discourse domain involved with focus sentences. The major theories of focus including Roothian Alternative Semantics are critically reviewed: Alternative Semantics takes a contradictory attitude toward the truth conditional aspect of free focus. The truth conditional differences are treated as a pragmatic inference, while they are captured by the semantic mechanism, that is, the alternative sets generated by focus constructions. In addition, the alternative sets are ad hoc since they are generated only for focus constructions. This paper attempts to show that the alternative sets introduced by foci in the framework of Alternative Semantics are neither necessary nor sufficient for an analysis of focus. It is argued that the domain sets simply provided by the model itself suffices for a proper analysis of focus constructions.

• Language and Information
• /
• v.8 no.1
• /
• pp.163-182
• /
• 2004

Since metaphor was proposed to be a matter of thought instead of language over two decades ago, the research in this area has made most of its progress by the cognitivists. For the cognitivists represented by Lakoff, metaphor is not a mere poetic or rhetoric device, but is central to our everyday language. Furthermore, according to them, we categorize the world and break it into concepts mainly through metaphors, and truth conditions simply cannot account for metaphor. However, this cognitivists' view has been severely counterattacked by the truth-conditional semanticists. Their main criticism is that the cognitivists do not provide a way to go from our internal representations to the outside world. It is also criticized that the cognitive theory of metaphor as cross-conceptual domain mappings is too broad and general, and that they do not explain why a particular metaphorical expression should be subsumed under one mapping rather than another mapping, i.e., their schemes and structural relations are not predictive. In this context, the purpose of this paper is to propose a model for metaphor interpretation that combines the virtues of the two opposite views of metaphor. Truth-conditional semantics cannot ignore cognitive aspects of language, so-called states of affairs or mental representations, while cognitive theories cannot neglect vigorous representation of meaning with objective reality. This paper will try to present a preliminary outline of this combining model.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.570-592
• /
• 2019

The Event-B design pattern is an excellent way to quickly develop a formal model of the system. Researchers have proposed a number of Event-B design patterns, but they all lack formal behavior semantics. This makes the analysis, verification, and simulation of the behavior of the Event-B model very difficult, especially for the control-intensive systems. In this paper, we propose a novel method to transform the Event-B synchronous control flow design pattern into the labeled transition system (LTS) behavior model. Then we map the design pattern instantiation process of Event-B to the instantiation process of LTS model and get the LTS behavior semantic model of Event-B model of a multi-level complex control system. Finally, we verify the linear temporal logic behavior properties of the LTS model. The experimental results show that the analysis and simulation of system behavior become easier and the verification of the behavior properties of the system become convenient after the Event-B model is converted to the LTS model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3168-3186
• /
• 2020

Automatic topic essay generation (TEG) is a controllable text generation task that aims to generate informative, diverse, and topic-consistent essays based on multiple topics. To make the generated essays of high quality, a reasonable method should consider both diversity and topic-consistency. Another essential issue is the intrinsic link of the topics, which contributes to making the essays closely surround the semantics of provided topics. However, it remains challenging for TEG to fill the semantic gap between source topic words and target output, and a more powerful model is needed to capture the semantics of given topics. To this end, we propose a pretraining-based contextual self-attention (PC-SAN) model that is built upon the seq2seq framework. For the encoder of our model, we employ a dynamic weight sum of layers from BERT to fully utilize the semantics of topics, which is of great help to fill the gap and improve the quality of the generated essays. In the decoding phase, we also transform the target-side contextual history information into the query layers to alleviate the lack of context in typical self-attention networks (SANs). Experimental results on large-scale paragraph-level Chinese corpora verify that our model is capable of generating diverse, topic-consistent text and essentially makes improvements as compare to strong baselines. Furthermore, extensive analysis validates the effectiveness of contextual embeddings from BERT and contextual history information in SANs.