Results 1 to 10 of about 1,481,196 (275)
N-distance tests of uniformity on the hypersphere
Nonlinear Analysis, 2010 In this paper we propose an application of N-distance theory for testing the hypothesis of uniformity on hypersphere S p − 1. The work is a continuation of our research started in [1, 2]. Particular attention is devoted to p = 2, 3 cases.
A. Bakshaev
doaj +7 more sources
The Modified Superomedial Pedicle Breast Reduction Technique for Cases with SN-N Distance Exceeding 33 cm. [PDF]
Aesthetic Plast SurgAbstract Background Symptomatic breast hypertrophy affects the quality of life of a large number of women globally. Many reduction mammoplasty techniques have been described for patients with breast hypertrophy. The aim of this study was to provide our clinic’s experience in utilizing the modified superomedial pedicle
Panopoulou G +3 more
europepmc +3 more sources
Nonstandard n-distances based on certain geometric constructions [PDF]
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2022 The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical constructions. In particular, our study shows to which extent the computation of the best constant associated with an $n$
Gergely Kiss, Jean-Luc Marichal
openaire +5 more sources
Weiner Polynomials to Generalize the Distance of Some Composite Graphs from Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 It is not easy to find the Wiener polynomials for generalized distance of compound graphs constructed in the form and for any two disjoint connected graphs and .Therefore, in this paper, we obtain Wiener polynomials for generalized distance of and ...
Ali Ali, Ahmed Ali
doaj +1 more source
The n-Wiener Polynomials of the Cartesian Product of a Complete Graph with some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2009 The n-Wiener polynomials of the Cartesian products of a complete graph Kt with another complete graph Kr, a star graph Sr, a complete bipartite graph Kr,s, a wheel Wr, and a path graph Pr are obtained in this paper.
Ali Ali, Haveen Ahmed
doaj +1 more source
Biased Deep Distance Factorization Algorithm for Top-N Recommendation [PDF]
Jisuanji kexue, 2021 Since traditional matrix factorization algorithms are mostly based on shallow linear models,it is difficult to learn latent factors of users and items at a deep level.When the dataset is sparse,it is inclined to overfitting.To deal with the problem,this ...
QIAN Meng-wei , GUO Yi
doaj +1 more source
Further Remarks on n-Distance-Balanced Graphs [PDF]
Journal of the Indonesian Mathematical Society, 2019 Throughout this paper, we present a new strong property of graph so-called nicely n-distance-balanced which is notably stronger than the concept of n-distance-balanced recently given by the authors. We also initially introduce a newgraph invariant which modies Szeged index and is suitable to study n-distance-balanced graphs.
Faghani, Morteza, Pourhadi, Ehsan
openaire +2 more sources
The n-Hosoya Polynomials of Some Classes of Thorn Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 The n-Hosoya Polynomials of cog-complete graphs , thorn cog-complete graphs , cog-stars , thorn cog-stars , cog-wheels , and thorn cog-wheels are obtained . The n-Wiener indices of these graphs are also determined .
Ali Ali, Ahmed Ali
doaj +1 more source
Weiner Polynomials for Generalization of Distance for Some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2006 The minimum distance of a vertex v to an set of vertices of a graph G is defined as : . The n-Wiener polynomial for this distance of a graph G is defined as , where is the number of order pairs (v,S), , such that , and is the diameter
Ali Ali, Ahmed Ali
doaj +1 more source
The n-Wiener Polynomials of Straight Hexagonal Chains and Kt×Cr [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2009 The n-Wiener polynomials of straight hexagonal chains and the Cartesian product of a complete graph Kr and a cycle Cr are obtained in this paper. The n-diameter and the n-Wiener index of each such graphs are also determined.
Ali Ali, Haveen Ahmed
doaj +1 more source