A Cognitive Psychological Study on the Acquisition of Chinese Word’s Coloring Meaning--Chinese as a Second Language

Lexical meaning mainly includes rational meaning,grammatical meaning,and coloring meaning.Mastering the coloring meaning of vocabulary is of great significance for foreign students to use Chinese vocabulary correctly.This study mainly examines the psychological mechanism of Chinese second language learners mastering the coloring meaning of words,examines the psychological characteristics of students mastering the color meaning of words from the perspectives of second language learning theory and cognitive theory,establishes a cognitive schema for coloring meaning learning,and proposes corresponding learning models and teaching strategies.

A Map Coloring Method

Different vertices are colored in a plan. Adjacent vertices are colored dif-ferently from nonadjacent vertices, which are colored the same color. One color is used for a single point, two colors are used for points without a loop, and a maximum of four colors are used for points with a loop. A maximum of four colors are used to color all points. .

Note on Cyclically Interval Edge Colorings of Simple Cycles

A proper edge t-coloring of a graph G is a coloring of its edges with colors 1, 2,..., t, such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each vertex, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. In this paper, we provide a new proof of the result on the colors in cyclically interval edge colorings of simple cycles which was first proved by Rafayel R. Kamalian in the paper “On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles, Open Journal of Discrete Mathematics, 2013, 43-48”.

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.

Vertex-distinguishing VE-total Colorings of Cycles and Complete Graphs

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.

Vertex-distinguishing IE-total Colorings of Cycles and Wheels

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.

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.

On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

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.

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.

On the Maximum Number of Dominating Classes in Graph Coloring

We investigate the dominating-c-color number,, of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].

A Method for Trust Management in Cloud Computing: Data Coloring by Cloud Watermarking

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.

New mixed broadcast scheduling approach using neural networks and graph coloring in wireless sensor network

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.

THE INFLUENCE OF COMPOSITION AND TEMPERATURE OF BATH ANDAFTER-TREATMENT 0N COLORATION IN COLORING HOT DIPGALVANIZATION

The 08 Al steel sheets were hot dip ped into Zn - Mn bath with 0 1 % Mn and 0 2 % Mn at600 ～420 ℃ bath tem perature , and then w ere treated in different w ays . The after - treat ments include cooling in the air at room tem perature directly , holding at the upper part of thehot dip galvanizing furnace for 60 s an d then holding at 510 ±10 ℃for 90 s . The results in dicated that blue , yellow , and purple , w hose coloration varied with the co m position an d thetem perature of bath and the w ays of after - treat ment . Finally , the mechanism of coloredzinc coating w as discussed .

The effects of coloring therapy on patients with generalized anxiety disorder

Generalized anxiety disorder(GAD)has harmful effects on physical and mental health and quality of life.Coloring therapy has been reported to have a positive effect on improving patient anxiety and depression.But there are no reported clinical trials examining their effectiveness as a treatment for GAD.This study was planned to evaluate the effectiveness of coloring therapy combined with conventional therapy in improving anxiety,depression,and positive and negative emotions with GAD.This randomized controlled study comprising 88 GAD patients was selected for intervention in different wards.The control group(n=45)was given conventional antianxiety medication and physical therapy,and the experimental group(n=43)received coloring therapy combined with conventional therapy.The Self-Rating Depression Scale,Self-Rating Anxiety Scale(SAS),Hamilton Depression Scale,Hamilton Anxiety Scale(HAMA),and Positive and Negative Affect Scale were assessed in both groups before and 3 weeks after the intervention.After the intervention,there were statistical differences in intra-and inter-group comparisons of anxiety,depression,and positive and negative mood scales in the experimental and control groups(p<.05).The minus in anxiety/positive emotions pre-and postintervention in the experimental group was statistically significant compared to that in anxiety/positive emotions pre-and postintervention in the control group(HAMA:d=1.45,95%confidence interval[CI](0.34,2.57),p=.011;SAS:d=3.87,95%CI(1.73,6.00),p=.001;positive:d=1.76,95%CI(0.17,3.34),p=.030).The minus in depressive/negative emotions pre-and postintervention in the experimental group was not statistically significant compared with that in depressive/negative emotions pre-and postintervention in the control group(p>.05).For GAD patients,adding coloring therapy based on conventional drug therapy and physical therapy can not only reduce depression and negative emotions but also have better effects on reducing anxiety and improving positive emotions than conventional therapy.

Adjacent Vertex-distinguishing E-total Coloring on Some Join Graphs Cm ∨ Gn

