Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K 7,n when7≤n≤95

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.

The Application of Genetic Algorithms and Multidimensional Distinguishing Model in Forecasting and Evaluating Credits for Mobile Clients

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.

A Distinguishing Method and Distribution Characteristics of Fog and Haze Days in Fuzhou

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.

ON EQUITABLE VERTEX DISTINGUISHING EDGE COLORINGS OF TREES

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.

Adjacent Vertex Distinguishing I-total Coloring of Outerplanar Graphs

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.

Upper bounds on vertex distinguishing chromatic index of some Halin graphs

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.

Forward masking in distinguishing inner and outer hair cell damage

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

Completely Distinguishing Individual A-genome Chromosomes and Their Karyotyping Analysis by Multiple BAC-FISH

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.

Using Cohen’s Effect Size to Identify Distinguishing Statements in Q-Methodology

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.

Neighbor Sum Distinguishing Index of Graphs with Maximum Average Degree

A proper k-edge coloring of a graph G = (V(G), E(G)) is an assignment c: E(G) → {1, 2, …, k} such that no two adjacent edges receive the same color. A neighbor sum distinguishing k-edge coloring of G is a proper k-edge coloring of G such that for each edge uv ∈ E(G). The neighbor sum distinguishing index of a graph G is the least integer k such that G has such a coloring, denoted by χ’Σ(G). Let be the maximum average degree of G. In this paper, we prove χ’Σ(G) ≤ max{9, Δ(G) +1} for any normal graph G with . Our approach is based on the discharging method and Combinatorial Nullstellensatz.

Investigating the writing proficiency of pre-service English as a Second Language teachers:Making use of distinguishing features

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.

Distinguishing male sterile and fertile cytoplasms in indica rice(Oryza sativa L.) by OPA 12

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

Deterministically distinguishing a remote Bell state

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.

Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10

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.

An Upper Bound for the Adjacent Vertex Distinguishing Acyclic Edge Chromatic Number of a Graph

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△.

An Upper Bound for the Adjacent Vertex-Distinguishing Total Chromatic Number of a Graph

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△.

Morphological comparison and molecular marker screening of three Skeletonema species found in Changjiang(Yangtze)River Basin

In our recent investigations of diatom diversity,we studied three species,namely,Skeletonema costatum,Skeletonema subsalsum,and Skeletonema potamos.Although they have been found frequently in Changjiang(Yangtze)River Basin,their morphological and molecular identification is difficult in taxonomy.Therefore,to integrate morphological and molecular biological approaches,we compared systematically their morphological characters and performed phylogenetic analysis.Twelve strains of Skeletonema were collected and isolated from Shanghai and Jiangsu,China,and their morphological characteristics were examined by light microscopy(LM)and the scanning electron microscopy(SEM).Based on morphological comparison,we determined that S.potamos is easy to distinguish from the other two species.The heavily silicified areolae,undulated or cleft distal ends of terminal fultoportula processes(TFPPs),absence of basal pores of fultoportula processes(FPPs),the rootlike protrusions of FPPs,and no interlocking connection are the stable characteristics that can be used to identify S.potamos.However,there are only two features that can distinguish S.costatum from S.subsalsum,namely the location of terminal rimoportulae(TRPs)and the distal shape of TFPPs.In addition,we amplified and sequenced nine common genetic markers from the strains,from which 101 sequences were obtained,constructed phylogenetic trees based on the nine genes and evaluated that seven genes can be used to identify S.potamos,and revealed that S.subsalsum is the closest known relative of S.costatum,and only ATP synthetase beta-subunit gene(atp B)is able to distinguish them from each other,which strongly support that it is an effective molecular marker for Skeletonema.This work provided a theoretical basis for the taxonomic study of Skeletonema.

Adjacent Vertex Distinguishing Incidence Coloring of the Cartesian Product of Some Graphs

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.

Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Average Degree

A proper [h]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [h] ={1, 2,..., h}. Let w（u） denote the sum of the color on a vertex u and colors on all the edges incident to u. For each edge uv ∈ E（G）, if w（u） ≠ w（v）, then we say the coloring c distinguishes adjacent vertices by sum and call it a neighbor sum distinguishing [h]-total coloring of G. By tndi∑ （G）, we denote the smallest value h in such a coloring of G. In this paper, we obtain that G is a graph with at least two vertices, if mad（G） 〈 3, then tndi∑ （G） ≤k ＋ 2 where k = max{△（G）, 5}. It partially confirms the conjecture proposed by Pilgniak and Wolniak.