text
stringlengths 31
999
| source
stringclasses 5
values |
|---|---|
Nicotinamide mononucleotide (“NMN” and “β-NMN”) is a nucleotide derived from ribose, nicotinamide, nicotinamide riboside and niacin. In humans, several enzymes use NMN to generate nicotinamide adenine dinucleotide (NADH). In mice, it has been proposed that NMN is absorbed via the small intestine within 10 minutes of oral uptake and converted to nicotinamide adenine dinucleotide (NAD+) through the Slc12a8 transporter
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Nicotinic acid adenine dinucleotide phosphate, (NAADP), is a Ca2+-mobilizing second messenger synthesised in response to extracellular stimuli. Like its mechanistic cousins, IP3 and cyclic adenosine diphosphoribose (Cyclic ADP-ribose), NAADP binds to and opens Ca2+ channels on intracellular organelles, thereby increasing the intracellular Ca2+ concentration which, in turn, modulates sundry cellular processes (see Calcium signalling). Structurally, it is a dinucleotide that only differs from the house-keeping enzyme cofactor, NADP by a hydroxyl group (replacing the nicotinamide amino group) and yet this minor modification converts it into the most potent Ca2+-mobilizing second messenger yet described
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An NTP binding site is a type of binding site found in nucleoside monophosphate (NMP) kinases, N can be adenosine or guanosine. A P-loop is one of the structural motifs common for nucleoside triphosphate (NTP) binding sites, it interacts with the bound nucleotide's phosphoryl groups. For the binding site to be able to bind a nucleotide, the nucleotide must be complex bound to Mg2+ or Mn2+
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The nucleic acid notation currently in use was first formalized by the International Union of Pure and Applied Chemistry (IUPAC) in 1970. This universally accepted notation uses the Roman characters G, C, A, and T, to represent the four nucleotides commonly found in deoxyribonucleic acids (DNA).
Given the rapidly expanding role for genetic sequencing, synthesis, and analysis in biology, some researchers have developed alternate notations to further support the analysis and manipulation of genetic data
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A nucleoside triphosphate is a nucleoside containing a nitrogenous base bound to a 5-carbon sugar (either ribose or deoxyribose), with three phosphate groups bound to the sugar. They are the molecular precursors of both DNA and RNA, which are chains of nucleotides made through the processes of DNA replication and transcription. Nucleoside triphosphates also serve as a source of energy for cellular reactions and are involved in signalling pathways
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A salvage pathway is a pathway in which a biological product is produced from intermediates in the degradative pathway of its own or a similar substance. The term often refers to nucleotide salvage in particular, in which nucleotides (purine and pyrimidine) are synthesized from intermediates in their degradative pathway.
Nucleotide salvage pathways are used to recover bases and nucleosides that are formed during degradation of RNA and DNA
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Nucleotide sugars are the activated forms of monosaccharides. Nucleotide sugars act as glycosyl donors in glycosylation reactions. Those reactions are catalyzed by a group of enzymes called glycosyltransferases
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Nullomers are short sequences of DNA that do not occur in the genome of a species (for example, humans), even though they are theoretically possible. Nullomers must be under selective pressure - for example, they may be toxic to the cell. Some nullomers have been shown to be useful to treat leukemia, breast, and prostate cancer
|
https://huggingface.co/datasets/fmars/wiki_stem
|
3′-Phosphoadenosine-5′-phosphosulfate (PAPS) is a derivative of adenosine monophosphate (AMP) that is phosphorylated at the 3′ position and has a sulfate group attached to the 5′ phosphate. It is the most common coenzyme in sulfotransferase reactions and hence part of sulfation pathways. It is endogenously synthesized by organisms via the phosphorylation of adenosine 5′-phosphosulfate (APS), an intermediary metabolite
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Phosphoribosyl-N-formylglycineamide (or FormylGlycinAmideRibotide, FGAR) is a biochemical intermediate in the formation of purine nucleotides via inosine-5-monophosphate, and hence is a building block for DNA and RNA. The vitamins thiamine and cobalamin also contain fragments derived from FGAR. FGAR is formed when the enzyme phosphoribosylglycinamide formyltransferase adds a formyl group from 10-formyltetrahydrofolate to glycineamide ribonucleotide (GAR) in reaction EC 2
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A phosphorimidazolide is a chemical compound in which a phosphoryl mono-ester is covalently bound to a nitrogen atom in an imidazole ring. They are a type of phosphoramidate. These phosphorus (V) compounds are encountered as reagents used for making new phosphoanhydride bonds with phosphate mono-esters, and as reactive intermediates in phosphoryl transfer reactions in some enzyme-catalyzed transformations
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In chemistry, pyrophosphates are phosphorus oxyanions that contain two phosphorus atoms in a P–O–P linkage. A number of pyrophosphate salts exist, such as disodium pyrophosphate (Na2H2P2O7) and tetrasodium pyrophosphate (Na4P2O7), among others. Often pyrophosphates are called diphosphates
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Sugar phosphates (sugars that have added or substituted phosphate groups) are often used in biological systems to store or transfer energy. They also form the backbone for DNA and RNA. Sugar phosphate backbone geometry is altered in the vicinity of the modified nucleotides
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Thymidine diphosphate glucose (often abbreviated dTDP-glucose or TDP-glucose) is a nucleotide-linked sugar consisting of deoxythymidine diphosphate linked to glucose. It is the starting compound for the syntheses of many deoxysugars.
Biosynthesis
DTDP-glucose is produced by the enzyme glucose-1-phosphate thymidylyltransferase and is synthesized from dTTP and glucose-1-phosphate
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Ecca Group is the second of the main subdivisions of the Karoo Supergroup of geological strata in southern Africa. It mainly follows conformably after the Dwyka Group in some sections, but in some localities overlying unconformably over much older basement rocks. It underlies the Beaufort Group in all known outcrops and exposures
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Forest Sandstone is a geological formation in southern Africa, dating to roughly between 200 and 190 million years ago and covering the Hettangian to Sinemurian stages of the Jurassic Period in the Mesozoic Era. As its name suggests, it consists mainly of sandstone.
Fossils of the prosauropod dinosaur Massospondylus and the primitive sauropod Vulcanodon have been recovered from the Forest Sandstone
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A paleoburrow is an underground shelter (tunnel, burrow, lair, etc. ) excavated by extinct paleo-vertebrate megafauna (i. e
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Dinosaur Park Formation is the uppermost member of the Belly River Group (also known as the Judith River Group), a major geologic unit in southern Alberta. It was deposited during the Campanian stage of the Late Cretaceous, between about 76. 5 and 74
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Green Point is located 12 km north of the town of Rocky Harbour in Gros Morne National Park, on the west coast of Newfoundland. It is the home to a small summer fishing community and a drive-in campground. In 2000, Green Point was designated the Global Stratotype Section and Point (GSSP) representing the division between the Cambrian and the Ordovician systems
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short check value attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated and, in the event the check values do not match, corrective action can be taken against data corruption
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Densely packed decimal (DPD) is an efficient method for binary encoding decimal digits.
The traditional system of binary encoding for decimal digits, known as binary-coded decimal (BCD), uses four bits to encode each digit, resulting in significant wastage of binary data bandwidth (since four bits can store 16 states and are being used to store only 10), even when using packed BCD. Densely packed decimal is a more efficient code that packs three digits into ten bits using a scheme that allows compression from, or expansion to, BCD with only two or three hardware gate delays
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or remainder, the result of Euclidean division. Some are applied by hand, while others are employed by digital circuit designs and software.
Division algorithms fall into two main categories: slow division and fast division
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, division by two or halving has also been called mediation or dimidiation. The treatment of this as a different operation from multiplication and division by other numbers goes back to the ancient Egyptians, whose multiplication algorithm used division by two as one of its fundamental steps.
Some mathematicians as late as the sixteenth century continued to view halving as a separate operation, and it often continues to be treated separately in modern computer programming
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer science, the double dabble algorithm is used to convert binary numbers into binary-coded decimal (BCD) notation. It is also known as the shift-and-add-3 algorithm, and can be implemented using a small number of gates in computer hardware, but at the expense of high latency.
Algorithm
The algorithm operates as follows:
Suppose the original number to be converted is stored in a register that is n bits wide
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Double-precision floating-point format (sometimes called FP64 or float64) is a floating-point number format, usually occupying 64 bits in computer memory; it represents a wide dynamic range of numeric values by using a floating radix point.
Floating point is used to represent fractional values, or when a wider range is needed than is provided by fixed point (of the same bit width), even if at the cost of precision. Double precision may be chosen when the range or precision of single precision would be insufficient
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Excess-3, 3-excess or 10-excess-3 binary code (often abbreviated as XS-3, 3XS or X3), shifted binary or Stibitz code (after George Stibitz, who built a relay-based adding machine in 1937) is a self-complementary binary-coded decimal (BCD) code and numeral system. It is a biased representation. Excess-3 code was used on some older computers as well as in cash registers and hand-held portable electronic calculators of the 1970s, among other uses
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Offset binary, also referred to as excess-K, excess-N, excess-e, excess code or biased representation, is a method for signed number representation where a signed number n is represented by the bit pattern corresponding to the unsigned number n+K, K being the biasing value or offset. There is no standard for offset binary, but most often the K for an n-bit binary word is K = 2n−1 (for example, the offset for a four-digit binary number would be 23=8). This has the consequence that the minimal negative value is represented by all-zeros, the "zero" value is represented by a 1 in the most significant bit and zero in all other bits, and the maximal positive value is represented by all-ones (conveniently, this is the same as using two's complement but with the most significant bit inverted)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, signed number representations are required to encode negative numbers in binary number systems.
In mathematics, negative numbers in any base are represented by prefixing them with a minus sign ("−"). However, in RAM or CPU registers, numbers are represented only as sequences of bits, without extra symbols
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, the fibbinary numbers are the numbers whose binary representation does not contain two consecutive ones. That is, they are sums of distinct and non-consecutive powers of two.
Relation to binary and Fibonacci numbers
The fibbinary numbers were given their name by Marc LeBrun, because they combine certain properties of binary numbers and Fibonacci numbers:
The number of fibbinary numbers less than any given power of two is a Fibonacci number
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer software and hardware, find first set (ffs) or find first one is a bit operation that, given an unsigned machine word, designates the index or position of the least significant bit set to one in the word counting from the least significant bit position. A nearly equivalent operation is count trailing zeros (ctz) or number of trailing zeros (ntz), which counts the number of zero bits following the least significant one bit. The complementary operation that finds the index or position of the most significant set bit is log base 2, so called because it computes the binary logarithm ⌊log2(x)⌋
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Finger binary is a system for counting and displaying binary numbers on the fingers of either or both hands. Each finger represents one binary digit or bit. This allows counting from zero to 31 using the fingers of one hand, or 1023 using both: that is, up to 25−1 or 210−1 respectively
|
https://huggingface.co/datasets/fmars/wiki_stem
|
GF(2) (also denoted
F
2
{\displaystyle \mathbb {F} _{2}}
, Z/2Z or
Z
/
2
Z
{\displaystyle \mathbb {Z} /2\mathbb {Z} }
) is the finite field of two elements (GF is the initialism of Galois field, another name for finite fields). Notations Z2 and
Z
2
{\displaystyle \mathbb {Z} _{2}}
may be encountered although they can be confused with the notation of 2-adic integers.
GF(2) is the field with the smallest possible number of elements, and is unique if the additive identity and the multiplicative identity are denoted respectively 0 and 1, as usual
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The reflected binary code (RBC), also known as reflected binary (RB) or Gray code after Frank Gray, is an ordering of the binary numeral system such that two successive values differ in only one bit (binary digit).
For example, the representation of the decimal value "1" in binary would normally be "001" and "2" would be "010". In Gray code, these values are represented as "001" and "011"
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, half precision (sometimes called FP16 or float16) is a binary floating-point computer number format that occupies 16 bits (two bytes in modern computers) in computer memory. It is intended for storage of floating-point values in applications where higher precision is not essential, in particular image processing and neural networks.
Almost all modern uses follow the IEEE 754-2008 standard, where the 16-bit base-2 format is referred to as binary16, and the exponent uses 5 bits
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics and computing, the hexadecimal (also base-16 or simply hex) numeral system is a positional numeral system that represents numbers using a radix (base) of sixteen. Unlike the decimal system representing numbers using ten symbols, hexadecimal uses sixteen distinct symbols, most often the symbols "0"–"9" to represent values 0 to 9, and "A"–"F" (or alternatively "a"–"f") to represent values from ten to fifteen.
Software developers and system designers widely use hexadecimal numbers because they provide a human-friendly representation of binary-coded values
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The IEEE Standard for Floating-Point Arithmetic (IEEE 754) is a technical standard for floating-point arithmetic established in 1985 by the Institute of Electrical and Electronics Engineers (IEEE). The standard addressed many problems found in the diverse floating-point implementations that made them difficult to use reliably and portably. Many hardware floating-point units use the IEEE 754 standard
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, bit numbering is the convention used to identify the bit positions in a binary number.
Bit significance and indexing
In computing, the least significant bit (LSb) is the bit position in a binary integer representing the binary 1s place of the integer. Similarly, the most significant bit (MSb) represents the highest-order place of the binary integer
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, a linear-feedback shift register (LFSR) is a shift register whose input bit is a linear function of its previous state.
The most commonly used linear function of single bits is exclusive-or (XOR). Thus, an LFSR is most often a shift register whose input bit is driven by the XOR of some bits of the overall shift register value
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer science, a logical shift is a bitwise operation that shifts all the bits of its operand. The two base variants are the logical left shift and the logical right shift. This is further modulated by the number of bit positions a given value shall be shifted, such as shift left by 1 or shift right by n
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer science, a mask or bitmask is data that is used for bitwise operations, particularly in a bit field. Using a mask, multiple bits in a byte, nibble, word, etc. can be set either on or off, or inverted from on to off (or vice versa) in a single bitwise operation
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The octal, or oct for short, is the base-8 positional numeral system, and uses the digits 0 to 7. This is to say that 10octal represents eight and 100octal represents sixty-four. However, English, like most languages, uses a base-10 number system, hence a true octal system might use different vocabulary
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, octuple precision is a binary floating-point-based computer number format that occupies 32 bytes (256 bits) in computer memory. This 256-bit octuple precision is for applications requiring results in higher than quadruple precision. This format is rarely (if ever) used and very few environments support it
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The ones' complement of a binary number is the value obtained by inverting (flipping) all the bits in the binary representation of the number. The name "ones' complement" refers to the fact that such an inverted value, if added to the original, would always produce an "all ones" number (the term "complement" refers to such pairs of mutually additive inverse numbers, here in respect to a non-0 base number). This mathematical operation is primarily of interest in computer science, where it has varying effects depending on how a specific computer represents numbers
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A parity bit, or check bit, is a bit added to a string of binary code. Parity bits are a simple form of error detecting code. Parity bits are generally applied to the smallest units of a communication protocol, typically 8-bit octets (bytes), although they can also be applied separately to an entire message string of bits
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Permute (and Shuffle) instructions, part of bit manipulation as well as vector processing, copy unaltered contents from a source array to a destination array, where the indices are specified by a second source array. The size (bitwidth) of the source elements is not restricted but remains the same as the destination size.
There exists two important permute variants, known as gather and scatter, respectively
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A power of two is a number of the form 2n where n is an integer, that is, the result of exponentiation with number two as the base and integer n as the exponent.
In a context where only integers are considered, n is restricted to non-negative values, so there are 1, 2, and 2 multiplied by itself a certain number of times. The first ten powers of 2 for non-negative values of n are:
1, 2, 4, 8, 16, 32, 64, 128, 256, 512,
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, quadruple precision (or quad precision) is a binary floating point–based computer number format that occupies 16 bytes (128 bits) with precision at least twice the 53-bit double precision.
This 128-bit quadruple precision is designed not only for applications requiring results in higher than double precision, but also, as a primary function, to allow the computation of double precision results more reliably and accurately by minimising overflow and round-off errors in intermediate calculations and scratch variables. William Kahan, primary architect of the original IEEE-754 floating point standard noted, "For now the 10-byte Extended format is a tolerable compromise between the value of extra-precise arithmetic and the price of implementing it to run fast; very soon two more bytes of precision will become tolerable, and ultimately a 16-byte format
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A redundant binary representation (RBR) is a numeral system that uses more bits than needed to represent a single binary digit so that most numbers have several representations. An RBR is unlike usual binary numeral systems, including two's complement, which use a single bit for each digit. Many of an RBR's properties differ from those of regular binary representation systems
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, fixed-point is a method of representing fractional (non-integer) numbers by storing a fixed number of digits of their fractional part. Dollar amounts, for example, are often stored with exactly two fractional digits, representing the cents (1/100 of dollar). More generally, the term may refer to representing fractional values as integer multiples of some fixed small unit, e
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The serial binary adder or bit-serial adder is a digital circuit that performs binary addition bit by bit. The serial full adder has three single-bit inputs for the numbers to be added and the carry in. There are two single-bit outputs for the sum and carry out
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer science, the sign bit is a bit in a signed number representation that indicates the sign of a number. Although only signed numeric data types have a sign bit, it is invariably located in the most significant bit position, so the term may be used interchangeably with "most significant bit" in some contexts.
Almost always, if the sign bit is 0, the number is non-negative (positive or zero)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Sign extension (abbreviated as sext) is the operation, in computer arithmetic, of increasing the number of bits of a binary number while preserving the number's sign (positive/negative) and value. This is done by appending digits to the most significant side of the number, following a procedure dependent on the particular signed number representation used.
For example, if six bits are used to represent the number "00 1010" (decimal positive 10) and the sign extend operation increases the word length to 16 bits, then the new representation is simply "0000 0000 0000 1010"
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Single-precision floating-point format (sometimes called FP32 or float32) is a computer number format, usually occupying 32 bits in computer memory; it represents a wide dynamic range of numeric values by using a floating radix point.
A floating-point variable can represent a wider range of numbers than a fixed-point variable of the same bit width at the cost of precision. A signed 32-bit integer variable has a maximum value of 231 − 1 = 2,147,483,647, whereas an IEEE 754 32-bit base-2 floating-point variable has a maximum value of (2 − 2−23) × 2127 ≈ 3
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In electronics, a subtractor – a digital circuit that performs subtraction of numbers – can be designed using the same approach as that of an adder. The binary subtraction process is summarized below. As with an adder, in the general case of calculations on multi-bit numbers, three bits are involved in performing the subtraction for each bit of the difference: the minuend (
X
i
{\displaystyle X_{i}}
), subtrahend (
Y
i
{\displaystyle Y_{i}}
), and a borrow in from the previous (less significant) bit order position (
B
i
{\displaystyle B_{i}}
)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Two's complement is a mathematical operation to reversibly convert a positive binary number into a negative binary number with equivalent negative value, using the binary digit with the greatest place value as the sign to indicate whether the binary number is positive or negative. It is used in computer science as the most common method of representing signed (positive, negative, and zero) integers on computers, and more generally, fixed point binary values. When the most significant bit is 1, the number is signed as negative; and when the most significant bit is 0 the number is signed as positive (see Converting from two's complement representation, below)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer programming, the exclusive or swap (sometimes shortened to XOR swap) is an algorithm that uses the exclusive or bitwise operation to swap the values of two variables without using the temporary variable which is normally required.
The algorithm is primarily a novelty and a way of demonstrating properties of the exclusive or operation. It is sometimes discussed as a program optimization, but there are almost no cases where swapping via exclusive or provides benefit over the standard, obvious technique
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An approximation is anything that is intentionally similar but not exactly equal to something else.
Etymology and usage
The word approximation is derived from Latin approximatus, from proximus meaning very near and the prefix ad- (ad- before p becomes ap- by assimilation) meaning to. Words like approximate, approximately and approximation are used especially in technical or scientific contexts
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Ordinal data is a categorical, statistical data type where the variables have natural, ordered categories and the distances between the categories are not known. : 2 These data exist on an ordinal scale, one of four levels of measurement described by S. S
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A ranking is a relationship between a set of items such that, for any two items, the first is either "ranked higher than", "ranked lower than", or "ranked equal to" the second. In mathematics, this is known as a weak order or total preorder of objects. It is not necessarily a total order of objects because two different objects can have the same ranking
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer science, a relational operator is a programming language construct or operator that tests or defines some kind of relation between two entities. These include numerical equality (e. g
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In topology and related areas of mathematics, the set of all possible topologies on a given set forms a partially ordered set. This order relation can be used for comparison of the topologies.
Definition
A topology on a set may be defined as the collection of subsets which are considered to be "open"
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Aiken code (also known as 2421 code) is a complementary binary-coded decimal (BCD) code. A group of four bits is assigned to the decimal digits from 0 to 9 according to the following table. The code was developed by Howard Hathaway Aiken and is still used today in digital clocks, pocket calculators and similar devices
|
https://huggingface.co/datasets/fmars/wiki_stem
|
2Sum is a floating-point algorithm for computing the exact round-off error in a floating-point addition operation.
2Sum and its variant Fast2Sum were first published by Ole Møller in 1965.
Fast2Sum is often used implicitly in other algorithms such as compensated summation algorithms; Kahan's summation algorithm was published first in 1965, and Fast2Sum was later factored out of it by Dekker in 1971 for double-double arithmetic algorithms
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing and electronic systems, binary-coded decimal (BCD) is a class of binary encodings of decimal numbers where each digit is represented by a fixed number of bits, usually four or eight. Sometimes, special bit patterns are used for a sign or other indications (e. g
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performed on numbers whose digits of precision are limited only by the available memory of the host system. This contrasts with the faster fixed-precision arithmetic found in most arithmetic logic unit (ALU) hardware, which typically offers between 8 and 64 bits of precision.
Several modern programming languages have built-in support for bignums, and others have libraries available for arbitrary-precision integer and floating-point math
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The IEEE International Symposium on Computer Arithmetic (ARITH) is a conference in the area of computer arithmetic.
The symposium was established in 1969, initially as three-year event, then as a
biennial event, and, finally, from 2015 as an annual symposium.
ARITH topics span from theoretical aspects and algorithms for operations, to hardware implementations of arithmetic units and applications of computer arithmetic
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, an arithmetic logic unit (ALU) is a combinational digital circuit that performs arithmetic and bitwise operations on integer binary numbers. This is in contrast to a floating-point unit (FPU), which operates on floating point numbers. It is a fundamental building block of many types of computing circuits, including the central processing unit (CPU) of computers, FPUs, and graphics processing units (GPUs)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Augmented assignment (or compound assignment) is the name given to certain
assignment operators in certain programming languages (especially those derived from C). An augmented assignment is generally used to replace a statement where an operator takes a variable as one of its arguments and then assigns the result back to the same variable. A simple example is x += 1 which is expanded to x = x + 1
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Balanced ternary is a ternary numeral system (i. e. base 3 with three digits) that uses a balanced signed-digit representation of the integers in which the digits have the values −1, 0, and 1
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A barrel shifter is a digital circuit that can shift a data word by a specified number of bits without the use of any sequential logic, only pure combinational logic, i. e. it inherently provides a binary operation
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Bi-quinary coded decimal is a numeral encoding scheme used in many abacuses and in some early computers, including the Colossus. The term bi-quinary indicates that the code comprises both a two-state (bi) and a five-state (quinary) component. The encoding resembles that used by many abacuses, with four beads indicating the five values either from 0 through 4 or from 5 through 9 and another bead indicating which of those ranges (which can alternatively be thought of as +5)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The IEEE 754-2008 standard includes decimal floating-point number formats in which the significand and the exponent (and the payloads of NaNs) can be encoded in two ways, referred to as binary encoding and decimal encoding. Both formats break a number down into a sign bit s, an exponent q (between qmin and qmax), and a p-digit significand c (between 0 and 10p−1). The value encoded is (−1)s×10q×c
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method of mathematical expression which uses only two symbols: typically "0" (zero) and "1" (one).
The base-2 numeral system is a positional notation with a radix of 2. Each digit is referred to as a bit, or binary digit
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word. Computer programming tasks that require bit manipulation include low-level device control, error detection and correction algorithms, data compression, encryption algorithms, and optimization. For most other tasks, modern programming languages allow the programmer to work directly with abstractions instead of bits that represent those abstractions
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing complex logarithms (L-mode) and exponentials (E-mode) using a method similar to the algorithm Henry Briggs used to compute logarithms. By using a precomputed table of logarithms of negative powers of two, the BKM algorithm computes elementary functions using only integer add, shift, and compare operations
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Legend of Korra: Ruins of the Empire is a three-part graphic novel series written by Michael Dante DiMartino, with art by Michelle Wong. The series was first announced in October 2018 as a three-part extended sequel to The Legend of Korra: Turf Wars, with the story centering on Avatar Korra and her allies as they deal with the fallout of Kuvira's surrender in the Earth Kingdom. Avatar Korra's romantic relationship with her close longtime friend Asami is also further explored in the series
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Manchurian Candidate is a novel by Richard Condon, first published in 1959. It is a political thriller about the son of a prominent U. S
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Midwich Cuckoos is a 1957 science fiction novel written by the English author John Wyndham. It tells the tale of an English village in which the women become pregnant by brood parasitic aliens. The book has been praised by many critics, including the dramatist Dan Rebellato, who called it "a searching novel of moral ambiguities," and the novelist Margaret Atwood, who called the book Wyndham's "chef d'oeuvre
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Mindplayers is a 1987 first novel by science fiction author Pat Cadigan.
Plot summary
A dare goes awry when Ali tries on a stolen madcap and is afflicted with psychotic delusions that will not go away. "Cured" by a mindplayer, Ali is soon forced to become one herself or face a prison sentence as a "mind criminal"
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Mirror's Edge Catalyst is a first-person action-adventure platform game developed by DICE and published by Electronic Arts. The game was released for PlayStation 4, Windows, and Xbox One in June 2016. It is a reboot of the 2008 game that focuses on protagonist Faith Connors
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Nineteen Eighty-Four (also published as 1984) is a dystopian social science fiction novel and cautionary tale by English writer George Orwell. It was published on 8 June 1949 by Secker & Warburg as Orwell's ninth and final book completed in his lifetime. Thematically, it centres on the consequences of totalitarianism, mass surveillance and repressive regimentation of people and behaviours within society
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Paprika (パプリカ, Papurika) is a 1993 science fiction novel written by Yasutaka Tsutsui. It first appeared in Marie Claire magazine in four parts, each appearing chronologically in the January 1991, March 1992, August 1992, and June 1993 issues. A manga adaption of the novel was created by Reiji Hagiwara in 1995 but was not published until 2003
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Queen of Angels is a 1990 science fiction novel written by Greg Bear. It was nominated for the Hugo, Campbell and Locus Awards in 1991. It was followed by a sequel, "/", also known as Slant
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Rainbows End is a 2006 science fiction novel by Vernor Vinge. It was awarded the 2007 Hugo Award for Best Novel. The book is set in San Diego, California, in 2025, in a variation of the fictional world Vinge explored in his 2002 Hugo-winning novella "Fast Times at Fairmont High" and 2004's "Synthetic Serendipity"
|
https://huggingface.co/datasets/fmars/wiki_stem
|
"Shiny Happy People" is episode 18 of season 4 of the television show Angel. Written by Elizabeth Craft and Sarah Fain, and directed by Marita Grabiak, it was originally broadcast on April 9, 2003 on the WB network. As Cordelia lies in a coma following her demonic delivery, the rest of the gang becomes enchanted by her unexpected offspring - a full grown woman, whom Angel names Jasmine, who hypnotizes anyone she meets by mere sight
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A Clockwork Orange is a 1971 dystopian crime film adapted, produced, and directed by Stanley Kubrick, based on Anthony Burgess's 1962 novel of the same name. It employs disturbing, violent images to comment on psychiatry, juvenile delinquency, youth gangs, and other social, political, and economic subjects in a dystopian near-future Britain.
Alex (Malcolm McDowell), the central character, is a charismatic, anti-social delinquent whose interests include classical music (especially Beethoven), committing rape, theft, and ultra-violence
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Happening is a 2008 thriller film written, directed, and produced by M. Night Shyamalan. It stars Mark Wahlberg, Zooey Deschanel, John Leguizamo, and Betty Buckley and revolves around an inexplicable natural disaster causing mass suicides
|
https://huggingface.co/datasets/fmars/wiki_stem
|
MEAD is a 2022 science fiction live-action animated film based on the story "To Meet the Faces You Meet" from the comic book Fever Dreams by Jan Strnad and Richard Corben. The film was co-written, animated, and directed by J. Allen Williams and stars Samuel Hunt, Robert Picardo, Kassandra Wright, Lillie Young, and Shawn Young alongside the voices of Patton Oswalt and Patrick Warburton
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Amiga software is computer software engineered to run on the Amiga personal computer. Amiga software covers many applications, including productivity, digital art, games, commercial, freeware and hobbyist products. The market was active in the late 1980s and early 1990s but then dwindled
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Amiga support and maintenance software performs service functions such as formatting media for a specific filesystem, diagnosing failures that occur on formatted media, data recovery after media failure, and installation of new software for the Amiga family of personal computers—as opposed to application software, which performs business, education, and recreation functions.
The Amiga came with some embedded utility programs, but many more were added over time, often by third-party developers and companies.
Original utilities
Commodore included utility programs with the operating system
|
https://huggingface.co/datasets/fmars/wiki_stem
|
== Legend ==
The term "on-demand scan" refers to the possibility of performing a manual scan (by the user) on the entire computer/device, while "on-access scan" refers to the ability of a product to automatically scan every file at its creation or subsequent modification.
The term "CloudAV" refers to the ability of a product to automatically perform scans on the cloud.
The term "Email Security" refers to the protection of emails from viruses and malware, while "AntiSpam" refers to the protection from spam, scam and phishing attacks
|
https://huggingface.co/datasets/fmars/wiki_stem
|
This article lists communication protocols that are designed for file transfer over a telecommunications network.
Protocols for shared file systems—such as 9P and the Network File System—are beyond the scope of this article, as are file synchronization protocols.
Protocols for packet-switched networks
A packet-switched network transmits data that is divided into units called packets
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computing, an icon is a pictogram or ideogram displayed on a computer screen in order to help the user navigate a computer system. The icon itself is a quickly comprehensible symbol of a software tool, function, or a data file, accessible on the system and is more like a traffic sign than a detailed illustration of the actual entity it represents. It can serve as an electronic hyperlink or file shortcut to access the program or data
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A music tracker (sometimes referred to as just tracker for short) is a type of music sequencer software for creating music. The music is represented as discrete musical notes positioned in several channels at chronological positions on a vertical timeline.
A music tracker's user interface is traditionally number based
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Music visualization or music visualisation, a feature found in electronic music visualizers and media player software, generates animated imagery based on a piece of music. The imagery is usually generated and rendered in real time and in a way synchronized with the music as it is played.
Visualization techniques range from simple ones (e
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An outliner (or outline processor) is a specialized type of text editor (word processor) used to create and edit outlines, which are text files which have a tree structure, for organization. Textual information is contained in discrete sections called "nodes", which are arranged according to their topic–subtopic (parent–child) relationships, like the members of a family tree. When loaded into an outliner, an outline may be collapsed or expanded to display as few or as many levels as desired
|
https://huggingface.co/datasets/fmars/wiki_stem
|
ENIAC (; Electronic Numerical Integrator and Computer) was the first programmable, electronic, general-purpose digital computer, completed in 1945. There were other computers that had combinations of these features, but the ENIAC had all of them in one computer. It was Turing-complete and able to solve "a large class of numerical problems" through reprogramming
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The ICT 1301 and its smaller derivative ICT 1300 were early business computers from International Computers and Tabulators. Typical of mid-sized machines of the era, they used core memory, drum storage and punched cards, but they were unusual in that they were based on decimal logic instead of binary.
Description
The 1301 was the main machine in the line
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The NCR 315 Data Processing System, released in January 1962 by NCR, is a second-generation computer. All printed circuit boards use resistor–transistor logic (RTL) to create the various logic elements. It uses 12-bit slab memory structure using magnetic-core memory
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Singer System Ten was a small-business computer manufactured by the Singer Corporation. The System Ten, introduced in 1970, featured an early form of logical partitioning.
The System Ten was a character-oriented computer, using 6-bit BCD characters and decimal arithmetic
|
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.