• Title/Summary/Keyword: High-speed Data Processing

Search Result 756, Processing Time 0.024 seconds

Test and Evaluation of the Pantograph for Korean High Speed Train (한국형 고속전철 집전장치의 성능 계측 및 평가)

  • 서승일;박춘수;조용현;최강윤;목진용
    • Journal of the Korean Society for Railway
    • /
    • v.6 no.2
    • /
    • pp.94-99
    • /
    • 2003
  • The pantograph for Korean High Speed Train was developed by home-grown technology. In this study, test and evaluation of the current collection performance of the pantograph is conducted. For this purpose, a measuring system is developed and installed on the prototype high speed train. Measurement is conducted while the train runs on the test track. The measuring system is composed of video monitoring system and telemetry & data processing system. It monitors the hazard behavior of the pantograph and measures acceleration and vertical force of the pan head. By applying the measuring system, accurate evaluation of the performance of the pantograph and safety assessment of the interface system of pantograph and catenary is facilitated.

Development of a distributed high-speed data acquisition and monitoring system based on a special data packet format for HUST RF negative ion source

  • Li, Dong;Yin, Ling;Wang, Sai;Zuo, Chen;Chen, Dezhi
    • Nuclear Engineering and Technology
    • /
    • v.54 no.10
    • /
    • pp.3587-3594
    • /
    • 2022
  • A distributed high-speed data acquisition and monitoring system for the RF negative ion source at Huazhong University of Science and Technology (HUST) is developed, which consists of data acquisition, data forwarding and data processing. Firstly, the data acquisition modules sample physical signals at high speed and upload the sampling data with corresponding absolute-time labels over UDP, which builds the time correlation among different signals. And a special data packet format is proposed for the data upload, which is convenient for packing or parsing a fixed-length packet, especially when the span of the time labels in a packet crosses an absolute second. The data forwarding modules then receive the UDP messages and distribute their data packets to the real-time display module and the data storage modules by PUB/SUB-pattern message queue of ZeroMQ. As for the data storage, a scheme combining the file server and MySQL database is adopted to increase the storage rate and facilitate the data query. The test results show that the loss rate of the data packets is within the range of 0-5% and the storage rate is higher than 20 Mbps, both acceptable for the HUST RF negative ion source.

Analyses of the Meteorological Characteristics over South Korea for Wind Power Applications Using KMAPP (고해상도 규모상세화 수치자료 산출체계를 이용한 남한의 풍력기상자원 특성 분석)

  • Yun, Jinah;Kim, Yeon-Hee;Choi, Hee-Wook
    • Atmosphere
    • /
    • v.31 no.1
    • /
    • pp.1-15
    • /
    • 2021
  • High-resolution wind resources maps (maps, here after) with spatial and temporal resolutions of 100 m and 3-hours, respectively, over South Korea have been produced and evaluated for the period from July 2016 to June 2017 using Korea Meteorological Administration (KMA) Post Processing (KMAPP). Evaluation of the 10 m- and 80 m-level wind speed in the new maps (KMAPP-Wind) and the 1.5 km-resolution KMA NWP model, Local Data Assimilation and Prediction System (LDAPS), shows that the new high-resolution maps improves of the LDAPS winds in estimating the 10m wind speed as the new data reduces the mean bias (MBE) and root-mean-square error (RMSE) by 33.3% and 14.3%, respectively. In particular, the result of evaluation of the wind at 80 m which is directly related with power turbine shows that the new maps has significantly smaller error compared to the LDAPS wind. Analyses of the new maps for the seasonal average, maximum wind speed, and the prevailing wind direction shows that the wind resources over South Korea are most abundant during winter, and that the prevailing wind direction is strongly affected by synoptic weather systems except over mountainous regions. Wind speed generally increases with altitude and the proximity to the coast. In conclusion, the evaluation results show that the new maps provides significantly more accurate wind speeds than the lower resolution NWP model output, especially over complex terrains, coastal areas, and the Jeju island where wind-energy resources are most abundant.

A Data Transfer Method of the Sub-Cluster Group based on the Distributed and Shared Memory (분산 공유메모리를 기반으로 한 서브 클러스터 그룹의 자료전송방식)

  • Lee, Kee-Jun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.635-642
    • /
    • 2003
  • The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

A Disk Allocation Scheme for High-Performance Parallel File System (고성능 병렬화일 시스템을 위한 디스크 할당 방법)

  • Park, Kee-Hyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.2827-2835
    • /
    • 2000
  • In recent years, much attention has been focused on improving I/O devices' processing speed which is essential in such large data processing areas as multimedia data processing. And studies on high-performance parallel file systems are considered to be one of such efforts. In this paper, an efficient disk allocation scheme is proposed for high-performance parallel file systems. In other words, the concept of a parallel disk file's parallelism is defined using data declustering characteristic of a given parallel file. With the concept, an efficient disk allocation scheme is proposed which calculates the appropriate degree of data declustering on disks for each parallel file in order to obtain the maximum throughput when more than one parallel file is used at the same time. Since, calculation for obtaining the maximum throughput is too complex as the number of parallel files increases, an approximate disk allocation algorithm is also proposed in this paper. The approximate algorithm is very simple and especially provides very good results when I/O workload is high. In addition, it has shown that the approximate algorithm provides the optimal disk allocation for the maximum throughput when the arrival rate of I/O requests is infinite.

  • PDF

