Results 261 to 270 of about 16,644 (310)

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

Advanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

Contribution of spike timing to the neural code: from fast to slow timescales. [PDF]

Biol Cybern
Panzeri S, Engel NM, Celotto M.
europepmc   +1 more source

Error Resilient Space Partitioning. [PDF]

Discrete Comput Geom
Dunkelman O, Geyzel Z, Keller C, Keller N, Ronen E, Shamir A, Tessler RJ.   +6 more
europepmc   +1 more source

Socioeconomic status and migration background as predictors of complicated lower respiratory tract infections in primary care. [PDF]

Commun Med (Lond)
van Dokkum ED, Kraaijenbrink N, Le Cessie S, Sijbom M, van der Schoor AS, Visser LG, van Nieuwkoop C, Borgdorff H.   +7 more
europepmc   +1 more source

Multi-Function Computation over a Directed Acyclic Network. [PDF]

Entropy (Basel)
Sun X, Zhang R, Li D, Guang X.
europepmc   +1 more source

Implementation of a Quantum Authentication Protocol Using Single Photons in Deployed Fiber. [PDF]

Entropy (Basel)
Hong C, Jeong YC, Ji SW.
europepmc   +1 more source

Unobserved confounders cannot explain over-crediting in avoided deforestation carbon projects. [PDF]

Nat Ecol Evol
Guizar-Coutiño A, Nicholson G, Coomes D, Ferraro PJ, Swinfield T, Jones JPG.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Bounds on the size of Lee-codes

2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA), 2013
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we compute new upper bounds on size of codes in the Lee metric using the linear programming method. We present a recursive formula for obtaining the Lee-numbers, which makes it possible to efficiently compute these bounds.
Helena Astola, Ioan Tabus
openaire   +2 more sources

On Lower Bounds For Covering Codes

Designs, Codes and Cryptography, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mahesh C. Bhandari, K. K. P. Chanduka, Arbind K. Lal   +2 more
openaire   +2 more sources