• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.396-417
• /
• 2018

GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

• Communications for Statistical Applications and Methods
• /
• v.2 no.1
• /
• pp.74-88
• /
• 1995

This article introduces a unified method of choosing the most explanatory and significant multiway partitions for classification tree design and analysis. The method is derived on the impurity reduction (IR) measure of divergence, which is proposed to extend the proportional-reduction-in-error (PRE) measure in the decision-theory context. For the method derivation, the IR measure is analyzed to characterize its statistical properties which are used to consistently handle the subjects of feature formation, feature selection, and feature deletion required in the associated classification tree construction. A numerical example is considered to illustrate the proposed approach.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.55-57
• /
• 2004

이동 컴퓨팅(Mo띠le Computing) 환경에서 빈번한 접속 단절은 클라이언트의 캐시 일관성(Consistency) 문제로 직결된다. 본 논문에서는 이를 해결하기 일한 무효화 보고(Invalidation Report. In)중 하나를 제시한다. 기존의 IR방식은 대량의 데이터와 빈번한 데이터의 갱신(Update)시 IR 길이의 증기폭이 상당히 크다. 이는 타임스탬프가 IR에서 차지하는 비중이 큼으로써 오는 현상이다. 또한 기존방식은 캐시 레벨의 선택적 청취(Selective tuning)를 지원하지 못하는 문제점을 가지오 있다. 이러한 점을 극복하고자 B＋Tree를 기반으로 시간 값을 구성하고 이에 따른 데이터 아이디를 재구성하는 IR방식을 제안한다. 이를 활용하면 각 클라이언트가 자신의 단절(Disconnect)된 시간에 맞는 갱신 정보를 확인할 수 있게 된다. 이러한 방법은 기존 IR의 단점을 보완하며 선택적 청취론 유도할 수 있는 효과적인 방법이다.

• Journal of the Korean Wood Science and Technology
• /
• v.49 no.1
• /
• pp.67-81
• /
• 2021

This study aimed to conduct tree-ring dating and analysis of the materials used for the wooden coffins excavated from the ruins of Sipjeong-dong, Incheon. The tree species for the 10 wooden coffin materials was identified as pine. For accurate tree-ring measurement, the cross section was polished using sandpaper. The annual ring width was measured with an accuracy of 0.01 mm. Since the five materials were consistent with each other in dendrochronology, a representative annual ring chronology of 83 years was prepared. The prepared representative annual ring chronology was compared with the standard annual ring chronology, and the outermost ring of the wooden coffin was confirmed to correspond to the year 1575, suggesting that the wooden coffin was produced in the late 16th century. In addition, microscopic observation and FT-IR analysis revealed that the fibers attached to the surface of the wooden coffin were fibroin (Silk), and infrared spectroscopy (FT-IR) and Py-GC/MS analysis showed that the paint left on the surface of the wooden coffin was lacquer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4908-4928
• /
• 2017

Recent research into wireless sensor network (WSN)-related technology that senses various data has recognized the need for spatio-temporal queries for searching necessary data from wireless sensor nodes. Answers to the queries are transmitted from sensor nodes, and for the efficient transmission of the sensed data to the application server, research on index processing methods that increase accuracy while reducing the energy consumption in the node and minimizing query delays has been conducted extensively. Previous research has emphasized the importance of accuracy and energy efficiency of the sensor node's routing process. In this study, we propose an itinerary-based R-tree (IR-tree) to solve the existing problems of spatial query processing methods such as efficient processing and expansion of the query to the spatio-temporal domain.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.3
• /
• pp.92-97
• /
• 2022

Plastics are classified into 7 types such as PET (PETE), HDPE, PVC, LDPE, PP, PS, and Other for separation and recycling. Recently, large corporations advocating ESG management are replacing them with bioplastics. Incineration and landfill of disposal of plastic waste are responsible for air pollution and destruction of the ecosystem. Because it is not easy to accurately classify plastic materials with the naked eye, automated system-based screening studies using various sensor technologies and AI-based software technologies have been conducted. In this paper, NIR scanning devices considering the NIR wavelength characteristics that appear differently for each plastic material and a system that can identify the type of plastic by learning the NIR spectrum data collected through it. The accuracy of plastic material identification was evaluated through a decision tree-based SVM model for multiclass classification on NIR spectral datasets for 8 types of plastic samples including biodegradable plastic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2140-2146
• /
• 2009

Since tags do not have location informations, the identifiers of tags which are symbolic data are used as the location informations. Therefore, it is difficult to define the proxmity between two trajectories of tags and inefficient to process the user queries for tags. In this paper, we define the perceptual space to model the location of a tag and propose the proximity of the perceptual spaces. The proximity of the perceptual spaces is composed of the static proximity and dynamic proximity. Using the proximity of the perceptual spaces, it is possible to measure the proximity between two trajectories of tags and build the efficient indexes for tag trajectories. We evaluated the performance of the proposed proximity function for tag trajectories on the IR-tree and the $R^*$-tree.

• Horticultural Science & Technology
• /
• v.34 no.1
• /
• pp.15-23
• /
• 2016

A study was conducted to evaluate the effects of irrigation (amount, interval) on tree growth, fruit quality, and cracking of organic 'Campbell Early' grapevine in 2012 and 2013. Three irrigation treatments were applied using a sprinkler system from mid-June to mid-August in 2012 and 2013, as follows: 10 mm was applied daily (10 mm-IR), 20 mm was applied every two days (20 mm-IR), and 30 mm was applied every five days (30 mm-IR). Soil electrical conductivity (EC) and temperature were found to be greatest in the 10 mm-IR treatment in both years. Soil moisture content ranged between 20-40% in the 10 mm-IR, between 20-60% in the 20 mm-IR, and between 20-70% in the 30 mm-IR treatment plots. The total number of leaves per shoot and shoot growth were found to be greatest in the 20 mm-IR and 30 mm-IR treatments, respectively. Cluster and berry weights, and cluster and berry sizes were not consistently affected by the treatments. The 10 mm-IR treatment resulted in an increase in fruit SSC, SSC/acidity ratio, and berry skin pigmentation ($b^*$; blue). Approximately 5% of fruit cracking was observed on average over both years in the 10 mm-IR-treated fruit, while the 30 mm-IR treatment resulted in nearly 18% of cracking in 2012. Average marketable fruit yield per year over two years was greatest for the 10 mm-IR treatment ($24.4t{\cdot}ha^{-1}$) followed by the 30 mm-IR treatment ($22.7t{\cdot}ha^{-1}$) and lastly the 20 mm-IR treatment ($22.2t{\cdot}ha^{-1}$). Thus, the 10 mm-IR treatment represents a suitable irrigation regimen for controlling leaf and shoot growth of vines grown under a rain-shelter system in sandy loam soils, while improving fruit sugar contents and skin color and limiting fruit cracking.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.143-146
• /
• 2008

For tracing tag locations, a trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry and we should extend the region of a query to find the tag that remains in a reader. In this paper, we propose an interval data model of tag's trajectory in order to solve the problem. For the interval data model. we propose a new index scheme called the IR-tree(Interval R-tree) and algorithms of insert and split for processing query efficiently. We also evaluate the performance of the proposed index scheme and compare it with the previous indexes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.782-791
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots. In order to match up targets with measured azimuths, we apply the maximum likelihood (ML), depth-first, and breadth-first tree search algorithms, in which we use the measured azimuths and the number of pixels on IR screen for pruning branches and selecting candidates. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the probability of missing target, mean of the number of calculating nodes, and mean error of the estimated coordinates of the proposed algorithms.