• 제목/요약/키워드: discrete data

검색결과 1,244건 처리시간 0.026초

POSTERIOR COMPUTATION OF SURVIVAL MODEL WITH DISCRETE APPROXIMATION

  • Lee, Jae-Yong;Kwon, Yong-Chan
    • Journal of the Korean Statistical Society
    • /
    • 제36권2호
    • /
    • pp.321-333
    • /
    • 2007
  • In the proportional hazard model with the beta process prior, the posterior computation with the discrete approximation is considered. The time period of interest is partitioned by small intervals. On each partitioning interval, the likelihood is approximated by that of a binomial experiment and the beta process prior is by a beta distribution. Consequently, the posterior is approximated by that of many independent binomial model with beta priors. The analysis of the leukemia remission data is given as an example. It is illustrated that the length of the partitioning interval affects the posterior and one needs to be careful in choosing it.

Parameter Investigation for Powder Compaction using Discrete-Finite Element Analysis

  • Choi, Jinnil
    • 한국분말재료학회지
    • /
    • 제22권5호
    • /
    • pp.337-343
    • /
    • 2015
  • Powder compaction is a continually and rapidly evolving technology where it is a highly developed method of manufacturing reliable components. To understand existing mechanisms for compaction, parameter investigation is required. Experimental investigations on powder compaction process, followed by numerical modeling of compaction are presented in this paper. The experimental work explores compression characteristics of soft and hard ductile powder materials. In order to account for deformation, fracture and movement of the particles, a discrete-finite element analysis model is defined to reflect the experimental data and to enable investigations on mechanisms present at the particle level. Effects of important simulation factors and process parameters, such as particle count, time step, particle discretization, and particle size on the powder compaction procedure have been explored.

DFT에 의한 비데오 코덱용 DCT의 단순한 시스톨릭 어레이 (A Simple Discrete Cosine Transform Systolic Array Based on DFT for Video Codec)

  • 박종오;이광재;양근호;박주용;이문호
    • 대한전자공학회논문지
    • /
    • 제26권11호
    • /
    • pp.1880-1885
    • /
    • 1989
  • In this paper, a new approach for systolic array realizing the discrete cosine transform (DCT) based on discrete Fourier transform (DFT) of an input sequence is presented. The proposed array is based on a simple modified DFT(MDFT) version of the Goertzel algorithm combined with Kung's approach and is proved perfectly. This array requires N cells, one multiplier and takes N clock cycles to produce a complete N-point DCT and also is able to process a continuous stream of data sequences. We have analyzed the output signal-to-noise ratio(SNR) and designed the circuit level layout of one-PE chip. The array coefficients are static adn thus stored-product ROM's can be used in place of multipliers to limit cost as eliminate errors due to coefficients quantization.

  • PDF

웨이브렛을 이용한 잡음 제거 알고리즘 (Denoising Algorithm using Wavelet)

  • 배상범;김남호
    • 한국정보통신학회논문지
    • /
    • 제6권8호
    • /
    • pp.1139-1145
    • /
    • 2002
  • 웨이브렛 변환 데이터는 신호의 상세 정보를 포함하고 있으므로 주파수 대역별로 필터링할 수 있다. 따라서, 본 논문에서는 중요한 두 가지 잡음을 웨이브렛을 사용하여 제거하였다. AWGN 환경에 대해서 hard-threshold를 적용한 UDWT(undecimated discrete wavelet transform)를 사용하였으며, 임펄스 잡음환경에 대해서는 임계치에 의한 잡음 제거와 웨이브렛에 의한 신호의 slope를 이용하여, 잡음 제거 효과를 최대로 함과 동시에 원신호의 edge를 인식하도록 하였다. 이러한 잡음 제거 효과의 판단 기준으로 SNR을 사용하였으며, 테스트 신호로서 Blocks와 DTMF(dual tone multi frequency)를 사용하였다.

VLSI 병렬 연산을 위한 여현 변환 알고리듬 (Discrete Cosine Transform Algorithms for the VLSI Parallel Implementation)

  • 조남익;이상욱
    • 대한전자공학회논문지
    • /
    • 제25권7호
    • /
    • pp.851-858
    • /
    • 1988
  • In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.

  • PDF

