DSpace Repository
DSpace is a digital service that collects, preserves, and distributes digital material. Repositories are important tools for preserving an organization's legacy; they facilitate digital preservation and scholarly communication.
DSpace is a digital service that collects, preserves, and distributes digital material. Repositories are important tools for preserving an organization's legacy; they facilitate digital preservation and scholarly communication.
L'archive ouverte HAL SHS (Sciences de l’Homme et de la Société), est destinée au dépôt et à la diffusion d'articles scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, dans toutes les disciplines des sciences humaines et de la société.
Vos publications sont faciles à trouver, bien référencées par les moteurs de recherche et interconnectées avec d’autres services (ORCID, serveurs de preprint)
arXiv est une archive ouverte de prépublications électroniques d'articles scientifiques dans les domaines de la physique, des mathématiques, de l'informatique, de la biologie quantitative,......
Safe — your research is stored safely for the future in CERN’s Data Centre for as long as CERN exists.
Trusted — built and operated by CERN and OpenAIRE to ensure that everyone can join in Open Science.
Citeable — every upload is assigned a Digital Object Identifier (DOI), to make them citable and trackable.
PubMed Central® (PMC) is a free full-text archive of biomedical and life sciences journal literature at the U.S. National Institutes of Health's National Library of Medicine (NIH/NLM)
HAL Thèses est un environnement particulier de HAL et permet donc, comme HAL, de rendre rapidement et gratuitement disponibles des documents scientifiques, mais ...
HAL Thèses est un environnement particulier de HAL et permet donc, comme HAL, de rendre rapidement et gratuitement disponibles des documents scientifiques, mais ...
arXiv is a free distribution service and an open-access archive for 2,271,903 scholarly articles in the fields of physics, mathematics, computer science, ...
arXiv is a free distribution service and an open-access archive for 2,271,171 scholarly articles in the fields of physics, mathematics, computer science, quantitative biology, quantitative finance, statistics, electrical engineering and systems science, and economics. Materials on this site are not peer-reviewed by arXiv.
PubMed Central® (PMC) is a free full-text archive of biomedical and life sciences journal literature at the U.S. National Institutes of Health's National Library of Medicine (NIH/NLM)
DSpace is a digital service that collects, preserves, and distributes digital material. Repositories are important tools for preserving an organization's legacy; they facilitate digital preservation and scholarly communication.
Not everybody left their jobs during the Great Resignation, and for those still on the job — from teachers to servers to office workers — the situation sucks.
Welcome back! Rust is a very powerful programming language used by tons of different companies, including Google! Let’s go ahead and see what projects Google actually uses Rust for. Now, the process…
Introduction This is a variant of a similar past problem: draw something interesting, using a sequence of joined straight line segments, without ever lifting your pen. Or in this case, with one continuous thread. As far as I can tell, the first realization of this particular idea was in 2016, when artist Petros Vrellis [1]…
Wave Function Collapse is a procedural generation algorithm which produces images by arranging a collection of tiles according to rules about which tiles may be adjacent to each other tile, and relatively how frequently each tile should appear. The algorithm maintains, for each pixel of the output image, a probability distribution of the tiles which may be placed there. It repeatedly chooses a pixel to “collapse” - choosing a tile to use for that pixel based on its distribution. WFC gets its name from quantum physics. The goal of this post is to build an intuition for how and why the WFC algorithm works.