• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.67-69
• /
• 2002

여러 사이트에서 구축된 공간 데이터를 효율적으로 관리 및 공유하기 위해서는 대용량의 정보를 처리할 수 있는 분산 공간 데이터베이스 시스템의 사용이 필수적이다. 이러한 분산 공간 데이터베이스 시스템상에서의 분산 공간 죠인 질의는 공간 데이터의 대용량성과 그 복잡성으로 인하여 공간 연산의 지펴져 부하와 네트워크상의 전송 부하를 발생시킨다. 이러한 문제를 해결하기 위해 세미죠인 기반의 공간 죠인 기법들이 제안되었으나 공간 죠인 연산을 특정 서버에서만 수행하여 병목현상을 발생시키기 때문에 결국 질의 처리시간이 증가된다. 본 논문은 이러한 분산 공간 데이터베이스 시스템에서 수행 비용이 많이 드는 원격 사이트간의 공간 죠인 연산에 대해 R+-tree 공간 색인을 사용하여 병렬적으로 수행하는 기법을 제안한다. 본 기법은 R+-tree 공간 색인을 이용하여 공간 죠인 연산의 대상이 되는 릴레이션들을 중첩이 없는 두개의 릴레이션들로 분할한 후 질의 수행에 참여하는 두 서버에 죠인 연산을 분배하고 병렬적으로 처리하여 결과들을 병합한 다음 클라이언트에게 전송만다. 본 기법은 릴레이션을 분할하여 각 서버에서 공간 죠인 연산을 병렬적으로 처리하므로 처리 비용을 절반으로 감소시키며. R+-tree의 영역에 해당하는 객체들만 죠인 연산에 참여하게 함으로써 네트워크 전송 비용을 감소시킨다

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.87-97
• /
• 2018

Rainfall depth is an important meteorological information. Generally, high spatial resolution rainfall data such as road-level rainfall data are more beneficial. However, it is expensive to set up sufficient Automatic Weather Systems to get the road-level rainfall data. In this paper, we proposed to use deep learning to recognize rainfall depth from road surveillance videos. To achieve this goal, we collected two new video datasets, and proposed a new deep learning architecture named Temporal and Spatial Segment Networks (TSSN) for rainfall depth recognition. Under TSSN, the experimental results show that the combination of the video frame and the differential frame is a superior solution for the rainfall depth recognition. Also, the proposed TSSN architecture outperforms other architectures implemented in this paper.

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

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• Proceedings of the Korean Society for Food Science of Animal Resources Conference
• /
• 2005.05a
• /
• pp.231-234
• /
• 2005

