let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

hyperspectral sensors provide a large number of spectral bands. this massive and complex data structure of hyperspectral images presents a challenge to traditional data processing techniques. therefore, reducing the dimensionality of hyperspectral images without losing important information is a very important issue for the remote sensing community. we propose to use overlap-based feature weigh...

‎there are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{z}_{2}$ or $mathbb{z}_{15}$. still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of sylow $p$-subgroups for each prime $p$, etc. in this...

in this paper‎, ‎we give a complete proof of theorem 4.1(ii) and a new‎ ‎elementary proof of theorem 4.1(i) in [li and shen‎, ‎on the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ j‎. ‎algebra, ‎323  (2010) 1349--1357]‎. ‎in addition‎, ‎we also give a generalization of baer's theorem‎.

We study the new task of class-incremental Novel Class Discovery (class-iNCD), which refers to problem discovering novel categories in an unlabelled data set by leveraging a pre-trained model that has been trained on labelled containing disjoint yet related categories. Apart from classes, we also aim at preserving ability recognize previously seen base Inspired rehearsal-based incremental learn...