Salvatore Cavalieri

Learn More
The paper deals with the problem of fault tolerance in a multilayer perceptron network. Although it already possesses a reasonable fault tolerance capability, it may be insufficient in particularly critical applications. Studies carried out by the authors have shown that the traditional backpropagation learning algorithm may entail the presence of a certain(More)
The widespread use of standard, worldwide and vendor-independent OPC UA specifications in industrial environment introduces many benefits as it allows to keep open the market of the industrial applications. On the other hand, OPC UA adopts a very complex software infrastructure to realise the data exchange between industrial applications and devices (e.g.(More)
This paper presents the use of Hopfield-type neural networks for process scheduling in the area of factory automation, where bus-based communication systems, called FieldBuses, are widely used to connect sensors and actuators to the control systems. We show how it overcomes the problem of the computational complexity of the algorithmic solution. The neural(More)
BACKGROUND Malignant melanoma is an aggressive tumor of the skin and seems to be resistant to current therapeutic approaches. Melanocytic transformation is thought to occur by sequential accumulation of genetic and molecular alterations able to activate the Ras/Raf/MEK/ERK (MAPK) and/or the PI3K/AKT (AKT) signalling pathways. Specifically, mutations of(More)
This paper deals with the problem of information flow scheduling in a communication system based on CAN ISO IS-11898 physical medium access mechanism. It mainly features a bus access arbitration protocol based on a priority assigned to each message to be transmitted; if two or more messages are transmitted at the same time by different communication nodes,(More)
-Recurrent stable neural networks seems to represent an mteresting alternattve to classical algortthms for the search for optimal paths in a graph In this paper a Hopfield neural network ts adopted to solve the problem of findmg the shortest path between two nodes of a graph. The results obtained point out the validtty of the solution proposed and tts(More)