Reliability Analysis of Truss Structures by Using Matrix Method

1980 ◽  
Vol 102 (4) ◽  
pp. 749-756 ◽  
Author(s):  
Y. Murotsu ◽  
H. Okada ◽  
K. Niwa ◽  
S. Miwa
Keyword(s):  
Lower Bound ◽  
Failure Probability ◽  
Matrix Method ◽  
Failure Criteria ◽  
Upper Bounds ◽  
Truss Structures ◽  
Lower And Upper Bounds ◽  
Numerical Examples ◽  
Modes Of Failure ◽  
Complete Failure

This paper proposes a method of systematically generating the failure criteria of truss structures by using Matrix Method. The resulting criterion for a statically determinate truss is simple and its failure probability is easily evaluated. In case of a statically indeterminate truss, however, there are many possible modes or paths to complete failure of the structure and it is impossible in practice to generate all of them. Hence, the failure probability is estimated by evaluating its lower and upper bounds. The lower bound is evaluated by selecting the dominant modes of failure and calculating their probabilities. The upper bound is evaluated by assuming that the redundant truss behaves itself like a statically determinate truss, i.e., the structure fails if any one member is subject to failure. Numerical examples are provided to demonstrate the applicability of the propsed methods.

scholarly journals New bounds for the minimum eigenvalue of 𝓜-tensors

2017 ◽  
Vol 15 (1) ◽  
pp. 296-303 ◽  
Author(s):  
Jianxing Zhao ◽  
Caili Sang
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Minimum Eigenvalue ◽  
Numerical Examples ◽  
Theoretical Results

Abstract A new lower bound and a new upper bound for the minimum eigenvalue of an 𝓜-tensor are obtained. It is proved that the new lower and upper bounds improve the corresponding bounds provided by He and Huang (J. Inequal. Appl., 2014, 2014, 114) and Zhao and Sang (J. Inequal. Appl., 2016, 2016, 268). Finally, two numerical examples are given to verify the theoretical results.

scholarly journals Full-Duplex Relay with Delayed CSI Elevates the SDoF of the MIMO X Channel

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1484
Author(s):  
Tong Zhang ◽  
Gaojie Chen ◽  
Shuai Wang ◽  
Rui Wang
Keyword(s):  
Lower Bound ◽  
Channel State Information ◽  
Interference Alignment ◽  
Upper Bounds ◽  
Full Duplex ◽  
Multiple Antenna ◽  
Lower And Upper Bounds ◽  
Channel State ◽  
State Information ◽  
Full Duplex Relay

In this article, the sum secure degrees-of-freedom (SDoF) of the multiple-input multiple-output (MIMO) X channel with confidential messages (XCCM) and arbitrary antenna configurations is studied, where there is no channel state information (CSI) at two transmitters and only delayed CSI at a multiple-antenna, full-duplex, and decode-and-forward relay. We aim at establishing the sum-SDoF lower and upper bounds. For the sum-SDoF lower bound, we design three relay-aided transmission schemes, namely, the relay-aided jamming scheme, the relay-aided jamming and one-receiver interference alignment scheme, and the relay-aided jamming and two-receiver interference alignment scheme, each corresponding to one case of antenna configurations. Moreover, the security and decoding of each scheme are analyzed. The sum-SDoF upper bound is proposed by means of the existing SDoF region of two-user MIMO broadcast channel with confidential messages (BCCM) and delayed channel state information at the transmitter (CSIT). As a result, the sum-SDoF lower and upper bounds are derived, and the sum-SDoF is characterized when the relay has sufficiently large antennas. Furthermore, even assuming no CSI at two transmitters, our results show that a multiple-antenna full-duplex relay with delayed CSI can elevate the sum-SDoF of the MIMO XCCM. This is corroborated by the fact that the derived sum-SDoF lower bound can be greater than the sum-SDoF of the MIMO XCCM with output feedback and delayed CSIT.

scholarly journals Inventory Models with Defective Units and Sub-Lot Inspection

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 1038
Author(s):  
Han-Wen Tuan ◽  
Gino K. Yang ◽  
Kuo-Chen Hung
Keyword(s):  
Lower Bound ◽  
Optimal Solution ◽  
Upper Bounds ◽  
Interior Solution ◽  
Order Quantity ◽  
Inventory Models ◽  
Defective Items ◽  
Numerical Examples ◽  
Counter Example ◽  
Analytical Foundation

