Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

Recent measurements of cosmic-ray electron and positron fluxes by PAMELA and ATIC experiments may indicate the existence of annihilating dark matter with large annihilation cross section. We discuss its possible relation to other astrophysical/cosmological observations : gamma-rays, neutrinos, and big-bang nucleosynthesis. It is shown that they give stringent constraints on some annihilating da...

Let G be a digraph with n vertices and let A(G) be its adjacency matrix. A monic polynomial f (x) of degree at most n is called an annihilating polynomial of G if f (A(G)) = 0. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. Difans and diwheels are two classes of annihilatingly unique digraphs. In this paper, it is shown that the complete product of difan...

Spiking neural P systems with anti-spikes (ASN P systems, for short) are a variant of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, the spikes and anti-spikes will immediately annihilate each other in a maximal way. In this work, we consider a restrict...

Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similari...