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

검색결과 331건 처리시간 0.028초

Determination of tunnel support pressure under the pile tip using upper and lower bounds with a superimposed approach

  • Lee, Yong-Joo
    • Geomechanics and Engineering
    • /
    • 제11권4호
    • /
    • pp.587-605
    • /
    • 2016
  • This study aimed to develop upper and lower bounds to predict the tunnel support pressure under the pile tip during the circular tunnel excavation. Most previous studies on the upper and lower bound methods were carried out for the single ground structures, e.g., retaining wall, foundation, ground anchor and tunnel, in the homogeneous ground conditions, since the pile-soil-tunnel interaction problem is very complicated and sophisticated to solve using those bound methods. Therefore, in the lower bound approach two appropriate stress fields were proposed for single pile and tunnel respectively, and then they were superimposed. In addition, based on the superimposition several failure mechanisms were proposed for the upper bound solution. Finally, these upper bound mechanisms were examined by shear strain data from the laboratory model test and numerical analysis using finite element method.

Branch and Bound Approach for Single-Machine Sequencing with Early/Tardy Penalties and Sequence-Dependent Setup Cost

  • Akjiratikarl, Chananes;Yenradee, Pisal
    • Industrial Engineering and Management Systems
    • /
    • 제3권2호
    • /
    • pp.100-115
    • /
    • 2004
  • The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

An alternative approach to extreme value analysis for design purposes

  • Bardsley, Earl
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2016년도 학술발표회
    • /
    • pp.201-201
    • /
    • 2016
  • The asymptotic extreme value distributions of maxima are a natural choice when designing against future extreme events like flood peaks or wave heights, given a stationary time series. The generalized extreme value distribution (GEV) is often utilised in this context because it is seen as a convenient single expression for extreme event analysis. However, the GEV has a drawback because the location of the distribution bound relative to the data is a discontinuous function of the GEV shape parameter. That is, for annual maxima approximated by the Gumbel distribution, the data is also consistent with a GEV distribution with an upper bound (no lower bound) or a GEV distribution with a lower bound (no upper bound). A more consistent single extreme value expression for design purposes is proposed as the Weibull distribution of smallest extremes, as applied to transformed annual maxima. The Weibull distribution limit holds here for sufficiently large sample sizes, irrespective of the extreme value domain of attraction applicable to the untransformed maxima. The Gumbel, Type 2, and Type 3 extreme value distributions thus become redundant, together with the GEV, because in reality there is only a single asymptotic extreme value distribution required for design purposes - the Weibull distribution of minima as applied to transformed maxima. An illustrative synthetic example is given showing transformed maxima from the normal distribution approaching the Weibull limit much faster than the untransformed sample maxima approach the normal distribution Gumbel limit. Some New Zealand examples are given with the Weibull distribution being applied to reciprocal transformations of annual flood maxima, where the untransformed maxima follow apparently different extreme value distributions.

  • PDF

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

수직 Bridgman 법에 의한 CdTe 단결정 성장과 특성 (Growth and characterization of CdTe single crystal by vertical Bridgman method)

  • 홍명석;홍광준
    • 센서학회지
    • /
    • 제14권6호
    • /
    • pp.369-373
    • /
    • 2005
  • High quality CdTe single crystal for the solar cell fabrication was grown by vertical Bridgman method. The etch pits patterns of (111) surfaces of CdTe etched by Nakagawa solution was observed the (111)A compesed of Cd atoms with typical triangle etch pits of pyramid mode. From the photoluminescence measurement on (111)A, we observed free exciton ($E_{x}$) existing only high quality crystal and neutal acceptor bound exciton ($A^{0}$,X) having very strong peak intensity. Then, the full width at half maximum and binding energy of neutral acceptor bound exciton were 7 meV and 5.9 meV, respectively. By Haynes rule, an activation enery of impurity was 59 meV. Therefore, the origins on impurity level acting as a neutral acceptor were associated Ag or Cu elements.

Membrane-bound p35 Subunit of IL-12 on Tumor Cells is Functionally Equivalent to Membrane-bound Heterodimeric Single Chain IL-12 for Induction of Anti-tumor Immunity

  • Hyun-Jin Kim;Sang Min Park;Hayyoung Lee;Young Sang Kim
    • IMMUNE NETWORK
    • /
    • 제16권5호
    • /
    • pp.305-310
    • /
    • 2016
  • In this study, we compared two different tumor cell vaccines for their induction of anti-tumor immunity; one was a tumor cell clone expressing a membrane-bound form of IL-12 p35 subunit (mbIL-12 p35 tumor clone), and the other was a tumor clone expressing heterodimeric IL-12 as a single chain (mb-scIL-12 tumor clone). The stimulatory effect of mb-scIL-12 on the proliferation of ConA-activated splenocytes was higher than that of mbIL-12 p35 in vitro. However, the stimulatory effect of mbIL-12 p35 was equivalent to that of recombinant soluble IL-12 (3 ng/ml). Interestingly, both tumor clones (mbIL-12 p35 and mb-scIL-12) showed similar tumorigenicity and induction of systemic anti-tumor immunity in vivo, suggesting that tumor cell expression of the membrane-bound p35 subunit is sufficient to induce anti-tumor immunity in our tumor vaccine model.

