• Title/Summary/Keyword: searching system

Search Result 1,944, Processing Time 0.03 seconds

Development of a Bridge Disaster Management System Using GIS (GIS를 이용한 교량재해관리시스템 개발)

  • Ahn, Ki-Won;Yoo, Hwan-Hee;Choi, Yun-Soo;Shin, Sok-Hyo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.7 no.2 s.14
    • /
    • pp.69-80
    • /
    • 1999
  • The purpose of this study is to develop a Bridge Disaster Management System for bridge safety control using Geographic Information Systems(GIS). The constructed database includes several graphic layers such as basemap, road, bridge location, etc. and has related text attributes for 32 bridges and its facilities in Chinju City. Using the language of Visual Basic 5.0, personal computer based Bridge Disaster Management System which has several functions for bridge safety analysis was developed. The developed GIS based Bridge Disaster Management System has the functions of fast and efficient data searching, file management, searching and management of bridge characteristics, bridge related map viewing, searching and management of traffic survey, bridge inspection and repair work results, and evaluating the bridge safety grades, etc..

  • PDF

A decentralized approach to damage localization through smart wireless sensors

  • Jeong, Min-Joong;Koh, Bong-Hwan
    • Smart Structures and Systems
    • /
    • v.5 no.1
    • /
    • pp.43-54
    • /
    • 2009
  • This study introduces a novel approach for locating damage in a structure using wireless sensor system with local level computational capability to alleviate data traffic load on the centralized computation. Smart wireless sensor systems, capable of iterative damage-searching, mimic an optimization process in a decentralized way. The proposed algorithm tries to detect damage in a structure by monitoring abnormal increases in strain measurements from a group of wireless sensors. Initially, this clustering technique provides a reasonably effective sensor placement within a structure. Sensor clustering also assigns a certain number of master sensors in each cluster so that they can constantly monitor the structural health of a structure. By adopting a voting system, a group of wireless sensors iteratively forages for a damage location as they can be activated as needed. Since all of the damage searching process occurs within a small group of wireless sensors, no global control or data traffic to a central system is required. Numerical simulation demonstrates that the newly developed searching algorithm implemented on wireless sensors successfully localizes stiffness damage in a plate through the local level reconfigurable function of smart sensors.

A Multi-Sensor Module of Snake Robot for Searching Survivors in Narrow Space (협소 공간 생존자 탐색을 위한 뱀형 로봇의 다중 센서 모듈)

  • Kim, Sungjae;Shin, Dong-Gwan;Pyo, Juhyun;Shin, Juseong;Jin, Maolin;Suh, Jinho
    • The Journal of Korea Robotics Society
    • /
    • v.16 no.4
    • /
    • pp.291-298
    • /
    • 2021
  • In this study, we present a multi-sensor module for snake robot searching survivors in a narrow space. To this end, we integrated five sensor systems by considering the opinions of the first responders: a gas sensor to detect CO2 gases from the exhalation of survivors, a CMOS camera to provide the image of survivors, an IR camera to see in the dark & smoky environment, two microphones to detect the voice of survivors, and an IMU to recognize the approximate location and direction of the robot and survivors. Furthermore, we integrated a speaker into the sensor module system to provide a communication channel between the first responders and survivors. To integrated all these mechatronics systems in a small, compact snake head, we optimized the positions of the sensors and designed a stacked structure for the whole system. We also developed a user-friendly GUI to show the information from the proposed sensor systems visually. Experimental results verified the searching function of the proposed sensor module system.

Design of a hypermedia system for effective searching and browsing (탐색과 브라우징을 지원하는 하이퍼미디어 시스템의 설계)

  • 고영곤;최윤철
    • Journal of the Korean Society for information Management
    • /
    • v.10 no.1
    • /
    • pp.15-30
    • /
    • 1993
  • Hypermedia system supports associative linking concept for multimedia information using link and node concept, and overcomes the limitations of database system and text retrieval system in some application areas. This study shows the design and implementation of a hypermedia system which supports text, graphics, image and voice /sound information. This system has been designed to integrate the browsing and searching functions of the hypermedia system for efficient multimedia information retrieval and user-interface. To demonstrate the function and capability of the system, an application was made in the area of Bible and related information.

  • PDF

A Study on Implementation for in based Electronic Catalog Management System (XML기반 전자카탈로그 관리시스템의 구현에 관한 연구)

  • 김진영;김연수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.25 no.1
    • /
    • pp.35-41
    • /
    • 2002
  • XML(eXtensible Markup Language) based electronic catalog is very useful for searching target information because of its structural and contents based searching support capability. And XML document editing is easier than HTML because of XML document is divided by structure, contents and presentation. This paper is to present a prototype of XML based Electronic Catalog Management System(ECMS) whose system consists of data input, output and manipulation system for inserting, updating, editing and deletion. A proposed system could resolved the problems at virtual intermediary shopping mall invloved in the difficulty of interoperability when customer try to compare similar products at mixed shopping mall and reduced web service costs at independent shopping mall by using XML format. The proposed ECMS offers rapid response capability for product data change of electronic catalog and easy and friendly interoperability among similar products.

