• 제목/요약/키워드: Time complexity measurement

검색결과 97건 처리시간 0.03초

자원 재활용을 위한 자동차 조립군의 복잡도 평가시스템 (The Complexity Evaluation System of Automobile Subassembly for Recycling)

  • 목학수;문광섭;김성호;문대성
    • 한국정밀공학회지
    • /
    • 제16권5호통권98호
    • /
    • pp.132-144
    • /
    • 1999
  • In this study, the complexity of the product was evaluated quantitatively considering the product structure, assembly process and disassembly process. To evaluate the complexity of the product, subassemblies of automobile were analyzed and then characteristics of part and subassembly were determined according to product structure, assembly process and disassembly process. Evaluation criteria of complexity were determined considering each characteristics of part and subassembly. Experiential evaluation was accomplished by classified evaluation criteria and time-motion evaluation was accomplished by the relational motion factor with characteristics of part and subassembly in MTM(Methods Time Measurement) and WF(Work Factor). The total complexity of product was determined by experiential evaluation and time-motion evaluation.

  • PDF

Time Complexity Measurement on CUDA-based GPU Parallel Architecture of Morphology Operation

  • Izmantoko, Yonny S.;Choi, Heung-Kook
    • 한국멀티미디어학회논문지
    • /
    • 제16권4호
    • /
    • pp.444-452
    • /
    • 2013
  • Operation time of a function or procedure is a thing that always needs to be optimized. Parallelizing the operation is the general method to reduce the operation time of the function. One of the most powerful parallelizing methods is using GPU. In image processing field, one of the most commonly used operations is morphology operation. Three types of morphology operations kernel, na$\ddot{i}$ve, global and shared, are presented in this paper. All kernels are made using CUDA and work parallel on GPU. Four morphology operations (erosion, dilation, opening, and closing) using square structuring element are tested on MRI images with different size to measure the speedup of the GPU implementation over CPU implementation. The results show that the speedup of dilation is similar for all kernels. However, on erosion, opening, and closing, shared kernel works faster than other kernels.

A SYN flooding attack detection approach with hierarchical policies based on self-information

  • Sun, Jia-Rong;Huang, Chin-Tser;Hwang, Min-Shiang
    • ETRI Journal
    • /
    • 제44권2호
    • /
    • pp.346-354
    • /
    • 2022
  • The SYN flooding attack is widely used in cyber attacks because it paralyzes the network by causing the system and bandwidth resources to be exhausted. This paper proposed a self-information approach for detecting the SYN flooding attack and provided a detection algorithm with a hierarchical policy on a detection time domain. Compared with other detection methods of entropy measurement, the proposed approach is more efficient in detecting the SYN flooding attack, providing low misjudgment, hierarchical detection policy, and low time complexity. Furthermore, we proposed a detection algorithm with limiting system resources. Thus, the time complexity of our approach is only (log n) with lower time complexity and misjudgment rate than other approaches. Therefore, the approach can detect the denial-of-service/distributed denial-of-service attacks and prevent SYN flooding attacks.

Deterministic Bipolar Compressed Sensing Matrices from Binary Sequence Family

  • Lu, Cunbo;Chen, Wengu;Xu, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권6호
    • /
    • pp.2497-2517
    • /
    • 2020
  • For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

OLED 패널의 노화 측정 및 보상 (Aging Measurement and Compensation for OLED Panel)

  • 정경중;정홍
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.1009-1010
    • /
    • 2008
  • This paper presents a real-time aging measurement and feasible compensation system for the prolonged lifetime of OLED panel. The proposed system is composed of four parts, a PC with a man-machine interface, a measurement block, an adaptive amplifier block, and a compensation block. We apply a tree algorithm for less complexity and convenience of measurement on the degree of aging. An adaptive multi-stage differential amplifier is also implemented to deal with a various range of input voltages at the same spot.

  • PDF

