• Title/Summary/Keyword: 위치정보데이타

Search Result 270, Processing Time 0.021 seconds

A Terrain Data Acquisition for Slope Safety Inspection by Using LiDAR (지상 LiDAR에 의한 사면안전진단용 지형정보 취득)

  • Lee, Jong Chool;Kim, Hee Gyoo;Roh, Tae Ho
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.311-319
    • /
    • 2013
  • As heavy rains occur more frequently due to the recent climate change, slope collapses are increasing, and damage to human life and properties is accordingly increasing every year. The most proper method to take preventive measures against slope collapses is to remove the cause after understanding the cause of slope collapse in advance, and for such, slope safety inspection is implemented for preventive purposes, to investigate the cause, and as a measure for restoration. Thus, this Research was able to reach the following conclusion after utilizing LiDAR, which obtains detailed topographic information in a short period of time with point cloud data on slopes subject to safety inspection. First, as a result of analyzing the errors after installing a check point in the subject area, the RMSE of the horizontal location error appeared to be ${\pm}2.2cm$ and the RMSE of the vertical location error appeared to be ${\pm}3.0cm$, which shows a practically satisfactory result. Second, the economic feasibility was outstanding and obtaining accurate topographic information was available. Third, an area once scanned allowed to accurately obtain an unprescribed cross-sectional diagram in a short period of time, thus, appeared to be convenient for experts to detect dangerous sections.

인터넷을 이용한 육상물류중개시스템 개발에 관한 연구

  • 박남규;최형림;송근곤;박영재;손형수
    • Proceedings of the Korea Database Society Conference
    • /
    • 1999.06a
    • /
    • pp.335-345
    • /
    • 1999
  • 오늘날 날로 증가하는 물류비는 개별 기업은 물론 국가 전체의 수출 경쟁력을 약화시키는 주요 원인으로 지적되고 있다. 그러나 그동안 우리나라에서는 물류비 절감을 위한 종합적이고 체계적인 대책이 이루어지지 못하였다. 특히 본 논문의 연구대상인 육상물류의 경우 그 비중이 전체 화물 운송의 60% 이상을 차지함에도 불구하고 심각한 교통체증 및 물류기반 시설의 미비, 효율적인 정보시스템의 미비 등으로 인하여 물류비가 계속 증가하는 양상을 보여 왔다. 따라서 본 논문에서는 우리나라 육상물류시스템이 안고 있는 문제점의 해결을 위한 방안들 중의 하나로 정보기술의 활용에 관한 내용을 다루고 있다. 즉 영세한 기업들도 누구나 손쉽게 이용할 수 있도록 인터넷을 이용한 육상물류중개시스템의 개발에 관한 내용을 소개하고 있다. 육상물류중개시스템은 복합화물주선업체인 (주) 대형물류와 함께 개발한 시스템으로 인터넷을 통하여 화주의 화물 운송의뢰를 접수받아 이를 여러 운송업체에게 제공해주는 역할을 수행하게 된다. 특히 육상물류중개시스템은 화물의 운송과 관련하여 발생하는 다양한 정보들을 데이터베이스에 저장하여 두었다가 세관을 비롯한 터미날에 대한 각종 신고업무에 이용할 수 있으며, 이밖에도 교통정보 및 화물 위치정보 등 다양한 서비스를 제공해줄 수 있다. 따라서 운송업체의 공차율을 줄이고 화주에게는 자신의 화물에 대한 정보를 실시간으로 전달해 줄 수 있다는 장점이 있다. 또한 이러한 육상물류중개시스템은 현재 개발중인 통합데이터베이스를 기반으로 한 항만물류원스톱서비스 시스템과 연계되어 차후에는 물류원스톱시스템으로 발전할 수 있을 것이다. 연구가 진행되고 있는 인공신경망과의 모형결합을 통해 기존연구와는 다른 새로운 통합예측방법론을 제시하고자 한다. 본 연구에서 제시하는 통합방법론은 크게 2단계 과정을 거쳐 예측모형으로 완성이 된다. 즉, 1차 모형단계에서 원시 재무시계열은 먼저 웨이블릿분석을 통해서 노이즈가 필터링 되는 동시에, 과거 재무시계열의 프랙탈 구조, 즉 비선형적인 움직임을 보다 잘 반영시켜 주는 다차원 주기요소를 가지는 시계열로 분해, 생성되며, 이렇게 주기에 따라 장단기로 분할된 시계열들은 2차 모형단계에서 신경망의 새로운 입력변수로서 사용되어 최종적인 인공 신경망모델을 구축하는 데 반영된다.ocioeconomic impacts are resulted from the program. It would be useful for the means of (ⅰ) fulfillment of public accountability to legitimate the program and to reveal the expenditure of pubic fund, and (ⅱ) managemental and strategical learning to give information necessary to improve the making. program and policy decision making, The objectives of the study are to develop the methodology of modeling the socioeconomic evaluation, and build up the practical socioeconomic ev

  • PDF

