An unbiased scene graph generation (SGG) algorithm referred to as Skew Class-Balanced Re-Weighting (SCR) is proposed for considering the predicate prediction caused by long-tailed distribution. The prior works focus mainly on alleviating deteriorating performances of minority predictions, showing drastic dropping recall scores, i.e., losing majority performances. It has not yet correctly analyz...

A graph G is locally irregular if every two adjacent vertices of G have different degrees. A locally irregular decomposition of G is a partition E1, ..., Ek of E(G) such that each G[Ei] is locally irregular. Not all graphs admit locally irregular decompositions, but for those who are decomposable, in that sense, it was conjectured by Baudon, Bensmail, Przyby lo and Woźniak that they decompose i...

In this paper, the concept of v-filters on lattice implication algebras is introduced by linking the Vague set and filter theory of lattice implication algebras; The properties and equivalent characterizations of v-filters are investigated; The relations between v-filters and filters are studied.

In this paper, we study Lefschetz properties of Artinian reductions of Stanley–Reisner rings of balanced simplicial 3-polytopes. A (d − 1)-dimensional simplicial complex is said to be balanced if its graph is d-colorable. If a simplicial complex is balanced, then its Stanley–Reisner ring has a special system of parameters induced by the coloring. We prove that the Artinian reduction of the Stan...

Let G = (V, E) be a simple graph. A vertex labeling f : V → {0, 1} induces a partial edge labeling f ∗ : E → {0, 1} defined by f ∗(uv) = f(u) 84 KWONG, LEE, LO, SU AND WANG if and only if f(u) = f(v). For i = 0, 1, let vf(i) = |{v ∈ V : f(v) = i}|, and ef (i) = |{e ∈ E : f ∗(e) = i}|. A graph G is uniformly balanced if |ef (0)−ef (1)| ≤ 1 for any vertex labeling f that satisfies |vf(0)−vf (1)| ...

Contemporary data is often supported by an irregular structure, which can be conveniently captured by a graph. Accounting for this graph support is crucial to analyze the data, leading to an area known as graph signal processing (GSP). The two most important tools in GSP are the graph shift operator (GSO), which is a sparse matrix accounting for the topology of the graph, and the graph Fourier ...