Content Management Interoperability Services - Wikipedia
Content Management Interoperability Services (CMIS) is an open standard that allows different content management systems to inter-operate over the Internet.[1] Specifically, CMIS defines an abstraction layer for controlling diverse document management systems and repositories using web protocols. CMIS defines a domain model plus bindings that can be used by applications to manipulate content store
XeTeX - Wikipedia
XeTeX (/ˈziːtɛx/ ZEE-tekh[1] or /ˈziːtɛk/; see also Pronouncing and writing "TeX") is a TeX typesetting engine using Unicode and supporting modern font technologies such as OpenType, Graphite and Apple Advanced Typography (AAT). It was originally written by Jonathan Kew and is distributed under the X11 free software license.[2] The last change to the source code was made on January 20, 2020, and t
Category theory - Wikipedia
Schematic representation of a category with objects X, Y, Z and morphisms f, g, g ∘ f. (The category's three identity morphisms 1X, 1Y and 1Z, if explicitly represented, would appear as three arrows, from the letters X, Y, and Z to themselves, respectively.) Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac La
Banach–Tarski paradox - Wikipedia
"Can a ball be decomposed into a finite number of point sets and reassembled into two balls identical to the original?" The Banach–Tarski paradox is a theorem in set-theoretic geometry, which states the following: Given a solid ball in three-dimensional space, there exists a decomposition of the ball into a finite number of disjoint subsets, which can then be put back together in a different way t
Environment variable - Wikipedia
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Environment variable" – news · newspapers · books · scholar · JSTOR (May 2023) (Learn how and when to remove this message) An environment variable is a user-definable value that can affect the way runnin
)
Digital differential analyzer (graphics algorithm) - Wikipedia
This article is about a graphics algorithm. For the digital implementation of a differential analyzer, see Digital differential analyzer. In computer graphics, a digital differential analyzer (DDA) is hardware or software used for interpolation of variables over an interval between start and end point. DDAs are used for rasterization of lines, triangles and polygons. They can be extended to non li
Bresenham's line algorithm - Wikipedia
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (e.g. on a computer screen), as it uses only integer addition, subtraction, and bit shifting, all of which are very cheap opera
Runge–Kutta methods - Wikipedia
In numerical analysis, the Runge–Kutta methods (English: /ˈrʊŋəˈkʊtɑː/ ⓘ RUUNG-ə-KUUT-tah[1]) are a family of implicit and explicit iterative methods, which include the Euler method, used in temporal discretization for the approximate solutions of simultaneous nonlinear equations.[2] These methods were developed around 1900 by the German mathematicians Carl Runge and Wilhelm Kutta. Slopes used by
Verlet integration - Wikipedia
Verlet integration (French pronunciation: [vɛʁˈlɛ]) is a numerical method used to integrate Newton's equations of motion.[1] It is frequently used to calculate trajectories of particles in molecular dynamics simulations and computer graphics. The algorithm was first used in 1791 by Jean Baptiste Delambre and has been rediscovered many times since then, most recently by Loup Verlet in the 1960s for
QR decomposition - Wikipedia
In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of an orthonormal matrix Q and an upper triangular matrix R. QR decomposition is often used to solve the linear least squares (LLS) problem and is the basis for a particular eigenvalue algorithm, the QR algorithm. Any real square matrix A may be decomp
Lattice Boltzmann methods - Wikipedia
The lattice Boltzmann methods (LBM), originated from the lattice gas automata (LGA) method (Hardy-Pomeau-Pazzis and Frisch-Hasslacher-Pomeau models), is a class of computational fluid dynamics (CFD) methods for fluid simulation. Instead of solving the Navier–Stokes equations directly, a fluid density on a lattice is simulated with streaming and collision (relaxation) processes.[1] The method is ve
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Categorical logic - Wikipedia
Teredo tunneling - Wikipedia
Special folder - Wikipedia
Newtonian fluid - Wikipedia