Analysis of Groundwater Pollution Potential and Risk using DRASTIC System (DRASTIC SYSTEM을 이용한 지하수 오염 가능성 및 위험 분석 연구)

  • 이사로;김윤종
    • Spatial Information Research
    • /
    • v.4 no.1
    • /
    • pp.1-11
    • /
    • 1996
  • DRASTIC system developed by U.S.EPA, is widely used for assessing groundwater pollution potential The system can be applied to site selection of well or waste disposal, Ianduse planning for groundwater protection, and monitoring. In this study, GIS(Geographic Information System) was established hydrogeological database of DRASTIC system and cartographic modeling to asre:; regional groundwater pollution potential around Chungju Lake. Hydrogeological factors of the system were depth to water, net recharge, aquifer media, soil media, slope and hydraulic conductivity. Risk of groundwater pollution to non -point source pollution, was also analyzed by incorporation of actual pollution sources(N, P) and DRASTIC system. The GIS data could be very quickly analysed hydrogeological characteristics of the study area by graphic user interface programs devel¬oped with AML(ARC Macro Language) of ARC/INFO.

  • PDF

A study on the experimental model of supplementary measures for food safety certification system of GAP (우수농산물 관리제도의 안전성 인증기능 보완을 위한 시험 모형연구)

  • Yoon, Jae-Hak;Ko, Seong-Bo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3384-3389
    • /
    • 2009
  • There are two major problems with current National GAP system. One was false in traceability record because it was written or inputted by farmers or distributers and no other measures to check the accuracy was valid. The other was incapability of tracking back and recalling the contaminated agricultural products. For solving these matters, IT convergence model which combined information technology with agricultural experience is elaborated. In IT convergence model, video analytic system classifies every activity depending on the pre-programmed farming process and create the traceability data automatically. Also real time trace system based on USN would solve the problem of tracking back. This system transmits the present location and monitors data of agricultural products from farm to table at all times.

