• Title/Summary/Keyword: large block

Search Result 991, Processing Time 0.026 seconds

Development of a Process Control Language Using Function Block Configuration (기능블록 구성에 의한 공정제어 언어의 개발)

  • Byung Kook Kim
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.24-34
    • /
    • 1992
  • A process control language is developed using function block configuration, to simplify software development for large scale process control systems, and to implement advanced control algorithms with ease. A function block parser and controller is implemented to be suitable for multi-loop control systems having hierachical structure. On-line change of controller parameter is possible, and inclusion of user defined function block is also possible. By adding plant model block, control performance can be checked in advance. Function blocks of the Smith Predicotor, auto-tuners are implemented to demonstrate usefulness of function block configuration.

  • PDF

A Study on the Soft Ground Distubance Characteristics by Large Block Sample (대형자연시료를 이용한 지반교란 특성에 관한 연구)

  • Yu, Seong-Jin
    • Journal of the Korea Construction Safety Engineering Association
    • /
    • s.43
    • /
    • pp.98-106
    • /
    • 2007
  • In this paper, a ground disturbance effects, strength and consolidation characteristics of soft clay through using the large block samples($\theta$:300mm, H:400mm) and the piston samples, f hose which had been gathered in west coast and south coast. Especially, we have assessed the coefficient of horizontal consolidation when penetrating the mandrel considering the variance of ratio between diameter and height in drainage sample through the experiment of the oedometer test and Rowecell and also investigated the disturbance area in smear zone by interior model test, the strength originated by disturbance, the variance in characteristics of the consolidation. As the result, the large block sample has been investigated that ihe uniaxial compression test(qu) was shown bigger than the piston sample by about 11-19%. Under the size of anistropy in consolidation, the coefficient ratio of consolidation(ch/cv,) perfomed by standard consolidation test(SC) was shown bigger than that of (Cro/Cv) by the Rowecell test. And the coefficient ratio of consolidation(Cro/Cv) perfomed by piston sample was evaluated bigger than that Of (Cro/Cv) by the large block sample by about 0.9-1.9. The coefficient ratio of consolidation along with the variance in ratio of between diameter and height when penetrating the mandrel was shown big difference according to the characteristics of soil of the specimen. In addition, ds/dw of smear zone at the marine clay in west-south was ranged from 1.6 to 4.2. The width of variance in rat io[(qud)/(quud)] of strength n the area between disturbance and undisturbance was shown big as about 72-91% but the principle was judged with the similiar range when the decrease of the strength in smear zone become the zone under 25% in unditurbance area.

  • PDF

The Development of Flaw Detection in Concrete by the Impact-Echo Testing Method (충격탄성파법을 이용한 콘크리트 내부의 결함탐상 기술개발)

  • 박선균;임창덕
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 1991.04a
    • /
    • pp.105-110
    • /
    • 1991
  • The conventional high-frequency testing method is difficult to detect flaw in concrete because the high frequency stress wave is strongly attenuated due to the large grain size and heterogeneous structure. For restoration of this problem, we develop the stu요 of flaw detection in large concrete block containing various artificial flaws by low frequency spectrum anlysis of impact-echo waveforms. This impact-echo testing method is possible to determine the flaw size, shape and location in large concrete block even if required some attention in case of containing reinforcing steel bar.

  • PDF

Fast Motion Estimation Algorithm Using Limited Sub-blocks (제한된 서브블록을 이용한 고속 움직임 추정 알고리즘)

  • Kim Seong-Hee;Oh Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3C
    • /
    • pp.258-263
    • /
    • 2006
  • Each pixel in a matching block does not equally contribute to block matching and the matching error is greatly affected by image complexity. On the basis of the facts, this paper proposes a fast motion estimation algorithm using some sub-blocks selected by the image complexity. The proposed algorithm divides a matching block into 16 sub-blocks, computes the image complexity in every sub-block, executes partial block matching using some sub-blocks with large complexity, and detects a motion vector. The simulation results show that the proposed algorithm brings about negligible image degradation, but can reduce a large amount of computation in comparison with conventional algorithms.

Edge-Preserving Algorithm for Block Artifact Reduction and Its Pipelined Architecture

  • Vinh, Truong Quang;Kim, Young-Chul
    • ETRI Journal
    • /
    • v.32 no.3
    • /
    • pp.380-389
    • /
    • 2010
  • This paper presents a new edge-protection algorithm and its very large scale integration (VLSI) architecture for block artifact reduction. Unlike previous approaches using block classification, our algorithm utilizes pixel classification to categorize each pixel into one of two classes, namely smooth region and edge region, which are described by the edge-protection maps. Based on these maps, a two-step adaptive filter which includes offset filtering and edge-preserving filtering is used to remove block artifacts. A pipelined VLSI architecture of the proposed deblocking algorithm for HD video processing is also presented in this paper. A memory-reduced architecture for a block buffer is used to optimize memory usage. The architecture of the proposed deblocking filter is verified on FPGA Cyclone II and implemented using the ANAM 0.25 ${\mu}m$ CMOS cell library. Our experimental results show that our proposed algorithm effectively reduces block artifacts while preserving the details. The PSNR performance of our algorithm using pixel classification is better than that of previous algorithms using block classification.

