• Title/Summary/Keyword: block time

Search Result 2,924, Processing Time 0.029 seconds

Design and Implementation of PS-Block Timing Model Using PS-Block Structue (PS-Block 구조를 사용한 PS-Block Timing Model의 설계 및 구현)

  • Kim Yun-Kwan;Shin Won;Chang Chun-Hyon;Kim Tae-Wan
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.399-404
    • /
    • 2006
  • A real-time system is used for various systems from small embedded systems to distributed enterprise systems. Because it has a characteristic that provides a service on time, developers should make efforts to keep this property about time when developing real-time applications. As the result of research about real-time system indicates, TMO model supports various functions for time processing according to the real-time concept. And it guarantees response time which developers defined. So developers need a point of reference to define deadline and check the correctness of time. This paper proposes an improved PS-Block as an infrastructure of analysis tools for TMO to present a point of reference. There is a problem that the existing PS-Block has overhead caused by a policy making duplicated blocks. As such, this paper implements a PS-Block Timing Model to reduce the overhead due to block duplication, and defines a base class for searching in PS-Block. The PS-Block Timing Model, using an improved PS-Block structure, offers a point of reference of deadline and an infrastructure of execution time analysis according to the PS-Block configuration policy. Therefore, TMO developers can easily verify deadline of real-time methods, and improve reliability, and reduce development terms.

Real-time fractal coding implementation using the PC (PC를 이용한 실시간 프랙탈 부호화 구현)

  • 김재철;박종식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2789-2800
    • /
    • 1996
  • Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.

  • PDF

A Bitmap-based Continuous Block Allocation Scheme for Realtime Retrieval Service (실시간 재생 서비스를 위한 비트맵 방식의 연속 블록 할당 기법)

  • 박기현
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.316-322
    • /
    • 2002
  • In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.

  • PDF

Ignition of a solid fuel by thermal radiation (열복사에 의한 고체연료 점화 연구)

  • Kim, Myeong-Hyo;Baek, Seung-Uk
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.22 no.3
    • /
    • pp.294-302
    • /
    • 1998
  • Ignition characteristics of a vertical solid fuel plate with block have been investigated experimentally. For low radiant heat flux, ignition does not occur in a vertical solid fuel plate without block. In the case with the block on a vertical fuel plate, however, ignition can occur by increasing the residence time and the time to absorb the incident radiation flux by fuel vapor in gas phase. The ignition occurs below block and the point varies according to the block location and the block height. As the block height increases, the block locates at higher position, and the hot wall temperature increases, the ignition delay time decreases. Also as the initial temperature of fuel plate rises, the ignition delay time of the solid fuel plate decreases. The temperature distribution of solid fuel plate with block is nearly proportional to the radiant heat flux distribution. Therefore, the effect temperature by natural convection heat transfer is of the same order as that of inhibition of temperature increase by pyrolysis.

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.

Analysis of Linear Time-invariant System by Using a New Block Pulse Operational Matrices (새로운 일반형 블럭 펄스 적분 연산 행렬을 이용한 선형 시불변 시스템 해석)

  • Lee, Hae-Ki;Kim, Tai-Hoon
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.53 no.4
    • /
    • pp.175-182
    • /
    • 2004
  • This paper presents a new method for finding the Block Pulse series coefficients, deriving the Block Pulse integration operational matrices and generalizing the integration operational matrices which are necessary for the control fields using the Block Pulse functions. In order to apply the Block Pulse function technique to the problems of state estimation or parameter identification more efficiently, it is necessary to find the more exact value of the Block Pulse series coefficients and integral operational matrices. This paper presents the method for improving the accuracy of the Block Pulse series coefficients and derives generalized integration operational matrix and applied the matrix to the analysis of linear time-invariant system.

Parameter Estimation of The Distributed System via Improved Block Pulse Coefficients Estimation

  • Kim, Tai-hoon;Shim, Jae-sun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.61.6-61
    • /
    • 2002
  • In these days, Block Pulse functions are used in a variety of fields such as the analysis and controller design of the systems. In applying the Block Pulse function technique to control and systems science, the integral operation of the Block Pulse series plays important roles. This is because differential equations are always involved in the representations of continuous-time models of dynamic systems, and differential operations are always approximated by the corresponding Block Pulse series through integration operational matrices. In order to apply the Block Pulse function technique to the problems of continuous-time dynamic systems more efficiently, it is necessary to find th...

  • PDF

STF-OFDM Transmission Scheme with Frequency Diversity (주파수 다이버시티를 갖는 STF-OFDM 전송 기법)

  • 박상순;황호선;백흥기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2C
    • /
    • pp.206-212
    • /
    • 2004
  • In this paper, we propose a STF(Space-Time-Frequency) coded OFDM(Orthogonal Frequency Division Multiplexing) transmission scheme as an attractive solution for high bit rate data transmission in a multipath fading environment. STBC(Space-Time Block Coding) has been proposed as a simple diversity scheme using two transmit antennas. Also ST-OFDM(Space-Time Block Coded OFDM) and SF-OFDM(Space-Frequency Block Coded OFDM) transmission scheme, that the STBC is applied to the OFDM, has been proposed. In this paper, we propose STF-OFDM transmission scheme that to coded in time, space and frequency domain. The STF-OFDM transmission scheme that we propose in this paper is the way to improve a performance of conventional ST-OFDM, by using frequency diversity.

Realistic Analysis Method for Continuously Block-Placed Mass Concrete Structures Considering Block Size and Sequence of Concrete Placement (매스 콘크리트 구조물의 연속 분할타설시 타설블록의 크기 및 타설순서를 고려한 합리적인 수화열 해석)

  • 오병환;전세진;유성원
    • Journal of the Korea Concrete Institute
    • /
    • v.11 no.3
    • /
    • pp.59-67
    • /
    • 1999
  • The mass concrete structures are generally constructed in an incremental manner by deviding the whole structures by a series of many blocks. The temperature and stress distributions of any specific block are continuously affected by the blocks placed before and after the specific block. For an accurate analysis of mass concrete structures, the sequence of all the blocks must be accordingly considered including the change of material properties with time for those blocks considered. The purpose of this study is to propose a realistic analysis method which can take into account not only the influence of the sequence, time interval and size of concrete block placement on the temperatures and stresses, but also the change of material properties with time. It is seen from this study that the conventional simplified analysis, which neglects material property changes of some blocks with time and does not consider the effect of adjacent blocks in the analysis, may yield large discrepancies in the temperature and stress distributions of mass concrete structures. This study gives a method to choose the minimum number of blocks required to obtain reasonably accurate results in analysis. The study provides a realistic method which can determine the appropriate size and time interval of block placement, and can be efficiently used in the design and construction of mass concrete structures.

Transporter Scheduling Based on a Network Flow Model for Dynamic Block Transportation Environment (동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획)

  • Lee, Woon-Seek;Lim, Won-Il;Koo, Pyung-Hoi
    • IE interfaces
    • /
    • v.22 no.1
    • /
    • pp.63-72
    • /
    • 2009
  • This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.