• Title/Summary/Keyword: Valid Time

Search Result 724, Processing Time 0.029 seconds

Ontology Versions Management on the Semantic Web

  • Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.26-31
    • /
    • 2004
  • In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

Scheduling Algorithm for Improving Response-Time within valid time (유효 시간 범위에서의 응답성 향상을 위한 실시간 스케줄링 알고리즘)

  • Park, Do-Hyun;Jang, Min-Woo;Hong, Ji-Man
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06b
    • /
    • pp.389-392
    • /
    • 2010
  • 실시간 임베디드 시스템에서 멀티미디어 시스템 같은 빠른 응답성을 요구하는 시스템이 존재 할 수 있다. 현재 EDF, RM 알고리즘의 경우 각각 마감시간, 수행 주기 시간에 의해서 우선순위가 선정되고 수행된다. 그러나 시스템 상에 실시간 프로세스 외에 다양한 프로세스가 존재할 수 있다. 본 논문에서는 마감 시간과 프로세스의 기본 우선순위를 고려하여 새로운 우선순위를 이용하며, 전체 프로세스들이 마감 시간내에 스케줄링 가능하고 문맥교환에 의한 오버헤드에 의해 마감시간을 넘어가지 않을 경우 각 프로세스들에게 타임 슬라이스를 할당하여 수행할 수 있도록 하여 기존 알고리즘들 보다 응답성을 향상시키는 기법을 제시한다.

  • PDF

Small-Signal Model for Controlled On-Time Boost Power Factor Correction Circuit (연속-불연속 경계모드에서 동작하는 역률보상회로를 위한 소신호 모델)

  • Kang, Yong-Han;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 1998.11a
    • /
    • pp.141-143
    • /
    • 1998
  • A new small-signal model for the controlled on-time boost Power factor correction (PFC) circuit is Presented. The proposed small-signal model is valid up to high frequencies ever 1kHz. IF to remove the low-frequency ripple from the output a 120Hz notch filter is used the proposed model can be used for the control design of the PFC circuit to improve the dynamics of the output voltage. The accuracy of the model is confirmed by comparing the experimental results with the simulational result.

  • PDF

Rotational State Distribution of CO₂ after a Collision with H Atom

  • 김유항;김성훈
    • Bulletin of the Korean Chemical Society
    • /
    • v.16 no.7
    • /
    • pp.644-648
    • /
    • 1995
  • Based on the collisional time correlation function (CTCF) formalism, Kim and Micha derived a simple expression which gives nascent rotational state distribution of molecules after collision with fast atoms.32 The expression is valid when the collision time is short and the collision is impulsive in nature. This expression has been applied to analyze the experimentally measured, state resolved rotational distribution of CO2 in various types of vibrational levels, i.e., (0001), (0111), (0002), and (1000/0200). The theoretical distributions obtained from this CTCF based expression can represent the experimentally measured rotational distributions remarkably well, and have been found to be much superior to those obtained from other simple theories such as Boltzmann distribution, prior distribution, breathing ellipsoid model, and phase space statistical calculation.

A Study on Advanced Location Awareness Component using Smart Phone GPS in BIS

  • Lee, Hwajeong;Koh, Jingwang;Lim, Gyugeun;Lee, Seookcheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.41-47
    • /
    • 2019
  • A BIS(Bus Information System) collects, processes and analyzes information such as real-time location and operation status during bus operation. And It is a system that provides valid information to citizens, drivers, traffic centers and bus companies. Transport information system sent by an each bus is collected through GPS(Global Positioning System), DSRC(Dedicated Short Range Communications), Beacon and passed to transport information center. BIS data by collected is handled and analyzed. Next, it is transmitted to citizen, drivers and bus companies in real time. The result of 5 times simulation satisfied the test criteria(error range ${\pm}10m$) with an average error range of 3.306m, and the reliability is increased. In this paper, we propose a improved location transfer component that can provide users to quicker and more accurate location information than existing BIS using GPS of smart phone. It can be seen that reliability is improved by securing improved bus position data.

Implementing Onetime Password based Access Control System for Secure Sharing Service

  • Kang, Namhi
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.1-11
    • /
    • 2021
  • Development of ICT technologies leads exponential growth of various sharing economy over the last couple of years. The intuitive advantage of the sharing economy is efficient utilization of idle goods and services, but there are safety and security concerns. In this paper, we propose a onetime password based access control system to support secure accommodation sharing service and show the implementation results. To provide a secure service to both the provider and the user, the proposed system issues a onetime access password that is valid only during the sharing period reserved by the user, thereafter access returns to the accommodation owner. Especially, our system provides secure user access by merging the two elements of speaker recognition using voice and a one-time password to open and close the door lock. In this paper, we propose a secure system for accommodation sharing services as a use-case, but the proposed system can be applicable to various sharing services utilizing security-sensitive facilities.