Block layout method in the block stockyard based on the genetic algorithm

  • Roh, Myung-Il
    • Ocean Systems Engineering
    • /
    • v.2 no.4
    • /
    • pp.271-287
    • /
    • 2012
  • Due to its large size, a ship is first divided into scores of blocks and then each block is constructed through various shops, such as the assembly shop, the painting shop, and the outfitting shop. However, each block may not be directly moved to the next shop and may be temporarily laid at a block stockyard because the working time in each shop is different from each other. If blocks are laid at the block stockyard without any planning, the rearrangement of the blocks by a transporter is required because the blocks have the different in and out time. In this study, a block layout method based on the genetic algorithm was proposed in order to minimize the rearrangement of the blocks in the block stockyard. To evaluate the applicability of the proposed method, it was applied to simple layout problems of the block stockyard. The result shows that the proposed method can yield a block layout that minimizes the total relocation cost of moving obstacle blocks in the block stockyard.

A Variable Size Block Matching Algorithm Using Local Characteristics of Images (영상의 국부적 성질을 이용한 가변 크기 블록 정합 알고리즘)

  • 김진태;최종수;박래홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.7
    • /
    • pp.62-69
    • /
    • 1992
  • The conventional BMA is performed with the fixed block size. For better performance at low bitrate, the block size is required to be large in relatively stationary area, while small in moving area. Thus, in this paper, a video coding technique using variable block size model is proposed. It decides the block size based on the degree of local motion defined by the local mean and variance of blocks. Computer simulation shows that the proposed method gives comparable performance to the conventional one with less bits required for motion vector coding.

  • PDF

Design of Beam Sections under Large Flexural Deformation

  • Kim, Jang-Hoon
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2003.11a
    • /
    • pp.248-251
    • /
    • 2003
  • The ACI 318 stress block parameters have been closely examined for validity of their values in evaluation of flexural strength and deformability. For this the conventional definition of stress block has been used. The comparison of parameter values between ACI stress blocks and the exact approach implies that an alternative idealization other than the rectangular stress block may be required.

  • PDF

Complexity Reduction Method for SVC Encoder Adopting Large Block (Large Block 을 적용한 SVC 부호화기의 복잡도 감소 기법)

  • Park, Un-Ki;Kim, Jae-Gon;Jeong, Dae-Gwon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.267-269
    • /
    • 2011
  • 본 논문에서는 기존에 제시된 LB 기법을 이용할 경우 발생하는 증가한 복잡도를 감소 시키는 기법을 다룬다. LB(Large Block)는 HEVC(High Efficiency Video Coding)의 대표적인 부호화 툴로 H.264/SVC(Scalable Video Coding)에 적용한 경우에도 상당한 부호화 효율의 개선을 보인다. 그러나, LB 를 적용하면 매크로블록 레벨에서 추가적인 부호화 과정이 요구되므로, 부호화기의 복잡도가 증가하는 문제점이 발생한다. 따라서, 본 논문에서는 LB 를 적용한 SVC 의 부호화기 복잡도를 감소시키는 기법을 제시하고 모의실험을 통해 제안된 부호화 기법의 RD 성능과 부호화기 복잡도를 확인한다. 실험결과 제안된 기법을 사용한 부호화 기법이 기존의 부호화 방법에 비해, RD 측면에서 평균 1.8%의 미미한 손실이 있으나, 복잡도 측면에서 평균 12%의 이득이 있음을 확인 하였다.

  • PDF

GNUnet improvenemt for anonymity supporing in large multimedia file (대형 멀티미디어 파일의 익명성 지원을 위한 수정 GNUnet)

  • Lee Myoung-Hoon;Park Byung-Yeon;Jo In-June
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.81-90
    • /
    • 2006
  • The GNUnet proposed a file encoding method by 1KB block size to support anonimity of files, decentralizes encoded block to peers through unstructed mode and original data decoding method a block searching or encoded blocks. but, the encoding and block decentralizing method with $600\sim700MB$ large multimedia file appered two problems. First problem, it need addition R block and I block, which make about 4% of storage resource. Second problem, unstructured model added network load by broadcasting decentralizing method. Third problem, The critical point of keyword search function. This paper suggest variable encoding block size and structured model by block decentralizing solution. Suggested encoding method reduced block request supplementary block generation from 4% to 1%, network load by proposal structured model sending answer through dedicated peer to decentralize block and we defined content-based keyword and identifier of sharing file.

  • PDF