Let G(V, E) be a simple connected graph and k be positive integers. A mapping f from V∪E to {1, 2, ··· , k} is called an adjacent vertex-distinguishing E-total coloring of G(abbreviated to k-AVDETC), if for uv ∈ E(G), we have f(u) ≠ f(v), f(u) ≠ f(uv), f(v) ≠ f(uv), C(u) ≠C(v), where C(u) = {f(u)}∪{f(uv)|uv ∈ E(G)}. The least number of k colors required for which G admits a k-coloring is called the adjacent vertex-distinguishing E-total chromatic number of G is denoted by x^e_(at) (G). In this paper, the adjacent vertexdistinguishing E-total colorings of some join graphs C_m∨G_n are obtained, where G_n is one of a star S_n , a fan F_n , a wheel W_n and a complete graph K_n . As a consequence, the adjacent vertex-distinguishing E-total chromatic numbers of C_m∨G_n are confirmed.

Research of Privacy Preservation Method Based on Data Coloring

In the cloud computing environment, outsourcing service mode of data storage causes the security problem, the reliability of data cannot be guaranteed, and the privacy preservation problem has aroused wide concern. In order to solve the problem of inefficiency and high-complexity caused by traditional privacy preservation methods such as data encryption and access control technology, a privacy preservation method based on data coloring is proposed. The data coloring model is established and the coloring mechanism is adopted to deal with the sensitive data of numerical attributes, and the cloud model similarity measurement based on arithmetic average least-approximability is adopted to authenticate the ownership of privacy data. On the premise of high availability of data, the method strengthens the security of the privacy information. Then, the performance, validity and the parameter errors of the algorithm are quantitatively analyzed by the experiments using the UCI dataset. Under the same conditions of privacy preservation requirements, the proposed method can track privacy leakage efficiently and reduce privacy leakage risks. Compared with the k-anonymity approach, the proposed method enhances the computational time efficiency by 18.5%.

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

Melnikov(1975) conjectured that the edges and faces of a plane graph G can be colored with △(G) + 3 colors so that any two adjacent or incident elements receive distinct colors, where △(G) denotes the maximum degree of G. This paper proves the conjecture for the case △(G) ≤4.

Smarandachely Adjacent-vertex-distinguishing Proper Edge Coloring ofK4 ∨ Kn

Let f be a proper edge coloring of G using k colors.For each x∈V(G),the set of the colors appearing on the edges incident with x is denoted by S_f(x)or simply S(x)if no confusion arise.If S(u)■S(v)and S(v)■S(u)for any two adjacent vertices u and v,then f is called a Smarandachely adjacent vertex distinguishing proper edge coloring using k colors,or k-SA-edge coloring.The minimum number k for which G has a Smarandachely adjacent-vertex-distinguishing proper edge coloring using k colors is called the Smarandachely adjacent-vertex-distinguishing proper edge chromatic number,or SAedge chromatic number for short,and denoted byχ'_(sa)(G).In this paper,we have discussed the SA-edge chromatic number of K_4∨K_n.

Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles

A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a set of k consecutive integers. A cyclically interval total t-coloring of a graph G is a total coloring a of G with colors 1,2,...,t, such that at least one vertex or edge of G is colored by i,i=1,2,...,t, and for any, the set is a -interval, or is a -interval, where dG(x) is the degree of the vertex x in G. In this paper, we study the cyclically interval total colorings of cycles and middle graphs of cycles.

The feasibility study of natural pigments as food colorants and seasonings pigments safety on dried tofu coloring

In order to improve appetite,attract consumers and even conform to the food culture,food coloring has become one of the necessary links in modern food processing.For example,dried-tofu will be colored by adding artificial food colors(AFCs)such as sunset yellow,cochineal red A or other seasonings like soy sauce.However,the dispute persists about whether AFCs are harmful to health.Some studies indicate AFCs affect children’s intelligence and attention,cause hyperactivity,and allergy when children consumed≥50 mg.In addition,researches showed that chemical soy sauce produces a trace of methylglyoxal(MGO)in the manufacturing process,which is related to diseases such as oxidative stress,diabetes,and cognitive deterioration.Therefore,natural pigments are relatively new and promising strategy for replacing high-risk AFCs.Thus,the objective of this study was to use dried-tofu as a natural colorants coloring screening platform,through the concept of three primary colors to discuss the coloring effects of natural colorants in Taiwan in double–phase(liquid phase to solid phase)food coloring system and assess the effects of MGO on PC12 neuron cellular morphology and cell cycle at the dietary exposure in soy sauce.Our results showed that formula G:R=0.2:0.8 and C:R=0.08:0.92 were coloring by combined natural colorants had the same eye sensory quality acceptance of consumer and had the intention to purchase.Furthermore,the results from the PC12 cell suggested that dietary exposure of methylglyoxal(<50M)in soy sauce did not affect neuron cellular morphology and cell cycle significantly.Overall,Gardenia Yellow,Curcumin,and Radish Red could overcome the application restrictions in multiplephase food coloring system and simultaneously soy sauce as a coloring agent was safety.It showed the possibility of them as food colorants on dried-tofu.