• Title/Summary/Keyword: Valid and Invalid

Search Result 67, Processing Time 0.021 seconds

Data De-duplication and Recycling Technique in SSD-based Storage System for Increasing De-duplication Rate and I/O Performance (SSD 기반 스토리지 시스템에서 중복률과 입출력 성능 향상을 위한 데이터 중복제거 및 재활용 기법)

  • Kim, Ju-Kyeong;Lee, Seung-Kyu;Kim, Deok-Hwan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.149-155
    • /
    • 2012
  • SSD is a storage device of having high-performance controller and cache buffer and consists of many NAND flash memories. Because NAND flash memory does not support in-place update, valid pages are invalidated when update and erase operations are issued in file system and then invalid pages are completely deleted via garbage collection. However, garbage collection performs many erase operations of long latency and then it reduces I/O performance and increases wear leveling in SSD. In this paper, we propose a new method of de-duplicating valid data and recycling invalid data. The method de-duplicates valid data and then recycles invalid data so that it improves de-duplication ratio. Due to reducing number of writes and garbage collection, the method could increase I/O performance and decrease wear leveling in SSD. Experimental result shows that it can reduce maximum 20% number of garbage collections and 9% I/O latency than those of general case.

Garbage Collection Technique for Reduction of Migration Overhead and Lifetime Prolongment of NAND Flash Memory (낸드 플래시 메모리의 이주 오버헤드 감소 및 수명연장을 위한 가비지 컬렉션 기법)

  • Hwang, Sang-Ho;Kwak, Jong Wook
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.2
    • /
    • pp.125-134
    • /
    • 2016
  • NAND flash memory has unique characteristics like as 'out-place-update' and limited lifetime compared with traditional storage systems. According to out-of-place update scheme, a number of invalid (or called dead) pages can be generated. In this case, garbage collection is needed to reclaim invalid pages. Because garbage collection results in not only erase operations but also copy operations of valid (or called live) pages to other blocks, many garbage collection techniques have proposed to reduce the overhead and to increase the lifetime of NAND Flash systems. This techniques sometimes select victim blocks including cold data for the wear leveling. However, most of them overlook the cost of selecting victim blocks including cold data. In this paper, we propose a garbage collection technique named CAPi (Cost Age with Proportion of invalid pages). Considering the additional overhead of what to select victim blocks including cold data, CAPi improves the response time in garbage collection and increase the lifetime in memory systems. Additionally, the proposed scheme also improves the efficiency of garbage collection by separating cold data from hot data in valid pages. In experimental evaluation, we showed that CAPi yields up to, at maximum, 73% improvement in lifetime compared with existing garbage collections.

Evaluating Join Performance on Relational Database Systems

  • Ordonez, Carlos;Garcia-Garcia, Javier
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.4
    • /
    • pp.276-290
    • /
    • 2010
  • The join operator is fundamental in relational database systems. Evaluating join queries on large tables is challenging because records need to be efficiently matched based on a given key. In this work, we analyze join queries in SQL with large tables in which a foreign key may be null, invalid or valid, given a referential integrity constraint. We conduct an extensive join performance evaluation on three DBMSs. Specifically, we study join queries varying table sizes, row size and key probabilistic distribution, inserting null, invalid or valid foreign key values. We also benchmark three well-known query optimizations: view materialization, secondary index and join reordering. Our experiments show certain optimizations perform well across DBMSs, whereas other optimizations depend on the DBMS architecture.

The Effect of Consistency between Represented Location of the Cue and the Target on Attention Mechanism (단서자극과 표적자극의 표상된 위치의 일치성이 주의기제의 작용에 미치는 영향)

  • Seo, Jun-Ho;Li, Hyung-Chul O.
    • Korean Journal of Cognitive Science
    • /
    • v.20 no.4
    • /
    • pp.481-506
    • /
    • 2009
  • The purpose of the present research was to examine whether the attention mechanism employs physical or represented location of the cue and target. To achieve this, we have employed the paradigm of facilitation of response as well as inhibition of return. In the experiments, valid and invalid conditions were defined by the position consistency of the cue and the target in the aspect of either physical or represented location. We used auditory cue and visual target in Experiment 1 while visual cue and auditory target in Experiment 2. As a results, in Experiment 1, effect of facilitation of response in valid condition was found when the valid/invalid conditions were defined in the aspect of represented location. In Experiment 2, effect of facilitation of response in valid condition was found when the valid/invalid conditions were defined in the aspect of represented location. In all the other conditions, no effect was found when the conditions were defined in the aspect of physical location. No effects of inhibition of return were found in Experiment 2. These results imply the possibility that attention mechanism operates based on objects' represented location rather than on their physical location. More importantly, the present research suggests that it is necessary to separate represented location from physical location of the target and the cue in the experiment of facilitation of response and inhibition of return in the future.

  • PDF

Extracting a Regular Triangular Net for Offsetting (옵셋팅을 위한 정규 삼각망 추출)

  • Jung W.H.;Jeong C.S.;Shin H.Y.;Choi B.K.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.3
    • /
    • pp.203-211
    • /
    • 2004
  • In this paper, we present a method of extracting a regular 2-manifold triangular net from a triangular net including degenerate and self-intersected triangles. This method can be applied to obtaining an offset model without degenerate and self-intersected triangles. Then this offset model can be used to generate CL curves and extract machining features for CAPP The robust and efficient algorithm to detect valid triangles by growing regions from an initial valid triangle is presented. The main advantage of the algorithm is that detection of valid triangles is performed only in valid regions and their adjacent selfintersections, and omitted in the rest regions (invalid regions). This advantage increases robustness of the algorithm. As well as a k-d tree bucketing method is used to detect self-intersections efficiently.

