• 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 the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.79-94
• /
• 1997

OMG (Object Management Group) published a security service specification, called CORBA (Common Object Request Broker Architecture) security reference model because the integration of security and object-oriented techniques was critical for successful deployment of distributed object systems. The CORBA security reference model treats access control as an implementation independent semantic concept but has incomplete semantics of the access control function. Because of such imcompleteness it is difficult for the system administrator and the CORBA security implementor to have the same understanding for the meaning of access control in the CORBA security. We propose a formal model for access control the CORBA security using the formal description language, which is called Z language based on typed set theory. The proposed model provides concrete semantics of the access control function to both the system administrator and the implementor.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.75-94
• /
• 2005

Research in the decision sciences has continued to develop a variety of mathematical models as well as software tools supporting corporate decision-making. Yet. in spite of their potential usefulness, the models are little used in real-world decision making since the model solution processes are too complex for ordinary users to get accustomed. This paper proposes an intelligent and flexible model-solver integration framework that enables the user to solve decision problems using multiple models and solvers without having precise knowledge of the model-solution processes. Specifically, for intuitive model-solution, the framework enables a decision support system to suggest the compatible solvers of a model autonomously without direct user intervention and to solve the model by matching the model and solver parameters intelligently without any serious conflicts. Thus, the framework would improve the productivity of institutional model solving tasks by relieving the user from the burden of leaning model and solver semantics requiring considerable time and efforts.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.483-503
• /
• 1997

One important question that arises when dealing with temporal databases in context of object-oriented systems is the method that associates time with attributes relationship semantics. Results of previous work about attribute versioning, particularity extending flat(First Normal Form: FNF) or nested(Non-First Normal Form: NFNF) relational models. are not applicable to temporal object-oriented databases. This is because object-oriented models provide more powerful constructs than traditional models for structuring complex objects. Therefore, this paper presents an formal approach for incorporating temporal extension to object-oriented databases. Our goal in this paper is to study temporal object-oriented database representation according to generalization, aggregation and association among objects. We define tile concepts of attribute versioning in temporal object-oriented model, and we concentrate on the representation of temporal relationship among objects. Another contribution of this paper is to specify time constraints on relationship semantics and analyze our model based on representation criteria. By means of formalizing tile temporal object oriented model, this paper can not only provide tile robust operating functions that design algebraic operators, but also entrance the reuse of modules.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.102-116
• /
• 2006

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, custom3 regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification Introduces a number of problems not only for the classification itself but also for the product database in general. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eClass, however, have a lot of limitations to meet these requirements for dynamic features of classification. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes. And describe the semantic classification model, which satisfies the requirements for dynamic features oi product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.29-41
• /
• 1998

This paper is for the design and implementation of SGML presentation system to format based on DSSSL (Document style semantics and specification Language). ISO proposed DSSSL as the technological standard for formatting and transforming SGML document. So, the body of this paper shows the design of this system in accordance with the model defined in DSSSL. This system, which is able to provide Korean, has Parsing function of arbitrary DTD, SGML document and DSSSL styles sheet, and contains a formatter that can manage various details, such as table, list, picture and others, as well as text.

• Journal of the Korea Society for Simulation
• /
• v.3 no.1
• /
• pp.125-134
• /
• 1994

In real-time database systems, transactions's commitment done before the given deadlines is more important than just getting the maximum throughput. Transactions missing the given deadlines are no longer meaningful in real-time applications. Therefore, there is a need for new transaction processing models to meet the given deadlines in real-time database applications, because moat conventional transaction models are not designed to meet deadlines. In this paper we propose a new transaction models which uses multiple versions of a data item. The model uses read-from graphs and dynamic reorder of transactions to meet deadlines. A read-from graph contains the past read semantics of read operations and support the model to decide which database operation to be taken. Then, we show simulation results comparing the proposed model with other transaction models such as two phase locking model and the optimistic concurrency control model.

• ETRI Journal
• /
• v.46 no.1
• /
• pp.35-47
• /
• 2024

This study introduces CR-M-SpanBERT, a coreference resolution (CR) model that utilizes multiple embedding-based span bidirectional encoder representations from transformers, for antecedent recognition in natural language (NL) text. Information extraction studies aimed to extract knowledge from NL text autonomously and cost-effectively. However, the extracted information may not represent knowledge accurately owing to the presence of ambiguous entities. Therefore, we propose a CR model that identifies mentions referring to the same entity in NL text. In the case of CR, it is necessary to understand both the syntax and semantics of the NL text simultaneously. Therefore, multiple embeddings are generated for CR, which can include syntactic and semantic information for each word. We evaluate the effectiveness of CR-M-SpanBERT by comparing it to a model that uses SpanBERT as the language model in CR studies. The results demonstrate that our proposed deep neural network model achieves high-recognition accuracy for extracting antecedents from NL text. Additionally, it requires fewer epochs to achieve an average F1 accuracy greater than 75% compared with the conventional SpanBERT approach.

• Proceedings of the CALSEC Conference
• /
• 1998.10a
• /
• pp.57-68
• /
• 1998

ㆍ STEP is an International Standard (ISO 10303) - that defines the methodology to create computer interpretable product data models. ㆍ STEP Implementation - allows exchange and sharing of product data while retaining semantics throughout the product life cycle. ' STEP is in deployment - PDM data exchange at Boeing and others - Geometry data exchange at GM and others ㆍ The STEP community overcomes obstacles - “They will never finish the standard” (done 1994) - “They will never be able to transfer solids” (done 1995) - “They will never make solids transfer reliable” (done 1997) - “They will never implement all those Application Protocols”(TBD)(omitted)

• Genomics & Informatics
• /
• v.3 no.2
• /
• pp.47-51
• /
• 2005

Molecular mechanisms of biological processes are typically represented as 'pathways' that have a graph­analogical network structure. However, due to the diversity of topics that pathways cover, their constituent biological entities are highly diverse and the semantics is embedded implicitly. The kinds of interactions that connect biological entities are likewise diverse. Consequently, how to model or process pathway data is not a trivial issue. In this review article, we give an overview of the challenges in pathway database development by taking the INOH project as an example.