Abstract: A method for operating a distributed computing system includes transmitting, by a first node in a first level to an intermediate node in a second level, a first message and storing, by the first node, the first message. The method further includes receiving, by the intermediate node, the first message, generating a second message, and transmitting, to a third node, the second message. The method additionally includes receiving, by the intermediate node from the third node, a first acknowledgement message indicating that the second message was successfully received by the third node, and transmitting, by the intermediate node to the first node after receiving the first acknowledgement message, a second acknowledgement message. The method includes deleting, by the first node in response to receiving the second acknowledgment message, the stored first message.

Abstract: A method for operating a distributed computing system includes transmitting, by a first node in a first level to an intermediate node in a second level, a first message and storing, by the first node, the first message. The method further includes receiving, by the intermediate node, the first message, generating a second message, and transmitting, to a third node, the second message. The method additionally includes receiving, by the intermediate node from the third node, a first acknowledgement message indicating that the second message was successfully received by the third node, and transmitting, by the intermediate node to the first node after receiving the first acknowledgement message, a second acknowledgement message. The method includes deleting, by the first node in response to receiving the second acknowledgment message, the stored first message.

Abstract: A method for analyzing a data flow includes: (a) extracting packet information of a packet, (b) determining a status of the packet based on the extracted packet information by applying at least one probabilistic filter to the packet and storing the packet for later inspection based on the status of the packet indicating that the packet is out-of sequence, and (c) inspecting the stored packet based on inspection rules. Upon a partial match of an inspection rule with the extracted packet information, a result of the inspection is temporarily stored. Already stored packets are inspected based on the already stored packets being in-order with already inspected packets. Upon a total match of at least one of the inspection rules, a predetermined action is performed and the stored result is deleted. The at least one probabilistic filter includes a connection Bloom filter and a sequence Bloom filter.

Abstract: A method for operating a distributed computing system including a plurality of nodes connected in a general network topological sequential manner includes storing a first message on a first node; removing the first message from the first node only if an N-level acknowledgement message is received by the first node indicating that a second message based on the data of the first message was successfully received by a second node on a second level, wherein the difference between the values for the first and second level is a predefined value N; and saving a node state of at least the second node or a third node on a level higher than the first level before sending out an acknowledgement message to a node on a level below if an outgoing message towards the second node is generated based on the node state.

Abstract: A method for analyzing a data flow includes: (a) extracting packet information of a packet, (b) determining a status of the packet based on the extracted packet information by applying at least one probabilistic filter to the packet and storing the packet for later inspection based on the status of the packet indicating that the packet is out-of sequence, and (c) inspecting the stored packet based on inspection rules. Upon a partial match of an inspection rule with the extracted packet information, a result of the inspection is temporarily stored. Already stored packets are inspected based on the already stored packets being in-order with already inspected packets. Upon a total match of at least one of the inspection rules, a predetermined action is performed and the stored result is deleted. The at least one probabilistic filter includes a connection Bloom filter and a sequence Bloom filter.

Abstract: A method for analyzing a data flow includes extracting packet information of a packet of the data flow, determining the status of the packet and the status of the data flow based on the extracted packet information and storing the packet for later inspection when the status of the packet and/or the status of the data flow indicate that the packet is out-of sequence, and inspecting the packet and/or the stored packet based on inspection rules. Upon a partial match of at least one of the inspection rules with the extracted packet information, a result of the inspection of the packet is temporarily stored. Already stored packets are inspected when they are in-order with already inspected packets. Upon a total match of at least one of the inspection rules, a predetermined action is performed and the stored result is deleted.

Abstract: A method for supporting detection of irregularities in a network includes monitoring features of said network using at least one monitoring device in order to collect spatio-temporal measuring data; providing, in an off-line phase, a training matrix where collected measuring data is aggregated in a predetermined time window such that said training matrix includes spatia-temporal correlations; performing, in said off-line phase, non-negative matrix factorization in order to decompose said training matrix into a coefficient matrix and a basis matrix, wherein temporal correlations and spatial correlations are jointly considered; creating, in an on-line phase; a current runtime matrix on a basis of measuring data newly collected in the on-line phase, computing, in said on-line phase, a current runtime coefficient matrix on a basis of said current runtime matrix and said basis matrix; and comparing, in said on-line phase, said current runtime coefficient matrix with at least one previous coefficient matrix.

