The paper introduces the Cultural Leaf Semantic Portal whose aim is to provide a consolidated user-friendly solution for exploring the 36,132 Romanian artifacts and the 1,086 cultural entities that house them. Using t...
详细信息
With the modern city infrastructure and increasing number of subjects in the traffic environment, there is a need for increased number of parking places. As the parking place is usually not used for a whole day, it co...
详细信息
In recent years snake and insect attacks have become a huge problem worldwide. Most species have similar colors and shapes, which makes it hard to tell them apart using typical techniques. Similarly, identifying diffe...
详细信息
Children born after 2010 are labelled as members of Generation Alpha, who currently pursue their primary education. Gamification and game-based learning methodologies have gained popularity in the global education sec...
详细信息
Statistical models, enhanced by deep learning techniques, have become pivotal in various predictive tasks, including financial forecasting. This paper addresses the challenge of predicting cryptocurrency prices, utili...
详细信息
The field of population genetics attempts to advance our understanding of evolutionary processes. It has applications, for example, in medical research, wildlife conservation, and - in conjunction with recent advances...
详细信息
ISBN:
(纸本)9783959773409
The field of population genetics attempts to advance our understanding of evolutionary processes. It has applications, for example, in medical research, wildlife conservation, and - in conjunction with recent advances in ancient DNA sequencing technology - studying human migration patterns over the past few thousand years. The basic toolbox of population genetics includes genealogical trees, which describe the shared evolutionary history among individuals of the same species. They are calculated on the basis of genetic variations. However, in recombining organisms, a single tree is insufficient to describe the evolutionary history of the whole genome. Instead, a collection of correlated trees can be used, where each describes the evolutionary history of a consecutive region of the genome. The current corresponding state of-the-art data structure, tree sequences, compresses these genealogical trees via edit operations when moving from one tree to the next along the genome instead of storing the full, often redundant, description for each tree. We propose a new data structure, genealogical forests, which compresses the set of genealogical trees into a DAG. In this DAG identical subtrees that are shared across the input trees are encoded only once, thereby allowing for straight-forward memoization of intermediate results. Additionally, we provide a C++ implementation of our proposed data structure, called gfkit, which is 2.1 to 11.2 (median 4.0) times faster than the state-of-the-art tool on empirical and simulated datasets at computing important population genetics statistics such as the Allele Frequency Spectrum, Patterson's f, the Fixation Index, Tajima's D, pairwise Lowest Common Ancestors, and others. On Lowest Common Ancestor queries with more than two samples as input, gfkit scales asymptotically better than the state-of-the-art, and is thus up to 990 times faster. In conclusion, our proposed data structure compresses genealogical trees by storing shared subtree
High utility itemset mining (HUIM) is a well-known pattern mining technique. It considers the utility of the items that leads to finding high profit patterns which are more useful for real conditions. Handling large a...
详细信息
In this paper, based on the previous published work by Ke et al.(2019) and Li et al.(2022), by using the matrix splitting technique, generalized fixed point iteration method(GFPI) is established to solve the absolute ...
详细信息
In this paper, based on the previous published work by Ke et al.(2019) and Li et al.(2022), by using the matrix splitting technique, generalized fixed point iteration method(GFPI) is established to solve the absolute value equation(AVE). The proposed method not only includes SOR-like method, FPI method, MFPI method and so on, but also generates some special versions. Some convergence conditions of the proposed method with different iteration error norms are presented. Furthermore, methods corresponding to other splitting methods are studied in detail. The effectiveness and feasibility of the proposed method are confirmed by some numerical experiments.
The traditional English teaching mode generally consists of reciting words, phrases and texts with high intensity, mechanically memorizing grammar and doing a lot of exercises. This way not only causes the majority of...
详细信息
Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs. This article considers the fundamental and i...
详细信息
Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs. This article considers the fundamental and intensively studied problem of balanced hypergraph partitioning (BHP), which asks for partitioning the vertices into k disjoint blocks of bounded size while minimizing an objective function over the hyperedges. Here, we consider the two most commonly used objectives: the cut-net metric and the connectivity *** describe our open-source hypergraph partitioner KaHyPar which is based on the successful multi-level approach - driving it to the extreme of using one level for (almost) every vertex. Using carefully designed data structures and dynamic update techniques, this approach turns out to have a very good time-quality tradeoff. We present two preprocessing techniques - pin sparsification using locality-sensitive hashing (LSH) and community detection based on the Louvain algorithm. The community structure is used to guide the coarsening process that incrementally contracts vertices. Portfolio-based partitioning of the contracted hypergraph then already achieves a good initial solution. While reversing the contraction process, a combination of several refinement techniques achieves a good final partitioning. In particular, we support a highly-localized local search that can directly produce a k-way partitioning and complement this with flow-based techniques that take a more global view. Optionally, a memetic algorithm evolves a pool of solution candidates to an overall good *** evaluate KaHyPar for a large set of instances from a wide range of application domains. With respect to quality, KaHyPar outperforms all previously considered systems that can handle large hypergraphs such as hMETIS, PaToH, Mondriaan, or Zoltan. Somewhat surprisingly, to some extend, this even extends to graph partitioners such as KaHIP when considering the special case
暂无评论