• Journal of The Korean Astronomical Society
• /
• v.47 no.3
• /
• pp.115-122
• /
• 2014

The New Vacuum Solar Telescope (NVST) is a 1-meter vacuum solar telescope that aims to observe the fine structures of active regions on the Sun. The main tasks of the NVST are high resolution imaging and spectral observations, including the measurements of the solar magnetic field. The NVST has been collecting more than 20 million FITS files since it began routine observations in 2012 and produces maximum observational records of 120 thousand files in a day. Given the large amount of files, the effective archiving and retrieval of files becomes a critical and urgent problem. In this study, we implement a new data archiving system for the NVST based on the Fastbit Not Only Structured Query Language (NoSQL) database. Comparing to the relational database (i.e., MySQL; My Structured Query Language), the Fastbit database manifests distinctive advantages on indexing and querying performance. In a large scale database of 40 million records, the multi-field combined query response time of Fastbit database is about 15 times faster and fully meets the requirements of the NVST. Our slestudy brings a new idea for massive astronomical data archiving and would contribute to the design of data management systems for other astronomical telescopes.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.165-179
• /
• 2010

Recently, the processing of data streams such as stock quotes, buy-sell orders, and billing records becomes more important in e-Business environments. Especially, the use of skyline queries over data streams is rapidly increasing to support multiple criteria decision making. Given a set of multi-dimensional tuples, a skyline query retrieves a set of tuples which are not dominated by other tuples. Although there has been much work on processing skyline queries over static datasets, there has been relatively less work on processing multiple skyline queries over data streams. In this paper, we propose an efficient method for processing multiple continuous skyline queries over data streams. The proposed method efficiently identifies which tuple is a skyline tuple of which query, resulting in a lower cost of processing multiple skyline queries. Through performance evaluation, we show the performance advantage of the proposed method.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.1-16
• /
• 2008

Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

• Journal of Advanced Navigation Technology
• /
• v.25 no.4
• /
• pp.293-298
• /
• 2021

In general, the guided weapon seeker and the guided control device process the target, search, recognition, and capture information to indicate the state of the guided missile, and play a role in controlling the operation and control of the guided weapon. The signals required for guided weapons are gaze change rate, visual signal, and end-stage fuselage orientation signal. In order to process the complex and difficult-to-process missile signals of recent missiles in real time, it is necessary to increase the data processing speed of the missiles. This study showed the processing speed after applying the stop and go and inverse enumeration algorithm among the parallel algorithm methods of PINQ and comparing the processing speed of the signal data required for the guided missile in real time using the guided missile inspection program. Based on the derived data processing results, we propose an effective method for processing missile data when applying a parallel processing algorithm by comparing the processing speed of the multi-core processing method and the single-core processing method, and the CPU core utilization rate.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.59-67
• /
• 2010

Rice varietal information exchange is vital for agricultural experiments and trials. With the growing size of rice data gathered around the world, and numerous research and development achievements, the effective collection and convenient ways of data dissemination is an important aspect to be dealt with. The collection of this data is continuously worked out through various international cooperation and network programs. The problem in acquiring this information anytime anywhere is the new challenge faced by rice breeders, scientist and crop information specialists, in order to perform rapid analysis and obtain significant results in rice research, thus alleviating rice production. To address these constraints, we propose an Online Analytical Query System, a web query application to provide breeders and rice scientist around the world a fast web search engine for rice varieties, giving the users the freedom to choose from which trial it has been used, trait observation parameters as well as geographical or weather conditions, and location specifications. The application uses data warehouse techniques and OLAP for summarization of agricultural trials conducted, and statistical analysis in deriving outstanding varieties used in these trials, consolidated in an Model-View-Controller Web framework.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.1
• /
• pp.93-102
• /
• 1999

