Recognizing sparse perfect elimination bipartite graphs [PDF]
When applying Gaussian elimination to a sparse matrix, it is desirable to avoid turning zeros into non-zeros to preserve the sparsity. The class of perfect elimination bipartite graphs is closely related to square matrices that Gaussian elimination can ...
Bomhoff, Matthijs
core +6 more sources
Geographic variation in walking activity in the red flour beetle Tribolium castaneum
This study examined whether there is geographic variation in field populations, focusing on the moving activity in the red flour beetle Tribolium castaneum. Results showed significant differences in moving activity among field populations but no correlation with latitude or meteorological factors.
Kentarou Matsumura
wiley +1 more source
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers
Data structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications.
Wei-Chang Yeh, Majid Forghani-elahabad
doaj +1 more source
Prototype implementation of segment assembling software [PDF]
IT education is very important and a lot of effort is put into the development of tools for helping students to acquire programming knowledge and for helping teachers in automating the examination process. This paper describes a prototype of the
Pešić Đorđe+3 more
doaj +1 more source
Region-wide temporal and spatial variation in Caribbean reef architecture: is coral cover the whole story? [PDF]
The architectural complexity of coral reefs is largely generated by reef-building corals, yet the effects of current regional-scale declines in coral cover on reef complexity are poorly understood.
Alvarez-Filip+51 more
core +1 more source
occumb: An R package for site occupancy modeling of eDNA metabarcoding data
This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley +1 more source
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game [PDF]
We propose to use the new methodology for solving the complete and perfect information bimatrix game. To solve the games of these type we construct the incomplete and imperfect information game generated by the informational extended strategies.
Boris Hancu, Anatolie Gladei
doaj
A Comprehensive Evaluation of Graph Kernels for Unattributed Graphs
Graph kernels are of vital importance in the field of graph comparison and classification. However, how to compare and evaluate graph kernels and how to choose an optimal kernel for a practical classification problem remain open problems.
Yi Zhang, Lulu Wang, Liandong Wang
doaj +1 more source
Relation is an option for processing context information
Attention mechanisms are one of the most frequently used architectures in the development of artificial intelligence because they can process contextual information efficiently.
Kazunori D Yamada+4 more
doaj +1 more source
Robust Flows over Time: Models and Complexity Results
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a certain ...
Gottschalk, Corinna+5 more
core +1 more source