• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.1-11
• /
• 2009

XQuery query proposed by W3C is one of the standard query languages for XML data and is widely accepted by many applications. Therefore the studies for efficient Processing of XQuery query have become a topic of critical importance recently and the optimization of XQuery query is one of new issues in these studies. However, previous researches just focus on the optimization techniques for a specific XML data management system and these optimization techniques can not be used under the any XML data management systems. Also, some previous researches use predefined XML data structure information such as XML schema or DTD for the optimization. In the real situation, however applications do not all refer to the structure information for XML data. Therefore, this paper analyzes only a XQuery query and optimize by using itself of the XQuery query. In this paper, we propose 3 kinds of optimization method that considers the characteristic of XQuery query. First method removes the redundant expressions described in XQuery query second method replaces the processing order of operation and clause in XQuery query and third method rewrites the XQuery query based on FOR clause. In case of third method, we consider FOR clause because generally FOR clause generates a loop in XQuery query and the loop often rises to execution frequency of redundant operation. Through a performance evaluation, we show that the processing time for rewritten queries is less than for original queries. also each method in our XQuery query optimizer can be used separately because the each method is independent.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.293-306
• /
• 2003

In recent years, distributed computing environments have been radically changing to a structure of global, heterogeneous, federative and wide-area systems. This structure's environments consist of a let of objects which are implemented on telecommunication network to provide a wide range of services. Furthermore, all of objects existing on the earth have the duplicated characteristics according to how to categorize their own names or properties. But, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. Also, if the duplicated objects which is existing on different nodes provide the same service, it is possible to distribute the client requests considering each system's load. For this reason, we designed and implemented a new model that can not only support the location management of replication objects, but also provide the dynamic binding service of objects located in a system with minimum overload for maintaining load balancing among nodes in wide-area object computing environments. Our model is functionally divided into two parts; one part is to obtain an unique object handle of replicated objects with same property as a naming and trading service, and the other is to search one or more contact addresses by a location service using a given object handle. From a given model mentioned above, we present the procedures for the integrated binding mechanism in design phase, that is, Naming/Trading Service and Location Service. And then, we described in details the architecture of components for Integrated Binding Service implemented. Finally, we showed our implement environment and executing result of our model.

• Economic and Environmental Geology
• /
• v.53 no.4
• /
• pp.479-489
• /
• 2020

A fault is a geological structure that can be a migration path or a cap rock of hydrocarbon such as oil and gas, formed from source rock. The fault is one of the main targets of seismic exploration to find reservoirs in which hydrocarbon have accumulated. However, conventional fault detection methods using lateral discontinuity in seismic data such as semblance, coherence, variance, gradient magnitude and fault likelihood, have problem that professional interpreters have to invest lots of time and computational costs. Therefore, many researchers are conducting various studies to save computational costs and time for fault interpretation, and machine learning technologies attracted attention recently. Among various machine learning technologies, many researchers are conducting fault interpretation studies using the support vector machine, multi-layer perceptron, deep neural networks and convolutional neural networks algorithms. Especially, researchers use not only their own convolution networks but also proven networks in image processing to predict fault locations and fault information such as strike and dip. In this paper, by investigating and analyzing these studies, we found that the convolutional neural networks based on the U-Net from image processing is the most effective one for fault detection and interpretation. Further studies can expect better results from fault detection and interpretation using the convolutional neural networks along with transfer learning and data augmentation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.9
• /
• pp.209-216
• /
• 2019

Publish-subscribe communication model is popular for various type of distributed applications because of its loosely coupled style connections. Among the various architecture style for publish-subscribe system, peer-to-peer architecture has been used for the mission critical application domain since it provides high scalability and real-timeness. On the other hand, to utilize the bandwidth of given networks, message filtering is frequently used to reduce the number of messages on the system. Even if P2P provides superior scalability, it is hard to apply filtering to the its messaging system because the filtering process should be done on the peer-side in P2P architecture that are usually done on the broker server in conventional pub/sub architecture. In this paper, we propose a hierarchical subscription management structure as well as message forwarding scheme for efficient data dissemination. Our proposed scheme reduces the number of received messages by filter-out un-wanted messages and offloading the message dissemination work to other subscribers to enhance the messaging throughput.

• Spatial Information Research
• /
• v.5 no.2
• /
• pp.147-160
• /
• 1997

"The "Map Algebra", beeing recognized as a viable theoretical framework for GIS (Geographica Infonnation System), models map layers as "operands" which are the basic unit of geo-processing, and a variety of GIS commands as "operators." In this paper, we attempt at lifting some limitations of map algebras proposed in GIS literature. First, we model map layer as "function" such that we may employ the notion of meta operator (or, higher-order funtion) available in the functional programming paradigm. This approach provides map algebraic language with "programmability" needed in GIS user language. Second, we extend the semantics of, and improve on the sytactic structure of map algebraic language. Mer the data model and language associated with map algebra are formalized, we proceed to design and implement a prototype of map algebraic processor. The parser of the language in our prototype plays the role of transforming the native and heterogeneous user language of current GISs into a canonical map algebraic language. The prototype, named "MapSee" is a proof-of-concept system for the ideas we propsed in this paper. We believe that the uniform interface based on the map algebraic language will make promising infrastructure to support "Internet GIS." This is because the uniform but powerful interface through the Web clients allow access to both geo-data and geo-processing resources distributed over the network.to both geo-data and geo-processing resources distributed over the network.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.113-124
• /
• 2009

