GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Embed Notice

HTML Code

Corresponding Notice

  1. Embed this notice
    iced depresso (icedquinn@blob.cat)'s status on Friday, 20-Sep-2024 05:00:15 JSTiced depressoiced depresso
    > https://en.wikipedia.org/wiki/Halton_sequence

    :gutkato_adorinda: my brain is big enough to understand why you'd use this, and too small to understand how they derived a six line algorithm from recursive integer division
    In conversationabout 10 months ago from blob.catpermalink

    Attachments

    1. Domain not in remote thumbnail source whitelist: upload.wikimedia.org
      Halton sequence
      In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations. Although these sequences are deterministic, they are of low discrepancy, that is, appear to be random for many purposes. They were first introduced in 1960 and are an example of a quasi-random number sequence. They generalize the one-dimensional van der Corput sequences. Example of Halton sequence used to generate points in (0, 1) × (0, 1) in R2 The Halton sequence is constructed according to a deterministic method that uses coprime numbers as its bases. As a simple example, let's take one dimension of the two-dimensional Halton sequence to be based on 2 and the other dimension on 3. To generate the sequence for 2, we start by dividing the interval (0,1) in half, then in fourths, eighths, etc., which generates 1⁄2, ...
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.