Set Of Colors Research Articles

BILANGAN KETERHUBUNGAN PELANGI PADA PEWARNAAN-SISI GRAF

Let be a graph. An edge-coloring of is a function , where is a set of colors. Respect to a subgraph of is called a rainbow subgraph if all edges of get different colors. Graph is called rainbow connected if for every two distinct vertices of is joined by a rainbow path. The rainbow connection number of , denoted by , is the minimum number of colors needed in coloring all edges of such that is a rainbow connected. The main problem considered in this thesis is determining the rainbow connection number of graph. In this thesis, we determine the exact value of the rainbow connection number of some classes of graphs such as Cycles, Complete graph, and Tree. We also determining the lower bound and upper bound for the rainbow connection number of graph.
 Keywords: Rainbow Connection Number, Graph, Edge-Coloring on Graph.

Normal 5-edge-colorings of a family of Loupekhine snarks

In a proper edge-coloring of a cubic graph an edge uv is called poor or rich, if the set of colors of the edges incident to u and v contains exactly three or five colors, respectively. An edge-coloring of a graph is normal, if any edge of the graph is either poor or rich. In this note, we show that some snarks constructed by using a method introduced by Loupekhine admit a normal edge-coloring with five colors. The existence of a Berge-Fulkerson Covering for a part of the snarks considered in this paper was recently proved by Manuel and Shanthi (2015). Since the existence of a normal edge-coloring with five colors implies the existence of a Berge-Fulkerson Covering, our main theorem can be viewed as a generalization of their result.

On the total and AVD-total coloring of graphs

A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and e receive different colors. The least number of colors sufficient for a total coloring of graph G is called its total chromatic number and denoted by An adjacent vertex distinguishing (AVD)-total coloring of G is a total coloring with the additional property that for any adjacent vertices u and v, the set of colors used on the edges incident on u including the color of u is different from the set of colors used on the edges incident on v including the color of v. The adjacent vertex distinguishing (AVD)-total chromatic number of G, is the minimum number of colors required for a valid AVD-total coloring of G. It is conjectured that which is known as total coloring conjecture and is one of the famous open problems. A graph for which the total coloring conjecture holds is called totally colorable graph. The problem of deciding whether or for a totally colorable graph G is called the classification problem for total coloring. However, this classification problem is known to be NP-hard even for bipartite graphs. In this paper, we give a sufficient condition for a bipartite biconvex graph G to have Also, we propose a linear time algorithm to compute the total chromatic number of chain graphs, a proper subclass of biconvex graphs. We prove that the total coloring conjecture holds for the central graph of any graph. Finally, we obtain the AVD-total chromatic number of central graphs for basic graphs such as paths, cycles, stars and complete graphs.

Deriving stellar parameters from GALANTE photometry: bias and precision

ABSTRACT In this paper, we analyse how to extract the physical properties from the GALANTE photometry of a stellar sample. We propose a direct comparison between the observational colours (photometric bands normalized to the 515 nm central wavelength) and the synthetic colours derived from different stellar libraries. We use the reduced χ2 as the figure of merit for selecting the best fitting between both colour sets. The synthetic colours of the Next Generation Spectral Library (NGSL) provide a valuable sample for testing the uncertainty and precision of the stellar parameters derived from observational data. Reddening, as an extrinsic stellar physical parameter becomes a crucial variable for accounting for the errors and bias in the derived estimates: the higher the reddenings, the larger the errors and uncertainties in the derived parameters. NGSL colours also enable us to compare different theoretical stellar libraries for the same set of physical parameters, where we see how different catalogues of models can provide very different solutions in a, sometimes, non-linear way. This peculiar behaviour makes us to be cautious with the derived physical parameters obtained from GALANTE photometry without previous detailed knowledge of the theoretical libraries used to this end. In addition, we carry out the experiment of deriving physical stellar parameters from some theoretical libraries, using some other libraries as observational data. In particular, we use the Kurucz and Coelho libraries, as input observational data, to derive stellar parameters from Coelho + TLUSTY and Kurucz + TLUSTY stellar libraries, respectively, for different photometric errors and colour excesses.

Highly Efficient Thermally Co-evaporated Perovskite Solar Cells and Mini-modules