논제 부정 Access에 대한 Firewall의 과제와 대책

  • 변성준;서정석;최원석
    • Proceedings of the Korea Database Society Conference
    • /
    • 2000.11a
    • /
    • pp.227-238
    • /
    • 2000
  • Firewall은 다양한 부정Access의 방지책으로서 확실히 유효한 수단이지만 이 Firewall은 사용자로부터 지시된 설정을 충실히 실행하는 것으로 설정 오류, 소프트웨어의 정지, 허가된 룰을 악용한 침입 등 반드시 사용자가 바라는 작용을 무조건적 상태에서 보증해 주는 것은 아니다. 따라서 사용자는 도입 후 에도 운용시에 Access log를 감시하고 본래의 Security Policy에 반하는 행위를 매일 매일 체크하지 않으면 안될 상황에 처해 있다. 본 연구는 이러한 부정Access에 대한 이와 같은 Firewall의 현상에 대한 과제 중에서 "부정Access를 어떻게 하면 일찍, 정확히 체크할 수 있는가\ulcorner"라는 주제를 선택하여 Firewall의 한계와 그 대응책을 실제로 부정Access를 시험해 보는 것으로 검증하기로 하였다. 실험결과에서 (1)Port Scan이나 전자메일 폭탄(서비스정지공격)등은 Firewall로 방지하는 것은 불가능하거나 혹은 Checking이 곤란하다. (2)공격마다 로그 수집을 했음에도 관계없이 Firewall의 로그는 번잡하므로 단시간에 사태의 발견이 대단히 곤란하다고 하는 Firewall의 한계를 인식하였다. 그리고 그 대책으로서 우리는 체크 툴의 유효성에 착안하여 조사한 결과, 결국 무엇이 부정Access인가에 대해서는 어디까지나 이용하는 측이 판단하여 Firewall 상에 설정하지 않으면 안되지만 체크 툴은 이 부정Access 정보를 데이터베이스로서 갖고 있음으로써 '무엇이 부정Access인가'를 이용자 대신에 판단하고 툴에 따라서는 설정을 자동적으로 변경하여 부정 Access의 저지율을 향상시킨다. 이처럼 체크 툴은 Firewall의 수비능력을 보강하는 위치에 있다고 생각할 수 있다.다. 4 장에서는 3장에서 제기한 각각의 문제점에 대해 RAD 의 관점에 비추어 e-business 시스템의 단기개발을 실현하기 위한 고려사항이나 조건 해결책을 제안한다. 본 논문이 지금부터 e-business 를 시작하려고 하는 분, e-business 시스템의 개발을 시작하려고 하는 분께 단기간의 e-business 실현을 위한 하나의 지침이 된다면 다행이겠다.formable template is used to optimize the matching. Then, clustering the similar shapes by the distance between each centroid, papaya can be completely detected from the background.uage ("Association of research for algorithm of calculating machine (1992)"). As a result, conventional NN and CNN were available for interpolation of sampling data. Moreover, when nonlinear intensity is not so large under the field condition of small slope, interpolation performance of CNN was a little not so better than NN. However, when nonlinear intensity is large under the field condition of large slope, interpolation performance of CNN was relatively better than NN.콩과 자연 콩이 성분 분석에서 차이를

  • PDF

X-TOP: Design and Implementation of TopicMaps Platform for Ontology Construction on Legacy Systems (X-TOP: 레거시 시스템상에서 온톨로지 구축을 위한 토픽맵 플랫폼의 설계와 구현)

  • Park, Yeo-Sam;Chang, Ok-Bae;Han, Sung-Kook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.130-142
    • /
    • 2008
  • Different from other ontology languages, TopicMap is capable of integrating numerous amount of heterogenous information resources using the locational information without any information transformation. Although many conventional editors have been developed for topic maps, they are standalone-type only for writing XTM documents. As a result, these tools request too much time for handling large-scale data and provoke practical problems to integrate with legacy systems which are mostly based on relational database. In this paper, we model a large-scale topic map structure based on XTM 1.0 into RDB structure to minimize the processing time and build up the ontology in legacy systems. We implement a topic map platform called X-TOP that can enhance the efficiency of ontology construction and provide interoperability between XTM documents and database. Moreover, we can use conventional SQL tools and other application development tools for topic map construction in X-TOP. The X-TOP is implemented to have 3-tier architecture to support flexible user interfaces and diverse DBMS. This paper shows the usability of X-TOP by means of the comparison with conventional tools and the application to healthcare cancer ontology management.

