• Title/Summary/Keyword: Address Data

Search Result 2,338, Processing Time 0.027 seconds

A Study on the Algorithm of Address Symmetric using Cadastral Map (지적도를 이용한 주소정제 알고리즘 연구)

  • Yoon, Hun-Joo;Ryu, Jung-Hee;Kim, So-Hee;Kim, Hyun-Jong;Jeong, Jong-Chul
    • 한국지형공간정보학회:학술대회논문집
    • /
    • 2004.10a
    • /
    • pp.147-154
    • /
    • 2004
  • The purpose of this study is to create address standardization through an Algorithm based on cadastral maps, as well as to establish a method of transforming one information area to all of the domestic areas in relation to the geographic information system. To do this, it analyzed the current level of e-government cadastral data and their integration strategy with addresses of both the administrator and the cadastral data. By doing this it is be able to suggest an application method for the Algorithm. The algorithm proposed from this study have a built-in GUI and correlate addresses between the administration and the cadastral map, it can analyze matching success rates. This study is to provide a more efficient method for co-operative work between private sector and public sector. In addition, we can expect that the information strategy of local government will become more active.

  • PDF

Combination Key Generation Scheme Robust to Updates of Personal Information (결합키 생성항목의 갱신에 강건한 결합키 생성 기법)

  • Jang, Hobin;Noh, Geontae;Jeong, Ik Rae;Chun, Ji Young
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.5
    • /
    • pp.915-932
    • /
    • 2022
  • According to the Personal Information Protection Act and Pseudonymization Guidelines, the mapping is processed to the hash value of the combination key generation items including Salt value when different combination applicants wish to combine. Example of combination key generation items may include personal information like name, phone number, date of birth, address, and so on. Also, due to the properties of the hash functions, when different applicants store their items in exactly the same form, the combination can proceed without any problems. However, this method is vulnerable to combination in scenarios such as address changing and renaming, which occur due to different database update times of combination applicants. Therefore, we propose a privacy preserving combination key generation scheme robust to updates of items used to generate combination key even in scenarios such as address changing and renaming, based on the thresholds through probabilistic record linkage, and it can contribute to the development of domestic Big Data and Artificial Intelligence business.

A High-speed IP Address Lookup Architecture using Adaptive Multiple Hashing and Prefix Grouping (적응적인 복수 해슁과 프리픽스그룹화를 이용한 고속 IP 주소 검색 구조)

  • Park Hyun-Tae;Moon Byung-In;Kang Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.137-146
    • /
    • 2006
  • IP address lookup has become a major bottleneck of packet forwarding and a critical issue for high-speed networking techniques in routers. In this paper, we propose an efficient high-speed IP address lookup scheme using adaptive multiple hashing and prefix grouping. According to our analysis results based on routing data distributions, we grouped prefix lengths and selected the number of hash functions in each group adaptively. As a result, we can reduce collisions caused by hashing. Accordingly, a forwarding table of our scheme has good memory efficiency, and thus is organized with the proper number of memory modules. Also, the proposed scheme has the fast building and searching mechanisms to develop the forwarding table only during a single memory access.

