• Title/Summary/Keyword: Processing Efficiency

Search Result 3,522, Processing Time 0.027 seconds

Preprocessing of the French Sentence for Multilingual Information Processing (다국어 정보처리를 위한 불어 전처리에 관한 연구)

  • Seo, Rae-Won;Park, Se-Won;Yu, Seong-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1132-1140
    • /
    • 2000
  • The purpose of this paper was to present the method of progress efficiency of morphosyntaxical analyzer for French information processing in the view of multilingual information processing. This study indicated that he method prohibit the additional useless word type by decomposing word type by decomposing works which were created by morphological amalgamation. Findings also suggested the need of preprocessing in order to decrease the overload of morphosyntaxical analysis algorithm. In addition, general rules were proposed to divide word form and to decompose complex sentence.

  • PDF

Efficiency Measurement Method and Simplification of Program (프로그램의 효율성 측정 방법과 간소화)

  • Yang, Hae-Sool
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.1
    • /
    • pp.49-62
    • /
    • 1998
  • Softwares which have many functions to satisfy user's requirements is developing. But generally, users use partial functions of software. If we could construct software which leave useful functions and remove unuseful functions in software with many functions, we could enhance execution efficiency by reduction of program size and quality of software. There are 6 items in international standard ISO/IEC 9126 about quality of software. These are functionality, reliability, usability, efficiency, maintenance and portability. In this study, we proposed metrics for measurement of efficiency and simplification method for source code. And we described products evaluation result and indicated problem and progress method for practical development project about proposed efficiency metrics.

  • PDF

A study on the Computational Efficiency Improvement for the Conjunction Screening Algorithm (접근물체 선별 알고리즘 계산 효율성 향상 연구)

  • Kim, Hyoung-Jin;Kim, Hae-Dong;Seong, Jae-Dong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.40 no.9
    • /
    • pp.818-826
    • /
    • 2012
  • In this paper, the improvement methods of the computational efficiency of the conjunction screening algorithm, which calculates the closest distance between primary satellite and space objects are presented. First method is to use GPU(Graphics Processing Unit) that has high computing power and handles quickly large amounts of data. Second method is to use Apogee/Perigee filter which excludes non-threatening objects that have low probability of collision and/or minimum distance rather than that of thresh hold. Third method is to combine first method with second method. As a result, the computational efficiency has been improved 34 times and 3 times for the first method only and second method only, respectively. On the contrary, the computational efficiency has been dramatically improved 163 times when two kinds of methods are combined.

Efficient Processing of Huge Airborne Laser Scanned Data Utilizing Parallel Computing and Virtual Grid (병렬처리와 가상격자를 이용한 대용량 항공 레이저 스캔 자료의 효율적인 처리)

  • Han, Soo-Hee;Heo, Joon;Lkhagva, Enkhbaatar
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.4
    • /
    • pp.21-26
    • /
    • 2008
  • A method for processing huge airborne laser scanned data using parallel computing and virtual grid is proposed and the method is tested by generating raster DSM(Digital Surface Model) with IDW(Inverse Distance Weighting). Parallelism is involved for fast interpolation of huge point data and virtual grid is adopted for enhancing searching efficiency of irregularly distributed point data. Processing time was checked for the method using cluster constituted of one master node and six slave nodes, resulting in efficiency near to 1 and load scalability property. Also large data which cannot be processed with a sole system was processed with cluster system.

  • PDF

A study on the overlap scanning method for the driving efficiency improvement of LC Displays (액정 표시기의 구동효율 개선을 위한 중첩구동방식에 관한 연구)

  • 최선정;김용덕
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.7
    • /
    • pp.110-116
    • /
    • 1994
  • In this paper a Duty Effective Overlap Scanning method (DEOS) for the improvement of driving efficiency of LC displays which have the RMS voltage responding characteristics is proposed and new processing method of data signals for optimum application of this method is also proposed. Proposed method has a few advantages such as the increment of duty ratio the increment of driving power loaded on LC cell and the decrement of RMS voltage error rate caused by signal attenuation on electrodes composing of display when compared with the conventional method which is called as optimum voltage amplitude selection method. And also by adopting new data signal processing method which has 3 kinds of voltage levels additional advantage much improving crosstalk phenomenon which is the most serious problems of simple matrix structured display is obtained. For the characteristic estimation new mathematical representation for new overlap scanning method and data signal processing method are induced and defined. And by the defined formula and simulation the characteristics of the proposed method and the conventional method are compared and analyzed. As a result of estimation this new method being able to optimize the overlap rate of scan signal and using 3 levels of data signals has the characteristic which can improve the driving efficiency of LC displays.

  • PDF

Architecture Exploration of Optimal Many-Core Processors for a Vector-based Rasterization Algorithm (래스터화 알고리즘을 위한 최적의 매니코어 프로세서 구조 탐색)

  • Son, Dong-Koo;Kim, Cheol-Hong;Kim, Jong-Myon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.1
    • /
    • pp.17-24
    • /
    • 2014
  • In this paper, we implement and evaluate the performance of a vector-based rasterization algorithm for 3D graphics by using a SIMD (single instruction multiple data) many-core processor architecture. In addition, we evaluate the impact of a data-per-processing elements (DPE) ratio that is defined as the amount of data directly mapped to each processing element (PE) within many-core in terms of performance, energy efficiency, and area efficiency. For the experiment, we utilize seven different PE configurations by varying the DPE ratio (or the number PEs), which are implemented in the same 130 nm CMOS technology with a 500 MHz clock frequency. Experimental results indicate that the optimal PE configuration is achieved as the DPE ratio is in the range from 16,384 to 256 (or the number of PEs is in the range from 16 and 1,024), which meets the requirements of mobile devices in terms of the optimal performance and efficiency.

