• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1597-1603
• /
• 2004

Recently many corporations are introducing web services which supports mutual smooth information exchange without depending on platform or programming language and new distributed computing environment based on U standard technology and internet standard protocol such as HTTP. However they are suffering difficulty in interoperability because of the problem of version inconsistency of standards supported by platforms that each vender offers. To solve these interoperability problem, although WS-I is progressing a consecutive standardization work by method of that offer Basic Profile and Usage Scenario, it is in the state that the domestic research connected with this is not sufficient yet. Accordingly, this treatise constructed interoperability Test framework by developing web services on the basis of different platform from books information retrieval services that can easily be come with and simulated and verified the interoperability by applying WS-I Basic Profile.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1270-1273
• /
• 2007

최근 인터넷의 급속한 발달은 온라인 뱅킹, 인터넷 쇼핑몰 등에서의 실물 경제행위를 온라인상으로 처리할 수 있는 환경을 제공하지만 온라인상의 업무처리는 개인정보유출, 개인정보의 위조 및 변조 등의 문제를 가지고 있다. 사용자가 CA에게서 받은 인증서의 공개키로 전자서명 함으로써 개인정보유출, 정보의 위조 및 변조 등의 문제를 해결한 PKI(Public Key Infrastructure)기반의 인증서 검증시스템이 제안되어 사용되고 있다. 인증서 상태검증 방법에는 CRL(Certificate Revocation List)기반의 검증방식, OCSP(Online Certificate Status Protocol)기반의 검증방식 등이 있다. CRL기반의 인증서 검증방식은 인증서 취소목록을 검색해서 인증서의 유효성 여부를 응답하는 방식으로 시간이 지남에 따라 크기 증가와 오프라인 방식으로 인해서 목록을 다운받는 시간의 부담으로 인해서 OCSP방식이 제안되었다. 하지만 OCSP 방식 역시 서비스의 요청이 집중될 경우 문제가 발생될 수 있다. 그래서 분산된 OCSP를 구축하고 각 서버의 부하의 균형을 유지하기 위해 로드밸런싱 기법을 사용하고 있지만 그 방법 역시 지속적인 서비스 제공이 불가한 문제를 가지고 있다. 본 논문에서는 서비스 요청의 집중으로 인한 시스템 마비나 각 응답서버의 부하가 불균형적임으로써 생길 수 있는 문제를 해결할 수 있는 방법을 제안한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.334-348
• /
• 2005

The goal of next generation digital broadcasting is offering the interaction among consumers and providers as well as variety services. One of the important factors for this new broadcasting environment keeps the interoperability among providers and consumers since the environment is distributed. Therefore a standard metadata for digital broadcasting is required and TV-Anytime metadata is one of the metadata standards for digital broadcasting. The terminal nodes of TV-Anytime metadata are defined by using MPEG-7 metadata. MPEG-7 metadata is standard metadata for describing multimedia content. Therefore, if we use the MPEG-7 metadata for describing broadcasting content can offer multimedia search services like content-based search by the extension of metadata. The efficient management system for these metadata is important for offering the services with high Duality on real broadcasting environment TV-Anytime metadata and MPEG-7 metadata are technically defined using a single XML schema, so its instances are XML data. Currently, a lot of systemsfor managing XML data are proposed in many researchers and we can expect to adapt these systems for managing broadcasting metadata. But the methods used in these systems are not specific methods for managing broadcasting metadata because of methods for general-purpose. In this paper, we find the properties of broadcasting metadata and develop an efficient metadata management system that is based on the found properties. Since our systemis implemented on real broadcasting environment, we expect that the system is most efficient and suitable. Also our system is interoperable since we use XQuery as query language for querying broadcasting metadata.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.66-69
• /
• 2000

웹이 등장하면서 지금까지 인터넷 상에서 텍스트와 이미지를 이용하여 정보를 표현하고 전달하는 방법이 가장 많이 사용되어왔다. 그러나 웹 관련 기술의 비약적인 발달과 네트워크 속도의 증가 및 인터넷의 급속한 보급으로 단순한 텍스트와 이미지 중심의 HTML 문서를 이용한 정보의 전달이 아닌 멀티미디어 데이터를 이용한 정보의 표현과 전달이 점차 증대되고 있다. 이에 따라 멀티미디어 데이터를 전송하기 위한 스트리밍 프로토콜도 등장하였다. 최근에는 컴퓨터의 성능 증가 및 네트워크 속도의 증가(초고속 통신 서비스의 보급)에 의해 멀티미디어 데이터의 전송이 가능하게 됨으로써 기존의 공중파나 CATV 방송국의 형태 지니고 인터넷 상에서 실시간 생방송 서비스와 VOD(Video On Demand) 서비스를 제공하는 인터넷 방송국이 급속하게 생겨나고 있다. (11) 인터넷 방송은 동영상과 오디오의 실시간 전달을 가능하게 하는 멀티미디어 스트리밍 기술과 멀티미디어를 실시 간으로 전송할 수 있는 실시간 전송 프로토콜을 기반으로 발전하고 있다. 인터넷 상에서 멀티미디어 스트리밍 서비스를 하는 대부분의 인터넷 방송은 스트리밍 서버로서 RealNetworks사의 RealSystem과 Microsoft사의 WMT(Windows Media Technologies)를 사용하고 있다. 본 논문은 Real Server와 WMT의 비교 분석을 통해 실시간 전송 프로토콜을 지원하고, 멀티미디어 스트리밍 기술을 지원하는 자바를 기반으로 한 분산 서버 구조의 스트리밍 서버, 서버간의 부하를 제어하는 미들웨어, 멀티미디어 스트림을 재생할 수 있는 클라이언트를 설계하고 구현한다.있다.구현한다. 이렇게 구현된 시스템은 전자 상거래, 가상 쇼핑몰, 가상 전시화, 또는 3차원 게임이나 가상교육 시스템과 같은 웹기반 응용프로그램에 사용될 수 있다.물을 보존·관리하는 것이 필요하다. 이는 도서관의 기능만으로는 감당하기 어렵기 때문에 대학정보화의 센터로서의 도서관과 공공기록물 전문 담당자로서의 대학아카이브즈가 함께 하여 대학의 공식적인 직무 관련 업무를 원활하게 지원하고, 그럼으로써 양 기관의 위상을 높이는 상승효과를 낼 수 있다.하여는, 인쇄된 일차적 정보자료의 검색방법등을 개선하고, 나아가서는 법령과 판례정보를 위한 효율적인 시스템을 구축하며, 뿐만 아니라 이용자의 요구에 충분히 대처할 수 잇는 도서관으로 변화되는 것이다. 이와 함께 가장 중요한 것은 법과대학과 사법연수원에서 법학 연구방법에 관한 강좌를 개설하여 각종 법률정보원의 활용 내지 도서관 이용방법에 관하여 교육하는 것이다.글을 연구하고, 그 결과에 의존하여서 우리의 실제의 생활에 사용하는 $\boxDr$한국어사전$\boxUl$등을 만드는 과정에서, 어떤 의미에서 실험되었다고 말할 수가 있는 언어과학의 연구의 결과에 의존하여서 수행되는 철학적인 작업이다. 여기에서는 하나의 철학적인 연구의 시작으로 받아들여지는 이 의미분석의 문제를 반성하여 본다. 것이 필요하다고 사료된다.크기에 의존하며, 또한 이러한 영향은 $(Ti_{1-x}AI_{x})N$ 피막에 존재하는 AI의 함량이 높고, 초기에 증착된 막의 업자 크기가 작을 수록 클 것으로 여겨진다. 그리고 환경의 의미의 차이에 따라 경관의 미학적 평가가 달라진 것으로

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.113-125
• /
• 2018

