A t-tone coloring of a graph assigns t distinct colors to each vertex with vertices at distance d having fewer than d colors in common.The t-tone chromatic number of a graph is the smallest number of colors used in al...A t-tone coloring of a graph assigns t distinct colors to each vertex with vertices at distance d having fewer than d colors in common.The t-tone chromatic number of a graph is the smallest number of colors used in all t-tone colorings of that graph.In this article,we study t-tone coloring of some finite planar lattices and obtain exact formulas for their t-tone chromatic number.展开更多
Fig(Ficus carica L.)with purple-red peel cultivars are popular among consumers and exhibit better storability.While DNA methylation influences fruit ripening and color development,its specific role in fig fruit remain...Fig(Ficus carica L.)with purple-red peel cultivars are popular among consumers and exhibit better storability.While DNA methylation influences fruit ripening and color development,its specific role in fig fruit remains unclear.This study explores the impact of DNA methylation on the fig peel coloration.Enzymatic colorimetric detection revealed that the level of‘Purple Peel’fig DNA methylation decreases with fig fruit ripening and coloring.Treatment of young fruit with the DNA-methylation inhibitor azacytidine induced peel coloration,suggesting that a decrease in DNA-methylation level promotes fig peel coloration.Seven members of DNA methyltransferases and three members of DNA demethylases were identified from a high-level fig genome,highlighting FcMET1 and FcDRM2 as stable proteins,ensuring functional expression.Reference to the Arabidopsis protein interaction network map predicted that FcMET1 is in a central position,suggesting a crucial regulatory role in multiple biological processes.Correlation analysis revealed a positive correlation between FcMET1 expression during peel development and the level of total DNA methylation.Weighted gene co-expression network analysis identified co-expression of FcMET1 with the color-related transcription factors MYB,bHLH and WD40,as well as with eight structural genes in the flavonoid-biosynthesis pathway.The expression of FcUFGT3 was negatively correlated with that of FcMET1.McrBC-PCR and Bisulfite Sequencing detection showed that a low methylation level of the FcUFGT3 promoter corresponds with its high expression in colored fig.This investigation of the mechanism of DNA methylation provides a theoretical basis for understanding the role of DNA-methylation modifications in fig ripening and coloring.展开更多
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.展开更多
Anthocyanin-rich foliage plants hold important applications in the pharmaceutical industry and the tea sector,beyond their significant ornamental value.These plants also possess biological and ecological importance,co...Anthocyanin-rich foliage plants hold important applications in the pharmaceutical industry and the tea sector,beyond their significant ornamental value.These plants also possess biological and ecological importance,contributing to reproduction,defense against natural enemies,and adaptation to environmental changes.Thus,a deeper understanding of their leaf coloration will be essential for both practical applications and theoretical understanding.The present study comprehensively reviews the factors influencing anthocyanin metabolism,including biosynthesis,transport,degradation,transcription factors(TF_(S)),post-transcriptional regulation,post translation regulation.Next,we summarize the application of omics technologies in unveiling the mechanisms of anthocyanin synthesis in leaves.Furthermore,we review the molecular mechanisms by which environmental factors regulate leaf coloration by inducing anthocyanin biosynthesis.Lastly,the study addresses unresolved issues in the research of plant leaf coloration and proposes future research directions in this field.This study is anticipated to provide a valuable reference for the study of plant leaf coloration.展开更多
Color filters are essential components for optical modulation.However,conventional filters are restricted to operating exclusively in either reflective or transmissive mode.Furthermore,they suffer from limited UV and ...Color filters are essential components for optical modulation.However,conventional filters are restricted to operating exclusively in either reflective or transmissive mode.Furthermore,they suffer from limited UV and thermal stability,low color purity,and exhibit identical coloration on both surfaces.Herein,we propose a novel design strategy for trans-reflective color filters by integrating the absorptive properties of dye-doped polysulfone(PSU)with the diffractive capabilities of photonic crystals.This composite filter achieved broad-spectrum transmission with deep color outputs—yellow(0.410,0.510),magenta(0.446,0.231),and cyan(0.201,0.425)—closely aligned with standard color space coordinates.By tuning the refractive index of CeO_(2)@SiO_(2)nanoparticles to match dye-based PSU matrix,the transmittance of filters exceeded 70%.Moreover,dye-mediated absorption reduces the scattering light,thereby enhancing reflection color purity(full width at half maxima(FWHM)=25 nm)and producing vibrant blue,green,and red hues.The incorporation of UV-absorbing CeO_(2)@SiO_(2)nanoparticles effectively mitigated dye photodegradation,yielding exceptional UV stability(ΔT<2%under prolonged UV exposure).The filters also exhibited outstanding thermal stability(ΔT<1%after 30 min heat treatment at 230°C).This work establishes a robust materials design framework for multifunctional optical filters,advancing the development of highfidelity dual-mode color systems for next-generation display technologies.展开更多
Flexible and wearable sensors offer immense potential for rehabilitation medicine,but most rely solely on electrical signals,lacking real-time visual feedback and limiting trainee's interactivity.Inspired by the s...Flexible and wearable sensors offer immense potential for rehabilitation medicine,but most rely solely on electrical signals,lacking real-time visual feedback and limiting trainee's interactivity.Inspired by the structural coloration of Cyanocitta stelleri feathers,we developed a dual-mode sensor by utilizing black conductive polymer hydrogel(CPH)-enhanced structural color strategy.This sensor integrates a hydroxypropyl cellulose(HPC)-based structural color interface with a designed CPH sensing component.Highly visible light-absorbing CPH(absorption rate>88%)serves as the critical substrate for enhancing structural color performance.By absorbing incoherent scattered light and suppressing background interference,it significantly enhances the saturation of structural color,thereby achieving a high contrast index of 4.92.Unlike the faint and hardly visible structural colors on non-black substrates,the HPC on CPH displays vivid,highly perceptible colors and desirable mechanochromic behavior.Moreover,the CPH acts as a flexible sensing element,fortified by hydrogen and coordination bond networks,and exhibits exceptional electromechanical properties,including 867.1 kPa tensile strength,strain sensitivity(gauge factor of 4.24),and outstanding durability(over 4400 cycles).Compared to traditional single-mode sensors,the integrated sensor provides real-time visual and digital dual feedback,enhancing the accuracy and interactivity of rehabilitation assessments.This technology holds promise for advancing next-generation rehabilitation medicine.展开更多
Osmanthus fragrans is most famous for its strong aroma,and different varieties have different degrees of fragrance and color.Fragrance and color are important factors affecting the ornamental quality of O.fragrans.Ter...Osmanthus fragrans is most famous for its strong aroma,and different varieties have different degrees of fragrance and color.Fragrance and color are important factors affecting the ornamental quality of O.fragrans.Terpenoids are important secondary metabolites in plants,with β-carotene(C40)being the major pigment substance and linalool(C10)being the key aromatic component in O.fragrans.The geranylgeranyl pyrophosphate synthase genes(GGPPSs)play important roles in secondary metabolism in plants.However,the functions of the GGPPS family in floral color and fragrance formation has rarely been reported in O.fragrans.In this study,24 Of GGPPS genes were identified and classified into two subfamilies.The Of GGPPSs showed tissue-specific expression and Of GGPPS13 had highest expression in flowers.The Of GGPPS13 protein was localized to chloroplasts.The transcriptome data of Of GGPPS13 was verified by q RT-PCR and the expression level in‘Wanyingui'with strong aroma was higher than that in‘Zhuangyuanhong'with deep color at different flower development stages.Transient overexpression of Of GGPPS13 in O.fragrans petals showed that Of GGPPS13 increased the β-carotene content,the main color substance of O.fragrans,but decreased the linalool content,the main volatile organic compound(VOC)in the floral aroma of O.fragrans.Of GGPPS13 was indicated as the critical gene related to terpenoid synthesis in the floral aroma and color formation in O.fragrans.Our findings provide gene resources on the GGPPS gene family for further revealing the molecular regulation mechanism of the floral color and aroma formation in O.fragrans.展开更多
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.展开更多
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 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.展开更多
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.展开更多
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.展开更多
基金Supported by the National Natural Science Foundation of China(Grant No.12271210)the Scientific Research Foundation of Jimei University(Grant No.Q202201).
文摘A t-tone coloring of a graph assigns t distinct colors to each vertex with vertices at distance d having fewer than d colors in common.The t-tone chromatic number of a graph is the smallest number of colors used in all t-tone colorings of that graph.In this article,we study t-tone coloring of some finite planar lattices and obtain exact formulas for their t-tone chromatic number.
基金supported by 111 Project(Grant No.B17043)China Postdoctoral Science Foundation(Grant No.2022M723425).
文摘Fig(Ficus carica L.)with purple-red peel cultivars are popular among consumers and exhibit better storability.While DNA methylation influences fruit ripening and color development,its specific role in fig fruit remains unclear.This study explores the impact of DNA methylation on the fig peel coloration.Enzymatic colorimetric detection revealed that the level of‘Purple Peel’fig DNA methylation decreases with fig fruit ripening and coloring.Treatment of young fruit with the DNA-methylation inhibitor azacytidine induced peel coloration,suggesting that a decrease in DNA-methylation level promotes fig peel coloration.Seven members of DNA methyltransferases and three members of DNA demethylases were identified from a high-level fig genome,highlighting FcMET1 and FcDRM2 as stable proteins,ensuring functional expression.Reference to the Arabidopsis protein interaction network map predicted that FcMET1 is in a central position,suggesting a crucial regulatory role in multiple biological processes.Correlation analysis revealed a positive correlation between FcMET1 expression during peel development and the level of total DNA methylation.Weighted gene co-expression network analysis identified co-expression of FcMET1 with the color-related transcription factors MYB,bHLH and WD40,as well as with eight structural genes in the flavonoid-biosynthesis pathway.The expression of FcUFGT3 was negatively correlated with that of FcMET1.McrBC-PCR and Bisulfite Sequencing detection showed that a low methylation level of the FcUFGT3 promoter corresponds with its high expression in colored fig.This investigation of the mechanism of DNA methylation provides a theoretical basis for understanding the role of DNA-methylation modifications in fig ripening and coloring.
基金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 Central Finance for the Forestry Science and Technology Promotion Demonstration Project([2024]TG13)the National Science Foundation of China(Grant No.32201643)the Key research projects of Yibin,Research and Integrated Demonstration and Key Technologies for Smart Bamboo Industry(Grant No.YBZD2024-1).
文摘Anthocyanin-rich foliage plants hold important applications in the pharmaceutical industry and the tea sector,beyond their significant ornamental value.These plants also possess biological and ecological importance,contributing to reproduction,defense against natural enemies,and adaptation to environmental changes.Thus,a deeper understanding of their leaf coloration will be essential for both practical applications and theoretical understanding.The present study comprehensively reviews the factors influencing anthocyanin metabolism,including biosynthesis,transport,degradation,transcription factors(TF_(S)),post-transcriptional regulation,post translation regulation.Next,we summarize the application of omics technologies in unveiling the mechanisms of anthocyanin synthesis in leaves.Furthermore,we review the molecular mechanisms by which environmental factors regulate leaf coloration by inducing anthocyanin biosynthesis.Lastly,the study addresses unresolved issues in the research of plant leaf coloration and proposes future research directions in this field.This study is anticipated to provide a valuable reference for the study of plant leaf coloration.
基金supported by the Program of the National Natural Science Foundation of China(22238002)the Fundamental Research Funds for the Central Universities(DUT22-LAB610)Research and Innovation Team Project of Dalian University of Technology(DUT2022TB10).
文摘Color filters are essential components for optical modulation.However,conventional filters are restricted to operating exclusively in either reflective or transmissive mode.Furthermore,they suffer from limited UV and thermal stability,low color purity,and exhibit identical coloration on both surfaces.Herein,we propose a novel design strategy for trans-reflective color filters by integrating the absorptive properties of dye-doped polysulfone(PSU)with the diffractive capabilities of photonic crystals.This composite filter achieved broad-spectrum transmission with deep color outputs—yellow(0.410,0.510),magenta(0.446,0.231),and cyan(0.201,0.425)—closely aligned with standard color space coordinates.By tuning the refractive index of CeO_(2)@SiO_(2)nanoparticles to match dye-based PSU matrix,the transmittance of filters exceeded 70%.Moreover,dye-mediated absorption reduces the scattering light,thereby enhancing reflection color purity(full width at half maxima(FWHM)=25 nm)and producing vibrant blue,green,and red hues.The incorporation of UV-absorbing CeO_(2)@SiO_(2)nanoparticles effectively mitigated dye photodegradation,yielding exceptional UV stability(ΔT<2%under prolonged UV exposure).The filters also exhibited outstanding thermal stability(ΔT<1%after 30 min heat treatment at 230°C).This work establishes a robust materials design framework for multifunctional optical filters,advancing the development of highfidelity dual-mode color systems for next-generation display technologies.
基金supported by the Science and Technology Development Fund,Macao SAR(0065/2023/AFJ,0116/2022/A3)the National Natural Science Foundation of China(52402166)+4 种基金the Natural Science Foundation of Guangdong Province(2025A1515011120)the Australian Research Council(DE220100154)the financial support from the Science and Technology Development Fund(FDCT),Macao SAR(No.0149/2022/A),and(No.0046/2024/AFJ)Guangdong Science and Technology Department(2023QN10C305)for this workthe financial support from the National Natural Science Foundation of China(Grant No.22305185)。
文摘Flexible and wearable sensors offer immense potential for rehabilitation medicine,but most rely solely on electrical signals,lacking real-time visual feedback and limiting trainee's interactivity.Inspired by the structural coloration of Cyanocitta stelleri feathers,we developed a dual-mode sensor by utilizing black conductive polymer hydrogel(CPH)-enhanced structural color strategy.This sensor integrates a hydroxypropyl cellulose(HPC)-based structural color interface with a designed CPH sensing component.Highly visible light-absorbing CPH(absorption rate>88%)serves as the critical substrate for enhancing structural color performance.By absorbing incoherent scattered light and suppressing background interference,it significantly enhances the saturation of structural color,thereby achieving a high contrast index of 4.92.Unlike the faint and hardly visible structural colors on non-black substrates,the HPC on CPH displays vivid,highly perceptible colors and desirable mechanochromic behavior.Moreover,the CPH acts as a flexible sensing element,fortified by hydrogen and coordination bond networks,and exhibits exceptional electromechanical properties,including 867.1 kPa tensile strength,strain sensitivity(gauge factor of 4.24),and outstanding durability(over 4400 cycles).Compared to traditional single-mode sensors,the integrated sensor provides real-time visual and digital dual feedback,enhancing the accuracy and interactivity of rehabilitation assessments.This technology holds promise for advancing next-generation rehabilitation medicine.
基金funded by the National Natural Science Foundation of China(32071828 and 32471943)the Central Finance Forestry Science and Technology Promotion Demonstration Project,China(Su2024TG04)+1 种基金the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD),Chinapartly supported by the open funds of the National Key Laboratory for Germplasm Innovation&Utilization of Horticultural Crops,China。
文摘Osmanthus fragrans is most famous for its strong aroma,and different varieties have different degrees of fragrance and color.Fragrance and color are important factors affecting the ornamental quality of O.fragrans.Terpenoids are important secondary metabolites in plants,with β-carotene(C40)being the major pigment substance and linalool(C10)being the key aromatic component in O.fragrans.The geranylgeranyl pyrophosphate synthase genes(GGPPSs)play important roles in secondary metabolism in plants.However,the functions of the GGPPS family in floral color and fragrance formation has rarely been reported in O.fragrans.In this study,24 Of GGPPS genes were identified and classified into two subfamilies.The Of GGPPSs showed tissue-specific expression and Of GGPPS13 had highest expression in flowers.The Of GGPPS13 protein was localized to chloroplasts.The transcriptome data of Of GGPPS13 was verified by q RT-PCR and the expression level in‘Wanyingui'with strong aroma was higher than that in‘Zhuangyuanhong'with deep color at different flower development stages.Transient overexpression of Of GGPPS13 in O.fragrans petals showed that Of GGPPS13 increased the β-carotene content,the main color substance of O.fragrans,but decreased the linalool content,the main volatile organic compound(VOC)in the floral aroma of O.fragrans.Of GGPPS13 was indicated as the critical gene related to terpenoid synthesis in the floral aroma and color formation in O.fragrans.Our findings provide gene resources on the GGPPS gene family for further revealing the molecular regulation mechanism of the floral color and aroma formation in O.fragrans.
基金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.
文摘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.
基金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.
基金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.
基金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.
