Abstract: This article mainly addresses the stabilization issue of discrete-time interval type-2 fuzzy (IT-2F) semi-Markov jump systems in the presence of denial-of-service attacks by means of ...

Abstract: Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic ...

This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book ...

Big O notation is a powerful tool used in computer science to describe the time complexity or space complexity of algorithms. Big-O is a way to express the upper bound of an algorithm’s time or space ...

Mathematics is the universal language of science while computer science is the study of the hardware and algorithms that are used in modern computer systems. Since many of the early pioneers of ...

Du, L. Xu and X. M. Yuan, The parameterized integral inequalities involving twice-differentiable generalized n -polynomial convexity under the framework of fractal domains and its applications, ...