In this paper,we first introduce vague set,then give the definition of intersection and unionbased on vague set with t-norm and t-conorm of the point value. Thus we gain some properties of inter-section and union of v...In this paper,we first introduce vague set,then give the definition of intersection and unionbased on vague set with t-norm and t-conorm of the point value. Thus we gain some properties of inter-section and union of vague set.展开更多
Food safety has received a great deal of attention in both developed and developing countries in recent years. In China, the numerous food scandals and scares that have struck over the past decade have spurred signifi...Food safety has received a great deal of attention in both developed and developing countries in recent years. In China, the numerous food scandals and scares that have struck over the past decade have spurred significant food safety regulatory reform, which has been increasingly oriented towards the public-private partnership model adopted by the Europe Union＇s （EU） food safety regulatory system. This paper analyzes the development of both the EU＇s and China＇s food safety regu- latory systems, identifies the current challenges for China and additionally considers the role of public-private partnership. The success of co-regulation in the food regulatory system would bring significant benefits and opportunities for China. Finally, this paper recommends additional measures like training and grants to improve the private＇s sector effectiveness in co-regulating China＇s food safety issues.展开更多
Let G be a simple graph. A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints. For E-total-colorin...Let G be a simple graph. A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints. For E-total-coloring f of a graph G and any vertex u of G, let Cf （u） or C（u） denote the set of colors of vertex u and the edges incident to u. We call C（u） the color set of u. If C（u） ≠ C（v） for any two different vertices u and v of V（G）, then we say that f is a vertex-distinguishing E-total-coloring of G, or a VDET coloring of G for short. The minimum number of colors required for a VDET colorings of G is denoted by X^evt（G）, and it is called the VDET chromatic number of G. In this article, we will discuss vertex-distinguishing E-total colorings of the graphs mC3 and mC4.展开更多
文摘In this paper,we first introduce vague set,then give the definition of intersection and unionbased on vague set with t-norm and t-conorm of the point value. Thus we gain some properties of inter-section and union of vague set.
基金provided by the CGIAR Research Program on Policies, Institutions, and Marketsby the National Natural Science Foundation of China (NSFC) Program on "Food Value Chain Upgrading for Food Safety in Transforming Food Markets" (71273269)
文摘Food safety has received a great deal of attention in both developed and developing countries in recent years. In China, the numerous food scandals and scares that have struck over the past decade have spurred significant food safety regulatory reform, which has been increasingly oriented towards the public-private partnership model adopted by the Europe Union＇s （EU） food safety regulatory system. This paper analyzes the development of both the EU＇s and China＇s food safety regu- latory systems, identifies the current challenges for China and additionally considers the role of public-private partnership. The success of co-regulation in the food regulatory system would bring significant benefits and opportunities for China. Finally, this paper recommends additional measures like training and grants to improve the private＇s sector effectiveness in co-regulating China＇s food safety issues.
基金Supported by the National Natural Science Foundation of China (Grant No.10771091)the Scientific Research Project of Northwest Normal University (Grant No.NWNU-KJCXGC-03-61)
文摘Let G be a simple graph. A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints. For E-total-coloring f of a graph G and any vertex u of G, let Cf （u） or C（u） denote the set of colors of vertex u and the edges incident to u. We call C（u） the color set of u. If C（u） ≠ C（v） for any two different vertices u and v of V（G）, then we say that f is a vertex-distinguishing E-total-coloring of G, or a VDET coloring of G for short. The minimum number of colors required for a VDET colorings of G is denoted by X^evt（G）, and it is called the VDET chromatic number of G. In this article, we will discuss vertex-distinguishing E-total colorings of the graphs mC3 and mC4.
