Search Results for "j-trace"

...The repository’s structure lets you browse topic by topic and compare trade-offs such as time versus space complexity. It’s a handy companion to interview prep lists: after reading a concept, you can open the matching Lago implementation and trace it line by line.

...It is using two basic approaches for this purpose - the fingerprint and the RMSD approach. Result of the comparison is a similarity matrix and dendrogram. Read more here: J. Appl. Cryst. (2016). 49, 2172-2183 (https://doi.org/10.1107/S1600576716016058) and also here: J. Appl. Cryst. (2020). 53, 841-847 https://doi.org/10.1107/S1600576720003787

Inspired by Grokking Algorithms and python-execution-trace, this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution. Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works. The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. ...

Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational understanding of algorithmic patterns. Because it’s openly maintained, you can browse through issues, see test cases, and observe coding style in a “learning through code” fashion. ...

...In case you use the package in your work, we do appreciate a citation to the publications below. Citation: Yadav B, Peddinti G, Pemovska T, Khan SA, Szwajda A, Tang J, Wennerberg K and Aittokallio T. From drug response profiling to target addiction scoring in cancer cell models. (Submitted)

...The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.

**NOTE**: The WALA project is now hosted at https://github.com/wala/WALA; the latest source code and updates are available there. The code here on Sourceforge is highly out of date and unsupported. The T. J. Watson Libraries for Analysis (WALA) provide program analysis capabilities for Java bytecode and related languages. The WALA libraries constitute an open-source release of parts of IBM Research's DOMO analysis infrastructure.

in here will be all codes of my games made in simple j and you can use it freely just put my name on the credits

Operations Research EXperiment Framework for Java

...This is a software toolbox that collects software implementations of the Local Binary Pattern operator in several platforms: - OpenCL for CPU & GPU - OpenCL for GPU (branchless) - C code optimized for ARM - OpenGL ES 2.0 shaders mobile GPUs - C code for TI C64x DSP core (branchless) - C code for TTA processor synthesis If you use the code somewhere, please cite: Bordallo López M., Nieto A., Boutellier J., Hannuksela J., and Silvén O. "Evaluation of real-time LBP computing in multiple architectures," Journal of Real Time Image Processing, 2014

Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.

Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505

OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.