text stringlengths 31 999 | source stringclasses 5 values |
|---|---|
Bubsy: The Woolies Strike Back is a platform game developed by Black Forest Games and published by UFO Interactive Games under the Accolade label. It was released for PlayStation 4 and Windows on 31 October 2017. The game is the fifth installment in the Bubsy series, and the first new entry in 21 years since Bubsy 3D | https://huggingface.co/datasets/fmars/wiki_stem |
Bus Simulator 21 is a bus simulator game developed by Stillalive Studios and published by Astragon Entertainment. It is developed on the Unreal Engine 4. It is the sixth in the Bus Simulator series, and is the direct sequel to Bus Simulator 18 | https://huggingface.co/datasets/fmars/wiki_stem |
Call of Duty: Black Ops 4 (stylized as Call of Duty: Black Ops IIII) is a 2018 multiplayer first-person shooter developed by Treyarch and published by Activision. It was released worldwide for PlayStation 4, Windows, and Xbox One on October 12, 2018. It is a sequel to the 2015 game Call of Duty: Black Ops III, the fifth entry in the Black Ops sub-series, and the 15th installment in the Call of Duty series overall | https://huggingface.co/datasets/fmars/wiki_stem |
Carmageddon: Reincarnation is a vehicular combat game, the fourth in the Carmageddon series. The game was developed by Stainless Games.
Development
A financial report in 2003 revealed that Carmageddon 4 was in development | https://huggingface.co/datasets/fmars/wiki_stem |
Castlevania: Symphony of the Night is an action role-playing game developed and published by Konami for the PlayStation and Sega Saturn. It was directed and produced by Toru Hagihara, with Koji Igarashi acting as assistant director. It is a direct sequel to Castlevania: Rondo of Blood, taking place four years later | https://huggingface.co/datasets/fmars/wiki_stem |
Lake Mataro is an ancient lake in the Andes. It formed over the northern Altiplano at an altitude of 3,950 metres (12,960 ft) and extended over the central Altiplano. It is one of the ancient lakes of the Altiplano like Lake Minchin, Lake Ballivian and Lake Cabana | https://huggingface.co/datasets/fmars/wiki_stem |
The Negros Trench is an oceanic trench located northeast of the Sulu Trench and west of Negros Island Region in Visayas, the trench is located in the Sunda Plate in the southwestern region of the Pacific Ocean. The depth of the Negros Trench is unknown, in contrast it's neighboring trench the Sulu Trench has a depth of 5,600. During the Early-Miocine, the Sunda Plate subducted below the Philippine Mobile Belt, which would later form the Negros Trench | https://huggingface.co/datasets/fmars/wiki_stem |
The PHIVOLCS Earthquake Intensity Scale (PEIS) is a seismic scale used and developed by the Philippine Institute of Volcanology and Seismology (PHIVOLCS) to measure the intensity of earthquakes.
It was developed as upon a specific response to the 1990 Luzon earthquake. PHIVOLCS cites seismic scale specifically developed for the Philippine setting, the different geography of each country and other "geological considerations" led to the development of PEIS | https://huggingface.co/datasets/fmars/wiki_stem |
The Carpathian Flysch Belt is an arcuate tectonic zone included in the megastructural elevation of the Carpathians on the external periphery of the mountain chain. Geomorphologically it is a portion of the Outer Carpathians. Geologically it is a thin-skinned thrust belt or accretionary wedge, formed by rootless nappes consisting of so-called flysch – alternating marine deposits of claystones, shales and sandstones which were detached from their substratum and moved tens of kilometers to the north (generally) | https://huggingface.co/datasets/fmars/wiki_stem |
The Western Carpathians are an arc-shaped mountain range, the northern branch of the Alpine-Himalayan fold and thrust system called the Alpide belt, which evolved during the Alpine orogeny. In particular, their pre-Cenozoic evolution is very similar to that of the Eastern Alps, and they constitute a transition between the Eastern Alps and the Eastern Carpathians.
The geological evolution of individual parts of the chain is complex, a result of tectonic processes like folding, thrusting and the formation of sedimentary basins of various types during the Mesozoic and Cenozoic | https://huggingface.co/datasets/fmars/wiki_stem |
The Kotuńka Rock is a prominent rock found in the centre of the current of the river Dunajec just before the entry into Szczawnica. Built from limestone, the rock is well seen from the road and is a characteristic landmark in the area. Just above the rock the Grajcarek flows into the Dunajec | https://huggingface.co/datasets/fmars/wiki_stem |
The Pannonian Basin, or Carpathian Basin, is a large basin situated in south-east Central Europe. The geomorphological term Pannonian Plain is more widely used for roughly the same region though with a somewhat different sense, with only the lowlands, the plain that remained when the Pliocene Epoch Pannonian Sea dried out.
Terminology
In English language, the terms "Pannonian Basin" and "Carpathian Basin" are used synonymously | https://huggingface.co/datasets/fmars/wiki_stem |
The Pieniny Klippen Belt is in geology a tectonically and orographically remarkable zone in the Western Carpathians, with a very complex geological structure. It is a narrow (only 0. 4 to 19 km) and extremely long (about 600 km) north banded zone of extreme shortening and sub-vertical strike-slip fault zone, with complex geological history, where only fragments of individual strata and facies are preserved | https://huggingface.co/datasets/fmars/wiki_stem |
The Trans-European Suture Zone (TESZ), also known as the Tornquist Zone, is the crustal boundary between the Precambrian East European Craton and the Phanerozoic orogens of South-Western Europe. The zone runs from the North Sea to the Black Sea. The north-western part of the zone was created by the collision of Avalonia and Baltica/East European Craton in the Late Ordovician | https://huggingface.co/datasets/fmars/wiki_stem |
Madeira began to form more than 100 million years ago in the Early Cretaceous, although most of the island has formed in the last 66 million years of the Cenozoic, particularly in the Miocene and Pliocene. The island is an example of hotspot volcanism, with mainly mafic volcanic and igneous rocks, together with smaller deposits of limestone, lignite and other sediments that record its long-running uplift.
Stratigraphy, tectonics and geologic history
During the Early Cretaceous, massive sedimentation offshore of Africa built up enough stress on the crust to prompt fissuring and fracturing | https://huggingface.co/datasets/fmars/wiki_stem |
Alarsite (AlAsO4) is an aluminium arsenate mineral with its name derived from its composition: aluminium and arsenate. It occurs as brittle subhedral grains which exhibit trigonal symmetry. It has a Mohs hardness of 5-5 | https://huggingface.co/datasets/fmars/wiki_stem |
Barents Sea dike swarm consists of two groups of dolerite dikes across the Svalbard and Franz Josef Land regions. The emplacement of dikes was associated with the Cretaceous High Arctic Large Igneous Province (HALIP).
As revealed by aeromagnetic data, the dolerite dikes in the northern Barents Sea can be grouped in two regional dike swarms running oblique to the northern passive margin of the Barents Sea: the Franz Josef Land and Svalbard dike swarms, respectively | https://huggingface.co/datasets/fmars/wiki_stem |
Icosahedrite is the first known naturally occurring quasicrystal phase. It has the composition Al63Cu24Fe13 and is a mineral approved by the International Mineralogical Association in 2010. Its discovery followed a 10-year-long systematic search by an international team of scientists led by Luca Bindi and Paul J | https://huggingface.co/datasets/fmars/wiki_stem |
Khatyrkite ( KAT-ee-ər-kyte) is a rare mineral which is mostly composed of copper and aluminium, but may contain up to about 15% of zinc or iron. Its chemical structure is described by an approximate formula (Cu,Zn)Al2 or (Cu,Fe)Al2. It was discovered in 1985 in a placer in association with another rare mineral cupalite ((Cu,Zn,Fe)Al) | https://huggingface.co/datasets/fmars/wiki_stem |
Lebedinsky iron ore deposit is an iron ore deposit in the Belgorod Oblast, near the city of Gubkin, on the territory of the Staro-Oskolsky iron ore region of the Kursk Magnetic Anomaly, which is on the balance sheet of Lebedinsky GOK OAO. It was discovered in 1956, the development of rich iron ores has been carried out since 1959, since 1973 a deposit of ferruginous quartzites has been developed. The explored reserves of iron ore are 4 | https://huggingface.co/datasets/fmars/wiki_stem |
Siberia, also known as Angaraland (or simply Angara) and Angarida, is an ancient craton in the heart of Siberia. Today forming the Central Siberian Plateau, it formed an independent landmass prior to its fusion into Pangea during the Late Carboniferous-Permian. The Verkhoyansk Sea, a passive continental margin, was fringing the Siberian Craton to the east in what is now the East Siberian Lowland | https://huggingface.co/datasets/fmars/wiki_stem |
The Uralian orogeny refers to the long series of linear deformation and mountain building events that raised the Ural Mountains, starting in the Late Carboniferous and Permian periods of the Palaeozoic Era, c. 323–299 and 299–251 million years ago (Mya) respectively, and ending with the last series of continental collisions in Triassic to early Jurassic times.
The region affected by the orogeny, the Uralian orogenic belt or the Uralides, is usually thought of as the boundary between Europe and Asia | https://huggingface.co/datasets/fmars/wiki_stem |
Flying Corps is a 1997 World War I flight simulator developed by Rowan Software and published by Empire Interactive.
Theme
It was one of the most popular flight simulators of its time due to its accurate flight models and graphics, and also the novelty factor of a First World War dog fight simulator. Flying Corps is one of the few flight simulators to have dealt with the First World War - Red Baron, Knights of the Sky and the more arcade-oriented Wings have attempted to do the same, but most companies focus on modern air combat and World War II (usually the Battle of Britain) | https://huggingface.co/datasets/fmars/wiki_stem |
Flying Heroes is a fantasy action game produced by Take 2 Interactive, Illusion Softworks, and Pterodon.
Gameplay
Reception
Flying Heroes was released to mixed reviews. The positive reviews included IGN awarding it an 8 | https://huggingface.co/datasets/fmars/wiki_stem |
Food Force is an educational game published by the United Nations World Food Programme (WFP) in 2005. Due to its content, it is considered a serious game (game with educational purpose). Players take on missions to distribute food in a famine-affected country and to help it to recover and become self-sufficient again | https://huggingface.co/datasets/fmars/wiki_stem |
Food Force 2 is an educational game developed with an aim to defy the pedantic system followed in many countries and to help children explore the community, learn importance of food nutrition. It is a sequel to Food Force, a game developed by the United Nations World Food Programme. Food Force 2 is free software released under the GNU GPL | https://huggingface.co/datasets/fmars/wiki_stem |
Football Manager 2007 (also known as Worldwide Soccer Manager 2007 in North America) is a 2006 football management simulation game. Commonly known as FM2007, it is the third game in the Football Manager series overall, following Football Manager 2006. It was developed by Sports Interactive, and published by Sega | https://huggingface.co/datasets/fmars/wiki_stem |
Football Manager 2008 (also known as Worldwide Soccer Manager 2008 in North America, and Fútbol Manager 2008 in South America) is the principal title of the 2008 edition of the football management simulation game series Football Manager. FM08 is the fourth game in the Football Manager series. It was developed by Sports Interactive, and published by Sega | https://huggingface.co/datasets/fmars/wiki_stem |
Forced is a single-player and co-op action role-playing game developed by BetaDwarf, released in October 2013 for Windows, OS X and Linux through the Steam platform as well as Wii U. It is about gladiators fighting for their freedom in a fantasy arena where they are assisted by a spirit-like character called Balfus. Gameplay consists of selecting a weapon class and abilities to combat the various enemies of each arena, while solving puzzles using the help of Balfus | https://huggingface.co/datasets/fmars/wiki_stem |
Forced: Showdown is a top-down single-player bullet-hell brawler developed by Danish indie game developer BetaDwarf. The game was released in March 2016 for Windows, OS X and Linux through Steam as well as GOG. com | https://huggingface.co/datasets/fmars/wiki_stem |
Forge of Empires is a browser-based strategy game developed by InnoGames. It was first launched on closed beta on 29 March 2012. The game was initially released on 17 April 2012 (open beta phase) | https://huggingface.co/datasets/fmars/wiki_stem |
A Fork in the Tale is a full motion video (FMV) comedic adventure game developed by Any River Entertainment and published by Electronic Arts on February 26, 1997. The game draws a heavy influence from Don Bluth's Dragon's Lair games and features Bay Area actors Dale Morris, Fred Smith, Michael Ronin Orlando, Eric Carlson, Kaliopi Eleni, Jett, Pamela Herron and Jody Mortara among the fifty plus roles, as well as voice-overs by comedian Rob Schneider. Because of the large number of video sequences, the game was originally released on 5 CDs | https://huggingface.co/datasets/fmars/wiki_stem |
Fortress Forever is a multiplayer first-person shooter total conversion modification for Half-Life 2. The game is based on Team Fortress Classic, and has been created by the Fortress Forever development team. The intended scope of Fortress Forever is to please older Team Fortress Classic fans, while at the same time creating a game enjoyable enough to players new to Team Fortress styled games | https://huggingface.co/datasets/fmars/wiki_stem |
Fragile Allegiance is an open-ended 4X real-time strategy (RTS) game from Gremlin Interactive, released in 1996 for MS-DOS and Windows 95. The game begins on May 25, 2496, as the player begins their employment with TetraCorp (a large interstellar megacorporation) who have set up a new asteroid mining franchise operation in the Fragmented Sectors. There are six alien races competing with Tetracorp for these resources | https://huggingface.co/datasets/fmars/wiki_stem |
Fraymakers is a platform fighting game developed by McLeodGaming. It was released in early access on Linux, macOS, and Windows PC via Steam on January 18, 2023. The game is additionally planned to release on Nintendo Switch once the early access period is complete | https://huggingface.co/datasets/fmars/wiki_stem |
Jonathan Gillette, known by the pseudonym why the lucky stiff (often abbreviated as _why), is a writer, cartoonist, artist, and programmer notable for his work with the Ruby programming language. Annie Lowrey described him as "one of the most unusual, and beloved, computer programmers" in the world. Along with Yukihiro Matsumoto and David Heinemeier Hansson, he was seen as one of the key figures in the Ruby community | https://huggingface.co/datasets/fmars/wiki_stem |
In mathematics and computer science, an algorithm ( (listen)) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually | https://huggingface.co/datasets/fmars/wiki_stem |
Coded exposure photography, also known as a flutter shutter, is the name given to any mathematical algorithm that reduces the effects of motion blur in photography. The key element of the coded exposure process is the mathematical formula that affects the shutter frequency. This involves the calculation of the relationship between the photon exposure of the light sensor and the randomized code | https://huggingface.co/datasets/fmars/wiki_stem |
An unrestricted algorithm is an algorithm for the computation of a mathematical function that puts no restrictions on the range of the argument or on the precision that may be demanded in the result. The idea of such an algorithm was put forward by C. W | https://huggingface.co/datasets/fmars/wiki_stem |
An adaptive algorithm is an algorithm that changes its behavior at the time it is run, based on information available and on a priori defined reward mechanism (or criterion). Such information could be the story of recently received data, information on the available computational resources, or other run-time acquired (or a priori known) information related to the environment in which it operates.
Among the most used adaptive algorithms is the Widrow-Hoff’s least mean squares (LMS), which represents a class of stochastic gradient-descent algorithms used in adaptive filtering and machine learning | https://huggingface.co/datasets/fmars/wiki_stem |
Algorism is the technique of performing basic arithmetic by writing numbers in place value form and applying a set of memorized rules and facts to the digits. One who practices algorism is known as an algorist. This positional notation system has largely superseded earlier calculation systems that used a different set of symbols for each numerical magnitude, such as Roman numerals, and in some cases required a device such as an abacus | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithm engineering focuses on the design, analysis, implementation, optimization, profiling and experimental evaluation of computer algorithms, bridging the gap between algorithm theory and practical applications of algorithms in software engineering.
It is a general methodology for algorithmic research.
Origins
In 1995, a report from an NSF-sponsored workshop "with the purpose of assessing the current goals and directions of the Theory of Computing (TOC) community" identified the slow speed of adoption of theoretical insights by practitioners as an important issue and suggested measures to
reduce the uncertainty by practitioners whether a certain theoretical breakthrough will translate into practical gains in their field of work, and
tackle the lack of ready-to-use algorithm libraries, which provide stable, bug-free and well-tested implementations for algorithmic problems and expose an easy-to-use interface for library consumers | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithmic game theory (AGT) is an area in the intersection of game theory and computer science, with the objective of understanding and design of algorithms in strategic environments.
Typically, in Algorithmic Game Theory problems, the input to a given algorithm is distributed among many players who have a personal interest in the output. In those situations, the agents might not report the input truthfully because of their own personal interests | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithmic logic is a calculus of programs that allows the expression of semantic properties of programs by appropriate logical formulas. It provides a framework that enables proving the formulas from the axioms of program constructs such as assignment, iteration and composition instructions and from the axioms of the data structures in question see Mirkowska & Salwicki (1987), Banachowski et al. (1977) | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithmic Puzzles is a book of puzzles based on computational thinking. It was written by computer scientists Anany and Maria Levitin, and published in 2011 by Oxford University Press.
Topics
The book begins with a "tutorial" introducing classical algorithm design techniques including backtracking, divide-and-conquer algorithms, and dynamic programming, methods for the analysis of algorithms, and their application in example puzzles | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithmic transparency is the principle that the factors that influence the decisions made by algorithms should be visible, or transparent, to the people who use, regulate, and are affected by systems that employ those algorithms. Although the phrase was coined in 2016 by Nicholas Diakopoulos and Michael Koliska about the role of algorithms in deciding the content of digital journalism services, the underlying principle dates back to the 1970s and the rise of automated systems for scoring consumer credit.
The phrases "algorithmic transparency" and "algorithmic accountability" are sometimes used interchangeably – especially since they were coined by the same people – but they have subtly different meanings | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithms and Combinatorics (ISSN 0937-5511) is a book series in mathematics, and particularly in combinatorics and the design and analysis of algorithms. It is published by Springer Science+Business Media, and was founded in 1987.
Books
As of 2018, the books published in this series include:
The Simplex Method: A Probabilistic Analysis (Karl Heinz Borgwardt, 1987, vol | https://huggingface.co/datasets/fmars/wiki_stem |
Algorithms of Oppression: How Search Engines Reinforce Racism is a 2018 book by Safiya Umoja Noble in the fields of information science, machine learning, and human-computer interaction.
Background
Noble earned an undergraduate degree in sociology from California State University, Fresno in the 1990s, then worked in advertising and marketing for fifteen years before going to the University of Illinois Urbana-Champaign for a Master of Library and Information Science degree in the early 2000s. The book's first inspiration came in 2011, when Noble Googled the phrase "black girls" and saw results for pornography on the first page | https://huggingface.co/datasets/fmars/wiki_stem |
Automate This: How Algorithms Came to Rule Our World is a book written by Christopher Steiner and published by Penguin Group. Steiner begins his study of algorithms on Wall Street in the 1980s but also provides examples from other industries. For example, he explains the history of Pandora Radio and the use of algorithms in music identification | https://huggingface.co/datasets/fmars/wiki_stem |
AVT Statistical filtering algorithm is an approach to improving quality of raw data collected from various sources. It is most effective in cases when there is inband noise present. In those cases AVT is better at filtering data then, band-pass filter or any digital filtering based on variation of | https://huggingface.co/datasets/fmars/wiki_stem |
Birkhoff's algorithm (also called Birkhoff-von-Neumann algorithm) is an algorithm for decomposing a bistochastic matrix into a convex combination of permutation matrices. It was published by Garrett Birkhoff in 1946. : 36 It has many applications | https://huggingface.co/datasets/fmars/wiki_stem |
Bisection is a method used in software development to identify change sets that result in a specific behavior change. It is mostly employed for finding the patch that introduced a bug. Another application area is finding the patch that indirectly fixed a bug | https://huggingface.co/datasets/fmars/wiki_stem |
In computer algorithms, Block swap algorithms swap two regions of elements of an array. It is simple to swap two non-overlapping regions of an array of equal size. However, it is not simple to swap two non-overlapping regions of an array in-place that are next to each other, but are of unequal sizes (such swapping is equivalent to Array Rotation) | https://huggingface.co/datasets/fmars/wiki_stem |
Broadcast is a collective communication primitive in parallel programming to distribute programming instructions or data to nodes in a cluster. It is the reverse operation of reduction. The broadcast operation is widely used in parallel algorithms, such as matrix-vector multiplication, Gaussian elimination and shortest paths | https://huggingface.co/datasets/fmars/wiki_stem |
Car–Parrinello molecular dynamics or CPMD refers to either a method used in molecular dynamics (also known as the Car–Parrinello method) or the computational chemistry software package used to implement this method. The CPMD method is one of the major methods for calculating ab-initio molecular dynamics (ab-inito MD or AIMD).
Ab initio molecular dynamics (ab initio MD) is a computational method that uses first principles, or fundamental laws of nature, to simulate the motion of atoms in a system | https://huggingface.co/datasets/fmars/wiki_stem |
In theoretical computer science, a certifying algorithm is an algorithm that outputs, together with a solution to the problem it solves, a proof that the solution is correct. A certifying algorithm is said to be efficient if the combined runtime of the algorithm and a proof checker is slower by at most a constant factor than the best known non-certifying algorithm for the same problem. The proof produced by a certifying algorithm should be in some sense simpler than the algorithm itself, for otherwise any algorithm could be considered certifying (with its output verified by running the same algorithm again) | https://huggingface.co/datasets/fmars/wiki_stem |
The Chandy–Misra–Haas algorithm resource model checks for deadlock in a distributed system. It was developed by K. Mani Chandy, Jayadev Misra and Laura M Haas | https://huggingface.co/datasets/fmars/wiki_stem |
Collective operations are building blocks for interaction patterns, that are often used in SPMD algorithms in the parallel programming context. Hence, there is an interest in efficient realizations of these operations.
A realization of the collective operations is provided by the Message Passing Interface (MPI) | https://huggingface.co/datasets/fmars/wiki_stem |
The r-to-1 collision problem is an important theoretical problem in complexity theory, quantum computing, and computational mathematics. The collision problem most often refers to the 2-to-1 version: given
n
{\displaystyle n}
even and a function
f
:
{
1
,
…
,
n
}
→
{
1
,
…
,
n
}
{\displaystyle f:\,\{1,\ldots ,n\}\rightarrow \{1,\ldots ,n\}}
, we are promised that f is either 1-to-1 or 2-to-1. We are only allowed to make queries about the value of
f
(
i
)
{\displaystyle f(i)}
for any
i
∈
{
1
,
…
,
n
}
{\displaystyle i\in \{1,\ldots ,n\}}
| https://huggingface.co/datasets/fmars/wiki_stem |
Communication-avoiding algorithms minimize movement of data within a memory hierarchy for improving its running-time and energy consumption. These minimize the total of two costs (in terms of time and energy): arithmetic and communication. Communication, in this context refers to moving data, either between levels of memory or between multiple processors over a network | https://huggingface.co/datasets/fmars/wiki_stem |
In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem | https://huggingface.co/datasets/fmars/wiki_stem |
Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate through a tree by working along multiple branches in parallel and merging the results of each branch into one common solution, in order to minimize time spent searching for a value in a tree-like data structure.
The original paper was written in 1988 by Chris Ferguson and Richard E | https://huggingface.co/datasets/fmars/wiki_stem |
The driver scheduling problem (DSP) is type of problem in operations research and theoretical computer science.
The DSP consists of selecting a set of duties (assignments) for the drivers or pilots of vehicles (e. g | https://huggingface.co/datasets/fmars/wiki_stem |
An emergent algorithm is an algorithm that exhibits emergent behavior. In essence an emergent algorithm implements a set of simple building block behaviors that when combined exhibit more complex behaviors. One example of this is the implementation of fuzzy motion controllers used to adapt robot movement in response to environmental obstacles | https://huggingface.co/datasets/fmars/wiki_stem |
In computer science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem. Formally, such an algorithm applies to problems that take an input and produce a list of solutions, similarly to function problems. For each input, the enumeration algorithm must produce the list of all solutions, without duplicates, and then halt | https://huggingface.co/datasets/fmars/wiki_stem |
The Flajolet–Martin algorithm is an algorithm for approximating the number of distinct elements in a stream with a single pass and space-consumption logarithmic in the maximal number of possible distinct elements in the stream (the count-distinct problem). The algorithm was introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article "Probabilistic Counting Algorithms for Data Base Applications" | https://huggingface.co/datasets/fmars/wiki_stem |
In mathematics, economics, and computer science, the Gale–Shapley algorithm (also known as the deferred acceptance algorithm or propose-and-reject algorithm) is an algorithm for finding a solution to the stable matching problem, named for David Gale and Lloyd Shapley. It takes polynomial time, and the time is linear in the size of the input to the algorithm. It is a truthful mechanism from the point of view of the proposing participants, for whom the solution will always be optimal | https://huggingface.co/datasets/fmars/wiki_stem |
The generalized distributive law (GDL) is a generalization of the distributive property which gives rise to a general message passing algorithm. It is a synthesis of the work of many authors in the information theory, digital communications, signal processing, statistics, and artificial intelligence communities. The law and algorithm were introduced in a semi-tutorial by Srinivas M | https://huggingface.co/datasets/fmars/wiki_stem |
The Gutmann method is an algorithm for securely erasing the contents of computer hard disk drives, such as files. Devised by Peter Gutmann and Colin Plumb and presented in the paper Secure Deletion of Data from Magnetic and Solid-State Memory in July 1996, it involved writing a series of 35 patterns over the region to be erased.
The selection of patterns assumes that the user does not know the encoding mechanism used by the drive, so it includes patterns designed specifically for three types of drives | https://huggingface.co/datasets/fmars/wiki_stem |
HAKMEM, alternatively known as AI Memo 239, is a February 1972 "memo" (technical report) of the MIT AI Lab containing a wide variety of hacks, including useful and clever algorithms for mathematical computation, some number theory and schematic diagrams for hardware – in Guy L. Steele's words, "a bizarre and eclectic potpourri of technical trivia".
Contributors included about two dozen members and associates of the AI Lab | https://huggingface.co/datasets/fmars/wiki_stem |
Hall circles (also known as M-circles and N-circles) are a graphical tool in control theory used to obtain values of a closed-loop transfer function from the Nyquist plot (or the Nichols plot) of the associated open-loop transfer function. Hall circles have been introduced in control theory by Albert C. Hall in his thesis | https://huggingface.co/datasets/fmars/wiki_stem |
In fractal geometry, the Higuchi dimension (or Higuchi fractal dimension (HFD)) is an approximate value for the box-counting dimension of the graph of a real-valued function or time series. This value is obtained via an algorithmic approximation so one also talks about the Higuchi method. It has many applications in science and engineering and has been applied to subjects like characterizing primary waves in seismograms, clinical neurophysiology and analyzing changes in the electroencephalogram in Alzheimer’s disease | https://huggingface.co/datasets/fmars/wiki_stem |
A Hindley–Milner (HM) type system is a classical type system for the lambda calculus with parametric polymorphism. It is also known as Damas–Milner or Damas–Hindley–Milner. It was first described by J | https://huggingface.co/datasets/fmars/wiki_stem |
In computer science, a holographic algorithm is an algorithm that uses a holographic reduction. A holographic reduction is a constant-time reduction that maps solution fragments many-to-many such that the sum of the solution fragments remains unchanged. These concepts were introduced by Leslie Valiant, who called them holographic because "their effect can be viewed as that of producing interference patterns among the solution fragments" | https://huggingface.co/datasets/fmars/wiki_stem |
How to Solve it by Computer is a computer science book by R. G. Dromey, first published by Prentice-Hall in 1982 | https://huggingface.co/datasets/fmars/wiki_stem |
A hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, either choosing one based on some characteristic of the data, or switching between them over the course of the algorithm. This is generally done to combine desired features of each, so that the overall algorithm is better than the individual components.
"Hybrid algorithm" does not refer to simply combining multiple algorithms to solve a different problem – many algorithms can be considered as combinations of simpler pieces – but only to combining algorithms that solve the same problem, but differ in other characteristics, notably performance | https://huggingface.co/datasets/fmars/wiki_stem |
Syllabification () or syllabication (), also known as hyphenation, is the separation of a word into syllables, whether spoken, written or signed.
Overview
The written separation into syllables is usually marked by a hyphen when using English orthography (e. g | https://huggingface.co/datasets/fmars/wiki_stem |
In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional to the input size. In other words, it modifies the input in place, without creating a separate copy of the data structure. An algorithm which is not in-place is sometimes called not-in-place or out-of-place | https://huggingface.co/datasets/fmars/wiki_stem |
Irish logarithms were a system of number manipulation invented by Percy Ludgate for machine multiplication. The system used a combination of mechanical cams as look-up tables and mechanical addition to sum pseudo-logarithmic indices to produce partial products, which were then added to produce results. The technique is similar to Zech logarithms (also known as Jacobi logarithms), but uses a system of indices original to Ludgate | https://huggingface.co/datasets/fmars/wiki_stem |
Iteration is the repetition of a process in order to generate a (possibly unbounded) sequence of outcomes. Each repetition of the process is a single iteration, and the outcome of each iteration is then the starting point of the next iteration.
In mathematics and computer science, iteration (along with the related technique of recursion) is a standard element of algorithms | https://huggingface.co/datasets/fmars/wiki_stem |
Jumble is a word puzzle with a clue, a drawing illustrating the clue, and a set of words, each of which is “jumbled” by scrambling its letters. A solver reconstructs the words, and then arranges letters at marked positions in the words to spell the answer phrase to the clue. The clue, and sometimes the illustration, provide hints about the answer phrase, which frequently uses a homophone or pun | https://huggingface.co/datasets/fmars/wiki_stem |
In robotics and motion planning, kinodynamic planning is a class of problems for which velocity, acceleration, and force/torque bounds must be satisfied, together with kinematic constraints such as avoiding obstacles. The term was coined by Bruce Donald, Pat Xavier, John Canny, and John Reif. Donald et al | https://huggingface.co/datasets/fmars/wiki_stem |
The Kinetic Simulation Algorithm Ontology (KiSAO) supplies information about existing algorithms available for the simulation of systems biology models, their characterization and interrelationships. KiSAO is part of the BioModels. net project and of the COMBINE initiative | https://huggingface.co/datasets/fmars/wiki_stem |
In theoretical computer science, in particular in formal language theory, Kleene's algorithm transforms a given nondeterministic finite automaton (NFA) into a regular expression.
Together with other conversion algorithms, it establishes the equivalence of several description formats for regular languages. Alternative presentations of the same method include the "elimination method" attributed to Brzozowski and McCluskey, the algorithm of McNaughton and Yamada, and the use of Arden's lemma | https://huggingface.co/datasets/fmars/wiki_stem |
In computer science, the Krauss wildcard-matching algorithm is a pattern matching algorithm. Based on the wildcard syntax in common use, e. g | https://huggingface.co/datasets/fmars/wiki_stem |
Lamé's Theorem is the result of Gabriel Lamé's analysis of the complexity of Euclidean algorithm. Using Fibonacci numbers, he proved in 1844 that when looking for the greatest common divisor (GCD) of two integers a and b, the algorithm finishes in at most 5k steps, where k is the number of digits (decimal) of b.
Statement
The number of division steps in Euclid's algorithm with entries
u
{\displaystyle u\,\!}
and
v
{\displaystyle v\,\!}
is less than
5
{\displaystyle 5}
times the number of decimal digits of
min
(
u
,
v
)
{\displaystyle \min(u,v)\,\!}
| https://huggingface.co/datasets/fmars/wiki_stem |
Lancichinetti–Fortunato–Radicchi benchmark is an algorithm that generates benchmark networks (artificial networks that resemble real-world networks). They have a priori known communities and are used to compare different community detection methods. The advantage of the benchmark over other methods is that it accounts for the heterogeneity in the distributions of node degrees and of community sizes | https://huggingface.co/datasets/fmars/wiki_stem |
A learning augmented algorithm is an algorithm that can make use of a prediction to improve its performance.
Whereas in regular algorithms just the problem instance is inputted, learning augmented algorithms accept an extra parameter.
This extra parameter often is a prediction of some property of the solution | https://huggingface.co/datasets/fmars/wiki_stem |
In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit Hindu-Arabic numerals (Positional notation) that is simple enough to perform by hand. It breaks down a division problem into a series of easier steps.
As in all division problems, one number, called the dividend, is divided by another, called the divisor, producing a result called the quotient | https://huggingface.co/datasets/fmars/wiki_stem |
Maze generation algorithms are automated methods for the creation of mazes.
Graph theory based methods
A maze can be generated by starting with a predetermined arrangement of cells (most commonly a rectangular grid but other arrangements are possible) with wall sites between them. This predetermined arrangement can be considered as a connected graph with the edges representing possible wall sites and the nodes representing cells | https://huggingface.co/datasets/fmars/wiki_stem |
A maze-solving algorithm is an automated method for solving a maze. The random mouse, wall follower, Pledge, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead-end filling and shortest path algorithms are designed to be used by a person or computer program that can see the whole maze at once.
Mazes containing no loops are known as "simply connected", or "perfect" mazes, and are equivalent to a tree in graph theory | https://huggingface.co/datasets/fmars/wiki_stem |
A medical algorithm is any computation, formula, statistical survey, nomogram, or look-up table, useful in healthcare. Medical algorithms include decision tree approaches to healthcare treatment (e. g | https://huggingface.co/datasets/fmars/wiki_stem |
The multiplicative weights update method is an algorithmic technique most commonly used for decision making and prediction, and also widely deployed in game theory and algorithm design. The simplest use case is the problem of prediction from expert advice, in which a decision maker needs to iteratively decide on an expert whose advice to follow. The method assigns initial weights to the experts (usually identical initial weights), and updates these weights multiplicatively and iteratively according to the feedback of how well an expert performed: reducing it in case of poor performance, and increasing it otherwise | https://huggingface.co/datasets/fmars/wiki_stem |
Neural style transfer (NST) refers to a class of software algorithms that manipulate digital images, or videos, in order to adopt the appearance or visual style of another image. NST algorithms are characterized by their use of deep neural networks for the sake of image transformation. Common uses for NST are the creation of artificial artwork from photographs, for example by transferring the appearance of famous paintings to user-supplied photographs | https://huggingface.co/datasets/fmars/wiki_stem |
Newest Vertex Bisection is an algorithmic method to locally refine triangulations. It is widely used in computational science, numerical simulation, and computer graphics. The advantage of newest vertex bisection is that it allows local refinement of triangulations without degenerating the shape of the triangles after repeated usage | https://huggingface.co/datasets/fmars/wiki_stem |
In general relativity, the Newman–Janis algorithm (NJA) is a complexification technique for finding exact solutions to the Einstein field equations. In 1964, Newman and Janis showed that the Kerr metric could be obtained from the Schwarzschild metric by means of a coordinate transformation and allowing the radial coordinate to take on complex values. Originally, no clear reason for why the algorithm works was known | https://huggingface.co/datasets/fmars/wiki_stem |
The notion of non-malleable codes was introduced in 2010 by Dziembowski, Pietrzak, and Wichs, for relaxing the notion of error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified code-word is either the original message, or a completely unrelated value. Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction and error-detection is impossible; for example, when the attacker can completely overwrite the encoded message | https://huggingface.co/datasets/fmars/wiki_stem |
Online optimization is a field of optimization theory, more popular in computer science and operations research, that deals with optimization problems having no or incomplete knowledge of the future (online). These kind of problems are denoted as online problems and are seen as opposed to the classical optimization problems where complete information is assumed (offline). The research on online optimization can be distinguished into online problems where multiple decisions are made sequentially based on a piece-by-piece input and those where a decision is made only once | https://huggingface.co/datasets/fmars/wiki_stem |
The Pan–Tompkins algorithm is commonly used to detect QRS complexes in electrocardiographic signals (ECG). The QRS complex represents the ventricular depolarization and the main spike visible in an ECG signal (see figure). This feature makes it particularly suitable for measuring heart rate, the first way to assess the heart health state | https://huggingface.co/datasets/fmars/wiki_stem |
A parameterized approximation algorithm is a type of algorithm that aims to find approximate solutions to NP-hard optimization problems in polynomial time in the input size and a function of a specific parameter. These algorithms are designed to combine the best aspects of both traditional approximation algorithms and fixed-parameter tractability.
In traditional approximation algorithms, the goal is to find solutions that are at most a certain factor
α
{\displaystyle \alpha }
away from the optimal solution, known as an
α
{\displaystyle \alpha }
-approximation, in polynomial time | https://huggingface.co/datasets/fmars/wiki_stem |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.