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 ...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 VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.展开更多
Let G be a simple graph with no isolated edge. An/-total coloring of a graphG is a mapping Ф ： V（G） U E（G） → （1, 2,…… , k） such that no adjacent vertices receive thesame color and no adjacent edges receive ...Let G be a simple graph with no isolated edge. An/-total coloring of a graphG is a mapping Ф ： V（G） U E（G） → （1, 2,…… , k） such that no adjacent vertices receive thesame color and no adjacent edges receive the same color. An/-total coloring of a graph G issaid to be adjacent vertex distinguishing if for any pair of adjacent vertices u and v of G, wehave CФ（u） ≠ CФ（v）, where CФ（u） denotes the set of colors of u and its incident edges. Theminimum number of colors required for an adjacent vertex distinguishing I-total coloring of GG is called the adjacent vertex distinguishing I-total chromatic number, denoted by Xat（G）.In this paper, we characterize the adjacent vertex distinguishing I-total chromatic numberof outerplanar graphs.展开更多
Multiple BAC-FISH is a powerful tool for modern cytogenetic researching in both animals and plants.But in cotton,this technique is unavailable due to the high percentage of repetitive sequences.
Q-methodology was introduced more than 80 years ago to study subjective topics such as attitudes, perceptions, preferences, and feelings and there has not been much change in its statistical components since then. In ...Q-methodology was introduced more than 80 years ago to study subjective topics such as attitudes, perceptions, preferences, and feelings and there has not been much change in its statistical components since then. In Q-methodology, subjective topics are studied using a combination of qualitative and quantitative techniques. It involves development of a sample of statements and rank-ordering these statements by study participants using a grid known as Q-sort table. After completion of Q-sort tables by the participants, a by-person factor analysis (i.e., the factor analysis is performed on persons, not variables or traits) is used to analyze the data. Therefore, each factor represents a group of individuals with similar views, feelings, or preferences about the topic of the study. Then, each group (factor) is usually described by a set of statements, called distinguishing statements, or statements with high or low factor scores. In this article, we review one important statistical issue, i.e. the criteria for identifying distinguishing statements and provide a review of its mathematical calculation and statistical background. We show that the current approach for identifying distinguishing statements has no sound basis, which may result in erroneous findings and seems to be appropriate only when there are repeated evaluations of Q-sample from the same subjects. However, most Q-studies include independent subjects with no repeated evaluation. Finally, a new approach is suggested for identifying distinguishing statements based on Cohen’s effect size. We demonstrate the application of this new formula by applying the current and the suggested methods on a Q-dataset and explain the differences.展开更多
A proper <em>k</em>-edge coloring of a graph <em>G</em> = (<em>V</em>(<em>G</em>), <em>E</em>(<em>G</em>)) is an assignment <em>c</em>...A proper <em>k</em>-edge coloring of a graph <em>G</em> = (<em>V</em>(<em>G</em>), <em>E</em>(<em>G</em>)) is an assignment <em>c</em>: <em>E</em>(<em>G</em>) → {1, 2, …, <em>k</em>} such that no two adjacent edges receive the same color. A neighbor sum distinguishing <em>k</em>-edge coloring of <em>G</em> is a proper <em>k</em>-edge coloring of <em>G</em> such that <img src="Edit_28f0a24c-7d3f-4bdc-b58c-46dfa2add4b4.bmp" alt="" /> for each edge <em>uv</em> ∈ <em>E</em>(<em>G</em>). The neighbor sum distinguishing index of a graph <em>G</em> is the least integer <em>k</em> such that <em>G </em>has such a coloring, denoted by <em>χ’</em><sub>Σ</sub>(<em>G</em>). Let <img src="Edit_7525056f-b99d-4e38-b940-618d16c061e2.bmp" alt="" /> be the maximum average degree of <em>G</em>. In this paper, we prove <em>χ</em>’<sub>Σ</sub>(<em>G</em>) ≤ max{9, Δ(<em>G</em>) +1} for any normal graph <em>G</em> with <img src="Edit_e28e38d5-9b6d-46da-bfce-2aae47cc36f3.bmp" alt="" />. Our approach is based on the discharging method and Combinatorial Nullstellensatz.展开更多
This research aims to investigate the writing proficiency of Hong Kong pre-service ESL teachers,in particular how their writing proficiency differs as characterized by distinguishing features inherent in such teachers...This research aims to investigate the writing proficiency of Hong Kong pre-service ESL teachers,in particular how their writing proficiency differs as characterized by distinguishing features inherent in such teachers' writing performances. Over 120 pre-service ESL teachers from various programmes in local universities in Hong Kong were recruited for the study. Results showed that the higher their writing level,the better they performed in a set task as well as in grammatical range and accuracy. The different programmes they enrolled in could affect the number of cohesive devices they tended to use. Mode and years of study had an effect on task achievement and number of cohesive device. Pre-service teachers enrolled in the teacher training programmes on a part-time basis outperformed those enrolled on a full-time basis. Teachers with more teacher training outperformed newly admitted pre-service teachers.The results of this study could provide empirical evidence for identifying different levels of writing proficiency for Hong Kong pre-service ESL teachers. On this basis,the link between the writing proficiency of pre-service ESL teachers and their assessment of student scripts could be subsequently established in a follow-up study to explore their differences in scoring focuses and strategies when scoring students' writings. This could further contribute to teacher evaluation,teacher training concerning language proficiency,and the improvement of teachers' assessment literacy in high-stakes and L2 classroom writing assessment.展开更多
A neighbor sum distinguishing(NSD)total coloringφof G is a proper total coloring of G such thatΣz∈EG(u)U{u}φ(z)≠Σz∈EG(v)U{v}φ(z)for each edge uv∈E(G),where EG(u)is the set of edges incident with a vertex u.In...A neighbor sum distinguishing(NSD)total coloringφof G is a proper total coloring of G such thatΣz∈EG(u)U{u}φ(z)≠Σz∈EG(v)U{v}φ(z)for each edge uv∈E(G),where EG(u)is the set of edges incident with a vertex u.In 2015,Pilśniak and Wozniak conjectured that every graph with maximum degreeΔhas an NSD total(Δ+3)-coloring.Recently,Yang et al.proved that the conjecture holds for planar graphs withΔ≥10,and Qu et al.proved that the list version of the conjecture also holds for planar graphs withΔ≥13.In this paper,we improve their results and prove that the list version of the conjecture holds for planar graphs withΔ≥10.展开更多
Let G =(V,E) be a graph and φ:V∪E→ {1,2,…,k} be a total-k-coloring of G.Let f(v)(S(v))denote the sum(set) of the color of vertex v and the colors of the edges incident with v.The total coloring φis called neighbo...Let G =(V,E) be a graph and φ:V∪E→ {1,2,…,k} be a total-k-coloring of G.Let f(v)(S(v))denote the sum(set) of the color of vertex v and the colors of the edges incident with v.The total coloring φis called neighbor sum distinguishing if(f(u)≠f(v)) for each edge uv ∈ E(G).We say that φ is neighbor set distinguishing or adjacent vertex distinguishing if S(u)≠ S(v) for each edge uv ∈ E(G).For both problems,we have conjectures that such colorings exist for any graph G if k ≥△(G) + 3.The maximum average degree of G is the maximum of the average degree of its non-empty subgraphs,which is denoted by mad(G).In this paper,by using the Combinatorial Nullstellensatz and the discharging method,we prove that these two conjectures hold for sparse graphs in their list versions.More precisely,we prove that every graph G with maximum degree △(G) and maximum average degree mad(G) has ch_Σ "(G) ≤△(G) + 3(where ch_Σ"(G) is the neighbor sum distinguishing total choice number of G) if there exists a pair(k,m) ∈ {(6,4),(5,18/5),(4,16/5)}such that △(G) ≥ k and mad(G) < m.neighbor sum distinguishing total choice number of G) if there exists a pair(k,m) ∈ {(6,4),(5,18/5),(4,16/5)}such that △(G)≥k and mad(G) < m.展开更多
An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors.We obtain the adjacent vertex distinguishing incidence ...An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors.We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of a path and a path,a path and a wheel,a path and a fan,and a path and a star.展开更多
Pilsniak and Wozniak put forward the concept of neighbor sum distinguishing(NSD)total coloring and conjectured that any graph with maximum degreeΔadmits an NSD total(Δ+3)-coloring in 2015.In 2016,Qu et al.showed tha...Pilsniak and Wozniak put forward the concept of neighbor sum distinguishing(NSD)total coloring and conjectured that any graph with maximum degreeΔadmits an NSD total(Δ+3)-coloring in 2015.In 2016,Qu et al.showed that the list version of the conjecture holds for any planar graph withΔ≥13.In this paper,we prove that any planar graph withΔ≥7 but without 6-cycles satisfies the list version of the conjecture.展开更多
There are three distinct genetic systems in higher plants,the dominant nuclear genome and the semi-autonomous organelle genomes(plastids and mitochondria).In contrast to the conserved plastid genome(plastome),the plan...There are three distinct genetic systems in higher plants,the dominant nuclear genome and the semi-autonomous organelle genomes(plastids and mitochondria).In contrast to the conserved plastid genome(plastome),the plant mitochondrial genome(mitogenome)is characterized by an intriguing“evolutionary paradox”distinguished by a remarkably low mutation rate but with a significantly high rearrangement rate(Palmer and Herbon,1988;Lai et al.,2022).展开更多
The Grain-v1 stream cipher has been selected in the eSTREAM hardware finalists. In this paper, the authors derive a new distinguishing attack on Grain-v1 with 111 initialization rounds in a single-key setting. To achi...The Grain-v1 stream cipher has been selected in the eSTREAM hardware finalists. In this paper, the authors derive a new distinguishing attack on Grain-v1 with 111 initialization rounds in a single-key setting. To achieve this goal, the authors present two delicate strategies targeting an obvious distinguishing probability of the output difference of reduced Grain-v1. The authors show that conditional differential cryptanalysis of reduced Grain-v1 with 111 initialization rounds could mount a distinguishing attack with success probability about 0.8281 for all secret keys. It is also shown that when the attacking round further increases to 112 and 113, the distributions of the output differences are nearly random. Thus far, to the best of the authors' knowledge, the attack on Grain-v1 with 111 initialization rounds is the best single-key cryptanalytic result for reduced versions of Grain-vl in terms of the number of attacking rounds.展开更多
A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishin...A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishing if∑_c(u)≠∑_c(v)for each edge uv∈E(G),where∑_c(v)denote the sum of the color of a vertex v and the colors of edges incident with v.The least number k needed for such a total coloring of G,denoted byχ∑"is the neighbor sum distinguishing total chromatic number.Pilsniak and Wozniak conjecturedχ∑"(G)≤Δ(G)+3 for any simple graph with maximum degreeΔ(G).By using the famous Combinatorial Nullstellensatz,we prove that above conjecture holds for any triangle free IC-planar graph with△(G)≥7.Moreover,it holds for any triangle free planar graph withΔ(G)≥6.展开更多
A proper k-edge coloring of a graph G is an assignment of one of k colors to each edge of G such that there are no two edges with the same color incident to a common vertex.Let f(v)denote the sum of colors of the edge...A proper k-edge coloring of a graph G is an assignment of one of k colors to each edge of G such that there are no two edges with the same color incident to a common vertex.Let f(v)denote the sum of colors of the edges incident to v.A k-neighbor sum distinguishing edge coloring of G is a proper k-edge coloring of G such that for each edge uv∈E(G),f(u)≠f(v).Byχ’_∑(G),we denote the smallest value k in such a coloring of G.Let mad(G)denote the maximum average degree of a graph G.In this paper,we prove that every normal graph with mad(G)<10/3 andΔ(G)≥8 admits a(Δ(G)+2)-neighbor sum distinguishing edge coloring.Our approach is based on the Combinatorial Nullstellensatz and discharging method.展开更多
With the support by the National Natural Science Foundation of China,the National Basic Research Program of China,and the Chinese Academy of Sciences,the research group led by Liu Qian(刘倩)and Jiang GuiBin(江桂斌)at ...With the support by the National Natural Science Foundation of China,the National Basic Research Program of China,and the Chinese Academy of Sciences,the research group led by Liu Qian(刘倩)and Jiang GuiBin(江桂斌)at the State Key Laboratory of Environmental Chemistry and Ecotoxicology,Research Center for Eco-Environmental Sciences,Chinese Academy of Sciences,has recently achieved important progress in the stable isotopic tracing of silica nanoparticles,which was published in Nature Communications(2019,10:1620).展开更多
Quantum key distribution provides an unconditional secure key sharing method in theory,but the imperfect factors of practical devices will bring security vulnerabilities.In this paper,we characterize the imperfections...Quantum key distribution provides an unconditional secure key sharing method in theory,but the imperfect factors of practical devices will bring security vulnerabilities.In this paper,we characterize the imperfections of the sender and analyze the possible attack strategies of Eve.Firstly,we present a quantized model for distinguishability of decoy states caused by intensity modulation.Besides,considering that Eve may control the preparation of states through hidden variables,we evaluate the security of preparation in practical quantum key distribution(QKD)scheme based on the weak-randomness model.Finally,we analyze the influence of the distinguishability of decoy state to secure key rate,for Eve may conduct the beam splitting attack and control the channel attenuation of different parts.Through the simulation,it can be seen that the secure key rate is sensitive to the distinguishability of decoy state and weak randomness,especially when Eve can control the channel attenuation.展开更多
Currently,it is difficult to extract the depth feature of the frontal emergency stops dangerous activity signal,which leads to a decline in the accuracy and efficiency of the frontal emergency stops the dangerous acti...Currently,it is difficult to extract the depth feature of the frontal emergency stops dangerous activity signal,which leads to a decline in the accuracy and efficiency of the frontal emergency stops the dangerous activ-ity.Therefore,a recognition for frontal emergency stops dangerous activity algorithm based on Nano Internet of Things Sensor(NIoTS)and transfer learning is proposed.First,the NIoTS is installed in the athlete’s leg muscles to collect activity signals.Second,the noise component in the activity signal is removed using the de-noising method based on mathematical morphology.Finally,the depth feature of the activity signal is extracted through the deep transfer learning model,and the Euclidean distance between the extracted feature and the depth feature of the frontal emergency stops dangerous activity signal is compared.If the European distance is small,it can be judged as the frontal emergency stops dangerous activity,and the frontal emergency stops dangerous activity recognition is realized.The results show that the average time delay of activity signal acquisition of the algorithm is low,the signal-to-noise ratio of the action signal is high,and the activity signal mean square error is low.The variance of the frontal emergency stops dangerous activity recognition does not exceed 0.5.The difference between the appearance time of the dangerous activity and the recognition time of the algorithm is 0.15 s,it can accurately and quickly recognize the frontal emergency stops the dangerous activity.展开更多
By analyzing the NCEP 1°×1° reanalysis (2004–2008), a number of predictors (factors of variables) are established with the output from the GRAPES model and with reference to the sea fog data from obser...By analyzing the NCEP 1°×1° reanalysis (2004–2008), a number of predictors (factors of variables) are established with the output from the GRAPES model and with reference to the sea fog data from observational stations (2004–2008) and field observations (2006–2008). Based on the criteria and conditions for sea fog appearance at the stations of Zhanjiang, Zhuhai and Shantou, a Model Output Statistics (MOS) scheme for distinguishing and forecasting 24-h sea fog is established and put into use for three representative coastal areas of Guangdong. As shown in an assessment of the forecasts for Zhanjiang and Shantou (March of 2008) and Zhuhai (April of 2008), the scheme was quite capable of forecasting sea fog on the coast of the province, with the accuracy ranging from 84% to 90%, the threat score from 0.40 to 0.50 and the Heidke skill from 0.52 to 0.56.展开更多
文摘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 VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.
基金Supported by the National Natural Science Foundation of China(61163037,61163054,61363060)
文摘Let G be a simple graph with no isolated edge. An/-total coloring of a graphG is a mapping Ф ： V（G） U E（G） → （1, 2,…… , k） such that no adjacent vertices receive thesame color and no adjacent edges receive the same color. An/-total coloring of a graph G issaid to be adjacent vertex distinguishing if for any pair of adjacent vertices u and v of G, wehave CФ（u） ≠ CФ（v）, where CФ（u） denotes the set of colors of u and its incident edges. Theminimum number of colors required for an adjacent vertex distinguishing I-total coloring of GG is called the adjacent vertex distinguishing I-total chromatic number, denoted by Xat（G）.In this paper, we characterize the adjacent vertex distinguishing I-total chromatic numberof outerplanar graphs.
文摘Multiple BAC-FISH is a powerful tool for modern cytogenetic researching in both animals and plants.But in cotton,this technique is unavailable due to the high percentage of repetitive sequences.
文摘Q-methodology was introduced more than 80 years ago to study subjective topics such as attitudes, perceptions, preferences, and feelings and there has not been much change in its statistical components since then. In Q-methodology, subjective topics are studied using a combination of qualitative and quantitative techniques. It involves development of a sample of statements and rank-ordering these statements by study participants using a grid known as Q-sort table. After completion of Q-sort tables by the participants, a by-person factor analysis (i.e., the factor analysis is performed on persons, not variables or traits) is used to analyze the data. Therefore, each factor represents a group of individuals with similar views, feelings, or preferences about the topic of the study. Then, each group (factor) is usually described by a set of statements, called distinguishing statements, or statements with high or low factor scores. In this article, we review one important statistical issue, i.e. the criteria for identifying distinguishing statements and provide a review of its mathematical calculation and statistical background. We show that the current approach for identifying distinguishing statements has no sound basis, which may result in erroneous findings and seems to be appropriate only when there are repeated evaluations of Q-sample from the same subjects. However, most Q-studies include independent subjects with no repeated evaluation. Finally, a new approach is suggested for identifying distinguishing statements based on Cohen’s effect size. We demonstrate the application of this new formula by applying the current and the suggested methods on a Q-dataset and explain the differences.
文摘A proper <em>k</em>-edge coloring of a graph <em>G</em> = (<em>V</em>(<em>G</em>), <em>E</em>(<em>G</em>)) is an assignment <em>c</em>: <em>E</em>(<em>G</em>) → {1, 2, …, <em>k</em>} such that no two adjacent edges receive the same color. A neighbor sum distinguishing <em>k</em>-edge coloring of <em>G</em> is a proper <em>k</em>-edge coloring of <em>G</em> such that <img src="Edit_28f0a24c-7d3f-4bdc-b58c-46dfa2add4b4.bmp" alt="" /> for each edge <em>uv</em> ∈ <em>E</em>(<em>G</em>). The neighbor sum distinguishing index of a graph <em>G</em> is the least integer <em>k</em> such that <em>G </em>has such a coloring, denoted by <em>χ’</em><sub>Σ</sub>(<em>G</em>). Let <img src="Edit_7525056f-b99d-4e38-b940-618d16c061e2.bmp" alt="" /> be the maximum average degree of <em>G</em>. In this paper, we prove <em>χ</em>’<sub>Σ</sub>(<em>G</em>) ≤ max{9, Δ(<em>G</em>) +1} for any normal graph <em>G</em> with <img src="Edit_e28e38d5-9b6d-46da-bfce-2aae47cc36f3.bmp" alt="" />. Our approach is based on the discharging method and Combinatorial Nullstellensatz.
基金the Hong Kong Research Grants Council for funding this research project.Grant Number:449412
文摘This research aims to investigate the writing proficiency of Hong Kong pre-service ESL teachers,in particular how their writing proficiency differs as characterized by distinguishing features inherent in such teachers' writing performances. Over 120 pre-service ESL teachers from various programmes in local universities in Hong Kong were recruited for the study. Results showed that the higher their writing level,the better they performed in a set task as well as in grammatical range and accuracy. The different programmes they enrolled in could affect the number of cohesive devices they tended to use. Mode and years of study had an effect on task achievement and number of cohesive device. Pre-service teachers enrolled in the teacher training programmes on a part-time basis outperformed those enrolled on a full-time basis. Teachers with more teacher training outperformed newly admitted pre-service teachers.The results of this study could provide empirical evidence for identifying different levels of writing proficiency for Hong Kong pre-service ESL teachers. On this basis,the link between the writing proficiency of pre-service ESL teachers and their assessment of student scripts could be subsequently established in a follow-up study to explore their differences in scoring focuses and strategies when scoring students' writings. This could further contribute to teacher evaluation,teacher training concerning language proficiency,and the improvement of teachers' assessment literacy in high-stakes and L2 classroom writing assessment.
基金supported by the National Natural Science Foundation of China (No.12271438, No.12071370 and U1803263)the Science Found of Qinhai Province (No.2022-ZJ-753)+2 种基金Shaanxi Fundamental Science Research Project for Mathematics and Physics (No.22JSZ009)Shangluo University Doctoral Initiation Fund Project(No.22SKY112)Shangluo University Key Disciplines Project (Discipline name:Mathematics)。
文摘A neighbor sum distinguishing(NSD)total coloringφof G is a proper total coloring of G such thatΣz∈EG(u)U{u}φ(z)≠Σz∈EG(v)U{v}φ(z)for each edge uv∈E(G),where EG(u)is the set of edges incident with a vertex u.In 2015,Pilśniak and Wozniak conjectured that every graph with maximum degreeΔhas an NSD total(Δ+3)-coloring.Recently,Yang et al.proved that the conjecture holds for planar graphs withΔ≥10,and Qu et al.proved that the list version of the conjecture also holds for planar graphs withΔ≥13.In this paper,we improve their results and prove that the list version of the conjecture holds for planar graphs withΔ≥10.
基金the National Natural Science Foundation of China(11371355,11471193)Foundation for Distinguished Young Scholars of Shandong Province(JQ201501)+2 种基金the Natural Science Foundation of Shandong Province(ZR2013AM001)the Fundamental Research Funds of Shandong UniversityIndependent Innovation Foundation of Shandong University(IFYT14012)
文摘Let G =(V,E) be a graph and φ:V∪E→ {1,2,…,k} be a total-k-coloring of G.Let f(v)(S(v))denote the sum(set) of the color of vertex v and the colors of the edges incident with v.The total coloring φis called neighbor sum distinguishing if(f(u)≠f(v)) for each edge uv ∈ E(G).We say that φ is neighbor set distinguishing or adjacent vertex distinguishing if S(u)≠ S(v) for each edge uv ∈ E(G).For both problems,we have conjectures that such colorings exist for any graph G if k ≥△(G) + 3.The maximum average degree of G is the maximum of the average degree of its non-empty subgraphs,which is denoted by mad(G).In this paper,by using the Combinatorial Nullstellensatz and the discharging method,we prove that these two conjectures hold for sparse graphs in their list versions.More precisely,we prove that every graph G with maximum degree △(G) and maximum average degree mad(G) has ch_Σ "(G) ≤△(G) + 3(where ch_Σ"(G) is the neighbor sum distinguishing total choice number of G) if there exists a pair(k,m) ∈ {(6,4),(5,18/5),(4,16/5)}such that △(G) ≥ k and mad(G) < m.neighbor sum distinguishing total choice number of G) if there exists a pair(k,m) ∈ {(6,4),(5,18/5),(4,16/5)}such that △(G)≥k and mad(G) < m.
基金Supported by the State Ethnic Affairs Commission of China (Grant No. 08XB07)
文摘An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors.We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of a path and a path,a path and a wheel,a path and a fan,and a path and a star.
基金Supported by the National Natural Science Foundation of China(11471193,11631014)the Foundation for Distinguished Young Scholars of Shandong Province(JQ201501)+1 种基金the Fundamental Research Funds of Shandong UniversityIndependent Innovation Foundation of Shandong University(IFYT14012)
基金supported by the National Natural Science Foundation of China(Grant No.11571258)the National Natural Science Foundation of Shandong Province(Grant No.ZR2016AM01)Scientific Research Foundation of University of Jinan(Grant Nos.XKY1414 and XKY1613)
基金Supported by National Natural Science Foundation of China(Grant Nos.11871397,11671320 and U1803263)the Fundamental Research Funds for the Central Universities(Grant No.3102019ghjd003)+1 种基金the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2020JM-083)Shangluo University Key Disciplines Project(Discipline name Mathematics)。
文摘Pilsniak and Wozniak put forward the concept of neighbor sum distinguishing(NSD)total coloring and conjectured that any graph with maximum degreeΔadmits an NSD total(Δ+3)-coloring in 2015.In 2016,Qu et al.showed that the list version of the conjecture holds for any planar graph withΔ≥13.In this paper,we prove that any planar graph withΔ≥7 but without 6-cycles satisfies the list version of the conjecture.
基金The work is supported by the Natural Science Foundation of Jiangsu Province(BK20220414)the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province(22KJB220003).
文摘There are three distinct genetic systems in higher plants,the dominant nuclear genome and the semi-autonomous organelle genomes(plastids and mitochondria).In contrast to the conserved plastid genome(plastome),the plant mitochondrial genome(mitogenome)is characterized by an intriguing“evolutionary paradox”distinguished by a remarkably low mutation rate but with a significantly high rearrangement rate(Palmer and Herbon,1988;Lai et al.,2022).
基金supported by the National Natural Science Foundation of China under Grant Nos.61521003and 61672533the National Cryptography Development Fund of China under Grant No.MMJJ20170103
文摘The Grain-v1 stream cipher has been selected in the eSTREAM hardware finalists. In this paper, the authors derive a new distinguishing attack on Grain-v1 with 111 initialization rounds in a single-key setting. To achieve this goal, the authors present two delicate strategies targeting an obvious distinguishing probability of the output difference of reduced Grain-v1. The authors show that conditional differential cryptanalysis of reduced Grain-v1 with 111 initialization rounds could mount a distinguishing attack with success probability about 0.8281 for all secret keys. It is also shown that when the attacking round further increases to 112 and 113, the distributions of the output differences are nearly random. Thus far, to the best of the authors' knowledge, the attack on Grain-v1 with 111 initialization rounds is the best single-key cryptanalytic result for reduced versions of Grain-vl in terms of the number of attacking rounds.
基金Supported by National Natural Science Foundation of China(Grant No.11771443)the Foundation of Innovative Science and Technology for Youth in Universities of Shandong Province,China(Grant No.2019KJI001)。
文摘A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishing if∑_c(u)≠∑_c(v)for each edge uv∈E(G),where∑_c(v)denote the sum of the color of a vertex v and the colors of edges incident with v.The least number k needed for such a total coloring of G,denoted byχ∑"is the neighbor sum distinguishing total chromatic number.Pilsniak and Wozniak conjecturedχ∑"(G)≤Δ(G)+3 for any simple graph with maximum degreeΔ(G).By using the famous Combinatorial Nullstellensatz,we prove that above conjecture holds for any triangle free IC-planar graph with△(G)≥7.Moreover,it holds for any triangle free planar graph withΔ(G)≥6.
基金Supported by the Natural Science Foundation of Shandong Provence(Grant Nos.ZR2018BA010,ZR2016AM01)the National Natural Science Foundation of China(Grant No.11571258)。
文摘A proper k-edge coloring of a graph G is an assignment of one of k colors to each edge of G such that there are no two edges with the same color incident to a common vertex.Let f(v)denote the sum of colors of the edges incident to v.A k-neighbor sum distinguishing edge coloring of G is a proper k-edge coloring of G such that for each edge uv∈E(G),f(u)≠f(v).Byχ’_∑(G),we denote the smallest value k in such a coloring of G.Let mad(G)denote the maximum average degree of a graph G.In this paper,we prove that every normal graph with mad(G)<10/3 andΔ(G)≥8 admits a(Δ(G)+2)-neighbor sum distinguishing edge coloring.Our approach is based on the Combinatorial Nullstellensatz and discharging method.
文摘With the support by the National Natural Science Foundation of China,the National Basic Research Program of China,and the Chinese Academy of Sciences,the research group led by Liu Qian(刘倩)and Jiang GuiBin(江桂斌)at the State Key Laboratory of Environmental Chemistry and Ecotoxicology,Research Center for Eco-Environmental Sciences,Chinese Academy of Sciences,has recently achieved important progress in the stable isotopic tracing of silica nanoparticles,which was published in Nature Communications(2019,10:1620).
基金the National Key Research and Development Program of China(Grant No.2020YFA0309702)NSAF(Grant No.U2130205)+3 种基金the National Natural Science Foundation of China(Grant Nos.62101597,61605248,and 61505261)the China Postdoctoral Science Foundation(Grant No.2021M691536)the Natural Science Foundation of Henan(Grant Nos.202300410534 and 202300410532)the Anhui Initiative in Quantum Information Technologies。
文摘Quantum key distribution provides an unconditional secure key sharing method in theory,but the imperfect factors of practical devices will bring security vulnerabilities.In this paper,we characterize the imperfections of the sender and analyze the possible attack strategies of Eve.Firstly,we present a quantized model for distinguishability of decoy states caused by intensity modulation.Besides,considering that Eve may control the preparation of states through hidden variables,we evaluate the security of preparation in practical quantum key distribution(QKD)scheme based on the weak-randomness model.Finally,we analyze the influence of the distinguishability of decoy state to secure key rate,for Eve may conduct the beam splitting attack and control the channel attenuation of different parts.Through the simulation,it can be seen that the secure key rate is sensitive to the distinguishability of decoy state and weak randomness,especially when Eve can control the channel attenuation.
文摘Currently,it is difficult to extract the depth feature of the frontal emergency stops dangerous activity signal,which leads to a decline in the accuracy and efficiency of the frontal emergency stops the dangerous activ-ity.Therefore,a recognition for frontal emergency stops dangerous activity algorithm based on Nano Internet of Things Sensor(NIoTS)and transfer learning is proposed.First,the NIoTS is installed in the athlete’s leg muscles to collect activity signals.Second,the noise component in the activity signal is removed using the de-noising method based on mathematical morphology.Finally,the depth feature of the activity signal is extracted through the deep transfer learning model,and the Euclidean distance between the extracted feature and the depth feature of the frontal emergency stops dangerous activity signal is compared.If the European distance is small,it can be judged as the frontal emergency stops dangerous activity,and the frontal emergency stops dangerous activity recognition is realized.The results show that the average time delay of activity signal acquisition of the algorithm is low,the signal-to-noise ratio of the action signal is high,and the activity signal mean square error is low.The variance of the frontal emergency stops dangerous activity recognition does not exceed 0.5.The difference between the appearance time of the dangerous activity and the recognition time of the algorithm is 0.15 s,it can accurately and quickly recognize the frontal emergency stops the dangerous activity.
基金Natural Science Foundation of China (40675013)Research on Techniques of Specialized Forecast of Sea Fog and Visibility at the Pearl River Mouth+2 种基金project of Science and Technology Program of Guangdong Province (2006B37202005)Research on System of Monitoring Sea Fog for the Pearl River Mouthproject of Meteorological Science of Guangdong Meteorological Bureau
文摘By analyzing the NCEP 1°×1° reanalysis (2004–2008), a number of predictors (factors of variables) are established with the output from the GRAPES model and with reference to the sea fog data from observational stations (2004–2008) and field observations (2006–2008). Based on the criteria and conditions for sea fog appearance at the stations of Zhanjiang, Zhuhai and Shantou, a Model Output Statistics (MOS) scheme for distinguishing and forecasting 24-h sea fog is established and put into use for three representative coastal areas of Guangdong. As shown in an assessment of the forecasts for Zhanjiang and Shantou (March of 2008) and Zhuhai (April of 2008), the scheme was quite capable of forecasting sea fog on the coast of the province, with the accuracy ranging from 84% to 90%, the threat score from 0.40 to 0.50 and the Heidke skill from 0.52 to 0.56.
