Abstract: A list of elements in a set of elements is matched by means of regular expressions that define respective groups of elements in the set by approximately matching by means of the regular expressions the list of elements by locating recurrences of the regular expressions in the list of elements with a maximum number of matching errors. The matching errors correspond to insertions deriving from the superposition of groups of elements related to different regular expressions. Each time the recurrence of one regular expression is located in the list, the group of elements defined by the regular expression thus located is removed from the list, while leaving in the list those elements corresponding to errors. The approximate matching can be performed by representing each regular expression in terms of Glushkov automata. The method is applicable, e.g.

Abstract: A methodology for assisting a user in a combination of objects, e.g. functional blocks, through an intuitive user interface which can simulate effect of magnets, and including: representing a high affinity degree between two blocks in a magnetic-like style as a simulated attraction giving a feedback to the user. Such attraction feedback can be represented in different ways, from a simple visual representation to a proper mechanical feedback conveyed to the user through the input device used for making the block selection, e.g. a mouse, a track point, or a joystick.

Abstract: A methodology for assisting a user in a combination of objects, e.g. functional blocks, through an intuitive user interface which can simulate effect of magnets, and including: representing a high affinity degree between two blocks in a magnetic-like style as a simulated attraction giving a feedback to the user. Such attraction feedback can be represented in different ways, from a simple visual representation to a proper mechanical feedback conveyed to the user through the input device used for making the block selection, e.g. a mouse, a track point, or a joystick.

Abstract: A method and system for managing resources in telecommunications services and networks. The method and system regard execution of processes by distributed agents on processing machines to perform predetermined tasks on the network, and are characterized by setting target data including goals on processes and constraints on resource utilization to be met by the system; monitoring computational resources utilization and processes execution by agents, and collecting performance data representative of resource utilization and process execution; comparing the collected performance data with the set data, a penalty being established when performance data do not fulfill target data; and re-allocating resources for process execution by agents so as to minimize the penalty determined on the basis of the comparison.

Abstract: A system for automatic generation of workflow models related to interventions performed on equipment included in a communication network having associated resource proxy agents each providing a representation of the status of corresponding network equipment according to a given data model. The system includes a set of recorder agents, and the resource proxy agents are configured to send to the recorder agents information signals representative of events in the status of the corresponding network equipment triggered by manual activities or commands, such as, commands input by operators and performed on the network equipment. The system is configured to analyze the information signals sent to the respective recorder agents to produce therefrom workflow models of the manual activities or commands performed on the network equipment.

Abstract: A system for automatic generation of workflow models related to interventions performed on equipment included in a communication network having associated resource proxy agents each providing a representation of the status of corresponding network equipment according to a given data model. The system includes a set of recorder agents, and the resource proxy agents are configured to send to the recorder agents information signals representative of events in the status of the corresponding network equipment triggered by manual activities or commands, such as, commands input by operators and performed on the network equipment. The system is configured to analyze the information signals sent to the respective recorder agents to produce therefrom workflow models of the manual activities or commands performed on the network equipment.

Abstract: A method and system for managing resources in telecommunications services and networks. The method and system regard execution of processes by distributed agents on processing machines to perform predetermined tasks on the network, and are characterized by setting target data including goals on processes and constraints on resource utilization to be met by the system; monitoring computational resources utilization and processes execution by agents, and collecting performance data representative of resource utilization and process execution; comparing the collected performance data with the set data, a penalty being established when performance data do not fulfill target data; and re-allocating resources for process execution by agents so as to minimize the penalty determined on the basis of the comparison.

Abstract: A list of elements in a set of elements is matched by means of regular expressions that define respective groups of elements in the set by approximately matching by means of the regular expressions the list of elements by locating recurrences of the regular expressions in the list of elements with a maximum number of matching errors. The matching errors correspond to insertions deriving from the superposition of groups of elements related to different regular expressions. Each time the recurrence of one regular expression is located in the list, the group of elements defined by the regular expression thus located is removed from the list, while leaving in the list those elements corresponding to errors. The approximate matching can be performed by representing each regular expression in terms of Glushkov automata. The method is applicable, e.g.