• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.32-43
• /
• 2001

Due to the limitation of data modeling power and the view update ambiguity, relational view is limitedly used for engineering applications. On the contrary, object-oriented database view would playa vital role in defining custom interface for engineering applications because the above two limitations of the relational view are overcome by the object-oriented view. Above all, engineering application data interface should fully support updates. More specifically, updates against the data interface needs to be unambiguously defined and its semantic behavior should be equal to base schema updates'. For this purpose, we define the notion of update semantic preserving which means that view updates displays the same semantics as base schema. Besides, in order to show the feasibility of this characteristics, specific and concrete algorithms for update preserving updates are presented for a CAD specialized object-oriented database view - MultiView. This paper finds that in order that virtual classes coudld form a schema with 'isa' relationships rather than just a group of classes, the update semantics on the virtual classes should be defined such that the implied meaning of 'isa' relationships between classes are not to be violated. Besides, as its sufficiency conditions, we derived the update semantics and schema constituable conditions of the virtual classes that make view schemas look like base schemas. To my best knowledge, this is the first research that presents the sufficiency conditions by which we could defined object-oriented views as integrated schemas rather than as separate classes.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.3 s.180
• /
• pp.22-31
• /
• 2006

This paper introduces an approach to an ontology-based knowledge framework for product life cycle management (PLM). Participants in a product life cycle want to share comprehensive product knowledge without any ambiguity and heterogeneity. However, previous knowledge management approaches are limited in providing those aspects. Therefore, we suggest an ontology-based knowledge framework including knowledge maps, axioms and specific knowledge far domain. The bottom level, the axiom, specifies the semantics of concepts and relations of knowledge so that ambiguity of the semantics can be alleviated. The middle level is a product development knowledge map; it defines the concepts and the relations of the product domain common knowledge and guides engineers to process their engineering decisions. The middle level is then classified further into more detailed levels, such as generic product level, specific product level, product version level, and product item level for PLM. The top level is specialized knowledge fer a specific domain that gives the solution of a specific task or problem. It is classified into three knowledge types: expert knowledge, engineering function knowledge, and data-analysis-based knowledge. This proposed framework is based on ontology to accommodate a comprehensive range of unambiguous knowledge for PLM and is represented with first-order logic to maintain a uniform representation.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.117-124
• /
• 2006

Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.87-94
• /
• 1996

In order to design an extended relational database management system supporting multilevel security, the standard relational data model is extended and new relational integrity constrains are proposed for the model. The extended relational model and proposed multilevel integrity constraniants maintain database in consistent state and produce a basis that can eliminat eambiguity of entity and relation ship representations bypoly instantiation. The proposed up dates emantics canincreases the efficiency of up date operations by supporting multilevel entry and up dates. The semantics also provides a basis for the implementation of decomposition of extended relations.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.23 no.1
• /
• pp.5-26
• /
• 2012

Mapping FRSAD and other ontology models intends to suggest a higher knowledge level that is independent of any information implementation system or specific context, and to endeavor to focus on the semantics, knowledge structures, subject access, and interoperability. Providing an application of FRSAD model to information environment and representing and sharing the information within the library sector and beyond, there needs encoding scheme for knowledge representation. This study suggested an OWL based ontology architecture for FRSAD model and demonstrated the pilot FRSAD ontology model using Prot$\acute{e}$g$\acute{e}$ software.

• 대한공업교육학회지
• /
• v.33 no.2
• /
• pp.232-247
• /
• 2008

Timely collaboration among businesses is required these days such as in B2B E-Commerce. That is, emergency requests or urgent information among businesses should be processed in an immediate mode. In this paper we investigate the semantics on timing constraints of timely collaboration among businesses in terms of event, data, and action and present ECA rule construction related to the timing constraints and its violation. The prototype is implemented using web-based active functionality component.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.95-103
• /
• 2007

Many techniques have been proposed for mapping from XML to relations, but most techniques did not negotiate the semantics of XML data. The semantics is important to validate storage, query optimization, modification anomaly in process of schema design. Specially, functional dependencies are an important part of database theory, also it is basis of normalization for relational table in BCNF. This paper propose a new technique that reflect functional dependencies to store relation mapped from XML based on XML Schema. The technique can reduce storage redundancy and can keep up content and structure with constraint described by functional dependencies.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.121-129
• /
• 2007

Scalarization is a process that a parallel construct like an array statement of Fortran 90 or FORALL of HPF is converted into sequential loops that maintain the correct semantics. Most compilers of HPF, recognized as a standard data parallel language, convert a HPF program into a Fortran 77 program inserted message passing primitives. During scalariztion, a parallel construct FORALL should be translated into Fortran 77 DO loops maintaining the semantics of FORALL. In this paper, we propose a scalarization algorithm which converts a FORALL construct into a DO loop with improved performance. For this, we define and use a relation distance vector to keep necessary dependence informations. Then we evaluate execution times of the codes generated by our method and by PARADIGM compiler method for various array sizes.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.65-69
• /
• 2003

As complex mathematical models are increasingly adopted for business decision-making, difficulties arise in reusing solvers (i.e., model solving algorithms) against diverse models and data sets and thus the collaboration among users (model/solver builders and decision makers) in multiple departments becomes very difficult. To facilitate the solver reuse, this paper adopts the Web services technologies as the base technologies for linking the solvers to the models, both of which are created on different modeling paradigms and different system platforms, in unified system architecture. Specifically, this paper focuses on designing an ontology that represents the interfacing semantics of the model-solver interactions in a general and standardized form. By referring to the ontology, a model management system (MMS) can autonomously suggest a set of compatible solvers and apply them to individual models even though the decision makers are not knowledgeable enough about all the details of the models and the solvers. Thus, this Web services based MMS would improve the reusability of the solvers by relieving the decision makers from the risk of erroneous application of a solver to syntactically and semantically incompatible models and the burden of considerable understanding of model and solver semantics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.6139-6160
• /
• 2018

For ease of use and access, web browsers are now being used to access and modify sensitive data and systems including critical control systems. Due to their computational capabilities and network connectivity, browsers are vulnerable to several types of attacks, even when fully updated. Browsers are also the main target of phishing attacks. Many browser attacks, including phishing, could be prevented or mitigated by using site-, user-, and device-specific security configurations. However, we discovered that all major browsers expose disparate security configuration procedures, option names, values, and semantics. This results in an extremely hard to secure web browsing ecosystem. We analyzed more than a 1000 browser security configuration options in three major browsers and found that only 13 configuration options had syntactic and semantic similarity, while 4 configuration options had semantic similarity, but not syntactic similarity. We: a) describe the results of our in-depth analysis of browser security configuration options; b) demonstrate the complexity of policy-based configuration of web browsers; c) describe a knowledge-based solution that would enable organizations to implement highly-granular and policy-level secure configurations for their information and operational technology browsing infrastructures at the enterprise scale; and d) argue for necessity of developing a common language and semantics for web browser configurations.