Based on dynamic information collected from different time intervals in some real situations, this paper firstly proposes a dynamic single valued neutrosophic multiset (DSVNM) to express dynamic information and operational relations of DSVNMs. Then, a correlation coefficient between DSVNMs and a weighted correlation coefficient between DSVNMs are presented to measure the correlation degrees bet...

Spatial scan statistics with circular or elliptic scanning windows are commonly used for cluster detection in various applications, such as the identification of geographical disease clusters from epidemiological data. It has been pointed out that the method may have difficulty in correctly identifying non-compact, arbitrarily shaped clusters. In this paper, we evaluated the Gini coefficient fo...

Time-varying coefficient models are useful in longitudinal data analysis. Various efforts have been invested for the estimation of the coefficient functions, based on the least squares principle. Related work includes smoothing spline and kernel methods among others, but these methods suffer from the shortcoming of non-robustness. In this paper, we introduce a local M-estimation method for esti...

If the yield of a polynomial pair is closely correlated with the coefficients of the polynomial pair, we can select polynomials by checking the coefficients first. This can speed the selection of good polynomials. In this paper, we aim to study the correlation between the polynomial coefficients and the yield of the polynomials. By heuristic analysis and some experiments, we find that the yield...

The so-called gamma coefficient is a well-known rank correlation measure frequently used to quantify the strength of dependence between two variables with ordered domains. To increase the robustness of this measure toward noise in the data, a generalization of the gamma coefficient has recently been developed on the basis of fuzzy order relations. The goal of this paper is threefold. First, we ...

Based on CAIDA’s (cooperative association for Internet data analysis )statistics at AS-level collected from April 2009 to April 2010, it is found that network size, degree correlations and clustering have changed significantly three times. According to the definition of k-core, the Internet topology is divided into different levels. In this paper, by analyzing the changing connection on each le...

A commonly used characteristic of statistical dependence of adjacency relations in real networks, the clustering coefficient, evaluates chances that two neighbours of a given vertex are adjacent. An extension is obtained by considering conditional probabilities that two randomly chosen vertices are adjacent given that they have r common neighbours. We denote such probabilities cl(r) and call r ...

Let H be a tournament, and let ≥ 0 be a real number. We call an “Erdős-Hajnal coefficient” for H if there exists c > 0 such that in every tournament G with |V (G)| > 1 not containing H as a subtournament, there is a transitive subset of cardinality at least c|V (G)| . The Erdős-Hajnal conjecture asserts, in one form, that every tournament H has a positive Erdős-Hajnal coefficient. This remains ...

This paper comparatively studies the tribological behaviour of different types of diamond-like carbon (DLC) coatings in a reciprocating sliding wear test. The results are interpreted in terms of structure and surface morphological characteristics. At the beginning of each reciprocating sliding wear test, the higher coefficient of friction of the DLC coatings reflects the original surface condit...

Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial maximal planar networks, which is similar to but different from the model for Apollonian networks (Andrade et al 2005 Phys. Rev. Lett. 94 018702). We present an exhaustive analysis of various properties of our model, a...