Abstract: A method for analyzing a data flow includes extracting packet information of a packet of the data flow, determining the status of the packet and the status of the data flow based on the extracted packet information arid storing the packet for later inspection when the status of the packet and/or the status of the data flow indicate that the packet is out-of sequence, and inspecting the packet and/or the stored packet based on inspection rules. Upon a partial match of at least one of the inspection rules with the extracted packet information, a result of the inspection of the packet is temporarily stored. Already stored packets are inspected when they are in-order with already inspected packets. Upon a total match of at least one of the inspection rules, a predetermined action is performed and the stored result is deleted.

Abstract: A method for check pointing a global state of a distributed system with one or more distributed applications organized in a directed acyclic graph topology includes, upon receiving a marker in an active input channel of a first task application, putting an active input channel on hold, performing check pointing by saving an internal state of the first task application when all input channels have received a marker and are put on hold, forwarding the marker via all output channels of the first task application to at least one other task application of the one or more task applications, and reactivating all input channels of the first task application, wherein the global state is a union of all internal states of the task applications after each of the one or more task applications has been check pointed.

Abstract: A method for operating a distributed computing system including a plurality of nodes connected in a general network topological sequential manner includes storing a first message on a first node; removing the first message from the first node only if an N-level acknowledgement message is received by the first node indicating that a second message based on the data of the first message was successfully received by a second node on a second level, wherein the difference between the values for the first and second level is a predefined value N; and saving a node state of at least the second node or a third node on a level higher than the first level before sending out an acknowledgement message to a node on a level below if an outgoing message towards the second node is generated based on the node state.

Abstract: A method and system for detecting anomaly of user behavior in a network with a hierarchical topology, including a plurality of users, at least two bridges to each of which at least one user is connected to and wherein the bridges are configured to be operable to connect the corresponding users to the network, and at least one predetermined profiling network entity, the method includes the steps of: a) determining common behaviors of the users connected to the respective bridges; b) transmitting the determined common behaviors to the profiling network entity; c) determining an overall profile based on the transmitted common behaviors; d) transmitting back the determined overall profile to the bridges; and e) detecting anomaly of user behavior of the users connected to the corresponding bridges based on the overall profile.

Abstract: A Soederberg electrode with low PAH emission that can be used in electro-thermal processes for the production of metal materials, preferably ferro-alloys, which can be obtained from an electrode paste with a base of a carbonaceous material, fine graphite, carbohydrates and water and/or PEG.

Abstract: A method and system for detecting anomaly of user behavior in a network with a hierarchical topology, including a plurality of users, at least two bridges to each of which at least one user is connected to and wherein the bridges are configured to be operable to connect the corresponding users to the network, and at least one predetermined profiling network entity, the method includes the steps of: a) determining common behaviors of the users connected to the respective bridges; b) transmitting the determined common behaviors to the profiling network entity; c) determining an overall profile based on the transmitted common behaviors; d) transmitting back the determined overall profile to the bridges; and e) detecting anomaly of user behavior of the users connected to the corresponding bridges based on the overall profile.

Abstract: A Soederberg electrode with low PAH emission that can be used in electro-thermal processes for the production of metal materials, preferably ferro-alloys, which can be obtained from an electrode paste with a base of a carbonaceous material, fine graphite, carbohydrates and water and/or PEG.

Abstract: A method to determine if an encrypted flow of packets (F) belongs to a predefined class of flows (?t), comprises the steps of giving probability density functions (p(xi|?t)) of the values of two measurable variables in a plurality of encrypted flows of packets (Fj) belonging to the predefined class of flows (?t), measuring the values (si,?t1) of the two measurable variables, apply the measured values (si,?t1) to the probability density functions (p(xi|?t)) to generate a sequence of values of probability density (p({right arrow over (x)}|?t)), process the sequence of values of probability density (p({right arrow over (x)}|?t)) to generate a reference value (S({right arrow over (x)}|?t)), and compare such reference value (S({right arrow over (x)}|?t)) to a threshold value (T) to determine whether the encrypted flow of packets (F) belongs to the predefined class of flows.

Abstract: A method to determine if an encrypted flow of packets (F) belongs to a predefined class of flows (?t), comprises the steps of giving probability density functions (p(xi|?t)) of the values of two measurable variables in a plurality of encrypted flows of packets (Fj) belonging to the predefined class of flows (?t), measuring the values (si,?t1) of the two measurable variables, apply the measured values (si,?t1) to the probability density functions (p(xi|?t)) to generate a sequence of values of probability density (p({right arrow over (x)}|?t)), process the sequence of values of probability density (p({right arrow over (x)}|?t)) to generate a reference value (S({right arrow over (x)}|?t)), and compare such reference value (S({right arrow over (x)}|?t)) to a threshold value (T) to determine whether the encrypted flow of packets (F) belongs to the predefined class of flows.