Two Algorithms for Determining the Most Reliable Path of a Network

This paper presents two algorithms for determining the most reliable paths of a communication network, taking into account both the reliabilities of nodes and links. A network is modeled by a linear graph. The first algorithm adapts a node labeling scheme; second is based on the shortest-path matrix algorithm. Both algorithms can be applied to oriented and nonoriented nonsymetric networks. The numerical examples confirm that both algorithms efficiently handle networks with hundreds of nodes and edges. The total amount of computation, expressed by the number of multiplications and comparisons, increases in the labeling procedure with the square of the number of nodes, and in the matrix method with the cube of the number of nodes.     

Development of new models for the estimation of deformation moduli in rock masses based on in situ measurements

Bulletin of Engineering Geology and the Environment - Knowledge of the deformation properties of the rock mass is essential for the stress–strain analysis of structures such as dams, tunnels,...     

Isogeometric bending analysis of composite plates based on a higher-order shear deformation theory

This research paper presents an isogeometric plate finite element formulation for analysis of thick composite plates. Isogeometric finite element method which is based on non-uniform rational B-splines (NURBS) basis functions, is a novel numerical procedure developed to bridge the gap between CAD and FEM modeling of structures. In order to investigate the behavior of isogeometric plate elements under static loading, plate kinematics is based on third order shear deformation theory (TSDT) of Reddy, which is free from transverse shear locking. This paper discusses accurate transverse stress recovery procedures for TSDT isogeometric finite elements. Numerical experiments with quadratic, cubic and quartic elements are presented and obtained results are compared to other available ones.