• Title/Summary/Keyword: Classification of Scheme

Search Result 839, Processing Time 0.03 seconds

Image Coding by Region Classification and Wavelet Transform (영역분류와 웨이브렛 변환에 의한 영상 부호화)

  • 윤국진;박정호;최재호;곽훈성
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.113-116
    • /
    • 2000
  • In this paper, we present new scheme for image coding which efficiently use the relationship between the properties of spatial image and its wavelet transform. Firstly an original image is decomposed into several layers by the wavelet transform, and simultaneously decomposed into 2$\^$n/ ${\times}$ 2$\^$n/ blocks. Each block is classified into 3 regions according to their property, i.e., low activity region(LAR), midrange activity region(MAR), high activity region(HAR). Secondly we are applied texture modeling technique to LAR, MAR and HAR are encoded by Stack-Run coding technique. Finally our scheme Is superior to the Zerotree method in both reconstructed image Quality and transmitted bit rates.

  • PDF

Optimizing Garbage Collection Overhead of Host-level Flash Translation Layer for Journaling Filesystems

  • Son, Sehee;Ahn, Sungyong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.27-35
    • /
    • 2021
  • NAND flash memory-based SSD needs an internal software, Flash Translation Layer(FTL) to provide traditional block device interface to the host because of its physical constraints, such as erase-before-write and large erase block. However, because useful host-side information cannot be delivered to FTL through the narrow block device interface, SSDs suffer from a variety of problems such as increasing garbage collection overhead, large tail-latency, and unpredictable I/O latency. Otherwise, the new type of SSD, open-channel SSD exposes the internal structure of SSD to the host so that underlying NAND flash memory can be managed directly by the host-level FTL. Especially, I/O data classification by using host-side information can achieve the reduction of garbage collection overhead. In this paper, we propose a new scheme to reduce garbage collection overhead of open-channel SSD by separating the journal from other file data for the journaling filesystem. Because journal has different lifespan with other file data, the Write Amplification Factor (WAF) caused by garbage collection can be reduced. The proposed scheme is implemented by modifying the host-level FTL of Linux and evaluated with both Fio and Filebench. According to the experiment results, the proposed scheme improves I/O performance by 46%~50% while reducing the WAF of open-channel SSDs by more than 33% compared to the previous one.

An Efficient Complex Event Detection Algorithm based on NFA_HTS for Massive RFID Event Stream

  • Wang, Jianhua;Liu, Jun;Lan, Yubin;Cheng, Lianglun
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.989-997
    • /
    • 2018
  • Massive event stream brings us great challenges in its volume, velocity, variety, value and veracity. Picking up some valuable information from it often faces with long detection time, high memory consumption and low detection efficiency. Aiming to solve the problems above, an efficient complex event detection method based on NFA_HTS (Nondeterministic Finite Automaton_Hash Table Structure) is proposed in this paper. The achievement of this paper lies that we successfully use NFA_HTS to realize the detection of complex event from massive RFID event stream. Specially, in our scheme, after using NFA to capture the related RFID primitive events, we use HTS to store and process the large matched results, as a result, our scheme can effectively solve the problems above existed in current methods by reducing lots of search, storage and computation operations on the basis of taking advantage of the quick classification and storage technologies of hash table structure. The simulation results show that our proposed NFA_HTS scheme in this paper outperforms some general processing methods in reducing detection time, lowering memory consumption and improving event throughput.

The influence of strengthening the hollow steel tube and CFST beams using U-shaped CFRP wrapping scheme

  • Zand, Ahmed W. Al;Hosseinpour, Emad;Badaruzzaman, Wan Hamidon W.
    • Structural Engineering and Mechanics
    • /
    • v.66 no.2
    • /
    • pp.229-235
    • /
    • 2018
  • This study investigated the behaviour of the simply supported hollow steel tube (HST) beams, either concrete filled or unfilled when strengthened with carbon fibre reinforced polymer (CFRP) sheets. Eight specimens with varied tubes thickness (sections classification 1 and 3) were all tested experimentally under static flexural loading, four out of eight were filled with normal concrete (CFST beams). Particularly, the partial CFRP strengthening scheme was used, which wrapped the bottom-half of the beams cross-section (U-shaped wrapping), in order to use the efficiency of high tensile strength of CFRP sheets at the tension stress only of simply supported beams. In general, the results showed that the CFRP sheets significantly improved the ultimate strength and energy absorption capacities of the CFST beams with very limited improvement on the related HST beams. For example, the load and energy absorption capacities for the CFST beams (tube section class 1) were increased about 20% and 32.6%, respectively, when partially strengthened with two CFRP layers, and these improvements had increased more (62% and 38%) for the same CFST beams using tube class 3. However, these capacities recorded no much improvement on the related unfilled HST beams when the same CFRP strengthening scheme was adopted.

