Abstract: Fiber Bragg optic sensor is embedded in composite
material to detect and monitor the damage that occurs in composite
structures. In this paper, we deal with the mode-Ι delamination to
determine the material strength to crack propagation, using the
coupling mode theory and T-matrix method to simulate the FBGs
spectrum for both uniform and non-uniform strain distribution. The
double cantilever beam test is modeled in FEM to determine the
longitudinal strain. Two models are implemented, the first is the
global half model, and the second is the sub-model to represent the
FBGs with higher refined mesh. This method can simulate damage in
composite structures and converting strain to a wavelength shifting in
the FBG spectrum.
Abstract: Data clustering is an important data exploration technique
with many applications in data mining. We present an enhanced
version of the well known single link clustering algorithm. We will
refer to this algorithm as DCBOR. The proposed algorithm alleviates
the chain effect by removing the outliers from the given dataset.
So this algorithm provides outlier detection and data clustering
simultaneously. This algorithm does not need to update the distance
matrix, since the algorithm depends on merging the most k-nearest
objects in one step and the cluster continues grow as long as possible
under specified condition. So the algorithm consists of two phases;
at the first phase, it removes the outliers from the input dataset. At
the second phase, it performs the clustering process. This algorithm
discovers clusters of different shapes, sizes, densities and requires
only one input parameter; this parameter represents a threshold for
outlier points. The value of the input parameter is ranging from 0 to
1. The algorithm supports the user in determining an appropriate
value for it. We have tested this algorithm on different datasets
contain outlier and connecting clusters by chain of density points,
and the algorithm discovers the correct clusters. The results of
our experiments demonstrate the effectiveness and the efficiency of
DCBOR.
Abstract: Delamination between layers in composite materials is a major structural failure. The delamination resistance is quantified by the critical strain energy release rate (SERR). The present investigation deals with the strain energy release rate of two woven fabric composites. Materials used are made of two types of glass fiber (360 gsm and 600 gsm) of plain weave and epoxy as matrix. The fracture behavior is studied using the mode I, double cantilever beam test and the mode II, end notched flexure test, in order to determine the energy required for the initiation and growth of an artificial crack. The delamination energy of these two materials is compared in order to study the effect of weave and reinforcement on mechanical properties. The fracture mechanism is also analyzed by means of scanning electron microscopy (SEM). It is observed that the plain weave fabric composite with lesser strand width has higher inter laminar fracture properties compared to the plain weave fabric composite with more strand width.
Abstract: Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, a density based clustering algorithm (DCBRD) is presented, relying on a knowledge acquired from the data by dividing the data space into overlapped regions. The proposed algorithm discovers arbitrary shaped clusters, requires no input parameters and uses the same definitions of DBSCAN algorithm. We performed an experimental evaluation of the effectiveness and efficiency of it, and compared this results with that of DBSCAN. The results of our experiments demonstrate that the proposed algorithm is significantly efficient in discovering clusters of arbitrary shape and size.