 | 28 unreviewed articles as of 24 November 2024
|
| Created | Article | Extract | Class | Creator (# edits) | Notes |
|---|---|---|---|---|---|
| 2024-08-24 | Non-physical true random number generator | Non-physical true random number generator (NPTRNG), also known as non-physical nondeterministic random bit generator is a true random number generator that does not have access to dedicated hardware entropy source. NPTRNG uses a non-physical noise source that obtains entropy from system data, like outputs of application programming interface functions, residual information in the random access memory, system time or human input (e.g., mouse movements and keystrokes). | Start | Dimawik (2281) | |
| 2024-08-20 | Max^n algorithm (A decisive algorithm that solves $n$-player general-sum games.) | In combinatorial game theory, the maxn algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player in n-player games. The algorithm was designed by Luckhardt and Irani. | Stub | LeoDog896 (119) | |
| 2024-01-25 | Domain separation (Cryptographic technique) | In cryptography, domain separation is a construct used to implement multiple different functions using only one underlying template in an efficient way. The domain separation can be defined as partitioning of the domain of a function to assign separate subdomains to different applications of the same function. | C | Evgeny Kapun (101) | |
| 2024-07-31 | Williamson theorem | In the context of linear algebra and symplectic geometry, the Williamson theorem concerns the diagonalization of positive definite matrices through symplectic matrices. | Stub | Luca Innocenti (444) | |
| 2024-08-20 | Mill's Inequality (probabilistic inequality) | Mill's Inequality is a useful tail bound on Normally distributed random variables. \frac{\exp(-t^2/2)}{t} \le \frac{\exp(-t^2/2)}{t}</math> | Stub | Wqwt (946) | |
| 2024-08-03 | Chance constrained programming | Chance Constrained Programming (CCP) is a mathematical optimization approach used to handle problems under uncertainty. It was first introduced by Charnes and Cooper in 1959 and further developed by Miller and Wagner in 1965. CCP is widely used in various fields, including finance, engineering, and operations research, to optimize decision-making processes where certain constraints need to be satisfied with a specified probability. | B | Alaexis (17444) | |
| 2024-10-03 | List of mathematical objects | This is a list of mathematical objects, organized by branch. | Stub | Farkle Griffen (1262) | |
| 2024-04-26 | CLRg property | In mathematics, the notion of “common limit in the range” property denoted by CLRg property is a theorem that unifies, generalizes, and extends the contractive mappings in fuzzy metric spaces, where the range of the mappings does not necessarily need to be a closed subspace of a non-empty set . | Start | Mahmoudpd (6) | |
| 2024-08-13 | Median of the Trapezoid theorem (Geometry theorem about the median of a trapezoid) | The Median of the Trapezoid theorem states that the median of a trapezoid is equal in length to the average of the lengths of the two bases. This theorem is a fundamental concept in geometry and has various applications in mathematics, particularly in the study of quadrilaterals. | Start | SteveLosive (35) | |
| 2024-10-28 | Eventually stable polynomial | A non-constant polynomial with coefficients in a field is said to be eventually stable if the number of irreducible factors of the -fold iteration of the polynomial is eventually constant as a function of . The terminology is due to R. | Start | Hydrohydro (14) | |
| 2024-10-29 | Rational homology sphere (Manifold with the same rational homology groups as a sphere) | In algebraic topology, a rational homology -sphere is an -dimensional manifold with the same rational homology groups as the -sphere. These serve, among other things, to understand which information the rational homology groups of a space can or cannot measure and which attenuations result from neglecting torsion in comparison to the (integral) homology groups of the space. | Start | Samuel Adrian Antz (1948) | |
| 2024-10-29 | Rational homotopy sphere (Manifold with the same rational homotopy groups as a sphere) | In algebraic topology, a rational homotopy -sphere is an -dimensional manifold with the same rational homotopy groups as the -sphere. These serve, among other things, to understand which information the rational homotopy groups of a space can or cannot measure and which attenuations result from neglecting torsion in comparison to the (integral) homotopy groups of the space. | Start | Samuel Adrian Antz (1948) | |
| 2024-09-30 | Border's theorem | In auction theory and mechanism design, Border's theorem gives a necessary and sufficient condition for interim allocation rules (or reduced form auctions) to be implementable via an auction. | C | JoaoFrancisco1812 (147) | |
| 2024-09-28 | Random feature | Random features (RF) are a technique used in machine learning to approximate kernel methods, introduced by Ali Rahimi and Ben Recht in their 2007 paper "Random Features for Large-Scale Kernel Machines", and extended by. RF uses a Monte Carlo approximation to kernel functions by randomly sampled feature maps. | C | Cosmia Nebula (8060) | |
| 2024-10-20 | Integral of a correspondence | In mathematics, the integral of a correspondence is a generalization of the integration of single-valued functions to correspondences. | C | JoaoFrancisco1812 (147) | |
| 2024-10-05 | Weight initialization (Technique for setting initial values of trainable parameters in a neural network) | In deep learning, weight initialization describes the initial step in creating a neural network. A neural network contains trainable parameters that are modified during training: weight initalization is the pre-training step of assigning initial values to these parameters. | C | Cosmia Nebula (8060) | |
| 2024-06-29 | Game form (Game theory concept) | In game theory and related fields, a game form, game frame, ruleset, or outcome function is the set of rules that govern a game and determine its outcome based on each player's choices. A game form differs from a game in that it does not stipulate the utilities or payoffs for each agent. | Start | Closed Limelike Curves (5628) | |
| 2024-08-25 | Minimum mean weight cycle | In graph theory, a minimum mean weight cycle is a cycle whose average weight (total weight divided by length) is smallest among all cycles in the graph. An analogous problem is the maximum mean weight cycle. These problems have applications to embedded systems and logic chip design. | C | Erel Segal (14126) | |
| 2024-10-18 | Model compression (Techniques for lossy compression of neural networks) | Model compression is a machine learning technique for reducing the size of trained models. Large models can achieve high accuracy, but often at the cost of significant resource requirements. Compression techniques aim to compress models without significant performance reduction. | C | Cosmia Nebula (8060) | |
| 2024-03-05 | Chirawat Wangthaphan (Thai footballer) | Chirawat Wangthaphan (Thai: จิรวัฒน์ วังทะพันธ์, born 26 July 1998) is a Thai professional footballer who plays as a goalkeeper for Thai League 1 club Khonkaen United. | Stub | Puan555 (5055) | |
| 2024-09-07 | Modified Kumaraswamy distribution (Concept in probability theory) | Start | KallinAZ (17) | ||
| 2024-08-28 | Cipher device | A cipher device was a term used by the US military in the first half of the 20th century to describe a manually operated cipher equipment that converted the plaintext into ciphertext or vice versa. A similar term, cipher machine, was used to describe the cipher equipment that required external power for operation. | Stub | Teemu Leisti (2878) | |
| 2024-06-23 | Agnew's theorem (Theorem about permutations that preserve convergence for all converging series) | Agnew's theorem, proposed by American mathematician Ralph Palmer Agnew, characterizes reorderings of terms of infinite series that preserve convergence for all series. | Start | UnladenSwallow (3158) | |
| 2024-06-25 | Epanechnikov distribution (Mathematical term) | In probability theory and statistics, the Epanechnikov distribution, also known as the Epanechnikov kernel, is a continuous probability distribution that is defined on a finite interval. It is named after V. A. Epanechnikov, who introduced it in 1969 in the context of kernel density estimation. | Start | Jonbarron (20) | |
| 2024-07-12 | Spreen (Argentine YouTuber, Twitch streamer) | Iván Raúl Buhajeruk Fernández (born 11 October 2000), better known as Spreen, is an Argentine Twitch streamer and YouTuber. | Start | Milanesanapolitanaconarroz (78) | |
| 2024-11-22 | Kobayashi's theorem (Kobayashi's theorem) | In number theory, Kobayashi's theorem is a result concerning the distribution of prime factors in shifted sequences of integers. The theorem, proved by Hiroshi Kobayashi, demonstrates that shifting a sequence of integers with finitely many prime factors necessarily introduces infinitely many new prime factors. | Stub | GregariousMadness (99) | |
| 2024-11-23 | Roy Jones Jr. vs. Virgil Hill (Boxing match) | Roy Jones Jr. vs. Virgil Hill was a professional boxing match contested on 25 April 1998. | C | Sam11333 (12429) | |
| 2024-11-24 | Cursed equilibrium (Game theory solution) | In game theory, a cursed equilibrium is a solution concept for static games of incomplete information. It is a generalization of the usual Bayesian Nash equilibrium, allowing for players to underestimate the connection between other players' equilibrium actions and their types – that is, the behavioral bias of neglecting the link between what others know and what others do. | Start | JoaoFrancisco1812 (147) |
Last updated by SDZeroBot operator / talk at 13:36, 24 November 2024 (UTC)