In this paper, we propose a data model and a retrieval method for content-based video query After partitioning a video into frame sets of same length which is called video-window, each video-window can be mapped to a point in a multidimensional space. A video can be represented a trajectory by connection of neighboring video-window in a multidimensional space. The similarity between two video-windows is defined as the euclidean distance of two points in multidimensional space, and the similarity between two video segments of arbitrary length is obtained by comparing corresponding trajectory. A new retrieval method with filtering and refinement step if developed, which return correct results and makes retrieval speed increase by 4.7 times approximately in comparison to a method without filtering and refinement step.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.613-624
• /
• 2003

This paper proposes a design for efficient and accurate retrieval of similar image subsequences using the multi-dimensional time warping distance as similarity evaluation tool in image sequence database after building of two indexing structures implemented with priority queue and suffix tree respectively. Receiving query image sequence, at first step, the proposed method searches the candidate set of similar image subsequences in priory queue index structure. If it can not get satisfied results, it retrieves another candidate set in suffix tree index structure at second step. The using of the low-bound distance function can remove the dissimilar subsequence without false dismissals during similarity evaluating process between query image sequence and stored sequences in two index structures.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.176-179
• /
• 2007

센서 네트워크는 제한된 에너지를 가지는 작은 노드들로 구성이 된다. 제한된 자원을 가지는 센서 네트워크에서 저 전력에 대한 연구는 핵심 분야로써, 다양한 연구가 진행 중이다. 센서 네트워크에서 에너지 효율을 높이는 방법들이 많이 연구되고 있다. 센서 네트워크에서 가장 큰 에너지 손실을 가져오는 부분은 통신 부분이며, 질의 기반 센서 네트워크에서는 질의를 배포하게 될 때 에너지 소비의 주요 요소들이 발생하게 된다. 따라서, 본 논문은 베이스스테이션으로 다중 질의를 요청할 때 질의 합성을 통해 전달되는 질의 수를 최소화하여 질의의 배포에 따른 에너지 소비 요소를 줄이는데 그 목적이 있다. 질의는 조건절에서 특정 속성에 대해서 판별하는데, 본 논문에서 제안하는 방법은 속성에 따라 질의를 합성하여 원본 질의의 개수보다 적게 하는 것이다. 제안 알고리즘을 통해 합성된 질의가 센서 노드에게 전해지는 과정에서 데이터의 송수신 횟수 및 overhead를 줄일 수 있으며, 또한 센서 노드는 합성된 질의로 센싱 횟수를 줄 일 수 있어 에너지 효율을 높일 수 있다. 본 논문에서 제안한 방법과 일반적인 방법을 비교하기 위해 에너지 소모 절감 예를 살펴봤다.

• Journal of the Optical Society of Korea
• /
• v.20 no.2
• /
• pp.239-244
• /
• 2016

Mugshot face images, routinely collected by police, usually contain both frontal and profile views. Existing automated face recognition methods exploited mugshot databases by enlarging the gallery with synthetic multi-view face images generated from the mugshot face images. This paper, instead, proposes to match the query arbitrary view face image directly to the enrolled frontal and profile face images. During matching, the 3D face shape model reconstructed from the mugshot face images is used to establish corresponding semantic parts between query and gallery face images, based on which comparison is done. The final recognition result is obtained by fusing the matching results with frontal and profile face images. Compared with previous methods, the proposed method better utilizes mugshot databases without using synthetic face images that may have artifacts. Its effectiveness has been demonstrated on the Color FERET and CMU PIE databases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.131-140
• /
• 2018

A broadcast scheduling scheme is an essential technique to improve the performance of data broadcast systems. This paper explores the problem of data broadcast over multiple channels to reduce query response time, and proposes a new hybrid data broadcast scheduling scheme named HDAMA. The proposed scheme employs the strategy that combines the advantages of push-based broadcast and pull-based broadcast. HDAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly reflecting the characteristics of multi-data queries and broadcasting pull data items relatively on time. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of HDAMA is superior to other schemes in terms of the average response time.