• Title/Summary/Keyword: 블록 기반 방법

Search Result 1,131, Processing Time 0.031 seconds

MILP-Espresso-Based Automatic Searching Method for Differential Charactertistics (효율적인 MILP-Espresso 기반 차분 특성 자동 탐색 방법)

  • Park, YeonJi;Lee, HoChang;Hong, Deukjo;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.3
    • /
    • pp.533-543
    • /
    • 2018
  • In this paper, we propose an MILP-based method for Optimal Probability of Bit-based Differential Characteristic in SP(Substitution-permutation) ciphers based on Automatic Differential Characteristic Searching Method of Sasaki, et al. In [13], they used input/output variables and probability variables seperatably, but we simplify searching procedure by putting them(variables) together into linear inequalities. Also, In order to decrease the more linear inequalities, we choose Espresso algorithm among that used by Sasaki, et al(Quine-McCluskey algorithm & Espresso algorithm). Moreover, we apply our method to GIFT-64, GIFT-128, SKINNY-64, and we obtained results in the GIFT(Active S-boxs : 6, Probabilities : $2^{-11.415}$) compared with the existing one.(Active S-boxs : 5, Probabilities : unknown). In case of SKINNY-64, we can't find better result, but can find same result compared with the existing one.

Synthesis of Multi Hydroxyl Chain-End Functionalized Polyolefin Elastomer with Poly(t-butylstyrene) Graft (Poly(t-butylstyrene) 그라프트를 가지는 수산기 말단 관능화 폴리올레핀 탄성체의 합성)

  • Lee, Hyoung Woo;Cho, Hee Won;Lee, Sang Min;Park, Sat Byeol;Kim, Dong Hyun;Lee, Bum Jae
    • Elastomers and Composites
    • /
    • v.48 no.1
    • /
    • pp.10-17
    • /
    • 2013
  • Polyolefin-g-poly(t-butylstyrene) as one of the high-temperature polyolefin-based thermoplastic elastomers was synthesized by the graft-from anionic living polymerization from the styrene moieties of the linear poly(ethylene-ter-1-hexene-ter-divinylbenzene) as a soft block to form the hard end blocks, poly(t-butylstyrene). The chemistry of the anionic graft-from polymerization involved complete lithiation of the pendant styrene unit of the soft polyolefin elastomer with sec-BuLi/TMEDA followed by the subsequent graft anionic polymerization of 4-tert-butylstyrene with Mn=10,000~30,000 g/mol. The graft-from living anionic polymerization were very effective and the grafting size increased proportionally with increasing monomer concentration and the reaction times. The synthetic methodology for the multi-hydroxyl chain-end modified polyolefin-g-poly(t-butylstyrene) was proposed by using the thiol-ene click reaction between 2-mercaptoethanol and the polyolefin-g-[poly(t-butylstyrene)-b-high vinyl polyisoprene], which was obtained from the subsequent living block copolymerization using polyolefin-g-Poly(t-butylstyrene) with isoprene. The result indicated that this process produced a new well-defined functionalized graft-type polyolefin-based TPE with high $T_g$ hard block(> $145^{\circ}C$).

An Adaptive Smoothing for Moire Region using Analysis of Halftone Patterns Interference in Color Inverse Halftoning (칼라 역 해프토닝에서 해프톤 패턴 간섭 분석에 의한 모아레 영역의 적응적 평활화 방법)

  • 한영미;김종민;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.263-271
    • /
    • 2002
  • In this paper, we propose a new smoothing method for removing moire patterns using analysis of halftone patterns interference. The proposed method can determine a strength of moire patterns by using gray values of pixels and the size of smoothing mask for moire region is adjusted adaptively according to the strength of moire patterns. Therefore it can remove moire patterns effectively and preserve meaningful high frequencies well, such as edges and textures. The proposed method only refer to predefined lookup table to determine the strength of moire patterns, so it is more efficient than a previous work based on FFT of subblock. It could be applied to field of various multimedia applications that deal with color prints.

  • PDF

Plan for an Information Management System on Sports Players' Related Goods based on Blockchain (블록체인 기반 스포츠 선수 관련 상품의 진품 정보 관리 방안)

  • You, Kangsoo;Kim, Semin
    • Journal of Industrial Convergence
    • /
    • v.18 no.4
    • /
    • pp.87-92
    • /
    • 2020
  • Recently, several sporting events have been canceled or postponed due to the influence of COVID-19's imposed social distancing in life, or are being played without spectators. As a result, the market for sports products has been stagnant, and many are experiencing difficulties. To get over it, sports market players are exploring various new markets such as online fan services and online sales. Therefore, this study proposed a way to manage the authenticity of sports-related products. The block structure, system flow, and network model were designed and prototypes were developed accordingly. Experts were invited through the derived method to conduct a target group interview (FGI) to evaluate the reliability and stability of the transaction process, the reliability and stability of payment, the tracking of accidents, and the reliability and stability of the system. Through this study, consumers can have reliability when trading sports-related products such as goods, favorite items, and sign balls.

