• Nuclear industry
• /
• v.8 no.3 s.61
• /
• pp.92-93
• /
• 1988

영국에너지성은 영국의 민간 원자력발전소의 플루토늄생산량, Sellafield 플랜트의 사용후핵연료의 재처리량 및 민간소유 플루토늄의 재고량에 관한 집계를 발표했는데 이렇게 자세한 자료가 공개되기는 이번이 처음이며, 이는 영국정부가 민간원자력산업계에 대해 그 실태를 공개하도록 권장한데서 온 결과이다.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.429-440
• /
• 2002

Temporal databases manage time-evolving data. They provide built-in supports for efficient recording and querying of temporal data. The temporal aggregate in temporal databases is an extension of the conventional aggregate to include time concept on the domain and range of aggregation. This paper focuses on multidimensional temporal aggregation. In a multidimensional temporal aggregate, we use one or more general attributes as well as a time attribute on the range of aggregation, thus it is a useful operation for historical data warehouse, Call Data Records(CDR), etc. In this paper, we propose a structure for multidimensional temporal aggregation, called PTA-tree, and an aggregate processing method based on the PTA-tree. Through analyses and performance experiments, we also compare the PTA-tree with the simple extension of SB-tree that was proposed for temporal aggregation.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.109-120
• /
• 2004

Since the late of 1990, there have been number of studies on the required number of probe vehicles and/or optimal aggregation interval sizes for travel time estimation and forecasting. However, in general one to five minutes are used as aggregation intervals for the travel time estimation intervals for the travel time estimation and/or forecasting of loop detector system without a reasonable validation. The objective of this study is to deveop models for identifying optimal aggregation interval sizes of loop detector data for travel time estimation and prediction. This study developed Cross Valiated Mean Square Error (CVMSE) model for the link and route travel time forecasting, The developed models were applied to the loop detector data of Kyeongbu expressway. It was found that the optimal aggregation sizes for the travel time estimation and forecasting are three to five minutes and ten to twenty minutes, respectively.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2016.11a
• /
• pp.400-401
• /
• 2016

