Graph embedding

This paper introduces a novel framework, July, which serves the dual purpose of detecting vulnerable commits and localizing the root causes of the vulnerabilities. The fundamental concept of July is that the determinant of the vulnerability of a commit is the inherent meaning embedded in its changed code. For just-in-time vulnerability detection (JIT-VD), July represents each commit by a Code Transformation Graph and employs a Graph Neural Network model to capture their meanings and distinguish between vulnerable and non-vulnerable commits.

23p dianmotminh02 03-05-2024 3 1   Download

Optimal integration of transcriptomics data and associated spatial information is essential towards fully exploiting spatial transcriptomics to dissect tissue heterogeneity and map out intercellular communications.

15p vicwell 29-02-2024 5 2   Download

In this paper the representation of the embedding of a graph on a surface by a pair of permutations is considered. This representation is used to implement efficiently some algorithms for graphs.

16p vimulcahy 18-09-2023 7 3   Download

Part 1 of ebook "Handbook of Graph drawing and visualization" presents the following content: planarity testing and embedding; crossings and planarization; symmetric graph drawing; proximity drawings; tree drawing algorithms; planar straight-line drawing algorithms; planar orthogonal and polyline drawing algorithms; spine and radial drawings; circular drawing algorithms; rectangular drawing algorithms; simultaneous embedding of planar graphs; force-directed drawing algorithms;...

422p dieptieuung 14-07-2023 5 3   Download

The study sought to explore the use of deep learning techniques to measure the semantic relatedness between Unified Medical Language System (UMLS) concepts. Concept sentence embeddings were generated for UMLS concepts by applying the word embedding models BioWordVec and various flavors of BERT to concept sentences formed by concatenating UMLS terms.

9p vighostrider 25-05-2023 3 2   Download

Graph neural networks (GNNs) have achieved superior performance and gained significant interest in various domains. However, most of the existing GNNs are considered for homogeneous graphs, whereas real-world systems are usually modeled as heterogeneous graphs or heterogeneous information networks (HINs).

26p guernsey 28-12-2021 4 0   Download

Genome median and genome halving are combinatorial optimization problems that aim at reconstruction of ancestral genomes by minimizing the number of evolutionary events between them and genomes of the extant species.

11p vioklahoma2711 19-11-2020 9 1   Download

Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes.

11p viconnecticut2711 28-10-2020 16 1   Download

Protein-protein interactions (PPIs) are central to many biological processes. Considering that the experimental methods for identifying PPIs are time-consuming and expensive, it is important to develop automated computational methods to better predict PPIs.

16p vicolorado2711 22-10-2020 11 0   Download

Many studies prove that miRNAs have signifcant roles in diagnosing and treating complex human diseases. However, conventional biological experiments are too costly and time-consuming to identify unconfrmed miRNA-disease associations.

19p vicolorado2711 22-10-2020 11 0   Download

In this paper, we propose a new method to optimize the occupied memory of embedded software in the design phase based on DSL, T4 and Topological sort. A program is specified as a chain of tasks and the relationship between the tasks. The program is expressed by the dependence graph as a directed graph.

11p binhminhmuatrenngondoithonggio 09-06-2017 39 4   Download

Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich semantic knowledge sources (such as Wikipedia and WordNet) creates new opportunities to enhance the named entity disambiguation by developing algorithms which can exploit these knowledge sources at best. The problem is that these knowledge sources are heterogeneous and most of the semantic knowledge within them is embedded in complex structures, such as graphs and networks. ...

10p hongdo_1 12-04-2013 41 3   Download

We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer configurations) on a weighted, bipartite, doubly periodic graph G embedded in the plane. We derive explicit formulas for the surface tension and local Gibbs measure probabilities of these models. The answers involve a certain plane algebraic curve, which is the spectral curve of the Kasteleyn operator of the graph. For example, the surface tension is the Legendre dual of the Ronkin function of the spectral curve. The amoeba of the spectral curve represents the phase diagram of the dimer model.

39p noel_noel 17-01-2013 51 7   Download

The space of embedded minimal surfaces of fixed genus in a 3-manifold II; Multi-valued graphs in disks By Tobias H. Colding and William P. Minicozzi II* 0. Introduction This paper is the second in a series where we give a description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to understand the local structure in a ball and in particular the structure of an embedded minimal disk in a ball in R3 . We show here that if the curvature of such a disk...

25p tuanloccuoi 04-01-2013 47 6   Download

Cognitive maps have emerged as an important tool in modeling and decision making. In a nutshell they are signed di-graphs that capture the cause/effect relationships that subject matter experts believe exist in a problem space under consideration. Each node in the map represents some variable concept.

148p bi_bi1 11-07-2012 119 12   Download

EURASIP Journal on Applied Signal Processing 2003:6, 514–529 c 2003 Hindawi Publishing Corporation Memory-Optimized Software Synthesis from Dataflow Program Graphs with Large Size Data Samples Hyunok Oh The School of Electrical Engineering and Computer Science, Seoul National University, Seoul 151-742, Korea Email: oho@comp.snu.ac.kr Soonhoi Ha The School of Electrical Engineering and Computer Science, Seoul National University, Seoul 151-742, Korea Email: sha@comp.snu.ac.

16p sting12 10-03-2012 34 3   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài: Embedding a Forest in a Graph...

5p thulanh7 05-10-2011 49 1   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: On the connectivity of graphs embedded in surfaces II

27p lame_266 12-09-2011 49 3   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: Graph Color Extensions: When Hadwiger’s Conjecture and Embeddings Help

10p lame_266 12-09-2011 56 2   Download

Tuyển tập các báo cáo nghiên cứu khoa học trên tạp chí toán học quốc tế đề tài: Intersections of Randomly Embedded Sparse Graphs are Poisson Edward ...

10p thulanh4 10-09-2011 58 3   Download