Recently, with the advent of the Big Data era, we have gained the capability of acquiring vast amounts of knowledge from various fields. The collected knowledge is expressed by well-formed formula and in particular, OWL, a standard language of ontology, is a typical form of well-formed formula. The symbolic reasoning is actively being studied using large amounts of ontology data for extracting intrinsic information. However, most studies of this reasoning support the restricted rule expression based on Description Logic and they have limited applicability to the real world. Moreover, knowledge management for inaccurate information is required, since knowledge inferred from the wrong information will also generate more incorrect information based on the dependencies between the inference rules. Therefore, this paper suggests that the SWAT, knowledge management system should be combined with the SWRL (Semantic Web Rule Language) reasoning based on ATMS (Assumption-based Truth Maintenance System). Moreover, this system was constructed by combining with SWRL reasoning and ATMS for managing large ontology data based on the distributed In-memory framework. Based on this, the ATMS monitoring system allows users to easily detect and correct wrong knowledge. We used the LUBM (Lehigh University Benchmark) dataset for evaluating the suggested method which is managing the knowledge through the retraction of the wrong SWRL inference data on large data.

• Journal of the Korean Society for information Management
• /
• v.20 no.2
• /
• pp.114-133
• /
• 2003

Recently, the organizations related to cultural contents are gradually expanding access to cultural contents for general public through the distributed network. However, since cultural contents have different characteristics than general contents, the objects, the of cultural contents seldom contain the words generally used for organization and search of information. If the cultural contents system is created without any consideration of such differences. We cannot effectively identify and search resources. Moreover, because the names, expressions and meanings are different between metadata elements of various cultural contents, it is very difficult to interconnect or share information between different systems. In order to solve these problems, proper organization ad management of metadata is vital. In this studym we have comparatively analyzed the data elements of each format based on Dublin Core, EAD, VRA, CDWA, CIMI, and Object ID, the metadata formats approached from various aspects in the cultural contents area. Through this study, we tried to provide the basic materials for integration of cultural contents by securing interoperability of different metadata formats.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.58-65
• /
• 2008

This paper presents a new geographic distributed hash table (GDHT) for MANETs or Mesh networks, where virtual geographic protocol is used. In previous wort GDHT is applied to a network scenario based on two dimensional Cartesian coordinate system. Further, logical data space is supposed to be uniformly distributed. However, mobile node distribution in a network using virtual geographic routing is not matched to data distribution in GDHT. Therefore, if we apply previous GDHT to a virtual geographic routing network, lots of DHT data are probably located at boundary nodes of the network or specific nodes, resulting in long average-delay to discover resource (or service). Additionally, in BVR(Beacon Vector Routing) or LCR(Logical Coordinate Routing), because there is correlation between coordinate elements, we cannot use normal hash function. For this reason, we propose to use "geographic hash function" for GDHT that matches data distribution to node distribution and considers correlation between coordinate elements. We also show that the proposed scheme improves resource discovery efficiently.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.203-208
• /
• 2010

This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1344-1356
• /
• 2009

The DDS (Data Distribution Service) is a data-centric communication technology that provides an efficient communication service that supports a dynamic plug & play through an automatic setting of participants' location information for each data (Topic) by using DDS discovery technique. This paper proposes the hierarchical-structured DDS discovery technique (SPDP-TBF) suitable for the large-scale distributed systems by comparing and analyzing the existing DDS discovery techniques in terms of performance and problem areas. The proposed SPDP-TBF performs the periodic discovery of the involved participants only by having separate hierarchical managers which take charge of the registration and search (of participants) so that a participant sends its information to the related participants only, and it enhances the effectiveness of the message transfer. Moreover, the proposed SPDP-TBF provides the improved scalability by performing the hierarchical discovery through hierarchical manager nodes so that it can be applied to the large-scale distributed system.