• Title/Summary/Keyword: lower bounds

Search Result 372, Processing Time 0.024 seconds

RUDNICK AND SOUNDARARAJAN'S THEOREM FOR FUNCTION FIELDS IN EVEN CHARACTERISTIC

  • Jung, Hwanyup
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.1-12
    • /
    • 2022
  • In this paper we prove an even characteristic analogue of the result of Andrade on lower bounds for moment of quadratic Dirichlet L-functions in odd characteristic. We establish lower bounds for the moments of Dirichlet L-functions of characters defined by Hasse symbols in even characteristic.

Tighter Throughput Lower Bounds of Connectivity-Based Reliable Multicast MAC Protocol for IEEE 802.11 Wireless LANs (IEEE 802.11 무선랜에서 연결정보 기반의 신뢰성 있는 멀티캐스트 MAC 프로토콜을 위한 쓰루풋의 하한 유도)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.4
    • /
    • pp.285-288
    • /
    • 2012
  • The connectivity-based reliable multicast MAC protocol was proposed for IEEE 802.11 wireless LANs and the formulae for the lower bounds of the multicast downlink throughput and the uplink throughput of the connectivity-based reliable multicast MAC protocol were derived in our previous study. We provide the tighter throughput lower bounds of the connectivity-based reliable multicast MAC protocol than the lower bounds presented in our previous study.

A Comparative Study On Optimization Algorithms for Capacited Facility Location (설비용량에 제한이 있는 입지선정 문제에 대한 기존해법간의 비교분석)

  • 차동완;정승학;명영수
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 1986
  • Capacitated facility location problems have received a great deal of attention in the past decade, resulting in a proliferation of algorithms for solving them. As is the case with mixed 1-1 integer programming problems, the computational success of such algorithms depends greatly on how to obtain lower bounds in good quality within a resonable time. The objective of this paper is to provide a comparative analysis of those algorithms in terms of lower bounds they produce. Analyses of the strategies for generating lower bounds as well as the quality of generated lower bounds are provided.

  • PDF

A Simpler Method to Estimate the Elastic Constant of Collagen-like Microfibril Using Voigt-Reuss Bounds (복합재료역학을 이용한 콜라겐 단백질 마이크로피브릴의 탄성율 예측 개선)

  • Yoon, Young-June;Bae, Cheol-Soo
    • Journal of Biomedical Engineering Research
    • /
    • v.31 no.3
    • /
    • pp.194-198
    • /
    • 2010
  • The effective Young’s modulus of a microfibril surrounded by water may be simply calculated by using the upper (Voigt) and lower (Reuss) bounds, which is one way to estimate the Young’s modulus in composite materials. The Steered Molecular Dynamics (SMD) has been used for estimating the Young’s modulus of a microfibril surrounded by water. In this paper, the result estimated by the upper (Voigt) and lower (Reuss) bounds shows 9.2% to 21.8% discrepancy from the result estimated by SMD, but introducing “efficiency of reinforcement parameter” removes the discrepancy and shows good agreement with the result estimated by SMD. We found the best fit for the Young’s modulus against the size of the gap between microfibrils. Also the steps using these bounds are much simpler than SMD.

THE BEHAVIOUR OF PROBABILISTIC ERROR BOUNDS IN FLOATING POINT ALGEBRAIC PROCESSES

  • M.Mitrouli;C.Koukouvinos
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.1
    • /
    • pp.211-222
    • /
    • 1997
  • In this paper we present a probabilistic approach for the estimation of realistic error bounds appearing in the execution of basic algebraic floating point operations. Experimental results are carried out for the extended product the extended sum the inner product of random normalised numbers the product of random normalised ma-trices and the solution of lower triangular systems The ordinary and probabilistic bounds are calculated for all the above processes and gen-erally in all the executed examples the probabilistic bounds are much more realistic.

Saturation impulses for dynamically loaded structures with finite-deflections

  • Zhao, Ya-Pu;Yu, T.X.;Fang, J.
    • Structural Engineering and Mechanics
    • /
    • v.3 no.6
    • /
    • pp.583-592
    • /
    • 1995
  • The concept of "Saturation Impulse" for rigid, perfectly plastic structures with finite-deflections subjected to dynamic loading was put forward by Zhao, Yu and Fang (1994a). This paper extends the concept of Saturation Impulse to the analysis of structures such as simply supported circular plates, simply supported and fully clamped square plates, and cylindrical shells subjected to rectangular pressure pulses in the medium load range. Both upper and lower bounds of nondimensional saturation impulses are presented.

NEW BOUNDS ON THE OVERFLOW PROBABILITY IN JACKSON NETWORKS

  • Lee, Ji-Yeon
    • Journal of the Korean Statistical Society
    • /
    • v.32 no.4
    • /
    • pp.359-371
    • /
    • 2003
  • We consider the probability that the total population of a stable Jackson network reaches a given large value. By using the fluid limit of the reversed network, we derive new upper and lower bounds on this probability, which are sharper than those in Glasserman and Kou (1995). In particular, the improved lower bound is useful for analyzing the performance of an importance sampling estimator for the overflow probability in Jackson tandem networks. Bounds on the expected time to overflow are also obtained.