Results 171 to 180 of about 52,163 (250)

Machine Learning and the Use of Spectroscopy for Adulteration Detection in Turmeric Powder. [PDF]

Molecules
Kisalaei A, Sharabiani VR, Banakar A, Taghinezhad E, Szymanek M, Dziwulska-Hunek A.   +5 more
europepmc   +1 more source

Simulation‐Based Learning in Oral Radiology: Students’ Perceptions of Training in Intraoral Radiographic Techniques Across Two Dental Institutes

Journal of Dental Education, EarlyView.
ABSTRACT Objective Simulation‐based learning (SBL) in oral radiology offers a safe, structured environment that supports students’ transition to clinical practice. However, limited research has captured students' perceptions of SBL for intraoral radiography training.
Abeer A. Almashraqi, Ankur Jethlia, Rebecca Glanville, Hanin Daas, Kamran Ali   +4 more
wiley   +1 more source

Deep learning based instance segmentation of mandarin fruit slices for precision assessment and morphological quantification. [PDF]

Sci Rep
Le AT, Ahn J, Thai TT.
europepmc   +1 more source

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

Deep learning-based classification of nitrate and nitrite concentrations from water samples using colorimetric test strip images. [PDF]

Environ Monit Assess
Roman M, Sher M, Kuruppuarachchi C, Ali A, Pack C, Zahid A, Nafchi AM.   +6 more
europepmc   +1 more source

On Fork‐Free t‐Perfect Graphs

Journal 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

Multi-scale structural similarity embedding search across entire proteomes. [PDF]

Bioinformatics
Segura J, Sanchez-Garcia R, Bittrich S, Rose Y, Burley SK, Duarte JM.   +5 more
europepmc   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal 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

Enhancing internet of things intrusion detection through high-performance boosting ensemble learning. [PDF]

Sci Rep
Yakovyna V, Fadieiev A.
europepmc   +1 more source