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

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

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

Molecular dynamic simulations for systems with D = 2, 3 Lennard-Jones-like interactions are studied. In the model, we assume that, at long distances, the two-body attractive potential decays as r−α. Thermodynamic extensivity (nonextensivity) is observed for α > D (0 ≤ α ≤ D). Particular attention is payed to the liquid-gas critical point located, in the temperature-pressure plane, at (Tc, Pc). ...

In this paper, we consider the community detection problem in signed networks, where there are two types of edges: positive edges (friends) and negative edges (enemies). One renowned theorem of signed networks, known as Harary’s theorem, states that structurally balanced signed networks are clusterable. By viewing each cycle in a signed network as a parity-check constraint, we show that the com...

We introduce a smooth approximation of the min / max operations, called SARDF (Signed Approximate Real Distance Function), for maintaining an approximate signed distance function in constructive shape modeling. We apply constructive distance-based shape modeling to design objects with heterogeneous material distribution in the constructive hypervolume model framework. The introduced distance ap...

We give a pair of well-matched lower and upper bounds for the expectation of reversal distance under the hypothesis of random gene order by investigating the expected number of cycles in the breakpoint graph of linear signed permutations. Sankoff and Haque [9] proved similar results for circular signed permutations based on approximations based on a slightly different model; while our approach ...