# Raffaele Mascella

• 2013 36th International Conference on…
• 2013
The optimal control of parameters in a system assumes an important role in industrial processes. Models based on boiler-turbine plant are proposed in various applications. The target of this paper is to apply intelligent techniques on a boiler simulator to improve the speed and precision of control. In order to release such task, genetic-fuzzy controllers(More)
• Algorithms
• 2017
The choice of the best optimization algorithm is a hard issue, and it sometime depends on specific problem. The Gravitational Search Algorithm (GSA) is a search algorithm based on the law of gravity, which states that each particle attracts every other particle with a force called gravitational force. Some revised versions of GSA have been proposed by using(More)
• Proceedings. International Symposium on…
• 2005
A symbol permutation invariant balanced (SPI-balanced) code over the alphabet ZZ<sub>m</sub> = {0, 1,....,m - 1} is a block code over ZZ <sub>m</sub> such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason every permutation among the symbols of the alphabet changes a SPI-balanced code into a SPI-balanced(More)
• IEEE Transactions on Information Theory
• 2006
Let /spl Phi//sub m//spl sube/ /spl Copf/ be the set of all mth roots of unity, m/spl isin/ IN. A balanced code over /spl Phi//sub m/ is a block code over the alphabet /spl Phi//sub m/ such that each code word is balanced; that is, the complex sum of its components (or weight) is equal to 0. Let B/sub m/(n) be the set of all balanced words of length n over(More)
Drum Boilers are an important component of many modern industrial facilities. Generally, the simulation of tailormade Drum Boilers starts up at each steady-state condition inside each operation region. The problem of such systems is the control of parameters, as level and pressure, around a reference value. The design of control algorithms can be(More)
• IEEE Transactions on Information Theory
• 2016
A new efficient design of second-order spectralnull (2-OSN) codes is presented. The new codes are obtained by applying the technique used to design parallel decoding balanced (i.e., 1-OSN) codes to the random walk method introduced by some of the authors for designing 2-OSN codes. This gives new non-recursive efficient code designs, which are less redundant(More)
• 2013 IEEE International Symposium on Information…
• 2013
A new efficient coding scheme is given for second-order spectral-null (2-OSN) codes. The new method applies the Knuth's optimal parallel decoding scheme for balanced (i.e., 1-OSN) codes to the random walk method introduced by Tallini and Bose to design 2-OSN codes. If k &#x2208; IN is the length of a 1-OSN code then the new 2-OSN coding scheme has length n(More)
• 1