Results 101 to 110 of about 2,669,595 (286)

Domination of a generalized Cartesian product [PDF]

, 2009
Let $G\ensuremath{\mathbin{\raisebox{0.3mm}{$\scriptstyle\square$}}} H$ denote the Cartesian product of the graphs $G$ and $H$. Domination of the Cartesian product of two graphs has received much attention, with a main objective to confirm the truth of ...
Benecke, Stephen
core  

A Generative Neuro‐Symbolic AI for Protein Sequence Design

Advanced Science, EarlyView.
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne, Delphine Dessaux, Samuel Buchet, Lucie Barthe, Liza Ammar‐Khodja, Bessam Azizi, Valentin Durante, Gianluca Cioci, Simon de Givry, Alain Roussel, Luis F. Garcia‐Alles, Thomas Schiex, Sophie Barbe   +12 more
wiley   +1 more source

Cation Diffusion‐Mediated Displaced Reaction‐Transformation in Green Steelmaking

Advanced Science, EarlyView.
The removal of O lattice atoms by environmental H2 at the surface of Fe3O4 results in Fe enrichment, driving the inward diffusion of Fe cations into the bulk. Through hopping between unoccupied and initially occupied sites, cation diffusion triggers a spatially displaced reaction‐transformation and drives subsequent dynamic phase transformations and ...
Guangyi Guo, Paul Paciok, Baptiste Bienvenu, Longqi Bai, Barak Ratzker, Marc Heggen, Xuyang Zhou, Dierk Raabe   +7 more
wiley   +1 more source

Dominating Cartesian products of cycles

Discrete Applied Mathematics, 1995
A set of vertices \(D\) in a graph is dominating if every vertex of the graph is adjacent to some vertex from \(D\). The domination number of the graph is the size of a smallest dominating set. The paper discusses the computation of the domination number of Cartesian products of graphs and an algorithm for finding minimum dominating sets in such graphs.
Sandi Klavzar, Norbert Seifter
openaire   +3 more sources

Gap‐Free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels

Advanced Science, EarlyView.
Fused Full‐Field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that combines direct ptychography with tilt‐corrected dark‐field reconstruction in a single acquisition. Fourier‐space fusion using Wiener‐type spectral weighting closes the low‐frequency contrast gap inherent to bright‐field methods, delivering gap‐free, dose‐efficient, near ...
Shengbo You, Georgios Varnavides, Sagar Khavnekar, Nikita Palatkin, Sihan Shao, Mingjian Wu, Daniel Stroppa, Darya Chernikova, Baixu Zhu, Ricardo Egoavil, Stefano Vespucci, Dileep Krishnan, Xingchen Ye, Florian K. M. Schur, Erdmann Spiecker, Philipp Pelz   +15 more
wiley   +1 more source

FUCA: a Frame to Prevent the Generation of Useless results in the Dataflows Based on Cartesian Product for Convolutional Neural Network Accelerators [PDF]

International Journal of Information and Communication Technology Research
One of the most important issues in the design of CNN accelerators pertains to the accelerator's ability to effectively leverage the available opportunities in the type and processing of input data, and the task of achieving this objective mostly lies ...
Babak NarimanJahan, Ahmad Khademzadeh, Akram Reza   +2 more
doaj  

The fault-diameter of Cartesian products

Advances in Applied Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iztok Banic, Janez Zerovnik
openaire   +4 more sources

Polarization Engineering in Vinylene‐Linked COFs Toward Efficient Neuromorphic Computing

Advanced Science, EarlyView.
A vinyl‐linked covalent organic framework (COF‐DIBPY) was synthesized on a conductive substrate for memristor applications. Redox reactions and bromide migration enable low‐voltage (0.5V) conductance switching with high analog on/off ratio (15.7). The device was further integrated into a speech emotion recognition system for acoustic simulation and ...
Hao Wang, Lei Zhao, Haoyuan Yao, Qiongshan Zhang, Fuzhen Xuan, Bin Zhang   +5 more
wiley   +1 more source

On the connectivity of Cartesian product of graphs

Ars Mathematica Contemporanea, 2013
We give a new alternative proof of Liouville’s formula which states that for any graphs G and H on at least two vertices, κ ( G □  H ) = min{ κ ( G )| H |,  | G | κ ( H ),   δ ( G ) +  δ ( H )} , where κ and δ denote the connectivity number and minimum degree of a given graph, respectively.
Jelena Govorcin, Riste Skrekovski
openaire   +2 more sources

PERFORMANCE ANALYSES OF CARTESIAN PRODUCT FILES AND RANDOM FILES

, 2014
[[abstract]]In this paper, we shall derive two formulas for the average number of buckets to be examined over all possible partial match queries for Cartesian product files and random files, respectively.
Chang, C. C.;Du, M. W.;Lee, R. C. T.
core   +1 more source