• Title/Summary/Keyword: 수집시간

Search Result 3,472, Processing Time 0.032 seconds

A Study on Application of Autonomous Traffic Information Based on Artificial Intelligence (인공지능 기반의 자율형 교통정보 응용에 대한 연구)

  • Oh, Am-Suk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.6
    • /
    • pp.827-833
    • /
    • 2022
  • This study aims to prevent secondary traffic accidents with high severity by overcoming the limitations of existing traffic information collection systems through analysis of traffic information collection detectors and various algorithms used to detect unexpected situations. In other words, this study is meaningful present that analyzing the 'unexpected situation that causes secondary traffic accidents' and 'Existing traffic information collection system' accordingly presenting a solution that can preemptively prevent secondary traffic accidents, intelligent traffic information collection system that enables accurate information collection on all sections of the road. As a result of the experiment, the reliability of data transmission reached 97% based on 95%, the data transmission speed averaged 209ms based on 1000ms, and the network failover time achieved targets of 50sec based on 120sec.

데이터 웨어하우스 - 대형컴퓨터 업체들의 주력시장으로 '급부상'

  • Korea Database Promotion Center
    • Digital Contents
    • /
    • no.6 s.49
    • /
    • pp.7-8
    • /
    • 1997
  • 데이터를 단순히 수집하고 보관한다는 차원이 아니라 이를 가공, 활용한다는 측면을 강조한 것이 데이터 웨어하우스 개념이다. 한국IBM, 한국디지탈, 한국NCR, 한국유니시스 등 대형컴퓨터 제조업체들은 자사의 엔터프라이즈급 서버를 근간으로 한 데이터 웨어하우스 솔루션을 주력사업으로 내세우며, 현재 유통, 금융, 통신시장으로 파고들고 있다. 그러나 데이터 웨어하우스를 구축하기 위해서는 적지않은 비용이 들기 때문에 시장이 만개되기 위해서는 다소 시간이 걸릴 것으로 전망된다.

  • PDF

과학리포트 - 첨단첩보장치의 위력

  • Korean Federation of Science and Technology Societies
    • The Science & Technology
    • /
    • v.29 no.5 s.324
    • /
    • pp.18-19
    • /
    • 1996
  • 북한이 판문점에 중화력 병력을 잇달아 투입해 긴장이 고조되고 있는 우리 한반도. 한미연합사는 대북정보감시체제를 워치콘2로 격상시켰다고 한다. 북한이 전면적을 계획할 경우 48~72시간 전에 이를 알아낼 수 있다는데 이처럼 치밀한 정보수집수단은 어떤 것일까.

  • PDF

과학기술정보체계

  • Korean Federation of Science and Technology Societies
    • The Science & Technology
    • /
    • v.30 no.12 s.343
    • /
    • pp.43-66
    • /
    • 1997
  • 과학을 창달하고 기술을 혁신해가는데 있어서 과학기술정보체계의 확립은 무엇보다 중요한 일로 지적되고 있다. 정보를 수집하기 위해서 총 연구개발비의 50%, 기간의 60%를 할애해야 할 정도이다. 과학기술정보체계 확립은 바로 이같은 비용과 시간을 줄이는 지름길이기도 하다. 과학기술정보체계의 역할과 현황에서 발전전략을 관련전문가로부터 알아보았다.

  • PDF

전진하는 산하단체의 소식

  • Korean Federation of Science and Technology Societies
    • The Science & Technology
    • /
    • v.1 no.1 s.1
    • /
    • pp.95-106
    • /
    • 1968
  • 본란은 산하 각학회(협회)간의 제반 소식을 전하기 위하여 ①활동상황 ②주요사업계획 ③사업실적 ④학회동정 ⑤건의사항 ⑥학회육성에 대한 고견 ⑦기타 등의 자세한 소식을 받아 실어 볼 계획 이였으나 수집된 자료의 불충분과 시간적인 공간이 계획에 차질이 있었고 사무실이전 기타 연합회사정으로 부득이 양해를 구하며 자료를 제출해주신 학회(협회)만의 소식을 전해드립니다. (도착순)

  • PDF

Comparison of Performance Between Incremental and Batch Learning Method for Information Analysis of Cyber Surveillance and Reconnaissance (사이버 감시정찰의 정보 분석에 적용되는 점진적 학습 방법과 일괄 학습 방법의 성능 비교)

  • Shin, Gyeong-Il;Yooun, Hosang;Shin, DongIl;Shin, DongKyoo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.3
    • /
    • pp.99-106
    • /
    • 2018
  • In the process of acquiring information through the cyber ISR (Intelligence Surveillance Reconnaissance) and research into the agent to help decision-making, periodic communication between the C&C (Command and Control) server and the agent may not be possible. In this case, we have studied how to effectively surveillance and reconnaissance. Due to the network configuration, agents planted on infiltrated computers can not communicate seamlessly with C&C servers. In this case, the agent continues to collect data continuously, and in order to analyze the collected data within a short time in When communication is possible with the C&C server, it can utilize limited resources and time to continue its mission without being discovered. This research shows the superiority of incremental learning method over batch method through experiments. At an experiment with the restricted memory of 500 mega bytes, incremental learning method shows 10 times decrease in learning time. But at an experiment with the reuse of incorrectly classified data, the required time for relearn takes twice more.

