Construction of a graph

In this paper, we propose to use the combination of Imaging Graph Neural Network With Defined Pattern to detect vulnerabilities in smart contracts. We construct a contract graph that shows the relationship between the main components in a smart contract.

10p visystrom 22-11-2023 6 5   Download

This paper suggests a solution to multi-connectivity deployment WSN coverage based on combining Sailfish optimizer (SFO) with the characteristic of 3D surface topography. The target area divided into mesh grids of a size to establish the multiconnectivity of every grid. The cover set constructed through the direction gradient probabilistic model and connected graph and the joint points to graph within the grid by optimizing SFO.

9p linyanjun_2408 21-04-2022 11 3   Download

Most gene prediction methods detect coding sequences from transcriptome assemblies in the absence of closely related reference genomes. Such methods are of limited application due to high transcript fragmentation and extensive assembly errors, which may lead to redundant or false coding sequence predictions.

12p vialfrednobel 29-01-2022 13 0   Download

In this paper, we defined a new graph labelling and named it as closed divisor graph. Let G = (V, E) be a finite undirected (nonempty) graph. A graph G is said to be a closed divisor graph if there exists a vertex labeling using a set S of positive integers, called a quotients of G, such that two vertices are adjacent if and only if one vertex divides the other and their quotient is in the set S. In this paper, we study the properties of closed divisor graph and construct closed divisor labeling for several basic simple graphs and special graphs.

13p nguaconbaynhay11 07-04-2021 9 1   Download

This paper proposes a computational model of topic trust being constructed from users similarity and levels of their interaction. It is defined as function of similarity degrees in interests and levels of interaction in topics among users. Based on this model, we may estimate trustworthy values among peers in all cases with some direct and indirect interaction or without any interaction. The proposed approach may overcome limitation in the high computational cost of propagation methods based on graph models.

8p trinhthamhodang9 10-12-2020 15 1   Download

Chapter 1A - Graphs and their meaning. This appendix helps in understanding graphs, curves, and slopes as they relate to economics. It demonstrates how relationships between variables can be examined and how an equation that expresses that relationship can be derived.

12p nanhankhuoctai10 23-07-2020 15 1   Download

The present experiment was carried out using twenty-nine elite breeding lines from Station Yield Trial - Slender Grain materials along with three check varieties at the Rice Research Station, O.U.A.T., Bhubaneswar in kharif- 2016. A part of the research was to study the genetic divergence among the breeding lines used in the experiment. The D2 values obtained from the divergence study ranged from 3.36 between OR2675-6-4 and OR2676-2-5 to 2518 between OR2675-2-1 and Samba mahsuri.

8p nguathienthan3 27-02-2020 14 0   Download

Let E be a directed graph, K a field and LK(E) the Leavitt path algebra of E over K. The goal of this paper is to describe the structure of a class of corners of Leavitt path algebras LK(E). The motivation of this work comes from the paper “Corners of Graph Algebras” of Tyrone Crisp in which such corners of graph C*-algebras were investigated completely.

7p elandorr 03-12-2019 18 2   Download

The p-center problem is to locate p facilities in a network so as to minimize the longest distance between a demand point and its nearest facility. In this paper, we give a construction on a graph G which produces an infinite ascending chain G=G0≤G1≤ G2 ≤ ... of graphs containing G such that given any optimal solution X for the p-center problem on G , X is an optimal solution for the p-center problem on Gi for any i ≥ 1.

6p vinguyentuongdanh 19-12-2018 19 3   Download

The problem of finding a fundamental cycle basis with minimum total cost in a graph arises in many application fields. In this paper we present some integer linear programming formulations and we compare their performances, in terms of instance size, CPU time required for the solution, and quality of the associated lower bound derived by solving the corresponding continuous relaxations.

10p vinguyentuongdanh 20-12-2018 15 0   Download

The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs.

8p vinguyentuongdanh 20-12-2018 45 0   Download

Chapter 1 (Appendix) - Limits, alternatives, and choices. This chapter presents the following content: Construction of a graph, direct and inverse relationships, slope of a line, equation of a linear relationship, equation of a line, slope of a nonlinear curve.

14p hihihaha5 03-01-2017 48 2   Download

We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a post-processing step. This alleviates error propagation, since undirected parsers do not need to observe the single-head constraint. Undirected parsers can be obtained by simplifying existing transition-based parsers satisfying certain conditions.

11p bunthai_1 06-05-2013 40 2   Download

We describe a novel method that extracts paraphrases from a bitext, for both the source and target languages. In order to reduce the search space, we decompose the phrase-table into sub-phrase-tables and construct separate clusters for source and target phrases. We convert the clusters into graphs, add smoothing/syntacticinformation-carrier vertices, and compute the similarity between phrases with a random walk-based measure, the commute time.

10p bunthai_1 06-05-2013 43 3   Download

We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic constructions to be adequately represented, and efficiency, i.e. whether they reduce the search space for the parser. In particular, we define a new measure for the degree of non-projectivity in an acyclic dependency graph obeying the single-head constraint. The constraints are evaluated experimentally using data from the Prague Dependency Treebank and the Danish Dependency Treebank. ...

8p bunthai_1 06-05-2013 39 3   Download

The resulting graph is a nucleus for constructing models of possible worlds in which the sentence is true. • Laws of the world behave like demons or triggers thai monitor the models and block illegal extensions. • If a surface model could be extended infinitely deep, the result would be a complete standard model. This approach leads to an infinite sequence of algorithms ranging from plausible inference to exact deduction; they are analogous to the varying levels of search in game playing programs. ...

6p bungio_1 03-05-2013 36 2   Download

Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions considered in this paper are the possibly quantified first-order formulae obtained from a signature of features and sorts. We establish a complete firstorder theory F T by means of three axiom schemes and construct three elementarily equivalent models. One of the models consists of so-called feature graphs, a data structure common in computational linguistics. ...

8p bunmoc_1 20-04-2013 34 1   Download

In this paper I will consider parsing as a discrete combinatorial problem which consists in constructing a labeled graph that satisfies a set of linguistic constraints. I will identify some properties of linguistic constraints which allow this problem to be solved efficiently using constraint satisfaction algorithms. I then describe briefly a modular parsing algorithm which constructs a syntactic graph using a set of generative operations and applies a filtering algorithm to eliminate inconsistent nodes and edges. ...

2p bunmoc_1 20-04-2013 39 1   Download

This paper describes methods for relating (threading) multiple newspaper articles, and for visualizing various characteristics of them by using a directed graph. A set of articles is represented by a set of word vectors, and the similarity between the vectors is then calculated. The graph is constructed from the similarity matrix. By applying some constraints on the chronological ordering of articles, an efficient threading algorithm that runs in O(n) time (where n is the number of articles) is obtained. ...

7p bunrieu_1 18-04-2013 51 3   Download

We demonstrate TextRank – a system for unsupervised extractive summarization that relies on the application of iterative graphbased ranking algorithms to graphs encoding the cohesive structure of a text. An important characteristic of the system is that it does not rely on any language-specific knowledge resources or any manually constructed training data, and thus it is highly portable to new languages or domains.

4p bunbo_1 17-04-2013 52 1   Download