Image coloring is an inherently uncertain and multimodal problem.By inputting a grayscale image into a coloring network,visually plausible colored photos can be generated.Conventional methods primarily rely on semanti...Image coloring is an inherently uncertain and multimodal problem.By inputting a grayscale image into a coloring network,visually plausible colored photos can be generated.Conventional methods primarily rely on semantic information for image colorization.These methods still suffer from color contamination and semantic confusion.This is largely due to the limited capacity of convolutional neural networks to learn deep semantic information inherent in images effectively.In this paper,we propose a network structure that addresses these limitations by leveraging multi-level semantic information classification and fusion.Additionally,we introduce a global semantic fusion network to combat the issues of color contamination.The proposed coloring encoder accurately extracts object-level semantic information from images.To further enhance visual plausibility,we employ a self-supervised adversarial training method.We train the network structure on various datasets with varying amounts of data and evaluate its performance using the ImageNet validation set and COCO validation set.Experimental results demonstrate that our proposed algorithm can generate more realistic images compared to previous approaches,showcasing its high generalization ability.展开更多
A proper conflict-free k-coloring of a graph is a proper k-coloring in which each nonisolated vertex has a color that appears ex-actly once in its open neighborhood.A graph is PCF k-colorable if it admits a proper con...A proper conflict-free k-coloring of a graph is a proper k-coloring in which each nonisolated vertex has a color that appears ex-actly once in its open neighborhood.A graph is PCF k-colorable if it admits a proper conflict-free k-coloring.The PCF chromatic number of a graph G,denoted by χ_(pcf)(G),is the minimum k such that G is PCF k-colorable.Caro et al conjectured that for a connected graph G with maximum degreeΔ≥3,χ_(pcf)(G)≤Δ+1.One case in this conjecture,a connected graph with maximum degree 3 is PCF 4-colorable,can be derived from the result of Liu and Yu.Jiménez et al stated that the upper bound of PCF chromatic number of a graph G is max{5,x(G)}without a proof.In this paper,we give new proofs of the two results above and derive that for a connected graph G with maximum degreeΔ≥3,its complete subdivision is PCF(Δ+1)-colorable.展开更多
With the development of Internet technology and human computing, the computing environment has changed dramatically over the last three decades. Cloud computing emerges as a paradigm of Internet computing in which dyn...With the development of Internet technology and human computing, the computing environment has changed dramatically over the last three decades. Cloud computing emerges as a paradigm of Internet computing in which dynamical, scalable and often virtuMized resources are provided as services. With virtualization technology, cloud computing offers diverse services （such as virtual computing, virtual storage, virtual bandwidth, etc.） for the public by means of multi-tenancy mode. Although users are enjoying the capabilities of super-computing and mass storage supplied by cloud computing, cloud security still remains as a hot spot problem, which is in essence the trust management between data owners and storage service providers. In this paper, we propose a data coloring method based on cloud watermarking to recognize and ensure mutual reputations. The experimental results show that the robustness of reverse cloud generator can guarantee users＇ embedded social reputation identifications. Hence, our work provides a reference solution to the critical problem of cloud security.展开更多
Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed ...Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.展开更多
A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of ...A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.展开更多
Large-area and free-standing photonic crystal(PC)polymer films exhibit highly saturated iridescence and robust structural colors,making them promising for applications in the field of display,anti-counterfeiting,and c...Large-area and free-standing photonic crystal(PC)polymer films exhibit highly saturated iridescence and robust structural colors,making them promising for applications in the field of display,anti-counterfeiting,and camouflage.However,their practical utilization has been hindered by challenges in achieving both vivid coloration and reusability.Here,we design a sandwich-structured PC film that simultaneously addresses issues of color appearance and reusability by combining colloid evaporative self-assembly on porous substrate and knife coating of polymers.The unique“sandwich”structure,comprising a self-assembled PC intermediate layer and protective polymer encapsulation,demonstrates a great synergistic effect(“1+1>2”),including unprecedented color fastness stability(affordable for 100 times dye/wet fastness),bright iridescent color,and certain flexibility and reusability.In addition,by replacing the bottom polymer with a double-sided adhesive,a flexible PC sticker can be further obtained,broadening its range of applications to surfaces of different materials.This strategy opens a new avenue for constructing functionalized iridescent PC-polymer films.展开更多
Coconut(Cocos nucifera L.),a major oil and fruit crop of the Arecaceae family,is extensively cultivated across the Asia—Pacific region.Despite its agricultural importance,genome assembly in coconut remains challengin...Coconut(Cocos nucifera L.),a major oil and fruit crop of the Arecaceae family,is extensively cultivated across the Asia—Pacific region.Despite its agricultural importance,genome assembly in coconut remains challenging due to its large genome size and high proportion of repetitive sequences.Allele-specific expression(ASE)plays a key role in regulating plant development and evolution,yet research on ASE in coconut is limited(Shao et al.,2019;Li et al.,2021;Zhang et al.,2021;Hu et al.,2022).Among phenotypic traits,fruit color is especially important as an indicator of maturity,guiding harvest timing and post-harvest processes(Kapoor et al.,2022).While prior studies have explored various coconut traits such as salt tolerance,fiber content,and plant height(Wang et al.,2021;Yang et al.,2021),investigations into ASE and fruit color remain scarce.展开更多
Chinese women artists have created many works in recent years,to show the magnificent views of the motherland,the lives of Chinese people,and the lively animals and plants.The works contain vibrant colors,to express t...Chinese women artists have created many works in recent years,to show the magnificent views of the motherland,the lives of Chinese people,and the lively animals and plants.The works contain vibrant colors,to express the artists'love for nature and life,as well as their dedication to creation.In this edition,Women of China English Monthly highlights some of the works,to share the beautiful creations with our readers.展开更多
Let G be a simple graph. A total coloring f of G is called an 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....Let G be a simple graph. A total coloring f of G is called an 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 an E-total coloring f of a graph G and any vertex x of G, let C（x） denote the set of colors of vertex x and of the edges incident with x, we call C（x） the color set of x. 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 coloring of G is denoted by Хvt^e（G） and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n （7 ≤ n ≤ 95） is discussed in this paper and the VDET chromatic number of K7,n （7 ≤ n ≤ 95） has been obtained.展开更多
This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, usin...This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, using the matrix semi-tensor product, the robust graph coloring is expressed into a kind of optimization problem taking in an algebraic form of matrices, based on which an algorithm is designed to find all the most robust coloring schemes for any simple graph. Second, an equivalent problem of robust graph coloring is studied, and a necessary and sufficient condition is proposed, from which a new algorithm to find all the most robust coloring schemes is established. Third, a kind of examination timetabling is discussed by using the obtained results, and a method to design a practicable timetabling scheme is presented. Finally, the effectiveness of the results/algorithms presented in this paper is shown by two illustrative examples.展开更多
Let f be a proper total k-coloring of a simple graph G. For any vertex x ∈ V（G）, let Cf（x） denote the set of colors assigned to vertex x and the edges incident with x. If Cf（u） ≠ Cf（v） for all distinct verti...Let f be a proper total k-coloring of a simple graph G. For any vertex x ∈ V（G）, let Cf（x） denote the set of colors assigned to vertex x and the edges incident with x. If Cf（u） ≠ Cf（v） for all distinct vertices u and v of V（G）, then f is called a vertex- distinguishing total k-coloring of G. The minimum number k for which there exists a vertex- distinguishing total k-coloring of G is called the vertex-distinguishing total chromatic number of G and denoted by Xvt（G）. The vertex-disjoint union of two cycles of length n is denoted by 2Cn. We will obtain Xvt（2Cn） in this paper.展开更多
As a kind of rare materials,nano-silver has broad application prospects in the fields of catalysis,medical treatment,new energy and so on.However,there are few reports on the systematic research of nano-silver in cera...As a kind of rare materials,nano-silver has broad application prospects in the fields of catalysis,medical treatment,new energy and so on.However,there are few reports on the systematic research of nano-silver in ceramic glazes.In this work,different color ceramic glazes were produced by tuning the nano-silver content and optimizing the firing process.The crystalline phase composition,micro-morphology and elemental distribution of fired glazes were analyzed and discussed in depth.The elemental composition and distribution of the samples were studied.The surface of the glazes with varying Ag contents fired under the reducing atmosphere exhibited blue-white.And the blue color is attributable to Rayleigh scattering that may arise because the phase-separation structures existed in glazes.Interestingly,the color of the ceramic glazes with varying Ag contents changed to golden-yellow when the ceramic glazes were fired under the air atmosphere.Golden-yellow color of the samples fired under the air atmosphere is mainly attributable to the silver nanoparticles,though Ag^(+) may be existed in the glazes.展开更多
Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoi...Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.展开更多
Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges i...Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u） =fi C（v） for any two different vertices u and v of V（G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The ie iV., minimum number of colors required for a VDIET coloring of G is denoted by X,t[ 1, and it is called the VDIET chromatic number of G. We will give VDIET chromatic numbers for complete bipartite graph K4,n（n ≥ 4）, Kn,n （5 ≤ n ≤21） in this article.展开更多
Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges i...Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u）=C（v） for any two different vertices u and v of V （G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt（G）, and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper.展开更多
Generalized anxiety disorder(GAD)has harmful effects on physical and mental health and quality of life.Coloring therapy has been reported to have a positive effect on improving patient anxiety and depression.But there...Generalized anxiety disorder(GAD)has harmful effects on physical and mental health and quality of life.Coloring therapy has been reported to have a positive effect on improving patient anxiety and depression.But there are no reported clinical trials examining their effectiveness as a treatment for GAD.This study was planned to evaluate the effectiveness of coloring therapy combined with conventional therapy in improving anxiety,depression,and positive and negative emotions with GAD.This randomized controlled study comprising 88 GAD patients was selected for intervention in different wards.The control group(n=45)was given conventional antianxiety medication and physical therapy,and the experimental group(n=43)received coloring therapy combined with conventional therapy.The Self-Rating Depression Scale,Self-Rating Anxiety Scale(SAS),Hamilton Depression Scale,Hamilton Anxiety Scale(HAMA),and Positive and Negative Affect Scale were assessed in both groups before and 3 weeks after the intervention.After the intervention,there were statistical differences in intra-and inter-group comparisons of anxiety,depression,and positive and negative mood scales in the experimental and control groups(p<.05).The minus in anxiety/positive emotions pre-and postintervention in the experimental group was statistically significant compared to that in anxiety/positive emotions pre-and postintervention in the control group(HAMA:d=1.45,95%confidence interval[CI](0.34,2.57),p=.011;SAS:d=3.87,95%CI(1.73,6.00),p=.001;positive:d=1.76,95%CI(0.17,3.34),p=.030).The minus in depressive/negative emotions pre-and postintervention in the experimental group was not statistically significant compared with that in depressive/negative emotions pre-and postintervention in the control group(p>.05).For GAD patients,adding coloring therapy based on conventional drug therapy and physical therapy can not only reduce depression and negative emotions but also have better effects on reducing anxiety and improving positive emotions than conventional therapy.展开更多
Let G be a simple graph and f be a proper total kcoloring of G. The color set of each vertex v of G is the set of colors appearing on v and the edges incident to v. The coloring f is said to be an adjacent vertex-dist...Let G be a simple graph and f be a proper total kcoloring of G. The color set of each vertex v of G is the set of colors appearing on v and the edges incident to v. The coloring f is said to be an adjacent vertex-distinguishing total coloring if the color sets of any two adjacent vertices are distinct. The minimum k for which such a coloring of G exists is called the adjacent vertex-distinguishing total chromatic number of G. The join graph of two vertex-disjoint graphs is the graph union of these two graphs together with all the edges that connect the vertices of one graph with the vertices of the other. The adjacent vertex-distinguishing total chromatic numbers of the join graphs of an empty graph of order s and a complete graph of order t are determined.展开更多
The 08 Al steel sheets were hot dip ped into Zn - Mn bath with 0 1 % Mn and 0 2 % Mn at600 ～420 ℃ bath tem perature , and then w ere treated in different w ays . The after - treat ments include cooling in t...The 08 Al steel sheets were hot dip ped into Zn - Mn bath with 0 1 % Mn and 0 2 % Mn at600 ～420 ℃ bath tem perature , and then w ere treated in different w ays . The after - treat ments include cooling in the air at room tem perature directly , holding at the upper part of thehot dip galvanizing furnace for 60 s an d then holding at 510 ±10 ℃for 90 s . The results in dicated that blue , yellow , and purple , w hose coloration varied with the co m position an d thetem perature of bath and the w ays of after - treat ment . Finally , the mechanism of coloredzinc coating w as discussed .展开更多
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of verte...Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.展开更多
For a proper edge coloring c of a graph G, if the sets of colors of adjacent vertices are distinct, the edge coloring c is called an adjacent strong edge coloring of G. Let ci be the number of edges colored by i. If [...For a proper edge coloring c of a graph G, if the sets of colors of adjacent vertices are distinct, the edge coloring c is called an adjacent strong edge coloring of G. Let ci be the number of edges colored by i. If [ci - cj] ≤1 for any two colors i and j, then c is an equitable edge coloring of G. The coloring c is an equitable adjacent strong edge coloring of G if it is both adjacent strong edge coloring and equitable edge coloring. The least number of colors of such a coloring c is called the equitable adjacent strong chromatic index of G. In this paper, we determine the equitable adjacent strong chromatic index of the joins of paths and cycles. Precisely, we show that the equitable adjacent strong chromatic index of the joins of paths and cycles is equal to the maximum degree plus one or two.展开更多
基金supported by the Key Technologies R&D Program of Tianjin(Nos.24YFZCSN00030 and 24YFYSHZ00090)。
文摘Image coloring is an inherently uncertain and multimodal problem.By inputting a grayscale image into a coloring network,visually plausible colored photos can be generated.Conventional methods primarily rely on semantic information for image colorization.These methods still suffer from color contamination and semantic confusion.This is largely due to the limited capacity of convolutional neural networks to learn deep semantic information inherent in images effectively.In this paper,we propose a network structure that addresses these limitations by leveraging multi-level semantic information classification and fusion.Additionally,we introduce a global semantic fusion network to combat the issues of color contamination.The proposed coloring encoder accurately extracts object-level semantic information from images.To further enhance visual plausibility,we employ a self-supervised adversarial training method.We train the network structure on various datasets with varying amounts of data and evaluate its performance using the ImageNet validation set and COCO validation set.Experimental results demonstrate that our proposed algorithm can generate more realistic images compared to previous approaches,showcasing its high generalization ability.
基金Supported by the Youth Fund of Lanzhou Jiaotong University(1200061328)。
文摘A proper conflict-free k-coloring of a graph is a proper k-coloring in which each nonisolated vertex has a color that appears ex-actly once in its open neighborhood.A graph is PCF k-colorable if it admits a proper conflict-free k-coloring.The PCF chromatic number of a graph G,denoted by χ_(pcf)(G),is the minimum k such that G is PCF k-colorable.Caro et al conjectured that for a connected graph G with maximum degreeΔ≥3,χ_(pcf)(G)≤Δ+1.One case in this conjecture,a connected graph with maximum degree 3 is PCF 4-colorable,can be derived from the result of Liu and Yu.Jiménez et al stated that the upper bound of PCF chromatic number of a graph G is max{5,x(G)}without a proof.In this paper,we give new proofs of the two results above and derive that for a connected graph G with maximum degreeΔ≥3,its complete subdivision is PCF(Δ+1)-colorable.
基金supported by National Basic Research Program of China (973 Program) (No. 2007CB310800)China Postdoctoral Science Foundation (No. 20090460107 and No. 201003794)
文摘With the development of Internet technology and human computing, the computing environment has changed dramatically over the last three decades. Cloud computing emerges as a paradigm of Internet computing in which dynamical, scalable and often virtuMized resources are provided as services. With virtualization technology, cloud computing offers diverse services （such as virtual computing, virtual storage, virtual bandwidth, etc.） for the public by means of multi-tenancy mode. Although users are enjoying the capabilities of super-computing and mass storage supplied by cloud computing, cloud security still remains as a hot spot problem, which is in essence the trust management between data owners and storage service providers. In this paper, we propose a data coloring method based on cloud watermarking to recognize and ensure mutual reputations. The experimental results show that the robustness of reverse cloud generator can guarantee users＇ embedded social reputation identifications. Hence, our work provides a reference solution to the critical problem of cloud security.
基金supported by the National Natural Science Foundation of China (60775047)Hunan Provincial Natural Science Foundation of China (07JJ6111)
文摘Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.
基金supported by NSFC of China (No. 19871036 and No. 40301037)Faculty Research Grant,Hong Kong Baptist University
文摘A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.
基金financially supported by the National Natural Science Foundation of China(Nos.22178047 and 21878042)the Fundamental Research Funds for the Central Universities(No.DUT22LAB610)Liaoning province science and technology plan projects(No.2022JH2/101300233).
文摘Large-area and free-standing photonic crystal(PC)polymer films exhibit highly saturated iridescence and robust structural colors,making them promising for applications in the field of display,anti-counterfeiting,and camouflage.However,their practical utilization has been hindered by challenges in achieving both vivid coloration and reusability.Here,we design a sandwich-structured PC film that simultaneously addresses issues of color appearance and reusability by combining colloid evaporative self-assembly on porous substrate and knife coating of polymers.The unique“sandwich”structure,comprising a self-assembled PC intermediate layer and protective polymer encapsulation,demonstrates a great synergistic effect(“1+1>2”),including unprecedented color fastness stability(affordable for 100 times dye/wet fastness),bright iridescent color,and certain flexibility and reusability.In addition,by replacing the bottom polymer with a double-sided adhesive,a flexible PC sticker can be further obtained,broadening its range of applications to surfaces of different materials.This strategy opens a new avenue for constructing functionalized iridescent PC-polymer films.
基金supported by Central Public-interest Scientific Institution Basal Research Fund(CATAS-Nos.1630152023007,1630152023011,1630152023012,1630152023013)the National Natural Science Foundation of China(Grant No.32071805).
文摘Coconut(Cocos nucifera L.),a major oil and fruit crop of the Arecaceae family,is extensively cultivated across the Asia—Pacific region.Despite its agricultural importance,genome assembly in coconut remains challenging due to its large genome size and high proportion of repetitive sequences.Allele-specific expression(ASE)plays a key role in regulating plant development and evolution,yet research on ASE in coconut is limited(Shao et al.,2019;Li et al.,2021;Zhang et al.,2021;Hu et al.,2022).Among phenotypic traits,fruit color is especially important as an indicator of maturity,guiding harvest timing and post-harvest processes(Kapoor et al.,2022).While prior studies have explored various coconut traits such as salt tolerance,fiber content,and plant height(Wang et al.,2021;Yang et al.,2021),investigations into ASE and fruit color remain scarce.
文摘Chinese women artists have created many works in recent years,to show the magnificent views of the motherland,the lives of Chinese people,and the lively animals and plants.The works contain vibrant colors,to express the artists'love for nature and life,as well as their dedication to creation.In this edition,Women of China English Monthly highlights some of the works,to share the beautiful creations with our readers.
文摘Let G be a simple graph. A total coloring f of G is called an 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 an E-total coloring f of a graph G and any vertex x of G, let C（x） denote the set of colors of vertex x and of the edges incident with x, we call C（x） the color set of x. 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 coloring of G is denoted by Хvt^e（G） and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n （7 ≤ n ≤ 95） is discussed in this paper and the VDET chromatic number of K7,n （7 ≤ n ≤ 95） has been obtained.
基金This work was supported by the National Natural Science Foundation of China （Nos. G61374065, G61034007, G61374002） the Fund for the Taishan Scholar Project of Shandong Province, the Natural Science Foundation of Shandong Province （No. ZR2010FM013） the Scientific Research and Development Project of Shandong Provincial Education Department （No. J11LA01 ）
文摘This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, using the matrix semi-tensor product, the robust graph coloring is expressed into a kind of optimization problem taking in an algebraic form of matrices, based on which an algorithm is designed to find all the most robust coloring schemes for any simple graph. Second, an equivalent problem of robust graph coloring is studied, and a necessary and sufficient condition is proposed, from which a new algorithm to find all the most robust coloring schemes is established. Third, a kind of examination timetabling is discussed by using the obtained results, and a method to design a practicable timetabling scheme is presented. Finally, the effectiveness of the results/algorithms presented in this paper is shown by two illustrative examples.
文摘Let f be a proper total k-coloring of a simple graph G. For any vertex x ∈ V（G）, let Cf（x） denote the set of colors assigned to vertex x and the edges incident with x. If Cf（u） ≠ Cf（v） for all distinct vertices u and v of V（G）, then f is called a vertex- distinguishing total k-coloring of G. The minimum number k for which there exists a vertex- distinguishing total k-coloring of G is called the vertex-distinguishing total chromatic number of G and denoted by Xvt（G）. The vertex-disjoint union of two cycles of length n is denoted by 2Cn. We will obtain Xvt（2Cn） in this paper.
基金financially supported by the National Natural Science Foundation of China(Grant No.52072327)Zhongyuan Thousand Talents(Zhongyuan Scholars)Program of Henan Province(No.202101510004)+2 种基金the Scientific and Technological Projects of Henan Province(No.202102210022)the Undergraduate Innovation and Entrepreneurship Project of Henan Province(No.202010480011)Henan Province Water Conservancy Technology Project(No.GG201922)。
文摘As a kind of rare materials,nano-silver has broad application prospects in the fields of catalysis,medical treatment,new energy and so on.However,there are few reports on the systematic research of nano-silver in ceramic glazes.In this work,different color ceramic glazes were produced by tuning the nano-silver content and optimizing the firing process.The crystalline phase composition,micro-morphology and elemental distribution of fired glazes were analyzed and discussed in depth.The elemental composition and distribution of the samples were studied.The surface of the glazes with varying Ag contents fired under the reducing atmosphere exhibited blue-white.And the blue color is attributable to Rayleigh scattering that may arise because the phase-separation structures existed in glazes.Interestingly,the color of the ceramic glazes with varying Ag contents changed to golden-yellow when the ceramic glazes were fired under the air atmosphere.Golden-yellow color of the samples fired under the air atmosphere is mainly attributable to the silver nanoparticles,though Ag^(+) may be existed in the glazes.
基金Supported by the NNSF of China(61163037,61163054)Supported by the Scientific Research Foundation of Ningxia University((E):ndzr09-15)
文摘Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.
基金Supported by the National Natural Science Foundation of China (Grant Nos. 6116303761163054)+2 种基金the Scientific Research Project of Northwest Normal University (No. nwnu-kjcxgc-03-61)the Natural Foudation Project of Ningxia (No. NZ1154)the Scientific Research Foudation Project of Ningxia University (No. (E):ndzr10-7)
文摘Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u） =fi C（v） for any two different vertices u and v of V（G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The ie iV., minimum number of colors required for a VDIET coloring of G is denoted by X,t[ 1, and it is called the VDIET chromatic number of G. We will give VDIET chromatic numbers for complete bipartite graph K4,n（n ≥ 4）, Kn,n （5 ≤ n ≤21） in this article.
基金The NSF(61163037,61163054) of Chinathe Scientific Research Project(nwnu-kjcxgc-03-61) of Northwest Normal University
文摘Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u）=C（v） for any two different vertices u and v of V （G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt（G）, and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper.
基金the National Natural Science Foundation of China(grant number 31672295)。
文摘Generalized anxiety disorder(GAD)has harmful effects on physical and mental health and quality of life.Coloring therapy has been reported to have a positive effect on improving patient anxiety and depression.But there are no reported clinical trials examining their effectiveness as a treatment for GAD.This study was planned to evaluate the effectiveness of coloring therapy combined with conventional therapy in improving anxiety,depression,and positive and negative emotions with GAD.This randomized controlled study comprising 88 GAD patients was selected for intervention in different wards.The control group(n=45)was given conventional antianxiety medication and physical therapy,and the experimental group(n=43)received coloring therapy combined with conventional therapy.The Self-Rating Depression Scale,Self-Rating Anxiety Scale(SAS),Hamilton Depression Scale,Hamilton Anxiety Scale(HAMA),and Positive and Negative Affect Scale were assessed in both groups before and 3 weeks after the intervention.After the intervention,there were statistical differences in intra-and inter-group comparisons of anxiety,depression,and positive and negative mood scales in the experimental and control groups(p<.05).The minus in anxiety/positive emotions pre-and postintervention in the experimental group was statistically significant compared to that in anxiety/positive emotions pre-and postintervention in the control group(HAMA:d=1.45,95%confidence interval[CI](0.34,2.57),p=.011;SAS:d=3.87,95%CI(1.73,6.00),p=.001;positive:d=1.76,95%CI(0.17,3.34),p=.030).The minus in depressive/negative emotions pre-and postintervention in the experimental group was not statistically significant compared with that in depressive/negative emotions pre-and postintervention in the control group(p>.05).For GAD patients,adding coloring therapy based on conventional drug therapy and physical therapy can not only reduce depression and negative emotions but also have better effects on reducing anxiety and improving positive emotions than conventional therapy.
基金The Fundamental Research Funds for the Central Universities of China(No.3207013904)
文摘Let G be a simple graph and f be a proper total kcoloring of G. The color set of each vertex v of G is the set of colors appearing on v and the edges incident to v. The coloring f is said to be an adjacent vertex-distinguishing total coloring if the color sets of any two adjacent vertices are distinct. The minimum k for which such a coloring of G exists is called the adjacent vertex-distinguishing total chromatic number of G. The join graph of two vertex-disjoint graphs is the graph union of these two graphs together with all the edges that connect the vertices of one graph with the vertices of the other. The adjacent vertex-distinguishing total chromatic numbers of the join graphs of an empty graph of order s and a complete graph of order t are determined.
文摘The 08 Al steel sheets were hot dip ped into Zn - Mn bath with 0 1 % Mn and 0 2 % Mn at600 ～420 ℃ bath tem perature , and then w ere treated in different w ays . The after - treat ments include cooling in the air at room tem perature directly , holding at the upper part of thehot dip galvanizing furnace for 60 s an d then holding at 510 ±10 ℃for 90 s . The results in dicated that blue , yellow , and purple , w hose coloration varied with the co m position an d thetem perature of bath and the w ays of after - treat ment . Finally , the mechanism of coloredzinc coating w as discussed .
基金Supported by the National Natural Science Foundation of China（61163037, 61163054, 11261046, 61363060）
文摘Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.
基金Supported by the Fundamental Research Funds for the Central Universities(Grant Nos. 2011B019)the National Natural Science Foundation of China (Grant Nos. 10971144+2 种基金1110102011171026)the Natural Science Foundation of Beijing (Grant No. 1102015)
文摘For a proper edge coloring c of a graph G, if the sets of colors of adjacent vertices are distinct, the edge coloring c is called an adjacent strong edge coloring of G. Let ci be the number of edges colored by i. If [ci - cj] ≤1 for any two colors i and j, then c is an equitable edge coloring of G. The coloring c is an equitable adjacent strong edge coloring of G if it is both adjacent strong edge coloring and equitable edge coloring. The least number of colors of such a coloring c is called the equitable adjacent strong chromatic index of G. In this paper, we determine the equitable adjacent strong chromatic index of the joins of paths and cycles. Precisely, we show that the equitable adjacent strong chromatic index of the joins of paths and cycles is equal to the maximum degree plus one or two.
