• Title/Summary/Keyword: 블록 합

Search Result 185, Processing Time 0.028 seconds

Fast Motion Estimation Algorithm Based on Thresholds with Controllable Computation (계산량 제어가 가능한 문턱치 기반 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.2
    • /
    • pp.84-90
    • /
    • 2019
  • Tremendous computation of full search or lossless motion estimation algorithms for video coding has led development of many fast motion estimation algorithms. We still need proper control of computation and prediction quality. In the paper, we suggest an algorithm that reduces computation effectively and controls computational amount and prediction quality, while keeping prediction quality as almost the same as that of the full search. The proposed algorithm uses multiple thresholds for partial block sum and times of counting unchanged minimum position for each step. It also calculates the partial block matching error, removes impossible candidates early, implements fast motion estimation by comparing times of keeping the position of minimum error for each step, and controls prediction quality and computation easily by adjusting the thresholds. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

Security Analysis of Blockchain Systems: Case Study of Cryptocurrencies (블록체인 시스템의 보안성 분석: 암호 화폐에서의 사례 연구)

  • Lee, Sungbum;Lee, Boohyung;Myung, Sein;Lee, Jong-Hyouk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.1
    • /
    • pp.5-14
    • /
    • 2018
  • With the advance of the 4th industrial revolution, Internet of Things (IoT) technology is actively being studied. In the era of the IoT, a decentralized operation is required to reduce load on servers and enable autonomous IoT data communication rather than focusing on centralized operation of being server client structures. This paper analyzes the security of a blockchain, a new form of distributed database platform that supports integrity and permanence of data. To achieve this, we divide the blockchain's major operations into a consensus process, network communication process, and key management process, and then describe possible attacks and countermeasures in each process. We also describe the attack occurred in typical cryptocurrency platforms such as Bitcoin and Ethereum.

Electrohydrodynamic Instability at Surface of Block Copolymer/Titania Nanorods Thin Film (타이타니아 나노막대가 포함된 블록 공중합체 박막 표면의 전기장하에서의 불안정성 거동 연구)

  • Bae, Joonwon
    • Applied Chemistry for Engineering
    • /
    • v.27 no.2
    • /
    • pp.205-209
    • /
    • 2016
  • The influence of titania nanorods with an average diameter of 10 nm and an average length of 30 nm on the electrohydrodynamic instability of block copolymer (polystyrene-b-poly(2-vinylpyridine)) thin film was investigated in this article. The presence of titania nanorods increased the dielectric constant of the film, which resulted in a systematic reduction in the wavelength of the surface instability. Cross-sectional transmission electron microscopy analysis indicated that the migration/aggregation of titania nanorods did not occur as a result of the applied electric field. This work can provide a simple route to the pattern formation using electrohydrodynamic instability with an aid of nanoparticles.

Fast Motion Estimation Algorithm using Filters of Multiple Thresholds (다중 문턱치 필터를 이용한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.4
    • /
    • pp.199-205
    • /
    • 2018
  • So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

A Depth-map Coding Method using the Adaptive XOR Operation (적응적 배타적 논리합을 이용한 깊이정보 맵 코딩 방법)

  • Kim, Kyung-Yong;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.274-292
    • /
    • 2011
  • This paper proposes an efficient coding method of the depth-map which is different from the natural images. The depth-map are so smooth in both inner parts of the objects and background, but it has sharp edges on the object-boundaries like a cliff. In addition, when a depth-map block is decomposed into bit planes, the characteristic of perfect matching or inverted matching between bit planes often occurs on the object-boundaries. Therefore, the proposed depth-map coding scheme is designed to have the bit-plane unit coding method using the adaptive XOR method for efficiently coding the depth-map images on the object-boundary areas, as well as the conventional DCT-based coding scheme (for example, H.264/AVC) for efficiently coding the inside area images of the objects or the background depth-map images. The experimental results show that the proposed algorithm improves the average bit-rate savings as 11.8 % ~ 20.8% and the average PSNR (Peak Signal-to-Noise Ratio) gains as 0.9 dB ~ 1.5 dB in comparison with the H.264/AVC coding scheme. And the proposed algorithm improves the average bit-rate savings as 7.7 % ~ 12.2 % and the average PSNR gains as 0.5 dB ~ 0.8 dB in comparison with the adaptive block-based depth-map coding scheme. It can be confirmed that the proposed method improves the subjective quality of synthesized image using the decoded depth-map in comparison with the H.264/AVC coding scheme. And the subjective quality of the proposed method was similar to the subjective quality of the adaptive block-based depth-map coding scheme.

Effect of Branching-agent Content on the Electrochemical Properties of Partially Fluorinated Poly(Arylene Ether Sulfone) Block Ionomer Membranes (부분불소계 Poly(Arylene Ether Sulfone) 블록이오노머막의 전기화학적 특성에 대한 분지체 함량의 효과)

  • Jeon, Seong-Hoon;Chang, Bong-Jun;Kang, Ho-Cheol;Kim, Jeong-Hoon;Joo, Hyeok-Jong
    • Membrane Journal
    • /
    • v.21 no.1
    • /
    • pp.1-12
    • /
    • 2011
  • Partially fluorinated poly(arylene ether sulfone) block ionomer membranes with different branch degree for fuel cell applications were investigated. A sulfonable monomer, a non-sulfonable monomer and a trifunctional branching agent were synthesized and the sulfonable monomer was oligomerized to obtain block structures. The oligomer was then further polymerized with the non-sulfonable monomer and the branching agent. The mole ratio of oligomer : non-sulfonable monomer was fixed at 4:6 and the content of the branching agent was varied from 0 to 2 mol% (BBC-40Bx). Post-sulfonation of BBC-40Bx was carried out using chlorosulfonic acid (CSA) (SBBC-40Bx). All the synthesized compounds were characterized by $^1H$-NMR, $^{19}F$-NMR and FT-IR. It was confirmed that the ion exchange capacity (IEC), water uptake and ion conductivity of SBBC-40Bx increased with the increment of branching agent content.

A System Recovery using Hyper-Ledger Fabric BlockChain (하이퍼레저 패브릭 블록체인을 활용한 시스템 복구 기법)

  • Bae, Su-Hwan;Cho, Sun-Ok;Shin, Yong-Tae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.2
    • /
    • pp.155-161
    • /
    • 2019
  • Currently, numerous companies and institutes provide services using the Internet, and establish and operate Information Systems to manage them efficiently and reliably. The Information System implies the possibility of losing the ability to provide normal services due to a disaster or disability. It is preparing for this by utilizing a disaster recovery system. However, existing disaster recovery systems cannot perform normal recovery if files for system recovery are corrupted. In this paper, we proposed a system that can verify the integrity of the system recovery file and proceed with recovery by utilizing hyper-ledger fabric blockchain. The PBFT consensus algorithm is used to generate the blocks and is performed by the leader node of the blockchain network. In the event of failure, verify the integrity of the recovery file by comparing the hash value of the recovery file with the hash value in the blockchain and proceed with recovery. For the evaluation of proposed techniques, a comparative analysis was conducted based on four items: existing system recovery techniques and data consistency, able to data retention, recovery file integrity, and using the proposed technique, the amount of traffic generated was analyzed to determine whether it was actually applicable.

Comparison of flexural strength according to thickness between CAD/CAM denture base resins and conventional denture base resins (CAD/CAM 의치상 레진과 열중합 의치상 레진의 두께에 따른 굴곡 강도 비교)

  • Lee, Dong-Hyung;Lee, Joon-Seok
    • Journal of Dental Rehabilitation and Applied Science
    • /
    • v.36 no.3
    • /
    • pp.183-195
    • /
    • 2020
  • Purpose: The purpose of this study is to compare the flexural strength of CAD/CAM denture base resins with conventional denture base resins based on their thicknesses. Materials and Methods: For the conventional denture base resins, Lucitone 199® (C-LC) was used. DIOnavi - Denture (P-DO) and DENTCA Denture Base II (P-DC) were taken for the 3D printing denture base resins. For the prepolymerized PMMA resins, Vipi Block Gum (M-VP) and M-IVoBase® CAD (M-IV) were used. The final dimensions of the specimens were 65.0 mm x 12.7 mm x 1.6 mm / 2.0 mm / 2.5 mm. The 3-point bend test was implemented to measure the flexural strength and flexural modulus. Microscopic evaluation of surface of fractured specimen was conducted by using a scanning electron microscope (SEM). After testing the normality of the data, one-way ANOVA was adopted to evaluate the differences among sample groups with a significance level of P = 0.05. The Tukey HSD test was performed for post hoc analysis. Results: Under the same thicknesses, there are significant differences in flexural strength between CAD/CAM denture base resins and conventional denture base resins except for P-DO and C-LC. M-VP showed higher flexural strength than conventional denture base resins, P-DC and M-IV displayed lower flexural strength than conventional denture base resins. Flexural modulus was highest in M-VP, followed by C-LC, P-DO, P-DC, M-IV, significant differences were found between all materials. In the comparison of flexural strength according to thickness, flexural strength of 2.5 mm was significantly higher than that of 1.6 mm in C-LC. Flexural strength of 2.5 mm and 2.0 mm was significantly higher than that of 1.6 mm in P-DC and M-VP. In M-IV, as the thickness increases, significant increase in flexural strength appeared. SEM analysis illustrates different fracture surfaces of the specimens. Conclusion: The flexural strength of different CAD/CAM denture base resins used in this study varied according to the composition and properties of each material. The flexural strength of CAD/CAM denture base resins was higher than the standard suggested by ISO 20795-1:2013 at a thickness of 1.6 mm or more though the thickness decreased. However, for clinical use of dentures with lower thickness, further researches should be done regarding other properties at lower thickness of denture base resins.

Dynamic Generation of Dimension Hierarchies for Fast Trend Analysis (고속 트렌드 분석을 위한 차원 계층구조 동적 생성 기법)

  • 김이은;임윤선;김명
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.118-120
    • /
    • 2004
  • OLAP의 주요 목표는 대용량 데이터를 다차원적으로 분석하여 그 결과를 신속하게 제공함으로써, 사용자의 의사 결정을 지원하는 것이다. 다차원 분석을 용이하게 하기 위해 차원 계층이 사전에 정의되고 표준화된 연산들이 사용되는데, 그러한 연산들로는 롤업, 드릴다운, 슬라이스, 다이스, 피봇을 들 수 있다. 그러나 분석과정에서 기존에 정의된 데이터의 그룹핑 이외의 다른 그룹핑 방식이 필요할 때가 있으며, 그러한 그룹핑으로 전체 데이터를 분석하는 것을 트렌드 분석이라고 한다. 트렌드 분석은 기업의 의사 결정에 매우 중요한 요소이나, 사전에 정의된 계층을 사용하는 것이 아니므로, 질의 처리 시에 트렌드 분석을 신속하게 하기는 어렵다. 본 연구에서는 트렌드 분석을 고속화하기 위한 방안으로 동적 계층 구조 생성을 제안한다. 특정 차원 기준으로 특정 범위 값으로 합산된 범위 합을 구하기 위해, 기존에 연구되었던 프리픽스섬 방식을 분석하여 문제점을 제시하였고 새로운 기법을 제안하였다. 또한 분석 시에 디스크 접근을 효율적으로 하기 위한 큐브 저장 방식을 제안하였다. 본 연구에서 제안한 방식으로 트렌드 분석을 하였을 때 접근해야 하는 디스크 블록 수도 계산하여 제안한 방법의 효율성을 검증하였다.

  • PDF

Blockchain and Consensus Algorithm (블록체인과 합의 알고리즘)

  • Yim, J.C.;Yoo, H.K.;Kwak, J.Y.;Kim, S.M.
    • Electronics and Telecommunications Trends
    • /
    • v.33 no.1
    • /
    • pp.45-56
    • /
    • 2018
  • A Blockchain is a type of distributed ledger system that consists of a large number of nodes. A block is a container in which transactions are included, and the transactions can be recorded in chronological order by chaining blocks. To work properly, it is essential that the nodes in the Blockchain system have the same image of the chained-blocks. Blockchain systems use various types of consensus algorithms to achieve the same states among the nodes, and the fundamental elements in these algorithms are proof of work and the main chain selection policy, particularly in permissionless Blockchain systems. However, consensus algorithms for permissioned Blockchain systems can be completely different from those of permissionless blockchain systems. In this paper, we overview the basic working mechanism of consensus algorithms, and briefly introduce a few that are currently being applied.