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.展开更多
Due to the emergence of a large number of counterfeit notes and incomplete coins in the slot machine of self-service bus, to improve the automization of intelligent slot machine, based on multi-sensor testing technolo...Due to the emergence of a large number of counterfeit notes and incomplete coins in the slot machine of self-service bus, to improve the automization of intelligent slot machine, based on multi-sensor testing technology, using programming log- ic controller （PLC） as the core of the whole system, the PLC hardware design and software design are accomplished for the first time to detect the counterfeit notes and coins. The system was tested by many groups of experiments. The results show that the system has reliable recognition rate, good flexibility and stability, reaching the accuracy of 97%.展开更多
To solve the arrearage problem that puzzled most of the mobile corporations, we propose an approach to forecast and evaluate the credits for mobile clients, devising a method that is of the coalescence of genetic algo...To solve the arrearage problem that puzzled most of the mobile corporations, we propose an approach to forecast and evaluate the credits for mobile clients, devising a method that is of the coalescence of genetic algorithm and multidimensional distinguishing model. In the end of this paper, a result of a testing application in Zhuhai Branch, GMCC was provided. The precision of the forecasting and evaluation of the client’s credit is near 90%. This study is very significant to the mobile communication corporation at all levels. The popularization of the techniques and the result would produce great benefits of both society and economy.展开更多
For data of atmospheric composition missing, fog and haze days were distinguished based on the standard of meteorological industry Observation and Forecasting Levels of Haze （QX/T113-2010） and four user-defined stan...For data of atmospheric composition missing, fog and haze days were distinguished based on the standard of meteorological industry Observation and Forecasting Levels of Haze （QX/T113-2010） and four user-defined standards, and using data of surface meteorological factors in Fuzhou City, China from 2005 to 2011, temporal distributions of fog and haze days were analyzed respectively to provide methods for fog and haze forecast. The results showed that there were 28.9 fog days and 89.7 haze days per year in Fuzhou. Both fog and haze days were variable, and there might be a day difference of twice to thrice among the years. They were the most in 2007, and then decreased in recent years. Both fog and haze days were more in winter and spring, accounted for 94.1% and 70.1% respectively, while in summer and autumn, they only accounted for 5.9% and 29.9% respectively. In a day, fog mainly occurred from night to early morning, while haze occurred mainly at about noon, which demonstrated that fog and haze are different synoptic phenomena. The mass concentration of PM2.5 in fog days was 34 μg/m^3, while it was 61 μg/m^3 in haze days, and in 22% of haze days it was larger than 75 μg/m3, which was above the national second-grade ambient air quality standard.展开更多
Eosinophilic esophagitis （EE） is the most frequent con- dition found in a group of gastrointestinal disorders called eosinophilic gastrointestinal diseases. The hypo- thetical pathophysiological mechanism is related...Eosinophilic esophagitis （EE） is the most frequent con- dition found in a group of gastrointestinal disorders called eosinophilic gastrointestinal diseases. The hypo- thetical pathophysiological mechanism is related to a hypersensitivity reaction. Gastroesophageal reflux dis- ease-like complaints not ameliorated by acid blockade or occasional symptoms of dysphagia or food impac- tion are likely presentations of EE. Due to its unclear pathogenesis and unspecific symptoms, it is difficult to diagnose EE without a strong suspicion. Although histo- togical criteria are necessary to diagnosis EE, there are some characteristic endoscopic features. We present the case of a healthy 55-year-old woman with dyspha- gia and several episodes of esophageal food impaction over the last six months. This case report stresses the most distinguishing endoscopic findings-mucosa rings, white exudative plaques and linear furrows-that can help in the prompt recognition of this condition.展开更多
It has been known that determining the exact value of vertex distinguishing edge index X ＇8（G） of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete...It has been known that determining the exact value of vertex distinguishing edge index X ＇8（G） of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete, graphs, and graphs with maximum degree 2. Let rid（G） denote the number of vertices of degree d in G, and let X＇es（G） be the equitable vertex distinguishing edge index of G. We show that a tree T holds nl （T） ≤ X ＇s （T） ≤ n1 （T） ＋ 1 and X＇s（T） = X＇es（T） if T satisfies one of the following conditions （i） n2（T） ≤△（T） or （ii） there exists a constant c with respect to 0 〈 c 〈 1 such that n2（T） △ cn1（T） and ∑3 ≤d≤△（T）nd（T） ≤ （1 - c）n1（T） ＋ 1.展开更多
A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge ...A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge coloring of a graph C is denoted by Xs＇8（G）. In this paper, we obtained upper bounds on the vertex distinguishing chromatic index of 3-regular Halin graphs and Halin graphs with △（G） ≥ 4, respectively.展开更多
A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets. According to the property of trees, the adjacent vertex distinguishing total chromatic numbe...A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets. According to the property of trees, the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.展开更多
Forward Masking Temporal audiotory resolution is the ability of the auditory system to resolve auditory signals in the time domain. Forward masking is a means of studying temporal resolution where one tone, the probe,...Forward Masking Temporal audiotory resolution is the ability of the auditory system to resolve auditory signals in the time domain. Forward masking is a means of studying temporal resolution where one tone, the probe, is masked by a preceding tone, the masker. Forward masking is展开更多
Let G be a simple graph with no isolated edge. An Ⅰ-total coloring of a graph G is a mapping φ : V(G) ∪ E(G) → {1, 2, · · ·, k} such that no adjacent vertices receive the same color and no adjacent ...Let G be a simple graph with no isolated edge. An Ⅰ-total coloring of a graph G is a mapping φ : V(G) ∪ E(G) → {1, 2, · · ·, k} such that no adjacent vertices receive the same color and no adjacent edges receive the same color. An Ⅰ-total coloring of a graph G is said to be adjacent vertex distinguishing if for any pair of adjacent vertices u and v of G, we have C_φ(u) = C_φ(v), where C_φ(u) denotes the set of colors of u and its incident edges. The minimum number of colors required for an adjacent vertex distinguishing Ⅰ-total coloring of G is called the adjacent vertex distinguishing Ⅰ-total chromatic number, denoted by χ_at^i(G).In this paper, we characterize the adjacent vertex distinguishing Ⅰ-total chromatic number of 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.展开更多
The majority of off-type plants in in-dica hybrid rice were CMS and itsmaintainer lines.Discrimination ofmaintainer and CMS could only beconducted at heading stage.If main-tainer and CMS line could be distin-guished e...The majority of off-type plants in in-dica hybrid rice were CMS and itsmaintainer lines.Discrimination ofmaintainer and CMS could only beconducted at heading stage.If main-tainer and CMS line could be distin-guished earlier,it would be useful toavoid yield losses caused by usingcontaminated seeds.In this study,three pairs of A and B,Minghui 63,and Fand Fplants of Zhenshan97A/Minghui 63 were used to find展开更多
Climate change has major impacts directly on the natural ecosystem and human society, of which the cryosphere is most easily affected be-cause of its frangibility and sensitivity. Similarly, cryosphere change has nume...Climate change has major impacts directly on the natural ecosystem and human society, of which the cryosphere is most easily affected be-cause of its frangibility and sensitivity. Similarly, cryosphere change has numerous impacts on the natural ecosystem and human society, which may resemble an indirect influence of climate change. These two types of impacts, in shared fields, are distinguished in space and time by effective mechanisms and processes. Climate change has positive and negative impacts on some systems, which may be adjusted by cryosphere change. These indirect and direct impacts may be distinguished, and then correct policies and measures can be made against these changes.展开更多
It has been proven that, with a single copy provided, the four Bell states cannot be distinguished by local operations and classical communications （LOCC）. Traditionally, a Bell basis projective measurement is neede...It has been proven that, with a single copy provided, the four Bell states cannot be distinguished by local operations and classical communications （LOCC）. Traditionally, a Bell basis projective measurement is needed to distinguish the four Bell states, which is usually carried out with a local interference between two particles. This paper presents an interesting protocol that allows two remote parties to distinguish four Bell states deterministically. We prove that our protocol of distinguishing remote Bell states is beyond LOCC.展开更多
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.展开更多
A proper k-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 color set of edges incident to u is not equal to the color set of edges ...A proper k-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 color set of edges incident to u is not equal to the color set of edges incident to v, where uv ∈E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by χ＇αα（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. In this paper we prove that if G（V, E） is a graph with no isolated edges, then χ＇αα（G）≤32△.展开更多
Let G = （V, E） be a simple connected graph, and ｜V（G）｜ ≥ 2. Let f be a mapping from V（G） ∪ E（G） to {1,2…, k}. If arbitary uv ∈ E（G）,f（u） ≠ f（v）,f（u） ≠ f（uv）,f（v） ≠ f（uv）; arbitary uv, uw...Let G = （V, E） be a simple connected graph, and ｜V（G）｜ ≥ 2. Let f be a mapping from V（G） ∪ E（G） to {1,2…, k}. If arbitary uv ∈ E（G）,f（u） ≠ f（v）,f（u） ≠ f（uv）,f（v） ≠ f（uv）; arbitary uv, uw ∈ E（G）（v ≠ w）, f（uv） ≠ f（uw）;arbitary uv ∈ E（G） and u ≠ v, C（u） ≠ C（v）, whereC（u）={f（u）}∪{f（uv）｜uv∈E（G）}.Then f is called a k-adjacent-vertex-distinguishing-proper-total coloring of the graph G（k-AVDTC of G for short）. The number min{k｜k-AVDTC of G} is called the adjacent vertex-distinguishing total chromatic number and denoted by χat（G）. In this paper we prove that if △（G） is at least a particular constant and δ ≥32√△ln△, then χat（G） ≤ △（G） ＋ 10^26 ＋ 2√△ln△.展开更多
文摘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.
文摘Due to the emergence of a large number of counterfeit notes and incomplete coins in the slot machine of self-service bus, to improve the automization of intelligent slot machine, based on multi-sensor testing technology, using programming log- ic controller （PLC） as the core of the whole system, the PLC hardware design and software design are accomplished for the first time to detect the counterfeit notes and coins. The system was tested by many groups of experiments. The results show that the system has reliable recognition rate, good flexibility and stability, reaching the accuracy of 97%.
基金Guangdong Mobile Communication Company Limited Key Item(2001 and 2002)
文摘To solve the arrearage problem that puzzled most of the mobile corporations, we propose an approach to forecast and evaluate the credits for mobile clients, devising a method that is of the coalescence of genetic algorithm and multidimensional distinguishing model. In the end of this paper, a result of a testing application in Zhuhai Branch, GMCC was provided. The precision of the forecasting and evaluation of the client’s credit is near 90%. This study is very significant to the mobile communication corporation at all levels. The popularization of the techniques and the result would produce great benefits of both society and economy.
基金Supported by the Key Project of Science and Technology Department of Fujian Province,China in 2012(2012Y0009)
文摘For data of atmospheric composition missing, fog and haze days were distinguished based on the standard of meteorological industry Observation and Forecasting Levels of Haze （QX/T113-2010） and four user-defined standards, and using data of surface meteorological factors in Fuzhou City, China from 2005 to 2011, temporal distributions of fog and haze days were analyzed respectively to provide methods for fog and haze forecast. The results showed that there were 28.9 fog days and 89.7 haze days per year in Fuzhou. Both fog and haze days were variable, and there might be a day difference of twice to thrice among the years. They were the most in 2007, and then decreased in recent years. Both fog and haze days were more in winter and spring, accounted for 94.1% and 70.1% respectively, while in summer and autumn, they only accounted for 5.9% and 29.9% respectively. In a day, fog mainly occurred from night to early morning, while haze occurred mainly at about noon, which demonstrated that fog and haze are different synoptic phenomena. The mass concentration of PM2.5 in fog days was 34 μg/m^3, while it was 61 μg/m^3 in haze days, and in 22% of haze days it was larger than 75 μg/m3, which was above the national second-grade ambient air quality standard.
文摘Eosinophilic esophagitis （EE） is the most frequent con- dition found in a group of gastrointestinal disorders called eosinophilic gastrointestinal diseases. The hypo- thetical pathophysiological mechanism is related to a hypersensitivity reaction. Gastroesophageal reflux dis- ease-like complaints not ameliorated by acid blockade or occasional symptoms of dysphagia or food impac- tion are likely presentations of EE. Due to its unclear pathogenesis and unspecific symptoms, it is difficult to diagnose EE without a strong suspicion. Although histo- togical criteria are necessary to diagnosis EE, there are some characteristic endoscopic features. We present the case of a healthy 55-year-old woman with dyspha- gia and several episodes of esophageal food impaction over the last six months. This case report stresses the most distinguishing endoscopic findings-mucosa rings, white exudative plaques and linear furrows-that can help in the prompt recognition of this condition.
基金supported by the National Natural Science Foundation of China (61163054),supported by the National Natural Science Foundation of China (61163037)
文摘It has been known that determining the exact value of vertex distinguishing edge index X ＇8（G） of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete, graphs, and graphs with maximum degree 2. Let rid（G） denote the number of vertices of degree d in G, and let X＇es（G） be the equitable vertex distinguishing edge index of G. We show that a tree T holds nl （T） ≤ X ＇s （T） ≤ n1 （T） ＋ 1 and X＇s（T） = X＇es（T） if T satisfies one of the following conditions （i） n2（T） ≤△（T） or （ii） there exists a constant c with respect to 0 〈 c 〈 1 such that n2（T） △ cn1（T） and ∑3 ≤d≤△（T）nd（T） ≤ （1 - c）n1（T） ＋ 1.
基金Supported by the National Natural Science Foundation of China(10971198)the Zhejiang Natural Science Foundation of China(Z6110786)
文摘A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge coloring of a graph C is denoted by Xs＇8（G）. In this paper, we obtained upper bounds on the vertex distinguishing chromatic index of 3-regular Halin graphs and Halin graphs with △（G） ≥ 4, respectively.
基金Foundation item： Supported by Natural Science Foundation of China（60503002）
文摘A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets. According to the property of trees, the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.
文摘Forward Masking Temporal audiotory resolution is the ability of the auditory system to resolve auditory signals in the time domain. Forward masking is a means of studying temporal resolution where one tone, the probe, is masked by a preceding tone, the masker. Forward masking is
基金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 graph G is a mapping φ : V(G) ∪ E(G) → {1, 2, · · ·, k} such that no adjacent vertices receive the same color and no adjacent edges receive the same color. An Ⅰ-total coloring of a graph G is said to be adjacent vertex distinguishing if for any pair of adjacent vertices u and v of G, we have C_φ(u) = C_φ(v), where C_φ(u) denotes the set of colors of u and its incident edges. The minimum number of colors required for an adjacent vertex distinguishing Ⅰ-total coloring of G is called the adjacent vertex distinguishing Ⅰ-total chromatic number, denoted by χ_at^i(G).In this paper, we characterize the adjacent vertex distinguishing Ⅰ-total chromatic number of 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.
文摘The majority of off-type plants in in-dica hybrid rice were CMS and itsmaintainer lines.Discrimination ofmaintainer and CMS could only beconducted at heading stage.If main-tainer and CMS line could be distin-guished earlier,it would be useful toavoid yield losses caused by usingcontaminated seeds.In this study,three pairs of A and B,Minghui 63,and Fand Fplants of Zhenshan97A/Minghui 63 were used to find
基金supported by the National Basic Research Program of China (No. 2007CB411507): "Cryospheric processes in China and their climatic, hydrologic and ecologic effects and adaptation"
文摘Climate change has major impacts directly on the natural ecosystem and human society, of which the cryosphere is most easily affected be-cause of its frangibility and sensitivity. Similarly, cryosphere change has numerous impacts on the natural ecosystem and human society, which may resemble an indirect influence of climate change. These two types of impacts, in shared fields, are distinguished in space and time by effective mechanisms and processes. Climate change has positive and negative impacts on some systems, which may be adjusted by cryosphere change. These indirect and direct impacts may be distinguished, and then correct policies and measures can be made against these changes.
基金Project supported by the National Natural Science Foundation of China(Grant No.10905028)
文摘It has been proven that, with a single copy provided, the four Bell states cannot be distinguished by local operations and classical communications （LOCC）. Traditionally, a Bell basis projective measurement is needed to distinguish the four Bell states, which is usually carried out with a local interference between two particles. This paper presents an interesting protocol that allows two remote parties to distinguish four Bell states deterministically. We prove that our protocol of distinguishing remote Bell states is beyond LOCC.
基金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.
基金Supported by the Natural Science Foundation of Gansu Province(3ZS051-A25-025)
文摘A proper k-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 color set of edges incident to u is not equal to the color set of edges incident to v, where uv ∈E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by χ＇αα（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. In this paper we prove that if G（V, E） is a graph with no isolated edges, then χ＇αα（G）≤32△.
基金the Natural Science Foundation of Gansu Province （No. 3ZS051-A25-025） the Foundation of Gansu Provincial Department of Education （No. 0501-03）.
文摘Let G = （V, E） be a simple connected graph, and ｜V（G）｜ ≥ 2. Let f be a mapping from V（G） ∪ E（G） to {1,2…, k}. If arbitary uv ∈ E（G）,f（u） ≠ f（v）,f（u） ≠ f（uv）,f（v） ≠ f（uv）; arbitary uv, uw ∈ E（G）（v ≠ w）, f（uv） ≠ f（uw）;arbitary uv ∈ E（G） and u ≠ v, C（u） ≠ C（v）, whereC（u）={f（u）}∪{f（uv）｜uv∈E（G）}.Then f is called a k-adjacent-vertex-distinguishing-proper-total coloring of the graph G（k-AVDTC of G for short）. The number min{k｜k-AVDTC of G} is called the adjacent vertex-distinguishing total chromatic number and denoted by χat（G）. In this paper we prove that if △（G） is at least a particular constant and δ ≥32√△ln△, then χat（G） ≤ △（G） ＋ 10^26 ＋ 2√△ln△.
