This paper examines the average age minimization problem where only a fraction of network users can transmit simultaneously over unreliable channels. Finding optimal scheduling scheme, in this case, is known to be challenging. Accordingly, Whittle’s index policy was proposed literature as low-complexity heuristic problem. Although simple implement, characterizing policy’s performance recognized...

In this article, we consider the average age minimization problem where a central entity schedules M users among N available for transmission over unreliable channels. It is well-known that obtaining optimal policy, in case, difficult task. Accordingly, Whittle's index policy has been suggested earlier works as heuristic problem. However, analysis of its performance remained elusive. sequel, ov...

A multi-objective heuristic particle swarm optimiser (MOHPSO) based on Pareto multi-objective theory is proposed to solve multi-objective optimality problems. The optimality objectives are the roof displacement and structure weight. Two types of structure are analysed in this paper, a truss structure and a framework structure. Performance-based seismic analysis, such as classical and modal push...

A derived graph is a obtained from given according to some predetermined rules. Two of the most frequently used graphs are line and total graph. Calculating properties helps calculate same original For this reason, relations between its always welcomed. recently introduced index which also acts as invariant called omega obtain such for graphs. As an illustrative exercise, values number faces cl...