• Title/Summary/Keyword: Task Ontology

Search Result 59, Processing Time 0.027 seconds

Representation and Reasoning of User Context Using Fuzzy OWL (Fuzzy OWL을 이용한 사용자 Context의 표현 및 추론)

  • Sohn, Jong-Soo; Chung, In-Jeong
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.1
    • /
    • pp.35-45
    • /
    • 2008
  • In order to constructan ubiquitous computing environment, it is necessary to develop a technology that can recognize users and circumstances. In this regard, the question of recognizing and expressing user Context regardless of computer and language types has emerged as an important task under the heterogeneous distributed processing system. As a means to solve this task of representing user Context in the ubiquitous environment, this paper proposes to describe user Context as the most similar form of human thinking by using semantic web and fuzzy concept independentof language and computer types. Because the conventional method of representing Context using an usual collection has some limitations in expressing the environment of the real world, this paper has chosen to use Fuzzy OWL language, a fusion of fuzzy concept and standard web ontology language OWL. Accordingly, this paper suggests the following method. First we represent user contacted environmental information with a numerical value and states, and describe it with OWL. After that we transform the converted OWL Context into Fuzzy OWL. As a last step, we prove whether the automatic circumstances are possible in this procedure when we use fuzzy inference engine FiRE. With use the suggested method in this paper, we can describe Context which can be used in the ubiquitous computing environment. This method is more effective in expressing degree and status of the Context due to using fuzzy concept. Moreover, on the basis of the stated Context we can also infer the user contacted status of the environment. It is also possible to enable this system to function automatically in compliance with the inferred state.

  • PDF

A Study on the Development of the User Behavior Simulation Technology Using a Perceived Action Possibilities (내제된 행위 유발 가능성을 활용하는 사용자 행동 시뮬레이션 기술의 개발에 관한 연구)

  • Lee, Yun-Gil;Park, Chang-Hoon;Im, Dong-Hyuk
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.11
    • /
    • pp.1335-1344
    • /
    • 2014
  • In architectural design, the user is one of the most important factors for the design task as well as the standard for evaluating the value of the built environment after its construction. Recently, accidents, such as fires and breakdowns, in huge and complicated buildings have increased the importance of user behavior simulation. The Korean government has tried to establish a regulation for the prevention of accidents in the built environment. This is regarded as a significant step forward for providing a safer and more appropriate environment for users. However, the existing technologies related to analyzing user behavior only simulate simplified situations. Such simulations are not enough to evaluate accurately the designed alternatives because buildings and spaces contain more complicated information than what we have conventionally considered. Thus, we propose that the advanced agent can interact with the architectural context. It can understand not only the physical situation but also how the users affect this situation. In order to realize this, we adopted the concept of affordances as the perceived action possibilities for the simulation environment.

Middleware for Context-Aware Ubiquitous Computing

  • Hung Q.;Sungyoung
    • Korea Information Processing Society Review
    • /
    • v.11 no.6
    • /
    • pp.56-75
    • /
    • 2004
  • In this article we address some system characteristics and challenging issues in developing Context-aware Middleware for Ubiquitous Computing. The functionalities of a Context-aware Middleware includes gathering context data from hardware/software sensors, reasoning and inferring high-level context data, and disseminating/delivering appropriate context data to interested applications/services. The Middleware should facilitate the query, aggregation, and discovery for the contexts, as well as facilities to specify their privacy policy. Following a formal context model using ontology would enable syntactic and semantic interoperability, and knowledge sharing between different domains. Moddleware should also provide different kinds of context classification mechanical as pluggable modules, including rules written in different types of logic (first order logic, description logic, temporal/spatial logic, fuzzy logic, etc.) as well as machine-learning mechanical (supervised and unsupervised classifiers). Different mechanisms have different power, expressiveness and decidability properties, and system developers can choose the appropriate mechanism that best meets the reasoning requirements of each context. And finally, to promote the context-trigger actions in application level, it is important to provide a uniform and platform-independent interface for applications to express their need for different context data without knowing how that data is acquired. The action could involve adapting to the new environment, notifying the user, communicating with another device to exchange information, or performing any other task.

  • PDF

