• Title/Summary/Keyword: block letters

Search Result 73, Processing Time 0.019 seconds

조선간본《유양잡조(酉陽雜俎)》의 이체자형(異體字形) 연구(硏究)

  • Jeong, Yeong-Ho;Min, Gwan-Dong
    • 중국학논총
    • /
    • no.63
    • /
    • pp.1-28
    • /
    • 2019
  • This study set out to examine the variant forms in the Korean block-printed edition of YouYangZaZu(酉陽雜俎)n terms of modifications of writing forms, increase and decrease of strokes, shortening and lengthening of strokes, connection and interruption of strokes, replacement of Pyeonbang(偏旁), and changing structures and positions. The study also aims to investigate the frequent uses and characteristics of variant forms. The findings show that the variant forms of YouYangZaZu(酉陽雜俎) include characters in some parts. There are 1,500 variant forms in the Korean block-printed edition of YouYangZaZu(酉陽雜俎)ith numerous characters of both various modifications and increasing or decreasing strokes based on the same characters. There are mixed uses of block letters and variant forms throughout the book from a single form to ten different forms of a character.

An Efficient Block Segmentation and Classification of a Document Image Using Edge Information (문서영상의 에지 정보를 이용한 효과적인 블록분할 및 유형분류)

  • 박창준;전준형;최형문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.120-129
    • /
    • 1996
  • This paper presents an efficient block segmentation and classification using the edge information of the document image. We extract four prominent features form the edge gradient and orientaton, all of which, and thereby the block clssifications, are insensitive to the background noise and the brightness variation of of the image. Using these four features, we can efficiently classify a document image into the seven categrories of blocks of small-size letters, large-size letters, tables, equations, flow-charts, graphs, and photographs, the first five of which are text blocks which are character-recognizable, and the last two are non-character blocks. By introducing the clumn interval and text line intervals of the document in the determination of th erun length of CRLA (constrained run length algorithm), we can obtain an efficient block segmentation with reduced memory size. The simulation results show that the proposed algorithm can rigidly segment and classify the blocks of the documents into the above mentioned seven categories and classification performance is high enough for all the categories except for the graphs with too much variations.

  • PDF

Follow-up Observation after Splanchnic Nerve Block (내장신경 차단후의 추적조사)

  • Kim, Yoon-Ae;Yoon, Duck-Mi;Oh, Hung-Kun
    • The Korean Journal of Pain
    • /
    • v.3 no.1
    • /
    • pp.21-26
    • /
    • 1990
  • One hundred among 320 patients who underwent splanchnic nerve block were evaluated retrospectively by telephone or letters. After splanchnic nerve block most of the patient experienced relatively good pain relief until death. The results were as follows 1) The duration of pain relief and survival time were well correlated. 2) The duration of survival time after the block was varied from 35 days to 240 days. These data suggest that the splanchnic nerve block is a satisfactory and reliable method for terminal cancer pain and results in a painless life until death.

  • PDF

한(韓)·중(中)·일(日) 《유양잡조(酉陽雜俎)》의 이체자형(異體字形) 비교(比較) 연구(硏究)

  • Jeong, Yeong-Ho;Min, Gwan-Dong
    • 중국학논총
    • /
    • no.70
    • /
    • pp.109-138
    • /
    • 2021
  • 本硏究在'韓·中·日《酉陽雜俎》的同一个異體字中, 對三個版本中共同使用的327个相同或相似的字進行了"筆形的變型·筆形的增减·筆劃的短縮及延長·筆劃的連結及中斷·偏旁的代替·構造及位置的變化"的比較, 由此逐項抽查, 相互攀比對。在'韓·中·日不同《酉陽雜俎》版本中特異的異體字'項目, 三個版本中獨特的異體字按照"筆形的變型·筆劃的增减·筆劃的短縮及延長·筆劃的連結及中斷·偏旁的代替·構造及位置的變化等進行了比較, 由此在不同版本中相互提取了不同版本的比較項目。'在朝鮮簡本《酉陽雜俎》之異體字的多用及特點'項目中, 在對朝鮮簡本《酉陽雜俎》中大量使用異體字及其特征進行分析的同時, 還與唐代前後文字的形態進行了相互比較。

A Block Matching using the Motion Information of Previous Frame and the Predictor Candidate Point on each Search Region (이전 프레임의 움직임 정보와 탐색 구간별 예측 후보점을 이용하는 블록 정합)

  • 곽성근;위영철;김하진
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.3
    • /
    • pp.273-281
    • /
    • 2004
  • There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the prediction search algorithm for block matching using the temporal correlation of the video sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06㏈ as depend on the video sequences and improved about 0.19∼0.46㏈ on an average except the full search(FS) algorithm.