Analysis of Plantar Foot Pressure During Golf Swing Motion of Pro & Amateur Golfer (프로와 아마추어 골퍼의 골프스윙 동작시 족저압력 비교 분석)

  • Lee, Joong-Sook;Lee, Dong-Ki
    • Korean Journal of Applied Biomechanics
    • /
    • v.15 no.2
    • /
    • pp.41-55
    • /
    • 2005
  • In this study, weight carrying pattern analysis and comparison method of four foot region were suggested. We used three types of club(driver, iron7, pitching wedge). This analysis method can compare between top class golfer and beginner. And the comparison data can be used to correct the swing pose of trainee. If motion analysis system, which can measure the swing speed and instantaneous acceleration at the point of hitting a ball, is combined with this plantar foot force analysis method, new design development of golf shoes to increase comfort and ball flight distance will be available. 1. Regional change of force acting, in address, is evenly distributed on both feet. In back swing top, 76% on right foot, 75% on left foot as impact, and 86% on left foot as finish. As regional force acting, in address, pros get high marks on rare and inside of right foot and rare and outside for amateurs. In back swing top, it is higher as fore and inside of left foot, pros as rare part of right foot and amateurs as forefoot. In impact, it is higher for pros and amateurs in outside and rare part of left foot and fore and inside of right foot. In finish, for both pros and amateurs, it is higher for outside and rare parts of left foot. 2. For each club, forces are evenly distributed on both feet in address. In back swing top, the shorter a club is, the higher impact on right foot and the higher finish distribution on left foot. For all the clubs used, in each region, pros get higher on rare and inside of right foot and as amateurs on rare and outside of left foot in address. In back swing top, for all clubs, pros get higher on rare and outside of right foot as fore and outside for amateurs. In impact acting, for all clubs, rare and outside of left foot get higher. In finish, force concentrates on rarefoot. 3. On both feet force, right foot forces of amateurs is higher than those of pros in back swing top. In impact and finish, pros get higher on left foot.

Intelligent Lighting Development having Auto-Address in DMX512 Protocol (DMX512 프로토콜에서 자동주소를 갖는 지능형 조명 단말기 개발)

  • Choi, Seong-Cheol;Lee, Won-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.4
    • /
    • pp.1233-1238
    • /
    • 2010
  • The lighting industry has become the bigger and more systemized using the semiconductor LED with each control R(Red), G(Green), B(Blue). The communication standard DMX512(ANSI E1.11) protocol of it basically needs the address which can be distinguished between the lighting terminals. The conventional method has to give the address of the lighting any methods like dip switch, EEROM and PROM. Then the lighting terminal can receive RGB data from DMX512 communication. According to electrical characteristics DMX512 protocol has to the splitter every 32 lighting terminals. If 512 lightings is all connected, maximum 16 splitters are needed. This paper is solved above weakness in DMX512 protocol using serial connection all lighting terminals. Also I developed the intelligent lighting terminal with auto-addressing. This was solved the inconvenience of the address assignment and the usage of the splitter. The developed products is applied and selled the semiconductor lighting terminals using ON-OFF control, dimming control, sequential control and rainbow control.

Efficient Bloom Filter Based Destination Address Monitoring Scheme for DDoS Attack Detection (DDoS 공격 탐지를 위한 확장된 블룸 필터 기반의 효율적인 목적지 주소 모니터링 기법)

  • Yoo, Kyoung-Min;Sim, Sang-Heon;Han, Kyeong-Eun;So, Won-Ho;Kim, Young-Sun;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3B
    • /
    • pp.152-158
    • /
    • 2008
  • Recently, DDoS (Distributed Denial of Service) attack has emerged as one of the major threats and it's main characteristic is to send flood of data packets toward a specific victim. Thus, several attack detection schemes which monitor the destination IP address of packets have been suggested. The existing Bloom Filter based attack detection scheme is simple and can support real-time monitoring. However, since this scheme monitors the separate fields of destination IP address independently, wrong detection is comparatively high. In this paper, in order to solve this drawback, an efficient Bloom Filter based destination address monitoring scheme is proposed, which monitors not only separate fields but also relationship among separate fields. In the results of simulation, the proposed monitoring scheme outperforms the existing Bloom Filter based detection scheme. Also, to improve the correctness of detection, multi-layerd structure is proposed and the correctness of result is improved according to the number of layers and extra tables.

Optimized Binary-Search-on- Range Architecture for IP Address Lookup (IP 주소 검색을 위한 최적화된 영역분할 이진검색 구조)

  • Park, Kyong-Hye;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1103-1111
    • /
    • 2008
  • Internet routers forward an incoming packet to an output port toward its final destination through IP address lookup. Since each incoming packet should be forwarded in wire-speed, it is essential to provide the high-speed search performance. In this paper, IP address lookup algorithms using binary search are studied. Most of the binary search algorithms do not provide a balanced search, and hence the required number of memory access is excessive so that the search performance is poor. On the other hand, binary-search-on-range algorithm provides high-speed search performance, but it requires a large amount of memory. This paper shows an optimized binary-search-on-range structure which reduces the memory requirement by deleting unnecessary entries and an entry field. By this optimization, it is shown that the binary-search-on-range can be performed in a routing table with a similar or lesser number of entries than the number of prefixes. Using real backbone routing data, the optimized structure is compared with the original binary-search-on-range algorithm in terms of search performance. The performance comparison with various binary search algorithms is also provided.

