Method of Finding Hamilton Routes in Transport Network

This article discusses a solution method for Hamilton Problem, which either finds the task's solution, or indicates that the task is unsolvable. Offered method has significantly smaller requirements for computing resources than known algorithms.

Defining Network Activity Patterns Using First Order Temporal Logics

Part of network management is collecting information about the activities that go on around a distributed system and analyzing it in real time, at a deferred moment, or both. The reason such information may be stored in log files and analyzed later is to data-mine it so that interesting, unusual, or abnormal patterns can be discovered. In this paper we propose defining patterns in network activity logs using a dialect of First Order Temporal Logics (FOTL), called First Order Temporal Logic with Duration Constrains (FOTLDC). This logic is powerful enough to describe most network activity patterns because it can handle both causal and temporal correlations. Existing results for data-mining patterns with similar structure give us the confidence that discovering DFOTL patterns in network activity logs can be done efficiently.