An algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.

The paper presents results of energy analysis, complemented with an exergy balance, of hierarchical thermodynamic cycle. Proposed cycle is a binary vapour cycle based on a model of real supercritical steam power plant. Energy analysis is used to preliminary optimization of the cycle and the exergy losses analysis is proposed to perform optimization of heat transfer processes, which are essential for hierarchical cycles. Proposed...

Pulse width modulation (PWM) of inverter output voltage causes the waveforms of motor phase cur-rents to consist of distinctive ripples. In order to provide suitable feedback for the motor current con-trollers, the mean value must be extracted from the currents’ waveforms in every PWM cycle. A com-mon solution to derive the mean phase currents is to sample their value at the midpoint of a symmetrical PWM cycle. Using an assumption...