OBJECTIVE The objective of this study was to compare the diagnostic role of features reflecting the geometry of clusters with features reflecting the shape of the individual microcalcification in a mammographic computer-aided diagnosis system. MATERIALS AND METHODS Three hundred twenty-four cases of clustered microcalcifications with biopsy-proven results were digitized at 42-microm resolutio...

Abstract A crucial, both from theoretical and practical points of view, problem in preference modelling is the number questions to ask decision maker. We focus on incomplete pairwise comparison matrices based graphs whose average degree approximately 3 (or a bit more), i.e., each item compared three others average. In range matrix sizes we considered, $$n=5,6,7,8,9,10$$ <mml:math xmlns:mml="htt...

A rainbow matching in an edge-colored graph is a which no two edges have the same color. The color degree of vertex v number distinct colors on incident to v. Kritschgau [Electron. J. Combin. 27(3), 2020] studied existence matchings G with average at least 2k, and proved some sufficient conditions for marching size k G. include that $$|V(G)|\ge 12k^2+4k$$ , or properly 8k$$ . In this paper, we ...

We prove that if the average of the degrees of the irreducible characters of a finite group G is less than 16/5, then G is solvable. This solves a conjecture of I. M. Isaacs, M. Loukaki and the first author. We discuss related questions.

A graph G with maximum degree and edge chromatic number ′(G)> is edge-critical if ′(G− e)= for every edge e of G. New lower bounds are given for the average degree of an edge-critical graph, which improve on the best bounds previously known for most values of . Examples of edge-critical graphs are also given. In almost all cases, there remains a large gap between the best lower bound known and ...