Results 171 to 180 of about 969 (214)

TSA-Net: Multivariate Time Series Anomaly Detection Based on Two-Stage Temporal Attention. [PDF]

Sensors (Basel)
Wu H, Le W, Jia ZH, Zhao H, Zhang S, Zhang ZS.   +5 more
europepmc   +1 more source

A dual methodology employing ion-pair chromatography and built-in UV spectrophotometry for quantifying recently approved combination of mometasone and indacaterol in a novel combined metered dose inhaler: assessing the greenness, carbon footprint, blueness, and whiteness. [PDF]

BMC Chem
El-Masry AA, Abbas AEF, Salem YA.
europepmc   +1 more source

Application of signal processing techniques for the spectroscopic analysis of dolutegravir and lamivudine: a comparative assessment and greenness appraisal. [PDF]

BMC Chem
Alnemari RM, Abdelazim AH, Almalki AH, Alqahtani AS, Alaqel SI, Alsulami FT, Serag A.   +6 more
europepmc   +1 more source

On Hodge polynomials for nonalgebraic complex manifolds. [PDF]

Proc Natl Acad Sci U S A
Katzarkov L, Lee KS, Lupercio E, Meersseman L.   +3 more
europepmc   +1 more source

Improved Statistics for F-theory Standard Models. [PDF]

Commun Math Phys
Bies M, Cvetič M, Donagi R, Ong M.
europepmc   +1 more source

A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors [PDF]

Communications in Algebra, 2011
We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify associated primes from the graph.
Cameron Wickham
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

The Zero-Divisor Graph of a Lattice

Results in Mathematics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazem Khashyarmanesh, Khashyarmanesh K
exaly   +3 more sources

Chromatic uniqueness of zero-divisor graphs

The Art of Discrete and Applied Mathematics, 2022
Summary: The zero-divisor graph \(\Pi(R)\) of a commutative ring \(R\) is the graph whose vertices are the elements of \(R\) such that the vertices \(u\) and \(v\) are adjacent if and only if \(uv=0\). If the graphs \(G\) and \(H\) have the same chromatic polynomial, then we say that they are chromatically equivalent (or \(\chi -\) equivalent), written
Haneen Al-Janabi, Gábor Bacsó
openaire   +2 more sources

On generalized zero divisor graph of a poset

Discrete Applied Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vinayak Joshi
exaly   +3 more sources