JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. It is written in Java, which allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries.
When you delete or move a message, most e-mail programs ("clients") simply hide the message and mark it as ready for physical deletion later on. The "deleted" messages are still stored in the folder - even emptying the Trash does not remove them. The hidden messages are not physically removed until the folder is compacted (not to be confused with compressing a file). If you don't compact your mail folders periodically, they can grow very large.
The biblatex package by Philipp Lehman is likely to become the definitive citation management tool for LaTeX users. Biblatex relies on the venerable BibTeX program only for sorting and generating a very generic bbl file without any formatting instruction. Everything else is taken care of by biblatex, which provides a powerful and flexible macro interface for authors of citation styles.
Die Levenshtein-Distanz ist eine effiziente Möglichkeit, die Ähnlichkeit von Strings zu bestimmen, Damit können beispielsweise Tippfehler bei der Verwendung von Suchfunktionen elegant korrigiert werden. Wenn man eine Anzeige im Stile von "Meinten Sie vielleicht ..." anzeigen möchte, braucht man hierzu eine Funktion die "das ähnlichste" Wort in einer Datenbanktabelle findet. Hierzu habe ich eine MySQL-GROUP-Funktion geschrieben.
Contributed and administered by ICEsoft Technologies Inc., ICEpdf.org is a place where enterprise Java developers can learn, share, and contribute information and ideas to a growing community of ICEpdf developers. ICEpdf is an open source Java PDF engine that can render, convert, or extract PDF content within any Java application or on a Web server.
Eurovoc ist ein mehrsprachiger Thesaurus, der sämtliche Tätigkeitsbereiche der Europäischen Gemeinschaften abdeckt und mit dessen Hilfe die Dokumente und die Anfragen in den Dokumentationssystemen der europäischen Institutionen indexiert werden. Gegenwärtig wird EUROVOC vom Europäischen Parlament, vom Amt für amtliche Veröffentlichungen der Europäischen Gemeinschaften, von den nationalen und regionalen Parlamenten in Europa, von den nationalen Verwaltungen und von bestimmten europäischen Organisationen verwendet. Diese Website enthält die Ausgabe 4.3 des Thesaurus EUROVOC. Diese Veröffentlichung ist das Ergebnis einer Zusammenarbeit zwischen Organen der EU, nationalen Parlamenten und diversen Benutzern von EUROVOC.
We consider mining unusual patterns from text T. Unlike existing methods which assume probabilistic models and use simple estimation methods, we employ a set B of background text in addition to T and compositions w=xy of x and y as patterns. A string w is peculiar if there exist x and y such that w=xy, each of x and y is more frequent in B than in T, and conversely w=xy is more frequent in T. The frequency of xy in T is very small since x and y are infrequent in T, but xy is relatively abundant in T compared to xy in B. Despite these complex conditions for peculiar compositions, we develop a fast algorithm to find peculiar compositions using the suffix tree. Experiments using DNA sequences show scalability of our algorithm due to our pruning techniques and the superiority of the concept of the peculiar composition.