Search Results for "it log"

...By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. This makes it a strong fit for tasks like content filtering, entity/term spotting, dictionary-based annotation, or high-throughput log/text processing. In short, it’s a specialized, speed-focused library for industrial-strength multi-keyword matching in Java.

This Python module provides basic facilities for mathematics on fixed-point numbers. The number of fractional binary digits is tunable, allowing near-arbitrary precision arithmetic. Arithmetic & functions such as sqrt, exp, log, sin & cos are available. For the latest releases please visit https://github.com/rwpenney/spfpm

This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. The library exposes API functions for computing cells, retrieving neighbors, and drawing results into canvas or SVG. Because it is pure JavaScript and self-contained, it integrates easily with browser or Node.js applications without heavy dependencies. ...

in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] }

A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small.

This program is fundamentally a short-sized version of my mathSuite program: https://sourceforge.net/projects/mathsuite/ It includes all the functionalities of MSCenv (mathSuite Calculus Environment), such as inline variables and functions (mainly thanks to ExprEval), which you can use to perform expensive complex computations and store their results into runtime variables. You can perform also every Linear Algebra Operations included in mathSuite with new optimizations.

Flamingo is a open-source Big Data Platform that combine a Ajax Rich Web Interface + Workflow Engine + Workflow Designer + MapReduce + Hive Editor + Pig Editor. 1. Easy Tool for big data 2. Use comfortable in Hadoop EcoSystem projects 3. Based GPL V3 License Supporting Pig IDE, Hive IDE, HDFS Browser, Scheduler, Hadoop Job Monitoring, Workflow Engine, Workflow Designer, MapReduce.

...Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. ...

Belkerda is a simple Python AI program that takes a user's input, builds a log of random numbers, picks a random entry, and displays it. If it is correct, then it reenters that number back into the log several times, overwriting the original, random numbers. If it is not, however, it overwrites a lower amount of entries.

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

Secure P2P Instant Messenger running on .NET Framework 2.0. Uses server to store user information (user name, password, email address, friends list, log in state, IP address) in encrypted form. Uses custom designed symmetric encryption algorithm.

The first stage of development is do write a tool to anonymize packet capture files captured with libpcap. After that we will be integrating this with tcpdump to anonymize in real-time and analyze and look for its effect on different IDS's.