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

2016 ◽  
Vol 11 (4) ◽  
pp. 587-605 ◽  
Author(s):  
Yong-Joo Lee
Author(s):  
Stefan A. Burr ◽  
Richard A. Duke

AbstractWe are interested here in the Ramsey number r(T, C), where C is a complete k-uniform hypergraph and T is a “tree-like” k-graph. Upper and lower bounds are found for these numbers which lead, in some cases, to the exact value for r(T, C) and to a generalization of a theorem of Chváta1 on Ramsey numbers for graphs. In other cases we show that a determination of the exact values of r(T, C) would be equivalent to obtaining a complete solution to existence question for a certain class of Steiner systems.


1949 ◽  
Vol 16 (4) ◽  
pp. 406-410
Author(s):  
C. C. Miesse

Abstract A method is given for determining both upper and lower bounds on the critical or buckling load for variable-section columns with axial loading. This method, which is an extension of the Rayleigh principle, is illustrated by three examples.


Author(s):  
T A Stolarski

An analytical determination of the probability of scuffing is presented and used to modify and extend a computer program that was the subject of earlier work. The program identifies conditions that produce boundary or mixed lubrication with asperity overlaps for which the plasticity index is greater than 0.6. It then imposes, as a necessary prerequisite for scuffing, the condition that the surface bulk plus flash temperature is high enough to cause significant desorption of adsorbed lubricant film. For such conditions determination of the probabilities of asperity contact and of plastic asperity contact provide upper and lower bounds respectively to the probability of scuffing. It is shown that in this way critical ranges of conditions can be clearly distinguished from ranges for which scuffing is unlikely.


1968 ◽  
Vol 35 (4) ◽  
pp. 796-802 ◽  
Author(s):  
P. G. Hodge ◽  
T. Belytschko

The determination of upper and lower bounds on the yield-point loads of plates are formulated as mathematical programming problems by using finite element representations for the velocity and moment fields. Results are presented for a variety of square and rectangular plate problems and are compared to other available solutions.


1976 ◽  
Vol 43 (1) ◽  
pp. 75-80 ◽  
Author(s):  
S. Nair ◽  
E. Reissner

We analyze the effect of anisotropy on beam flexibility by the derivation of upper and lower bounds, through use of the principles of minimum potential and complementary energy, for the load-deflection ratios of narrow rectangular cross-section cantilever beams. The basic assumption is a class of stress-strain relations of such nature that normal strains are caused not only by normal stresses but also by shearing stresses, and shearing strains are caused not only by shearing stresses but also by normal stresses.


Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.


Sign in / Sign up

Export Citation Format

Share Document