• Title/Summary/Keyword: lower and upper bound

Search Result 217, Processing Time 0.05 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.

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

  • Zhu, Mingxuan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.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.

Statistic Microwave Path Loss Modeling in Urban Line-of-Sight Area Using Fuzzy Linear Regression

  • Phaiboon, Supachai;Phokharatkul, Pisit;Somkurnpanit, Suripon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1249-1253
    • /
    • 2005
  • This paper presents a method to model the path loss characteristics in microwave urban line-of-sight (LOS) propagation. We propose new upper- and lower-bound models for the LOS path loss using fuzzy linear regression (FLR). The spread of upper- and lower-bound of FLR depends on max and min value of a sample path loss data while the conventional upper- and lower-bound models, the spread of the bound intervals are fixed and do not depend on the sample path loss data. Comparison of our models to conventional upper- and lower-bound models indicate that improvements in accuracy over the conventional models are achieved.

  • PDF

Upper and Lower Bound Solutions for Pile-Soil-Tunnel Interaction (한계해석법에 의한 파일-지반-터널 상호작용 해석)

  • Lee Yong-Joo;Shin Jong-Ho
    • 한국터널공학회:학술대회논문집
    • /
    • 2005.04a
    • /
    • pp.77-86
    • /
    • 2005
  • In urban areas, new tunnel construction work is often taking place adjacent to existing piled foundations. In this case, careful assessment for the pile-soil-tunnel interaction is required. However, research on this topic has not been much reported, and currently only limited information is available. In this study, the complex pile-soil-tunnel interaction is investigated using the upper and lower bound methods based on kinematically possible failure mechanism and statically admissible stress field respectively. It is believed that the limit theorem is useful in understanding the complicated interaction behaviour mechanism and applicable to the pile-soil-tunnel interaction problem. The results are compared with numerical analysis. The material deformation patterns and strain data from the FE output are shown to compare well with the equivalent physical model tests. Admissible stress fields and the failure mechanisms are presented and used to develop upper and lower bound solutions to assess minimum support pressures within the tunnel.

  • PDF

Sliding Mode Control Using the Lower Bound of Control Gain (제어이득의 하한을 이용한 새로운 슬라이딩 모드제어)

  • 유병국
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.9
    • /
    • pp.664-668
    • /
    • 2003
  • A new sliding mode control method based on the lower bound of control gain is presented. Although the magnitube of the proposed control input is larger than that of the conventional control input using both lower and upper bounds, the positive-negative exchanging chattering is reduced and reaching mode is shorter. Because the proposed scheme needs only the lower bound of control gain, it is applicable to the system whose upper bound of control gain is doubtful to determine such as the control gain depends on the system states. It is proved that the proposed control method guarantees the sliding condition. The analysis of differences between the conventional method and the proposed method is given. The validity of the proposed control strategy is shown through a 2nd-order nonlinear system example.

THE LINEAR DISCREPANCY OF A PRODUCT OF TWO POSETS

  • Cheong, Minseok
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.1081-1094
    • /
    • 2017
  • For a poset $P=(X,{\leq}_P)$, the linear discrepancy of P is the minimum value of maximal differences of all incomparable elements for all possible labelings. In this paper, we find a lower bound and an upper bound of the linear discrepancy of a product of two posets. In order to give a lower bound, we use the known result, $ld({\mathbf{m}}{\times}{\mathbf{n}})={\lceil}{\frac{mn}{2}}{\rceil}-2$. Next, we use Dilworth's chain decomposition to obtain an upper bound of the linear discrepancy of a product of a poset and a chain. Finally, we give an example touching this upper bound.

APPROXIMATION OF THE QUEUE LENGTH DISTRIBUTION OF GENERAL QUEUES

  • Lee, Kyu-Seok;Park, Hong-Shik
    • ETRI Journal
    • /
    • v.15 no.3
    • /
    • pp.35-45
    • /
    • 1994
  • In this paper we develop an approximation formalism on the queue length distribution for general queueing models. Our formalism is based on two steps of approximation; the first step is to find a lower bound on the exact formula, and subsequently the Chernoff upper bound technique is applied to this lower bound. We demonstrate that for the M/M/1 model our formula is equivalent to the exact solution. For the D/M/1 queue, we find an extremely tight lower bound below the exact formula. On the other hand, our approach shows a tight upper bound on the exact distribution for both the ND/D/1 and M/D/1 queues. We also consider the $M+{\Sigma}N_jD/D/1$ queue and compare our formula with other formalisms for the $M+{\Sigma}N_jD/D/1$ and M+D/D/1 queues.

  • PDF

The Generalized Continuous Multiple-Choice Linear Knapsack Problem with Generalized Lower Bound Constraints (일반하한제약을 갖는 일반연속 다중선택 선형배낭문제의 해법연구)

  • 원중연
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.291-299
    • /
    • 1998
  • We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.

  • PDF

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.

Rheological Approaches to Classify the Mixed Gel Network of $\kappa$-Carrageenan/Agar

  • Lee, Seung-Ju;Kim, Young-Ho;Hwang, Jae-Kwan
    • Food Science and Biotechnology
    • /
    • v.16 no.2
    • /
    • pp.183-186
    • /
    • 2007
  • The type of mixed gel network of $\kappa$-carrageenan/agar was determined by applying rheological principles. Apparent Young's modulus of the mixed gels was mathematically analyzed with (a) simply adding the moduli of two component gels, (b) phase-separated type's upper and lower bound models, (c) interpenetrating type's logarithmic model. The experimental data fitted the estimates from the operation (a). Whereas, as for the models (b), the experimental values in the agar-rich region fitted the estimates of the upper bound model, but in the $\kappa$-carrageenan-rich region slightly deviated from those of the lower bound model. It reflected an evidence of a phase-separated type, although it was not typical, that there must be data good-fit in the agar-rich and $\kappa$-carrageenan-rich regions with the upper and lower bound models, respectively. Experimental values disagreed with estimates of the model (c). Gel time was analyzed to evince the phase-separated type. As agar concentrations increased at a fixed amount of $\kappa$-carrageenan, gel time gradually decreased and then sharply increased and decreased again. The pattern of such change in gel time also represented a typical behavior of phase-separated type's mixed gels.