An element a of a semigroup algebra F[S] over a field F is called a right annihilating element of F[S] if xa = 0 for every x ∈ F[S], where 0 denotes the zero of F[S]. The set of all right annihilating elements of F[S] is called the right annihilator of F[S]. In this paper we show that, for an arbitrary field F, if a finite semigroup S is a direct product or semilattice or right zero semigroup o...

*From exact enumeration data, our purpose is to determine the asymptotics of the underlying generating function, or, in ideal circumstances, conjecture an exact solution. A variety of numerical techniques for achieving these purposes is discussed. The majority of the techniques assume that a linear ODE with polynomial coefficients provides either a locally good approximation, or an exact soluti...

Question answering, the identification of short accurate answers to users questions, is a longstanding challenge widely studied over the last decades in the opendomain. However, it still requires further efforts in the biomedical domain. In this paper, we describe our participation in phase B of task 5b in the 2017 BioASQ challenge using our biomedical question answering system. Our system, dea...

In this paper we continue to study the strongly annihilating-submodule graph. addition providing more properties of graph, compare extensively graph with

Gu map-1 is a modified version of GGH map. It uses same ideal lattices for constructing the trapdoors, while the novelty is that no encodings of zero are given. In this short paper we show that Gu map-1 cannot be used for the instance of witness encryption (WE) based on the hardness of 3-exact cover problem. That is, if Gu map-1 is used for such instance, we can break it by soving a combined 3-...