Semantic Path Attention Network Based on Heterogeneous Graphs for Natural Language to SQL Task

The natural language to SQL(NL2SQL)task is an emerging research area that aims to transform a natural language with a given database into an SQL query.The earlier approaches were to process the input into a heterogeneous graph.However,previous models failed to distinguish the types of multi-hop connections of the heterogeneous graph,which tended to ignore crucial semantic path information.To this end,a two-layer attention network is presented to focus on essential neighbor nodes and mine enlightening semantic paths for feature encoding.The weighted edge is introduced for schema linking to connect the nodes with semantic similarity.In the decoding phase,a rule-based pruning strategy is offered to refine the generated SQL queries.From the experimental results,the approach is shown to learn a good encoding representation and decode the representation to generate results with practical meaning.

Improving Archival Records and Service of Traditional Korean Performing Arts in a Semantic Web Environment

Purpose:This research project aims to organize the archival information of traditional Korean performing arts in a semantic web environment.Key requirements,which the archival records manager should consider for publishing and distribution of gugak performing archival information in a semantic web environment,are presented in the perspective of linked data.Design/methodology/approach:This study analyzes the metadata provided by the National Gugak Center’s Gugak Archive,the search and browse menus of Gugak Archive’s website and K-PAAN,the performing arts portal site.Findings:The importance of consistency,continuity,and systematicity—crucial qualities in traditional record management practices—is undiminished in a semantic web environment.However,a semantic web environment also requires new tools such as web identifiers(URIs),data models(RDF),and link information(interlinking).Research limitations:The scope of this study does not include practical implementation strategies for the archival records management system and website services.The suggestions also do not discuss issues related to copyright or policy coordination between related organizations.Practical implications:The findings of this study can assist records managers in converting a traditional performing arts information archive into a semantic web environment-based online archival service and system.This can also be useful for collaboration with record managers who are unfamiliar with relational or triple database system.Originality/value:This study analyzed the metadata of the Gugak Archive and its online services to present practical requirements for managing and disseminating gugak performing arts information in a semantic web environment.In the application of the semantic web services’principles and methods to an Gugak Archive,this study can contribute to the improvement of information organization and services in the field of Korean traditional music.

Semantic Link Network Based Knowledge Graph Representation and Construction

A knowledge graph consists of a set of interconnected typed entities and their attributes,which shows a better performance to organize,manage and understand knowledge.However,because knowledge graphs contain a lot of knowledge triples,it is difficult to directly display to researchers.Semantic Link Network is an attempt,and it can deal with the construction,representation and reasoning of semantics naturally.Based on the Semantic Link Network,this paper explores the representation and construction of knowledge graph,and develops an academic knowledge graph prototype system to realize the representation,construction and visualization of knowledge graph.

Automatic Web Services Composition Based on SLM

Motivated by the problem of simplifying the manual operation of the composition process, we propose an approach to automatically compose available Web services to fulfill user＇s goal based on the assumption that there are a set of alternative Web services with similar functionality and different QoS properties. A formal model （i.e. semantic links matrix, SLM for short ） is proposed to store semantic links values for the Web services with semantic relationship and QoS of Web services. The SLM provides a search place for a backward-search planning algorithm, at the same time; the QoS criteria make a rational and effective decision among a number of similar Web services. The function and some properties of the algorithm are analyzed. The approach can improve the correctness and flexibility for Web services composition and satisfy the local QoS attribute.

Knowledge presentation model for QnA web forums

For an extract description of threads information in question and answer （QnA） web forums, it is proposed to construct a QnA knowledge presentation model in the English language, and then an entire solution for the QnA knowledge system is presented, including data gathering, platform building and applications design. With pre-defined dictionary and grammatical analysis, the model draws semantic information, grammatical information and knowledge confidence into IR methods, in the form of statement sets and term sets with semantic links. Theoretical analysis shows that the statement model can provide an exact presentation for QnA knowledge, breaking through any limits from original QnA patterns and being adaptable to various query demands; the semantic links between terms can assist the statement model, in terms of deducing new from existing knowledge. The model makes use of both information retrieval （IR） and natural language processing （NLP） features, strengthening the knowledge presentation ability. Many knowledge-based applications built upon this model can be improved, providing better performance.

Semantic theories of programs with nested interrupts

In the design of dependable software for embed- ded and real-time operating systems, time analysis is a cru- cial but extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeterminism of interrupt handling behaviors. Thus research into a theory that integrates interrupt behaviors and time analysis seems to be important and challenging. In this paper, we present a pro- gramming language to describe programs with interrupts that is comprised of two essential parts： main program and inter- rupt handling programs. We also explore a timed operational semantics and a denotational semantics to specify the mean- ings of our language. Furthermore, a strategy of deriving de- notational semantics from the timed operational semantics is provided to demonstrate the soundness of our operational se- mantics by showing the consistency between the derived de- notational semantics and the original denotational semantics.