수술수가의 적정성에 관한 연구 - 상대가격체계와 항목분류를 중심으로 - (A Study on the Propriety of the Medical Insurance Fee Schedule of Surgical Operations - In Regard to the Relative Price System and the Classification of the Price Unit of Insurance Fee Schedule -)

  • 오진주
    • 한국보건간호학회지
    • /
    • 제2권2호
    • /
    • pp.21-44
    • /
    • 1988
  • In Korea, fee-for service reimbursement has been adopted from the begining of medical insurance system in 1977, and the importance of the relative value unit is currently being investigated. The purpose of this study was to find out the level of propriety of the difference in the fees for different surgical services, and the appropriateness of the classification of the insurance fee schedule. For the purpose of this study, specific subjects and the procedural methodology is shown as follows: 1. The propriety of the Relative Price System(RPS). 1) Choice of sample operations. In this study, sample operations were selected and classified by specialists in general surgery, and the number of items they classified were 32. For the same group of operations the Insurance Fee Schedule(IFS) classified the operations into 24 separate items. In order to investigate the propriety of the RPS, one of the purpose of this study, was to examine the 24 items classified by the IFS. 2) Evaluation of the complexity of surgery. The data used in this study was collected The data used in this study was collected from 94 specialists in general surgery by mail survey from November I to 15, 1986. Several independent variables (age, location, number of bed, university hospital, whether the medical institution adopt residents or not) were also investigated for analysis of the characteristics of surgical complexity. 3) Complexity and time calculations. Time data was collected from the records of the Seoul National University' Hospital, and the cost per operation was calculated through cost finding methods. 4) Analysis of the propriety of the Relative Price System of the Insurance Fee Schedule. The Relative Price System of the sample operation was regressed on the cost, time, comlexity relative ,value system (RVS) separately. The coefficient of determination indicates the degree of variation in the RPS of the Insurance Fee Schedule explained by the cost, time, complexity RVS separately. 2. The appropriateness of the classification of the Insurance Fee Schedule. 1) Choice of sample operations. The items which differed between the classification of the specialist and the classification of medical, Insurance Fee Schedule were chosen. 2) Comparisons of cost, time and complexity between the items were done to evaluate which classification was more appropriate. The findings of the study can be summarized as follows: 1. The coefficient of determination of the regression of the RPS on-cost RVS was 0.58, on time RVS was 0.65, and on complexity RVS was 0.72. This means that the RPS of Insurance Fee Schedule is improper with respect to the cost, time, complexity separately. Thus this indicates that RPS must be re-shaped according to the standard element. In this study, the correlation coefficients of cost, time, complexity Relative Value System were very high, and this suggests that RPS could be reshaped I according to anyone standard element. Considering of measurement, time was thought to be the most I appropriate. 2. The classifications of specialist and of the Insurance Fee Schedule were compared with respect to cost, time, and complexity separately. For complexity, ANOVA was done and the others were compared to the different values of different classifications. The result was that the classification of specialist was more reasonable and that the classification of Insurance Fee Schedule grouped inappropriately several into one price unit.

  • PDF

Exploring Smartphone-Based Indoor Navigation: A QR Code Assistance-Based Approach

  • Chirakkal, Vinjohn V;Park, Myungchul;Han, Dong Seog
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제4권3호
    • /
    • pp.173-182
    • /
    • 2015
  • A real-time, Indoor navigation systems utilize ultra-wide band (UWB), radio-frequency identification (RFID) and received signal strength (RSS) techniques that encompass WiFi, FM, mobile communications, and other similar technologies. These systems typically require surplus infrastructure for their implementation, which results in significantly increased costs and complexity. Therefore, as a solution to reduce the level of cost and complexity, an inertial measurement unit (IMU) and quick response (QR) codes are utilized in this paper to facilitate navigation with the assistance of a smartphone. The QR code helps to compensate for errors caused by the pedestrian dead reckoning (PDR) algorithm, thereby providing more accurate localization. The proposed algorithm having IMU in conjunction with QR code shows an accuracy of 0.64 m which is higher than existing indoor navigation techniques.

Development of Sound Source Localization System using Explicit Adaptive Time Delay Estimation

  • Kim, Doh-Hyoung;Park, Youngjin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.80.2-80
    • /
    • 2002
  • The problem of sound source localization is to determine the position of sound sources using the measurement of the acoustic signals received by microphones. To develop a good sound source localization system which is applicable to a mobile platform such as robots, a time delay estimator with low computational complexity and robustness to background noise or reverberations is necessary. In this paper, an explicit adaptive time delay estimation method for a sound source localization system is proposed. Proposed explicit adaptive time estimation algorithm employs direct adaptation of the delay parameter using a transform-based optimization technique, rather than...

  • PDF

Removal of Complexity Management in H.263 Codec for A/VDelivery Systems

  • Jalal, Ahmad;Kim, Sang-Wook
    • 한국HCI학회:학술대회논문집
    • /
    • 한국HCI학회 2006년도 학술대회 1부
    • /
    • pp.931-936
    • /
    • 2006
  • This paper presents different issues of the real-time compression algorithms without compromising the video quality in the distributed environment. The theme of this research is to manage the critical processing stages (speed, information lost, redundancy, distortion) having better encoded ratio, without the fluctuation of quantization scale by using IP configuration. In this paper, different techniques such as distortion measure with searching method cover the block phenomenon with motion estimation process while passing technique and floating measurement is configured by discrete cosine transform (DCT) to reduce computational complexity which is implemented in this video codec. While delay of bits in encoded buffer side especially in real-time state is being controlled to produce the video with high quality and maintenance a low buffering delay. Our results show the performance accuracy gain with better achievement in all the above processes in an encouraging mode.

  • PDF

적외선 주사 영상에서 소형 표적의 탐지 및 추적을 위한 신뢰성 있는 측정치 선택 기법 (Reliable Measurement Selection for The Small Target Detection and Tracking in The IR Scanning Images)

  • 양유경;김성호
    • 한국군사과학기술학회지
    • /
    • 제11권1호
    • /
    • pp.75-84
    • /
    • 2008
  • A new automatic small target detection and tracking algorithm for the real-time IR surveillance system is presented. The automatic target detection and tracking algorithm of the real-time systems, requires low complexity and robust tracking performance in the cluttered environment. Linear-array and parallel-scan IR systems usually suffer from severe scan noise caused by the detector non-uniformity. After the spatial filtering and thresholding, this scan noise still remains as high amplitude clutter which degrades the target detection rate and tracking performance. In this paper, we propose a new feature which consists of area and validity information of a measurement. By adopting this feature to the measurements selection and track confirmation, we can increase the target detection rate and reduce both the track loss rate and false track rate. From the experimental results, we can validate the feasibility of the proposed method in the noisy IR images.