Due to the particularity of their process, petrochemical enterprises have high requirements for reliability power supply. If a large-scale blackout occurs due grounding fault, it will pose huge threat safe production. When resonant system faults, complex fault process and weak signal, is difficult accurately detect faulty feeder by traditional methods. This paper presents new method grey correl...

Blast simulators are capable of applying blast-like loading to components in a safe and controlled laboratory environment, overcoming the inherent shortcomings blast testing terms data acquisition, test cycle time, cost. In this paper, reasonable assumptions refinements made shape impact module, key component simulator, achieve diversity simulated loading. By designing four rubber shapes, impor...

In order to effectively prevent and control the problem of water inrush from through-type fault floor, based on analysis case data structure in Fengfeng mining area, types karst floor are divided into 3 categories, 6 subcategories, 17 fine categories. Four modes summarized: composite inrush, roof crack expansion vertical inrush. Based grey correlation theory combined with Analytic Hierarchy Pro...

for every positive integer k, a set s of vertices in a graph g = (v;e) is a k- tuple dominating set of g if every vertex of v -s is adjacent to at least k vertices and every vertex of s is adjacent to at least k - 1 vertices in s. the minimum cardinality of a k-tuple dominating set of g is the k-tuple domination number of g. when k = 1, a k-tuple domination number is the well-studied domination...

‎For any integer $kgeq 1$‎, ‎a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-‎tuple total dominating set of $G$ if any vertex‎ ‎of $G$ is adjacent to at least $k$ vertices in $S$‎, ‎and any vertex‎ ‎of $V-S$ is adjacent to at least $k$ vertices in $V-S$‎. ‎The minimum number of vertices of such a set‎ ‎in $G$ we call the $k$-tuple total restrained domination number of $G$‎. ‎The maximum num...

The feature of our method different from other fuzzy grey relation method for supermixed multiple attribute group decision-making is that all of the subjective and objective weights are obtained by interval grey number and that the group decisionmaking is performed based on the relative approach degree of grey TOPSIS, the relative approach degree of grey incidence and the relative membership de...

In a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a positive integer k, the k-tuple domination number γ×k(G) of G is the minimum size of a subset D of V (G) such that every vertex in G is dominated by at least k vertices in D. To generalize/improve known upper bounds for the k-tuple domination number, this paper establishes that for any positive integer k an...