Abstract: The subject matter of the invention is a communication method comprising the establishment of a communication route to a target partner not reachable by direct addressing by by-passing a node blocking the direct connection, further comprising the steps of setting up a TURN server at one or more users of the communication network in response to a definite and pre-granted request or in advance, and implementing the communication route to be established via at least one mentioned TURN server, with the effective mutual authorization management of the users involved in the communication session.

Abstract: Mechanical vibrations induced by the heart of the foetus, together with other vibrations coming from the body of the pregnant mother, are sensed by the at least one electro-mechanical transformer placed on the body surface of the pregnant mother, the vibrations are transformed into electrical signals and processed. The electrical signals are pre-amplified, frequencies including the heart sound of the pregnant mother are removed from amplified electrical signals of the perceived vibrations by active bandpass filtering, the signal level reduction due to bandpass filtering is compensated for by amplification, and the filtered signal is transferred to a device for processing and evaluation. A device suitable for implementing the method, and a computer-readable medium are proposed, the latter comprising instructions to be run on the device, e.g. the smartphone, for processing the measured signals, displaying them visually, showing trends and making proposals to the user based on the processed signals.

Abstract: A method for tracking the movement and trajectory of objects associated with wireless devices, located in a predefined area, wherein transceiver nodes communicating with the monitored wireless communication devices are formed, the objects associated with wireless communication device entering or located in the range of the transceiver nodes are detected by said transceiver nodes and relevant collected data are processed by measuring the strength of the signal emitted by the object during communication by at least two access points, converting the measured signal strength data into a vector set, selecting and filtering out the objects that are communicating but make no movement by evaluating the vector set, and analyzing the movement of the communicating objects changing their place by applying a pre-defined mathematical model. Access points operating according to a small-range “peer-to-peer” (P2P) type wireless communication standard are used as transceiver nodes.

Abstract: A method for tracking the movement and trajectory of objects associated with wireless devices, located in a predefined area, wherein transceiver nodes communicating with the monitored wireless communication devices are formed, the objects associated with wireless communication device entering or located in the range of the transceiver nodes are detected by said transceiver nodes and relevant collected data are processed by measuring the strength of the signal emitted by the object during communication by at least two access points, converting the measured signal strength data into a vector set, selecting and filtering out the objects that are communicating but make no movement by evaluating the vector set, and analysing the movement of the communicating objects changing their place by applying a pre-defined mathematical model. Access points operating according to a small-range “peer-to-peer” (P2P) type wireless communication standard are used as transceiver nodes.

Abstract: The subject matter of the invention is a communication method comprising the establishment of a communication route to a target partner not reachable by direct addressing by by-passing a node blocking the direct connection, further comprising the steps of setting up a TURN server at one or more users of the communication network in response to a definite and pre-granted request or in advance, and implementing the communication route to be established via at least one mentioned TURN server, with the effective mutual authorisation management of the users involved in the communication session.

Abstract: A distributed data mining method to be carried out in user equipments connected to a peer-to-peer communication network. The method includes: providing a data mining frame application in the equipments as code running on a device-specific platform and a trainable data mining algorithm produced on a programming language common to all equipments, running the data mining algorithm in a first equipment to process user data stored therein, modifying the data structures and/or the input parameter set of the data mining algorithm through training, forwarding at least a part of the modified input parameter set and/or the modified data structures of the data mining algorithm as training information from the first equipment to at least one second equipment, and modifying the input parameter set and/or the data structures of the data mining algorithm running on at least one second equipment using the training information received from the first equipment.

Abstract: A method and a device for abstracting instruction sequences in a computer program. First, a control flow graph of the program is generated and analysed in order to detect multiple occurrences of a same instruction sequence (504, 506). Then, a function including the longest sequence common to at least two instruction sequences from a plurality of sequences having a common instruction sequence of equal or shorter length compared to the longest sequence is created (512). Finally, the original occurrences of the instruction sequences in the plurality of sequences with a reference to a proper position in the newly created function are deleted and a reference to a proper position in the created function inserted instead (514).

Abstract: A method and a system for constructing a control flow graph (CFG, 106) from an executable computer program (104). The solution detects data intermixed with instructions and instruction set changes. The method includes the steps of defining block leader types specifying basic block boundaries in the program (104), building a CFG structure (106) according to the basic blocks found in the program, and adding control flow and addressing information to the CFG (106) by propagating through the basic blocks and internals thereof. The CFG (106) may be then optimised (108) and a compacted executable (112) created as a result.

Abstract: A method and a device for abstracting instruction sequences in a computer program. First, a control flow graph of the program is generated and analysed in order to detect multiple occurrences of a same instruction sequence (504, 506). Then, a function including the longest sequence common to at least two instruction sequences from a plurality of sequences having a common instruction sequence of equal or shorter length compared to the longest sequence is created (512). Finally, the original occurrences of the instruction sequences in the plurality of sequences with a reference to a proper position in the newly created function are deleted and a reference to a proper position in the created function inserted instead (514).

Abstract: A method and a system for constructing a control flow graph (CFG, 106) from an executable computer program (104). The solution detects data intermixed with instructions and instruction set changes. The method includes the steps of defining block leader types specifying basic block boundaries in the program (104), building a CFG structure (106) according to the basic blocks found in the program, and adding control flow and addressing information to the CFG (106) by propagating through the basic blocks and internals thereof. The CFG (106) may be then optimised (108) and a compacted executable (112) created as a result.