Results 161 to 170 of about 15,555,412 (284)

A unifying principle of chromatic coding across biological and artificial systems. [PDF]

open access: yesSci Adv
Songlin Q   +6 more
europepmc   +1 more source

Replacement of Ores Recorded by Textures and Chemical Compositions of Sphalerite: An Example From the Furutobe Kuroko Deposit, Akita, Japan

open access: yesGeological Journal, EarlyView.
Coupled dissolution‐reprecipitation of early formed Cd‐, Fe‐, Ag‐ and Sb‐poor sphalerite through interaction with high‐temperature and high‐sulphur fugacity Cu‐rich fluids, responsible for the formation of the yellow ores, resulted in the formation of Cd‐, Fe‐, Ag‐ and Sb‐rich, heavily chalcopyrite‐diseased sphalerite and enrichment of critical metals ...
Manuel Nopeia   +4 more
wiley   +1 more source

ICP-MS Elemental Profiling and Antioxidant Characterization of Romanian Artisanal Pălincă-Based Beverages Enriched with Honey, Wild Fruits, and Wood Materials. [PDF]

open access: yesMolecules
Moțiu PT   +12 more
europepmc   +1 more source

Machine Learning for Autism Spectrum Disorder Prediction: A Review of Data Augmentation and Feature Selection Techniques

open access: yesHealth Care Science, EarlyView.
Autism spectrum disorder (ASD) is a complex neurodevelopmental condition characterized by persistent difficulties in social communication, social interaction, and repetitive behaviors. Early diagnosis is often hindered by subjective clinical assessments and limited data availability.
Sahar Alkhaibari, Feng Dong
wiley   +1 more source

On Fork‐Free t‐Perfect Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Physiological chromatic model eyes for IOL characterization. [PDF]

open access: yesBiomed Opt Express
Faria-Ribeiro M   +2 more
europepmc   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

Explicit 3‐colorings for Exponential Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy