Split (1)

train · 14.5k rows

text stringlengths 559 401k	source stringlengths 13 121
In particle physics, the electroweak interaction or electroweak force is the unified description of two of the fundamental interactions of nature: electromagnetism (electromagnetic interaction) and the weak interaction. Although these two forces appear very different at everyday low energies, the theory models them as ...	Wikipedia/Electroweak_theory
A molecule is a group of two or more atoms that are held together by attractive forces known as chemical bonds; depending on context, the term may or may not include ions that satisfy this criterion. In quantum physics, organic chemistry, and biochemistry, the distinction from ions is dropped and molecule is often used...	Wikipedia/Molecules
In quantum geometry or noncommutative geometry a quantum differential calculus or noncommutative differential structure on an algebra A {\displaystyle A} over a field k {\displaystyle k} means the specification of a space of differe...	Wikipedia/Quantum_differential_calculus
In various interpretations of quantum mechanics, wave function collapse, also called reduction of the state vector, occurs when a wave function—initially in a superposition of several eigenstates—reduces to a single eigenstate due to interaction with the external world. This interaction is called an observation and is ...	Wikipedia/Wavefunction_collapse
The de Broglie–Bohm theory is an interpretation of quantum mechanics which postulates that, in addition to the wavefunction, an actual configuration of particles exists, even when unobserved. The evolution over time of the configuration of all particles is defined by a guiding equation. The evolution of the wave functi...	Wikipedia/De_Broglie–Bohm_theory
The mathematical formulations of quantum mechanics are those mathematical formalisms that permit a rigorous description of quantum mechanics. This mathematical formalism uses mainly a part of functional analysis, especially Hilbert spaces, which are a kind of linear space. Such are distinguished from mathematical forma...	Wikipedia/Mathematical_formulations_of_quantum_mechanics
A physical system is a collection of physical objects under study. The collection differs from a set: all the objects must coexist and have some physical relationship. In other words, it is a portion of the physical universe chosen for analysis. Everything outside the system is known as the environment, which is ignor...	Wikipedia/Physical_systems
An operator is a function over a space of physical states onto another space of states. The simplest example of the utility of operators is the study of symmetry (which makes the concept of a group useful in this context). Because of this, they are useful tools in classical mechanics. Operators are even more important ...	Wikipedia/Operator_(physics)
Introduction to Quantum Mechanics, often called Griffiths, is an introductory textbook on quantum mechanics by David J. Griffiths. The book is considered a standard undergraduate textbook in the subject. Originally published by Pearson Education in 1995 with a second edition in 2005, Cambridge University Press (CUP) re...	Wikipedia/Introduction_to_Quantum_Mechanics_(book)
In physics, a spin network is a type of diagram which can be used to represent states and interactions between particles and fields in quantum mechanics. From a mathematical perspective, the diagrams are a concise way to represent multilinear functions and functions between representations of matrix groups. The diagram...	Wikipedia/Spin_network
In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple e...	Wikipedia/Category_(category_theory)
In mathematics, and more specifically in homological algebra, a resolution (or left resolution; dually a coresolution or right resolution) is an exact sequence of modules (or, more generally, of objects of an abelian category) that is used to define invariants characterizing the structure of a specific module or object...	Wikipedia/Resolution_of_a_module
In mathematics, and more specifically in homological algebra, a resolution (or left resolution; dually a coresolution or right resolution) is an exact sequence of modules (or, more generally, of objects of an abelian category) that is used to define invariants characterizing the structure of a specific module or object...	Wikipedia/Projective_resolution
In mathematics, and more specifically in homological algebra, a resolution (or left resolution; dually a coresolution or right resolution) is an exact sequence of modules (or, more generally, of objects of an abelian category) that is used to define invariants characterizing the structure of a specific module or object...	Wikipedia/Injective_resolution
The snake lemma is a tool used in mathematics, particularly homological algebra, to construct long exact sequences. The snake lemma is valid in every abelian category and is a crucial tool in homological algebra and its applications, for instance in algebraic topology. Homomorphisms constructed with its help are gener...	Wikipedia/Snake_lemma
In mathematics, specifically in homology theory and algebraic topology, cohomology is a general term for a sequence of abelian groups, usually one associated with a topological space, often defined from a cochain complex. Cohomology can be viewed as a method of assigning richer algebraic invariants to a space than homo...	Wikipedia/Cohomology_theory
In mathematics, homotopical algebra is a collection of concepts comprising the nonabelian aspects of homological algebra, and possibly the abelian aspects as special cases. The homotopical nomenclature stems from the fact that a common approach to such generalizations is via abstract homotopy theory, as in nonabelian...	Wikipedia/Homotopical_algebra
In mathematics, particularly homological algebra, the zig-zag lemma asserts the existence of a particular long exact sequence in the homology groups of certain chain complexes. The result is valid in every abelian category. == Statement == In an abelian category (such as the category of abelian groups or the categor...	Wikipedia/Zig-zag_lemma
In mathematics, especially homological algebra and other applications of abelian category theory, the five lemma is an important and widely used lemma about commutative diagrams. The five lemma is not only valid for abelian categories but also works in the category of groups, for example. The five lemma can be thought ...	Wikipedia/Five_lemma
In mathematics, hyperbolic functions are analogues of the ordinary trigonometric functions, but defined using the hyperbola rather than the circle. Just as the points (cos t, sin t) form a circle with a unit radius, the points (cosh t, sinh t) form the right half of the unit hyperbola. Also, similarly to how the deriva...	Wikipedia/Hyperbolic_functions
In mathematics, an elementary function is a function of a single variable (typically real or complex) that is defined as taking sums, products, roots and compositions of finitely many polynomial, rational, trigonometric, hyperbolic, and exponential functions, and their inverses (e.g., arcsin, log, or x1/n). All element...	Wikipedia/Elementary_function
In algebraic geometry, Cramer's theorem on algebraic curves gives the necessary and sufficient number of points in the real plane falling on an algebraic curve to uniquely determine the curve in non-degenerate cases. This number is n ( ...	Wikipedia/Cramer's_theorem_(algebraic_curves)
In numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approx...	Wikipedia/Root-finding_algorithms
In the mathematical field of complex analysis, elliptic functions are special kinds of meromorphic functions, that satisfy two periodicity conditions. They are named elliptic functions because they come from elliptic integrals. Those integrals are in turn named elliptic because they first were encountered for the calcu...	Wikipedia/Elliptical_function
Aequationes Mathematicae is a mathematical journal. It is primarily devoted to functional equations, but also publishes papers in dynamical systems, combinatorics, and geometry. As well as publishing regular journal submissions on these topics, it also regularly reports on international symposia on functional equations...	Wikipedia/Aequationes_Mathematicae
In mathematics, and more specifically in homological algebra, a resolution (or left resolution; dually a coresolution or right resolution) is an exact sequence of modules (or, more generally, of objects of an abelian category) that is used to define invariants characterizing the structure of a specific module or object...	Wikipedia/Free_resolution
In linear algebra, a cone—sometimes called a linear cone to distinguish it from other sorts of cones—is a subset of a real vector space that is closed under positive scalar multiplication; that is, C {\displaystyle C} is a cone if x ∈ C...	Wikipedia/Cone_(linear_algebra)
In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume. == Use == Convergence in this topology is a crucial ingredient of hyperbolic Dehn surgery, a fundamental tool in the theory of hyperbolic 3-manifolds. == Definition == The following is a def...	Wikipedia/Geometric_topology_(object)
In mathematics, at the junction of singularity theory and differential topology, Cerf theory is the study of families of smooth real-valued functions f : M → R {\displaystyle f\colon M\to \mathbb {R} } on a smooth manifold ...	Wikipedia/Cerf_theory
In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometric topology, and algebraic topology. The fundamental...	Wikipedia/Point-set_topology
In classical mechanics, the parameters that define the configuration of a system are called generalized coordinates, and the space defined by these coordinates is called the configuration space of the physical system. It is often the case that these parameters satisfy mathematical constraints, such that the set of act...	Wikipedia/Configuration_space_(physics)
In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called points, along with an additional structure called a topology, which can be defin...	Wikipedia/Topology_(structure)
Geometry & Topology is a peer-refereed, international mathematics research journal devoted to geometry and topology, and their applications. It is currently based at the University of Warwick, United Kingdom, and published by Mathematical Sciences Publishers, a nonprofit academic publishing organisation. It was found...	Wikipedia/Geometry_&_Topology
Mathematical Sciences Publishers is a nonprofit publishing company run by and for mathematicians. It publishes several journals and the book series Geometry & Topology Monographs. It is run from a central office in the Department of Mathematics at the University of California, Berkeley. == Journals owned and publish...	Wikipedia/Mathematical_Sciences_Publishers
Contact mechanics is the study of the deformation of solids that touch each other at one or more points. A central distinction in contact mechanics is between stresses acting perpendicular to the contacting bodies' surfaces (known as normal stress) and frictional stresses acting tangentially between the surfaces (shear...	Wikipedia/Contact_mechanics
Topology is a branch of mathematics concerned with geometric properties preserved under continuous deformation (stretching without tearing or gluing). Topology may also refer to: == Mathematics == A topology is the collection of open sets used to define a topological space == Electronics == Topology (electronics), ...	Wikipedia/Topology_(disambiguation)
In the field of solid mechanics, torsion is the twisting of an object due to an applied torque. Torsion could be defined as strain or angular deformation, and is measured by the angle a chosen section is rotated from its equilibrium position. The resulting stress (torsional shear stress) is expressed in either the pasc...	Wikipedia/Torsion_(mechanics)
In mathematics, equivariant topology is the study of topological spaces that possess certain symmetries. In studying topological spaces, one often considers continuous maps f : X → Y {\displaystyle f:X\to Y} , and while equivariant topology also...	Wikipedia/Equivariant_topology
Topography is the study of the forms and features of land surfaces. The topography of an area may refer to the landforms and features themselves, or a description or depiction in maps. Topography is a field of geoscience and planetary science and is concerned with local detail in general, including not only relief, but...	Wikipedia/Topography
The circuit topology of a folded linear polymer refers to the arrangement of its intra-molecular contacts. Examples of linear polymers with intra-molecular contacts are nucleic acids and proteins. Proteins fold via the formation of contacts of various natures, including hydrogen bonds, disulfide bonds, and beta-beta in...	Wikipedia/Circuit_topology
The Journal of Topology is a peer-reviewed scientific journal which publishes papers of high quality and significance in topology, geometry, and adjacent areas of mathematics. It was established in 2008, when the editorial board of Topology resigned due to the increasing costs of Elsevier's subscriptions. The journal ...	Wikipedia/Journal_of_Topology
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the f...	Wikipedia/Approximation_algorithms
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_Theory_of_Computing
First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variable...	Wikipedia/Quantification_theory
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursi...	Wikipedia/Μ-recursive_function
In theoretical computer science, a Markov algorithm is a string rewriting system that uses grammar-like rules to operate on strings of symbols. Markov algorithms have been shown to be Turing-complete, which means that they are suitable as a general model of computation and can represent any mathematical expression from...	Wikipedia/Markov_algorithm
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability...	Wikipedia/Recursion_theory
In mathematics, dimension theory is the study in terms of commutative algebra of the notion dimension of an algebraic variety (and by extension that of a scheme). The need of a theory for such an apparently simple notion results from the existence of many definitions of dimension that are equivalent only in the most re...	Wikipedia/Dimension_theory_(algebra)
In abstract algebra, a representation of an associative algebra is a module for that algebra. Here an associative algebra is a (not necessarily unital) ring. If the algebra is not unital, it may be made so in a standard way (see the adjoint functors page); there is no essential difference between modules for the result...	Wikipedia/Representation_of_an_algebra
In commutative and homological algebra, depth is an important invariant of rings and modules. Although depth can be defined more generally, the most common case considered is the case of modules over a commutative Noetherian local ring. In this case, the depth of a module is related with its projective dimension by the...	Wikipedia/Depth_(ring_theory)
In abstract algebra, Morita equivalence is a relationship defined between rings that preserves many ring-theoretic properties. More precisely, two rings R, S are Morita equivalent (denoted by R ≈ S {\displaystyle R\approx S} ) if their categories of modules are...	Wikipedia/Morita_theory
In commutative algebra, the Krull dimension of a commutative ring R, named after Wolfgang Krull, is the supremum of the lengths of all chains of prime ideals. The Krull dimension need not be finite even for a Noetherian ring. More generally the Krull dimension can be defined for modules over possibly non-commutative ri...	Wikipedia/Height_(ring_theory)
In mathematics, particularly topology, an atlas is a concept used to describe a manifold. An atlas consists of individual charts that, roughly speaking, describe individual regions of the manifold. In general, the notion of atlas underlies the formal definition of a manifold and related structures such as vector bundle...	Wikipedia/Chart_(topology)
In computer programming, a function (also procedure, method, subroutine, routine, or subprogram) is a callable unit of software logic that has a well-defined interface and behavior and can be invoked multiple times. Callable units provide a powerful programming tool. The primary purpose is to allow for the decompositio...	Wikipedia/Function_(programming)
In software engineering and computer science, abstraction is the process of generalizing concrete details, such as attributes, away from the study of objects and systems to focus attention on details of greater importance. Abstraction is a fundamental concept in computer science and software engineering, especially wit...	Wikipedia/Abstraction_(computer_science)
In mathematics, a function from a set X to a set Y assigns to each element of X exactly one element of Y. The set X is called the domain of the function and the set Y is called the codomain of the function. Functions were originally the idealization of how a varying quantity depends on another quantity. For example, th...	Wikipedia/Functional_notation
Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions. Semantically, it is the application of algebraic operations on analytic...	Wikipedia/Microfunction
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, and applied mathematics, as w...	Wikipedia/Functions_of_a_complex_variable
In the mathematical field of real analysis, a simple function is a real (or complex)-valued function over a subset of the real line, similar to a step function. Simple functions are sufficiently "nice" that using them makes mathematical reasoning, theory, and proof easier. For example, simple functions attain only a f...	Wikipedia/Simple_function
In mathematics, the inverse function of a function f (also called the inverse of f) is a function that undoes the operation of f. The inverse of f exists if and only if f is bijective, and if it exists, is denoted by f − 1 ...	Wikipedia/Right_inverse_function
In computer science, purely functional programming usually designates a programming paradigm—a style of building the structure and elements of computer programs—that treats all computation as the evaluation of mathematical functions. Program state and mutable objects are usually modeled with temporal logic, as explicit...	Wikipedia/Purely_functional_programming
In mathematics, especially measure theory, a set function is a function whose domain is a family of subsets of some given set and that (usually) takes its values in the extended real number line R ∪ { ± ∞ } , {\d...	Wikipedia/Set_function
Curve fitting is the process of constructing a curve, or mathematical function, that has the best fit to a series of data points, possibly subject to constraints. Curve fitting can involve either interpolation, where an exact fit to the data is required, or smoothing, in which a "smooth" function is constructed that ap...	Wikipedia/Function_fitting
In mathematics, a multivalued function, multiple-valued function, many-valued function, or multifunction, is a function that has two or more values in its range for at least one point in its domain. It is a set-valued function with additional properties depending on context; some authors do not distinguish between set-...	Wikipedia/Multi-valued_function
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, and applied mathematics, as w...	Wikipedia/Complex_function
In mathematics, the error function (also called the Gauss error function), often denoted by erf, is a function e r f : C → C {\displaystyle \mathrm {erf} :\mathbb {C} \...	Wikipedia/Error_function
Special functions are particular mathematical functions that have more or less established names and notations due to their importance in mathematical analysis, functional analysis, geometry, physics, or other applications. The term is defined by consensus, and thus lacks a general formal definition, but the list of ma...	Wikipedia/Special_function
In computer science and mathematical logic, a function type (or arrow type or exponential) is the type of a variable or parameter to which a function has or can be assigned, or an argument or result type of a higher-order function taking or returning a function. A function type depends on the type of the parameters and...	Wikipedia/Function_type
In computer science, an operation, function or expression is said to have a side effect if it has any observable effect other than its primary effect of reading the value of its arguments and returning a value to the invoker of the operation. Example side effects include modifying a non-local variable, a static local v...	Wikipedia/Side_effect_(computer_science)
In computer programming, a function (also procedure, method, subroutine, routine, or subprogram) is a callable unit of software logic that has a well-defined interface and behavior and can be invoked multiple times. Callable units provide a powerful programming tool. The primary purpose is to allow for the decompositio...	Wikipedia/Function_(computer_programming)
In mathematics, the restriction of a function f {\displaystyle f} is a new function, denoted f \| A {\displaystyle f\vert _{A}} or f ...	Wikipedia/Restriction_of_a_function
In mathematics, the inverse function of a function f (also called the inverse of f) is a function that undoes the operation of f. The inverse of f exists if and only if f is bijective, and if it exists, is denoted by f − 1 ...	Wikipedia/Left_inverse_function
In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments of a function, producing another function of smaller arity. Given a function f : ( X × Y × Z ) ...	Wikipedia/Partial_application
In mathematics, exponentiation, denoted bn, is an operation involving two numbers: the base, b, and the exponent or power, n. When n is a positive integer, exponentiation corresponds to repeated multiplication of the base: that is, bn is the product of multiplying n bases: b ...	Wikipedia/Exponential_functions
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursi...	Wikipedia/General_recursive_function
In multivariable calculus, the implicit function theorem is a tool that allows relations to be converted to functions of several real variables. It does so by representing the relation as the graph of a function. There may not be a single function whose graph can represent the entire relation, but there may be such a f...	Wikipedia/Implicit_function_theorem
In mathematics, a square is the result of multiplying a number by itself. The verb "to square" is used to denote this operation. Squaring is the same as raising to the power 2, and is denoted by a superscript 2; for instance, the square of 3 may be written as 32, which is the number 9. In some cases when superscripts a...	Wikipedia/Square_function
In mathematics and physics, a scalar field is a function associating a single number to each point in a region of space – possibly physical space. The scalar may either be a pure mathematical number (dimensionless) or a scalar physical quantity (with units). In a physical context, scalar fields are required to be indep...	Wikipedia/Scalar-valued_function
A view model or viewpoints framework in systems engineering, software engineering, and enterprise engineering is a framework which defines a coherent set of views to be used in the construction of a system architecture, software architecture, or enterprise architecture. A view is a representation of the whole system f...	Wikipedia/View_model
In mathematics and computer science, an algorithm ( ) is a finite sequence of mathematically 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 co...	Wikipedia/Algorithmics
The systems modeling language (SysML) is a general-purpose modeling language for systems engineering applications. It supports the specification, analysis, design, verification and validation of a broad range of systems and systems-of-systems. SysML was originally developed by an open source specification project, and ...	Wikipedia/Systems_modeling_language
Processor design is a subfield of computer science and computer engineering (fabrication) that deals with creating a processor, a key component of computer hardware. The design process involves choosing an instruction set and a certain execution paradigm (e.g. VLIW or RISC) and results in a microarchitecture, which mig...	Wikipedia/Processor_design
The spiral model is a risk-driven software development process model. Based on the unique risk patterns of a given project, the spiral model guides a team to adopt elements of one or more process models, such as incremental, waterfall, or evolutionary prototyping. == History == This model was first described by Barry...	Wikipedia/Spiral_model
An information model in software engineering is a representation of concepts and the relationships, constraints, rules, and operations to specify data semantics for a chosen domain of discourse. Typically it specifies relations between kinds of things, but may also include relations with individual things. It can provi...	Wikipedia/Information_model
A system architecture is the conceptual model that defines the structure, behavior, and views of a system. An architecture description is a formal description and representation of a system, organized in a way that supports reasoning about the structures and behaviors of the system. A system architecture can consist of...	Wikipedia/Systems_architecture
Essential systems analysis was a new methodology for software specification published in 1984 by Stephen M. McMenamin and John F. Palmer for performing structured systems analysis based on the concept of event partitioning. The essence of a system is "its required behavior independent of the technology used to implemen...	Wikipedia/Essential_systems_analysis
In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating point, string) to every term (a word, phrase, or other set of symbols). Usually the terms are various language constructs of a computer program, such as variables, e...	Wikipedia/Type_systems
In software development, the V-model represents a development process that may be considered an extension of the waterfall model and is an example of the more general V-model. Instead of moving down linearly, the process steps are bent upwards after the coding phase, to form the typical V shape. The V-Model demonstrate...	Wikipedia/V-model_(software_development)
In computing, a compiler is a computer program that translates computer code written in one programming language (the source language) into another language (the target language). The name "compiler" is primarily used for programs that translate source code from a high-level programming language to a low-level programm...	Wikipedia/Compiler_design
A database model is a type of data model that determines the logical structure of a database. It fundamentally determines in which manner data can be stored, organized and manipulated. The most popular example of a database model is the relational model, which uses a table-based format. == Types == Common logical dat...	Wikipedia/Database_model
Data modeling in software engineering is the process of creating a data model for an information system by applying certain formal techniques. It may be applied as part of broader Model-driven engineering (MDE) concept. == Overview == Data modeling is a process used to define and analyze data requirements needed to ...	Wikipedia/Data_modeling
In systems engineering, software engineering, and computer science, a function model or functional model is a structured representation of the functions (activities, actions, processes, operations) within the modeled system or subject area. A function model, similar with the activity model or process model, is a graph...	Wikipedia/Function_model
In computing, object model has two related but distinct meanings: The properties of objects in general in a specific computer programming language, technology, notation or methodology that uses them. Examples are the object models of Java, the Component Object Model (COM), or Object-Modeling Technique (OMT). Such obj...	Wikipedia/Object_model
The philosophy of computer science is concerned with the philosophical questions that arise within the study of computer science. There is still no common understanding of the content, aims, focus, or topics of the philosophy of computer science, despite some attempts to develop a philosophy of computer science like th...	Wikipedia/Philosophy_of_computer_science
Applied science is the application of the scientific method and scientific knowledge to attain practical goals. It includes a broad range of disciplines, such as engineering and medicine. Applied science is often contrasted with basic science, which is focused on advancing scientific theories and laws that explain and ...	Wikipedia/Applied_science
Human-centered design (HCD, also human-centered design, as used in ISO standards) is an approach to problem-solving commonly used in process, product, service and system design, management, and engineering frameworks that develops solutions to problems by involving the human perspective in all steps of the problem-sol...	Wikipedia/Human-centered_design
The incremental build model is a method of software development where the product is designed, implemented, and tested incrementally (a little more is added each time) until the product is finished. It involves both development and maintenance. The product is defined as finished when it satisfies all of its requirement...	Wikipedia/Incremental_build_model
Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science, and more specifically the Computer Sciences, which uses advanced computing capabilities to understand and solve complex physical problems. While this typically extends into computatio...	Wikipedia/Computational_science
Model-driven engineering (MDE) is a software development methodology that focuses on creating and exploiting domain models, which are conceptual models of all the topics related to a specific problem. Hence, it highlights and aims at abstract representations of the knowledge and activities that govern a particular appl...	Wikipedia/Model-driven_engineering
A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n {\displaystyle n} bits) that has special properties desirable for a cryptographic application: the probability of a particular ...	Wikipedia/Cryptographic_hash_function

Subsets and Splits

No community queries yet

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