ADAPTIVE FDI FOR AUTOMOTIVE ENGINE AIR PATH AND ROBUSTNESS ASSESSMENT UNDER CLOSED-LOOP CONTROL

  • Sangha, M.S.;Yu, D.L.;Gomm, J.B.
    • International Journal of Automotive Technology
    • /
    • v.8 no.5
    • /
    • pp.637-650
    • /
    • 2007
  • A new on-line fault detection and isolation(FDI) scheme has been proposed for engines using an adaptive neural network classifier; this paper investigates the robustness of this scheme by evaluating in a wide range of operational modes. The neural classifier is made adaptive to cope with the significant parameter uncertainty, disturbances, and environmental changes. The developed scheme is capable of diagnosing faults in the on-line mode and can be directly implemented in an on-board diagnosis system(hardware). The robustness of the FDI for the closed-loop system with crankshaft speed feedback is investigated by testing it for a wide range of operational modes, including robustness against fixed and sinusoidal throttle angle inputs, change in load, change in an engine parameter, and all changes occurring simultaneously. The evaluations are performed using a mean value engine model(MVEM), which is a widely used benchmark model for engine control system and FDI system design. The simulation results confirm the robustness of the proposed method for various uncertainties and disturbances.

Traitor Traceability of Colluded Multimedia Fingerprinting code Using Hamming Distance on XOR Collusion Attack (XOR 공모공격에서 해밍거리를 이용한 공모된 멀티미디어 핑거프린팅 코드의 부정자 추적)

  • Chung, Il Yong;Rhee, Kang Hyeon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.175-180
    • /
    • 2013
  • For the traitor tracing of multimedia content, this paper presents the classification algorithm of XOR collusion attack types using hamming distance, which applies to the colluded fingerprinting codes. The conventional traitor decision hinges on the colluded fingerprinting code used by a correlation coefficient, but the proposed scheme uses hamming distance. While XOR collusion attack employing a correlation coefficient is impossible to trace the traitors about 50% colluders due to a serious XOR linear problem, our method improves the performance of traceability to trace at least 1 traitor using hamming distance, and thus, the functional behavior of the proposed traitor traceability is coincided with Probability Scheme.

Classification Rule for Optimal Blocking for Nonregular Factorial Designs

  • Park, Dong-Kwon;Kim, Hyoung-Soon;Kang, Hee-Kyoung
    • Communications for Statistical Applications and Methods
    • /
    • v.14 no.3
    • /
    • pp.483-495
    • /
    • 2007
  • In a general fractional factorial design, the n-levels of a factor are coded by the $n^{th}$ roots of the unity. Pistone and Rogantin (2007) gave a full generalization to mixed-level designs of the theory of the polynomial indicator function using this device. This article discusses the optimal blocking scheme for nonregular designs. According to hierarchical principle, the minimum aberration (MA) has been used as an important criterion for selecting blocked regular fractional factorial designs. MA criterion is mainly based on the defining contrast groups, which only exist for regular designs but not for nonregular designs. Recently, Cheng et al. (2004) adapted the generalized (G)-MA criterion discussed by Tang and Deng (1999) in studying $2^p$ optimal blocking scheme for nonregular factorial designs. The approach is based on the method of replacement by assigning $2^p$ blocks the distinct level combinations in the column with different blocks. However, when blocking level is not a power of two, we have no clue yet in any sense. As an example, suppose we experiment during 3 days for 12-run Plackett-Burman design. How can we arrange the 12-runs into the three blocks? To solve the problem, we apply G-MA criterion to nonregular mixed-level blocked scheme via the mixed-level indicator function and give an answer for the question.

The Reducting Technique of compulsory Misses for S/W managed TLB (S/W관리 TLB의 초기접근실패 감소 기법)

  • Park, Jang-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.3
    • /
    • pp.620-632
    • /
    • 1998
  • This paper introduces a new teehniquc for reducing the compulsory misses of software-managed TLBs by prefetching necessary TLB entries before being used. This technique is not inherently limited to specific applications. The key of this scheme is to perform the prefetch operations to update the TLB entries before first accesses so that TLB misses can be avoided. For the identifications of the prefctch pages, the new classification is introduced, which is based 0n the view of an object code execution. Then, the algorithms and the implementation technique arc described. Using a quantitative analysis, the proposed scheme is evaluated to prove that it is a useful technique for the perronnall~~ ~nhan~"ment of the S/W managed TLBs. in addition, it is discussed that reducing the miss rate by the prefeteh scheme reduces the total miss penalty and bus traffics in S/W-managed TLBs.

  • PDF

SVM-Guided Biplot of Observations and Variables

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.6
    • /
    • pp.491-498
    • /
    • 2013
  • We consider support vector machines(SVM) to predict Y with p numerical variables $X_1$, ${\ldots}$, $X_p$. This paper aims to build a biplot of p explanatory variables, in which the first dimension indicates the direction of SVM classification and/or regression fits. We use the geometric scheme of kernel principal component analysis adapted to map n observations on the two-dimensional projection plane of which one axis is determined by a SVM model a priori.