본 논문은 재난 리스크 평가를 위한 집계구 통계자료의 활용방안에 대한 연구를 수행하였다. 인구통계자료, 주택통계자료, 전국사업체 자료는 재난취약성분석과 리스크 평가를 위한 필수 요소이다. 재난의 분석과 평가를 위하여 GIS에 구축하는 자료로는 인구의 총인구, 평균나이, 인구밀도, 노령화지수, 교육수준 등이 있다. 이 자료들을 공간정보로 구축함으로써 기존의 넓은 수준의 데이터를 활용하는 것 보다 정밀한 분석이 가능하다고 판단된다. 또한, 인구와 관련된 데이터뿐만 아니라 집계구 통계 자료는 주택의 건축년도와, 주택의 유형(다세대, 아파트, 연립, 영업용건물주택의 정보를 가지고 있다. 이는 건물의 경제적 평가를 위한 자료로 활용될 것이다. 또한 선정된 지역의 사업체를 분류하여 각 폴리곤의 주요 사업체를 조사하여 공간정보를 구축함. 구축된 공간정보는 리스크 평가를 위한 자료로서 활용될 수 있다 판단된다.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1418-1427
• /
• 1999

시간지원 데이타베이스 시스템은 자료의 과거 및 현재, 그리고 미래의 상태까지 관리함으로써, 사용자에게 시간에 따라 변화하는 자료에 대한 저장 및 질의 수단을 제공한다. 시간지원 데이타베이스는 경향 분석, 버전 관리, 의료 기록 관리 및 비디오 데이타 관리 등과 같이 자료의 시간적 특성이 중요시 되는 모든 분야에 폭 넓게 응용될 수 있다. 시간지원 데이타베이스에서의 집계는 시간 애트리뷰트를 고려하지 않은 기존의 집계와는 큰 차이가 있으며, 기존의 집계 처리 기법을 이용하여 효과적으로 처리될 수 없다. 본 논문에서는 시간지원 집계를 효율적으로 처리하기 위한 새로운 자료 구조인 PA-트리를 제안하고, 이를 이용한 시간지원 집계 처리 기법을 제안한다. 또한 본 논문에서는 제안된 PA-트리를 이용한 기법과 기존의 집계 트리를 이용한 기법의 성능을 최악 경우 분석과 실험을 통해 비교한다.Abstract Temporal databases manage time-evolving data. They provide built-in supports for efficient recording and querying of temporal data. Many application area such as trend analysis, version management, and medical record management have temporal aspects, and temporal databases can handle these temporal aspects efficiently. The aggregate in temporal databases, that is, temporal aggregate is an extension of conventional aggregate on the domain and range of aggregation to include time concept. The basic techniques behind computing aggregates in conventional databases are not efficient when applied to temporal databases. In this paper, we propose a new tree structure for temporal aggregation, called PA-tree, and aggregate processing method based on the PA-tree. We compare the PA-tree with the existing aggregation tree which has been proposed for temporal aggregate.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.04a
• /
• pp.307-315
• /
• 2006

Distributing information on the internet is common in our daily life. In the past, e-mail has been the primary choice of exchanging information. But instant messengers are gaining popularity abroad and domestically because of their immediate responses. Instant messaging has become the fastest growing communication technology in recent years. Instant messaging is effectively a chat room of two people. Users that have accounts with the same provider are able to send messages via computer in real time. Instant messaging has exploded into the business world as companies utilize the technology for everything from interoffice communication to client/customer communication. In this paper, we propose a system design for effective data collection and statistical analysis.

• Proceedings of the Korean Association for Survey Research Conference
• /
• 2007.06a
• /
• pp.61-78
• /
• 2007

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.1
• /
• pp.131-138
• /
• 2006

Recently, data gathering and algorithm developing are in progress for the GIS application using point feature. Several researches prove that verification of the spatial clustering and evaluation of inter-dependencies between event and control are possible. On the other hand, most of the point features as GIS data are gathered by indirect method, such as address geo-coding, rather than by direct method, such as field surveying. Futhermore, lots of statistics by administrative district based on the point features have no coordinates information of the points. In this study, calculating the K-index in GIS environment, to evaluate the effect of aggregation of raw data on K-index, K-indices estimated from raw data (parcel unit), topographically aggregated data (block unit), administratively aggregated data (administrative district unit) are compared and evaluated. As a result, point feature, highly clustered in local area, is largely distorted when aggregated administratively. But, the K-indices of topographically aggregated data is very similar to the K-indices of raw data.

• Journal of Korean Society of Transportation
• /
• v.18 no.3
• /
• pp.55-76
• /
• 2000

We propose a general solution methodology for identifying the optimal aggregation interval sizes as a function of the traffic dynamics and frequency of observations for four cases : i) link travel time estimation, ii) corridor/route travel time estimation, iii) link travel time forecasting. and iv) corridor/route travel time forecasting. We first develop statistical models which define Mean Square Error (MSE) for four different cases and interpret the models from a traffic flow perspective. The emphasis is on i) the tradeoff between the Precision and bias, 2) the difference between estimation and forecasting, and 3) the implication of the correlation between links on the corridor/route travel time estimation and forecasting, We then demonstrate the Proposed models to the real-world travel time data from Houston, Texas which were collected as Part of the Automatic Vehicle Identification (AVI) system of the Houston Transtar system. The best aggregation interval sizes for the link travel time estimation and forecasting were different and the function of the traffic dynamics. For the best aggregation interval sizes for the corridor/route travel time estimation and forecasting, the covariance between links had an important effect.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1671-1679
• /
• 1998

Temporal databases support an efficient hist0rical representation and operation for an object in the real world. Especiallv, temporal aggregates generate In additional by information by means of computations from objects that is valid at past as well as current time. It is one of important areas to serve to users as various type of aggregates as possible so that they enhance the overall system performance and efficiency. In this paper, we not only introduce temporal aggregate tree strategy as an efficient processing technique for given temporal aggregate query, but also analyze the ovemll processing cost and then evaluate its perfomlance.