• 제목/요약/키워드: Upper-Bound

검색결과 965건 처리시간 0.027초

ASYMPTOTIC BEHAVIOR OF SOLUTIONS FOR THE GENERALIZED MHD AND HALL-MHD SYSTEMS IN ℝn

  • Zhu, Mingxuan
    • 대한수학회보
    • /
    • 제55권3호
    • /
    • pp.735-747
    • /
    • 2018
  • This paper deals with the asymptotic behavior of solutions to the generalized MHD and Hall-MHD systems. Firstly, the upper bound for the generalized MHD and Hall-MHD systems is investigated in $L^2$ space. Then, the effect of the Hall term is analyzed. Finally, we optimize the upper bound of decay and obtain their algebraic lower bound for the generalized MHD system by using Fourier splitting method.

A NEW UPPER BOUND FOR SINGLE ERROR-CORRECTING CODES

  • Kim, Jun-Kyo
    • 대한수학회보
    • /
    • 제38권4호
    • /
    • pp.797-801
    • /
    • 2001
  • The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

  • PDF

축대칭 압출 공정에서 상계법을 이용한 금형 접족면압의 계산 (Calculation of Contact Pressure to the Die of Axisymmetric Extrusion by Using Upper Bound Solution)

  • 최영;여홍태;허관도
    • 한국정밀공학회지
    • /
    • 제21권12호
    • /
    • pp.133-139
    • /
    • 2004
  • In general, the contact pressure to the die cannot be easily determined by using upper bound solution. Recently, the authors have proposed the method determining the contact pressure with the upper bound solution for the forming with the plane stain plastic deformation. In this paper, the method is applied to an axisymmetric forward extrusion process. The contact pressure to the die of the axisymmetric extrusion has been determined with the upper bound solution and compared with the result of rigid plastic FEM. The optimal semi-angles of die have been obtained minimizing the relative contact pressure to die fur the extrusion ratio.

변형률 속도를 고려한 원형 튜브의 동적 좌굴 현상의 상계 해석에 관한 연구 (Upper Bound Analysis of Dynamic Buckling Phenomenon of Circular Tubes Considering Strain Rate Effect)

  • 박충희;고윤기;허훈
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2008년도 추계학술대회A
    • /
    • pp.711-716
    • /
    • 2008
  • A circular tube undergoes bucking behavior when it is subjected to axial loading. An upper bound analysis can be an attractive approach to predict the buckling load and energy absorption efficiently. The upper bound analysis obtains the load or energy absorption by means of assumption of the kinematically admissible velocity fields. In order to obtain an accurate solution, kinematically admissible velocity fields should be defined by considering many factors such as geometrical parameters, dynamic effect, etc. In this study, experiments and finite element analyses are carried out for circular tubes with various dimensions and loading conditions. As a result, the kinematically admissible velocity field is newly proposed in order to consider various dimensions and the strain rate effect of material. The upper bound analysis with the suggested velocity field accurately estimates the mean load and energy absorption obtained from results of experiment and finite element analysis.

  • PDF

상계해법과 유한요소법을 이용한 스피닝공정 해석에 관한 연구 (A study on the process of tube end spinning by the upper bound method and the finite element method)

  • 김전형;홍성인;이정환;이영선
    • 소성∙가공
    • /
    • 제6권6호
    • /
    • pp.517-526
    • /
    • 1997
  • The purpose of this study is to investigate changes in the wall thickness of tube sinking and working forces by the upper bound method and ABAQUS code. The independent variables are ; workpiece material, original wall thickness of tube, die angle, friction, and reduction of diameter. The results indicate that these five variables are factors of the increase in wall-thickness and working forces. Three variables, a inner tube wall angle and two angles of the velocity discontinuous surfaces, are optimized in this proposed velocity field by the upper bound method. In this method, we can estimate the working forces and final tube thicknesses similar to actual forming process. Optimum process variables which are obtained by upper bound method are used in ABAQUS pre-model.

  • PDF

Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

  • Chung, Kyu-Hyuk;Heo, Jun
    • Journal of Communications and Networks
    • /
    • 제10권1호
    • /
    • pp.5-9
    • /
    • 2008
  • Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

A New Upper Bound of Convolution-type for median-Unbiased Estimators

  • So, Beong-Soo
    • Journal of the Korean Statistical Society
    • /
    • 제28권1호
    • /
    • pp.35-44
    • /
    • 1999
  • We derive a new upper bound of convolution type for the median-unbiased estimators with respect to an arbitrary unimodal utility functions. We also obtain the necessary and sufficient condition for the attainability of the information bound. Applications to general MLR(Monotone Likelihood Ratio) model and censored survival data re discussed as examples.

  • PDF

이진 희소 신호의 L0 복원 성능에 대한 상한치 (Upper Bound for L0 Recovery Performance of Binary Sparse Signals)

  • 성진택
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2018년도 춘계 종합학술대회 논문집
    • /
    • pp.485-486
    • /
    • 2018
  • In this paper, we consider a binary recovery framework of the Compressed Sensing (CS) problem. We derive an upper bound for $L_0$ recovery performance of a binary sparse signal in terms of the dimension N and sparsity K of signals, the number of measurements M. We show that the upper bound obtained from this work goes to the limit bound when the sensing matrix sufficiently become dense. In addition, for perfect recovery performance, if the signals are very sparse, the sensing matrices required for $L_0$ recovery are little more dense.

  • PDF

LDPC Codes' Upper Bounds over the Waterfall Signal-to-Noise Ratio (SNR) Region

  • 정규혁
    • 한국통신학회논문지
    • /
    • 제33권11C호
    • /
    • pp.880-882
    • /
    • 2008
  • This paper presents LDPC codes' upper bounds over the waterfall SNR region. The previous researches have focused on the average bound or ensemble bound over the whole SNR region and showed the performance differences for the fixed block size. In this paper, the particular LDPC codes' upper bounds for various block sizes are calculated over the waterfall SNR region and are compared with BP decoding performance. For different block sizes the performance degradation of BP decoding is shown.

상계해석법을 이용한 평면변형 열간 판압연공정해석 (Upper Bound Analysis of Plane Strain Hot Strip Rolling Process)

  • 문영훈;천명식;이준성
    • 대한기계학회논문집A
    • /
    • 제20권8호
    • /
    • pp.2468-2479
    • /
    • 1996
  • An upper bound solution is obtained to perform the process analysis of hot strip rolling process. The material flows within the roll bite at various geometries and frictional conditions are obtained from finite element analysis and the typical flow pattern which is necessary to determine the kinematically admissible velocity field is assumed. From the kinematically admissible velocity field, the upper bound energy is calculated and the rolling load, angle of neutral point and forward slip ratio at various operational conditions are obtained from upper bound energy. The process analysis of above mentioned parameters at various operational conditions have provided valuable information which is hard to obtain during rolling operation and the predicted ranges of quantitive values from these analyses lie whthin the bound of actual operational data.