Architecture design for speeding up Multi-Access Memory System(MAMS) (Multi-Access Memory System(MAMS)의 속도 향상을 위한 아키텍처 설계)

  • Ko, Kyung-sik;Kim, Jae Hee;Lee, S-Ra-El;Park, Jong Won
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.6
    • /
    • pp.55-64
    • /
    • 2017
  • High-capacity, high-definition image applications need to process considerable amounts of data at high speed. Accordingly, users of these applications demand a high-speed parallel execution system. To increase the speed of a parallel execution system, Park (2004) proposed a technique, called MAMS (Multi-Access Memory System), to access data in several execution units without the conflict of parallel processing memories. Since then, many studies on MAMS have been conducted, furthering the technique to MAMS-PP16 and MAMS-PP64, among others. As a memory architecture for parallel processing, MAMS must be constructed in one chip; therefore, a method to achieve the identical functionality as the existing MAMS while minimizing the architecture needs to be studied. This study proposes a method of miniaturizing the MAMS architecture in which the architectures of the ACR (Address Calculation and Routing) circuit and MMS (Memory Module Selection) circuit, which deliver data in memories to parallel execution units (PEs), do not use the MMS circuit, but are constructed as one shift and conditional statements whose number is the same as that of memory modules inside the ACR circuit. To verify the performance of the realized architecture, the study conducted the processing time of the proposed MAMS-PP64 through an image correlation test, the results of which demonstrated that the ratio of the image correlation from the proposed architecture was improved by 1.05 on average.

A High-speed Automatic Mapping System Based on a Multi-sensor Micro UAV System (멀티센서 초소형 무인항공기 기반의 고속 자동 매핑 시스템)

  • Jeon, Euiik;Choi, Kyoungah;Lee, Impyeong
    • Spatial Information Research
    • /
    • v.23 no.3
    • /
    • pp.91-100
    • /
    • 2015
  • We developed a micro UAV based rapid mapping system that provides geospatial information of target areas in a rapid and automatic way. Users can operate the system easily although they are inexperienced in UAV operation and photogrammetric processes. For the aerial data acquisition, we constructed a micro UAV system mounted with a digital camera, a GPS/IMU, and a control board for the sensor integration and synchronization. We also developed a flight planning software and data processing software for the generation of geo-spatial information. The processing software operates automatically with a high speed to perform data quality control, image matching, georeferencing, and orthoimage generation. With the system, we have generated individual ortho-images within 30 minutes from 57 images of 3cm resolution acquired from a target area of $400m{\times}300m$.

The Measurement of Flight Data of Golfball with High-Speed Multi-Exposure Image (고속 다중 노출 영상을 이용한 골프공의 비행 요소 측정)

  • Kim, Ki-Hyun;Park, Hyun-Woo;Ju, Woo-Suk;Lee, Dong-Hoon;Yun, Tae-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.5
    • /
    • pp.699-707
    • /
    • 2009
  • Recently, while 3D sports game increases, the research that it recognizes the operation of the real user actively progresses. Most of all, the research about the golf is active. In this paper, the camera acquiring in a high-speed multi-exposure image measures the flight data of the golf ball through the image processing. While photographing, the high-speed camera, using this system, exposes an image at regular intervals. And line scan camera checks whether the golf ball passed or not. After the location information of the calculated golf ball calculates a speed and a direction by using the physical formula, it applies the golf simulation. After, this system is possible the measurement of the physical element of the spherical object.

  • PDF

The FPGA Implementation of The Viterbi Algorithm for Error Correcting (에러 정정을 위한 Viterbi 알고리즘의 FPGA 구현)

  • 조현숙;한승조;이상호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.1
    • /
    • pp.115-126
    • /
    • 1999
  • As the processing speed of communication and computer system has been improved, high speed data processing is required to correct error of data. In this paper, decoding algorithm which is applicable to the wireless communication system is proposed and encoder and decoder are designed by using the proposed decoding algorithm. We design the encoder and decoder by using the VHDL(VHSIC Hardware Description Language) and simulate the designed encoder and decoder by using V-system. Designed algorithm is synthesized by using synopsys tools and is made to one chip by means of XILINX XC4010EPC84-4. When 20MHz was used as the input clock, data arrival time was 29.20ns and data require time was 48.70ns.

Path based K-means Clustering for RFID Data Sets

  • Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.434-438
    • /
    • 2008
  • Massive data are continuously produced with a data rate of over several terabytes every day. These applications need effective clustering algorithms to achieve an overall high performance computation. In this paper, we propose ancestor as cluster center based approach to clustering, the K-means algorithm using ancestor. We modify the K-means algorithm. We present a clustering architecture and a clustering algorithm that minimize of I/Os and show a performance with excellent. In our experimental performance evaluation, we present that our algorithm can improve the I/O speed and the query processing time.