• 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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.141-149
• /
• 2008

Most functional programming languages allows programmers to write ambiguous rules, under the strategy that pattern-matching will be performed in a direction of 'from top to bottom' way. While providing programmers with convenience and intuitive understanding of defining default rules, such ambiguous rules may make the semantics of functional languages unclear. More specifically, it may fail to apply the equational reasoning, one of most significant advantage of functional programming, and may cause to obscure finding a formal way of translating functional languages into the ${\lambda}$-calculus; as a result, we only get an ad hoc translation. In this paper, we associate with separability of term rewriting systems, holding purely-declarative property, pattern-matching semantics of lazy functional languages. Separability can serve a formalism for translating lazy functional languages into the ${\lambda}$-calculus.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.5
• /
• pp.157-164
• /
• 2023

Specifying the semantic structure for functional interfaces and lambda expressions, which are the latest features of Java, can be referenced when designing similar functions in the future, and is also required in the process of standardizing or implementing an optimized translator. In this study, action equation 3.0 is newly proposed to express the static and dynamic semantic structure of functional interfaces and lambda expressions by modifying and upgrading the existing expressions to express the semantic structures of java functional interfaces and lambda expressions. Measure the execution time of java programs by implementing the semantic structure specified in action equation 3.0 in java, and prove that action equation 3.0 is a real semantic structure that can be implemented through simulation. The superiority of this action equation 3.0 is to be confirmed by comparing the action equation 3.0 specified in the four areas of readability, modularity, extensibility and flexibility with the existing representative semantic expression methods.

• 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 KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.877-885
• /
• 2000

Static slice means a set of parts of a program that potentially affect the values computed at a slicing criterion considering all the possible input values. In this paper, we have formally defined static slice of a first-order functional language based on operational semantics. And, we have presented a sound method to analyze static slice using abstract interpretation.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.06a
• /
• pp.142-152
• /
• 2002

There have been some notes on the functional unity of rules or conspiracy in Linguistics. In this paper, I show that so-called 'elsewhere condition', first mentioned in phonology, is observed not only in phonology, but also in morphology, syntax, semantics, and pragmatics. And I argue that it is a kind of functional unity of rules or conspiracy in cross-component of linguistic theories. How to handle this in the macro-scopic view of linguist ice is another major issue in further research.

• Language and Information
• /
• v.19 no.2
• /
• pp.1-18
• /
• 2015

This paper retraces the development of Database Semantics (DBS) from its beginnings in Montague grammar. It describes the changes over the course of four decades and explains why they were seen to be necessary. DBS was designed to answer the central theoretical question for building a talking robot: How does the mechanism of natural language communication work? For doing what is requested and reporting what is going on, a talking robot requires not only language but also non-language cognition. The contents of non-language cognition are re-used as the meanings of the language surfaces. Robot-externally, DBS handles the language-based transfer of content by using nothing but modality-dependent unanalyzed external surfaces such as sound shapes or dots on paper, produced in the speak mode and recognized n the hear mode. Robot-internally, DBS reconstructs cognition by integrating linguistic notions like functor-argument and coordination, philosophical notions like concept-, pointer-, and baptism-based reference, and notions of computer science like input-output, interface, data structure, algorithm, database schema, and functional flow.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.53-63
• /
• 2011

Many techniques have been proposed to store and query XML data efficiently. One way achieving this goal is using relational database by transforming XML data into relational format. It is important to transform schema to preserve the content, the structure and the constraints of the semantics information of the XML document. Especially, key constraints are an important part of database theory. Therefore, the proposal technique has considered the semantics of XML as expressed by primary keys and foreign keys. And, the proposal technique can preserve not only XML data constraints but also the content and the structure and the semantics of XML data thru transformation process. Transforming information is the content and the structure of the document(the parent-child relationship), the functional dependencies, semantics of the document as captured by XML key and keyref constraints. Because of XML schema transformation ensures that preserving semantic constraints, the advantages of these transformation techniques do not need to use the stored procedure or trigger which these data ensures data integrity in the relational database. In this paper, there is not chosen the ID/IDREF key which supported in DTD, the inheritance relationship, the implicit referential integrity.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.1-12
• /
• 1998

In this paper, a design and implementation of VHDL-to-C mapping in the VHDL compiler back-end is described. The analyzed data in an intermediate format(IF), produced by the compiler front-end, is transformed into a C-code model of VHDL semantics by the VHDL-to-C mapper. The C-code model for VHDL semantics is based on a functional template, including declaration, elaboration, initialization and execution parts. The mapping is carried out by utilizing C mapping templates of 129 types classified by mapping units and functional semantics, and iterative algorithms, which are combined with terminal information, to produce C codes. In order to generate the C program, the C codes are output to the functional template either directly or by combining the higher mapping result with intermediate mapping codes in the data queue. In experiments, it is shown that the VHDL-to-C mapper could completely deal with the VHDL analyzed programs from the compiler front-end, which deal with about 96% of major VHDL syntactic programs in the Validation Suite. As for the performance, it is found that the code size of VHDL-to-C is less than that of interpreter and worse than direct code compiler of which generated code is increased more rapidly with the size of VHDL design, and that the VHDL-to-C timing overhead is needed to be improved by the optimized implementation of mapping mechanism.

• 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.