• Annual Conference on Human and Language Technology
• /
• 2007.10a
• /
• pp.107-113
• /
• 2007

본 연구는 시맨틱 데이터 정합성 검사와 RDF 트리플 생성 기능을 가진 URI 서버 내 DB 스키마의 자동 생성 방안을 기술한다. URI 서버는 시맨틱 웹 기술 기반 프레임워크 구성에 필요한 핵심 엔진으로서 인스턴스 생성 관리기, 검색 엔진, 추론 엔진 등과의 상호 작용을 통해 시맨틱 데이터를 서비스한다. 도메인이 바뀌거나 서비스가 변경되는 경우 DB 스키마를 전문가에 의해 수작업으로 생성함으로써 서비스 환경 변화에 즉각 대응하지 못하는 문제점을 가진 기존 URI 서버를, 적재되는 온톨로지에 따라 DB 스키마를 동적으로 자동 생성하는 방식으로 변경함으로써 다양한 응용 분야와 도메인에의 높은 이식성(Portability)을 보장할 수 있도록 한다. 기반정보 온톨로지, 응용 온톨로지, 개인화 온톨로지 등 3개 온톨로지 스키마와 11만 건 이상의 Citeseer Open Access Metadata로부터 추출된 인스턴스를 대상으로 한 실험을 통해 URI 서버 내 DB 스키마 자동 생성 가능성을 실증하였다.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.11-26
• /
• 2013

In the wireless Internet, it is so restrictive to use the IPSec. The MIPv4 IPSec's path cannot include wireless links. That is, the IPSec of the wireless Internet cannot protect an entire path of Host-to-Host connection. Also wireless circumstance keeps a path static during the shorter time, nevertheless, the IKE for IPSec SA agreement requires relatively long delay. The certificate management of IPSec PKI security needs too much burden. This means that IPSec of the wireless Internet is so disadvantageous. Our paper is to construct the Mobile IPSec proper to the wireless Internet which provides the host-to-host transport mode service to protect even wireless links as applying excellent WP-IBE scheme. For this, Mobile IPSec requires a dynamic routing over a path with wireless links. FA Forwarding is a routing method for FA to extend the path to a newly formed wireless link. The FA IPSec SA for FA Forwarding is updated to comply the dynamically extended path using Source Routing based Bind Update. To improve the performance of IPSec, we apply efficient and strong future Identity based Weil Pairing Bilinear Elliptic Curve Cryptography called as WP-IBE scheme. Our paper proposes the modified protocols to apply 6 security-related algorithms of WP-IBE into the Mobile IPSec. Particularly we focus on the protocols to be applied to construct ESP Datagram.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.859-876
• /
• 2004

This paper presents optimal configurations of multidimensional path indexes (MPIs) for the efficient execution of object-oriented queries in object databases. MPI uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested attribute and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. In this paper, we have analyzed the MPIs in the framework of complex queries, containing conjunctions of nested predicates, each one involving a path expression having target classes and domain classes substitution. First of all, we have considered MPI operations caused by updating of object databases, and the use of the MPI in the case of a query containing a single nested predicate. And then, we have considered the use of the MPIs in the framework of more general queries containing nested predicates over both overlapping and non-overlapping paths. The former are paths having common subpaths, while the latter have no common subpaths.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.6 s.109
• /
• pp.587-596
• /
• 2006

Recently a new spectrum ruling has been proposed for UWB(Ultra-Wideband) communication applications. The new proposal is expected to reduce the usable UWB spectrum significantly and may cause to weaken the unique advantages of the UWB pulses such as high resolution synchronizations and robustness to the multipath effects. In this paper, we investigate the performance degradation caused by the reduced UWB spectrum. As a means to overcome the performance degradation, a modified discrete linear frequency modulation technique is proposed. We show that, when multipath components are present in the received signal, the proposed method exhibits superior performances in terms of pulse detection efficiency and range resolutions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.4
• /
• pp.132-137
• /
• 2007