Fiber Identification via the TISS and DELTA Systems (TISS system 및 DELTA system에 의한 섬유식별)

  • 전수경
    • Journal of the Korea Furniture Society
    • /
    • v.10 no.1
    • /
    • pp.1-12
    • /
    • 1999
  • Of the vast number of plant taxa in the world, the wood is one of the most useful resources. It is important to identify the fibers of wood and pulp for the plant taxonomy and for the uses, but we do not have enough information on them, on them, especially for the computerizd data. The fiber identification is one of the difficult tasks. In addition to the plant taxonomy and the fiber-using industries, such identification is also important in many other fields, including education. document examiners, etc. For these purpose, the fibers should be exactly distinguished. The TISS system I have programed to identify various woods would also be useful in the identification of fibers by the genus and species in the features of unknown samples and in searching the features of a species based on its scientific name. Such searching programs are being developed in many other countries with a view to searching for the species name by using the features of the cells of the woody materials. With the survey of all the available literature, the features of the fibers of 124 species both of softwood and hardwood were examined under the electron and optical microscopies. Each species were coded and carded by the feature, and the databases were built. The microscopic were inputted into a personal computer program called and by a slide film scanner. The new computer program called TISS 2 was developed using C computer language. Korean language fonts were added to the TISS 2. The TISS 2 can be in adding and searching a image of fiber features both of a known fiber and an unknown fiber. The databases were corded for the DELTA system with was developed by Dallwitz and Paine in Australia, 1986.

  • PDF

ESP : A DVR File Format for Enhanced Recording and Searching (ESP : 녹화 및 검색 기능 향상을 위한 DVR전용 파일 포맷)

  • Park, Jae-Kyung;Yang, Seung-Min
    • The KIPS Transactions:PartB
    • /
    • v.16B no.1
    • /
    • pp.25-34
    • /
    • 2009
  • DVR(Digital Video Recorder) system stores video inputs in compressed digital formats and retrieve them. DVR system has several advantages over traditional analog tape recorder system which are (1) improved real-time monitoring, recording and searching capability, and (2) other capabilities such as watermarking and remote monitoring through network. AVI format is the most popular format used for DVR systems. However, AVI format has drawbacks in recording and searching due to structural problem. Some vendors develop and use their own format, do not open the format to the public. In this paper, ESP format is proposed. ESP format solves the drawbacks of AVI format, and the advantages of AVI format apply to ESP format. Moreover, ESP format provides multistream recording/replay and event-recording. In result, ESP format enchances functionality of recording and searching in DVR system.

An efficient channel searching method based on channel list for independent type cognitive radio systems (독립형 무선 인지 시스템에서 채널 목록 기반의 효과적 채널 검색)

  • Lee, Young-Doo;Koo, In-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1422-1428
    • /
    • 2009
  • In this paper, we consider an independent type cognitive radio system where secondary users can utilize empty channels that are not currently used by primary users having the license to these channels. In the previous works, secondary users search channels sequently or randomly to detect activities of primary user on channels. These channel searching methods however are not suitable to the characteristics of the wireless environment. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving the throughput of secondary users. In the proposed method, we firstly determine weighting value of each channel based on the history of channel activities of primary users and add the weighing value to current channel state buffer. And then, we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of average channel searching time and average number of transmissions of secondary user.

The Low Cost Implementation of Speech Recognition System for the Web (웹에서의 저가 음성인식 시스템의 구현)

  • Park, Yong-Beom;Park, Jong-Il
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1129-1135
    • /
    • 1999
  • isolated word recognition using the Dynamic Time warping algorithm has shown good recognition rate on speaker dependent environment. But, practically, since the searching time of the dynamic Time Warping algorithm is rapidly increased as searching data is increased. it is hard to implement. In the context-dependent-short-query system such as educational children's workbook on the Web, the number of responses to the specific questions is limited. Therefore, the searching space for the answers can be reduced depending on the questions. In this paper, low cost implementation method using DTW for the Web has been proposed. To cover the weakness of DTW, the searching space is reduced by the context. the searching space, depends on the specific questions, is chosen from interest searchable candidates. In the real implementation, the proposed method show better performance of both time and recognition rate.

  • PDF

An Effective P2P Searching Algorithm Based on Leveled OK Mechanism (단계별 OK 기법 기반 효과적 P2P 검색 알고리즘)

  • kim Boon-Hee;Lee Jun-Yeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.69-78
    • /
    • 2005
  • As the study and use of P2P systems are diversified, the effect of excessive amount of traffic, which occurs in searching peers' resource and is considered as a network bandwidth Problem, cannot let the matter Pass without making a protest. In case P2P application doesn't reduce network traffic, it can be much effected to use bandwidth smoothly in the internet environment where various network applications lie scattered and there will be inconvenience when many network users makes use of related applications . In this Paper, we propose a pure P2P model based-broadcasting technique for producing successful hit ratio and traffic amount in the weakly connected environment based-P2P system where situation of peers' connection and exit is ambiguous . The proposed searching technique is designed/implemented to improve a resident problem in the related system and we have estimated the performance of the proposed searching technique comparing our technique with the existing broadcasting based-searching technique .

  • PDF