Improving Web Service Recommendation using Clustering with K-NN and SVD Algorithms

  • Weerasinghe, Amith M.;Rupasingha, Rupasingha A.H.M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1708-1727
    • /
    • 2021
  • In the advent of the twenty-first century, human beings began to closely interact with technology. Today, technology is developing, and as a result, the world wide web (www) has a very important place on the Internet and the significant task is fulfilled by Web services. A lot of Web services are available on the Internet and, therefore, it is difficult to find matching Web services among the available Web services. The recommendation systems can help in fixing this problem. In this paper, our observation was based on the recommended method such as the collaborative filtering (CF) technique which faces some failure from the data sparsity and the cold-start problems. To overcome these problems, we first applied an ontology-based clustering and then the k-nearest neighbor (KNN) algorithm for each separate cluster group that effectively increased the data density using the past user interests. Then, user ratings were predicted based on the model-based approach, such as singular value decomposition (SVD) and the predictions used for the recommendation. The evaluation results showed that our proposed approach has a less prediction error rate with high accuracy after analyzing the existing recommendation methods.

Development of Semantic Risk Breakdown Structure to Support Risk Identification for Bridge Projects

  • Isah, Muritala Adebayo;Jeon, Byung-Ju;Yang, Liu;Kim, Byung-Soo
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.245-252
    • /
    • 2022
  • Risk identification for bridge projects is a knowledge-based and labor-intensive task involving several procedures and stakeholders. Presently, risk information of bridge projects is unstructured and stored in different sources and formats, hindering knowledge sharing, reuse, and automation of the risk identification process. Consequently, there is a need to develop structured and formalized risk information for bridge projects to aid effective risk identification and automation of the risk management processes to ensure project success. This study proposes a semantic risk breakdown structure (SRBS) to support risk identification for bridge projects. SRBS is a searchable hierarchical risk breakdown structure (RBS) developed with python programming language based on a semantic modeling approach. The proposed SRBS for risk identification of bridge projects consists of a 4-level tree structure with 11 categories of risks and 116 potential risks associated with bridge projects. The contributions of this paper are threefold. Firstly, this study fills the gap in knowledge by presenting a formalized risk breakdown structure that could enhance the risk identification of bridge projects. Secondly, the proposed SRBS can assist in the creation of a risk database to support the automation of the risk identification process for bridge projects to reduce manual efforts. Lastly, the proposed SRBS can be used as a risk ontology that could aid the development of an artificial intelligence-based integrated risk management system for construction projects.

  • PDF

Knowledge graph-based knowledge map for efficient expression and inference of associated knowledge (연관지식의 효율적인 표현 및 추론이 가능한 지식그래프 기반 지식지도)

  • Yoo, Keedong
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.4
    • /
    • pp.49-71
    • /
    • 2021
  • Users who intend to utilize knowledge to actively solve given problems proceed their jobs with cross- and sequential exploration of associated knowledge related each other in terms of certain criteria, such as content relevance. A knowledge map is the diagram or taxonomy overviewing status of currently managed knowledge in a knowledge-base, and supports users' knowledge exploration based on certain relationships between knowledge. A knowledge map, therefore, must be expressed in a networked form by linking related knowledge based on certain types of relationships, and should be implemented by deploying proper technologies or tools specialized in defining and inferring them. To meet this end, this study suggests a methodology for developing the knowledge graph-based knowledge map using the Graph DB known to exhibit proper functionality in expressing and inferring relationships between entities and their relationships stored in a knowledge-base. Procedures of the proposed methodology are modeling graph data, creating nodes, properties, relationships, and composing knowledge networks by combining identified links between knowledge. Among various Graph DBs, the Neo4j is used in this study for its high credibility and applicability through wide and various application cases. To examine the validity of the proposed methodology, a knowledge graph-based knowledge map is implemented deploying the Graph DB, and a performance comparison test is performed, by applying previous research's data to check whether this study's knowledge map can yield the same level of performance as the previous one did. Previous research's case is concerned with building a process-based knowledge map using the ontology technology, which identifies links between related knowledge based on the sequences of tasks producing or being activated by knowledge. In other words, since a task not only is activated by knowledge as an input but also produces knowledge as an output, input and output knowledge are linked as a flow by the task. Also since a business process is composed of affiliated tasks to fulfill the purpose of the process, the knowledge networks within a business process can be concluded by the sequences of the tasks composing the process. Therefore, using the Neo4j, considered process, task, and knowledge as well as the relationships among them are defined as nodes and relationships so that knowledge links can be identified based on the sequences of tasks. The resultant knowledge network by aggregating identified knowledge links is the knowledge map equipping functionality as a knowledge graph, and therefore its performance needs to be tested whether it meets the level of previous research's validation results. The performance test examines two aspects, the correctness of knowledge links and the possibility of inferring new types of knowledge: the former is examined using 7 questions, and the latter is checked by extracting two new-typed knowledge. As a result, the knowledge map constructed through the proposed methodology has showed the same level of performance as the previous one, and processed knowledge definition as well as knowledge relationship inference in a more efficient manner. Furthermore, comparing to the previous research's ontology-based approach, this study's Graph DB-based approach has also showed more beneficial functionality in intensively managing only the knowledge of interest, dynamically defining knowledge and relationships by reflecting various meanings from situations to purposes, agilely inferring knowledge and relationships through Cypher-based query, and easily creating a new relationship by aggregating existing ones, etc. This study's artifacts can be applied to implement the user-friendly function of knowledge exploration reflecting user's cognitive process toward associated knowledge, and can further underpin the development of an intelligent knowledge-base expanding autonomously through the discovery of new knowledge and their relationships by inference. This study, moreover than these, has an instant effect on implementing the networked knowledge map essential to satisfying contemporary users eagerly excavating the way to find proper knowledge to use.

