Graph partition

Ebook Introduction to Software Testing presents software testing as a practical engineering activity, essential to producing high-quality software. It is designed to be used as the primary textbook in either an undergraduate or graduate course on software testing, as a supplement to a general course on software engineering or data structures, and as a resource for software test engineers and developers.

346p zizaybay1103 29-05-2024 3 2   Download

Lecture Compiler construction: Lesson 43 - Sohail Aslam. The main topics covered in this chapter include: control flow graph - CFG, basic blocks, sequence of consecutive statements with single entry/single exit, generating CFGs, algorithm partition into basic blocks, basic block code generation,...

31p youzhangjing_1909 28-04-2022 14 1   Download

Single-cell RNA-seq quantifies biological heterogeneity across both discrete cell types and continuous cell transitions. Partition-based graph abstraction (PAGA) provides an interpretable graph-like map of the arising data manifold, based on estimating connectivity of manifold partitions (https://github.com/theislab/paga).

9p vigalileogalilei 27-02-2022 14 1   Download

We describe a methodology for partitioning scRNA-seq datasets into metacells: disjoint and homogenous groups of profiles that could have been resampled from the same cell. Unlike clustering analysis, our algorithm specializes at obtaining granular as opposed to maximal groups.

19p vielonmusk 30-01-2022 12 0   Download

Lecture UML based modeling and analysis: Detailing use cases scenarios and workflows present the content: main success scenario, other scenarios (successes or failures), user management, register user, organization of use case models, UML 2.0 activity diagrams, process order, data flow and control flow, dataflow networks, partitioning of activities,...

21p bachkhinhdaluu 03-12-2021 18 0   Download

This approach yields a 70–80% improvement in intra-network communication, which is comparable to other methods, namely Ja-be-Ja, that offers similar results but has higher computational demands.

18p trinhthamhodang11 04-05-2021 12 1   Download

Identification of transcription factor binding sites (also called ‘motif discovery’) in DNA sequences is a basic step in understanding genetic regulation. Although many successful programs have been developed, the problem is far from being solved on account of diversity in gene expression/regulation and the low specificity of binding sites.

14p viwyoming2711 16-12-2020 18 1   Download

In our proposed system, introduced new meta heuristic algorithm to perform the load balancing. The Ant Colony Optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.

7p hongnhan878 12-04-2019 27 1   Download

A graph G = (V, E) is r-equitably k-colorable if there exists a partition of V into k independent sets V1, V2, · · · , Vk such that | |Vi| − |Vj | | ≤ r for all i, j ∈ {1, 2, · · · , k}. In this note, we show that if two trees T1 and T2 of order at least two are r-equitably k-colorable for r ≥ 1 and k ≥ 3, then all trees obtained by adding an arbitrary edge between T1 and T2 are also r-equitably k-colorable.

6p vinguyentuongdanh 19-12-2018 15 0   Download

Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: Generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems.

12p vinguyentuongdanh 19-12-2018 35 2   Download

In this paper we consider the well known p-median problem. We introduce a new large neighborhood based on ideas of S.Lin and B.W. Kernighan for the graph partition problem. We study the behavior of the local improvement and Ant Colony algorithms with new neighborhood. Computational experiments show that the local improvement algorithm with the neighborhood is fast and finds feasible solutions with small relative error. The Ant Colony algorithm with new neighborhood as a rule finds an optimal solution for computationally difficult test instances.

11p vinguyentuongdanh 20-12-2018 31 2   Download

Cluster analysis is an unsupervised technique of grouping related objects without considering their label or class. The objects belonging to the same cluster are relatively more homogeneous in comparison with other clusters. The application of cluster analysis is in areas like gene expression analysis, galaxy formation, natural language processing and image segmentation etc.

12p dieutringuyen 07-06-2017 34 2   Download

(bq) part 2 book "computational geometry - algorithms and applications" has contents: delaunay triangulations, more geometric data structures, convex hulls, binary space partitions, robot motion planning, quadtrees, visibility graphs, simplex range searching.

196p bautroibinhyen20 06-03-2017 77 4   Download

In this chapter, we examine some of the most important classes of labelled objects, including surjections, set partitions, permutations, as well as labelled graphs, trees, and mappings from a finite set into itself. Certain aspects of words can also be treated by this theory, a fact which has important consequences not only in combinatorics itself but also in probability and statistics.

81p allbymyself_08 22-02-2016 43 3   Download

Lecture Algorithm design - Chapter 8 include all of the following: Poly-time reductions, packing and covering problems, constraint satisfaction problems, sequencing problems, partitioning problems, graph coloring, numerical problems.

76p youcanletgo_03 14-01-2016 50 3   Download

7.4. SCALE-FREE NETWORKS 181 systematically disabling hubs should quickly partition a network into several disjoint components, a highly undesirable situation. To illustrate these matters, Figure 7.12 shows what happens when we systematically remove vertices from a scale-free graph in comparison to removing the best-connected vertices from an ER random graph. We also show the effect of removing randomly selected vertices from a scale-free graph (which is very similar to randomly removing vertices from an ER graph).

1p ringphone 06-05-2013 57 2   Download

An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of different tags is generated by the method itself. We compute and merge two partitionings of word graphs: one based on context similarity of high frequency words, another on log-likelihood statistics for words of lower frequencies. Using the resulting word clusters as a lexicon, a Viterbi POS tagger is trained, which is refined by a morphological component. ...

6p hongvang_1 16-04-2013 60 1   Download

We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes the normalized cut criterion. Our approach moves beyond localized comparisons and takes into account longrange cohesion dependencies. Our results demonstrate that global analysis improves the segmentation accuracy and is robust in the presence of speech recognition errors.

8p hongvang_1 16-04-2013 51 1   Download

Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semantic uses and therefore aid in deciding compositionality. We propose an unsupervised system to explore this hypothesis on compound nominals, proper names and adjective-noun constructions, and evaluate the contribution of sense induction. The evaluation set is derived from WordNet in a semisupervised way. Graph connectivity measures are employed for unsupervised parameter tuning. ...

4p hongphan_1 15-04-2013 52 1   Download

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article RRES: A Novel Approach to the Partitioning Problem for a Typical Subset of System Graphs

13p sting10 24-02-2012 46 4   Download