Due to the various performance requirements and data access restrictions of different types of real-time transactions, concurrency control protocols which had been designed for the systems with single type of transact...Due to the various performance requirements and data access restrictions of different types of real-time transactions, concurrency control protocols which had been designed for the systems with single type of transactions are not sufficient for mixed real-time database systems (MRTDBS), where different types of real-time transactions coexist in the systems concurrently. In this paper, a new concurrency control protocol MRTT_CC for mixed real-time transactions is proposed. The new strategy integrates with different concurrency control protocols to meet the deadline requirements of different types of real-time transactions. The data similarity concept is also explored in the new protocol to reduce the blocking time of soft real-time transactions, which increases their chances to meet the deadlines. Simulation experiments show that the new protocol has gained good performance.展开更多
Let G be a connected graph of order p, and let γ7(G) denote the domination number of G. Clearly, γ(G) ≤[p/2]. The aim of this paper is to characterize the graphs G that reaches this upper bound. The main results ar...Let G be a connected graph of order p, and let γ7(G) denote the domination number of G. Clearly, γ(G) ≤[p/2]. The aim of this paper is to characterize the graphs G that reaches this upper bound. The main results are as follows: (1) when p is even, γ(G) = p/2 if and only if either G C4 or G is the crown of a connected graph with p/2 vertices; (2) when p is odd, γ(G) = (p-1)/2 if and only if every spanning tree of G is one of the two classes of trees shown in Theorem 3.1.展开更多
Each vertex of a graph G = （V, E） is said to dominate every vertex in its closed neighborhood. A set S C V is a double dominating set for G if each vertex in V is dominated by at least two vertices in S. The smalles...Each vertex of a graph G = （V, E） is said to dominate every vertex in its closed neighborhood. A set S C V is a double dominating set for G if each vertex in V is dominated by at least two vertices in S. The smallest cardinality of a double dominating set is called the double dominating number dd（G）. In this paper, new relationships between dd（G） and other domination parameters are explored and some results of [1] are extended. Furthermore, we give the Nordhaus-Gaddum-type results for double dominating number.展开更多
文摘Due to the various performance requirements and data access restrictions of different types of real-time transactions, concurrency control protocols which had been designed for the systems with single type of transactions are not sufficient for mixed real-time database systems (MRTDBS), where different types of real-time transactions coexist in the systems concurrently. In this paper, a new concurrency control protocol MRTT_CC for mixed real-time transactions is proposed. The new strategy integrates with different concurrency control protocols to meet the deadline requirements of different types of real-time transactions. The data similarity concept is also explored in the new protocol to reduce the blocking time of soft real-time transactions, which increases their chances to meet the deadlines. Simulation experiments show that the new protocol has gained good performance.
基金Supported by the National Science Foundation of Jiangxi province.
文摘Let G be a connected graph of order p, and let γ7(G) denote the domination number of G. Clearly, γ(G) ≤[p/2]. The aim of this paper is to characterize the graphs G that reaches this upper bound. The main results are as follows: (1) when p is even, γ(G) = p/2 if and only if either G C4 or G is the crown of a connected graph with p/2 vertices; (2) when p is odd, γ(G) = (p-1)/2 if and only if every spanning tree of G is one of the two classes of trees shown in Theorem 3.1.
基金the National Natural Science Foundation of China (19871036)
文摘Each vertex of a graph G = （V, E） is said to dominate every vertex in its closed neighborhood. A set S C V is a double dominating set for G if each vertex in V is dominated by at least two vertices in S. The smallest cardinality of a double dominating set is called the double dominating number dd（G）. In this paper, new relationships between dd（G） and other domination parameters are explored and some results of [1] are extended. Furthermore, we give the Nordhaus-Gaddum-type results for double dominating number.
