34-letter words containing s, p, e, r, m, a
- adaptive transform acoustic coding — (algorithm) (ATRAC) An audio compression algorithm, introduced by Sony for its Mini Disk, which relies on the masking of low-amplitude frequency components by temporaly adjacent high-amplitude components. ATRAC consists of a three-band subband encoder (0...5.5, 5.5...11, 11...22 kHz) and a MDCT based transformation encoder.
- algebra of communicating processes — (theory) (ACP) Compare CCS.
- armenian soviet socialist republic — a republic of the U.S.S.R.: now Armenia (the country)
- association of american publishers — (body, publication) (AAP) A group engaged in standardisation efforts in document preparation.
- asymmetric digital subscriber loop — Asymmetric Digital Subscriber Line
- be charm, success, etc personified — to be very charming, successful, etc
- chechen-ingush autonomous republic — an autonomous republic of the Russian Federation, in Caucasia. 7350 sq. mi. (19,300 sq. km). Capital: Grozny.
- communicating functional processes — (language) (CFP) A parallel functional programming language.
- communicating sequential processes — (language, parallel) (CSP) A notation for concurrency based on synchronous message passing and selective communications designed by Anthony Hoare in 1978. It features cobegin and coend and was a precursor to occam. See also Contextually Communicating Sequential Processes.
- component integration laboratories — (project) (CIL) An effort to create a common framework for interoperability between application programs on desktop platforms, formed by Apple Computer, Inc., IBM, Novell, Oracle, Taligent, WordPerfect and Xerox.
- comprehensive perl archive network — (tool) (CPAN) A collection of Internet archives containing material related to the Perl programming language.
- consumer product safety commission — an independent regulatory agency, created in 1972, that protects the public against risk of injury from consumer products. Abbreviation: CPSC.
- continuous system modeling program — (simulation) (CSMP) A program for simulation of dynamics of continuous systems by numerical integration of complex systems of differential equations. CSMP is similar to CSSL.
- control program for microcomputers — (operating system) (CP/M) An early microcomputer operating system written by Gary Kildall of Digital Research for 8080 and Zilog Z80-based 8-bit computers. CP/M was very popular in the late 1970s but was virtually wiped out by MS-DOS after the release of the IBM PC in 1981. Many of CP/M's features and conventions strongly resemble those of early DEC operating systems such as TOPS-10, OS/8, RSTS and RSX-11. CP/M might have been the OS for the IBM PC instead of MS-DOS but Kildall wanted to keep control of his creation and only license it to IBM. Big Blue however wanted to own and control it completely. Kildall spent the day IBM's reps wanted to meet him enjoying the perfect flying weather in his private plane.
- frequency division multiple access — frequency division multiplexing
- industrial development certificate — (in Britain) a certificate issued by the Department of the Environment to an industrial organization wishing to build or extend a factory, which has to accompany an application for planning permission
- joint bi-level image experts group — (algorithm) (JBIG) An experts group of ISO, IEC and ITU-T (JTC1/SC2/WG9 and SGVIII) working to define a compression standard for lossless image coding. Their proposed algorithm features compatible progressive coding and sequential coding and is lossless - the image is unaltered after compression and decompression. JBIG can handle images with from one to 255 bits per pixel. Better compression algorithms exist for more than about eight bits per pixel. With multiple bits per pixel, Gray code can be used to reduce the number of bit changes between adjacent decimal values (e.g. 127 and 128), and thus improve the compression which JBIG does on each bitplane. JBIG uses discrete steps of detail by successively doubling the resolution. The sender computes a number of resolution layers and transmits these starting at the lowest resolution. Resolution reduction uses pixels in the high resolution layer and some already computed low resolution pixels as an index into a lookup table. The contents of this table can be specified by the user. Compatibility between progressive and sequential coding is achieved by dividing an image into stripes. Each stripe is a horizontal bar with a user definable height. Each stripe is separately coded and transmitted, and the user can define in which order stripes, resolutions and bitplanes are intermixed in the coded data. A progressively coded image can be decoded sequentially by decoding each stripe, beginning by the one at the top of the image, to its full resolution, and then proceeding to the next stripe. Progressive decoding can be done by decoding only a specific resolution layer from all stripes. After dividing an image into bitplanes, resolution layers and stripes, eventually a number of small bi-level bitmaps are left to compress. Compression is done using a Q-coder. The Q-coder codes bi-level pixels as symbols using the probability of occurrence of these symbols in a certain context. JBIG defines two kinds of context, one for the lowest resolution layer (the base layer), and one for all other layers (differential layers). Differential layer contexts contain pixels in the layer to be coded, and in the corresponding lower resolution layer. For each combination of pixel values in a context, the probability distribution of black and white pixels can be different. In an all white context, the probability of coding a white pixel will be much greater than that of coding a black pixel. The Q-coder, like Huffman coding, achieves compression by assigning more bits to less probable symbols. The Q-coder can, unlike a Huffman coder, assign one output code bit to more than one input symbol, and thus is able to compress bi-level pixels without explicit clustering, as would be necessary using a Huffman coder. Maximum compression will be achieved when all probabilities (one set for each combination of pixel values in the context) follow the probabilities of the pixels. The Q-coder therefore continuously adapts these probabilities to the symbols it sees. JBIG can be regarded as two combined algorithms: (1) Sending or storing multiple representations of images at different resolutions with no extra storage cost. Differential layer contexts contain pixels in two resolution layers, and so enable the Q-coder to effectively code the difference in information between the two layers, instead of the information contained in every layer. This means that, within a margin of approximately 5%, the number of resolution layers doesn't effect the compression ratio. (2) A very efficient compression algorithm, mainly for use with bi-level images. Compared to CCITT Group 4, JBIG is approximately 10% to 50% better on text and line art, and even better on halftones. JBIG, just like Group 4, gives worse compression in the presence of noise in images. An example application would be browsing through an image database.
- misprision of felony (or treason) — the offense of concealing knowledge of a felony (or treason) by one who has not participated or assisted in it
- multiple instruction multiple data — Multiple Instruction/Multiple Data
- pay a person back in the same coin — to treat a person in the same way the person treated oneself
- perpetual motion of the first kind — motion of a hypothetical mechanism that continues indefinitely without any external source of energy. It is impossible in practice because of friction
- processor system modeling language — (language) (PSML) A language for simulating computer systems designs, implemented as a preprocessor to SIMSCRIPT.
- programmed graph rewriting systems — (language) (PROGRES) A very high level language based on graph grammars, developed by Andy Scheurr <[email protected]> and Albert Zuendorf <[email protected]> of RWTH, Aachen in 1991. PROGRES supports structurally object-oriented specification of attributed graph structures with multiple inheritance hierarchies and types of types (for parametric polymorphism). It also supports declarative/relational specification of derived attributes, node sets, binary relationships (directed edges) and Boolean constraints, rule-oriented/visual specification of parameterised graph rewrite rules with complex application conditions, nondeterministic and imperative programming of composite graph transformations (with built-in backtracking and cancelling arbitrary sequences of failing graph modifications). It is used for implementing abstract data types with graph-like internal structure, as a visual language for the graph-oriented database GRAS, and as a rule-oriented language for prototyping nondeterministically specified data/rule base transformations. PROGRES has a formally defined semantics based on "PROgrammed Graph Rewriting Systems". It is an almost statically typed language which additionally offers "down casting" operators for run time checked type casting/conversion (in order to avoid severe restrictions concerning the language's expressiveness). Version RWTH 5.10 includes an integrated environment.
- put that in your pipe and smoke it — accept that fact if you can
- real-time operating system nucleus — The Real-Time Operating System Nucleus
- simple network management protocol — (protocol) (SNMP) The Internet standard protocol, defined in STD 15, RFC 1157, developed to manage nodes on an IP network. SNMP is not limited to TCP/IP. It can be used to manage and monitor all sorts of equipment including computers, routers, wiring hubs, toasters and jukeboxes. See also Management Information Base, Simple Network Management Protocol version 2.
- social democratic and labour party — a Northern Irish political party, which advocates peaceful union with the Republic of Ireland
- supreme-court-of-the-united-states — Supreme Court of the United States.
On this page, we collect all 34-letter words with S-P-E-R-M-A. It’s easy to find right word with a certain length. It is the easiest way to find 34-letter word that contains in S-P-E-R-M-A to use in Scrabble or Crossword puzzles