• Proceedings of the CALSEC Conference
• /
• 2003.09a
• /
• pp.191-196
• /
• 2003

The Semantic web service is able to intelligently discover, execute, composite and monitor the Web Service. It constructs the ontology on Web Service and describes the Semantic Markup in the machine-readable form. The currently developing technologies of the Semantic Web Service discovery are DAML-S matchmaker in Carnegie Mellon University, Process Handbook in MIT and etc. In this paper, we propose the ontology language based on Topic Maps that supports the benefits and solves the problems of the Semantic Web Service discovery technologies .

• Journal of Korea Multimedia Society
• /
• v.22 no.9
• /
• pp.1000-1010
• /
• 2019

Image semantic segmentation and dehazing are key tasks in the computer vision. In recent years, researches in both tasks have achieved substantial improvements in performance with the development of Convolutional Neural Network (CNN). However, most of the previous works for semantic segmentation assume the images are captured in clear weather and show degraded performance under hazy images with low contrast and faded color. Meanwhile, dehazing aims to recover clear image given observed hazy image, which is an ill-posed problem and can be alleviated with additional information about the image. In this work, we propose a deep multi-task network for simultaneous semantic segmentation and dehazing. The proposed network takes single haze image as input and predicts dense semantic segmentation map and clear image. The visual information getting refined during the dehazing process can help the recognition task of semantic segmentation. On the other hand, semantic features obtained during the semantic segmentation process can provide cues for color priors for objects, which can help dehazing process. Experimental results demonstrate the effectiveness of the proposed multi-task approach, showing improved performance compared to the separate networks.

• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.73-82
• /
• 2015

Understanding how the topic evolves is an important and challenging task. A topic usually consists of multiple related events, and the accurate identification of event evolution relationship plays an important role in topic evolution analysis. Existing research has used the traditional vector space model to represent the event, which cannot be used to accurately compute the semantic similarity between events. This has led to poor performance in identifying event evolution relationship. This paper suggests constructing a semantic aspect-based vector space model to represent the event: First, use hierarchical Dirichlet process to mine the semantic aspects. Then, construct a semantic aspect-based vector space model according to these aspects. Finally, represent each event as a point and measure the semantic relatedness between events in the space. According to our evaluation experiments, the performance of our proposed technique is promising and significantly outperforms the baseline methods.

• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.389-404
• /
• 2013

Geospatial information, which is one of social overhead capital, is predicted as a core growing industry for the future. The production of geospatial information requires a huge budget, so it is very important objective of the policy for geospatial information to prevent the duplication of geospatial projects. In this paper, we proposed a semantic search system which extracts possible duplication of geospatial projects by using ontology for geospatial project administration. In order to achieve our goal, we suggested how to construct and utilize geospatial project ontology, and designed the architecture and process of the semantic search. Moreover, we showed how the suggested semantic search works with a duplicated projects search scenario. The suggested system enables a nonprofessional can easily search for duplicated projects, therefore we expect that our research contributes to effective and efficient duplication review process for geospatial projects.

• Asia pacific journal of information systems
• /
• v.18 no.1
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.86-88
• /
• 2005

An autonomous semantic-map building method is proposed, with the robot localized in the semantic-map. Our semantic-map is organized by objects represented as SIFT features and vision-based relative localization is employed as a process model to implement extended Kalman filters. Thus, we expect that robust SLAM performance can be obtained even under poor conditions in which localization cannot be achieved by classical odometry-based SLAM

• International Journal of Contents
• /
• v.10 no.4
• /
• pp.30-37
• /
• 2014

The current study was conducted to examine the temporal and spatial activation sequences related to morphosyntactic, semantic and orthographic-lexical sentences, focusing on the morphological-orthographic and lexical-semantic deviation processes in Korean language processing. The Event-related Potentials (ERPs) of 15 healthy students were adopted to explore the processing of head-final critical words in a sentential plausibility task. Specifically, it was examined whether the ERP-pattern to orthographic-lexical violation might show linear precedence over other processes, or the presence of additivity across combined processing components. For the morphosyntactic violation, fronto-central LAN followed by P600 was found, while semantic violation elicited N400, as expected. Activation of P600 was distributed in the left frontal and central sites, while N400 appeared even in frontal sites other than the centro-parietal areas. Most importantly, the orthographic-lexical violation process revealed by earlier N2 with fronto-central activity was shown to be complexes of morphological and semantic functions from the same critical word. The present study suggests that there is a linear precedence over the morphological deviation and its lexical semantic processing based on the immediate possibility of lexical information, followed by sentential semantics. Finally, late syntactic integration processes were completed, showing different topographic activation in order of importance of ongoing sentential information.

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.318-326
• /
• 2004

The ebXML (Electronic Business using eXtensible Markup Language) Specification Schema is to provide nominal set of specification elements necessary to specify a collaboration between business partners based on XML. As a part of ebXML Specification Schema, BPSS (Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPSS is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification is insufficient to specify formal semantic constraints of modeling elements completely. In this study, we propose a classification schema for the BPSS semantic constraints and describe how to represent those semantic constraints formally using OCL (Object Constraint Language). As a way to verify a Business Process Specification (BPS) with the formal semantic constraint modeling, we suggest a rule-based approach to represent the formal constraints and to use the rule-based constraints specification to verify BPSs in a CLIPS prototype implementation.

• Journal of Information Management
• /
• v.38 no.1
• /
• pp.59-73
• /
• 2007

To construct machining databases, which are reusable and sharable their meanings, semantic metadata management is required. In this study a semantic data modeling process for machining data is developed. It combines conventional data models with ISO/IEC 11179 standard, metadata registry(MDR). Names of object classes and properties constituting data element names are identified using conventional data model while data elements are named and specified based on ISO/IEC 11179 in order to obtain semantic interoperability of data. An experimental application to electrical discharge machining(EDM) is performed to explain the process.

• Korean Journal of Cognitive Science
• /
• v.18 no.4
• /
• pp.371-398
• /
• 2007

This study examined effects of word frequency and semantic transparency on decomposition processes of compound nouns by semantic priming task and repetition priming task. In Experiment 1, it was investigated that decomposition process depended on word frequency of compound noun. Semantic priming effects were found In the compound noun's associate rendition consistently, and repetition priming effects were found in the whole rendition as well as in the part condition irrespective of word frequency and SOA. These results implied that compound noun was processed through decomposition process path and direct access path. In Experiment 2, Effects of semantic transparency on decomposition processes of compound nouns were examined. Semantic priming effects were found when compound nouns' associates were presented as primes irrespective of semantic transparency and SOA, and results were the same as experiment 1b in repetition priming task. Results of experiment 1 and 2 implies that compound nouns are interpreted by interactive activation processes of attributes activated by decomposition path and direct access path.