a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the center of such...

in this paper, we investigate the delay-dependent robust stability of fuzzy cohen-grossberg neural networks with markovian jumping parameter and mixed time varying delays by delay decomposition method. a new lyapunov-krasovskii functional (lkf) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...

Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...

The error of the finite element solution of linear elliptic problems can be estimated a posteriori by the classical hypercircle method. This method gives accurate and guaranteed upper bound of the error measured in the energy norm. The disadvantage is that a global dual problem has to be solved, which is quite time-consuming. Combining the hypercircle method with the equilibrated residual metho...

| A convex upper bound of the mixed structured singular value is analyzed. The upper bound is based on a multiplier method. It is simple, it can exploit low-rank properties and it is shown to be less conservative than the well-known (D; G)-scaling. A direct relationship with (D; G)-scaling is given. The upper bound can be modiied to one that is continuous with an explicit Lipschitz constant. Ke...