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...

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

‎a new method for the defuzzification of fuzzy numbers is developed in this paper. it is well-known, defuzzification methods allow us to find aggregative crisp numbers or crisp set for fuzzy numbers. but different fuzzy numbers are often converted into one crisp number. in this case the loss of essential information is possible. it may result in inadequate final conclusions, for example, expert...

This article deals with the new approach of finding defuzzification / ranking index various types fuzzy sets. Traditionally, in most articles on decision making methods are not justified respect to that highest aspiration levels. study highlights an efficient (ranking) method which links between gaps defuzzified values obtained using ?-cuts and without numbers. Moreover, for a given problem dif...

This paper develops a single wholesaler and multi retailers mixture inventory distribution model for a single item involving controllable lead-time with backorder and lost sales. The retailers purchase their items from the wholesaler in lots at some intervals throughout the year to meet the customers’ demand. Not to loose the demands, the retailers offer a price discount to the customers on the...

The starting point of the paper presented are the well-known defuzzification procedures on the one hand and approaches to axiomatize the concept of defuzzification, on the other hand. We present a new attempt to build up an axiomatic foundation for defuzzification theory using the theory of groups and the theory of partially ordered sets, and in particular, the theory of GALOIS connections.

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...