Hot Wall Epitaxy(HWE)에 의한 $ZnGa_2Se_4$단결정 박막 성장과 특성에 관한 연구 (Growth and Characterization of $ZnGa_2Se_4$ Single Crystal Thin Films by Hot Wall Epitaxy)

  • 장차익;홍광준;정준우;백형원;정경아;방진주;박창선
    • 한국결정학회지
    • /
    • 제12권3호
    • /
    • pp.127-136
    • /
    • 2001
  • ZnGa₂Se₄단결정 박막은 수평 전기로에서 함성한 ZnGa₂Se₄다결정을 증발원으로하여, hot wall epitaxy(HWE) 방법으로 증발원과 기판(반절연성-GaAs(100))의 온도를 각각 610℃, 450℃로 고정하여 단결정 박막을 성장하였다. 10 K에서 측정한 광발광 exciton 스펙트럼과 이중결정 X-선 요동곡선(DCRC)의 반치폭(FWHM)을 분석하여 단결정 박막의 최적 성장 조건을 얻었다. Hall효과는 van der Pauw방법에 의해 측정되었으며, 온도에 의존하는 운반자 농도와 이동도는 293 K에서 각각 9.63×10/sup 17/㎤, 296 ㎠/V·s였다. 광전류 봉우리의 10 K에서 단파장대의 가전자대 갈라짐(splitting)에의해서 측정된 Δcr (crystal field splitting)은 183.2meV, △so (spin orbit splitting)는 251.9meV였다. 10K의 광발광 측정으로부터 고품질의 결정에서 볼 수 있는 free exciton 과 매우 강한 세기의 중성 받개 bound exciton등의 피크가 관찰되었다. 이때 중성 받개 bound exciton등의 피크가 관찰되었다. 이때 중성 반개 bound excition의 반치폭과 결합에너지는 각각 11meV와 24.4meV였다. 또한 Hanes rule에 의해 구한 불순물의 활성화 에너지는 122meV였다.

  • PDF

엔빌로프 기반 하한을 사용한 효율적인 회전-불변 윤곽선 이미지 매칭 (Efficient Rotation-Invariant Boundary Image Matching Using the Envelope-based Lower Bound)

  • 김상필;문양세;홍선경
    • 정보처리학회논문지D
    • /
    • 제18D권1호
    • /
    • pp.9-22
    • /
    • 2011
  • 본 논문에서는 윤곽선 이미지 매칭에서 회전-불변 거리 계산의 효율적 방법을 제안한다. 회전-불변 거리 계산은 이미지 시계열을 한 칸씩 회전하면서 매번 유클리디안 거리를 계산해야 하는 고비용의 연산이다. 본 논문에서는 엔빌로프 기반 하한을 사용하여 회전-불변 거리 계산을 크게 줄이는 획기적인 해결책을 제시한다. 이를 위해, 먼저 질의 시퀀스 대상의 단일 엔빌로프 작성과 이의 하한 개념을 제시하고, 이를 회전-불변 거리 계산에 사용하면 많은 수의 회전-불변 거리 계산을 줄일 수 있음을 보인다. 그런데, 단일 엔빌로프 기법은 하나의 엔빌로프가 가능한 모든 회전 시퀀스를 포함하기 때문에 하한이 커지고, 이에 따라 매칭 성능이 저하되는 문제점이 있다. 이러한 문제점을 해결하기 위하여, 본 논문에서는 회전 구간의 개념을 도입하여 단일 엔빌로프 기반 하한을 다중 엔빌로프 기반 하한 개념으로 확장한다. 또한, 다중 엔빌로프 기법에서 회전 구간을 결정하기 위한 방법으로 동일-너비 기법과 엔빌로프 최소화 기법을 제안한다. 실험 결과, 제안한 엔빌로프 기반 매칭 기법은 기존 기법에 비해 최대 수 배에서 수십 배까지 매칭 성능을 향상시킨 것으로 나타났다.

Degrees of Freedom of Y Channel with Single-Antenna Users: Transmission Scheme and Beamforming Optimization

  • Long, Wei;Gao, Hui;Lv, Tiejun;Yuen, Chau
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권12호
    • /
    • pp.4305-4323
    • /
    • 2014
  • In this paper, we investigate the degrees of freedom (DOF) of the Y channel consisting of three single-antenna users and a two-antenna common access relay, where each user intends to exchange independent messages with the other two users with the assistance of the relay. We show that the DOF of this particular scenario is 1.5. In order to prove this result, we firstly derive a DOF upper bound based on cut-set bound by allowing cooperation among users, which shows that the total DOF is upper bounded by 1.5. Then we propose a novel transmission scheme based on asymmetric signal space alignment (ASSA) to demonstrate the achievability of the upper bound. Theoretical evaluation and numerical results confirm that the upper bound can be achieved by utilizing ASSA, which also proves the optimality of the ASSA-based scheme in terms of DOF. Combining the upper bound and achievability, we conclude that the exact DOF is 1.5. Moreover, we present a novel iterative joint beamforming optimization (I-JBO) algorithm to further improve the sum rate. Numerical simulations have been provided to demonstrate the convergence speed and performance advantage of the I-JBO algorithm.

Enhanced Upper Bound for Erasure Recovery in SPC Product Codes

  • Muqaibel, Ali
    • ETRI Journal
    • /
    • 제31권5호
    • /
    • pp.518-524
    • /
    • 2009
  • Single parity check (SPC) product codes are simple yet powerful codes that are used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under erasure scenarios and to develop a closed-form tight upper bound for the post-decoding erasure rate. Closed-form exact expressions are derived for up to seven erasures. Previously published closed-form bounds assumed that all unrecoverable patterns should contain four erasures in a square. Additional non-square patterns are accounted for in the proposed expressions. The derived expressions are verified using exhaustive search. Eight or more erasures are accounted for by using a bound. The developed expressions improve the evaluation of the recoverability of SPC product codes without the need for simulation or search algorithms, whether exhaustive or novel.