An Algorithm for Spot Addressing in Microarray using Regular Grid Structure Searching (균일 격자 구조 탐색을 이용한 마이크로어레이 반점 주소 결정 알고리즘)

  • 진희정;조환규
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.9
    • /
    • pp.514-526
    • /
    • 2004
  • Microarray is a new technique for gene expression experiment, which has gained biologist's attention for recent years. This technology enables us to obtain hundreds and thousands of expression of gene or genotype at once using microarray Since it requires manual work to analyze patterns of gene expression, we want to develop an effective and automated tools to analyze microarray image. However it is difficult to analyze DNA chip images automatically due to several problems such as the variation of spot position, the irregularity of spot shape and size, and sample contamination. Especially, one of the most difficult problems in microarray analysis is the block and spot addressing, which is performed by manual or semi automated work in all the commercial tools. In this paper we propose a new algorithm to address the position of spot and block using a new concept of regular structure grid searching. In our algorithm, first we construct maximal I-regular sequences from the set of input points. Secondly we calculate the rotational angle and unit distance. Finally, we construct I-regularity graph by allowing pseudo points and then we compute the spot/block address using this graph. Experiment results showed that our algorithm is highly robust and reliable. Supplement information is available on http://jade.cs.pusan.ac.kr/~autogrid.

A Scalable Resource-Lookup Protocol for Internet File System Considering the Computing Power of a Peer (피어의 컴퓨팅 능력을 고려한 인터넷 파일 시스템을 위한 확장성 있는 자원 탐색 프로토콜 설계)

  • Jung Il-dong;You Young-ho;Lee Jong-hwan;Kim Kyongsok
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.89-99
    • /
    • 2005
  • Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

An Efficient and Secure Handover Mechanism for MVPN Services (MVPN 서비스 제공을 위한 효율적이고 안전한 핸드오버 메커니즘)

  • Woo, Hyun-Je;Kim, Kyoung-Min;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.62-72
    • /
    • 2007
  • Mobile Virtual Private Network (MVPN) provides VPN services without geographical restriction to mobile workers using mobile devices. Coexistence of Mobile IP (MIP) protocol for mobility and IPsec-based VPN technology are necessary in order to provide continuous VPN service to mobile users. However, Problems like registration failure or frequent IPsec tunnel re-negotiation occur when IPsec-based VPN Gateway (GW) and MIP are used together. In order to solve these problems, IETF proposes a mechanism which uses external home agent (x-HA) located external to the corporate VPN GW. In addition, based on the IETF proposal, a mechanism that assigns x-HA dynamically in the networks where MN is currently located was also proposed with the purpose to reduce handover latency as well as end-to-end delay. However, this mechanism has problems such as exposure of a session key for dynamic Mobility Security Association (MSA) or a long latency in case of the handover between different networks. In this paper, we propose a new MVPN protocol in order to minimize handover latency, enhance the security in key exchange, and to reduce data losses cause by handover. Through a course of simulation, the performance of proposed protocol is compared with the existing mechanism.

A New Similarity Measure for Categorical Attribute-Based Clustering (범주형 속성 기반 군집화를 위한 새로운 유사 측도)

  • Kim, Min;Jeon, Joo-Hyuk;Woo, Kyung-Gu;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.37 no.2
    • /
    • pp.71-81
    • /
    • 2010
  • The problem of finding clusters is widely used in numerous applications, such as pattern recognition, image analysis, market analysis. The important factors that decide cluster quality are the similarity measure and the number of attributes. Similarity measures should be defined with respect to the data types. Existing similarity measures are well applicable to numerical attribute values. However, those measures do not work well when the data is described by categorical attributes, that is, when no inherent similarity measure between values. In high dimensional spaces, conventional clustering algorithms tend to break down because of sparsity of data points. To overcome this difficulty, a subspace clustering approach has been proposed. It is based on the observation that different clusters may exist in different subspaces. In this paper, we propose a new similarity measure for clustering of high dimensional categorical data. The measure is defined based on the fact that a good clustering is one where each cluster should have certain information that can distinguish it with other clusters. We also try to capture on the attribute dependencies. This study is meaningful because there has been no method to use both of them. Experimental results on real datasets show clusters obtained by our proposed similarity measure are good enough with respect to clustering accuracy.