Summary The rapid improvement in the power conversion efficiency (PCE) of perovskite solar cells (PSCs) has prompted interest in bringing the technology toward commercialization. Capitalizing on existing industrial processes facilitates the transition from laboratory to production lines. In this work, we prove the scalability of thermally co-evaporated MAPbI3 layers in PSCs and mini-modules. With a combined strategy of active layer engineering, interfacial optimization, surface treatments, and light management, we demonstrate PSCs (0.16 cm2 active area) and mini-modules (21 cm2 active area) achieving record PCEs of 20.28% and 18.13%, respectively. Un-encapsulated PSCs retained ∼90% of their initial PCE under continuous illumination at 1 sun, without sample cooling, for more than 100 h. Looking toward tandem and building integrated photovoltaic applications, we have demonstrated semi-transparent mini-modules and colored PSCs with consistent PCEs of ∼16% for a set of visible colors. Our work demonstrates the compatibility of perovskite technology with industrial processes and its potential for next-generation photovoltaics.

Research on interactive design of multilingual e-commerce platform based on eye tracker

In “interactive design”, designers usually rely on personal experience and understanding to work. The design interface has strong subjectivity, and it is difficult to match the intention of users. Based on the basic experiments of eye movements, this study collected and analyzed the pages of the search engine for a multilingual e-commerce platform through the indicators such as the duration of the objects being watched, the number of objects to be followed, and the sequence of objects to be looked at. After the experiment, we found that the first movement of the eyeball was still focused on the upper left corner of the page. During the browsing process, the subjects were used to the order from top to bottom and from left to right. So when we design the page, we should keep this style and respect the user’s habits. After analyzing the data, we found that the simple design made a good impression on the subjects, so we should keep the simple style in the page design, avoid filling every inch of space, otherwise it will cause the burden of visual memory. The data analysis also showed that the use of controls, prompt wording, color settings and page style are consistent, which can make users easily speculate about various functions and increase the user’s preference.

Knot-theoretic flocks

We characterize the para-associative ternary quasi-groups (flocks) applicable to knot theory, and show which of these structures are isomorphic. We enumerate them up to order 64. We note that the operation used in knot-theoretic flocks has its non-associative version in extra loops. We use a group action on the set of flock colorings to improve the cocycle invariant associated with the knot-theoretic flock (co)homology.

Developing a Method to Determine Salivary THC Concentration

Introduction: Cannabis impairs cognitive and psychomotor performance, which can negatively affect driving skills. The main psychoactive ingredient in cannabis is ∆9-tetrahydrocannabinol (THC). Due to the recent legalization of cannabis in Canada, there is an urgent need for a roadside test to identify THC impaired drivers. The legal limit while driving is calculated based on blood THC concentration, but saliva samples are the most convenient to collect roadside. Thus, the objectives of this study are to (1) determine the relationship between salivary and serum THC concentration and (2) develop a suitable roadside method to determine salivary THC concentration. Methods: THC doses between 0.2 mg/Kg to 100 mg/Kg will be orally administered to 36 mice (18 female, 18 male) in a repeated-measures design. Saliva and blood samples will be collected in 15 min intervals from 0 to 6 hours after administration. Gas chromatography (GC) and liquid chromatography (LC) coupled to mass spectrometry (MS) will be used to determine THC concentration in the saliva and blood samples. The relationship between salivary and serum THC concentration will be modelled. In addition, a series of azo dyes will be applied to the saliva samples to determine salivary THC concentrations in a simple and rapid manner. The samples will be dissolved in NaOH, and various dyes will be added. An acid-base reaction will create a phenolate anion from the phenolic group of the ∆9-THC molecule, which will then attack the diazo group of the azo dye to produce a coloured end-product. Expected Results: We expect a positive linear relationship between the logged salivary and blood serum THC concentrations. We predict that each azo dye will produce a single colour within a specific and different range of THC concentration, so a distinct set of colours produced from many dyes can be associated with a narrow range of salivary THC concentration. Discussion: The colours produced from the azo dye reactions can be associated with salivary THC concentrations, which can then be correlated to serum THC concentrations. We use a mouse model in this study to have a more controlled investigation of the relationship between salivary and serum THC concentration, but future investigations should apply the results to humans. Conclusion: This study aims to determine salivary THC concentration in a suitable roadside method and correlate the results to serum THC concentration. The implications of this study are to be able to detect THC impaired drivers in a simple and rapid manner.