본 실험은 돈육 후지 부위를 이용하여 육포 제조시 텀블링 시간에 따른 육포의, 이화학적 및 관능적 특성을 조사하여 표준화된 육포제조의 기초 자료를 제공하고자 실시하였다. 텀블링 시간에 따른 건조전 육포 양념육의 제품수율은 30분까지는 수율이 유의적으로 증가하는 경향을 보였으나, 60분 동안 텀블링을 실시하였을 때는 30분보다 낮은 값을 나타내었다. 텀블링 시간에 따라 pH는 차이가 없었으나, 보수력은 텀블링 30분까지 유의적으로 증가하였고 이후 부터는 차이가 없었다. 육색은 텀블링 시간이 경과함에 따라 $L^{\ast}-$값과 $b^{\ast}-$값은 감소하는 경향을 보였으나 반대로 $a^{\ast}-$값은 텀블링 시간이 증가함에 따라 점점 증가하는 경향을 보였다. 건조후 제조된 돈육육포의 수분함량은 $29{\sim}30%$ 정도를 유지하였으며, 건조수율은 모두 $48{\sim}49%$ 정도의 높은 수율을 보였다. 육포의 $L^{\ast}-$값은 30분 및 60분 동안 텀블링을 실시하였을 때 10분 동안 텀블링을 실시한 육포보다 낮게 나타났다. 60분 동안 텀블링한 육포의 $a^{\ast}-$값은 10분간 텀블링한 것보다 높았으며, $b^{\ast}-$값은 $a^{\ast}-$값과는 반대의 경향을 나타내었다. 탄력성(springiness)은 60분 동안 텀블링한 육포가 10분 동안 텀블링한 육포보다 높은 값을 보였으나, 탄력성을 제외한 모든 항목에서 유의차가 나타나지 않았다. 관능검사는 모든 항목에서 30분 이상 텀블링한 육포가 좋은 평가를 받았으나, 처리구간에 유의차는 나타나지 않았다.pm을 spiking한 후 SPE상에서 SCX(Strong cation exchange column)을 통한 clean-up과정을 거친 후의 STP의 limit of quantification(LOQ)는 약 0.44ppm이었으며, 이에 대한 회수율은 89.7${\pm}$2.3%(n=6)를 나타냈다. 실제 CODEX에서 권장한 우유의 MRL이 0.6ppm인 점을 감안하면 CODEX권고치에 도달할 수 있는 것으로 판단되었다. 따라서 본 연구에서 개발 된 시험법은 지금까지 국내적으로 STP에 대한 시험법이 확립되어 있지 않은 것으로 이와 아울러 간편한 parallux와 병용해 STP에 대한 정량 및 정성 분석을 유도체화 장치 및 형광검출기를 이용해 잔류항생물질 STP에 대한 분석시험법을 개발하였다.화와 네트워크 조직망 구축을 위한 지역중심의 복합 생활문화 공간이 필요할 것이며, 이를 촉진키 위한 mentor academy시스템 접근을 통해 점점 고령화되어 가고 있는 재래시장에 대해 차별적 특성이 반영된 종합적이고 체계적 접근 방법연구가 필요하다./TEX> 자체기술개발, 선진기술 도입, 산업간 및 산업내 기술확산, 국제기술협력 ${\rightarrow}$ 기술혁신의 촉진 ${\rightarrow}$ 총요소생산성과 기업경쟁력(자원 및 역량, 프로세스 경쟁력, 품질경쟁력, 시장경쟁력, 고객성과, 시장성과, 재무성과)의 제고 ${\rightarrow}$ 가격경쟁력(임금, 금리, 물류비용, 환율 등)과 비(非)가격경쟁력(디자인, 에프터서비스, 품질, 운송 등)의 제고 ${\rightarrow}$ 국가경쟁력의 제고 ${\rightarrow}$ 국제수지 흑자 ${\ri

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.99-111
• /
• 2009

In wireless sensor networks, various schemes have been proposed to store and process sensed data efficiently. A Data-Centric Storage(DCS) scheme assigns distributed data regions to sensors and stores sensed data to the sensor which is responsible for the data region overlapping the data. The DCS schemes have been proposed to reduce the communication cost for transmitting data and process exact queries and range queries efficiently. Recently, KDDCS that readjusts the distributed data regions dynamically to sensors based on K-D tree was proposed to overcome the storage hot-spots. However, the existing DCS schemes including KDDCS suffer from Query Hot-Spots that are formed if the query regions are not uniformly distributed. As a result, it causes reducing the life time of the sensor network. In this paper, we propose a new DCS scheme, called TPDCS(Time-Parameterized DCS), that avoids the problems of storage hot-spots and query hot-spots. To decentralize the skewed. data and queries, the data regions are assigned by a time dimension as well as data dimensions in our proposed scheme. Therefore, TPDCS extends the life time of sensor networks. It is shown through various experiments that our scheme outperform the existing schemes.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.42-49
• /
• 2017

Delay- and Disruption-Tolerant Network (DTN) has been considered as a key technology to overcome main challenges in interplanetary communications such as an intermittent connectivity and high bit error rates. The lack of end-to-end connectivity between source and destination results in long and variable delays and data loss, hence the Internet Protocols cannot operate properly in such environments because it requires an end-to-end connectivity. The DTN, which utilizes 'store-and-forward' message passing scheme between nodes, can overcome the lack of end-to-end connectivity in Interplanetary Network (IPN). In this paper, DTN is applied to 3-hop relay IPN, where messages are transmitted from Earth ground station to Lunar lander through Earth satellite and Lunar orbiter. ONE simulator is used to reflect the real environment of IPN and an efficient resource management method are analyzed to guarantee the message delivery by optimizing a message TTL (Time to Live), buffer size and message fragmentation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.20 no.4
• /
• pp.126-138
• /
• 2017

Recently, the national interest in environment is increasing and for dealing with water environment-related issues swiftly and accurately, the demand to facilitate the analysis of water environment data using a GIS is growing. To meet such growing demands, a spatial network data-based stream network analysis map(Korean Reach File; KRF) supporting spatial analysis of water environment data was developed and is being provided. However, there is a difficulty in delineating catchment areas, which are the basis of supplying spatial data including relevant information frequently required by the users such as establishing remediation measures against water pollution accidents. Therefore, in this study, the development of a computer program was made. The development process included steps such as designing a delineation method, and developing an algorithm and modules. DEM(Digital Elevation Model) and FDR(Flow Direction) were used as the major data to automatically delineate catchment areas. The algorithm for the delineation of catchment areas was developed through three stages; catchment area grid extraction, boundary point extraction, and boundary line division. Also, an add-in catchment area delineation module, based on ArcGIS from ESRI, was developed in the consideration of productivity and utility of the program. Using the developed program, the catchment areas were delineated and they were compared to the catchment areas currently used by the government. The results showed that the catchment areas were delineated efficiently using the digital elevation data. Especially, in the regions with clear topographical slopes, they were delineated accurately and swiftly. Although in some regions with flat fields of paddles and downtowns or well-organized drainage facilities, the catchment areas were not segmented accurately, the program definitely reduce the processing time to delineate existing catchment areas. In the future, more efforts should be made to enhance current algorithm to facilitate the use of the higher precision of digital elevation data, and furthermore reducing the calculation time for processing large data volume.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1367-1383
• /
• 2007

A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.527-531
• /
• 2003

Previous researches on scalability problem of distributed virtual environment (DVE) have been mainly focused on spatial partitioning of area of interest (AOI). Congestion phenomena by avatar groups in AOI have been neglected relatively. However, AOI congestion is highly related to scalability of DVT because it exhausts system resources such as network bandwidth and rendering time, and could be a bar to perform collaboration among participants. In this paper, this will be defined as the problem that must be solved for the realization of the scalable DVE, and a model will be proposed to measure and control congestion situation in AOI. The purposes of the proposed model are to prevent high density of participants in AOI, and to protect stable collaboration in DVE. For evaluation of the performance it is compared with a previous method by defining the resource cost model which is dynamically activated to AOI congestion.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.9-18
• /
• 2009

Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.