Efficiency represents an important parameter that characterizes a mechanism or a machine. This value gives fundamental information about the energy that is lost during the process. Machines or mechanisms can be combined in order to build a more complex system. For example, they can be arranged as a series or as a parallel layout. For these cases, the efficiency can be easily evaluated. However, in general, the configuration is more complicated and a true evaluation of the efficiency becomes rather difficult. For this reason, this paper suggests a possible algorithm, based on graph theory, for the closed form symbolic computation of the efficiency of complex systems. One interesting feature of the algorithm consists in the possibility of applying the method to those systems which embeds one or more power circulation loops. As a requirement, it is assumed that the system to be analyzed can be represented by a group of blocks and a group of flows between the blocks. © 2013 IEEE.
Closed-form symbolic computation of the global efficiency of complex systems by means of digraphs / BELFIORE, Nicola Pio. - STAMPA. - (2013), pp. 219-224. (Intervento presentato al convegno IEEE 9th International Conference on Computational Cybernetics, ICCC 2013 tenutosi a Tihany; Hungary nel 8 July 2013 through 10 July 2013) [10.1109/icccyb.2013.6617591].
Closed-form symbolic computation of the global efficiency of complex systems by means of digraphs
BELFIORE, Nicola Pio
2013
Abstract
Efficiency represents an important parameter that characterizes a mechanism or a machine. This value gives fundamental information about the energy that is lost during the process. Machines or mechanisms can be combined in order to build a more complex system. For example, they can be arranged as a series or as a parallel layout. For these cases, the efficiency can be easily evaluated. However, in general, the configuration is more complicated and a true evaluation of the efficiency becomes rather difficult. For this reason, this paper suggests a possible algorithm, based on graph theory, for the closed form symbolic computation of the efficiency of complex systems. One interesting feature of the algorithm consists in the possibility of applying the method to those systems which embeds one or more power circulation loops. As a requirement, it is assumed that the system to be analyzed can be represented by a group of blocks and a group of flows between the blocks. © 2013 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.