• Title/Summary/Keyword: 공간 네트워크데이터베이스

Search Result 127, Processing Time 0.021 seconds

Field Mapping based on Virtual Office for Real time GIS in Field Survey for Natural Environment (자연환경조사에서 실시간 GIS구현을 위한 가상사무실 기반의 필드멥핑)

  • 엄정섭;김희두
    • Spatial Information Research
    • /
    • v.9 no.1
    • /
    • pp.51-72
    • /
    • 2001
  • It is frequently pointed out that the conventional field survey for natural environment has may limitations in terms of positional accuracy, real-time GIS data acquisition, and economic efficiency. The aim of this research was to develop an on site real-time mapping technique that enables the surveyor to input data in the field. The idea is based upon the recent trends in the field of Telecommunication and Information Technology that uses a GPS, wireless network computing, moving computing, etc. A virtual office approach has been adopted, in which a portable computer is linked to a GPS and field workers record data on the computer at the site and analyse data on site. This field mapping system has shown to be much less susceptible to the positional accuracy than that of th conventional approach. The Graphic User Interface, in particular, were ideally suited to combining positional information with attribute data which changes with every survey points. This interface allows users to interactively display and query GIS layers reproduced from the past survey results. The GIS database stored in the virtual office will serve to carry out a highly reliable survey since it could play a crucial role in identifying temporal and spatial changes occurred in the site. It is expected that integrated utilization of field data among the related agencies would be increased much more than before since the virtual office survey would be a powerful tool to ensure geometric fidelity in GIS database creation process. This paper also discusses the limitations and future direction of the present prototype research.

  • PDF

Differential Multi-view Video Coding using View Interpolation (시점 보간법을 이용한 차분 다시점 비디오 부호화 방법)

  • Lee, Sang-Beom;Kim, Jun-Yup;Ho, Yo-Sung;Choi, Byeong-Ho
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.29-32
    • /
    • 2005
  • 3차원 비디오는 차세대 정보 통신 서비스 분야의 하나로, 사용자에게 시각적으로 고차원적인 서비스를 제공하는 것을 목적으로 한다. 이 가운데 다시점 비디오는 같은 시간, 여러 시점에서 영상 정보를 획득하여 사용자에게 원하는 시점의 영상 정보를 제공하는 3차원 비디오이며, 현재 방송 관련 연구 기관에서 차세대 실감방송 멀티미디어 서비스 개발을 목적으로 하는 연구가 활발히 진행되고 있다. 최근 MPEG 표준화 그룹에서는 다시점 비디오 부호화 (multi-view video coding, MVC) 방법에 관한 표준화 작업이 진행 중이며, 최신 비디오 압축 표준인 H.264를 이용한 여러 가지 방법들이 제안되었다. 현재 MVC 표준화 작업의 평가 기준이 되는 방법은 각 시점을 H.264로 부호화하는 방법인데, 이는 다시점 비디오 영상의 중요한 특성인 인접시점들 사이의 공간적 상관도를 전혀 고려하지 않았다. 본 논문에서는 시점 보간법을 이용하여 얻어진 중간 영상과 원영상과의 차분 영상을 부호화하는 알고리즘을 제안하고자 한다. 여기서 시점 보간법이란 좌우 두 시점 영상으로부터 변이값을 얻은 다음, 이를 이용하여 중간 시점 영상을 합성하는 방법을 말한다. 예를 들면,다시점 비디오의 홀수 번째 시점의 영상은 기존의 방법을 따르고, 짝수 번째 시점의 영상은 이미 부호화된 홀수 번째 시점의 영상을 이용하여 보간적으로 예측하여 원래 영상과 차분 영상을 구하여 부호화한다. 차분 영상은 영상의 복잡도가 많이 감소되어 원영상에 비해 보다 나은 부호화 효율을 보인다. 그러나 합성 영상이 각 장면마다 독립적으로 생성되므로 원영상에 비해 차분 영상의 시간적인 상관도가 줄어들어 I장면의 경우 부호화 효율이 크게 향상되었으나, 시간적인 상관도를 이용하는 P장면과 B장면에서는 오히려 좋지 않은 결과를 보였다. 통계는 전 국민에 대한 패널자료이기 때문에 통계적 활용의 범위가 방대하다. 특히 개인, 가구, 사업체 등 사회 활동의 주체들이 어떻게 변화하는지를 추적할 수 있는 자료를 생산함으로써 다양한 인과적 통계분석을 할 수 있다. 행정자료를 활용한 인구센서스의 이러한 특징은 국가의 교육정책, 노동정책, 복지정책 등 다양한 정책을 정확한 자료를 근거로 수립할 수 있는 기반을 제공한다(Gaasemyr, 1999). 이와 더불어 행정자료 기반의 인구센서스는 비용이 적게 드는 장점이 있다. 예를 들어 덴마크나 핀란드에서는 조사로 자료를 생산하던 때의 1/20 정도 비용으로 행정자료로 인구센서스의 모든 자료를 생산하고 있다. 특히, 최근 모든 행정자료들이 정보통신기술에 의해 데이터베이스 형태로 바뀌고, 인터넷을 근간으로 한 컴퓨터네트워크가 발달함에 따라 각 부처별로 행정을 위해 축적한 자료를 정보통신기술로 연계${cdot}$통합하면 막대한 조사비용을 들이지 않더라도 인구센서스자료를 적은 비용으로 생산할 수 있는 근간이 마련되었다. 이렇듯 행정자료 기반의 인구센서스가 많은 장점을 가졌지만, 그렇다고 모든 국가가 당장 행정자료로 인구센서스를 대체할 수 있는 것은 아니다. 행정자료로 인구센서스통계를 생산하기 위해서는 각 행정부서별로 사용하는 행정자료들을 연계${cdot}$통합할 수 있도록 국가사회전반에 걸쳐 행정 체제가 갖추어져야 하기 때문이다. 특히 모든 국민 개개인에 관한 기본정보, 개인들이 거주하며 생활하는 단위인 개별 주거단위에 관한 정보가 행정부에 등록되어 있고, 잘 정비되어 있어야 하며, 정보의 형태 또한 서로 연계가 가능하도록 표준화되어있어야 한다. 이와 더불어, 현재 인구센서스에서 표본조사를 통해 부가적으로 생산하는 경제활동통계를 생산하기 위해서는 개인이

  • PDF