With increasing multicore system, much effort has been put on the performance improvement of its application. Because multicore system has multiple processing devices in one system, its processing power increases compared to the single core system. However in many cases the advantages of multicore can not be exploited fully because the existing software and hardware were designed to be suitable for single core. When the existing software runs on multicore, its performance improvement is limited by the bottleneck of sharing resources and the inefficient use of cache memory on multicore. Therefore, according as the number of core increases, it doesn't show performance improvement and shows performance drop in the worst case. In this paper we propose a method of performance improvement of multicore system by applying Flow-Level Parallelism to the existing TCP/IP network application and operating system. The proposed method sets up the execution environment so that each core unit operates independently as much as possible in network application, TCP/IP stack on operating system, device driver, and network interface. Moreover it distributes network traffics to each core unit through L2 switch. The proposed method allows to minimize the sharing of application data, data structure, socket, device driver, and network interface between each core. Also it allows to minimize the competition among cores to take resources and increase the hit ratio of cache. We implemented the proposed methods with 8 core system and performed experiment. Experimental results show that network access speed and bandwidth increase linearly according to the number of core.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.999-1004
• /
• 2006

본 연구에서는 다양한 개념 패싯과 관계 패싯들을 수용한 범용 과학기술 시소러스 구축용 웹 기반 워크벤치 개발에 대해 기술한다. 기존 국내 시소러스 구축용 워크벤치들이 제공하는 기본적인 용어 관계구축 기능을 확장하여 개념 패싯, 범주 관계 패싯, 의미역 관계 패싯, 속성 관계 패싯 및 속성 키워드 처리 기능을 원활히 제공할 수 있는 사용자 중심적 워크벤치를 개발함으로써 시소러스 상의 개념들에 대한 효율적인 구축이 가능하도록 한다. 또한 시멘틱 웹 상의 온톨로지 영역에 보다 근접한 고도화되니 시소러스 구축을 위해 용어들을 개념화시키고, 개념간의 다양한 관계를 설정하는 프로세스 중심적 설계로 분야 적합성이 높은 정보 처리 기반을 갖춘다. 궁극적으로 여러 마이크로 시소러스들을 통합하여 운용할 수 있는 복합 모델을 구축하는 것을 목표로 하고 있다. 이러한 목적에 부합하는 시스템 구현을 위해 CBD(Component Based Development) 개발 방법론으로 MSF/CD를 이용하였으며, 분산 환경에서 이기종간의 데이터 교환을 용이하게 하기 위하여 웹 서비스 (XML Web Services)를 이용하였다. 또한 시멘틱 웹 기반 연구자 간 협업 지원 서비스 구현을 위한 확장 검색용으로서도 활용할 수 있도록 하였다. 시소러스 반출은 CSV, XML 및 RDF를 모두 지원할 수 있도록 함으로써 다양한 사용자 요구 사항에 부합할 수 있도록 하였다. 시소러스 브라우징을 시각화 기반의 3단계 구조를 가진 플래시로 구현하여 사용자가 쉽게 시소러스를 탐색하고 분석할 수 있는 기반을 제공하였다. 또한 다양한 검색 요구를 만족시키고자 기본 검색, 고급 검색, 메타 검색을 선택할 수 있도록 하며, 개념 편집 및 시소러스 브라우징과 연동시켜 효율적인 시소러스 구축이 가능하도록 하였다. 본 연구의 워크벤치를 이용하여 구축된 시소러스는 기존 시소러스들에 비해 사용자가 보다 폭넓은 의미 기반 검색을 수행할 수 있도록 함으로써 다각적인 정보를 쉽게 획득할 수 있는 기반을 마련하고 있다는 데 의의가 있으며, 다국어 시소러스 및 다중 시소러스를 수용할 수 있는 방향으로 발전시킬 계획이다.

• Journal of the Korean Ceramic Society
• /
• v.41 no.8
• /
• pp.628-632
• /
• 2004

A porous hydroxyapatite has been prepared using natural coral which resembles human cancellous bone in microstructure. To obtain a biomaterial having a good biocompatibility, substitution of silicon into the hydroxyapatite framework has been attempted. Si substituted hydroxyapatite has been prepared by hydrothermal treatment and solvothermal treatment of the natural coral repeatedly. Si concentration and phase of the Si substituted hydroxyapatite derived from coral have been characterized using a XRD, ICP, and EDS etc. EDS investigation confirmed the presence of silicon in the framework of hydroxyapatite structure.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.269-276
• /
• 2004

There exist several types of distributed subscriber networks using Asymmetric Digital Subscriber Line(ADSL), Very high -bit rate Digital subscriber Line(VDSL), and Data Oner Cable Service Interface Specifications(DOCSIS). The efficient and concentrated network management of those several distributed subscribers networks and resources requires the general management information model of network, which has abstract and conceptual managed objects of the heterogeneous networks and its equipment to manage the integrated subscriber network. This paper presents the general Internet subscribers network modeling framework using RM-ODP to manage that network in the form of integrated hierarchy. This paper adopts the object-oriented development methodology with UML and designs and implements the HFC network of DOCSIS as an example of the subscriber network.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.647-654
• /
• 2003

The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.