A point-wise car-like robot moving in the plane changes its direction with a constraint on turning curvature. In this paper, we consider the problem of computing a shortest path of bounded curvature between a prescribed initial configuration (position and orientation) and a polygonal goal, and propose a new geometric proof showing that the shortest path is either of type CC or CS (or their substring), where C specifies a non-degenerate circular arc and S specifies a non-degenerate straight line segment. Based on the geometric property of the shortest path, the shortest path from a configuration to a polygonal goal can be computed in linear time.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1319-1329
• /
• 2012

AGVs are more and more utilized nowadays and magnetic guided AGVs are most widely used because their system has low cost and high speed. But this type of AGVs requires high infrastructure building cost and has poor flexibility of navigation path layout changing. Thus it is hard to applying this type of AGVs to a small quantity batch production system or a cooperative production system with many AGVs. In this paper, we propose a vision based guideline interpretation technique that uses the cheap, easily installable and changeable color tapes (or paint) as a guideline. So a vision-based AGV with color tapes is effectively applicable to the production systems. For easy setting and changing of AGV navigation path, we suggest an automatic method for interpreting a complex guideline layout including multi-branches and joins of branches. We also suggest a trace direction decision method for stable navigation of AGVs. Through several real-time navigation tests with an industrial AGV installed with the suggested technique, we confirmed that the technique is practically and stably applicable to real industrial field.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.6
• /
• pp.1271-1280
• /
• 2017

The android packer service using runtime execution compression technology switches to the original application using DexClassLoader. However the API interface of the DexClassLoader receives the path of the loaded DEX(Dalvik EXcutable) and the path of the compiled file. So there is a problem that the original file is exposed to the file system. Therefore, it is not safe to use the API for the packer service. In this paper, we solve this problem by changing the compile and load flow of the DexClassLoader API. Due to this changed execution flow, the complied file can be encrypted and stored in the file system or only in the memory and it can be decrypted or substituted at the time of subsequent loading to enable the original application conversion. we expected that the stability of the packer will increase beacause the proposed method does not expose the original file to the file system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.780-787
• /
• 2003

Adaptive modulation is the method to increase the throughput of the mobile system using the power margin of the system design. In this paper, we propose the method to change adaptive modulation parameters for the stable system operation by monitoring the mobility of the mobile station. The proposed method measures the instanteneous mobility of the mobile station monitoring the closed power control data. The MPSK modulation method is used for the basic modulation method because of the hardware implementation. Using the proposed method we can get the more powerful throughput. By the system simulation to verify the evaluation of the proposed algorithm, we can notice the algorithm is more efficient than the typical method

• Journal of the Korea Society for Simulation
• /
• v.17 no.1
• /
• pp.9-16
• /
• 2008

The sink mobility can request frequent routing change in sensor networks. By active mobility a sink can gather needed information easily so that the network availability will be higher. However, instead static sink system, the connection between sensor nodes and a mobile sink can be changed continuously. That is, the rerouting should be implemented caused by the routing alteration. It is two connection setups for the mobile sink system: the connection from sink to sensor nodes and the connection from sensor nodes to sink. However, sensor nodes actually have many functional limitations. Hence, the low cost scheme will be needed for the connection setup from sensor nodes to the mobile sink. In this paper, we propose an agent scheme to the connection setup from sensor nodes to the mobile sink. The agent scheme provides the reliable setup scheme to the connection by using an agent sector.

• Korean Journal of Optics and Photonics
• /
• v.27 no.6
• /
• pp.212-217
• /
• 2016

In connection-oriented data-transport services, data loss can occur when the service experiences a problem on its end-to-end path. To promptly resolve this problem, the data-switching systems providing the service should quickly modify their internal configurations distributed among different places in each system. This is performed through a sequence of problem (event) recognition, sharing, and handling procedures among multiple control processors in the system. This paper proposes a method for event sharing and messaging between control processors, to improve the time determinacy of event processing. This method simplifies runtime event sharing and minimizes the time variability caused by the event data, resulting in a decrease in the latency time in processing global events. The proposed method lessens the latency time of global event processing by about 40%, compared to general methods, for 738 internal path changes.