Design and Implementation of High-Speed Pattern Matcher Using Multi-Entry Simultaneous Comparator in Network Intrusion Detection System (네트워크 침입 탐지 시스템에서 다중 엔트리 동시 비교기를 이용한 고속패턴 매칭기의 설계 및 구현)

  • Jeon, Myung-Jae;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.11
    • /
    • pp.2169-2177
    • /
    • 2015
  • This paper proposes a new pattern matching module to overcome the increased runtime of previous algorithm using RAM, which was designed to overcome cost limitation of hash-based algorithm using CAM (Content Addressable Memory). By adopting Merge FSM algorithm to reduce the number of state, the proposed module contains state block and entry block to use in RAM. In the proposed module, one input string is compared with multiple entry strings simultaneously using entry block. The effectiveness of the proposed pattern matching unit is verified by executing Snort 2.9 rule set. Experimental results show that the number of memory reads has decreased by 15.8%, throughput has increased by 47.1%, while memory usage has increased by 2.6%, when compared to previous methods.

Past Block Matching Motion Estimation based on Multiple Local Search Using Spatial Temporal Correlation (시공간적 상관성을 이용한 국소 다중 탐색기반 고속 블록정합 움직임 추정)

  • 조영창;남혜영;이태홍
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.356-364
    • /
    • 2000
  • Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

  • PDF

Design of Management System for Registering Agricultural Machine Using Blockchain (블록체인을 활용한 농업기계 등록 관리 시스템의 설계)

  • Son, Yong-Bum;Kim, Young-Hak
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.12
    • /
    • pp.18-27
    • /
    • 2019
  • Through the technology of the 4th industrial revolution, agricultural machinery is becoming increasingly intelligent, and the machine is replacing the role of farmer manpower as a whole. However, safety accidents caused by careless use of agricultural machines and theft accidents due to the difficulty of keeping them are increasing every year. Because agricultural machines do not manage the history of events and accidents unlike automobiles, they are often used for crime. There is also no way to cope with the issues if there happens issues on agricultural machines. In this paper, we propose the system based on block chain which can manage the history of the agricultural machinery by registering the chassis number at the same time when purchasing the agricultural machinery. Since this system contains the history of accident and repair information about the owner's agricultural machinery, it is possible to trace back even if a theft occurs. The proposed system also allows buyers to secure transactions by providing reliable data through inquiry of this system when trading in the secondary market in the future.

Image Segmentation Using Block Classification and Watershed Algorithm (블록분류와 워터쉐드를 이용한 영상분할 알고리듬)

  • Lim, Jae-Hyuck;Park, Dong-Kwon;Won, Chee-Sun
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.81-92
    • /
    • 1999
  • In this paper, we propose a new image segmentation algorithm which can be use din object-based image coding applications such as MPGA-4. Since the conventional objet segmentation methods based on mathematical morphology tend to yield oversegmented results, they normally need a postprocess which merges small regions to obtain a larger one. To solve this oversegmentation problem, in this paper, we prosed a block-based segmentation algorithm that can identify large texture regions in the image. Also, by applying the watershed algorithm to the image blocks between the homogeneous regions, we can obtain the exact pixel-based contour. Experimental results show that the proposed algorithm yields larger segments, particularly in the textural area, and reduces the computational complexities.

  • PDF

Adaptive Contrast Enhancement in DCT Domain (DCT영역에서의 적응적 대비 개선에 관한 연구)

  • Jeon, Yong-Joon;Eom, Min-Young;Choe, Yoon-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.5 s.305
    • /
    • pp.73-78
    • /
    • 2005
  • Images coded by DCT based compression contain several quality degradations by quantization process. Among them contrast distortion is the important one because human eyes are sensitive to contrast. In case of low bit-rate coded image, we can not get an image having good quality due to quantization error. In this paper, we suggest a new scheme to enhance image's contrast in DCT domain. Proposed method enhances only edge regions. Homogeneous regions are not considered in this method. $8{\times}8$ DCT coefficient blocks are decomposed to $4{\times}4$ sub-blocks for detail edge region discrimination. we could apply this scheme to real-time application because proposed scheme is DCT based method.

Fast Image Restoration Using Boundary Artifacts Reduction method (경계왜곡 제거방법을 이용한 고속 영상복원)

  • Yim, Sung-Jun;Kim, Dong-Gyun;Shin, Jeong-Ho;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.63-74
    • /
    • 2007
  • Fast Fourier transform(FFT) is powerful, fast computation framework for convolution in many image restoration application. However, an actually observed image acquired with finite aperture of the acquisition device from the infinite background and it lost data outside the cropped region. Because of these the boundary artifacts are produced. This paper reviewed and summarized the up to date the techniques that have been applied to reduce of the boundary artifacts. Moreover, we propose a new block-based fast image restoration using combined extrapolation and edge-tapering without boundary artifacts with reduced computational loads. We apply edgetapering to the inner blocks because they contain outside information of boundary. And outer blocks use half-convolution extrapolation. For this process it is possible that fast image restoration without boundary artifacts.