Kinematic Analysis of Secondary School Golf Player's Putting Stroke Motion (중등학생 골프선수의 퍼팅 스트로크 동작에 대한 운동학적 분석)

  • Ko, Jae-Yeon;Oh, Cheong-Hwan
    • Korean Journal of Applied Biomechanics
    • /
    • v.20 no.4
    • /
    • pp.447-455
    • /
    • 2010
  • The objective of this study was to analyze the difference in kinematic variables for successful and unsuccessful golf putting strokes. The study population included 8 male secondary school golf players who had played golf for over 3 years and whose handicap was 4 or lower. A hole was made on a 5-m-long artificial flat mat for practice, and an environment similar to that of a real green was created. The participants' motions were analyzed through 3D image analysis, and the difference in kinematic variables for successful and unsuccessful putting strokes in the same direction was determined. Data analysis revealed the following findings: The time spent for a segment of putting was the greatest for the backswing segment for both successful and unsuccessful strokes. During address and impact, the both changed to a larger extent. For successful putting strokes, the change in the elbow angle during the downswing was greater for the right elbow than for the left elbow. For both successful and unsuccessful putting strokes, the left shoulder angle increased during the segment from address to the turning point and decreased during the segment from the turning point to impact. In contrast, the right shoulder angle significantly differed between successful and unsuccessful putting strokes only during address. During successful and unsuccessful motions, the swing was executed with the moving displacement of the X-axis of the club head maintained almost constant along a straight light without back and forth movement. In the backswing segment, moving displacement of the Y- and Z-axes was greater in successful strokes than in unsuccessful strokes; however, this difference was very small for the Y-axis. The velocity of the club head for successful and unsuccessful motions significantly differed during address and at the turning point. The highest velocity of the ball was greater for successful than for unsuccessful putting strokes.

Spatialization of Unstructured Document Information Using AI (AI를 활용한 비정형 문서정보의 공간정보화)

  • Sang-Won YOON;Jeong-Woo PARK;Kwang-Woo NAM
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.26 no.3
    • /
    • pp.37-51
    • /
    • 2023
  • Spatial information is essential for interpreting urban phenomena. Methodologies for spatializing urban information, especially when it lacks location details, have been consistently developed. Typical methods include Geocoding using structured address information or place names, spatial integration with existing geospatial data, and manual tasks utilizing reference data. However, a vast number of documents produced by administrative agencies have not been deeply dealt with due to their unstructured nature, even when there's demand for spatialization. This research utilizes the natural language processing model BERT to spatialize public documents related to urban planning. It focuses on extracting sentence elements containing addresses from documents and converting them into structured data. The study used 18 years of urban planning public announcement documents as training data to train the BERT model and enhanced its performance by manually adjusting its hyperparameters. After training, the test results showed accuracy rates of 96.6% for classifying urban planning facilities, 98.5% for address recognition, and 93.1% for address cleaning. When mapping the result data on GIS, it was possible to effectively display the change history related to specific urban planning facilities. This research provides a deep understanding of the spatial context of urban planning documents, and it is hoped that through this, stakeholders can make more effective decisions.

건설업에 있어서의 컴퓨터 이용

  • 이병해
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 1991.10a
    • /
    • pp.3-20
    • /
    • 1991
  • This paper wil1 describe the background and "dynamics" of system integration of construction industry. It wil1 address questions such as, why the construction industry needs to integrate work process through computer based system. Then it describes about 3D modeling, project, management, procurement, engineering data bases, construction CAE. Also the paper presents recent project experience at school environment.

  • PDF