Pinboard (jm)
https://pinboard.in/u:jm/public/
recent bookmarks from jm#825394 - systemd kill background processes after user logs out - Debian Bug report logs2016-05-27T13:55:11+00:00
https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=825394
jmIt is now indeed the case that any background processes that were still
running are killed automatically when the user logs out of a session,
whether it was a desktop session, a VT session, or when you SSHed into a
machine. Now you can no longer expect a long running background processes to
continue after logging out. I believe this breaks the expectations of
many users. For example, you can no longer start a screen or tmux
session, log out, and expect to come back to it.
]]>systemd ops debian linux fail background cli commandlinehttps://pinboard.in/https://pinboard.in/u:jm/b:d99d1fdd3162/sjk2015-06-25T16:49:38+00:00
https://github.com/aragozin/jvm-tools
jma command line tool for JVM diagnostic troubleshooting and profiling.
]]>java jvm monitoring commandline jmx sjk tools opshttps://pinboard.in/https://pinboard.in/u:jm/b:8ecc9f104166/Visualizing AWS Storage with Real-Time Latency Spectrogram2015-01-27T23:33:56+00:00
http://sysdigcloud.com/aws-storage-latency-sysdig-spectrogram/
jmdataviz latency io ops sysdig charts graphs commandline linuxhttps://pinboard.in/https://pinboard.in/u:jm/b:395dfb4e90a0/Harry - A Tool for Measuring String Similarity2014-01-20T15:43:05+00:00
http://www.mlsec.org/harry/
jma small tool for comparing strings and measuring their similarity. The tool supports several common distance and kernel functions for strings as well as some exotic similarity measures. The focus of Harry lies on implicit similarity measures, that is, comparison functions that do not give rise to an explicit vector space. Examples of such similarity measures are the Levenshtein distance and the Jaro-Winkler distance.
For comparison Harry loads a set of strings from input, computes the specified similarity measure and writes a matrix of similarity values to output. The similarity measure can be computed based on the granularity of characters as well as words contained in the strings. The configuration of this process, such as the input format, the similarity measure and the output format, are specified in a configuration file and can be additionally refined using command-line options.
Harry is implemented using OpenMP, such that the computation time for a set of strings scales linear with the number of available CPU cores. Moreover, efficient implementations of several similarity measures, effective caching of similarity values and low-overhead locking further speedup the computation.
via kragen.]]>via:kragen strings similarity levenshtein-distance algorithms openmp jaro-winkler edit-distance cli commandline hamming-distance compressionhttps://pinboard.in/https://pinboard.in/u:jm/b:7f75587e4bd7/