이산적 시뮬레이션 모델을 이용한 생산 스케쥴 (APPLICATION OF DISCRETE EVENT SIMULATION TO PRODUCTION SCHEDULING)

  • 박영홍
    • 한국시뮬레이션학회논문지
    • /
    • 제10권1호
    • /
    • pp.1-12
    • /
    • 2001
  • This article describes the application of discrete event simulation in a process industry (coffee manufacturing) as a daily production-scheduling tool. A large number of end products (around 300), sporadic demand, and limited shelf life of coffee (90 days) make it difficult to generate feasible production schedules manually. To solve this problem, an integrated system was developed incorporating discrete event simulation methodology into scheduling process. The integrated system is comprised of two components: a scheduling program and a simulation model. The scheduling program is used to generate daily schedules for roasting, grinding, and packing coffee. The simulation model uses the generated schedules to simulate the production of coffee and regenerates a modified production schedule. In this paper, each of the components will be described in detail, evaluated in terms of performance factors, and validated with a set of real production data. Although this article focuses on a specific system, we will share our experiences and Intuitions gained and encourage other process industries to develop simulation-based scheduling tools.

  • PDF

A two-parameter discrete distribution with a bathtub hazard shape

  • Sarhan, Ammar M.
    • Communications for Statistical Applications and Methods
    • /
    • 제24권1호
    • /
    • pp.15-27
    • /
    • 2017
  • This paper introduces a two-parameter discrete distribution based on a continuous two-parameter bathtub distribution. It is the only two-parameter discrete distribution that shows a bathtub-shaped hazard function. Some statistical properties of the distribution are discussed. Three different methods are used to estimate its two unknown parameters. The point estimators of the parameters have no closed form. The bootstrap method is used to estimate the distributions of these point estimators. Different approximations of the interval estimations for the two-parameters are discussed. Real data sets are analyzed to show how this distribution works in practice. A simulation study is performed to investigate the properties of the estimations obtained and compare their performances.

비연속시간 생존분석을 적용한 청소년의 최초 가출 발생시점에 대한 영향요인 연구 (Determinants of the Onset of Adolescent Runaway Behavior : An Application of Discrete-Time Survival Analysis)

  • 홍세희;김동기
    • 아동학회지
    • /
    • 제28권2호
    • /
    • pp.217-233
    • /
    • 2007
  • The present study investigated the effects of individual, family, school, and community factors on the onset of adolescent runaway behavior. Using the Korean Youth Panel data(n=3,118), discrete-time survival analysis was applied for research purposes. Results showed that the likelihood of onset of adolescent runaway behavior increased sharply during the early middle school years. The variables of self-control, aggression, parents' divorce, paternal abuse, attachment with parents, and number of delinquent peers were associated with the likelihood of runaway behavior. These results suggest that special attention should be paid to adolescents in the early middle school years and that various preventive programs, e.g., aggression and stress management, and peer relations programs, should be developed and implemented.

  • PDF

디지털 필터링을 이용한 무효전력 제어에 관한 연구 (A Study on a Reactive Power Control using Digital Filtering)

  • 우천희;강신준;이덕규;우광방;이성환
    • 제어로봇시스템학회논문지
    • /
    • 제4권4호
    • /
    • pp.517-524
    • /
    • 1998
  • This paper discusses the development of a reactive power controller using digital signal processing. Digital Signal Processing is the technique of using digital devices to Process continuous signals or data, often in real-time. And DSP algorithms are associated with a discrete time interval between input samples. When one designs a digital filter, one can use a Laplace transform to determine the continuous time frequency response. The corresponding discrete time transform is called Z transform and depends upon discrete samples of the input spaced equally in time. The objectives of this paper are to minimize real power losses and improve the power factor of a given system. Also, the implementation of a direct-form non recursive filter on the TMS320C31 has been described. The application of this microprocessor-based controller using DSP on test system reveals its numerous advantages. Performance and features of the controller for the reactive power control are analyzed.

  • PDF

MDCT/IMDCT의 효율적인 구현을 위한 새로운 알고리즘 (A New Algorithm for An Efficient Implementation of the MDCT/IMDCT)

  • 조양기;이원표;인치호;김희석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2471-2474
    • /
    • 2003
  • The modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) are employed in subband/transform coding schemes as the analysis/synthesis filter bank based on time domain aliasing cancellation (TDAC). And they are the most computational intensive operations in layer III of the MPEG audio coding standard. In this paper, we propose a new efficient algorithm for the MDCT/IMDCT computation. It is based on the MDCT/IMDCT computation algorithm using the discrete cosine transforms (DCTs), and it employs two discrete cosine transform of type II(DCT-II) to compute the MDCT/IMDCT. In addition to, it takes advantage of ability in calculating the MDCT/IMDCT computation, where the length of a data block is divisible by 4. The proposed algorithm in this paper requires less calculation complexity than the existing methods. Also, it can be implemented by the parallel structure,, and its structure is particularly suitable for VLSI realization.

  • PDF