Solar retinopathy: a new setting of red, green, and blue channels.

Purpose:To introduce a new color imaging technique using improved settings of red, green, and blue channels for improved delineation of retinal damage in patients with solar retinopathy.Method:A retrospective case series of patients with poor vision secondary to solar retinopathy were analyzed. All patients underwent visual acuity, refraction, and dilated fundus examination. A spectral domain–optical coherence tomography of the macula and color fundus imaging using optimized red, green, and blue color setting was performed. Patients were reviewed over a 6-month period. The data were analyzed for statistical significance using an independent t test and a receiver operating characteristic curve.Results:In total, 20 eyes of 10 patients were included between 2009 and 2017. The mean age was 24.9 ± 18.1 years. Best corrected visual acuity at first consultation was 0.78 ± 0.11 and after 6 months was 0.83 ± 0.09. Spectral domain–optical coherence tomography demonstrated retinal abnormalities at the myoid zone, ellipsoid zone, and the outer segment of photoreceptors. Receiver operating characteristic curve analysis showed an improving effect (area under the curve = 0.62; 95% confidence interval = 0.42–0.79). The color channels parameters, which improve visualization of the lesions were found to be 67-0.98-255 for the R-guided setting, 19-0.63-121 for the B-guided setting, and 7-1.00-129 for the G-guided setting. The ideal red, green, and blue setting was in 24-0.82-229.Conclusion:The use of a new setting of red, green, and blue channels could improve the diagnosis and monitoring of solar retinopathy, hence improving patient care.

Single image dehazing by approximating and eliminating the additional airlight component

This paper proposes a novel technique for single image dehazing using adaptive nearest neighbor regularization to obtain a haze-free transmission map and then approximating the additional airlight component present in the hazy image. The proposed method relies on the intensity distribution in the small image patches of the image, exhibited from the Y channel of the YCbCr representation of the image, in order to preserve the texture information of the image. We substitute the commonly used soft matting technique in assessing the refined transmission map for haze removal, by adaptive nearest neighbor classifier. We assume that the actual color of the haze-free pixels in the image is approximated by a set of discrete colors. We discover the haze-free pixels using the Nearest-Neighbor (NN) regularization. Finally, unlike the state-of-the-art methods, we approximate the additional airlight present in the image patch and eliminate that to clear the haze, instead of estimating the transmission of the medium. The proposed nearest neighbor regularization technique automatically changes the patch size, which helps in dealing with the high depth region (e.g., sky region) of the image. We experimented on standard synthetic and real hazy image datasets and observed that, the proposed method outperforms the state-of-the-art, especially for images with sky regions.

Tribracket Modules

Niebrzydowski tribrackets are ternary operations on sets satisfying conditions obtained from the oriented Reidemeister moves such that the set of tribracket colorings of an oriented knot or link diagram is an invariant of oriented knots and links. We introduce tribracket modules analogous to quandle/biquandle/rack modules and use these structures to enhance the tribracket counting invariant. We provide examples to illustrate the computation of the invariant and show that the enhancement is proper.

"Fake Tan" or "Fake News"?

We estimated Trump’s skin colour from 70 internet images and also from the “twitter tan line” image (February 8, 2020; Twitter). We then compared the estimated skin colours with two existing data sets of skin colours: the range of skin tans that occur naturally in the Caucasian population and the range skin colours brought about by a sunless tan. We find that Trump’s skin colour is close to the edge of the natural skin tan gamut and firmly within the gamut of a sunless skin tan. The skin colour above Trump’s tan line is outside of the naturally occurring range of skin colours, even outside the skin tan of nonmelanized albinos. The latter finding is consistent with the hypothesis that part of the image may have been digitally distorted.

EVALUATION OF OPTIMUM CONDITIONS FOR SOIL TERMITICIDES STORAGE IN TROPICAL CLIMATE