Inventory models must consider the probability of sub-optimal manufacturing and careless shipping to prevent the delivery of defective products to retailers. Retailers seeking to preserve a reputation of quality must also perform inspections of all items prior to sale. Inventory models that include sub-lot sampling inspections provide reasonable conditions by which to establish a lower bound and a pair of upper bounds in terms of order quantity. This should make it possible to determine the conditions of an optimal solution, which includes a unique interior solution to the problem of an order quantity satisfying the first partial derivative. The approach proposed in this paper can be used to solve the boundary. These study findings provide the analytical foundation for an inventory model that accounts for defective items and sub-lot sampling inspections. The numerical examples presented in a previous paper are used to demonstrate the derivation of an optimal solution. A counter-example is constructed to illustrate how existing iterative methods do not necessarily converge to the optimal solution.

scholarly journals A Computational Perspective on Network Coding

2010 ◽  
Vol 2010 ◽  
pp. 1-11
Author(s):  
Qin Guo ◽  
Mingxing Luo ◽  
Lixiang Li ◽  
Yixian Yang
Keyword(s):  
Graph Theory ◽  
Computational Complexity ◽  
Lower Bound ◽  
Network Coding ◽  
Upper Bound ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Multicast Networks ◽  
Computational Perspective ◽  
Source Rate

From the perspectives of graph theory and combinatorics theory we obtain some new upper bounds on the number of encoding nodes, which can characterize the coding complexity of the network coding, both in feasible acyclic and cyclic multicast networks. In contrast to previous work, during our analysis we first investigate the simple multicast network with source rateh=2, and thenh≥2. We find that for feasible acyclic multicast networks our upper bound is exactly the lower bound given by M. Langberg et al. in 2006. So the gap between their lower and upper bounds for feasible acyclic multicast networks does not exist. Based on the new upper bound, we improve the computational complexity given by M. Langberg et al. in 2009. Moreover, these results further support the feasibility of signatures for network coding.

Minimization of Bounded Cable Tensions in Cable-Based Parallel Manipulators

2007 ◽  
Author(s):  
Mahir Hassan ◽  
Amir Khajepour
Keyword(s):  
Lower Bound ◽  
Numerical Method ◽  
Upper Bound ◽  
Task Force ◽  
Parallel Manipulators ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Alternating Projection ◽  
Alternating Projection Method ◽  
Cable Forces

In this work, the application of the Dykstra’s alternating projection method to find the minimum-2-norm solution for actuator forces is discussed in the case when lower and upper bounds are imposed on the actuator forces. The lower bound is due to specified pretension desired in the cables and the upper bound is due to the maximum allowable forces in the cables. This algorithm presents a systematic numerical method to determine whether or not a solution exists to the cable forces within these bounds and, if it does exist, calculate the minimum-2-norm solution for the cable forces for a given task force. This method is applied to an example 2-DOF translational cable-driven manipulator and a geometrical demonstration is presented.

scholarly journals A lower bound for general t-stack sortable permutations via pattern avoidance

2020 ◽  
Vol 22 ◽  
Author(s):  
Pranav Chinmay
Keyword(s):  
Lower Bound ◽  
Recurrence Relation ◽  
Lower Bounds ◽  
Upper Bounds ◽  
Pattern Avoidance ◽  
Lower And Upper Bounds

There is no formula for general t-stack sortable permutations. Thus, we attempt to study them by establishing lower and upper bounds. Permutations that avoid certain pattern sets provide natural lower bounds. This paper presents a recurrence relation that counts the number of permutations that avoid the set (23451,24351,32451,34251,42351,43251). This establishes a lower bound on 3-stack sortable permutations. Additionally, the proof generalizes to provide lower bounds for all t-stack sortable permutations.

Lower and upper bounds for the linear arrangement problem on interval graphs

