Vitis labruscaVitis labrusca, the fox grape, is a species of grapevines belonging to the Vitis genus in the flowering plant family Vitaceae. The vines are native to eastern North America and are the source of many grape cultivars, including Catawba, Concord, Delaware, Isabella, Niagara, and many hybrid grape varieties such as Agawam, Alexander and Onaka. Among the characteristics of this vine species in contrast to the European wine grape Vitis vinifera are its "slip-skin" that allows the skin of the grape berries to easily slip off when squeezed, instead of crushing the pulp, and the presence of tendrils on every node of the cane.
SchutzstaffelThe Schutzstaffel (SS; also stylized as ᛋᛋ with Armanen runes; ˈʃʊtsˌʃtafl̩; Protection Squadron) was a major paramilitary organization under Adolf Hitler and the Nazi Party in Nazi Germany, and later throughout German-occupied Europe during World War II. It began with a small guard unit known as the Saal-Schutz ("Hall Security") made up of party volunteers to provide security for party meetings in Munich. In 1925, Heinrich Himmler joined the unit, which had by then been reformed and given its final name.
X-galX-gal (also abbreviated BCIG for 5-bromo-4-chloro-3-indolyl-β--galactopyranoside) is an organic compound consisting of galactose linked to a substituted indole. The compound was synthesized by Jerome Horwitz and collaborators in 1964. The formal chemical name is often shortened to less accurate but also less cumbersome phrases such as bromochloroindoxyl galactoside. The X from indoxyl may be the source of the X in the X-gal contraction.
JPEG 2000JPEG 2000 (JP2) is an standard and coding system. It was developed from 1997 to 2000 by a Joint Photographic Experts Group committee chaired by Touradj Ebrahimi (later the JPEG president), with the intention of superseding their original JPEG standard (created in 1992), which is based on a discrete cosine transform (DCT), with a newly designed, wavelet-based method. The standardized is .jp2 for ISO/IEC 15444-1 conforming files and .jpx for the extended part-2 specifications, published as ISO/IEC 15444-2.
Β-Galactosidaseβ-Galactosidase (EC 3.2.1.23, lactase, beta-gal or β-gal; systematic name β-D-galactoside galactohydrolase), is a glycoside hydrolase enzyme that catalyzes hydrolysis of terminal non-reducing β-D-galactose residues in β-D-galactosides. β-Galactosides include carbohydrates containing galactose where the glycosidic bond lies above the galactose molecule. Substrates of different β-galactosidases include ganglioside GM1, lactosylceramides, lactose, and various glycoproteins.
VoltThe volt (symbol: V) is the unit of electric potential, electric potential difference (voltage), and electromotive force in the International System of Units (SI). It is named after the Italian physicist Alessandro Volta (1745–1827). One volt is defined as the electric potential between two points of a conducting wire when an electric current of one ampere dissipates one watt of power between those points. Equivalently, it is the potential difference between two points that will impart one joule of energy per coulomb of charge that passes through it.
DjVuDjVu (ˌdeɪʒɑːˈvuː , like French "déjà vu") is a computer designed primarily to store , especially those containing a combination of text, line drawings, indexed color images, and photographs. It uses technologies such as image layer separation of text and background/images, progressive loading, arithmetic coding, and lossy compression for (monochrome) images. This allows high-quality, readable images to be stored in a minimum of space, so that they can be made available on the web.
RS-232In telecommunications, RS-232 or Recommended Standard 232 is a standard originally introduced in 1960 for serial communication transmission of data. It formally defines signals connecting between a DTE (data terminal equipment) such as a computer terminal, and a DCE (data circuit-terminating equipment or data communication equipment), such as a modem. The standard defines the electrical characteristics and timing of signals, the meaning of signals, and the physical size and pinout of connectors.
RS-485RS-485, also known as TIA-485(-A) or EIA-485, is a standard, originally introduced in 1983, defining the electrical characteristics of drivers and receivers for use in serial communications systems. Electrical signaling is balanced, and multipoint systems are supported. The standard is jointly published by the Telecommunications Industry Association and Electronic Industries Alliance (TIA/EIA). Digital communications networks implementing the standard can be used effectively over long distances and in electrically noisy environments.
NP-hardnessIn computational complexity theory, NP-hardness (non-deterministic polynomial-time hardness) is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". A simple example of an NP-hard problem is the subset sum problem. A more precise specification is: a problem H is NP-hard when every problem L in NP can be reduced in polynomial time to H; that is, assuming a solution for H takes 1 unit time, Hs solution can be used to solve L in polynomial time.
NP-completenessIn computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) solution. The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions.
NP (complexity)In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer is "yes", have proofs verifiable in polynomial time by a deterministic Turing machine, or alternatively the set of problems that can be solved in polynomial time by a nondeterministic Turing machine. NP is the set of decision problems solvable in polynomial time by a nondeterministic Turing machine.