New Two-Level L1 Data Cache Bypassing Technique for High Performance GPUs

  • Kim, Gwang Bok;Kim, Cheol Hong
    • Journal of Information Processing Systems
    • /
    • v.17 no.1
    • /
    • pp.51-62
    • /
    • 2021
  • On-chip caches of graphics processing units (GPUs) have contributed to improved GPU performance by reducing long memory access latency. However, cache efficiency remains low despite the facts that recent GPUs have considerably mitigated the bottleneck problem of L1 data cache. Although the cache miss rate is a reasonable metric for cache efficiency, it is not necessarily proportional to GPU performance. In this study, we introduce a second key determinant to overcome the problem of predicting the performance gains from L1 data cache based on the assumption that miss rate only is not accurate. The proposed technique estimates the benefits of the cache by measuring the balance between cache efficiency and throughput. The throughput of the cache is predicted based on the warp occupancy information in the warp pool. Then, the warp occupancy is used for a second bypass phase when workloads show an ambiguous miss rate. In our proposed architecture, the L1 data cache is turned off for a long period when the warp occupancy is not high. Our two-level bypassing technique can be applied to recent GPU models and improves the performance by 6% on average compared to the architecture without bypassing. Moreover, it outperforms the conventional bottleneck-based bypassing techniques.

Time-Series Forecasting Based on Multi-Layer Attention Architecture

  • Na Wang;Xianglian Zhao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.1-14
    • /
    • 2024
  • Time-series forecasting is extensively used in the actual world. Recent research has shown that Transformers with a self-attention mechanism at their core exhibit better performance when dealing with such problems. However, most of the existing Transformer models used for time series prediction use the traditional encoder-decoder architecture, which is complex and leads to low model processing efficiency, thus limiting the ability to mine deep time dependencies by increasing model depth. Secondly, the secondary computational complexity of the self-attention mechanism also increases computational overhead and reduces processing efficiency. To address these issues, the paper designs an efficient multi-layer attention-based time-series forecasting model. This model has the following characteristics: (i) It abandons the traditional encoder-decoder based Transformer architecture and constructs a time series prediction model based on multi-layer attention mechanism, improving the model's ability to mine deep time dependencies. (ii) A cross attention module based on cross attention mechanism was designed to enhance information exchange between historical and predictive sequences. (iii) Applying a recently proposed sparse attention mechanism to our model reduces computational overhead and improves processing efficiency. Experiments on multiple datasets have shown that our model can significantly increase the performance of current advanced Transformer methods in time series forecasting, including LogTrans, Reformer, and Informer.

Enhancing air traffic management efficiency through edge computing and image-aided navigation

  • Pradum Behl;S. Charulatha
    • Advances in aircraft and spacecraft science
    • /
    • v.11 no.1
    • /
    • pp.33-53
    • /
    • 2024
  • This paper presents a comprehensive investigation into the optimization of Flight Management Systems (FMS) with a particular emphasis on data processing efficiency by conducting a comparative study with conventional methods to edge-computing technology. The objective of this research is twofold. Firstly, it evaluates the performance of FMS navigation systems using conventional and edge computing methodologies. Secondly, it aims to extend the boundaries of knowledge in edge-computing technology by conducting a rigorous analysis of terrain data and its implications on flight path optimization along with communication with ground stations. The study employs a combination of simulation-based experimentation and algorithmic computations. Through strategic intervals along the flight path, critical parameters such as distance, altitude profiles, and flight path angles are dynamically assessed. Additionally, edge computing techniques enhance data processing speeds, ensuring adaptability to various scenarios. This paper challenges existing paradigms in flight management and opens avenues for further research in integrating edge computing within aviation technology. The findings presented herein carry significant implications for the aviation industry, ranging from improved operational efficiency to heightened safety measures.

The Study of Pre-processing Algorithm for Improving Efficiency of Optical Flow Method on Ultrasound Image (초음파 영상에서의 Optical Flow 추적 성능 향상을 위한 전처리 알고리즘 개발 연구)

  • Kim, Sung-Min;Lee, Ju-Hwan;Roh, Seung-Gyu;Park, Sung-Yun
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.5
    • /
    • pp.24-32
    • /
    • 2010
  • In this study, we have proposed a pre-processing algorithm newly developed for improving the tracking efficiency of the optical flow method. The developed pre-processing algorithm consists of a median filter, binarization, morphology, canny edge, contour detecting and an approximation method. In order to evaluate whether the optical flow tracking capacity increases, this study applied the pre-processing algorithm to the Lucas-Kanade(LK) optical flow algorithm, and comparatively analyzed its images and tracking results with those of optical flow without the pre-processing algorithm and with the existing pre-processing algorithm(composed of median filter and histogram equalization). As a result, it was observed that the tracking performance derived from the LK optical flow algorithm with the pre-processing algorithm, shows better tracking accuracy, compared to the one without the pre-processing algorithm and the one with the existing pre-processing algorithm. It seems to have resulted by successful segmentation for characteristic areas and subdivision into inner and outer contour lines.