sat from FOLDOC

SATA

SATAN

Security Administrator's Integrated Network Tool

Sather

/Say-ther/ (Named after the Sather Tower at UCB, as opposed to the Eiffel Tower).

An interactive object-oriented language designed by Steve M. Omohundro at ICSI in 1991. Sather has simple syntax, similar to Eiffel, but it is non-proprietary and faster.

Sather 0.2 was nearly a subset of Eiffel 2.0, but Sather 1.0 adds many distinctive features: parameterised classes, multiple inheritance, statically-checked strong typing, garbage collection. The compiler generates C as an intermediate language. There are versions for most workstations.

Sather attempts to retain much of Eiffel's theoretical cleanliness and simplicity while achieving the efficiency of C++. The compiler generates efficient and portable C code which is easily integrated with existing code.

A variety of development tools including a debugger and browser based on gdb and a GNU Emacs development environment have also been written. There is also a class library with several hundred classes that implement a variety of basic data structures and numerical, geometric, connectionist, statistical, and graphical abstractions. The authors would like to encourage contributions to the library and hope to build a large collection of efficient, well-written, well-tested classes in a variety of areas of computer science.

Sather runs on Sun-4, HP9000/300, Decstation 5000, MIPS, Sony News 3000, Sequent/Dynix, SCO SysVR3.2, NeXT, Linux.

Sather-K

<language>

Karlsruhe Sather.

A sublanguage of Sather used for introductory courses in object-oriented design and typesafe programming.

E-mail: <[email protected]>.

Last updated: 1994-11-11

satisfiability problem

A problem used as an example in complexity theory. It can be stated thus:

 Given a Boolean expression E, decide if there is some
 assignment to the variables in E such that E is true.

A Boolean expression is composed of Boolean variables, (logical) negation (NOT), (logical) conjunction (AND) and parentheses for grouping. The satisfiability problem was the first problem to be proved to be NP-complete (by Cook).

["Introduction to Automata Theory, Languages, and Computation" by Hopcroft and Ullman, pub. Addison-Wesley].

Last updated: 1994-11-11

saturation

<graphics>

1. In colour theory, the "colourfulness" of a stimulus relative to its brightness, the amount of the dominant wavelength relative to other wavelengths in the colour, one of the three coordinates in the hue, saturation, value (HSV) and hue, saturation, brightness (HSB) colour models.

White, black and grey contain equal amounts of red, green and blue light and are completely unsaturated. A pure colour with very little gray in it is highly saturated. The amount of saturation does not affect the hue of a colour and is unrelated to the value (total amount of light in a colour).

There are several competing mathematical definitions of saturation.

http://www.ncsu.edu/scivis/lessons/colormodels/color_models2.html#saturation.

http://www.pomona.edu/academics/courserelated/classprojects/visual-lit/saturation/saturation.html.

2. The state of any system that is operating at its maximum capacity, e.g. a network connection that is carry a continuous stream of data with no idle time. Capacity planning aims to monitor load and increase resources before saturation is reached.

Last updated: 2008-05-09

Saturday-night special

<jargon>

(From police slang for a cheap handgun) A quick-and-dirty program or feature kluged together during off hours, under a deadline, and in response to pressure from a salescritter. Such hacks are dangerously unreliable, but all too often sneak into a production release after insufficient review.

[Jargon File]

Last updated: 1994-11-11

Nearby terms:

SASL+LV ♦ SASL-YACC ♦ SAS System ♦ SATA ♦ SATAN ♦ Sather ♦ Sather-K ♦ satisfiability problem

Try this search on Wikipedia, Wiktionary, Google, OneLook.