Results 101 to 110 of about 110,794 (282)
Entropy, 2015 This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity based on a decomposition of the vertices linked to partial Hosoya polynomials.
Abbe Mowshowitz, Matthias Dehmer
doaj +1 more source
Polynomial Approximation and Graph-Coloring [PDF]
Computing, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Advanced Energy Materials, EarlyView.This review focuses on operando studies of battery materials by X‐ray diffraction (XRD) and total X‐ray scattering (TXS). This work highlights potential pitfalls and identify best‐practices for operando studies and reviews some unusual experiments to illustrate how these methods can be applied beyond the evaluation of the early‐stage cycling mechanisms
Amalie Skurtveit +5 more
wiley +1 more source
Complexity of Join and Corona graphs and Chebyshev polynomials
Journal of Taibah University for Science, 2018 Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj +1 more source
Domination Polynomials of Graph Products
, 2013 The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by various products, ranging from explicit formulae and recurrences for specific families to more general results. As
Kotek, Tomer +2 more
openaire +3 more sources
Smart Exploration of Perovskite Photovoltaics: From AI Driven Discovery to Autonomous Laboratories
Advanced Energy Materials, EarlyView.In this review, we summarize the fundamentals of AI in automated materials science, and review AI applications in perovskite solar cells. Then, we sum up recent progress in AI‐guided manufacturing optimization, and highlight AI‐driven high‐throughput and autonomous laboratories.
Wenning Chen +4 more
wiley +1 more source
Hardware acceleration of number theoretic transform for zk‐SNARK
Engineering Reports, EarlyView., 2023 An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Generalized Permanental Polynomials of Graphs [PDF]
Symmetry, 2019 The search for complete graph invariants is an important problem in graph theory and computer science. Two networks with a different structure can be distinguished from each other by complete graph invariants. In order to find a complete graph invariant, we introduce the generalized permanental polynomials of graphs.
openaire +2 more sources
AI in chemical engineering: From promise to practice
AIChE Journal, EarlyView.Abstract Artificial intelligence (AI) in chemical engineering has moved from promise to practice: physics‐aware (gray‐box) models are gaining traction, reinforcement learning complements model predictive control (MPC), and generative AI powers documentation, digitization, and safety workflows.
Jia Wei Chew +4 more
wiley +1 more source
Applications of magnesium iodide structure via modified-polynomials
Scientific ReportsA relatively recent approach in molecular graph theory for analyzing chemical networks and structures is called a modified polynomial. It emphasizes the characteristics of molecules through the use of a polynomial-based procedure and presents numerical ...
Haleemah Ghazwani +4 more
doaj +1 more source