A connected signed graph Ġ, where all blocks of it are positive cliques or negative (of possibly varying sizes), is called a block graph. Let A, N and D̃ be adjacency, net Laplacian distance matrices graph, respectively. In this paper the formulas for determinant were given firstly. Then inverse (resp. Moore-Penrose inverse) obtained if nonsingular singular), which sum Laplacian-like matrix at m...

This paper deals with the problem of testing statisticalhypotheses when the available data are fuzzy. In this approach, wefirst obtain a fuzzy test statistic based on fuzzy data, and then,based on a new signed distance between fuzzy numbers, we introducea new decision rule to accept/reject the hypothesis of interest.The proposed approach is investigated for two cases: the casewithout nuisance p...

We address the problem of completing partial human shape observations as obtained with a depth camera. Existing methods that solve this can provide robustness, for instance model-based strategies rely on parametric models, or precision, learning approaches capture local geometric patterns using implicit neural representations. investigate how to combine both properties novel pyramidal spatio-te...

this paper submitting the computation of optimize point of ordering in inventory control systems and particularly for continuous review of ordering system (r,q) by fuzzy logic method which similarly can be used for other ordering systems. since in the ordering models we cannot forecast the parameters like cost exactly, we have ambiguity. in this case using precise parameters may cause wrong dec...

A common way of blending between two planar curves is to linearly interpolate their signed curvature functions and to reconstruct the intermediate curve from the interpolated curvature values. But if both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the...

A novel algorithm is proposed to learn pattern similarities for texture image retrieval. Similar patterns in di erent texture classes are grouped into a cluster in the feature space. Each cluster is isolated from others by an enclosed boundary, which is represented by several support vectors and their weights obtained from a statistical learning algorithm called support vector machine (SVM). Th...

in statistical inference, the point estimation problem is very crucial and has a wide range of applications. when, we deal with some concepts such as random variables, the parameters of interest and estimates may be reported/observed as imprecise. therefore, the theory of fuzzy sets plays an important role in formulating such situations. in this paper, we rst recall the crisp uniformly minimum ...

We propose a novel and efficient volumetric method for registering 3D shapes with nonrigid deformations. Our method uses a signed distance field to represent the 3D input shapes and registers them by minimizing the difference between their distance fields. With the assumptions that the sampling points in each cell of the object volume follow the same rigid transformation, and the transformation...