Random evolving networks under the diameter and average connectivity constraint

2007 ◽  
Vol 16 (1) ◽  
pp. 107-112
Author(s):  
Jianguo Liu ◽  
Zhongtuo Wang ◽  
Yanzhong Dang
2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Ikechukwu Maduako ◽  
Monica Wachowicz ◽  
Trevor Hanson
Keyword(s):  

2013 ◽  
Vol 103 (4) ◽  
pp. 48004 ◽  
Author(s):  
Guifeng Su ◽  
Zhongyuan Ruan ◽  
Shuguang Guan ◽  
Zonghua Liu

2002 ◽  
Vol 66 (3) ◽  
Author(s):  
J. Jost ◽  
M. P. Joy
Keyword(s):  

Author(s):  
Wenjian Yang ◽  
Huafeng Ding ◽  
Andres Kecskemethy

The number of synthesized kinematic chains usually is too large to evaluate individual characteristics of each chain. The concept of connectivity is useful to classify the kinematic chains. In this paper, an algorithm is developed to automatically compute the connectivity matrix in planar kinematic chains. The main work is to compute two intermediate parameters, namely the minimum mobility matrix and the minimum distance matrix. The algorithm is capable of dealing with both simple-jointed and multiple-jointed kinematic chains. The present work can be used to automatically determine kinematic chains satisfying the required connectivity constraint, and is helpful for the creative design of mechanisms. The practical application is illustrated by taking the face-shovel hydraulic excavator for instance.


2016 ◽  
Vol 9 (12) ◽  
pp. 1077-1088 ◽  
Author(s):  
Naoto Ohsaka ◽  
Takuya Akiba ◽  
Yuichi Yoshida ◽  
Ken-ichi Kawarabayashi

Author(s):  
Tanja Hartmann ◽  
Andrea Kappes ◽  
Dorothea Wagner
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document