2018 ◽  
Vol 52 (4-5) ◽  
pp. 1123-1145
Author(s):  
Alain Quilliot ◽  
Djamal Rebaine ◽  
Hélène Toussaint
Keyword(s):  
Lower Bound ◽  
Polynomial Time ◽  
Feasible Solution ◽  
Interval Graph ◽  
Upper Bounds ◽  
Unit Interval ◽  
Lower And Upper Bounds ◽  
Linear Arrangement ◽  
Arrangement Problem ◽  
Linear Arrangement Problem

We deal here with theLinear Arrangement Problem(LAP) onintervalgraphs, any interval graph being given here together with its representation as theintersectiongraph of some collection of intervals, and so with relatedprecedenceandinclusionrelations. We first propose a lower boundLB, which happens to be tight in the case ofunit intervalgraphs. Next, we introduce the restriction PCLAP of LAP which is obtained by requiring any feasible solution of LAP to be consistent with theprecedencerelation, and prove that PCLAP can be solved in polynomial time. Finally, we show both theoretically and experimentally that PCLAP solutions are a good approximation for LAP onintervalgraphs.

Asymptotic bounds for the fluid queue fed by sub-exponential On/Off sources

2000 ◽  
Vol 32 (01) ◽  
pp. 244-255 ◽  
Author(s):  
V. Dumas ◽  
A. Simonian
Keyword(s):  
Lower Bound ◽  
Finite Number ◽  
Upper Bound ◽  
Content Distribution ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Fluid Queue ◽  
Asymptotic Bounds ◽  
Multiplicative Factor ◽  
Buffer Content

We consider a fluid queue fed by a superposition of a finite number of On/Off sources, the distribution of the On period being subexponential for some of them and exponential for the others. We provide general lower and upper bounds for the tail of the stationary buffer content distribution in terms of the so-called minimal subsets of sources. We then show that this tail decays at exponential or subexponential speed according as a certain parameter is smaller or larger than the ouput rate. If we replace the subexponential tails by regularly varying tails, the upper bound and the lower bound are sharp in that they differ only by a multiplicative factor.

scholarly journals Lower and upper bounds for the Lyapunov exponents of twisting dynamics: a relationship between the exponents and the angle of Oseledets’ splitting

2012 ◽  
Vol 33 (3) ◽  
pp. 693-712 ◽  
Author(s):  
M.-C. ARNAUD
Keyword(s):  
Lyapunov Exponent ◽  
Lower Bound ◽  
Lyapunov Exponents ◽  
Cotangent Bundle ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Hamiltonian Flows ◽  
Twist Maps ◽  
The Mean ◽  
Minimizing Measures

AbstractWe consider locally minimizing measures for conservative twist maps of the $d$-dimensional annulus and for Tonelli Hamiltonian flows defined on a cotangent bundle $T^*M$. For weakly hyperbolic measures of such type (i.e. measures with no zero Lyapunov exponents), we prove that the mean distance/angle between the stable and unstable Oseledets bundles gives an upper bound on the sum of the positive Lyapunov exponents and a lower bound on the smallest positive Lyapunov exponent. We also prove some more precise results.

scholarly journals On the Information Ratio of Graphs with Many Leaves

2019 ◽  
Vol 73 (1) ◽  
pp. 97-108
Author(s):  
Máté Gyarmati ◽  
Péter Ligeti
Keyword(s):  
Lower Bound ◽  
Secret Sharing ◽  
Complete Graph ◽  
Upper Bounds ◽  
Entropy Method ◽  
The Other ◽  
Secret Sharing Schemes ◽  
Lower And Upper Bounds ◽  
Information Ratio ◽  
Recursive Constructions

Abstract We investigate the information ratio of graph-based secret sharing schemes. This ratio characterizes the efficiency of a scheme measured by the amount of information the participants must remember for each bits in the secret. We examine the information ratio of several systems based on graphs with many leaves, by proving non-trivial lower and upper bounds for the ratio. On one hand, we apply the so-called entropy method for proving that the lower bound for the information ratio of n-sunlet graphs composed of a 1-factor between the vertices of a cycle Cn and n independent vertices is 2. On the other hand, some symmetric and recursive constructions are given that yield the upper bounds. In particular, we show that the information ratio of every graph composed of a 1-factor between a complete graph Kn and at most 4 independent vertices is smaller than 2.

Sign in / Sign up

Export Citation Format

Share Document