Aimed at determining the appropriate caving–mining ratio for fully mechanized mining of 20 m thick coal seam, this research investigated the effects of caving–mining ratio on the flow fields of coal and waste rocks,...Aimed at determining the appropriate caving–mining ratio for fully mechanized mining of 20 m thick coal seam, this research investigated the effects of caving–mining ratio on the flow fields of coal and waste rocks, amount of cyclically caved coal and top coal loss by means of numerical modeling. The research was based on the geological conditions of panel 8102 in Tashan coal mine. The results indicated the loose coal and waste rocks formed an elliptical zone around the drawpoint. The ellipse enlarged with decreasing caving–mining ratio. And its long axis inclined to the gob gradually became vertical and facilitating the caving and recovery of top coal. The top coal loss showed a cyclical variation; and the loss cycle was shortened with the decreasing in caving–mining ratio. Moreover, the mean squared error(MSE) of the amount of cyclically caved coal went up with increasing caving–mining ratio, indicating a growing imbalance of amount of cyclically caved coal, which could impede the coordinated mining and caving operations. Finally it was found that a caving–mining ratio of 1:2.51 should be reasonable for the conditions.展开更多
Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regu...Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity k and girth g(G) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree δ(G) ≥ 6 and girth g(G) ≥ 6.展开更多
A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v∈V(G) together with v are colored by (dG(v)+1) co...A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v∈V(G) together with v are colored by (dG(v)+1) consecutive colors modulo t, where dG(v) is the degree of the vertex v in G. The one point union ?of k-copies of cycle Cn is the graph obtained by taking v as a common vertex such that any two distinct cycles? and? are edge disjoint and do not have any vertex in common except v. In this paper, we study the cyclically interval total colorings of , where n≥3 and k≥2.展开更多
A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a set of k consecutive integers. A cyclically interval total ...A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a set of k consecutive integers. A cyclically interval total t-coloring of a graph G is a total coloring a of G with colors 1,2,...,t, such that at least one vertex or edge of G is colored by i,i=1,2,...,t, and for any, the set is a -interval, or is a -interval, where dG(x) is the degree of the vertex x in G. In this paper, we study the cyclically interval total colorings of cycles and middle graphs of cycles.展开更多
A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-...A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-connected, in short, super-λc, if the removal of any minimum cyclic edge-cut results in a component which is a shortest cycle. In [Zhang, Z., Wang, B.： Super cyclically edge-connected transitive graphs. J. Combin. Optim., 22, 549–562 （2011）], it is proved that a connected vertex-transitive graph is super-λc if G has minimum degree at least 4 and girth at least 6, and the authors also presented a class of nonsuper-λc graphs which have degree 4 and girth 5. In this paper, a characterization of k （k≥4）-regular vertex-transitive nonsuper-λc graphs of girth 5 is given. Using this, we classify all k （k≥4）-regular nonsuper-λc Cayley graphs of girth 5, and construct the first infinite family of nonsuper-λc vertex-transitive non-Cayley graphs.展开更多
A proper edge t-coloring of a graph G is a coloring of its edges with colors 1, 2,..., t, such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of...A proper edge t-coloring of a graph G is a coloring of its edges with colors 1, 2,..., t, such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each vertex, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. In this paper, we provide a new proof of the result on the colors in cyclically interval edge colorings of simple cycles which was first proved by Rafayel R. Kamalian in the paper “On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles, Open Journal of Discrete Mathematics, 2013, 43-48”.展开更多
In this paper, a computational method for finite element stress analysis of a cyclically symmetric structure subjected to arbitrary loads is provided. At first, using discrete Fourier transformation technique, the com...In this paper, a computational method for finite element stress analysis of a cyclically symmetric structure subjected to arbitrary loads is provided. At first, using discrete Fourier transformation technique, the complete structure is analyzed by considering only one sector with appropriate complex constraints on its boundary with the adjacent sectors. Next, an imaginary structure which is composed of two identically overlapping sectors is constructed, and that the complex constraints mentioned above can be equivalently replaced by a set of real constraints on this imaginary structure is proved. Therefore, the stress analysis of a cyclically symmetric structure can be solved conveniently by most of finite element programs.展开更多
A proper edge t-coloring of a graph G is a coloring of its edges with colors 1,2,???,t such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is ...A proper edge t-coloring of a graph G is a coloring of its edges with colors 1,2,???,t such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each its vertex x, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. For an arbitrary simple cycle, all possible values of t are found, for which the graph has a cyclically interval t-coloring.展开更多
In this paper, we mainly study the relation of two cyclically reduced words w and w＇ on the condition they have the same trace polynomial （i.e., tr w= trw＇ ）. By defining an equivalence relation through such opera...In this paper, we mainly study the relation of two cyclically reduced words w and w＇ on the condition they have the same trace polynomial （i.e., tr w= trw＇ ）. By defining an equivalence relation through such operators on words as inverse, cyclically left shift, and mirror, it is straightforward to get that w ～ w＇ implies tr w = tr w＇. We show by a counter example that tr w = tr w＇ does not imply w ～ w＇. And in two special cases, we prove that tr w = tr w＇ if and only if w ～ w＇.展开更多
NGUYEN et al. give a method for constructing binary CP constant-weight (CPC) codes,then they construct protocol sequences with good performance by using the codes. To makethe minimum distance of the CP codes large eno...NGUYEN et al. give a method for constructing binary CP constant-weight (CPC) codes,then they construct protocol sequences with good performance by using the codes. To makethe minimum distance of the CP codes large enough, Nguyen et al. select two classes of maxi-mum distance separable(MDS) codes which are q-ary Reed-Solomon (R-S) codes and q-arygeneralized Berlekamp-Justesen(B-J) codes. The generalized B-J codes are more展开更多
In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties,...In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.展开更多
The low frequency cyclical transient natural convection in a cube enclosure with an internal isolated vertical heated plate was investigated experimentally. A computer-aided experimental system was designed to generat...The low frequency cyclical transient natural convection in a cube enclosure with an internal isolated vertical heated plate was investigated experimentally. A computer-aided experimental system was designed to generate the cyclical heating power input and also used for data reduction. The effects of the cyclic heating power input amplitude (from 0 to 8 W) and frequency (from 1/5400 s-1 to 1/600 s-1)as well as the per-cycle time-average power input (from 8 to 24 W) on the transient and time-average Nusselt number were parametrically studied. It was found that for such cyclical transient natural convection with low frequency, the plate heating power input amplitude and frequency have little effects on the time-average Nusselt number as long as the cyclical time-average heating power input remains the same, although the transient Nusselt number may be significantly affected. Therefore, the modified Grashof number based on the plate average heat flux can be used to characterize the time-average heat transfer process. The plate time-average Nusselt number is about 15% less than the infinite-space Nusselt number. The location of the isolated plate in enclosure does not appreciably influence the time-average heat transfer characteristics of the plate.展开更多
基金provided by the independent research subject of State Key Laboratory of Coal Resources and Mine Safety of China University of Mining and Technology (No. SKLCRSM12X03)the Scientific Research and Innovation Project for College Graduates in Jiangsu (No. CXZZ13_0947)
文摘Aimed at determining the appropriate caving–mining ratio for fully mechanized mining of 20 m thick coal seam, this research investigated the effects of caving–mining ratio on the flow fields of coal and waste rocks, amount of cyclically caved coal and top coal loss by means of numerical modeling. The research was based on the geological conditions of panel 8102 in Tashan coal mine. The results indicated the loose coal and waste rocks formed an elliptical zone around the drawpoint. The ellipse enlarged with decreasing caving–mining ratio. And its long axis inclined to the gob gradually became vertical and facilitating the caving and recovery of top coal. The top coal loss showed a cyclical variation; and the loss cycle was shortened with the decreasing in caving–mining ratio. Moreover, the mean squared error(MSE) of the amount of cyclically caved coal went up with increasing caving–mining ratio, indicating a growing imbalance of amount of cyclically caved coal, which could impede the coordinated mining and caving operations. Finally it was found that a caving–mining ratio of 1:2.51 should be reasonable for the conditions.
文摘Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity k and girth g(G) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree δ(G) ≥ 6 and girth g(G) ≥ 6.
文摘A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v∈V(G) together with v are colored by (dG(v)+1) consecutive colors modulo t, where dG(v) is the degree of the vertex v in G. The one point union ?of k-copies of cycle Cn is the graph obtained by taking v as a common vertex such that any two distinct cycles? and? are edge disjoint and do not have any vertex in common except v. In this paper, we study the cyclically interval total colorings of , where n≥3 and k≥2.
文摘A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a set of k consecutive integers. A cyclically interval total t-coloring of a graph G is a total coloring a of G with colors 1,2,...,t, such that at least one vertex or edge of G is colored by i,i=1,2,...,t, and for any, the set is a -interval, or is a -interval, where dG(x) is the degree of the vertex x in G. In this paper, we study the cyclically interval total colorings of cycles and middle graphs of cycles.
基金supported by National Natural Science Foundation of China (Grant No.11271012)the Fundamental Research Funds for the Central Universities (Grant Nos.2011JBM127,2011JBZ012)+1 种基金supported by National Natural Science Foundation of China (Grant No.11101035)the Subsidy for Outstanding People of Beijing (Grant No.2011D005022000005)
文摘A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-connected, in short, super-λc, if the removal of any minimum cyclic edge-cut results in a component which is a shortest cycle. In [Zhang, Z., Wang, B.： Super cyclically edge-connected transitive graphs. J. Combin. Optim., 22, 549–562 （2011）], it is proved that a connected vertex-transitive graph is super-λc if G has minimum degree at least 4 and girth at least 6, and the authors also presented a class of nonsuper-λc graphs which have degree 4 and girth 5. In this paper, a characterization of k （k≥4）-regular vertex-transitive nonsuper-λc graphs of girth 5 is given. Using this, we classify all k （k≥4）-regular nonsuper-λc Cayley graphs of girth 5, and construct the first infinite family of nonsuper-λc vertex-transitive non-Cayley graphs.
文摘A proper edge t-coloring of a graph G is a coloring of its edges with colors 1, 2,..., t, such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each vertex, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. In this paper, we provide a new proof of the result on the colors in cyclically interval edge colorings of simple cycles which was first proved by Rafayel R. Kamalian in the paper “On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles, Open Journal of Discrete Mathematics, 2013, 43-48”.
文摘In this paper, a computational method for finite element stress analysis of a cyclically symmetric structure subjected to arbitrary loads is provided. At first, using discrete Fourier transformation technique, the complete structure is analyzed by considering only one sector with appropriate complex constraints on its boundary with the adjacent sectors. Next, an imaginary structure which is composed of two identically overlapping sectors is constructed, and that the complex constraints mentioned above can be equivalently replaced by a set of real constraints on this imaginary structure is proved. Therefore, the stress analysis of a cyclically symmetric structure can be solved conveniently by most of finite element programs.
文摘A proper edge t-coloring of a graph G is a coloring of its edges with colors 1,2,???,t such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each its vertex x, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. For an arbitrary simple cycle, all possible values of t are found, for which the graph has a cyclically interval t-coloring.
基金Supported by the Morningside Center of Mathematics of Beijingthe National Natural Science Foundation of China (No. 10501002)
文摘In this paper, we mainly study the relation of two cyclically reduced words w and w＇ on the condition they have the same trace polynomial （i.e., tr w= trw＇ ）. By defining an equivalence relation through such operators on words as inverse, cyclically left shift, and mirror, it is straightforward to get that w ～ w＇ implies tr w = tr w＇. We show by a counter example that tr w = tr w＇ does not imply w ～ w＇. And in two special cases, we prove that tr w = tr w＇ if and only if w ～ w＇.
文摘NGUYEN et al. give a method for constructing binary CP constant-weight (CPC) codes,then they construct protocol sequences with good performance by using the codes. To makethe minimum distance of the CP codes large enough, Nguyen et al. select two classes of maxi-mum distance separable(MDS) codes which are q-ary Reed-Solomon (R-S) codes and q-arygeneralized Berlekamp-Justesen(B-J) codes. The generalized B-J codes are more
文摘In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.
文摘The low frequency cyclical transient natural convection in a cube enclosure with an internal isolated vertical heated plate was investigated experimentally. A computer-aided experimental system was designed to generate the cyclical heating power input and also used for data reduction. The effects of the cyclic heating power input amplitude (from 0 to 8 W) and frequency (from 1/5400 s-1 to 1/600 s-1)as well as the per-cycle time-average power input (from 8 to 24 W) on the transient and time-average Nusselt number were parametrically studied. It was found that for such cyclical transient natural convection with low frequency, the plate heating power input amplitude and frequency have little effects on the time-average Nusselt number as long as the cyclical time-average heating power input remains the same, although the transient Nusselt number may be significantly affected. Therefore, the modified Grashof number based on the plate average heat flux can be used to characterize the time-average heat transfer process. The plate time-average Nusselt number is about 15% less than the infinite-space Nusselt number. The location of the isolated plate in enclosure does not appreciably influence the time-average heat transfer characteristics of the plate.