Pencil Curve Computation for Clean-up Machining (잔삭 가공을 위한 펜슬커브 생성)

  • Park T.J.;Park S.C.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.1
    • /
    • pp.20-26
    • /
    • 2006
  • This paper presents a procedure to compute pencil curves from a triangular mesh which is offset with the radius of a given ball-end mill. An offset triangular mesh has numerous self-intersections caused by an abundance of invalid triangles, which do not contribute to the valid CL-surface. Conceptually, we can obtain valid pencil curves by combining all intersections tying on the outer skin of the offset triangular mesh, i.e., the valid CL-surface. The underlying concept of the proposed algorithm is that visible intersections are always valid for pencil curves, because visible intersections lie on the outer skin of the offset model. To obtain the visibility of intersections efficiently, the proposed algorithm uses a graphics board, which performs hidden surface removal on up to a million polygons per second.

Validity of Non-documentary Conditions (신용장의 비서류적 조건의 유효성)

  • Suk, Kwang-Hyun
    • THE INTERNATIONAL COMMERCE & LAW REVIEW
    • /
    • v.22
    • /
    • pp.137-171
    • /
    • 2004
  • Under Article 2 of the Uniform Customs and Practice for Documentary Credits (1993 Revision. UCP), letter of credit means an arrangement whereby an issuing bank is to make a payment to a beneficiary, or is to accept and pay bills of exchange drawn by the beneficiary, or authorises another bank to effect such payment, or to accept and pay such bills of exchange, or to negotiate, against stipulated document(s), provided that the terms and conditions of the letter of credit are complied with. In letter of credit operations, all parties concerned deal with documents, and not with goods, services and/or other performances to which the documents may relate (UCP, Article 4). It is important to note that under UCP, if a letter of credit contains conditions without stating the document(s) to be presented in compliance therewith, banks will deem such conditions as not stated and will disregard them (Article 13 c). Section 5-108(g) of the Uniform Commercial Code also contains a similar provision. However on several occasions the Korean Supreme Court held that non-documentary conditions in letter of credit governed by UCP could be regarded as valid, although they were not desirable in the context of letter of credit transactions. The rationale underlying the decisions was that parties to the letter of credit transactions are free to determine the terms and conditions of the relevant letter of credit. After reviewing the relevant provisions of UCP, UCC, the International Standby Practices (ISP98) and the Supreme Court decisions of Korea, the author suggests that we classify conditions that do not require any documents (so called apparent non-documentary conditions) into two categories and treat them differently. There are apparent non-documentary conditions that are consistent with the nature of letter of credit and those which are inconsistent with the nature of letter of credit. In the first category there are two sub-categories, (i) those which are valid and (ii) those which are invalid and thus should be disregarded. In the second category there are two sub-categories, (i) those which are invalid and thus should be disregarded and (ii) those which are valid but deprive the instrument of the nature as letter of credit.

  • PDF

Video Palmprint Recognition System Based on Modified Double-line-single-point Assisted Placement

  • Wu, Tengfei;Leng, Lu
    • Journal of Multimedia Information System
    • /
    • v.8 no.1
    • /
    • pp.23-30
    • /
    • 2021
  • Palmprint has become a popular biometric modality; however, palmprint recognition has not been conducted in video media. Video palmprint recognition (VPR) has some advantages that are absent in image palmprint recognition. In VPR, the registration and recognition can be automatically implemented without users' manual manipulation. A good-quality image can be selected from the video frames or generated from the fusion of multiple video frames. VPR in contactless mode overcomes several problems caused by contact mode; however, contactless mode, especially mobile mode, encounters with several revere challenges. Double-line-single-point (DLSP) assisted placement technique can overcome the challenges as well as effectively reduce the localization error and computation complexity. This paper modifies DLSP technique to reduce the invalid area in the frames. In addition, the valid frames, in which users place their hands correctly, are selected according to finger gap judgement, and then some key frames, which have good quality, are selected from the valid frames as the gallery samples that are matched with the query samples for authentication decision. The VPR algorithm is conducted on the system designed and developed on mobile device.

An Algorithm for Computing Valid Side Chain Conformations for Finding Transformed Channels in a Protein Molecule (단백질 분자에서 변형된 채널 발견을 위한 유효 사이드 체인 배치 알고리즘)

  • Choi, Jihoon;Kim, Byungjoo;Kim, Ku-Jin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.1
    • /
    • pp.1-4
    • /
    • 2015
  • This paper presents an algorithm for finding valid side chain conformations of amino acids, when given channel is transformed. The suggested algorithm implements a protein molecule with flexible side chains based on the flexibility of amino acids, and extracts adjacent amino acids that affect the formation of the channel. We detect the collision between adjacent amino acids and neighbors, in order to exclude invalid side chain conformations. Then, we construct the rotation angle combination tree to choose valid side chain conformations.

A New Image Authentication Method through Isolation of Invalid Blocks (무효 블록의 격리를 이용한 새로운 이미지 인증 방법)

  • Kim, Hyo-Chul;Kim, Hyun-Chul;Yoo, Ki-Young
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.1
    • /
    • pp.17-24
    • /
    • 2002
  • In this paper, we propose a new watermarking method using isolation of invalid blocks for image authentication. We embed messages into the high frequency band in the DCT domain because of its imperceptibility and fragility. And we were able to inspect the identity of valid blocks between error corrected original images and watermarked images through experiments. As a result, we found that the watermarked image is enough to extract binary messages. Therefore, the extra information such as the original image or watermark was not necessary in our extracting process. Experiment results show that the proposed method can be used successfully for image authentication.