Block Associativity Limit Scheme for Efficient Flash Translation Layer (효율적인 플래시 변환 계층을 위한 블록 연관성 제한 기법)

  • Ok, Dong-Seok;Lee, Tae-Hoon;Chung, Ki-Dong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.673-677
    • /
    • 2010
  • Recently, NAND flash memory has been widely used in embedded systems, personal computers, and server systems because of its attractive features, such as non-volatility, fast access speed, shock resistance, and low power consumption. Due to its hardware characteristics, specifically its 'erase-before-write' feature, Flash Translation Layer is required for using flash memory like hard disk drive. Many FTL schemes have been proposed, but conventional FTL schemes have problems such as block thrashing and block associativity problem. The KAST scheme tried to solve these problems by limiting the number of associations between data block and log block to K. But it has also block thrashing problem in random access I/O pattern. In this paper, we proposed a new FTL scheme, UDA-LBAST. Like KAST, the proposed scheme also limits the log block association, but does not limit data block association. So we could minimize the cost of merge operations, and reduce merge costs by using a new block reclaim scheme, log block garbage collection.

Janus-FTL Adjusting the Size of Page and Block Mapping Areas using Reference Pattern (참조 패턴에 따라 페이지 및 블록 사상 영역의 크기를 조절하는 Janus-FTL)

  • Kwon, Hun-Ki;Kim, Eun-Sam;Choi, Jong-Moo;Lee, Dong-Hee;Noh, Sam-H.
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.918-922
    • /
    • 2009
  • Naturally, block mapping FTL works well for sequential writes while page mapping FTL does well for random writes. To exploit their advantages, a practical FTL should be able to selectively apply a suitable scheme between page and block mappings for each write pattern. To meet that requirement, we propose a hybrid mapping FTL, which we call Janus-FTL, that distributes data to either block or page mapping areas. Also, we propose the fusion operation to relocate the data from block mapping area to page mapping area and the defusion operation to relocate the data from page mapping area to block mapping area. And experimental results of Janus-FTL show performance improvement of maximum 50% than other hybrid mapping FTLs.

Design and Implementation of an Efficient FTL for Large Block Flash Memory using Improved Hybrid Mapping (향상된 혼합 사상기법을 이용한 효율적인 대블록 플래시 메모리 변환계층 설계 및 구현)

  • Park, Dong-Joo;Kwak, Kyoung-Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.1-13
    • /
    • 2009
  • Flash memory is widely used as a storage medium of mobile devices such as MP3 players, cellular phones and digital cameras due to its tiny size, low power consumption and shock resistant characteristics. Currently, there are many studies to replace HDD with flash memory because of its numerous strong points. To use flash memory as a storage medium, FTL(Flash Translation Layer) is required since flash memory has erase-before-write constraints and sizes of read/write unit and erase unit are different from each other. Recently, new type of flash memory called "large block flash memory" is introduced. The large block flash memory has different physical structure and characteristics from previous flash memory. So existing FTLs are not efficiently operated on large block flash memory. In this paper, we propose an efficient FTL for large block flash memory based on FAST(Fully Associative Sector Translation) scheme and page-level mapping on data blocks.

An Industry-Strength DVR System using an Efficient Compression Algorithm (효율적인 압축 알고리즘을 이용한 실용화 수준의 DVR 시스템)

  • 박영철;안재기
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.3
    • /
    • pp.243-250
    • /
    • 2004
  • We describe a practical implementation of DVR (Digital Video Recording) system. And we propose a new image compression algorithm, that input video signal is divided into two parts, a moving target and a non-moving background part to achieve efficient compression of image sequences. This algorithm reorganizes a target area and a back-ground area by use of Macro Block(MB) unit on encoding scheme. The proposed algorithm allows high quality image reconstruction at low bit rates.

Brief Commentary on Philological Value of "EuiBangYooChui"(Classified Assemblage of Medical Prescriptions) ("의방유취(醫方類聚)"의 문헌가치(文獻價値)에 관한 관견(管見))

  • Hu, Sen
    • Korean Journal of Oriental Medicine
    • /
    • v.14 no.2
    • /
    • pp.151-154
    • /
    • 2008
  • "EuiBangYooChui"(Classified Assemblage of Medical Prescriptions) preserves important historical documents about herbal medical prescriptions up to the beginning of Ming dynasty. Mikisakae, a well-known medical history scholar of Japan, attributed high values on "EuiBangYooChui"(Classified Assemblage of Medical Prescriptions) as he stated that it summarized all medical knowledge of all over China and promulgated korean medicine to world top level. "EuiBangYooChui"(Classified Assemblage of Medical Prescriptions) thoroughly cited herbal prescriptions of 150 medical books of China which contents reach up to 9.5millions of letters. Also clarified all the sources of its contents. These efforts made easy the utilization for upcoming experts. Existing block books serves in various aspects of philological field, such as revision of lost documents, block book studies, contents studies, medical history studies, letter studies, phoneme studies and scholia.

  • PDF