Soil termiticide treatment is a key strategy in controlling the termite population and infestation by creating a continuous barrier encompassing the structures. Termiticides, however, may dissipate for a variety of reasons such as a half-life, a degradation rate, a leaching activity, and a storage method. This study aimed to evaluate the optimum storage conditions for three most commonly used termiticides i.e. bifenthrin, fipronil, and imidacloprid. The evaluation was made by examining Active Ingredients (AIs) of each termiticide using two sets of bottle colors (black and white) and different storage spaces (in car and store) within 30 days. The results revealed that the bottle colors (F: 0.181, df= 1, P= 0.672) and storage places (F= 5.495, df= 1, P= 0.977) did not significantly affect the concentration of termiticides after 30 days. It further demonstrated that the tested termiticides were unstable in an aqueous solution after 30 days due to hydrolysis. The half-life values were recorded at 7.45 days (bifenthrin), 3.98 days (fipronil) and 9.42 days (imidacloprid), respectively. The black and white bottles showed no significant effect on termiticide concentrations, indicating that photodegradation could occur regardless of the termiticides were stored in the store or in the car. Fipronil was the least effective termiticide as its residual reduced to half after three days of mixing. Hence, it is recommended that any termiticide must be immediately used after mixing to avoid photodegradation and hydrolysis.

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs

Let G=(V,E) be a simple graph and ϕ:E(G)→{1,2,…,k} be a proper k-edge coloring of G. We say that ϕ is neighbor sum (set) distinguishing if for each edge uv∈E(G), the sum (set) of colors taken on the edges incident with u is different from the sum (set) of colors taken on the edges incident with v. The smallest k such that G has a neighbor sum (set) distinguishing k-edge coloring is called the neighbor sum (set) distinguishing index of G and denoted by χ∑′(G) (χa′(G)). It was conjectured that if G is a connected graph and G∉{K2,C5}, then χ∑′(G)≤Δ(G)+2 and χa′(G)≤Δ(G)+2. For a given graph G, let (Le)e∈E be a set of lists of real numbers and each list has size k. The smallest k such that for any specified collection of such lists there exists a neighbor sum (set) distinguishing edge coloring using colors from Le for each e∈E is called the list neighbor sum (set) distinguishing index of G, and denoted by ch∑′(G)(cha′(G)). In this paper, we prove that if G is a planar graph with Δ(G)≥22 and with no isolated edges, then ch∑′(G)≤Δ(G)+6 and cha′(G)≤Δ(G)+3. This improves a result by Przybyło and Wong (Przybyło and Wong, 2015), which states that if G is a planar graph without isolated edges, then ch∑′(G)≤Δ(G)+13 (so cha′(G)≤Δ(G)+13 also holds). Our approach is based on the Combinatorial Nullstellensatz and the discharging method.

Facial edge–face coloring of [formula omitted]-minor-free graphs

Let G be a plane graph. Two edges are said to be facially adjacent if they are consecutive on the boundary walk of a face of G. We call G facially edge–face k-colorable if there is a mapping from E(G)∪F(G) to a k color set so that any two facially adjacent edges, adjacent faces, and incident edge and face receive distinct colors. The facial edge–face chromatic number of G, denoted by χ̄ef(G), is defined to be the least integer k such that G is facially edge–face k-colorable.In 2016, Fabrici, Jendrol’ and Vrbjarová conjectured that every connected, loopless, bridgeless plane graph is facially edge–face 5-colorable. In this paper, we confirm this conjecture for the case of K4-minor-free graphs. More precisely, we prove that every bridgeless K4-minor-free graph is facially edge–face 5-colorable. Moreover, the upper bound 5 is best possible.

A cascade network for the classification of rice grain based on single rice kernel

This paper describes the classification of four different varieties of rice grain based on four sets of features, namely morphology, colour, texture and wavelet. The classification is carried out on single rice kernel using image pre-processing steps followed by a cascade network classifier. The performance of the classifiers based on the above feature sets is also compared. It is found that morphological feature is more suitable for the classification of rice kernels, as compared to other features. The number of input features is reduced by a feature selection process using statistical analysis system (SAS) software. The classification accuracy based on selected features is compared with that of original features using different classifiers. It is found that the selected features are able to provide classification accuracy very close to the original features. The performance of the proposed cascade classifier is also tested against standard datasets from the University of California, Irvine (UCI), and the results are compared with other classifiers. The results show that the proposed classifier provides better classification accuracy as compared to other classifiers.

