text stringlengths 0 73.6k | source stringclasses 4
values |
|---|---|
Nested transaction-Nested transaction-The capability to handle nested transactions properly is a prerequisite for true component-based application architectures. In a component-based encapsulated architecture, nested transactions can occur without the programmer knowing it. A component function may or may not contain a... | milkshake721/2.1M-wiki-STEM |
Nested transaction-Nested transaction-Theory for nested transactions is similar to the theory for flat transactions.The banking industry usually processes financial transactions using open nested transactions, which is a looser variant of the nested transaction model that provides higher performance while accepting the... | milkshake721/2.1M-wiki-STEM |
Decamethylferrocene-Decamethylferrocene-Decamethylferrocene or bis(pentamethylcyclopentadienyl)iron(II) is a chemical compound with formula Fe(C5(CH3)5)2 or C20H30Fe. It is a sandwich compound, whose molecule has an iron(II) cation Fe2+ attached by coordination bonds between two pentamethylcyclopentadienyl anions (Cp*−... | milkshake721/2.1M-wiki-STEM |
Decamethylferrocene-Preparation-Decamethylferrocene is prepared in the same manner as ferrocene from pentamethylcyclopentadiene. This method can be used to produce other decamethylcyclopentadienyl sandwich compounds.
2 Li(C5Me5) + FeCl2 → Fe(C5Me5)2 + 2 LiClThe product can be purified by sublimation. FeCp*2 has stagger... | milkshake721/2.1M-wiki-STEM |
Decamethylferrocene-Redox reactions-Like ferrocene, decamethylferrocene forms a stable cation because Fe(II) is easily oxidized to Fe(III). Because of the electron donating methyl groups on the Cp* groups, decamethylferrocene is more reducing than is ferrocene. In a solution of acetonitrile the reduction potential for ... | milkshake721/2.1M-wiki-STEM |
RoboCup Simulation League-RoboCup Simulation League-The RoboCup Simulation League is one of five soccer leagues within the RoboCup initiative.It is characterised by independently moving software players (agents) that play soccer on a virtual field inside a computer simulation.
It is divided into four subleagues: 2D Soc... | milkshake721/2.1M-wiki-STEM |
RoboCup Simulation League-Differences between 2D and 3D simulations-The 2D simulation sub-league had its first release in early 1995 with version 0.1. It has been actively maintained since then with updates every few months. The ball and all players are represented as circles on the plane of the field. Their position i... | milkshake721/2.1M-wiki-STEM |
RoboCup Simulation League-Differences between 2D and 3D simulations-As of 2010, a direct comparison of the gameplay of the 2D and 3D leagues shows a marked difference. 2D league teams are generally exhibiting advanced strategies and teamwork, whereas 3D teams appear to struggle with the basics of stability and ambulati... | milkshake721/2.1M-wiki-STEM |
RoboCup Simulation League-Differences between 2D and 3D simulations-In the 2D system, movement around the plane is achieved via commands from the agents such as move, dash, turn and kick. The 3D system has fewer command choices for agents to send, but the mechanics of motion about the field are much more involved as th... | milkshake721/2.1M-wiki-STEM |
Lagometer-Lagometer-A lagometer is a display of network latency on an Internet connection and of rendering by the client. Lagometers are commonly found in computer games or IRC where timing plays a large role. Quake and derived games commonly have them. | milkshake721/2.1M-wiki-STEM |
Lagometer-Lagometer-Advanced lagometer consists of two lines – bottom and top. The bottom line advances one pixel per each snapshot received from server (by default they are being sent at 20 snapshots per second rate), while the top one advances one pixel per each frame that is rendered by client. Thus, if the machine ... | milkshake721/2.1M-wiki-STEM |
Lagometer-Lagometer-Bottom bars correspond to delay before sending a snapshot by a server and receiving it by a client (so called "ping"). The shorter the bar, the smaller the ping was. Red bars mean that the frame has not arrived on time, yellow ones - that the snapshot was suppressed to stay under the rate limit.
Top... | milkshake721/2.1M-wiki-STEM |
Lagometer-Lagometer-The height of upper bars is proportional to the interpolated time between snapshots received (so as long as they come regularly, it stays below the "zero line" and is drawn in blue), or - if snapshots stop to arrive on time - is extrapolated after the last snapshot expected (then bars cross the "zer... | milkshake721/2.1M-wiki-STEM |
Lagometer-Lagometer-If those bars stay yellow for too long, client is forced to interpolate its frames beyond the "reasonable level" and finally, when the snapshot arrives, the prediction turns out to hardly correspond to the server-side version, which results in a jerky, non continuous movement of scenery (obviously l... | milkshake721/2.1M-wiki-STEM |
Russell 2000 Index-Russell 2000 Index-The Russell 2000 Index is a small-cap U.S. stock market index that makes up the smallest 2,000 stocks in the Russell 3000 Index. It was started by the Frank Russell Company in 1984. The index is maintained by FTSE Russell, a subsidiary of the London Stock Exchange Group (LSEG). | milkshake721/2.1M-wiki-STEM |
Russell 2000 Index-Overview-The Russell 2000 is by far the most common benchmark for mutual funds that identify themselves as "small-cap", while the S&P 500 index is used primarily for large capitalization stocks. It is the most widely quoted measure of the overall performance of small-cap to mid-cap company shares. It... | milkshake721/2.1M-wiki-STEM |
Russell 2000 Index-Overview-Similar small-cap indices include the S&P 600 from Standard & Poor's, which is less commonly used, along with those from other financial information providers. | milkshake721/2.1M-wiki-STEM |
Russell 2000 Index-Investing-Many fund companies offer mutual funds and exchange-traded funds (ETFs) that attempt to replicate the performance of the Russell 2000. Their results will be affected by stock selection, trading expenses, and market impact of reacting to changes in the constituent companies of the index. It ... | milkshake721/2.1M-wiki-STEM |
Sigma 150-600mm f/5-6.3 DG OS HSM lens-Sigma 150-600mm f/5-6.3 DG OS HSM lens-The Sigma APO 150-600mm F5-6.3 DG OS HSM lens is a super-telephoto lens produced by Sigma Corporation. | milkshake721/2.1M-wiki-STEM |
Sigma 150-600mm f/5-6.3 DG OS HSM lens-Sigma 150-600mm f/5-6.3 DG OS HSM lens-It is actually a range of two slightly different lenses based on a common design: the Sports and Contemporary. Both lenses feature similar specifications, but there are some notable differences. The Sports model has better weather sealing, mo... | milkshake721/2.1M-wiki-STEM |
Urelement-Urelement-In set theory, a branch of mathematics, an urelement or ur-element (from the German prefix ur-, 'primordial') is an object that is not a set, but that may be an element of a set. It is also referred to as an atom or individual. | milkshake721/2.1M-wiki-STEM |
Urelement-Theory-There are several different but essentially equivalent ways to treat urelements in a first-order theory.
One way is to work in a first-order theory with two sorts, sets and urelements, with a ∈ b only defined when b is a set. In this case, if U is an urelement, it makes no sense to say X∈U , although... | milkshake721/2.1M-wiki-STEM |
Urelement-Theory-Another way is to work in a one-sorted theory with a unary relation used to distinguish sets and urelements. As non-empty sets contain members while urelements do not, the unary relation is only needed to distinguish the empty set from urelements. Note that in this case, the axiom of extensionality mus... | milkshake721/2.1M-wiki-STEM |
Urelement-Theory-This situation is analogous to the treatments of theories of sets and classes. Indeed, urelements are in some sense dual to proper classes: urelements cannot have members whereas proper classes cannot be members. Put differently, urelements are minimal objects while proper classes are maximal objects b... | milkshake721/2.1M-wiki-STEM |
Urelement-Urelements in set theory-The Zermelo set theory of 1908 included urelements, and hence is a version now called ZFA or ZFCA (i.e. ZFA with axiom of choice). It was soon realized that in the context of this and closely related axiomatic set theories, the urelements were not needed because they can easily be mod... | milkshake721/2.1M-wiki-STEM |
Urelement-Urelements in set theory-Adding urelements to the system New Foundations (NF) to produce NFU has surprising consequences. In particular, Jensen proved the consistency of NFU relative to Peano arithmetic; meanwhile, the consistency of NF relative to anything remains an open problem, pending verification of Hol... | milkshake721/2.1M-wiki-STEM |
Urelement-Quine atoms-An alternative approach to urelements is to consider them, instead of as a type of object other than sets, as a particular type of set. Quine atoms (named after Willard Van Orman Quine) are sets that only contain themselves, that is, sets that satisfy the formula x = {x}.Quine atoms cannot exist i... | milkshake721/2.1M-wiki-STEM |
Mid-Atlantic Soft Matter Workshop-Mid-Atlantic Soft Matter Workshop-Mid-Atlantic Soft Matter Workshop or MASM is an interdisciplinary meeting on soft matter routinely hosted and participated in by research and educational organizations in the mid-Atlantic region of the United States.
The workshop consists of several ta... | milkshake721/2.1M-wiki-STEM |
Mid-Atlantic Soft Matter Workshop-History-MASM was started at Georgetown University and organized by Daniel Blair and Jeffrey Urbach of Georgetown University.
There have been 16 MASM meetings. The 16th MASM meeting was hosted at National Institutes of Health (NIH) on July 29, 2015. | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Discrete cosine transform-A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is a widely used transformation technique in signal processing and ... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Discrete cosine transform-The use of cosine rather than sine functions is critical for compression since fewer cosine functions are needed to approximate a typical signal, whereas for differential equations the cosines express a particular choice of boundary conditions. In particular, a DCT is... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Discrete cosine transform-The most common variant of discrete cosine transform is the type-II DCT, which is often called simply the DCT. This was the original DCT as first proposed by Ahmed. Its inverse, the type-III DCT, is correspondingly often called simply the inverse DCT or the IDCT. Two ... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-History-The DCT was first conceived by Nasir Ahmed, T. Natarajan and K. R. Rao while working at Kansas State University. The concept was proposed to the National Science Foundation in 1972. The DCT was originally intended for image compression. Ahmed developed a practical DCT algorithm with hi... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-The DCT is the most widely used transformation technique in signal processing, and by far the most widely used linear transform in data compression. Uncompressed digital media as well as lossless compression have high memory and bandwidth requirements, which is significantly reduc... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-DCTs are also widely employed in solving partial differential equations by spectral methods, where the different variants of the DCT correspond to slightly different even/odd boundary conditions at the two ends of the array.
DCTs are also closely related to Chebyshev polynomials, ... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-DCT visual media standards The DCT-II, also known as simply the DCT, is the most important image compression technique. It is used in image compression standards such as JPEG, and video compression standards such as H.26x, MJPEG, MPEG, DV, Theora and Daala. There, the two-dimensio... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-The integer DCT, an integer approximation of the DCT, is used in Advanced Video Coding (AVC), introduced in 2003, and High Efficiency Video Coding (HEVC), introduced in 2013. The integer DCT is also used in the High Efficiency Image Format (HEIF), which uses a subset of the HEVC v... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-Image formats Video formats MDCT audio standards General audio Speech coding MD DCT Multidimensional DCTs (MD DCTs) have several applications, mainly 3-D DCTs such as the 3-D DCT-II, which has several new applications like Hyperspectral Imaging coding systems, variable temporal le... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-Digital signal processing DCT plays a very important role in digital signal processing. By using the DCT, the signals can be compressed. DCT can be used in electrocardiography for the compression of ECG signals. DCT2 provides a better compression ratio than DCT.
The DCT is widely ... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Applications-Compression artifacts A common issue with DCT compression in digital media are blocky compression artifacts, caused by DCT blocks. The DCT algorithm can cause block-based artifacts when heavy compression is applied. Due to the DCT being used in the majority of digital image and vi... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Informal overview-Like any Fourier-related transform, discrete cosine transforms (DCTs) express a function or a signal in terms of a sum of sinusoids with different frequencies and amplitudes. Like the discrete Fourier transform (DFT), a DCT operates on a function at a finite number of discret... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Informal overview-The Fourier-related transforms that operate on a function over a finite domain, such as the DFT or DCT or a Fourier series, can be thought of as implicitly defining an extension of that function outside the domain. That is, once you write a function f(x) as a sum of sinusoid... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Informal overview-However, because DCTs operate on finite, discrete sequences, two issues arise that do not apply for the continuous cosine transform. First, one has to specify whether the function is even or odd at both the left and right boundaries of the domain (i.e. the min-n and max-n bou... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Informal overview-These choices lead to all the standard variations of DCTs and also discrete sine transforms (DSTs). Each boundary can be either even or odd (2 choices per boundary) and can be symmetric about a data point or the point halfway between two data points (2 choices per boundary),... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Informal overview-These different boundary conditions strongly affect the applications of the transform and lead to uniquely useful properties for the various DCT types. Most directly, when using Fourier-related transforms to solve partial differential equations by spectral methods, the bounda... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Informal overview-In particular, it is well known that any discontinuities in a function reduce the rate of convergence of the Fourier series, so that more sinusoids are needed to represent the function with a given accuracy. The same principle governs the usefulness of the DFT and other trans... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-Formally, the discrete cosine transform is a linear, invertible function f:RN→RN (where R denotes the set of real numbers), or equivalently an invertible N × N square matrix. There are several variants of the DCT with slightly modified definitions. The N real numbers x0,…x... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-Some authors further multiply the x0 and xN−1 terms by 2, and correspondingly multiply the X0 and XN−1 terms by 1/2, which makes the DCT-I matrix orthogonal, if one further multiplies by an overall scale factor of 2N−1, but breaks the direct correspondence with a real-... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-The DCT-I is exactly equivalent (up to an overall scale factor of 2), to a DFT of 2(N−1) real numbers with even symmetry. For example, a DCT-I of N=5 real numbers abcde is exactly equivalent to a DFT of eight real numbers abcdedcb (even symmetry), divided by two. (In cont... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-Thus, the DCT-I corresponds to the boundary conditions: xn is even around n=0 and even around n=N−1 ; similarly for Xk.
DCT-II cos for k=0,…N−1. | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-The DCT-II is probably the most commonly used form, and is often simply referred to as "the DCT".This transform is exactly equivalent (up to an overall scale factor of 2) to a DFT of 4N real inputs of even symmetry where the even-indexed elements are zero. That is, it is hal... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-DCT-II transformation is also possible using 2N signal followed by a multiplication by half shift. This is demonstrated by Makhoul. | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-Some authors further multiply the X0 term by 1/N and multiply the rest of the matrix by an overall scale factor of {\textstyle {\sqrt {{2}/{N}}}} (see below for the corresponding change in DCT-III). This makes the DCT-II matrix orthogonal, but breaks the direct corresponde... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-Because it is the inverse of DCT-II up to a scale factor (see below), this form is sometimes simply referred to as "the inverse DCT" ("IDCT").Some authors divide the x0 term by 2 instead of by 2 (resulting in an overall x0/2 term) and multiply the resulting matrix by an ov... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-The DCT-III implies the boundary conditions: xn is even around n=0 and odd around n=N; Xk is even around k=−1/2 and even around 2.
DCT-IV cos for k=0,…N−1. | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-The DCT-IV matrix becomes orthogonal (and thus, being clearly symmetric, its own inverse) if one further multiplies by an overall scale factor of {\textstyle {\sqrt {2/N}}.} A variant of the DCT-IV, where data from different transforms are overlapped, is called the modified ... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-DCT V-VIII DCTs of types I–IV treat both boundaries consistently regarding the point of symmetry: they are even/odd around either a data point for both boundaries or halfway between two data points for both boundaries. By contrast, DCTs of types V-VIII imply boundaries that a... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-In other words, DCT types I–IV are equivalent to real-even DFTs of even order (regardless of whether N is even or odd), since the corresponding DFT is of length 2(N−1) (for DCT-I) or 4N (for DCT-II & III) or 8N (for DCT-IV). The four additional types of discrete cosine tr... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Formal definition-However, these variants seem to be rarely used in practice. One reason, perhaps, is that FFT algorithms for odd-length DFTs are generally more complicated than FFT algorithms for even-length DFTs (e.g. the simplest radix-2 algorithms are only for even lengths), and this incre... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Inverse transforms-Using the normalization conventions above, the inverse of DCT-I is DCT-I multiplied by 2/(N − 1). The inverse of DCT-IV is DCT-IV multiplied by 2/N. The inverse of DCT-II is DCT-III multiplied by 2/N and vice versa.Like for the DFT, the normalization factor in front of these... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-Multidimensional variants of the various DCT types follow straightforwardly from the one-dimensional definitions: they are simply a separable product (equivalently, a composition) of DCTs along each dimension.
M-D DCT-II For example, a two-dimensional DCT-II of an image o... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-The inverse of a multi-dimensional DCT is just a separable product of the inverses of the corresponding one-dimensional DCTs (see above), e.g. the one-dimensional inverses applied along one dimension at a time in a row-column algorithm.The 3-D DCT-II is only the extension... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-The inverse of 3-D DCT-II is 3-D DCT-III and can be computed from the formula given by cos cos cos for 1. | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-Technically, computing a two-, three- (or -multi) dimensional DCT by sequences of one-dimensional DCTs along each dimension is known as a row-column algorithm. As with multidimensional FFT algorithms, however, there exist other methods to compute the same thing while perf... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-3-D DCT-II VR DIF In order to apply the VR DIF algorithm the input data is to be formulated and rearranged as follows. The transform size N × N × N is assumed to be 2. | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-x~(n1,n2,n3)=x(2n1,2n2,2n3)x~(n1,n2,N−n3−1)=x(2n1,2n2,2n3+1)x~(n1,N−n2−1,n3)=x(2n1,2n2+1,2n3)x~(n1,N−n2−1,N−n3−1)=x(2n1,2n2+1,2n3+1)x~(N−n1−1,n2,n3)=x(2n1+1,2n2,2n3)x~(N−n1−1,n2,N−n3−1)=x(2n1+1,2n2,2n3+1)x~(N−n1−1,N−n2−1,n3)=x(2n1+1,2n2+1,2n3)x~(N−n1−1,N−n2−1,N−n3−1)=x(2n... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-If the even and the odd parts of k1,k2 and k3 and are considered, the general formula for the calculation of the 3-D DCT-II can be expressed as cos cos cos (φ(2k3+l)) where x~ijl(n1,n2,n3)=x~(n1,n2,n3)+(−1)lx~(n1,n2,n3+n2) +(−1)jx~(n1,n2+n2,n3)+(−1)j+lx~(n1,n2+n2,n3+n... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-Arithmetic complexity The whole 3-D DCT calculation needs log 2N] stages, and each stage involves 18N3 butterflies. The whole 3-D DCT requires log 2N] butterflies to be computed. Each butterfly requires seven real multiplications (including trivial multiplications) a... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-The conventional method to calculate MD-DCT-II is using a Row-Column-Frame (RCF) approach which is computationally complex and less productive on most advanced recent hardware platforms. The number of multiplications required to compute VR DIF Algorithm when compared to R... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-The main consideration in choosing a fast algorithm is to avoid computational and structural complexities. As the technology of computers and DSPs advances, the execution time of arithmetic operations (multiplications and additions) is becoming very fast, and regular comp... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Multidimensional DCTs-The image to the right shows a combination of horizontal and vertical frequencies for an 8 × 8 (N1=N2=8) two-dimensional DCT. Each step from left to right and top to bottom is an increase in frequency by 1/2 cycle.
For example, moving right one from the top-left square y... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Computation-Although the direct application of these formulas would require O(N2) operations, it is possible to compute the same thing with only log N) complexity by factorizing the computation similarly to the fast Fourier transform (FFT). One can also compute DCTs via FFTs combined with ... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Computation-The most efficient algorithms, in principle, are usually those that are specialized directly for the DCT, as opposed to using an ordinary FFT plus O(N) extra operations (see below for an exception). However, even "specialized" DCT algorithms (including all of those that achieve th... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Computation-While DCT algorithms that employ an unmodified FFT often have some theoretical overhead compared to the best specialized DCT algorithms, the former also have a distinct advantage: Highly optimized FFT programs are widely available. Thus, in practice, it is often easier to obtain hi... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Computation-Specialized DCT algorithms, on the other hand, see widespread use for transforms of small, fixed sizes such as the 8 × 8 DCT-II used in JPEG compression, or the small DCTs (or MDCTs) typically used in audio compression. (Reduced code size may also be a reason to use a specialized D... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Computation-Because the even-indexed elements are zero, this radix-4 step is exactly the same as a split-radix step. If the subsequent size N real-data FFT is also performed by a real-data split-radix algorithm (as in Sorensen et al. (1987)), then the resulting algorithm actually matches what... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Computation-A recent reduction in the operation count to 17 log 2N+O(N) also uses a real-data FFT. So, there is nothing intrinsically bad about computing the DCT via an FFT from an arithmetic perspective – it is sometimes merely a question of whether the corresponding FFT algorithm is optima... | milkshake721/2.1M-wiki-STEM |
Discrete cosine transform-Example of IDCT-Consider this 8x8 grayscale image of capital letter A.
Each basis function is multiplied by its coefficient and then this product is added to the final image. | milkshake721/2.1M-wiki-STEM |
Monocytopenia-Monocytopenia-Monocytopenia is a form of leukopenia associated with a deficiency of monocytes.
It has been proposed as a measure during chemotherapy to predict neutropenia, though some research indicates that it is less effective than lymphopenia. | milkshake721/2.1M-wiki-STEM |
Monocytopenia-Causes-The causes of monocytopenia include: acute infections, stress, treatment with glucocorticoids, aplastic anemia, hairy cell leukemia, acute myeloid leukemia, treatment with myelotoxic drugs and genetic syndromes, as for example MonoMAC syndrome. | milkshake721/2.1M-wiki-STEM |
Monocytopenia-Diagnosis-- Blood Test (CBC) (Normal range of Monocytes: 1-10%) (Normal range in males: 0.2-0.8 x 10 3 /microliter)- Blood test checking for monocytopenia (Abnormal ranges: <1%) (Abnormal range in males: <0.2 x 10 3 /microliter) | milkshake721/2.1M-wiki-STEM |
Shc (shell script compiler)-Shc (shell script compiler)-shc is a shell script compiler for Unix-like operating systems written in the C programming language. The Shell Script Compiler (SHC) encodes and encrypts shell scripts into executable binaries. Compiling shell scripts into binaries provides protection against acc... | milkshake721/2.1M-wiki-STEM |
Shc (shell script compiler)-Mechanism-shc takes a shell script which is specified on the command line by the -f option and produces a C source code of the script with added encryption. The generated source code is then compiled and linked to produce a binary executable. It is a two step process where, first, it creates... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environment-In computing, a desktop environment (DE) is an implementation of the desktop metaphor made of a bundle of programs running on top of a computer operating system that share a common graphical user interface (GUI), sometimes described as a graphical shell. The desktop environment w... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environment-A desktop environment typically consists of icons, windows, toolbars, folders, wallpapers and desktop widgets (see Elements of graphical user interfaces and WIMP). A GUI might also provide drag and drop functionality and other features that make the desktop metaphor more complete... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environment-While the term desktop environment originally described a style of user interfaces following the desktop metaphor, it has also come to describe the programs that realize the metaphor itself. This usage has been popularized by projects such as the Common Desktop Environment, K Des... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Implementation-On a system that offers a desktop environment, a window manager in conjunction with applications written using a widget toolkit are generally responsible for most of what the user sees. The window manager supports the user interactions with the environment, while the toolkit provides ... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Implementation-A windowing system of some sort generally interfaces directly with the underlying operating system and libraries. This provides support for graphical hardware, pointing devices, and keyboards. The window manager generally runs on top of this windowing system. While the windowing syste... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Implementation-Applications that are created with a particular window manager in mind usually make use of a windowing toolkit, generally provided with the operating system or window manager. A windowing toolkit gives applications access to widgets that allow the user to interact graphically with the... | milkshake721/2.1M-wiki-STEM |
Desktop environment-History and common use-The first desktop environment was created by Xerox and was sold with the Xerox Alto in the 1970s. The Alto was generally considered by Xerox to be a personal office computer; it failed in the marketplace because of poor marketing and a very high price tag. With the Lisa, Apple... | milkshake721/2.1M-wiki-STEM |
Desktop environment-History and common use-The desktop metaphor was popularized on commercial personal computers by the original Macintosh from Apple in 1984, and was popularized further by Windows from Microsoft since the 1990s. As of 2014, the most popular desktop environments are descendants of these earlier environ... | milkshake721/2.1M-wiki-STEM |
Desktop environment-History and common use-Microsoft Windows dominates in marketshare among personal computers with a desktop environment. Computers using Unix-like operating systems such as macOS, ChromeOS, Linux, BSD or Solaris are much less common; however, as of 2015 there is a growing market for low-cost Linux PCs... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-On systems running the X Window System (typically Unix-family systems such as Linux, the BSDs, and formal UNIX distributions), desktop environments are much more dynamic and customizable to meet user needs. In this context, a desktop environment typically... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-Some window managers—such as IceWM, Fluxbox, Openbox, ROX Desktop and Window Maker—contain relatively sparse desktop environment elements, such as an integrated spatial file manager, while others like evilwm and wmii do not provide such elements. Not ... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-In 1996 the KDE was announced, followed in 1997 by the announcement of GNOME. Xfce is a smaller project that was also founded in 1996, and focuses on speed and modularity, just like LXDE which was started in 2006. A comparison of X Window System desktop e... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-To translators, a collaboration infrastructure. KDE and GNOME are available in many languages.
To artists, a workspace to share their talents.
To ergonomics specialists, the chance to help simplify the working environment.
To developers of third-party app... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-To users, a complete desktop environment and a suite of essential applications. These include a file manager, web browser, multimedia player, email client, address book, PDF reader, photo manager, and system preferences application.In the early 2000s, KDE... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-As GNOME and KDE focus on high-performance computers, users of less powerful or older computers often prefer alternative desktop environments specifically created for low-performance systems. Most commonly used lightweight desktop environments include LXD... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Desktop environments for the X Window System-For a while, GNOME and KDE enjoyed the status of the most popular Linux desktop environments; later, other desktop environments grew in popularity. In April 2011, GNOME introduced a new interface concept with its version 3, while a popular Linux distribut... | milkshake721/2.1M-wiki-STEM |
Desktop environment-Examples of desktop environments-The most common desktop environment on personal computers is Windows Shell in Microsoft Windows. Microsoft has made significant efforts in making Windows shell visually pleasing. As a result, Microsoft has introduced theme support in Windows 98, the various Windows X... | milkshake721/2.1M-wiki-STEM |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.