We describe a code designed for hot media {(T $\ge$} a few 10$^4$ K), optically thick to Compton scattering. It computes the structure of a plane-parallel slab of gas in thermal and ionization equilibrium, illuminated on one side or on both sides b...
Jun 11, 2018 · In this view x.view(-1) is a weird flatten layer but missing the squeeze (i.e. adding a dimension of 1). Adding this squeeze or removing it is usually important for the code to …
Jun 11, 2018 · In this view x.view(-1) is a weird flatten layer but missing the squeeze (i.e. adding a dimension of 1). Adding this squeeze or removing it is usually important for the code to actually run.
Skip to content github / docs Code Issues 80 Pull requests 35 Discussions Actions Projects 2 Security Insights Merge branch 'main' into 1862-Add-Travis-CI-migration-table 1862-Add-Travis-CI-migration-table (#1869, Iixixi/ZachryTylerWood#102, THEBOLCK79/docs#1,…
We present Joey NMT, a minimalist neural machine translation toolkit based on PyTorch that is specifically designed for novices. Joey NMT provides many popular NMT features in a small and simple code base, so that novices can easily and quickly learn...
Code, datasets, and checkpoints for the paper "Improving Passage Retrieval with Zero-Shot Question Generation (EMNLP 2022)" (⭐ 100)
We consider the CEO problem for non-regular source distributions (such as uniform or truncated Gaussian). A group of agents observe independently corrupted versions of data and transmit coded versions over rate-limited links to a CEO. The CEO then es...
Short code written during my first co op that takes a truck number from the user and shows the user where that truck is located on google maps. (⭐ 0)
In this paper we present a decoding algorithm for algebraic geometry codes with error-correcting capacity beyond half the designed distance of the code. This algorithm comes as a fusion of the Power Error Locating Pairs algorithm for algebraic geomet...
The concept of prefactors is considered in order to decrease the complexity of the Guruswami-Sudan interpolation step for generalized Reed-Solomon codes. It is shown that the well-known re-encoding projection due to Koetter et al. leads to one type o...
Jul 27, 2010 · I've seen them both being used in numerous pieces of C# code, and I'd like to know when to use i++ and when to use ++i? (i being a number variable like int, float, double, etc).
Mar 21, 2013 · Could someone explain in the simplest terms, as if you are talking to an idiot (because you are), what this code is actually saying/doing for (int i = 0; i < 8; i++)
The way for loop is processed is as follows 1 First, initialization is performed (i=0) 2 the check is performed (i < n) 3 the code in the loop is executed. 4 the value is incremented 5 Repeat steps 2 - 4 …
The .nocache.js file contains JavaScript code that resolves the Deferred Binding configurations (such as browser detection, for instance) and then uses a lookup table generated by the GWT Compiler to â¦
Recent deep learning models outperform standard lossy image compression codecs. However, applying these models on a patch-by-patch basis requires that each image patch be encoded and decoded independently. The influence from adjacent patches is there...
We consider a new fundamental question regarding the point-to-point memoryless channel. The source-channel separation theorem indicates that random codebook construction for lossy source compression and channel coding can be independently constructed...
Use these codes wisely it will grant you a lot of power (⭐ 0)
Remove WPP calls from hexrays decompiled code (⭐ 56)
Points: 17 | Comments: 0 | Author: carlossubtix
Back to Back SWE modules code (⭐ 4)