Universe.NetCore.Algorithm 1.2.0.100

Description of the Universe.NetCore.Algorithm

Universe.Algorithm - a nuget-package with often using algorithms for some interesting cases, which I want just to re-use in the future.

One this algorithm - IntersectingLineSegmentsAlgorithm. This is algorithm of a definition free slot of time bases on searching of intersection line segments. Very useful algorithm, which help me solve a task on one project of pharm company.

ThreadMachine - simplification of the using Thread. I'm using it always in WinForms applications and jobs of integrations. Sample of using:

var threadMachine = ThreadMachine.Create(1).RunInMultiThreadsWithoutWaiting(() =>
{
 // Your code
}

You can mage threads, cancel them using CancelAllThreads() etc.

TextTokenizer - very useful if you're working with neural networks or under a search optimization. Tokenizing on: Newline | Number | Space | Symbol | Word.

Signals/FFT - when I was a student I need to create my application for speech recognition and getting from speech commands for the voice control of a computer. First stage is transformation Wave PCM to the spectrum form. For this I've implemented FFT and algorithm of fetching Сepstral coefficients (Mel-frequency cepstrum).

Fast Fourier Transform (FFT) is an algorithm that quickly computes the Discrete Fourier Transform (DFT) of a signal. It converts a signal from its original domain (like time) into the frequency domain, revealing which frequencies are present and how strong they are. Instead of taking O(N^2) operations like normal DFT, FFT only takes O(NlogN) steps, making it extremely fast even for large datasets. It's used in audio processing, communications, image analysis, and many other fields.

Fast Fourier Transform is a kind of the Discrete Fourier Transform (DFT) converts a sequence of

X(k) = sum_{n=0}^{N-1} x(n) * exp(-j2pikn/N), where: x(n) = your original signal (in time or space). X(k) = the signal in frequency domain. j = imaginary unit. N = total number of samples.

Of course a programming of DFT very hard and usually using FFT version of this algorithm.

And since I started working with the framework, I transferred to Universe.Algorithm the FFT algorithm (Fast Fourier Transform) along with the control for drawing the spectrum, which I implemented when I was at university. And I used the same player on my "rabbit." The algorithm is useful, where it's applicable starting with the construction of spectrograms and not only sound waves

When studying Venus by the light spectra of phosphine, each chemical compound has its own, a hypothesis was made about the possible presence of life in the upper layers

#CSharp #NetFramework #NetCore #UniverseFramework #FFT #Algorithms