• Title/Summary/Keyword: Single-Bound

Search Result 331, Processing Time 0.026 seconds

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

  • Lee, Yong-Joo
    • Geomechanics and Engineering
    • /
    • v.11 no.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
    • /
    • v.3 no.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
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2016.05a
    • /
    • 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
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.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

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

  • Hong, Myung-Seok;Hong, Kwang-Joon
    • Journal of Sensor Science and Technology
    • /
    • v.14 no.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
    • /
    • v.16 no.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.

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

  • 장차익;홍광준;정준우;백형원;정경아;방진주;박창선
    • Korean Journal of Crystallography
    • /
    • v.12 no.3
    • /
    • pp.127-136
    • /
    • 2001
  • A stoichiometric mixture of evaporating materials for ZnGa₂Se₄single crystal thin films was prepared from horizontal furnace. To obtain the single crystal thin films, ZnGa₂Se₄mixed crystal was deposited on thoroughly etched semi-insulating GaAs(100) substrate by the Hot Wall Epitaxy (HWE) system. The source and substrate temperatures were 610℃ and 450℃, respectively. The crystalline structure of the single crystal thin films was investigated by the photoluminescence and double crystal X-ray diffraction (DCXD). The carrier density and mobility of ZnGa₂Se₄single crystal thin films measured from Hall effect by von der Pauw method are 9.63×10/sup 17/㎤ and 296 ㎠/V·s at 293 K, respectively. From the photocurrent spectrum by illumination of perpendicular light on the c-axis of the ZnGa₂Se₄single crystal thin film, we have found that the values of spin orbit splitting △so and the crystal field splitting Δcr were 251.9meV and 183.2 meV at 10 K, respectively. From the photoluminescence measurement on th ZnGa₂Se₄single crystal thin film, we observed free excition (Ex) existing only high quality crystal and neutral bound exiciton (A°, X) having very strong peak intensity. Then, the full-width-at-half-maximum (FWHM) and binding energy of neutral acceptor bound excition were 11 meV and 24.4 meV, respectivity. By Haynes rule, an activation energy of impurity was 122 meV.

  • PDF

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

  • Kim, Sang-Pil;Moon, Yang-Sae;Hong, Sun-Kyong
    • The KIPS Transactions:PartD
    • /
    • v.18D no.1
    • /
    • pp.9-22
    • /
    • 2011
  • In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.

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)
    • /
    • v.8 no.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
    • /
    • v.31 no.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.