Let Qn,k （n 〉 3, 1 〈 k ≤ n - 1） be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty ve...Let Qn,k （n 〉 3, 1 〈 k ≤ n - 1） be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty vertices and faulty edges, respectively. In this paper, we give three main results. First, a fault-free path P[u, v] of length at least 2n - 2fv - 1 （respectively, 2n - 2fv - 2） can be embedded on Qn,k with fv ＋ f≤ n- 1 when dQn,k （u, v） is odd （respectively, dQ,~,k （u, v） is even）. Secondly, an Q,,k is （n - 2） edgefault-free hyper Hamiltonianaceable when n （ 3） and k have the same parity. Lastly, a fault-free cycle of length at least 2n - 2fv can be embedded on Qn,k with f~ 〈 n - 1 and fv＋f≤2n-4.展开更多
A labeled graph is an ordered pair （G, L） consisting of a graph G and its labeling L ： V（G） → {1,2 ,n}, where n = ｜V（G）｜. An increasing nonconsecutive path in a labeled graph （G,L） is either a path （u1,u2...A labeled graph is an ordered pair （G, L） consisting of a graph G and its labeling L ： V（G） → {1,2 ,n}, where n = ｜V（G）｜. An increasing nonconsecutive path in a labeled graph （G,L） is either a path （u1,u2 uk） （k ≥ 2） in G such that L（u,） ＋ 2 ≤ L（ui＋1） for all i = 1, 2, ..., k- 1 or a path of order 1. The total number of increasing nonconsecutive paths in （G, L） is denoted by d（G, L）. A labeling L is optimal if the labeling L produces the largest d（G, L）. In this paper, a method simpler than that in Zverovich （2004） to obtain the optimal labeling of path is given. The optimal labeling of other special graphs such as cycles and stars is obtained.展开更多
If D is a digraph, then K∈V(D) is a quasi-kernel of D if D[K]is discrete and for each y∈V(D)-K there is x∈K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-k...If D is a digraph, then K∈V(D) is a quasi-kernel of D if D[K]is discrete and for each y∈V(D)-K there is x∈K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles.展开更多
Sensor nodes are easily compromised to malicious attackers due to an open environment. A false injected attack which takes place on application layer is elected by the compromised node. If the false report arrives in ...Sensor nodes are easily compromised to malicious attackers due to an open environment. A false injected attack which takes place on application layer is elected by the compromised node. If the false report arrives in a base station, a false alarm is occurred, and the energy of the nodes is consumed. To detect the false report, statistical en-route filtering method is proposed. In this paper, we proposed the secure path cycle selection method using fuzzy rule-based system to consume effective energy. The method makes balanced energy consumption of each node. Moreover, the lifetime of the whole network will be increased. The base station determines the path cycle using the fuzzy rule-based system. The performance of the proposed method is demonstrated using simulation studies with the three methods.展开更多
In response to the Beautiful China development strategy,in accordance with the"applicable,economical,green and beautiful"architectural policy of the new era,green buildings have been continuously optimized a...In response to the Beautiful China development strategy,in accordance with the"applicable,economical,green and beautiful"architectural policy of the new era,green buildings have been continuously optimized and popularized.Based on the life cycle theory,from the multi-dimensional perspectives of policy,building materials,construction,design,evaluation standards,operation,etc.,this paper studied the implementation path and development trend of green buildings.It discussed the main implementation paths and restrictive factors of green buildings,and provided solutions and development directions.It mainly elaborated the influencing factors and development direction of green buildings,in order to provide a documentary support for the development of green building industry,and provide a certain reference for the ecological civilization construction of beautiful China.展开更多
A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two d...A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two distinct vertices x and y in V(G)-{v},G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G-C,and if H is connected but not 2-connected,then there exist nonadjacent vertices u and v in H such that |V(C)|≥(3(d(u)+)d(v))-2.展开更多
Analyses of cloud water path （CWP） data over China available from the International Satellite Cloud Climatology Project （ISCCP） are performed for the period 1984-2004. Combined with GPCP precipitation data, cloud ...Analyses of cloud water path （CWP） data over China available from the International Satellite Cloud Climatology Project （ISCCP） are performed for the period 1984-2004. Combined with GPCP precipitation data, cloud water cycle index （CWCI） is also calculated. The climatic distributions of CWP are found to be dependent on large-scale circulation, topographical features, water vapor transport and similar distribution features which are found in CWCI except in the Sichuan Basin. Influenced by the Asia monsoon, CWP over China exhibits very large seasonal variations in different regions. The seasonal cycles of CWCI in different regions are consistent and the largest CWCI occurs in July. The long-term trends of CWP and CWCI are investigated, too. Increasing trends of CWP are found during the period with the largest increase found in winter. The decreasing trends of CWCI dominate most regions of China. The differences in long-term trends between CWP and CWCI suggest that CWP only can influence the variation of CWCI to a certain extent and that other factors need to be involved in cloud water cycle researches. This phenomenon reveals the complexity of the hydrological cycle related to cloud water.展开更多
In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of cycles of lengths 6 and 7 which contain a specific vertex v<sub>i</sub> in a simple graph G, in terms of the ad...In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of cycles of lengths 6 and 7 which contain a specific vertex v<sub>i</sub> in a simple graph G, in terms of the adjacency matrix and with the help of combinatorics.展开更多
Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing probl...Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.展开更多
基金supported by NSFC (11071096, 11171129)NSF of Hubei Province, China (T201103)
文摘Let Qn,k （n 〉 3, 1 〈 k ≤ n - 1） be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty vertices and faulty edges, respectively. In this paper, we give three main results. First, a fault-free path P[u, v] of length at least 2n - 2fv - 1 （respectively, 2n - 2fv - 2） can be embedded on Qn,k with fv ＋ f≤ n- 1 when dQn,k （u, v） is odd （respectively, dQ,~,k （u, v） is even）. Secondly, an Q,,k is （n - 2） edgefault-free hyper Hamiltonianaceable when n （ 3） and k have the same parity. Lastly, a fault-free cycle of length at least 2n - 2fv can be embedded on Qn,k with f~ 〈 n - 1 and fv＋f≤2n-4.
基金Supported in part by the NNSF of China(10301010,60673048)Science and Technology Commission of Shanghai Municipality(04JC14031).
文摘A labeled graph is an ordered pair （G, L） consisting of a graph G and its labeling L ： V（G） → {1,2 ,n}, where n = ｜V（G）｜. An increasing nonconsecutive path in a labeled graph （G,L） is either a path （u1,u2 uk） （k ≥ 2） in G such that L（u,） ＋ 2 ≤ L（ui＋1） for all i = 1, 2, ..., k- 1 or a path of order 1. The total number of increasing nonconsecutive paths in （G, L） is denoted by d（G, L）. A labeling L is optimal if the labeling L produces the largest d（G, L）. In this paper, a method simpler than that in Zverovich （2004） to obtain the optimal labeling of path is given. The optimal labeling of other special graphs such as cycles and stars is obtained.
文摘If D is a digraph, then K∈V(D) is a quasi-kernel of D if D[K]is discrete and for each y∈V(D)-K there is x∈K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles.
文摘Sensor nodes are easily compromised to malicious attackers due to an open environment. A false injected attack which takes place on application layer is elected by the compromised node. If the false report arrives in a base station, a false alarm is occurred, and the energy of the nodes is consumed. To detect the false report, statistical en-route filtering method is proposed. In this paper, we proposed the secure path cycle selection method using fuzzy rule-based system to consume effective energy. The method makes balanced energy consumption of each node. Moreover, the lifetime of the whole network will be increased. The base station determines the path cycle using the fuzzy rule-based system. The performance of the proposed method is demonstrated using simulation studies with the three methods.
文摘In response to the Beautiful China development strategy,in accordance with the"applicable,economical,green and beautiful"architectural policy of the new era,green buildings have been continuously optimized and popularized.Based on the life cycle theory,from the multi-dimensional perspectives of policy,building materials,construction,design,evaluation standards,operation,etc.,this paper studied the implementation path and development trend of green buildings.It discussed the main implementation paths and restrictive factors of green buildings,and provided solutions and development directions.It mainly elaborated the influencing factors and development direction of green buildings,in order to provide a documentary support for the development of green building industry,and provide a certain reference for the ecological civilization construction of beautiful China.
文摘A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two distinct vertices x and y in V(G)-{v},G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G-C,and if H is connected but not 2-connected,then there exist nonadjacent vertices u and v in H such that |V(C)|≥(3(d(u)+)d(v))-2.
基金CAS/SAFEA International Partnership Program for Creative Research Teams, the Knowledge Innovation Program of Chinese Academy of Sciences （Project No. KZCX2-YW-202） National Basic Research Program of China （Grant No. 2006CB403600） +1 种基金 the National Natural Science Foundation of China（Grant Nos. 40437017, 40221503） ＂The Climate System Model Development and Application Studies＂ of International Partnership Creative Group program of Chinese Academy of Sciences, and the Key Sci. ＆ Tech. Supporting Project of the Ministry of Science and Technology of China（2006BAC12B03）.
文摘Analyses of cloud water path （CWP） data over China available from the International Satellite Cloud Climatology Project （ISCCP） are performed for the period 1984-2004. Combined with GPCP precipitation data, cloud water cycle index （CWCI） is also calculated. The climatic distributions of CWP are found to be dependent on large-scale circulation, topographical features, water vapor transport and similar distribution features which are found in CWCI except in the Sichuan Basin. Influenced by the Asia monsoon, CWP over China exhibits very large seasonal variations in different regions. The seasonal cycles of CWCI in different regions are consistent and the largest CWCI occurs in July. The long-term trends of CWP and CWCI are investigated, too. Increasing trends of CWP are found during the period with the largest increase found in winter. The decreasing trends of CWCI dominate most regions of China. The differences in long-term trends between CWP and CWCI suggest that CWP only can influence the variation of CWCI to a certain extent and that other factors need to be involved in cloud water cycle researches. This phenomenon reveals the complexity of the hydrological cycle related to cloud water.
文摘In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of cycles of lengths 6 and 7 which contain a specific vertex v<sub>i</sub> in a simple graph G, in terms of the adjacency matrix and with the help of combinatorics.
文摘Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.
