Results 31 to 40 of about 208,933 (266)

Design and Implementation of Solution Algorithm for Foreign Key Conflict Based on Directed Graph [PDF]

open access: yesJisuanji gongcheng, 2021
As one of the important constraints in relational databases,foreign keys play an important role in constraining the order of operations of the database.However,in some cases,users cannot know the order of operations,causing foreign key conflicts.To solve
WANG Zhiduo, JIANG Bo, MIAO Rui, ZHAO Hui
doaj   +1 more source

Directed Information Graphs [PDF]

open access: yesIEEE Transactions on Information Theory, 2015
41 pages, 15 ...
Christopher J. Quinn   +2 more
openaire   +2 more sources

Directed network Laplacians and random graph models

open access: yesRoyal Society Open Science, 2021
We consider spectral methods that uncover hidden structures in directed networks. We establish and exploit connections between node reordering via (a) minimizing an objective function and (b) maximizing the likelihood of a random graph model. We focus on
Xue Gong   +2 more
doaj   +1 more source

A Graph Convolution for Signed Directed Graphs

open access: yesCoRR, 2022
Preprint ...
Ko, Taewook, Kim, Chong-Kwon
openaire   +2 more sources

Directed zero-divisor graph and skew power series rings [PDF]

open access: yesTransactions on Combinatorics, 2018
‎Let $R$ be an associative ring with identity and $Z^{\ast}(R)$ be its set of non-zero zero-divisors‎. ‎Zero-divisor graphs of rings are well represented in the literature of commutative and non-commutative rings‎. ‎The directed zero-divisor graph of $R$‎
Ebrahim Hashemi   +2 more
doaj   +1 more source

Directed Graph Hashing

open access: yesCoRR, 2020
This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise via computation of vertex orbits and the graph automorphism group, and nodes that are symmetrically identical are ...
openaire   +2 more sources

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

Directed Knowledge Graph Embedding Using a Hybrid Architecture of Spatial and Spectral GNNs

open access: yesMathematics
Knowledge graph embedding has been identified as an effective method for node-level classification tasks in directed graphs, the objective of which is to ensure that nodes of different categories are embedded as far apart as possible in the feature space.
Guoqiang Hou   +3 more
doaj   +1 more source

Marked directed graphs

open access: yesJournal of Computer and System Sciences, 1971
Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in generality and scope according to the properties one wishes to model and analyze. In this paper we solve a problem of maximal storage requirements for a simple flowchart model called the Marked Graph Model.
Frederic G. Commoner   +3 more
openaire   +2 more sources

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy