scholarly journals Global rigidity of (quasi-)injective frameworks on the line

2022 ◽  
Vol 345 (2) ◽  
pp. 112687
Author(s):  
Dániel Garamvölgyi
Keyword(s):  
2010 ◽  
Vol 45 (3) ◽  
pp. 574-591 ◽  
Author(s):  
Samuel Frank ◽  
Jiayang Jiang
Keyword(s):  

2010 ◽  
Vol 31 (4) ◽  
pp. 1121-1135 ◽  
Author(s):  
Brigitte Servatius ◽  
Herman Servatius

Author(s):  
Meera Sitharam ◽  
Audrey St. John ◽  
Jessica Sidman

Author(s):  
Meera Sitharam ◽  
Audrey St. John ◽  
Jessica Sidman
Keyword(s):  

1997 ◽  
Vol 35 (2) ◽  
pp. 327-351 ◽  
Author(s):  
Haizhong Li

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
G. R. Gillich ◽  
Z. I. Praisach ◽  
M. Abdel Wahab ◽  
O. Vasile

An algorithm to assess transversal cracks in composite structures based on natural frequency changes due to damage is proposed. The damage assessment is performed in two steps; first the crack location is found, and afterwards an evaluation of its severity is performed. The technique is based on a mathematical relation that provides the exact solution for the frequency changes of bending vibration modes, considering two terms. The first term is related to the strain energy stored in the beam, while the second term considers the increase of flexibility due to damage. Thus, it is possible to separate the problems of localization and severity assessment, which makes the localization process independent of the beams cross-section shape and boundary conditions. In fact, the process consists of comparing vectors representing the measured frequency shifts with patterns constructed using the mode shape curvatures of the undamaged beam. Once the damage is localized, the evaluation of its severity is made taking into account the global rigidity reduction. The damage identification algorithm was validated by experiments performed on numerous sandwich panel specimens.


2012 ◽  
Vol 22 (06) ◽  
pp. 577-591 ◽  
Author(s):  
VIET-HANG NGUYEN

The problem of deciding the unique realizability of a graph in a Euclidean space with distance and/or direction constraints on the edges of the graph has applications in CAD (Computer-Aided Design) and localization in sensor networks. One approach, which has been proved to be efficient in the similar problem for graphs with distance constraints, is to study operations to construct a uniquely realizable graph from a smaller one. In this paper, we extend a result of Jackson and Jordán on the unique realizability preservingness of the so-called “1-extension” in dimension 2 to all dimensions.


2013 ◽  
Vol 103 (6) ◽  
pp. 689-705 ◽  
Author(s):  
R. Connelly ◽  
T. Jordán ◽  
W. Whiteley
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document