etherpoke is a scriptable network session monitor. It defines two events, SESSION_BEGIN and SESSION_END, to which a hook (system command) can be assigned. The event hook can be any program installed in the system. SESSION_BEGIN is triggered when the first packet with an Ethernet source address matching the filter is captured. SESSION_END is triggered when the time since the last captured packet with an Ethernet source address matching the filter exceeds the session timeout.
Linux Deepin is an easy-to-use Linux distribution. It aims to provide a beautiful and user-friendly experience for the average user. In the light of such philosophy, Linux Deepin pays more attention to detail and provides a better interactive experience. It features its own desktop environment, called DDE or Deepin Desktop Environment.
g7ctrl is a daemon and a command shell that are used together with the Xtreme GM7 GPS tracker to help simplify its management and to make it possible to monitor alerts sent by the tracker. It is designed to run in the background and can be used to both receive location updates from a remote tracker and configure a tracker over USB. All received events are stored in a database and can be exported to GPX, KML, and CSV, with distances calculated. It can also execute action scripts upon receiving specific events or generate mail notifications. Extensive reference documentation (HTML and PDF) and Unix man pages are provided.
Global Paths Matching is an implementation of the global paths graph matching algorithm proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07). Given a graph G=(V,E), a matching M is a set of edges without common vertices, i.e. the graph G=(V,M) has a degree of at most one. The algorithm scans the edges in order of decreasing weight (or rating), constructing a collection of paths and even length cycles. These paths initially contain no edges. While scanning the edges, the set is extended by successively adding applicable edges, which are those connecting two endpoints of different paths or two endpoints of an odd length path. Optimal solutions/matchings are computed for each path and cycle using dynamic programming.