A proposal on a proactive crawling approach with analysis of state-of-the-art web crawling algorithms (최신 웹 크롤링 알고리즘 분석 및 선제적인 크롤링 기법 제안)

  • Na, Chul-Won;On, Byung-Won
    • Journal of Internet Computing and Services
    • /
    • v.20 no.3
    • /
    • pp.43-59
    • /
    • 2019
  • Today, with the spread of smartphones and the development of social networking services, structured and unstructured big data have stored exponentially. If we analyze them well, we will get useful information to be able to predict data for the future. Large amounts of data need to be collected first in order to analyze big data. The web is repository where these data are most stored. However, because the data size is large, there are also many data that have information that is not needed as much as there are data that have useful information. This has made it important to collect data efficiently, where data with unnecessary information is filtered and only collected data with useful information. Web crawlers cannot download all pages due to some constraints such as network bandwidth, operational time, and data storage. This is why we should avoid visiting many pages that are not relevant to what we want and download only important pages as soon as possible. This paper seeks to help resolve the above issues. First, We introduce basic web-crawling algorithms. For each algorithm, the time-complexity and pros and cons are described, and compared and analyzed. Next, we introduce the state-of-the-art web crawling algorithms that have improved the shortcomings of the basic web crawling algorithms. In addition, recent research trends show that the web crawling algorithms with special purposes such as collecting sentiment words are actively studied. We will one of the introduce Sentiment-aware web crawling techniques that is a proactive web crawling technique as a study of web crawling algorithms with special purpose. The result showed that the larger the data are, the higher the performance is and the more space is saved.

Traffic Signal Control Algorithm for Isolated Intersections Based on Travel Time (독립교차로의 통행시간 기반 신호제어 알고리즘)

  • Jeong, Youngje;Park, Sang Sup;Kim, Youngchan
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.6
    • /
    • pp.71-80
    • /
    • 2012
  • This research suggested a real-time traffic signal control algorithm using individual vehicle travel times on an isolated signal intersection. To collect IDs and passing times from individual vehicles, space-based surveillance systems such as DSRC were adopted. This research developed models to estimate arrival flow rates, delays, and the change rate in delay, by using individual vehicle's travel time data. This real-time signal control algorithm could determine optimal traffic signal timings that minimize intersection delay, based on a linear programming. A micro simulation analysis using CORSIM and RUN TIME EXTENSION verified saturated intersection conditions, and determined the optimal traffic signal timings that minimize intersection delay. In addition, the performance of algorithm varying according to market penetration was examined. In spite of limited results from a specific scenario, this algorithm turned out to be effective as long as the probe rate exceeds 40 percent. Recently, space-based traffic surveillance systems are being installed by various projects, such as Hi-pass, Advanced Transportation Management System (ATMS) and Urban Transportation Information System (UTIS) in Korea. This research has an important significance in that the propose algorithm is a new methodology that accepts the space-based traffic surveillance system in real-time signal operations.

Development of Path Travel Time Distribution Estimation Algorism (경로통행시간 분포비율 추정 알고리즘 개발)

  • Lee, Young-Woo
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.6 s.84
    • /
    • pp.19-30
    • /
    • 2005
  • The objective of this research is to keep track of path travel time using methods of collecting traffic data. Users of traffic information are looking for extensive information on path travel time, which is referred to as the time taken for traveling from the origin to the destination. However, all the information available is the average path travel times, which is a simple sum of the average link travel times. The average path travel time services are not up to the expectation of traffic information consumers. To improve provide more accurate path travel time services, this research makes a number of different estimates of various path travel times on one path, assuming it will be under the same condition, and provides a range of estimates with their probabilities to the consumers, who are looking for detailed information. To estimate the distribution of the path travel times as a combination of link travel times. this research analyzes the relation between the link travel time and path travel time. Based on the result of the estimation. this research develops the algorithm that combines the distribution of link travel time and estimates the path travel time based on the link travel times. This algorithm was tested and proven to be highly reliable for estimating the path traffic time.

Modeling on Daily Traffic Volume of Local State Road Using Circular Mixture Distributions (혼합원형분포를 이용한 지방국도의 시간교통량 추정모형)

  • Na, Jong-Hwa;Jang, Young-Mi
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.3
    • /
    • pp.547-557
    • /
    • 2011
  • In this paper we developed a statistical model for traffic volume data which collected from a spot of specific local state road. One peculiar property of daily traffic data is that it has bimodal shape which have two peaks on times of both going to office and coming back to home. So, various mixture models of circular distribution are suggested for bimodal traffic data and EM algorithms are applied to estimate the parameters of the suggested models. To compare the accuracy of the suggested models, classical regressions with dummy variables are also considered. The suggested models for traffic volumn data can be effectively used to estimate missing values due to measuring instrument disorder.