Large Scale Incremental Reasoning using SWRL Rules in a Distributed Framework (분산 처리 환경에서 SWRL 규칙을 이용한 대용량 점증적 추론 방법)

  • Lee, Wan-Gon;Bang, Sung-Hyuk;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.44 no.4
    • /
    • pp.383-391
    • /
    • 2017
  • As we enter a new era of Big Data, the amount of semantic data has rapidly increased. In order to derive meaningful information from this large semantic data, studies that utilize the SWRL(Semantic Web Rule Language) are being actively conducted. SWRL rules are based on data extracted from a user's empirical knowledge. However, conventional reasoning systems developed on single machines cannot process large scale data. Similarly, multi-node based reasoning systems have performance degradation problems due to network shuffling. Therefore, this paper overcomes the limitations of existing systems and proposes more efficient distributed inference methods. It also introduces data partitioning strategies to minimize network shuffling. In addition, it describes a method for optimizing the incremental reasoning process through data selection and determining the rule order. In order to evaluate the proposed methods, the experiments were conducted using WiseKB consisting of 200 million triples with 83 user defined rules and the overall reasoning task was completed in 32.7 minutes. Also, the experiment results using LUBM bench datasets showed that our approach could perform reasoning twice as fast as MapReduce based reasoning systems.

A Context-based Multi-Agent System for Enacting Virtual Enterprises (가상기업 지원을 위한 컨텍스트 기반 멀티에이전트 시스템)

  • Lee, Kyung-Huy;Kim, Duk-Hyun
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.3
    • /
    • pp.1-17
    • /
    • 2007
  • A virtual enterprise (VE) can be mapped into a multi-agent system (MAS) that consists of various agents with specific role(s), communicating with each other to accomplish common goal(s). However, a MAS for enacting VE requires more advanced mechanism such as context that can guarantee autonomy and dynamism of VE members considering heterogeneity and complex structure of them. This paper is to suggest a context-based MAS as a platform for constructing and managing virtual enterprises. In the Context-based MAS a VE is a collection of Actor, Interaction (among Actors), Actor Context, and Interaction Context. It can raise the speed and correctness of decision-making and operation of VE enactment using context, i.e., information about the situation (e.g., goal, role, task, time, location, media) of Actors and Interactions, as well as simple data of their properties. The Context-based MAS for VE we proposed('VECoM') may consists of Context Ontology, Context Model, Context Analyzer, and Context Reasoner. The suggested approach and system is validated through an example where a VE tries to find a partner that could join co-development of new technology.

  • PDF

A Semantic-Based Mashup Development Tool Supporting Various Open API Types (다양한 Open API 타입들을 지원하는 시맨틱 기반 매쉬업 개발 툴)

  • Lee, Yong-Ju
    • Journal of Internet Computing and Services
    • /
    • v.13 no.3
    • /
    • pp.115-126
    • /
    • 2012
  • Mashups have become very popular over the last few years, and their use also varies for IT convergency services. In spite of their popularity, there are several challenging issues when combining Open APIs into mashups, First, since portal sites may have a large number of APIs available for mashups, manually searching and finding compatible APIs can be a tedious and time-consuming task. Second, none of the existing portal sites provides a way to leverage semantic techniques that have been developed to assist users in locating and integrating APIs like those seen in traditional SOAP-based web services. Third, although suitable APIs have been discovered, the integration of these APIs is required for in-depth programming knowledge. To solve these issues, we first show that existing techniques and algorithms used for finding and matching SOAP-based web services can be reused, with only minor changes. Next, we show how the characteristics of APIs can be syntactically defined and semantically described, and how to use the syntactic and semantic descriptions to aid the easy discovery and composition of Open APIs. Finally, we propose a goal-directed interactive approach for the dynamic composition of APIs, where the final mashup is gradually generated by a forward chaining of APIs. At each step, a new API is added to the composition.