Looking ahead: When do you find the next item in foraging visual search?

Many real-world visual tasks involve searching for multiple instances of a target (e.g., picking ripe berries). What strategies do observers use when collecting items in this type of search? Do they wait to finish collecting the current item before starting to look for the next target, or do they search ahead for future targets? We utilized behavioral and eye-tracking measures to distinguish between these two possibilities in foraging search. Experiment 1 used a color wheel technique in which observers searched for T shapes among L shapes while all items independently cycled through a set of colors. Trials were abruptly terminated, and observers reported both the color and location of the next target that they intended to click. Using observers’ color reports to infer target-finding times, we demonstrate that observers found the next item before the time of the click on the current target. We validated these results in Experiment 2 by recording fixation locations around the time of each click. Experiment 3 utilized a different procedure, in which all items were intermittently occluded during the trial. We then calculated a distribution of when targets were visible around the time of each click, allowing us to infer when they were most likely found. In a fourth and final experiment, observers indicated the locations of multiple future targets after the search was abruptly terminated. Together, our results provide converging evidence to demonstrate that observers can find the next target before collecting the current target and can typically forage one to two items ahead.

On r-dynamic vertex coloring of line, middle, total of lobster graph

Let G be a simple, connected and undirected graph that has a set of vertex and edge. The degree of v ∈ V(G) is denoted by d(v). The maximum and minimum degree of G respectively are Δ(G) and δ(G). The r-dynamic color of the graph G is calculated as a map c from V to a color set such that if u, v ∈ V(G) is adjacent, then c(u) ≠ c(v), and for each v ∈ V(G), |c(N(v))| ≥ min{r, d(v)}. The number of r-dynamic coloring of G denoted by χr (G) is minimum color k in G. In this paper, we have obtained the r-dynamic vertex coloring of line, middle, total of lobster graph ℒn (2, 1).

Correlation between EPR spectra and coloration of natural diamonds

White diamonds color grading is one of the basic diamond evaluations. The color value based on a scale that ranges from D to Z, with D being the more colorless and more valuable, among other qualifications. As the diamond grade moves on this scale, its color appears more yellow progressively. This yellowish color, present only in Type I diamonds, is mainly due to the nitrogen related defects such as N3 center and C-center. The current color grading system is based on a visual method, where gemologist compares the sample with a Master Color set. However, this method is very subjective. Several defects responsible for light absorption in diamond are carrying electron spin and appear in Electron Paramagnetic Resonance (EPR) spectrum. In this study, we developed a new EPR based technique for a quantitative measurement of N3 center and C-center in diamond through quantitative EPR spectroscopy. The correlation between EPR spectra and color grades of diamond was established.

Set-shifting ability is specifically linked to high-school science and math achievement in Chinese adolescents.

Previous meta-analytic studies have revealed that set-shifting ability contributes to achievement in math and reading equally during childhood, but less is known about whether set-shifting ability plays an equally important role in achievement in different school subjects during high-school learning. To fill this research gap, the current study examined the association between set-shifting ability and academic achievement among 10th-grade Chinese adolescents who attended high school (N = 221). Meanwhile, we further explored the possible mechanisms underlying this association by testing the mediating role of math abilities (i.e., arithmetic and algebraic ability). Set-shifting ability was measured through a task-switching task in which participants continuously change task rules based on color and shape sets. Academic achievement was indexed by curriculum-based examination scores. Based on exploratory factor analyses, the achievement scores could be classified into two categories: (a) science and math achievement, including math, physics, chemistry, biology, and geography scores; and (b) humanities achievement, comprising Chinese, English, history, and politics scores. Arithmetic ability and algebraic ability were measured by participants' ability to perform calculations and solve algebraic equations, respectively. Correlation and regression analyses found that set-shifting ability was related to science and math achievement, but not to humanities achievement. Furthermore, the association between set-shifting ability and science and math achievement is partly mediated by algebraic ability. Together, these results suggest that set-shifting ability plays a domain-specific role in achievement. That is, set-shifting ability is specifically linked to science and math achievement in Chinese adolescents, and this specific link may be partly mediated by algebraic ability.