Adaptive control of gas metal arc welding process

  • Song, Jae-Bok;Hardt, David-E.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.191-196
    • /
    • 1993
  • Since the welding process is complex and highly nonlinear, it is very difficult to accurately model the process for real-time control. In this paper, a discrete-time transfer function matrix model for gas metal arc welding process is proposed. Although this linearized model is valid only around the operating point of interest, the adaptation mechanism employed in the control system render this model useful over a wide operating range. A multivariable one-step-ahead adaptive control strategy combined with a recursive least-squares method for on-line parameter estimation is implemented in order to achieve the desired weld bead geometries. Command following and disturbance rejection properties of the adaptive control system for both SISO and MIMO cases are investigated by simulation and experiment.

  • PDF

A Study of Real-time SVC Bitstream Extraction for QoS guaranteed Streaming (QoS 기반 스트리밍 서비스를 위한 실시간 SVC 비트스트림 추출기에 대한 연구)

  • Kim, Duck-Yeon;Bae, Tae-Meon;Kim, Young-Suk;Ro, Yong-Man;Choi, Hae-Chul;Kim, Jae-Gon
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.513-516
    • /
    • 2005
  • SVC(Scalable Video coding) is the standardization of MPEG that aims to support multi spatial, temporal, and quality layers. We can support the video service guaranteeing the QoS in varied network circumstance by using SVC bitstream. In this paper, we propose the real-time SVC bitstream extractor that is able to extract the bitstream with varied frame rate and SNR quality in real-time. To do, extraction processing needs to be performed by GOP unit. As well , essential bitstream information for real-time extraction is aquired before doing extraction process. The proposed method is implemented by using JSVM 2.0. Experimental results show that the proposed method is valid.

  • PDF

A Simple Syntax for Complex Semantics

  • Lee, Kiyong
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2002.02a
    • /
    • pp.2-27
    • /
    • 2002
  • As pact of a long-ranged project that aims at establishing database-theoretic semantics as a model of computational semantics, this presentation focuses on the development of a syntactic component for processing strings of words or sentences to construct semantic data structures. For design arid modeling purposes, the present treatment will be restricted to the analysis of some problematic constructions of Korean involving semi-free word order, conjunction arid temporal anchoring, and adnominal modification and antecedent binding. The present work heavily relies on Hausser's (1999, 2000) SLIM theory for language that is based on surface compositionality, time-linearity arid two other conditions on natural language processing. Time-linear syntax for natural language has been shown to be conceptually simple and computationally efficient. The associated semantics is complex, however, because it must deal with situated language involving interactive multi-agents. Nevertheless, by processing input word strings in a time-linear mode, the syntax cart incrementally construct the necessary semantic structures for relevant queries and valid inferences. The fragment of Korean syntax will be implemented in Malaga, a C-type implementation language that was enriched for both programming and debugging purposes arid that was particluarly made suitable for implementing in Left-Associative Grammar. This presentation will show how the system of syntactic rules with constraining subrules processes Korean sentences in a step-by-step time-linear manner to incrementally construct semantic data structures that mainly specify relations with their argument, temporal, and binding structures.

  • PDF

A Look-Ahead Routing Procedure in an FMS

  • Jang, Jaejin;Suh, Jeong-Dae
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.2
    • /
    • pp.79-97
    • /
    • 1997
  • Many dispatching rules have been developed for the on-line control of product flow in a job shop. The introduction of a flexible manufacturing system (FMS) has added a new requirement to classical job shop control problem : the selection of machines by parts of different types. An FMS can keep a great deal of information on the status of the system, such as information on what is scheduled in the near future, with great accuracy. For example, the knowledge of the time when the next part will arrive at each machine can be neneficial for the routing. This paper tests the effects of the use of this knowledge for part routing on the parts flow time (sum of the time for waiting and service) under a simple routing procedure- a look-ahead routing procedure. A test under many operating conditions shows that the reduction of part flow time from the cases without using this information is between 1% and 11%, which justifies more study on this routing procedure at real production sites when machine capacity is a critical issue. The test results of this paper are also valid for other highly automated systems such as the semi-conductor fabrication plants for routing when the arrivals of parts in the near future are known.

  • PDF