Split (1)

train · 14.5k rows

text stringlengths 559 401k	source stringlengths 13 121
The GeoNetwork opensource (GNOS) project is a free and open source (FOSS) cataloging application for spatially referenced resources. It is a catalog of location-oriented information. == Outline == It is a standardized and decentralized spatial information management environment designed to enable access to geo-refere...	Wikipedia/GeoNetwork_opensource
In probability theory and statistics, two real-valued random variables, X {\displaystyle X} , Y {\displaystyle Y} , are said to be uncorrelated if their covariance, cov ⁡ [ X , ...	Wikipedia/Uncorrelatedness_(probability_theory)
In mathematics, Vojta's conjecture is a conjecture introduced by Paul Vojta (1987) about heights of points on algebraic varieties over number fields. The conjecture was motivated by an analogy between diophantine approximation and Nevanlinna theory (value distribution theory) in complex analysis. It implies many other ...	Wikipedia/Vojta's_conjecture
Inter-universal Teichmüller theory (IUT or IUTT) is the name given by mathematician Shinichi Mochizuki to a theory he developed in the 2000s, following his earlier work in arithmetic geometry. According to Mochizuki, it is "an arithmetic version of Teichmüller theory for number fields equipped with an elliptic curve". ...	Wikipedia/Inter-universal_Teichmuller_theory
Inter-universal Teichmüller theory (IUT or IUTT) is the name given by mathematician Shinichi Mochizuki to a theory he developed in the 2000s, following his earlier work in arithmetic geometry. According to Mochizuki, it is "an arithmetic version of Teichmüller theory for number fields equipped with an elliptic curve". ...	Wikipedia/Inter-universal_Teichmüller_theory
The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985. It is stated in terms of three positive integers a , b {\displaystyle a,b} and ...	Wikipedia/ABC_conjecture
Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext. The keys may be identical, or there may be a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two...	Wikipedia/Symmetric_key_algorithm
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of S...	Wikipedia/Symposium_on_the_Theory_of_Computing
Cryptography, or cryptology (from Ancient Greek: κρυπτός, romanized: kryptós "hidden, secret"; and γράφειν graphein, "to write", or -λογία -logia, "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about const...	Wikipedia/Cryptographic
The YAK is a public-key authenticated key-agreement protocol, proposed by Feng Hao in 2010. It is claimed to be the simplest authenticated key exchange protocol among the related schemes, including MQV, HMQV, Station-to-Station protocol, SSL/TLS etc. The authentication is based on public key pairs. As with other proto...	Wikipedia/YAK_(cryptography)
Computer Science and Artificial Intelligence Laboratory (CSAIL) is a research institute at the Massachusetts Institute of Technology (MIT) formed by the 2003 merger of the Laboratory for Computer Science (LCS) and the Artificial Intelligence Laboratory (AI Lab). Housed within the Ray and Maria Stata Center, CSAIL is th...	Wikipedia/Laboratory_for_Computer_Science
IEEE Transactions on Information Theory is a monthly peer-reviewed scientific journal published by the IEEE Information Theory Society. It covers information theory and the mathematics of communications. It was established in 1953 as IRE Transactions on Information Theory. The editor-in-chief is Venugopal V. Veeravalli...	Wikipedia/IEEE_Transactions_on_Information_Theory
Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext. The keys may be identical, or there may be a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two...	Wikipedia/Symmetric-key_cryptography
Key exchange (also key establishment) is a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of a cryptographic algorithm. If the sender and receiver wish to exchange encrypted messages, each must be equipped to encrypt messages to be sent and decrypt messages received....	Wikipedia/Key-exchange_algorithm
A key in cryptography is a piece of information, usually a string of numbers or letters that are stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different sizes and varieties, but in all cases, the strength of t...	Wikipedia/Cryptographic_key
Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext. The keys may be identical, or there may be a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two...	Wikipedia/Symmetric_cryptography
In mathematics, Kähler differentials provide an adaptation of differential forms to arbitrary commutative rings or schemes. The notion was introduced by Erich Kähler in the 1930s. It was adopted as standard in commutative algebra and algebraic geometry somewhat later, once the need was felt to adapt methods from calcul...	Wikipedia/Algebraic_de_Rham_cohomology
In mathematics, Hodge–Arakelov theory of elliptic curves is an analogue of classical and p-adic Hodge theory for elliptic curves carried out in the framework of Arakelov theory. It was introduced by Mochizuki (1999). It bears the name of two mathematicians, Suren Arakelov and W. V. D. Hodge. The main comparison in his ...	Wikipedia/Hodge-Arakelov_theory
In mathematical analysis, a metric space M is called complete (or a Cauchy space) if every Cauchy sequence of points in M has a limit that is also in M. Intuitively, a space is complete if there are no "points missing" from it (inside or at the boundary). For instance, the set of rational numbers is not complete, becau...	Wikipedia/Complete_(topology)
In mathematics, p-adic Teichmüller theory describes the "uniformization" of p-adic curves and their moduli, generalizing the usual Teichmüller theory that describes the uniformization of Riemann surfaces and their moduli. It was introduced and developed by Shinichi Mochizuki (1996, 1999). The first problem is to reform...	Wikipedia/P-adic_Teichmüller_theory
In telecommunications and computing, bit rate (bitrate or as a variable R) is the number of bits that are conveyed or processed per unit of time. The bit rate is expressed in the unit bit per second (symbol: bit/s), often in conjunction with an SI prefix such as kilo (1 kbit/s = 1,000 bit/s), mega (1 Mbit/s = 1,000 kbi...	Wikipedia/Bitrate
Throughput of a network can be measured using various tools available on different platforms. This page explains the theory behind what these tools set out to measure and the issues regarding these measurements. Reasons for measuring throughput in networks. People are often concerned about measuring the maximum data t...	Wikipedia/Measuring_network_throughput
In digital transmission, the number of bit errors is the number of received bits of a data stream over a communication channel that have been altered due to noise, interference, distortion or bit synchronization errors. The bit error rate (BER) is the number of bit errors per unit time. The bit error ratio (also BER) i...	Wikipedia/Bit_error_rate
The NASA Deep Space Network (DSN) is a worldwide network of spacecraft communication ground segment facilities, located in the United States (California), Spain (Madrid), and Australia (Canberra), that supports NASA's interplanetary spacecraft missions. It also performs radio and radar astronomy observations for the ex...	Wikipedia/Deep_Space_Network
Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Examples of such networks are those operating in mobile or extreme terrestrial environments, or planned networks in space. R...	Wikipedia/Delay-tolerant_networking
In computer networks, network traffic measurement is the process of measuring the amount and type of traffic on a particular network. This is especially important with regard to effective bandwidth management. == Techniques == Network performance could be measured using either active or passive techniques. Active tec...	Wikipedia/Network_traffic_measurement
Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to solve the integer factorization problem. The goal is to compute γ {\displaystyle \gamma } such that ...	Wikipedia/Pollard's_rho_algorithm_for_logarithms
In mathematics, the Sato–Tate conjecture is a statistical statement about the family of elliptic curves Ep obtained from an elliptic curve E over the rational numbers by reduction modulo almost all prime numbers p. Mikio Sato and John Tate independently posed the conjecture around 1960. If Np denotes the number of poin...	Wikipedia/Sato-Tate_conjecture
In computational number theory, the index calculus algorithm is a probabilistic algorithm for computing discrete logarithms. Dedicated to the discrete logarithm in ( Z / q Z ) ...	Wikipedia/Index_calculus_algorithm
The Tonelli–Shanks algorithm (referred to by Shanks as the RESSOL algorithm) is used in modular arithmetic to solve for r in a congruence of the form r2 ≡ n (mod p), where p is a prime: that is, to find a square root of n modulo p. Tonelli–Shanks cannot be used for composite moduli: finding square roots modulo composit...	Wikipedia/Tonelli–Shanks_algorithm
In computational number theory, Cornacchia's algorithm is an algorithm for solving the Diophantine equation x 2 + d y 2 = m {\displa...	Wikipedia/Cornacchia's_algorithm
Pollard's rho algorithm is an algorithm for integer factorization. It was invented by John Pollard in 1975. It uses only a small amount of space, and its expected running time is proportional to the square root of the smallest prime factor of the composite number being factorized. == Core ideas == The algorithm is us...	Wikipedia/Pollard's_rho_algorithm
In number theory, Dixon's factorization method (also Dixon's random squares method or Dixon's algorithm) is a general-purpose integer factorization algorithm; it is the prototypical factor base method. Unlike for other factor base methods, its run-time bound comes with a rigorous proof that does not rely on conjectures...	Wikipedia/Dixon's_factorization_method
The Korkine–Zolotarev (KZ) lattice basis reduction algorithm or Hermite–Korkine–Zolotarev (HKZ) algorithm is a lattice reduction algorithm. For lattices in R n {\displaystyle \mathbb {R} ^{n}} it yi...	Wikipedia/Korkine–Zolotarev_lattice_basis_reduction_algorithm
In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's conjecture (now a theorem, proven in 1995 by Andrew Wiles), have shaped much of mathematical history as new areas of mathematics are developed ...	Wikipedia/Conjectures
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a divide-and-conquer algorithm that reduces the multiplication of two n-digit numbers to three multiplications of n/2-digit numbers and, by repeating this reduction, to a...	Wikipedia/Karatsuba_algorithm
Lehmer's GCD algorithm, named after Derrick Henry Lehmer, is a fast GCD algorithm, an improvement on the simpler but slower Euclidean algorithm. It is mainly used for big integers that have a representation as a string of digits relative to some chosen numeral system base, say β = 1000 or β = 232. == Algorithm == Leh...	Wikipedia/Lehmer's_GCD_algorithm
Trial division is the most laborious but easiest to understand of the integer factorization algorithms. The essential idea behind trial division tests to see if an integer n, the integer to be factored, can be divided by each number in turn that is less than or equal to the square root of n. For example, to find the ...	Wikipedia/Trial_division
In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over the field F p {\displaystyle \mathbb {F}...	Wikipedia/Berlekamp–Rabin_algorithm
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor (GCD) of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic s...	Wikipedia/Binary_GCD_algorithm
In group theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose algorithm for computing discrete logarithms in a finite abelian group whose order is a smooth integer. The algorithm was introduced by Roland Silver, but first published by Stephen Pohlig and M...	Wikipedia/Pohlig–Hellman_algorithm
In computational number theory, Williams's p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic-group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be factored contains one or more prime factors p such that p + 1 is smooth, i.e...	Wikipedia/Williams's_p_+_1_algorithm
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis B = { b ...	Wikipedia/Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm
A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Numerous algorithms are known and there has been much research into the topic. The oldest and simplest method, known since antiquity as long multipli...	Wikipedia/Fürer's_algorithm
In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form x 2 ≡ n ( mod p ) , ...	Wikipedia/Cipolla's_algorithm
An integer relation between a set of real numbers x1, x2, ..., xn is a set of integers a1, a2, ..., an, not all 0, such that a 1 x 1 + a ...	Wikipedia/Integer_relation_algorithm
Fermat's factorization method, named after Pierre de Fermat, is based on the representation of an odd integer as the difference of two squares: N = a 2 − b 2 ...	Wikipedia/Fermat's_factorization_method
Pollard's p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special-purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest example of an algebraic-group factorisation algorithm. The factors it fin...	Wikipedia/Pollard's_p_−_1_algorithm
In mathematics the Function Field Sieve is one of the most efficient algorithms to solve the Discrete Logarithm Problem (DLP) in a finite field. It has heuristic subexponential complexity. Leonard Adleman developed it in 1994 and then elaborated it together with M. D. Huang in 1999. Previous work includes the work of ...	Wikipedia/Function_field_sieve
The Fast Library for Number Theory (FLINT) is a C library for number theory applications. The two major areas of functionality currently implemented in FLINT are polynomial arithmetic over the integers and a quadratic sieve. The library is designed to be compiled with the GNU Multi-Precision Library (GMP) and is releas...	Wikipedia/Fast_Library_for_Number_Theory
In automatic control, a regulator is a device which has the function of maintaining a designated characteristic. It performs the activity of managing or maintaining a range of values in a machine. The measurable property of a device is managed closely by specified conditions or an advance set value; or it can be a vari...	Wikipedia/Regulator_(automatic_control)
Automation describes a wide range of technologies that reduce human intervention in processes, mainly by predetermining decision criteria, subprocess relationships, and related actions, as well as embodying those predeterminations in machines. Automation has been achieved by various means including mechanical, hydrauli...	Wikipedia/Automatic_control
Linear parameter-varying control (LPV control) deals with the control of linear parameter-varying systems, a class of nonlinear systems which can be modelled as parametrized linear systems whose parameters change with their state. == Gain scheduling == In designing feedback controllers for dynamical systems a variety...	Wikipedia/Linear_parameter-varying_control
Feedback occurs when outputs of a system are routed back as inputs as part of a chain of cause and effect that forms a circuit or loop. The system can then be said to feed back into itself. The notion of cause-and-effect has to be handled carefully when applied to feedback systems: Simple causal reasoning about a feed...	Wikipedia/Feedback_control
A control panel is a flat, often vertical, area where control or monitoring instruments are displayed or it is an enclosed unit that is the part of a system that users can access, such as the control panel of a security system (also called control unit). They are found in factories to monitor and control machines or pr...	Wikipedia/Control_panel_(engineering)
An industrial control system (ICS) is an electronic control system and associated instrumentation used for industrial process control. Control systems can range in size from a few modular panel-mounted controllers to large interconnected and interactive distributed control systems (DCSs) with many thousands of field co...	Wikipedia/Industrial_control_system
Temperature control is a process in which change of temperature of a space (and objects collectively there within), or of a substance, is measured or otherwise detected, and the passage of heat energy into or out of the space or substance is adjusted to achieve a desired temperature. Thermoregulation is the act of ke...	Wikipedia/Temperature_control
A flow control valve regulates the flow or pressure of a fluid. Control valves normally respond to signals generated by independent devices such as flow meters or temperature gauges. == Operation == Control valves are normally fitted with actuators and positioners. Pneumatically-actuated globe valves and diaphragm v...	Wikipedia/Flow_control_valve
A distributed control system (DCS) is a computerized control system for a process or plant usually with many control loops, in which autonomous controllers are distributed throughout the system, but there is no central operator supervisory control. This is in contrast to systems that use centralized controllers; either...	Wikipedia/Distributed_Control_System
A fuzzy control system is a control system based on fuzzy logic – a mathematical system that analyzes analog input values in terms of logical variables that take on continuous values between 0 and 1, in contrast to classical or digital logic, which operates on discrete values of either 1 or 0 (true or false, respectiv...	Wikipedia/Fuzzy_control_system
A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller. This enables the direct control of flow rate and the consequential control of process quantities such as pressure, temperature, and liquid level. In automatic control terminology, a c...	Wikipedia/Control_valve
In Diophantine approximation, a subfield of number theory, the Oppenheim conjecture concerns representations of numbers by real quadratic forms in several variables. It was formulated in 1929 by Alexander Oppenheim and later the conjectured property was further strengthened by Harold Davenport and Oppenheim. Initial re...	Wikipedia/Oppenheim_conjecture
In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that n {\displaystyle n} runners on a track of unit length, with constant speeds all dist...	Wikipedia/Lonely_runner_conjecture
In mathematics, the Littlewood conjecture is an open problem (as of April 2024) in Diophantine approximation, proposed by John Edensor Littlewood around 1930. It states that for any two real numbers α and β, lim inf n → ∞ ...	Wikipedia/Littlewood_conjecture
In number theory, Hurwitz's theorem, named after Adolf Hurwitz, gives a bound on a Diophantine approximation. The theorem states that for every irrational number ξ there are infinitely many relatively prime integers m, n such that \| ξ − ...	Wikipedia/Hurwitz's_theorem_(number_theory)
For historical reasons and in order to have application to the solution of Diophantine equations, results in number theory have been scrutinised more than in other branches of mathematics to see if their content is effectively computable. Where it is asserted that some list of integers is finite, the question is whethe...	Wikipedia/Effective_results_in_number_theory
The Koukoulopoulos–Maynard theorem, also known as the Duffin-Schaeffer conjecture, is a theorem in mathematics, specifically, the Diophantine approximation proposed as a conjecture by R. J. Duffin and A. C. Schaeffer in 1941 and proven in 2019 by Dimitris Koukoulopoulos and James Maynard. It states that if ...	Wikipedia/Duffin–Schaeffer_conjecture
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation. It is difficult to circumscribe the theoretical areas precisely. The ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following ...	Wikipedia/Theoretical_Computer_Science
Programming languages are typically created by designing a form of representation of a computer program, and writing an implementation for the developed concept, usually an interpreter or compiler. Interpreters are designed to read programs, usually in some variation of a text format, and perform actions based on what ...	Wikipedia/Programming_language_design
Prototype theory is a theory of categorization in cognitive science, particularly in psychology and cognitive linguistics, in which there is a graded degree of belonging to a conceptual category, and some members are more central than others. It emerged in 1971 with the work of psychologist Eleanor Rosch, and it has be...	Wikipedia/Prototype_theory
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that map values to other values, rather than a sequence of imperative statements which...	Wikipedia/Functional_programming_language
Predicate transformer semantics were introduced by Edsger Dijkstra in his seminal paper "Guarded commands, nondeterminacy and formal derivation of programs". They define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer: a total fun...	Wikipedia/Predicate_transformer_semantics
In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose vertices are the expression's subterms. An ASG is at a higher level of abstraction than an abstract syntax tree (or AST), which is u...	Wikipedia/Abstract_semantic_graph
Force dynamics is a semantic category that describes the way in which entities interact with reference to force. Force Dynamics gained a good deal of attention in cognitive linguistics due to its claims of psychological plausibility and the elegance with which it generalizes ideas not usually considered in the same con...	Wikipedia/Force_dynamics
In computer science, algebraic semantics is a formal approach to programming language theory that uses algebraic methods for defining, specifying, and reasoning about the behavior of programs. It is a form of axiomatic semantics that provides a mathematical framework for analyzing programs through the use of algebraic ...	Wikipedia/Algebraic_semantics_(computer_science)
In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of...	Wikipedia/Model_checking
The theory of descriptions is the philosopher Bertrand Russell's most significant contribution to the philosophy of language. It is also known as Russell's theory of descriptions (commonly abbreviated as RTD). In short, Russell argued that the syntactic form of descriptions (phrases that took the form of "The flytrap" ...	Wikipedia/Theory_of_descriptions
A mobile application or app is a computer program or software application designed to run on a mobile device such as a phone, tablet, or watch. Mobile applications often stand in contrast to desktop applications which are designed to run on desktop computers, and web applications which run in mobile web browsers rather...	Wikipedia/Mobile_phone_application
A cover model is a male or female whose photograph appears on the front cover of a magazine. The cover model is generally a fashion model, celebrity, or contest winner. Generally, cover models are depicted solitarily; however, on occasion magazines will present a front cover with multiple cover models. Female cover mod...	Wikipedia/Cover_model
Digital photograph restoration is the practice of restoring the appearance of a digital copy of a physical photograph that has been damaged by natural, man-made, or environmental causes, or affected by age or neglect. Digital photograph restoration uses image editing techniques to remove undesired visible features, suc...	Wikipedia/Digital_photograph_restoration
Deepfake pornography, or simply fake pornography, is a type of synthetic pornography that is created via altering already-existing photographs or video by applying deepfake technology to the images of the participants. The use of deepfake pornography has sparked controversy because it involves the making and sharing of...	Wikipedia/Deepfake_pornography
The visual arts are art forms such as painting, drawing, printmaking, sculpture, ceramics, photography, video, image, filmmaking, design, crafts, and architecture. Many artistic disciplines such as performing arts, conceptual art, and textile arts, also involve aspects of the visual arts, as well as arts of other types...	Wikipedia/Graphic_image_developer
Composograph refers to a forerunner method of photo manipulation and is a retouched photographic collage popularized by publisher and physical culture advocate Bernarr Macfadden in his New York Evening Graphic in 1924. The Graphic was dubbed "The Porno-Graphic" by critics of the time and has been called "one of the low...	Wikipedia/Composograph
Heliography is an early photographic process, based on the hardening of bitumen in sunlight. It was invented by Nicéphore Niépce around 1822. Niépce used the process to make the earliest known surviving photograph from nature, View from the Window at Le Gras (1826 or 1827), and the first realisation of photoresist as m...	Wikipedia/Heliography
Heinrich Hoffmann (12 September 1885 – 16 December 1957) was Adolf Hitler's official photographer, and a Nazi politician and publisher, who was a member of Hitler's inner circle. Hoffmann's photographs were a significant part of Hitler's propaganda campaign to present himself and the Nazi Party as a significant mass ph...	Wikipedia/Heinrich_Hoffmann_(photographer)
User-generated content (UGC), alternatively known as user-created content (UCC), emerged from the rise of web services which allow a system's users to create content, such as images, videos, audio, text, testimonials, and software (e.g. video game mods) and interact with other users. Online content aggregation platform...	Wikipedia/User-generated_content
Hand-colouring (or hand-coloring) refers to any method of manually adding colour to a monochrome photograph, generally either to heighten the realism of the image or for artistic purposes. Hand-colouring is also known as hand painting or overpainting. Typically, watercolours, oils, crayons or pastels, and other paints ...	Wikipedia/Hand-colouring_of_photographs
Bhaskara's Lemma is an identity used as a lemma during the chakravala method. It states that: N x 2 + k = y 2 ⟹ ...	Wikipedia/Bhaskara's_lemma
In algebra, the content of a nonzero polynomial with integer coefficients (or, more generally, with coefficients in a unique factorization domain) is the greatest common divisor of its coefficients. The primitive part of such a polynomial is the quotient of the polynomial by its content. Thus a polynomial is the produ...	Wikipedia/Primitive_polynomial_(ring_theory)
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 facto...	Wikipedia/Certifying_algorithm
In algebra, the content of a nonzero polynomial with integer coefficients (or, more generally, with coefficients in a unique factorization domain) is the greatest common divisor of its coefficients. The primitive part of such a polynomial is the quotient of the polynomial by its content. Thus a polynomial is the produ...	Wikipedia/Content_(algebra)
Computer and network surveillance is the monitoring of computer activity and data stored locally on a computer or data being transferred over computer networks such as the Internet. This monitoring is often carried out covertly and may be completed by governments, corporations, criminal organizations, or individuals. I...	Wikipedia/Network_surveillance
The Barabási–Albert (BA) model is an algorithm for generating random scale-free networks using a preferential attachment mechanism. Several natural and human-made systems, including the Internet, the World Wide Web, citation networks, and some social networks are thought to be approximately scale-free and certainly con...	Wikipedia/Barabási–Albert_model
Network controllability concerns the structural controllability of a network. Controllability describes our ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs. This definition agrees well with our intuitive notion of control. The contr...	Wikipedia/Network_controllability
In complex network theory, the fitness model is a model of the evolution of a network: how the links between nodes change over time depends on the fitness of nodes. Fitter nodes attract more links at the expense of less fit nodes. It has been used to model the network structure of the World Wide Web. == Description o...	Wikipedia/Fitness_model_(network_theory)
The Transmission Control Protocol (TCP) is one of the main protocols of the Internet protocol suite. It originated in the initial network implementation in which it complemented the Internet Protocol (IP). Therefore, the entire suite is commonly referred to as TCP/IP. TCP provides reliable, ordered, and error-checked d...	Wikipedia/Transmission_control_protocol
Network planning and design is an iterative process, encompassing topological design, network-synthesis, and network-realization, and is aimed at ensuring that a new telecommunications network or service meets the needs of the subscriber and operator. The process can be tailored according to each new network or servic...	Wikipedia/Network_planning_and_design
An intranet is a computer network for sharing information, easier communication, collaboration tools, operational systems, and other computing services within an organization, usually to the exclusion of access by outsiders. The term is used in contrast to public networks, such as the Internet, but uses the same techno...	Wikipedia/Enterprise_private_network
A process control block (PCB), also sometimes called a process descriptor, is a data structure used by a computer operating system to store all the information about a process. When a process is created (initialized or installed), the operating system creates a corresponding process control block, which specifies and ...	Wikipedia/Process_control_block
In computer networking a work group is a collection of computers connected on a LAN that share the common resources and responsibilities. Workgroup is Microsoft's term for a peer-to-peer local area network. Computers running Microsoft operating systems in the same work group may share files, printers, or Internet conne...	Wikipedia/Workgroup_(computer_networking)

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.