Results 1 to 10 of about 11,415 (138)

Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree [PDF]

open access: yesEAI Endorsed Transactions on Context-aware Systems and Applications, 2016
In this paper, we suggest a new technique to create index helping for querying almost identical similarities with keywords in case there is no correct match found.
Tran Minh Bao   +2 more
doaj   +5 more sources

Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj   +7 more sources

Population morphology implies a common developmental blueprint for Drosophila motion detectors. [PDF]

open access: yesPLoS Computational Biology
T4 and T5 neurons are the first direction-selective neurons in the visual pathway. They are the most numerous cell types in the fly brain (~6000 within each optic lobe) and, as a population, their compact dendritic arbours span the entire visual field ...
Nikolas Drummond   +2 more
doaj   +2 more sources

On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such homomorphisms. We fully
Christopher Duffy, Sonja Linghui Shan
doaj   +1 more source

Model-based Fault Tree Automatic Generation Method [PDF]

open access: yesJisuanji kexue, 2021
Model-based safety analysis methods can improve the modeling and analysis capabilities of current complex safety-critical systems.At present,fault tree is widely used in system safety analysis and reliability analysis.Fault tree analysis (FTA) is a top ...
ZHAN Wan-li, HU Jun, GU Qing-fan, RONG Hao, QI Jian, DONG Yan-hong
doaj   +1 more source

Isometric copies of directed trees in orientations of graphs [PDF]

open access: yesJournal of Graph Theory, 2019
AbstractThe isometric Ramsey number of a family of digraphs is the smallest number of vertices in a graph such that any orientation of the edges of contains every member of in the distance‐preserving way. We observe that the isometric Ramsey number of a finite family of finite acyclic digraphs is always finite, and present some bounds in special ...
Taras O. Banakh   +4 more
openaire   +3 more sources

Method for Generating Code Comments Based on Structure-aware Hybrid Encoding Model [PDF]

open access: yesJisuanji gongcheng, 2023
Code comments improve the readability of program codes, enhancing software development efficiency and reducing costs.Existing methods for code comment generation feed the sequence form or Abstract Syntax Tree(AST) form of a program code into encoder ...
CAI Ruichu, ZHANG Shengqiang, XU Boyan
doaj   +1 more source

Syntactic Structure-Enhanced Dual Graph Convolutional Network for Aspect-Level Sentiment Classification

open access: yesMathematics, 2023
Aspect-level sentiment classification (ALSC) is a fine-grained sentiment analysis task that aims to predict the sentiment of the given aspect in a sentence. Recent studies mainly focus on using the Graph Convolutional Networks (GCN) to deal with both the
Jiehai Chen   +4 more
doaj   +1 more source

COMPARATIVE ANALYSIS OF HUMAN INTERACTION PATTERN MINING APPROACHES [PDF]

open access: yesICTACT Journal on Soft Computing, 2020
Opinion Mining and Sentiment Analysis in Natural Language Processing (NLP) are challenging, as they require deep understanding. Understanding involves methods that could differentiate between the facts of explicit and implicit, regular and irregular ...
S Uma, J Suguna
doaj   +1 more source

Trees Contained in Every Orientation of a Graph

open access: yesThe Electronic Journal of Combinatorics, 2022
For every graph $G$, let $t(G)$ denote the largest integer $t$ such that every oriented tree of order $t$ appears in every orientation of $G$. In 1980, Burr conjectured that $t(G)\geq 1+\chi(G)/2$ for all $G$, and showed that $t(G)\geq 1+ \lfloor\sqrt{\chi(G)}\rfloor$; this bound remains the state of the art, apart from the multiplicative constant.
openaire   +1 more source

Home - About - Disclaimer - Privacy