Development of RFID for Automatic Radiopharmaceuticals Preparation System (방사성 의약품 자동합성 장치용 RFID 시스템의 개발)

  • Kim, Myung-Sik;Kim, Kwang-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5C
    • /
    • pp.429-436
    • /
    • 2012
  • In this paper, an RFID system for the automatic preparation system of positron emission tomography (PET) radiopharmaceuticals is developed. Since the preparation system uses radioactive isotope, the preparation system is generally placed in lead-shielded hot-cell. Disposable cassettes including tubes and valves are used in the preparation system, since they are easily contaminated by radioactivity during preparation of radiopharmaceuticals. Currently, a system for preventing re-use of the cassette and managing the information about the preparation precess and result independently from the PC which control the preparation system is highly required for preventing danger from the radiation accident. Since RFID can store and re-write relatively large amount of information, it is suitable for the purpose. However, it is hard to read multiple cassettes' information using antennas installed on the metallic surfaces with current RFID systems. For the problem, we improve RFID system in two directions. First, the interface of the RFID reader is changed then it is possible that multiple readers can be daisy-chained. Also, antenna is tuned while inserting in a metallic coated antenna case, then the effect from the metallic surface of the preparation system is minimized. The test result using the developed system shows that the developed RFID system can read multiple tags using the antennas which are attached on the metallic surface.

Design and Implementation of a SQL based Moving Object Query Process System for Controling Transportation Vehicle (물류 차량 관제를 위한 SQL 기반 이동 객체 질의 처리 시스템의 설계 및 구현)

  • Jung, Young-Jin;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.12D no.5 s.101
    • /
    • pp.699-708
    • /
    • 2005
  • It becomes easy and generalized to track the cellular phone users and vehicles according to the Progress of wireless telecommunication, the spread of network, and the miniaturization of terminal devices. It has been constantly studied to provide location based services to furnish suitable services depending on the positions of customers. Various vehicle tracking and management systems are developed to utilize and manage the vehicle locations to relieve the congestion of traffic and to smooth transportation. However the designed previous work can not evaluated in real world, because most of previous work is only designed not implemented and it is developed for simple model to handle a point, a line, a polygon object. Therefore, we design a moving object query language and implement a vehicle management system to search the positions and trajectories of vehicles and to analyze the cost of transportation effectively. The designed query language based on a SQL can be utilized to get the trajectories between two specific places, the departure time, the arrival time of vehicles, and the predicted uncertainty positions, etc. In addition, the proposed moving object query language for managing transportation vehicles is useful to analyze the cost of trajectories in a variety of moving object management system containing transportation.

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.

Multi-dimensional Security Threats and Holistic Security - Understanding of fusion-phenomenon of national security and criminal justice in post-modern society - (다차원 안보위협과 융합 안보)

  • Yun, Min-Woo;Kim, Eun-Young
    • Korean Security Journal
    • /
    • no.31
    • /
    • pp.157-185
    • /
    • 2012
  • Today, the emergence of cyberspace and advancement of globalization caused not only the transformation of our productive and conventional life but also the revolutionary transition of use of destructive violence such as crime and warfare. This transition of environmental condition connects various security threats which separatedly existed in individual, local, national, and global levels in the past, and transformed the mechanical sum of all levels of security threats into the organic sum of multi-dimensional security threats. This article proposes that the sum of multi-dimensional security threats is caused by the interconnectivity of various different levels of security threats and the integrated interdisciplinary perspective is essential to properly understand the fundamental existence of today's security problem and the reality of fear that we face today. The holistic security, the concept proposed here, is to suggest the mode of networked response to multi-dimensional security threats. The holistic security is suggested to overcome the conventional divisional approach based on the principle of "division of labor" and bureaucratic principles, which means more concretely that national security and criminal justice are divided and intelligence, military, police, prosecution, fire-fighting, private security, and etc. are strictly separated into its own expertise and turf. Also, this article introduces integrated security approaches tried by international organization and major countries overseas with the respect of the holistic security. The author have spent some substantial experience of participant observation, meetings, seminar, conference, and expert interviews regarding the issues discussed in the article in various countries including the United States, Russia, Austria, Germany, Canada, Mexico, Israel, and Uzbekistan for the last ten years. Intelligence and information on various levels of security threats and security approaches introduced in this paper is obtained from such opportunities.

  • PDF

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.