multistring

The AIM screen name of person as a multistring with two labels: kABAIMWorkLabel, and kABAIMHomeLabel

2003, Michael Beam, James Davidson, Cocoa in a Nutshell:

Multistring values are relatively simple to edit.

2006, Guy Hart-Davis, Mastering Windows XP Home Edition, page 320:

After that, two possibilities are offered: the first is to recover a string by thresholding the multistring and the second is to transform the Pattern Recognition algorithm that uses the median to use multistrings instead of strings.

2008, Niels da Vitoria Lobo, Takis Kasparis, Michael Georgiopoulos, Structural, Syntactic, and Statistical Pattern Recognition, page 432:

(programming, data structures) A data structure that represents multiple text strings.

Techniques such as multistrings (highways, buses etc ) and macrosymbols reduce the drawing and data entry problems and hence save time, reduce errors, and show better logcal flow.

1979, Gerald Musgrave, Computer Aided Design of Digital Electronic Circuits and Systems, page 16:

When there is a good deal of repetition in a logic design, such as in the data flow of a large computer, the multistring and multisymbol features of RMOD have enabled designs to be captured on between 1/2 and 2/3 the number of diagrams previouosly needed.

1981, European Conference on Electronic Design Automation, page 147:

Multistring computer modeling of APB effects on all annuli proved invaluable in the design process.

2003, SPE Drilling & Completion, page 234:

(CAD) A component of a model representing multiple parallel strings or lines.


code coverage

LL-Q1860 (eng)-Flame, not lame-code coverage.wav

(computer science) A measure of the degree to which the source code of a program is executed when a particular test suite is run.


DAGN

(computer science) Abbreviation of discourse-aware graph network.


bootflash

(computing) A flash memory used at bootstrap time for a device, commonly containing a bootloader and simple configuration information.


uncode

en-verb

uncode (third-person singular simple present uncodes, present participle uncoding, simple past and past participle uncoded)

uncodes (present singular third-person)
uncoding (participle present)
uncoded (participle past)
uncoded (past)

To uncode a data fragment, it is necessary to select it.

2022, Peter A. Stevens, Qualitative Data Analysis: Key Approaches:

(computing, transitive) To remove the code or coding from.


finite-state automaton

en-noun

finite-state automaton (plural finite-state automata)

finite-state machine
finite-state machine#English

(computing theory) Synonym of finite-state machine


round-trippable

(computing) Able to be exported and later reimported without loss of fidelity.


binary large object

binary large object (plural binary large objects)

(databases) A data type that allows storage of binary data often of indeterminate length, used for example to embed multimedia within a database table.


bitfilter

(computing) A specified subset of a sequence of bits.


autobackup

autobackup (countable and uncountable, plural autobackups)


SLSA

This metadata is stored in the format defined by the Supply-chain Levels for Software Artifacts (SLSA) framework[…]

2022, Anthony Bushong, Kent Hua, Cloud Native Automation with Google Cloud Build, Packt Publishing Ltd, →ISBN, page 95:

(software, computer security) Initialism of supply chain levels for software artifacts, a framework for verifying the provenance of software components.


DCN

dynamic circuit network
dynamic circuit network#English

(networking) Initialism of dynamic circuit network.


kangaroo code

Sometimes, especially when working on large projects or with multiple programmers, it can become hard to avoid kangaroo code, that is, code that jumps from function to function and even jumps around within the same class.

2016, J. F. DiMarzio, The Debugger's Handbook, page 25:

(programming, slang, rare) Poorly structured program code consisting of many jumps.


KVO

KVO, on the other hand, is a mixed bag. It can be useful, and it can cause trouble. It's implemented in a highly magical way, and some of its usage is quite awkward.

2014, Rob Napier, Mugunth Kumar, iOS 7 Programming Pushing the Limits, John Wiley & Sons, →ISBN, page 406:

(programming, Apple platforms) Initialism of key-value observing.


frobnicate

en-verb

frobnicate (third-person singular simple present frobnicates, present participle frobnicating, simple past and past participle frobnicated)

frobnicates (present singular third-person)
frobnicating (participle present)
frobnicated (participle past)
frobnicated (past)

(computing, slang, rare, transitive) Synonym of frob (“manipulate in some ill-defined way; tweak”)


pseudostatement

LL-Q1860 (eng)-Flame, not lame-pseudostatement.wav

If the label of a BEGIN pseudostatement is missing, the preceding and following cards are tested for clues: […]

1972, Bary W. Pollack, Compiler Techniques, page 287:

(programming) A construct resembling a statement that is not a true statement.


NNUE

Coined by Japanese computer scientist Yu Nasu in 2018 as an inversion of "Efficiently Updateable Neural Network" (stylized as ƎUИИ).

coinage

(computer chess) A type of neural network able to run on a CPU, trained to evaluate a board game (usually chess or shogi) position.


last known good

(computing) The most recent configuration that works properly, used to roll back changes that might later prove problematic.


device file

(computing) An interface to a device driver that appears in a file system, allowing an application program to interact with a device by using its device driver via standard input/output system calls.


subwiki

These subwikis provide a convenient way to organize lots of tests, as well as to allow for separate software projects to be managed by the same FitNesse system.

2005, Rick Mugridge, Ward Cunningham, Fit for Developing Software: Framework for Integrated Tests:

(computing, rare) A wiki forming part of a larger wiki.


edgeloop

Many newcomers make that mistake, not adding in edgeloops, and get flummoxed a little about why the deformer doesn't work.

2018, Tina O'Hailey, Rig it Right! Maya Animation Rigging Concepts, 2nd edition:

(computer graphics) Alternative form of edge loop


edge loop

(computer graphics) A set of connected edges across a surface, with the last edge usually meeting the first edge to form a loop.


charstring

Clipping of character string. By surface analysis, char + string.


bitrotten

en-adj

bitrotten (comparative more bitrotten, superlative most bitrotten)

more bitrotten (comparative)
most bitrotten (superlative)


Schneier's Law

(computer science) Alternative letter-case form of Schneier's law.


HPU

hogel processing unit
hogel processing unit#English

(computing) Abbreviation of hogel processing unit.


VPU

vector processing unit
vector processing unit#English

(computer hardware) Abbreviation of vector processing unit.

visual processing unit
visual processing unit#English

(computer graphics) Initialism of visual processing unit.

voxel processing unit
voxel processing unit#English

(computer graphics) Initialism of voxel processing unit.

video processing unit
video processing unit#English

(computing, video) Initialism of video processing unit.


artificial bee colony

en-noun

artificial bee colony (plural artificial bee colonies)

Proposed by Turkish computer scientist Derviş Karaboğa in 2005.

(computing) A metaheuristic-based optimization algorithm inspired by the intelligent foraging behavior of honey bee swarms.


BLAS

Basic Linear Algebra Subprograms
w:Basic Linear Algebra Subprograms

(computing) Acronym of Basic Linear Algebra Subprograms.


accession number

accession number (plural accession numbers)

(bioinformatics) A unique identifier given to a biological polymer sequence (DNA, protein) when it is submitted to a sequence database.


UFCS

Nim's default import behavior allows flexible Uniform Function Call Syntax (UFCS) and operator overloading.

2017, Dominik Picheta, Nim in Action, Simon and Schuster, →ISBN:

Uniform Function Call Syntax
w:Uniform Function Call Syntax

(programming) Initialism of Uniform Function Call Syntax.


DevEx

Coordinate term: UX

[…] ensure that the platform teams have a focus on user experience (UX) and particularly developer experience (DevEx).

2019, Matthew Skelton, Manuel Pais, Team Topologies: Organizing Business and Technology Teams for Fast Flow, IT Revolution, →ISBN:

developer experience
developer experience#English

(programming) Abbreviation of developer experience.


instantially

Have you tried using perform_now just for the sake of testing? It's equivalent to perform_later, but instead of enqueuing, it runs instantially.

2021 October 12, João Fernandes, “Rails test job and raise errors if any”, in Stack Overflow, retrieved 2023-04-27:

(computing) Happening when instances arise, rather than being enqueued.

en:when instances arise, rather than later


appification

While appification makes the former Web-based tools and apps more accessible, and improves users' quality of life, […]

2015, Barbara Guzzetti, Handbook of Research on the Societal Impact of Digital Media, page 417:

Our focus is on investigating the architecture-level decisions that are specific to the appification process.

2015, Danny Weyns, Raffaela Mirandola, Ivica Crnkovic, Software Architecture: 9th European Conference, ECSA 2015, page 38:

Tubi TV exemplifies an app's effort to step into this long, complicated global evolution of mobile television (Goggin 2012), and as such, it is emblematic of why the appification of television […]

2018, Jeremy W. Morris, Sarah Murray, Appified: Culture in the Age of Apps, page 243:

(computing) The conversion of traditional programs, websites, etc. into small, self-contained apps targeting mobile devices.


(databases, transaction processing) Initialism of two-phase locking.


backportability

with backportability in mind

(computing) The quality of being backportable.


backportable

backportable to older releases


IIR

IIR filter

infinite impulse response
infinite impulse response#English

(computing) Short for infinite impulse response.


distro-hopping

/ˈdɪstɹəʊˌhɒpɪŋ/

/ˈdɪstɹoʊˌhɑpɪŋ/

LL-Q1860 (eng)-Flame, not lame-distro-hopping.wav

After years of distro-hopping, I finally settled on Debian.

Choosing a distribution is a personal choice and most people find the one that's right for them by distro-hopping, the process of trying out different distributions, until, like Goldilocks, you find the one that's just right.

2016 November 17, Steven Ovadia, Learn Linux in a Month of Lunches, Simon and Schuster, →ISBN:

Distro-Hopping is a term that refers to the activity or hobby of Linux users to switch between distros frequently, exploring them and trying several distros out in an attempt to find the one that best suits their needs.

2020 February 6, Balaji Gunasekaran, “Distro-Hopping, What, Why & How Explained!”, in EmbeddedInventor.com, retrieved 2023-05-07:

Distro-hopping is a time-honored pastime, where you download and try different Linux distributions.

2021 August 13, Carla Schroder, Linux Cookbook, "O'Reilly Media, Inc.", →ISBN:

(software) The act of frequently changing the operating system of one's computer to a different distribution of Linux.


distro-hop

en-verb

distro-hop (third-person singular simple present distro-hops, present participle distro-hopping, simple past and past participle distro-hopped)

distro-hops (present singular third-person)
distro-hopping (participle present)
distro-hopped (participle past)
distro-hopped (past)

/ˈdɪstɹəʊˌhɒp/

LL-Q1860 (eng)-Flame, not lame-distro-hop.wav

I've been distro-hopping for two years now, but I still haven't found the perfect distro.

(intransitive, software) To engage in distro-hopping.


crowdtesting

software engineering
software engineering

(software engineering) Crowdsourced testing of software, performed by as many Internet users as possible.


masonry layout

(web design) A tightly-packed columnar layout in which there are no identifiable rows, unlike a uniform grid.


SNI

Server Name Indication
w:Server Name Indication

(networking) Initialism of Server Name Indication (“TLS extension”).


cloud-native

Therefore, at its most basic form, cloud native means to embrace cloud computing services to design the solution; however, that only covers part of what is required to become cloud native.

2018, Tom Laszewski, Kamal Arora, Erik Farr, Piyum Zonooz, Cloud Native Architectures […] , Packt Publishing Ltd, →ISBN, page 7:

Automation: Cloud-native applications and their life cycles should be automated as much as possible.

2018, Onur Yılmaz, Cloud-Native Continuous Integration and Delivery […] , Packt Publishing Ltd, →ISBN, page 11:

(computing, of a technology or architecture) Able to take full advantage of running on public, private, or hybrid cloud computing environments.


jBPM

(informatics) Abbreviation of Java Business Process Model.


WDL

We describe the main automated and manual steps taken before, during and after assembly. A combined set of workflow description language (WDL) formatted assembly workflows is available from Dockstore that captures each of the steps for filtering adapter-contained reads and running Hifiasm[.]

2023 May 11, Wen-Wei LiaoMobin AsriJana Ebleret al., “A draft human pangenome reference”, in Nature, volume 617, →DOI:

(computing) Initialism of workflow description language.


CADD

computer-aided design
computer-aided design#English

(computing, engineering) Initialism of computer-aided design and drafting.


orphan off

orphan off (third-person singular simple present orphans off, present participle orphaning off, simple past and past participle orphaned off)

orphans off (present singular third-person)
orphaning off (participle present)
orphaned off (participle past)
orphaned off (past)

(transitive, computing) To remove all links to (something), leaving it an orphan; to render a technical item (website, function, etc.) useless by removing references that call on it.


clusterer

(computing) That which divides data etc. into clusters.


non-stack

a non-stack developer

a non-stack framework

(computing) not skilled at, or relating to, multiple software layers such as operating system and user interface.


hexatrigesimal

en-noun

hexatrigesimal (countable and uncountable, plural hexatrigesimals)

From hexa- + tri- + decimal; see the Wikipedia article for hexadecimal for more information.

(arithmetic, computing, uncountable) A number system with base thirty-six, using the digits 0–9 and A–Z.

(countable, computing) A number expressed in the hexatridecimal system.


hexavigesimal

hexavigesimal (countable and uncountable, plural hexavigesimals)

From hexa- + vigesimal; see the Wikipedia article Hexadecimal for more information.

(arithmetic, computing, uncountable) A number system with base twenty-six, using the digits 0–9 and A–P (or A-Z without numerals).

(countable, computing) A number expressed in the hexavigesimal system.


DTLS

Datagram Transport Layer Security
w:Datagram Transport Layer Security

(computing, telecommunications) Initialism of Datagram Transport Layer Security.


quadravigesimal

quadravigesimal (countable and uncountable, plural quadravigesimals)

/ˌkwɒdˈɹɑvaɪd͡ʒɛsɪməl/

(arithmetic, computing, uncountable) A number system with base twenty-four, using the digits 0–9 and A–N (or Greek α-ω without numerals).

(countable, computing) A number expressed in the quadravigesimal system.


WWAN

wireless wide area network
wireless wide area network#English

(networking) Initialism of wireless wide area network.


COMAL

Acronym of common algorithmic language, inspired by ALGOL (“algorithmic language”).

Mr. Lindsey's letter in Vol. 5, No. 11 made some misleading claims for COMAL. He stated that COMAL, like BASIC, is free. Well, back in October of 1981, a price of $49.95 for a COMAL starter package was mentioned in Robert Baker's PET-pourri column in Microcomputing.

1983 May 23, Willi Kusche, “COMAL claims are questionable”, in InfoWorld, volume 5, number 21, page 39:

programming language
programming language

(computer languages) A programming language influenced by BASIC and Pascal.


hybrid sleep

(computing, Microsoft Windows) A variant of sleep mode in which current data is retained both in memory (allowing fast resumption, as if from hibernation) and on disk (to protect from data loss in the event of a power cut).


code position

The ISO 8859 character codes use the obvious encoding: each code position is represented as one octet.

2006, Jukka K. Korpela, Unicode Explained, O'Reilly, →ISBN, page 126:


US-ASCII

Here, we see that the source encoding has fallen back to US-ASCII because none was explicitly set.

2009, Gregory T. Brown, Ruby Best Practices, O'Reilly, →ISBN, page 189:

(computing, formal, retronym) Synonym of ASCII, especially to differentiate it from 8-bit extended ASCII.


Day-Stout-Warren algorithm

the Day-Stout-Warren algorithm (canonical)

Designed by Quentin F. Stout and Bette Warren in a 1986 paper, based on work done by Colin Day in 1976.

(computing theory) A method for efficiently balancing a binary search tree.


DSW

Day-Stout-Warren algorithm
Day-Stout-Warren algorithm#English

(computing theory) Initialism of Day-Stout-Warren algorithm.


PIF

program information file
w:program information file

(computing, historical) Initialism of program information file, a file defining how a DOS program should be run under a multitasking environment.


Unicodify

en-verb

Unicodify (third-person singular simple present Unicodifies, present participle Unicodifying, simple past and past participle Unicodified)

Unicodifies (present singular third-person)
Unicodifying (participle present)
Unicodified (participle past)
Unicodified (past)

I think now that people have had time to "Unicodify" their applications with 5.8.x, starting to collect the tricks required and found useful would not be a bad idea.

2004 January 3, Jarkko Hietaniemi, “Re: Keeping byte-wise processing as an option”, in perl.unicode (Usenet):

(transitive, computing) To make (something) compatible with Unicode.


Putnam model

(software engineering) A model that describes the time and effort required to finish a software project of a specified size, taking productivity into account.


if-then

List Formatter makes properly-spaced & indented listings with page breaks; each statement on new line, if-thens and loops called out; a great de-bugger!

Storing (closed) predicate definitions in this form (if all the predicates are so stored, and there never were any cuts or if-thens in the first place, we have the well-known "completion" of a logic program) makes the coding of source-level tools simpler.

1985, 1985 Symposium on Logic Programming: July 15-18, 1985; Sheraton Boston Hotel Boston, Mass., IEEE Computer Society Press, →ISBN, page 71:

1. The problem is well bounded, 2. There are many empirical if/thens that lead to a correct solution, 3. The total number of if/thens is sufficient to bring you close to a right answer (Mazur 1987).

1989 December, David W. Long, Michael R. Wagner, “Insect Pest Management Expert Systems in Multiresource Management of Ponderosa Pine”, in Multiresource Management of Ponderosa Pine Forests: Nov. 14 - 16, 1989, Flagstaff, Arizona (General Technical Report RM-185), page 260:

Many if-thens will degrade vector performance below that of a scalar version that computes only the correct branch.

1992, Donald L. DeAngelis, Louis J. Gross, editors, Individual-Based Models and Approaches in Ecology: Populations, Communities and Ecosystems, Chapman and Hall, →ISBN, pages 154–155:

Think of this process as programming with pictures, complete with loops, pauses, if-thens, and so on.

Finally, they use descriptions and statements from set theory to provide material for flowcharting problems that contain multiple decisions (nested if-thens).

2000, Harold J. Rood, Logic and Structured Design for Computer Programmers, Brooks/Cole, →ISBN, page ix:

Simple statements (like assignments and if-thens) are executed serially.

2001, Mark Guzdial, Squeak: Object-Oriented Design with Multimedia Applications, Prentice Hall, →ISBN, page 35:

But I think that the badge system is very motivating, and if one of your goals is to get students to become more proficient in the programming, then this is certainly a way to do that. Because you set not a very high bar toward attaining these things and some of them I think are quite challenging – you know, doing the ones for lists, and the if-thens, and all that.

2004, Jim, quotee, “Co-Evolution of Design and Pedagogy Online”, in Sasha A. Barab, Rob Kling, James H. Gray, editors, Designing for Virtual Communities in the Service of Learning (Learning in Doing: Social, Cognitive and Computational Perspectives), Cambridge University Press, →ISBN, page 253:

However, you can neither create multiple if-thens that execute simultaneously, nor create a rule based on a file’s Kind—so this utility’s utility is limited (November 2003).

Have you noticed any similarities between “programming” a mechanical system and writing software? / The logical problems are absolutely the same. In the mechanical and in the computer, there are equivalents of variables and if-thens.

2005 February, Make: Technology on Your Time, volume 01, O’Reilly Media, Inc., →ISBN, page 160:

There’s some recursive programming in her that gives more weight to associative and metaphorical thinking than to logical if-thens.

2012, Kim Stanley Robinson, 2312, Hachette, →ISBN:

(programming) A conditional statement; a line of code that specifies a Boolean condition to check and a statement to execute when that Boolean evaluates to true.


Erlang

Named after Danish mathematician and engineer Agner Krarup Erlang (1878–1929) and a clipping of Ericsson language, the company where it originated.

named-after

If you need to wring out every drop of performance on a complex task, or want to avoid rewriting a library written in a language other than Erlang, you'll want to explore Erlang's tools for connecting with other programming languages.

2017, Simon St. Laurent, Introducing Erlang: Getting Started in Functional Programming, O'Reilly, →ISBN, page 172:

(computer languages) A functional programming language designed for highly concurrent and fault-tolerant applications.


BEAM

Elixir is a functional, dynamic language built on top of Erlang and the Erlang VM (BEAM).

2016, Kenny Ballou, Learning Elixir, Packt Publishing Ltd, →ISBN, page 1:

Bogdan's Erlang Abstract Machine
w:BEAM (Erlang virtual machine)

(programming, Erlang) Acronym of Bogdan's Erlang Abstract Machine.


matmul

(computing, informal) Short for matrix multiplication.


Brzozowski derivative

en-noun

Brzozowski derivative (plural Brzozowski derivatives)

Named after the computer scientist Janusz Brzozowski, who investigated its properties.

(computing theory) The set of all strings obtainable from a given set of strings by cutting off a prefix. For example, for the set { cat, cow, dog }, the Brzozowski derivative with respect to c is { at, ow }. They have applications in regular expressions.


pseudoconsciousness

LL-Q1860 (eng)-Flame, not lame-pseudoconsciousness.wav

(neuroscience, neurology, psychology, computer science) A state or condition that is not consciousness but seemingly or nearly approaches it or simulates it.


net-neutral

In a net-neutral future it should still be possible, theoretically, for anyone with a camera and some willing friends to shoot a D.I.Y. video and put it online.

2011 March 25, Mike Hale, “A-List Stars Invade Digital Auteurs’ Space”, in The New York Times:

(networking) Characterized by net neutrality.


grim trigger

(game theory) A strategy that always cooperates as long as the opponent does not defect, in which case thereafter the strategy always defects.


bottom type

A new notion to many Java developers will be the idea that a class hierarchy can have common bottom types. These are types that are subtypes of all types. Scala's types Null and Nothing are both bottom types.

2017, Toby Weston, Scala for Java Developers: A Practical Primer, Apress, →ISBN, page 25:

(type theory, programming) The type that is a subtype of all other types.


carry-lookahead

A simpler scheme is to connect the carry-ins and carry-outs of the units in a ripple chain. This approach is most common in chip design because the wiring for the carry-lookahead tree is hard to design and area-consuming.

2004, Wayne Wolf, FPGA-Based System Design:

(programming) A command that checks whether there will be a carry (bit or digit that is carried in an addition operation) for the current digit in an ongoing addition operation.


modified Harvard architecture

modified Harvard architecture (countable and uncountable, plural modified Harvard architectures)

computer architecture
computer architecture

(computing) A variation of the Harvard computer architecture, allowing the contents of the instruction memory to be accessed as data.


Baeza-Yates-Gonnet algorithm

the Baeza-Yates-Gonnet algorithm (canonical)

Named after Ricardo Baeza-Yates and Gaston Gonnet.

(computing theory) Synonym of Bitap algorithm


Bitap algorithm

Levenshtein distance
Levenshtein distance

(computing theory) An algorithm that determines whether a given text contains a substring that is "approximately equal" to a given pattern, defined in terms of Levenshtein distance, and working by means of bitmasks.


Rényi entropy

Rényi entropy (countable and uncountable, plural Rényi entropies)

Named after Alfréd Rényi (1921–1970), Hungarian mathematician.

(information theory) A quantity that generalizes various notions of entropy, including Hartley entropy, Shannon entropy, collision entropy, and min-entropy.


Canny edge detector

Canny edge detector (plural Canny edge detectors)

calculus of variations
calculus of variations

(computer graphics) An operator that uses a multistage algorithm, involving the calculus of variations, to detect the edges in an image.


Canny edge detection

(computer graphics) The use of the Canny edge detector algorithm.


min-entropy

min-entropy (countable and uncountable, plural min-entropies)

(information theory) The smallest of the Rényi family of entropies, corresponding to the most conservative way of measuring the unpredictability of a set of outcomes, as the negative logarithm of the probability of the most likely outcome.


usernamed

A few weeks ago a reader usernamed Sparling made his entrance into the newsgroup with a post: Duncan could kick Conner's a**!!!. He made some people laugh, some people angry and certainly got noticed. Since then he's settled down quite a bit.

1996 June 5, Jeri Jo Thomas, “Methos could easily kick Sparling's”, in alt.tv.highlander (Usenet):

To make use of the home directory shares, your Windows usernames and passwords must match up with their counterparts on the Linux server. For instance, to use the root user share, you must have a root user with the same password on your Windows computer. (If you create a usernamed root on your Windows computer, it will have no special privileges.)

1999, Paul G. Sery, Eric Harper, Red Hat® Linux® 6 in Small Business, Foster City, CA: M&T Books, →ISBN, page 187:

(computing) Having a (specified) username.


Zeddy

From zed + -y, from the pronunciation of the first letter of the name.

This was never released by Software Project and with it being developed late in the machine's commercial life, not many Zeddy users knew about it, but it was uncovered thanks to the powers of the Internet.

2021, Darren Randle, Popular Retro (volume 2, issue 1, page 8)

(computing, slang) The Sinclair ZX81, an early British home computer.


soft real-time

(computing) Being or relating to a system that is ideally real-time but in practice can tolerate some latency that only reduces the quality of service.


copy-paster

Yes, so why bother? Making things difficult for copy-pasters is just lame. If I want your image I will get it regardless of what crappy code you write.

2003 October 8, ...JAG, “Re: Website question”, in rec.juggling (Usenet):

Eich’s purpose in creating JavaScript was to give Web developers— not known for their technical prowess — an easy way to add bits of interactivity to pages. The idea was to copy scripts from other pages and tweak them a bit. In this respect he succeeded admirably: many JavaScript developers (including myself) started out as copy-pasters.

2007, Peter-Paul Koch, ppk on JavaScript, Berkeley, CA: New Riders, →ISBN, page 17:


alloc

en-verb

alloc (third-person singular simple present alloc's, present participle alloc'ing, simple past and past participle alloc'ed)

alloc's (present singular third-person)
alloc'ing (participle present)
alloc'ed (participle past)
alloc'ed (past)

If you simply use alloc then init, you can't check for the existence of the object before it gets alloc'ed. If you use a single +new method (or something similar), then you can check for the existence of the object before it gets allocated in memory.

1994 June 12, Eric M Hermanson, “Re: +new vs. +alloc -init”, in comp.sys.next.programmer (Usenet):

Alloc enough space for any possible padding.

2001, John Viega, Gary R. McGraw, Building Secure Software:

Among the things this analyzer is capable of detecting is simple memory leaks. For example, it can find an object you alloc'ed but forgot to release.

2011, Stephen G. Kochan, Programming in Objective-C, page 413:

Could not alloc enough memory

2012, Helmut J. Helpenstein, CAD Geometry Data Exchange Using STEP, page 86:

Generally, the data ins the stack should not be changed, a simple packing would choose to push such information into the stack (to alloc a new space on the stack).


MLIR

MLIR enables optimizations across various levels of abstractions from high-level optimizations with better control-flow representation to low-level compilers and executors that generate target machine code.

2022, Andres Rodriguez, Deep Learning Systems: Algorithms, Compilers, and Processors for Large-Scale Production, Springer Nature, →ISBN, page 195:

intermediate representation
w:intermediate representation

(software compilation) Initialism of multilevel intermediate representation.

information retrieval
information retrieval#English

(information science) Initialism of multilingual information retrieval.


VFS

virtual file system
w:virtual file system

(computing) Initialism of virtual file system.


GLR

(software compilation) Initialism of generalized LR.


DLQ

(computing) Initialism of dead letter queue.


SoA

Coordinate term: AoS

(programming) Initialism of structure of arrays.


Objective-C

In Objective-C, a protocol member can be declared optional, meaning that this member doesn't have to be implemented by the adopter, but it may be.

2016, Matt Neuburg, iOS 10 Programming Fundamentals with Swift: Swift, Xcode, and Cocoa Basics, O'Reilly, →ISBN, page 185:

(computer languages) An object-oriented programming language that adds Smalltalk-style message passing to the C programming language, mainly used on Apple platforms.


millipawn

(computer chess, rare) One thousandth of the value of a pawn, especially for calculation purposes in computer chess.


BPE

en-noun

BPE (countable and uncountable, plural BPEs)

(computing) Initialism of byte pair encoding.


junk email

junk email (countable and uncountable, plural junk emails)

(computing) Junk mail taking the form of email.


trace scheduling

(programming) An optimization technique for compilers that rearranges traces (instruction sequences) according to their frequency of execution, and inserts additional code to compensate for any effects of the rearrangement.


Dantzig-Wolfe decomposition

Dantzig-Wolfe decomposition (countable and uncountable, plural Dantzig-Wolfe decompositions)

Originally developed by George Dantzig and Philip Wolfe, who published in 1960.

(computing theory) An algorithm for solving linear programming problems with special structure, relying on delayed column generation for improving the tractability of large-scale linear programs.


2-3 tree

(computing theory) A tree data structure whose every node with children (internal node) has either two children and one data element, or three children and two data elements; a B-tree of order 3.


2-3-4 tree

(computing theory) A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes.


B+ tree

(computing theory) An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves.


order statistic tree

order statistic tree (plural order statistic trees)

(computing theory) A variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree).


R-tree

(computing theory) A kind of tree data structure used to group objects by nearness of location, representing them by their minimum bounding rectangles in the next higher level of the tree.


X-tree

(computing theory) A data structure based on the R-tree, used for storing data in many dimensions.


backprime

From back + prime (“the ⟨′⟩ symbol”), compare backslash.

The echo and sed commands appear within backprimes (`) that indicate command substitution: The result of executing the commands within the backprimes replaces the backprimes and everything between them.

1997, Mark G. Sobell, “The TC Shell”, in A Practical Guide to Linux, Reading, MA: Addison-Wesley, →ISBN, page 440:

Since deformation manifests itself as a change in the metric characteristics of continuum, in the theory of finite deformations, it is then necessary to compare the referential ‵g_(ασ) and the convective g_(ασ) metrics. We systematically employ Latin indices in order to refer to spatial components of geometrical objects, whereas Greek indices to point on convective components (only a few instances can be found in the present study) or referential components (additionally, root symbol is sometimes supplied by backprime).

2023, Yuri N. Radayev, “Two-Point Rotations in Geometry of Finite Deformations”, in Holm Altenbach, Suren Manuk Mkhitaryan, Vahram Hakobyan, Avetik Varazdat Sahakyan, editors, Solid Mechanics, Theory of Elasticity and Creep (Advanced Structured Materials), Cham: Springer, →ISBN, page 276:

(typography, computing) The ⟨‵⟩ or ⟨`⟩ symbol; a reversed prime.


IPW

IPW (countable and uncountable, plural IPWs)

(computing, uncountable) Initialism of incremental packet writing.


GOL

Alternative form: GoL

Any info about optimal GOL-algorithms are also welcome. The algorithm I figured is quite fast, but certainly not optimal.. I am using 320x198 (=63360) array of cells, and with my machine I am getting about 7.7 generations per second, but with some assembly optimizing I could be even faster.

1993 September 7, Teemu Lahteenmaki, “Game of Life patterns wanted”, in comp.theory.cell-automata (Usenet):

Can someone please tell me if/where there is a central repository or web site to which GoL pattern files may be posted? I have been doing some modest engineering/artwork in GoL that I wud like 2 share with others.

2003 September 22, Otis Schmakel, “File Posting Place(s)”, in comp.theory.cell-automata (Usenet):

Let's count a number of rules that can be built in GoL-like automatas.

2021 October 19, Stefan W., “Game of Life with real 8 neighbors”, in comp.theory.cell-automata (Usenet):

(cellular automata) Initialism of Game of Life.


GoL

Alternative form: GOL


back pointer

(programming) A pointer that reciprocates another structure's pointer to its own containing structure, typically found in doubly linked lists and trees.


puffer train

The commonest use of sparks from these spaceships is to perturb an "engine" to produce puffer trains, or to modify stationary objects when the spaceships pass by.

1992 August 13, David Bell, “Spaceships in Conway's Life (Part 1)”, in comp.theory.cell-automata (Usenet):

The second has speed c/2, period 2. This one also works in B3/S035; the first is no longer a spaceship but a minimalist puffer train, leaving behind a trail of isolated cells!

1995 November 12, Rich Holmes, “Totalistic spaceships”, in comp.theory.cell-automata (Usenet):

I stuck the rule and seed into Golly, and after a few tens of thousands of generations, stuck another seed in such that the arms of gliders spewed by the two blobs would intersect, and without any more planning than that, it constructed a puffer train, that survived ten or twelve major pattern replications despite the sleet of gliders colliding with it, before it finally got clobbered hard enough to disrupt its progress.

2007 June 3, Kent Dolan, “A "new" Conway Life experience.”, in comp.theory.cell-automata (Usenet):


outer totalistic

Why it is important, to design totalistic or outer totalistic rules?

2003 January 18, Frank Buss, “Searching detailed description of Codd's automaton”, in comp.theory.cell-automata (Usenet):

It's the second-order reversible outer totalistic rule b1234/s0123R on the von Neumann neighborhood.

2003 December 13, Ilmari Karonen, “'TimeWarp' CA rule -- anyone recognize this one?”, in comp.theory.cell-automata (Usenet):

Hello, How to compute lambda value for (outer-)totalistic rule? Is it the same way like computing for elementary?

2007 August 28, Bob, “Lambda value of (outer-)totalistic code”, in comp.theory.cell-automata (Usenet):

(cellular automata) Having the state of each cell represented by a number, and the value of a cell dependent only on its current value along with the sum of the values of nearby cells.


Life-like cellular automaton

Life-like cellular automaton (plural Life-like cellular automata or Life-like cellular automatons)

Life-like cellular automata (plural)
Life-like cellular automatons (plural)

(cellular automata) A cellular automaton resembling Conway's Game of Life in terms of its ruleset (i.e. 2D, binary, outer totalistic, and using the Moore neighborhood).


von Neumann neighborhood

von Neumann neighborhood (plural von Neumann neighborhoods)

Named after John von Neumann, Hungarian mathematician.

(cellular automata) A neighborhood on a 2D square lattice consisting of a cell and its four orthogonal neighbors.

John von Neumann
von Neumann neighborhood


Moore neighborhood

Moore neighborhood (plural Moore neighborhoods)

For Edward F. Moore, American cellular automatist

(cellular automata) A neighborhood on a 2D square lattice consisting of a cell and its eight orthogonal and diagonal neighbors.


Life without Death

Named for the fact that the birth rules are identical to those of the Game of Life, but the survival rules are such that it is impossible for living cells to die.

Life-like cellular automaton
Life-like cellular automaton

(cellular automata) A Life-like cellular automaton with the rule B3/S012345678.


Highlife

(cellular automata) A Life-like cellular automaton with the rule B36/S23.


Day and Night

Named for the fact that the rule is its own complement; toggling all cell states results in the pattern evolving similarly, but with living and dead cells switched.

(cellular automata) A Life-like cellular automaton with the rule B3678/S34678.


Horspool's algorithm

Boyer-Moore-Horspool algorithm
Boyer-Moore-Horspool algorithm#English

(computing theory) Synonym of Boyer-Moore-Horspool algorithm


Boyer-Moore-Horspool algorithm

the Boyer-Moore-Horspool algorithm (canonical)

It was published by Nigel Horspool in 1980, and based on an earlier (1977) algorithm developed by Robert S. Boyer and J. Strother Moore.

(computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text.


Simula

(computer languages) A programming language of the ALGOL family that pioneered many object-oriented concepts such as classes and objects.


tab index

tab index (plural tab indexes or tab indices)

tab indexes (plural)
tab indices (plural)

graphical user interface
graphical user interface

(graphical user interface) A number assigned to a control on the display, designating its position in the sequence of controls that the user can move through by pressing the Tab key.


call-with-current-continuation

call-with-current-continuation (countable and uncountable, plural call-with-current-continuations or calls-with-current-continuation)

call-with-current-continuations (plural)
calls-with-current-continuation (plural)

(programming) In Scheme, a procedure that captures the current continuation to pass it as an argument to another continuation.


FPDP

Front Panel Data Port
w:Front Panel Data Port

(computer hardware) Initialism of Front Panel Data Port.


insn

(computing) Abbreviation of instruction.


homeserver

The disruption has caused hours of ongoing downtime, in which Matrix.org said the organization had run into issues "rebuilding production from scratch." Websites, databases, synapse, LBs, and media repositories were all impacted. Modular.im homeservers, however, are unscathed.

2019 April 12, Charlie Osborne, “Matrix.org hack forces servers offline, encrypted chat history lost”, in ZDNET, archived from the original on 2023-03-31:

That figure is therefore the total number of addressable users visible to the matrix.org homeserver, but doesn't include servers or users not viewable on the public network or those that don't report usage stats.

2022 July 15, Richard Speed, “60 million in the Matrix as users seek decentralized messaging”, in The Register, archived from the original on 2023-06-03:

The first two attacks provide a simple confidentiality break by exploiting the homeserver's control over the users and devices that are permitted to join a private room.

2022 September 28, Dan Goodin, “Serious vulnerabilities in Matrix's end-to-end encryption have been patched”, in Ars Technica, archived from the original on 2023-05-27:

(computing) A server that facilitates communication using the Matrix protocol.


unbuffer

en-verb

unbuffer (third-person singular simple present unbuffers, present participle unbuffering, simple past and past participle unbuffered)

unbuffers (present singular third-person)
unbuffering (participle present)
unbuffered (participle past)
unbuffered (past)

2003, Stas Bekman, Eric Cholet, Practical mod_perl
We set $|=1 to unbuffer the STDERR stream, so we can immediately see the debug output generated by the program.

(computing, transitive) To release or flush from a buffer.


Solomonoff induction

posterior probability
posterior probability

(computing theory) A form of induction, involving Bayes' theorem, that derives the posterior probability of any computable theory, given a sequence of observed data.


decloud

decloud (third-person singular simple present declouds, present participle declouding, simple past and past participle declouded)

declouds (present singular third-person)
declouding (participle present)
declouded (participle past)
declouded (past)

(computing) To transfer data off of the cloud and onto local storage.


glass teletype

(computing, slang, dated) A rudimentary videoterminal.


SSPL

Server Side Public License
w:Server Side Public License

(computing, copyright law) Initialism of Server Side Public License.


tri-pane

Windows Live Mail uses a tri-pane window layout.

2011, Kevin Otnes, Windows 7 Made Simple, page 304:

(graphical user interface) Consisting of three panes.


SNARG

2018, Dan Boneh, Yuval Ishai, Amit Sahai, David J. Wu, Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs, Jesper Buus Nielsen, Vincent Rijmen (editors), Advances in Cryptology – EUROCRYPT 2018: 37th Annual International Conference on Cryptographic Techniques, Proceedings, Part III, Springer, LNCS 10822, page 224,
A SNARG is publicly verifiable if anyone can verify the proofs, and it is designated-verifier if only the holder of a secret verification state (generated along with the CRS) can verify proofs.

However, SNARGs and SNARKs (blockchain implementations of SNARGs) rely on pre-quantum assumptions and are not post-quantum secure. Hence, lattice-based SNARGs are proposed (Boneh et al., 2017).

2020, Melanie Swan, Renato P Dos Santos, Frank Witte, Quantum Computing, World Scientific, page 172:

2021, Yael Taumann Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang, Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs, Kobbi Nissim, Brent Waters (editors), Theory of Cryptography: 19th International Conference, TCC 2021, Proceedings, Part I, Springer, LNCS 13042, page 355,
In this section, we construct SNARGs for languages with a (computational) non-signaling mathsf PCP, assuming the existence of a SNARG for mathsf BatchNP.

(computing, cryptography) Acronym of succinct non-interactive argument.


SNARK

2019, Anca Nitulescu, Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits, Peter Schwabe, Nicolas Thériault (editors), Progress in Cryptology – LATINCRYPT 2019: 6th International Conference, Proceedings, Springer, LNCS 11774, page 223,
SNARG vs. SNARK. If we replace the computational soundness with computational Knowledge Soundness we obtain what we call a SNARK, a succinct non-interactive argument of knowledge.

2020, Fuyuki Kitagawa, Takahiro Matsuda, Takashi Yamakawa, NIZK from SNARG, Rafael Pass, Krzysztof Pietrzak (editors), Theory of Cryptography: 18th International Conference, Proceedings, Part I, Springer, LNCS 12550, page 568,
Actually, what is often used in blockchains is a SNARK [4], which is a stronger variant of a SNARG that satisfies extractability.

2023, Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim, Impossibilities in Succinct Arguments: Black-Box Extraction and More, Nadia El Mrabet, Luca De Feo, Sylvain Duquesne (editors), Progress in Cryptology - AFRICACRYPT 2023: 14th International Conference, Proceedings, Springer, LNCS 14064, page 467,
Whether we can build SNARKs with black-box extraction in the standard model is an elusive problem. […] In particular, we show that a SNARG can be lifted to a SNARK with the features above for the class of languages FewP (roughly, NP with polynomial many witnesses).

succinct non-interactive argument of knowledge#English

(computing, cryptography) Acronym of succinct non-interactive argument of knowledge.


status strip

(graphical user interface) Synonym of status bar


step and repeat

(often attributive, design, computer graphics) A kind of design, typically for banners or backdrops, consisting of logos or images at fixed offsets.


KIPS

Coordinate term: MIPS

(computing) Abbreviation of thousand instructions per second.


multiwrite

LL-Q1860 (eng)-Flame, not lame-multiwrite.wav

(computing) Involving more than one write operation.


orthodox file manager

en-noun

orthodox file manager (plural orthodox file managers)

(computing) A file manager program with a traditional textbased user interface.


cache stampede

(computing) A cascading failure that may occur when massively parallel systems with caching mechanisms come under very high load, leading to multiple threads of execution attempting to perform the same operation simultaneously.


registration wall

registration wall (plural registration walls)

This can be a good way to generate leads, but keep in mind that putting up a registration wall will likely reduce the amount of SEO traffic you can drive to that guide.

Dr. Rakesh D, Dr. Manoj Kumara N V, Dr. Darshan S, Marketing Management (page 164)

(computing) A feature of a website, application or service that only allows access to certain content or functions to users who have registered by creating an account.


bifid cipher

Coordinate term: trifid cipher

(cryptography) A classical cipher that combines the Polybius square with transposition, and uses fractionation to achieve diffusion.


trifid cipher

Coordinate term: bifid cipher

(cryptography) A classical cipher that extends the earlier bifid cipher with the use of trigrams.


button bar

(graphical user interface) Synonym of toolbar


IMGUI

graphical user interface
graphical user interface#English

(computing) Initialism of immediate mode graphical user interface.


enbugging

From en- + bug + -ing, coined as an opposite to debugging.

(programming, humorous, rare) The introduction of bugs into a program.


prepender

Coordinate term: appender

(computing) A software component that prepends data to a computer file.


pajeetware

From pajeet (“a contemptuous term for an Indian person”) + -ware.

suf

I still use process lasso. Windows scheduler pajeetware shenanigans, no thanks!

2019 September 13, u/CuddlyKitty1488, “Did Project Lasso become completely obsolete with latest Windows 1903 scheduler revision and Ryzen 3000?”, in Reddit, r/Amd, archived from the original on 2023-09-28:

Twitter is peak pajeetware, it's so slow...

2023 May 26, @AVerySaneMan, Twitter, archived from the original on 2023-09-28:

Please post the code (lainchan), i want to see Microsoft pajeetware and make fun of it

2023 May 28, @felIowNwords, Twitter, archived from the original on 2023-09-28:

(4chan, computing, derogatory, sometimes humorous) Poor-quality software created in India.


quettabyte

(computing) One nonillion (10³⁰) bytes. SI symbol: QB.


template metaprogramming

(programming) A form of metaprogramming in which templates are used by a compiler to generate temporary source code, which is then merged with the rest of the source code and recompiled.


ronnabit

(computing) One octillion (10²⁷) bits. SI symbol: Rb.


quettabit

Given the scales on which technology has operated in the first quarter of the 21st century, from lasers that flash for just a few attoseconds to the total amount of digital data in the world pushing past 160 zettabytes, it feels as if we may have let things lie for too long. I don't know if the future will have quettabit computer networks or rontometer-scale wormholes, but I'm pretty sure the large and small of it will be hella weird.

2023 January 10, Adam Rogers, “Move over, megatons”, in Business Insider:

(computing) One nonillion (10³⁰) bits. SI symbol: Qb.


service worker

(Internet, programming) A scriptable network proxy in a web browser that manages network requests for a web page.


megacharacter

The eighth column presents the capacity of one entire storage unit, in megabytes (or megacharacters); sometimes the unit is the same as the module, as in the case of the IBM 2311 disk pack, and sometimes it is an aggregate of modules, as in the case of the IBM 2314, or the RCA mass storage.

1969, David Lefkowitz, File Structures for Online Systems, New York, N.Y., Washington, D.C., page 203:

400 megabytes, probably has 200 to 300 megacharacters. At .003 megacharacters per page ( 3000 characters per page) this is 66,000 to 100,000 pages to print out before the end of the year, or 133 to 200 reams of paper to print by the end of the year.

1999 January 22, Material Fellow, “The Y2k Survival CD!”, in oc.forsale (Usenet):

There's raw speed and then there's raw speed. Do you want to display, say, a megacharacter/second?

2005 June 8, Andrew Dalke, “Fast text display?”, in comp.lang.python (Usenet):

(computing, rare) One million characters.


pathfind

en-verb

pathfind (third-person singular simple present pathfinds, present participle pathfinding, simple past and past participle pathfound)

pathfinds (present singular third-person)
pathfinding (participle present)
pathfound (participle past)
pathfound (past)

Back-formation from pathfinding, equivalent to path + find.

If the warden has a targetable entity, is not investigating any disturbances, and is otherwise idle, it pathfinds toward the closest entity, prioritizing players over mobs.

2023 October 20 (last accessed), “Warden”, in Minecraft Wiki:

Has a sense of smell. It can detect and pathfind toward the general location of a player or mob through a "smelling" action.

2024 December 11 (last accessed), “Java Edition Deep Dark Experimental Snapshot 1”, in Minecraft Wiki:

If a villager cannot pathfind to its claimed site, both the site block and villager emit anger particles.

2024 December 11 (last accessed), “Villager”, in Minecraft Wiki:

(computing, intransitive) To find the best route between two points.


multiversioned

(computing) Having or involving more than one version.


multiversioning

(computing) The presence of, or support for, more than one version.


morpher

(computer graphics) A program or algorithm that carries out morphing animations.


HHD

en-noun

HHD (countable and uncountable, plural HHDs)

hybrid hard drive
hybrid hard drive#English

(computing) Initialism of hybrid hard drive.


writebehind

writebehind (countable and uncountable, plural writebehinds)

(computing) The operation of initially writing data to a cache and later copying it to permanent storage.


HEIF

The HEIF format is not yet the de facto image file at the time of writing. Apple, Inc. adopted HEIF for image media storage on iOS in 2017.

2019, Nanette L. Salvaggio, Josh Shagam, Basic Photographic Materials and Processes, Routledge, →ISBN, page 173:

High Efficiency Image File
w:High Efficiency Image File Format

(computer graphics, file format) Initialism of High Efficiency Image File, a container format for storing individual images and image sequences.


HEIF

(computer graphics) An image file in the HEIF format.


nano-COM

(programming) The use of a very small subset of the Component Object Model, focused exclusively on the Application Binary Interface (ABI) aspects that enable function and method calls across independently compiled modules.


ABNF

Backus-Naur form
Backus-Naur form#English

(computing) Initialism of augmented Backus-Naur form.


netname

A UNC (universal naming convention) name consists of a server name and a netname, which together identify a resource in the domain.

1994, Barry Nance, Client/server LAN Programming, page 43:

If a sharepoint is accessed by using the UNC \\server1\WordFiles, for example, the netname is WordFiles.

2002, Dave Roth, Win32 Perl Programming: The Standard Extensions, page 58:

(computing, Microsoft Windows) The part of a UNC (Uniform Naming Convention) path that identifies a particular resource on a given server.


sizecode

(demoscene) Program code written as a competitive exercise in achieving impressive results in the smallest possible space.


DBSCAN

(programming) Initialism of density-based spatial clustering of applications with noise, a data clustering algorithm.


canned benchmark

canned benchmark (plural canned benchmarks)

(computing, video games) A computer program designed for the sole purpose of benchmarking the hardware it's being run on.


CCaaS

(computing) Acronym of Contact Center as a Service.


elementary cellular automaton

elementary cellular automaton (plural elementary cellular automata or elementary cellular automatons)

elementary cellular automata (plural)
elementary cellular automatons (plural)

(cellular automata) A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours.


block cellular automaton

block cellular automaton (plural block cellular automata or block cellular automatons)

block cellular automata (plural)
block cellular automatons (plural)

(cellular automata) A cellular automaton in which the grid is divided into distinct blocks in a uniform pattern, with the blocks being shifted by a certain number of cells in each generation, and each block serving as the neighborhood for all cells contained within it.


partitioning cellular automaton

partitioning cellular automaton (plural partitioning cellular automata or partitioning cellular automatons)

partitioning cellular automata (plural)
partitioning cellular automatons (plural)

block cellular automaton
block cellular automaton

(cellular automata) A block cellular automaton.


Margolus neighborhood

Margolus neighborhood (plural Margolus neighborhoods)

For Norman Margolus, Canadian-American cellular automatist

In addition to Moore, Von Neuman and Margolus neighborhoods, the spatial, temporal (phase) and user connector extensions of CAM-PC provide for a large number of different neighborhoods. In this sense, a simple neighborhood is actually a selection of up to 16 of the 50 to 100 signals (depending on what you count) that are available.

1992 March 16, CAM-PC Support Staff, “CAM, CAM-6, CAM\PC boards.”, in comp.theory.cell-automata (Usenet):

Another thing which seems to work very well is embodied in the Margolus neighborhood, for which different rules are operative at different points in the lattice, and even at different times.

1992 March 30, Harold V. McIntosh, “1) What kind of tilings? 2) CAM family.”, in comp.theory.cell-automata (Usenet):

For any one interested in CA's in general or in simulations that require the conservatin laws of the Margolus neighborhood in particular I've managed to devise a method for duplicating all the properties of the Margolus neighborhood without the paritioning and without the block rules.

2003 March 15, fiziwig, “New formulation of the Margolus neighborhood”, in comp.theory.cell-automata (Usenet):

(cellular automata) A block cellular automaton neighborhood consisting of a two-by-two square of cells which shifts one cell diagonally each generation.


turmite

Blend of Turing + termite. Coined by Canadian mathematics writer A. K. Dewdney in 1989.

coinage

(computing theory) A two-dimensional variant of a Turing machine in which the head has an orientation in addition to a position and state.


lightweight spaceship

en-noun

lightweight spaceship (plural lightweight spaceships)

To begin with and to be complete, I will list the original spaceships. These are the glider, the lightweight spaceship (LWSS), middleweight spaceship (MWSS), and the heavyweight spaceship (HWSS). These were all found very soon after Life was invented by Conway.

1992 August 13, David Bell, “Spaceships in Conway's Life (Part 1)”, in comp.theory.cell-automata (Usenet):

It's a reaction between a glider and a lightweight spaceship spark, nondestructive to the spaceship (so it can be used in puffers):

1994 May 14, Paul Callahan, “Louis Howell's question of block clearing in life (simple solution)”, in comp.theory.cell-automata (Usenet):

The usual non-glider suspects from Conway's Life (lightweight, middleweight, and heavyweight spaceships) all fail here due to central 7-neighbor OFF cells.

2008 May 31, Dave Greene, “Life: B37/S23 - A Chaotic Universe.”, in comp.theory.cell-automata (Usenet):

(cellular automata) A particular orthogonal spaceship in Conway's Game of Life, and the smallest such example.


LWSS

For example, two gliders can produce another glider, and three gliders can produce a LWSS or MWSS or a HWSS.

the simple "gliders" work perfectly fine, but the LWSS spaceship works great until the 15th generation when a singular pixel gets misplaced and the entire structure collapses.

1992 August 23, Albert Schnezer, “Programming Life in Tpascal”, in comp.theory.cell-automata (Usenet):

It begins with the period-20 spaceship that consists of a p20 puffer stabilized by a third lwss; this is the basis for the standard p20 forward and backward rakes.

1994 December 7, Paul Callahan, “Program to search for collisions in Conway's Life (C code)”, in comp.theory.cell-automata (Usenet):

lightweight spaceship
lightweight spaceship#English

(cellular automata) Initialism of lightweight spaceship.


middleweight spaceship

middleweight spaceship (plural middleweight spaceships)

The trailing middleweight spaceships convert the spark into a pair of pi-heptominos, which start the line of blinkers burning again, while leaving behind a pair of blocks.

1996 December 16, Dean Hickerson, “What is his name ?”, in comp.theory.cell-automata (Usenet):

(cellular automata) A particular orthogonal spaceship in Conway's Game of Life, and the second smallest such example.


R-pentomino

I came up with an implementation of an algorithm on my Sparcstation 1 that does all 1103 generations of the R-pentomino, including the gliders, in 1.3 seconds (no display), and runs o.....o. ..o...o. ..o..o.o .o.o.... (a pattern by Wainright recommended to me by Gosper) out to 10,000 generations in 45 seconds (again, without display).

1990 January 15, Paul Dietz, “Gosper's Algorithm for Life”, in comp.theory.cell-automata (Usenet):

I've finisher debugging the code, and it works -- that is to say, its final configuration for the R-pentomino is the same as the one in my books. (It's my guess that the R-p will find any bug in any life program, no matter how obscure.)

1990 June 8, Robert Herrell, “Life without bounds”, in comp.theory.cell-automata (Usenet):

This explosive collision is "perturbed" by the permanent parts of the reflector so that at generation 242, the destroyed block is restored, a glider is released in the reverse direction, an r-pentomino is produced some distance from the stage, and a beehive is left in an awkward position close to the block.

1996 November 19, Paul Callahan, “Glider reflector in Life”, in comp.theory.cell-automata (Usenet):

(geometry) A particular five-square polyomino.

(cellular automata) The methuselah based on this polyomino that, in Conway's Game of Life, has a lifespan of 1,103 generations.


B-heptomino

Perturbations of its reaction also reproduce it in different generations. This might be tamed someday to form glider guns or puffers, as the B-heptomino in Life has been.

1994 May 7, David Bell, “HighLife - An Interesting Variant of Life (part 3/3)”, in comp.theory.cell-automata (Usenet):

Actually, the period 30 "queen bee" shuttle seems irreparable, as it contains several instances of the Ship neighborhood duriod its cycle. It's the period 46 b-heptomino shuttle that can be stabilized with clocks.

1994 May 11, Paul Callahan, “HighLife - An Interesting Variant of Life (part 3/3)”, in comp.theory.cell-automata (Usenet):

In B37/S23, it goes symmetrical after 10 ticks, and produces a familiar pair of B-heptominoes after 23 ticks (the next generation after this can be found in the rotor of a standard B3/S23 p46 oscillator):

2008 June 25, Dave Greene, “Life: B37/S23 - A Chaotic Universe.”, in comp.theory.cell-automata (Usenet):

(cellular automata) A particular seven-cell methuselah in Conway's Game of Life.


pi-heptomino

A growing spaceship which uses the pi-heptomino.

1993 March 16, David Bell, “Life program (part 14/18)”, in comp.theory.cell-automata (Usenet):

It does include a pseudo-spaceship based on the Pi-heptomino (pseudo because it needs some classic spaceships in front, and so the middle gets longer and longer.

1995 March 30, John Harper, “Life - has anybody found....”, in comp.theory.cell-automata (Usenet):

1) gliders on paths *adjacent* to the six annihilating paths produce a pi-heptomino and consequent large explosion -- and there's no way to place blocks on nearby lanes to catch those gliders, because they'd interact messily with gliders on some of the original six glider paths;

2005 February 23, Dave Greene, “exist glider gun able of reconstruction in Life?”, in comp.theory.cell-automata (Usenet):

(cellular automata) A particular symmetric seven-cell methuselah in Conway's Game of Life.


dead click

(graphical user interface) A click on an element of a user interface which does not lead to any action.


pattern word

(cryptography) A word in which some letter appears more than once, useful in solving a cryptogram.


expansion card

(computing) A circuit board that connects to the motherboard of a computer in order to allow additional capabilities.


SCMP

software engineering
software engineering

w:software configuration management plan

(software engineering) Initialism of software configuration management plan.


autogrowth

(computing) Automatic growth (of a storage quota).


EUPL

European Union Public License
w:European Union Public License

(computing, copyright law) Initialism of European Union Public License.


(graphical user interface) An icon which directs the user to the top of a webpage or application (sometimes represented by just an arrow).


LZMA

Based on the LZ77 and LZ78 algorithms devised by Abraham Lempel and Jacob Ziv.

LZMA is the main (as well as the default) algorithm used in the popular 7z (or 7-Zip) compression software [7z 06]. Both 7z and LZMA are the creations of Igor Pavlov.

2007, David Salomon, Data Compression: The Complete Reference, Springer Science & Business Media, →ISBN, page 241:

Lempel–Ziv–Markov chain algorithm
w:Lempel–Ziv–Markov chain algorithm

(computing) Initialism of Lempel–Ziv–Markov chain algorithm.


LZSS

(computing) Initialism of Lempel–Ziv–Storer–Szymanski.


LZS

(computing) Initialism of Lempel–Ziv–Stac.


gateware

(computing) Logic implemented in configurable digital logic gates.


resume-driven development

Modeled after test-driven development and similar terminology.

(software engineering, humorous) Software development that uses trendy technologies and tools which are not optimal for the task at hand, motivated by the developers' desire to enhance their resumes.


doorslam

(web design) A pop-up or other obstruction preventing a user from viewing content, typically after reaching a scrolling threshold.


pigpen cipher

(cryptography) A geometric simple substitution cipher, which exchanges letters for symbols which are fragments of a grid.


LFS

LFS (countable and uncountable, plural LFSs)

(computing) Initialism of local file system.

(computing, Git) Initialism of large file storage.


LFS

(computing) Initialism of Linux From Scratch.


silicon lottery

silicon lottery (plural silicon lotteries)

(computing, computer hardware) The process of binning microprocessors based on their overclocking potential.


emoji ZWJ sequence

emoji ZWJ sequence (plural emoji ZWJ sequences)

When an emoji zwj^([sic]) sequence is sent to a system that does not have a corresponding single glyph, the ZWJ characters would be ignored and a fallback sequence of separate emoji would be displayed.

2016 November 14, Rob Reed, “Everything You Need To Know About Emoji”, in Smashing Magazine:

(computing) A combination of emoji and control characters to display a particular emoji on supported operating systems.


emoji sequence

These characters are used in emoji sequences but normally do not appear on emoji keyboards as separate choices, such as keycap base characters or Regional_Indicator characters.

2023 September 5, Mark Davis, Ned Holbrook, Unicode Emoji (Unicode Technical Standard), 25 edition, number 51, Unicode Consortium, Emoji Characters:

(computing) A combination of characters that display a particular emoji.


mspf

(computer graphics) Milliseconds per frame (a measure of time used to render a frame on average)


AVD

Azure Virtual Desktop
w:Azure Virtual Desktop

(computing) Initialism of Azure Virtual Desktop.


xBase

Chosen to avoid lawsuits over the unauthorized use of the proprietary name dBASE. See x (“an unknown variable or placeholder”).

programming language
programming language

(programming) Any programming language that derives from, or is a clone of, the dBASE system.


(computing) A single-byte character encoding of the Latin alphabet that was used by default in Microsoft Windows for English and many Romance and Germanic languages.


nstd

(logistics, furniture, computing) Abbreviation of nested.


xvalue

(programming) A value representing an object near the end of its lifetime whose resources can be reused, typically by moving them.


zombie computer

zombie computer (plural zombie computers)

zombie + computer. First use appears c. 1999. See cite below.

The danger is manifested in this version because the hackers are gaining control of as many as thousands of vulnerable zombie computers in order to magnify and direct their full-scale assault against a single victim from all directions.

1999, Brian Fonseca, “"Denial-of-service attacks employ zombie PCs to hit networks"”, in Infoworld Daily News:

(computing, networking) A computer connected to the Internet that has been compromised by a hacker via a computer virus, computer worm, or Trojan horse program and can be used to perform malicious tasks under the remote direction of the hacker.


zombie network

(computing, networking) A network or collection of compromised computers or hosts that are connected to the Internet.


C10M problem

(networking) The problem of optimizing a network to handle a large number of connections (roughly one million) concurrently.


zombie software

(computing, software) A program or application which has been maintained beyond its expiration date or end-of-life status.


zombie program

(computing, software, uncommon) Any computer program that has been revived or reinstalled by an operating system and is very difficult to uninstall.


unsteckered

From un- + German Stecker (“plug”) + -ed.

(cryptography) unprocessed by a plugboard.


steckered

(cryptography) Processed by a plugboard.


z-test

(computer graphics) A comparison to determine which object should be at the front of the z-buffer.


locale-aware

(computing, programming) The automatic detection of a user's language and country settings, thereby supplying the corresponding content at the same URLs.


strictification

(mathematics, category theory) ??Replacement of coherent isomorphisms by equalities.


GFM

(computing) Initialism of GitHub-flavored markdown.


subicon

The life of a subicon is tied to that of the parent, in the sense that when the parent is moved or destroyed, the same happens to any subicons it contains. Nesting of subicons to several levels is permitted.

2012, Shi-Kuo Chang, Visual Languages, page 217:

graphical user interface
graphical user interface

(graphical user interface) A subordinate icon.


fixme

(programming, colloquial) A comment explaining that a section of code requires fixing in some way.


geop-

Unknown, possibly from Korean 겁 (geop), referring to a very long period of time.

(computing, informal, nonstandard) Synonym of quetta-


DPRAM

DPRAM (countable and uncountable, plural DPRAMs)

(computer hardware) Initialism of dual-ported RAM.


fencepost error

fencepost error (plural fencepost errors)

(programming) An off-by-one error arising from the fencepost problem.


Phong shading

(computer graphics) A technique for shading three-dimensional surfaces by interpolating surface normals across rasterized polygons and computing pixel colors based on the interpolated normals and a reflection model.


Phong interpolation

(computer graphics) Synonym of Phong shading


COLD

(computing) Acronym of computer output to laser disc.


EFK

(computing) Initialism of Elasticsearch, Fluentd, and Kibana.


SIFT

scale-invariant feature transform
w:scale-invariant feature transform

(computer graphics) Initialism of scale-invariant feature transform.


SURF

speeded up robust features
w:speeded up robust features

(computer graphics) Initialism of speeded up robust features.


SUSAN

(computer graphics) Acronym of Smallest Univalue Segment Assimilating Nucleus.


emoji flag sequence

emoji flag sequence (plural emoji flag sequences)

Different vendors such as Apple and Google will then be expected to support it alongside other flags (though notably, Microsoft has historically never supported any emoji flag sequences).

2022 April 4, Keith Broni, “Propose A New Emoji, But No More Flags”, in Emojipedia:

Unicode Technical Standard
w:Unicode Technical Standard

(computing) An emoji sequence consisting of two regional indicator characters that display a particular country or territory's national flag.


downgrade dance

downgrade dance (plural downgrade dances)

(computing) A form of attack in which the malicious client negotiates with the server so as to establish a connection using an older, vulnerable version of the protocol.


Allman style

Named after American computer programmer Eric Paul Allman (born 1955).

(programming) An indentation style for source code in which the brace associated with a control statement is placed on the following line, indented to the same level as the control statement. Statements within the braces are indented to the next level.


robibyte

(computing) Strictly, 2⁹⁰ (1024⁹, 1,237,940,039,285,380,274,899,124,224) bytes or 2¹⁰ (1024) yobibytes, as opposed to a ronnabyte.


quebibyte

(computing) Strictly, 2¹⁰⁰ (1024¹⁰, 1,267,650,600,228,229,401,496,703,205,376) bytes or 2¹⁰ (1024) robibytes, as opposed to a quettabyte.


Hilbert R-tree

(computing theory) A kind of R-tree used for multidimensional objects.


PR-tree

(computing theory) Short for priority R-tree.


R+ tree

(computing theory) A kind of R-tree used for geospatial data.


R* tree

(computing theory) A kind of R-tree used for indexing spatial information.


forward echo

forward echo (countable and uncountable, plural forward echoes)


rail fence cipher

rail fence cipher (plural rail fence ciphers)

(cryptography) A transposition cipher in which the plain text is written in a zigzag fashion diagonally up and down on successive "rails" of an imaginary fence, and then the characters are read off in rows to obtain the ciphertext.


BOW

Alternative form: BoW

However, despite these shortcomings, due to its simplicity and ease of implementation, BoW is a commonly used text representation scheme, especially for text classification among other NLP problems.

2020, Sowmya Vajjala, Bodhisattwa Majumder, Anuj Gupta, Harshit Surana, Practical Natural Language Processing […] , First edition, Beijing Boston Farnham Sebastopol Tokyo: O'Reilly, →ISBN:

computational linguistics
computational linguistics

(computational linguistics) Initialism of bag of words.


BoW

(computational linguistics) Alternative letter-case form of BOW


BoN

(computational linguistics) Alternative letter-case form of BON (“bag of n-grams”)


autovivification

(programming) The process of autovivifying.


autovivify

en-verb

autovivify (third-person singular simple present autovivifies, present participle autovivifying, simple past and past participle autovivified)

autovivifies (present singular third-person)
autovivifying (participle present)
autovivified (participle past)
autovivified (past)

(programming) In the Perl programming language, to create an array or hash automatically when a previously undefined value is dereferenced.


spaghetti sort

Introduced by A. K. Dewdney in a Scientific American column.

(computing theory) A linear-time algorithm for sorting a sequence of items, analogous to standing a number of strands of spaghetti of different lengths upright on a surface and noting the order in which they are encountered when lowering one's hand from above.


RGBA

(computer graphics) Initialism of red, green, blue, alpha.


data lakehouse

Blend of data lake + data warehouse. Coined by American company Databricks in 2020 in a corporate whitepaper.

coinage

In examples of data lakes or data lakehouse architectures, you will often see bronze/silver/gold or raw, curated, optimized layers, which serve as both reference points within the transformation process that happens to data and for data that might have been referred to as staging tables in older data warehouse terminology.

2023, Greg Beaumont, Power BI Machine Learning and OpenAI […] , Packt Publishing Ltd, →ISBN, page 27:

(databases) A hybrid architecture combining data lake and data warehouse principles.


superproperty

Coordinate term: subproperty

Just as a classes can be specialized with subclass relationships, properties can be specialized with subproperties. The “rdfs:subPropertyOf” property is used to specify a specialization relationship between properties. The described property is a subproperty of the indicated superproperty.

2005, Lee W. Lacy, Owl: Representing Information Using the Web Ontology Language, Victoria, BC: Trafford Publishing, →ISBN, page 120:

(computing) A higher-level property in a hierarchy of properties.


neubrutalism

Neubrutalism can be easily identified by a few particular traits. Immediately noticeable are the solid clashing colours; large bold text in quirky fonts immediately tells you where you are and what you can do there.

2022 July 26, Maria Teneva, “Neubrutalism style in UX: a twist on the dominant modern minimalist”, in Medium, archived from the original on 2023-11-03:

Background color: In Neubrutalism, we can use multiple colors (other than white and light gray on light mode and dark colors on the dark theme) for the background color! We can use very vibrant colors, and vintage and muted colors.

2023 February 12, Sepideh Yazdi, “How can I design in the Neo Brutalism style?”, in Medium:

Neubrutalism (a.k.a. neo-brutalism) takes recent website trends to the next level—it retains its edge while also combining the unusual style with more modern animation, illustration, and text standards.

2023 December 21, Hermione Wright, “What Is the Neubrutalism Web Design Trend?”, in Envato Elements, archived from the original on 2024-02-29:

(web design) A modern Web user interface style inspired by brutalism.


neobrutalism

(web design) Alternative form of neubrutalism


ELK

Of course, ELK doesn't come without operational burden.

2017, Evi Nemeth, Garth Snyder, Trent R. Hein, Ben Whaley, Dan Mackin, UNIX and Linux System Administration Handbook, Addison-Wesley Professional, →ISBN:

(computing) Acronym of Elasticsearch, Logstash, and Kibana.


EUEM

Measuring site health from the end user's point of view is the discipline of EUEM, which is the logical complement to web analytics.

2009, Alistair Croll, Sean Power, Complete Web Monitoring: Watching your visitors, performance, communities, and competitors, O'Reilly, →ISBN, page 56:

(computing) Initialism of end-user experience management.


UEM

(computing) Initialism of user experience management.


ADMM

w:alternating direction method of multipliers

(computer science) Initialism of alternating direction method of multipliers.


You may find observability documentation, tools, and courses by searching for o11y, which we pronounce “ollie.”

[2023, Jeremy Proffitt, Rod Anami, Becoming a Rockstar SRE: Electrify your site reliability engineering mindset to build reliable, resilient, and efficient systems, Packt Publishing Ltd, →ISBN, page 57:


RUM

RUM may involve sniffing the network connection, adding JavaScript to pages, installing agents on end user machines, or some combination thereof.

2009, Alistair Croll, Sean Power, Complete Web Monitoring: Watching your visitors, performance, communities, and competitors, O'Reilly, →ISBN, page 354:

real user monitoring
w:real user monitoring

(computing) Initialism of real user monitoring.


MELT

Another way to describe APM suites is that they are the monitoring technology that makes MELT data collection possible and useful for SREs.

2023, Jeremy Proffitt, Rod Anami, Becoming a Rockstar SRE: Electrify your site reliability engineering mindset to build reliable, resilient, and efficient systems, Packt Publishing Ltd, →ISBN, page 73:

(computing) Acronym of metrics, events, logs, and traces.


TSDB

time series database
w:time series database

(databases) Initialism of time series database.


WAM

en-noun

WAM (countable and uncountable, plural WAMs)

Warren Abstract Machine
w:Warren Abstract Machine

(computing theory) Initialism of Warren Abstract Machine.


Kleene plus

After Stephen Cole Kleene (1909-1994), American mathematician.

Coordinate term: Kleene star

(logic, computing theory) The plus symbol, +, used as an operator to concatenate one or more strings from a given set, widely used in regular expressions.


Nic.Dam.

Nic.Dam. = Nicolaus Damascenus

1940, Henry George Liddell, Robert Scott, Henry Stuart Jones, Roderick McKenzie, A Greek–English Lexicon, Oxford: at the Clarendon Press, frontmatter, §: V. General List of Abbreviations:

Nicolaus Damascenus
w:Nicolaus of Damascus

(bibliography and lexicography) Abbreviation of Nicolaus Damascenus.


Tarski-Kuratowski algorithm

the Tarski-Kuratowski algorithm (canonical)

Named after Alfred Tarski and Kazimierz Kuratowski.

arithmetical hierarchy
arithmetical hierarchy

analytical hierarchy
analytical hierarchy

(computing theory) A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.


Kleene's theorem

Named after mathematician Stephen Cole Kleene.

finite-state machine
finite-state machine

(computing theory) A theorem stating that regular expressions are equivalent to finite-state machines.


Kleene's recursion theorem

en-prop

Kleene's recursion theorem (plural Kleene's recursion theorems)

(computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions.


language server

en-noun

language server (plural language servers)

(programming) A server, implemented in software, that provides language-related services to client applications such as source code editors, based on the text being edited and the actions taken by the human editor.


OGNL

(computing) Initialism of Object-Graph Navigation Language.


business object

business object (plural business objects)

A business object (BO) is simply a software abstraction of a real-world entity.

2004, Chuck Cavaness, Programming Jakarta Struts, O'Reilly, →ISBN, page 139:

software engineering
software engineering

(software engineering) An entity, in a multitiered software application, that represents a particular entity within the business, such as a customer or an order.


multirepo

(computing) Of or relating to more than one source control repository.


NSAPI

(computing) Initialism of Netscape Server Application Programming Interface.


qHD

Abbreviation
* (1/4 HD): From being approximately 1/4 of high definition video resolution

(video, television, computer graphics) Initialism of quarter HD (“quarter high definition”). (960x540 pixels)


prepass

LL-Q1860 (eng)-Flame, not lame-prepass.wav

If you're trying to render an image of 800 × 600 pixels and you do the prepass with just 200 × 150 pixels, then you'll see fewer details there and you can't place the sampling points as exactly.

2002, Arndt von Koenigsmarck, Maxon Cinema 4D 7: A Workshop for 2D/3D Graphics Pros, page 277:

(computing) A prior pass of an algorithm or process, sometimes as an optimization to handle simpler cases.


CELP

code-excited linear prediction
w:Code-excited linear prediction

(computing) Initialism of code-excited linear prediction.


toon-shaded

(computer graphics) Synonym of cel-shaded


cel-shaded

(computer graphics) Produced using the technique of cel shading.


VQ

vector quantization
w:Vector quantization

(signal processing) Initialism of vector quantization.


WMS

warehouse management system
w:warehouse management system

(databases) Initialism of warehouse management system.


WMS

Windows Media Services
w:Windows Media Services

(computing) Initialism of Windows Media Services.

Windows MultiPoint Server
w:Windows MultiPoint Server

(computing) Initialism of Windows MultiPoint Server.


Nihilist cipher

Nihilist cipher (plural Nihilist ciphers)

The cipher was originally used by Russian Nihilists in the 1880s to organise terrorism against the tsarist regime.

(cryptography, historical) A symmetric cipher in which a Polybius square using a mixed alphabet is used to convert both the plain text and a keyword to a series of two-digit numbers, which are then summed in the normal way to get the ciphertext, with the key numbers repeated as required; (by extension) any of several improved algorithms based on this.


readers-writers problem

readers-writers problem (plural readers-writers problems)

(computing theory) Any of a class of problems in which many concurrent threads of execution try to access the same shared resource at one time, with constraints on which threads may read from and write to the resource.


computer illiteracy

From computer + illiteracy, probably modelled after computer literacy.

Computer illiteracy is likely to be a problem for the society of tomorrow; plain illiteracy […] is a problem of today's society.

1993, Scott R. Tilley, “Computer Businesses”, in How to Make Money with Your Home Computer:

(computing) The inability to use a personal computer.


search-engine

en-verb

search-engine (third-person singular simple present search-engines, present participle search-engining, simple past and past participle search-engined)

search-engines (present singular third-person)
search-engining (participle present)
search-engined (participle past)
search-engined (past)

(computing, Internet, transitive) To look up on a search engine.

(computing, Internet, intransitive) To use a search engine; to look things up on a search engine.


design system

Design systems are more than the latest fad; they are a natural evolution in the intersection between art, technology, and industry.

2019, Sarrah Vesselov, Taurie Davis, Building Design Systems: Unify User Experiences through a Shared Design Language, Apress, →ISBN, page 5:

graphical user interface
graphical user interface

(design, graphical user interface) A collection of reusable components and clear standards that can be assembled together to build any number of applications; a unified design language.


DCom

(computing) Initialism of Doctor of Commerce (a doctoral degree in awarded by universities in the Commonwealth.)


finite automaton

en-noun

finite automaton (plural finite automata)

finite-state machine
finite-state machine#English

(computing theory) Synonym of finite-state machine


Hyrum's law

Named after software developer Hyrum Wright.

(software engineering) An observation regarding the likelihood of breaking changes to a public interface, stating that, given a sufficiently popular system, any observable behavior — even if it is not guaranteed by contract — will be depended upon by some user.


endianless

Note that the byte is endianless; that is, whether it is big-endian or little-endian, the MSB (most significant bit) is bit #7 and the LSB (least significant bit) is bit #0.

2005, James C. Leiterman, 32/64-Bit 80x86 Assembly Language Architecture (Wordware Applications Library), Plano, Texas: Wordware Publishing, Inc., →ISBN, →LCCN, →OCLC, page 530:

Shift the original value right by one! Note "M" and "L" denote most and least significant bits in big or little endian and 8 bit is endianless.

2003, James C. Leiterman, Vector Game Math Processors (Wordware Game Math Library), Plano, Texas: Wordware Publishing, Inc., →ISBN, →OCLC, page 530:

Functions to read and write IFF / RIFF files. They are endianless and support 64 bit chunks.

2018 May 10, Alessandro Pedretti, Angelica Mazzolari, Giulio Vistoli, “WarpEngine, a Flexible Platform for Distributed Computing Implemented in the VEGA Program and Specially Targeted for Virtual Screening Studies”, in Journal of Chemical Information and Modeling, volume 58, number 6, American Chemical Society, →DOI, retrieved 2023-12-12, Supporting Material, Table S1:

2015 August 22, Victor Stinner, “7.4 Byte order marks (BOM)”, in Programming with Unicode Documentation, Release 2011, archived from the original on 2023-12-12, page 22:


AMQP

Advanced Message Queuing Protocol
w:Advanced Message Queuing Protocol

(computing) Initialism of Advanced Message Queuing Protocol.


sudoed

(computing, of a program) Ran using sudo.


theta join

(databases) A join between tables based on some relationship other than equality.


metasprite

(computer graphics) A sprite made up from a number of smaller hardware sprites that are moved together.


VTL

(computing) Initialism of virtual trust level.

(computing, historical) Initialism of virtual tape library.


SBOM

SBOMs are lists of nested software components designed to enable supply chain transparency.

2023, Rick Howard, Cybersecurity First Principles: A Reboot of Strategy and Tactics, John Wiley & Sons, →ISBN:

bill of materials
bill of materials#English

(software) Initialism of software bill of materials, the inventory of components used to build a software artifact.


corpus manager

(computing, linguistics) A sophisticated tool for analyzing multilingual corpora.


intervalize

en-verb

intervalize (third-person singular simple present intervalizes, present participle intervalizing, simple past and past participle intervalized)

intervalizes (present singular third-person)
intervalizing (participle present)
intervalized (participle past)
intervalized (past)

The conventional Hopfield neural network with time delay is intervalized to consider the bounded effect of deviation of network parameters and perturbations yielding a novel interval dynamic Hopfield neural network (IDHNN) model.

1998 September, Xiaofeng Liao, Juebang Yu, “Robust Stability for Interval Hopfield Neural Networks with Time Delay”, in IEEE Transactions on Neural Networks, volume 9, number 5, →DOI, page 1042:

(computing) To cause to occur at regular time intervals.


TOML

Coordinate term: YAML

TOML is a configuration file format that is easy for humans to read. It supports both comments and multiline strings.

2021, Adam Woodbeck, Network Programming with Go: Code Secure and Reliable Network Services from Scratch, No Starch Press, →ISBN, page 225:

(computing, file format) Acronym of Tom's Obvious Minimal Language.


prvalue

Short for pure rvalue. According to Bjarne Stroustrup, coined by ISO/IEC JTC 1/SC 22 in 2010.

(programming) An rvalue that is not an xvalue.


flowmap

LL-Q1860 (eng)-Flame, not lame-flowmap.wav

Flowmaps have a hierarchical structure in which some functional units correspond to activities (atomic operations) and others correspond to more detailed flowmaps.

1994, Reid Alan Baldwin, A Discipline Independent Framework for Engineering Design, page 101:

Flowmaps can be exponentially large if there are many alternatives. In the NELSIS system, the flow plan is fixed.

1995, Sea Hawon Choi, Design Methodology in High Level Synthesis (page 67)

[…] a "flowmap" that amounts to a perceptual analysis of the Sokoban level. The flowmap is a concise data structure that contains a graph of all possible pushes (under the assumption that all other barrels are deleted), […]

2007, Ben Goertzel, Pei Wang, Advances in Artificial General Intelligence, page 66:

(computing) A kind of diagram indicating flow through a process or system.


EDF

(computing) Initialism of earliest deadline first.


rvalue reference

en-noun

rvalue reference (plural rvalue references)

(programming) In C++, a reference which is bound to an rvalue.


rackware

LL-Q1860 (eng)-Flame, not lame-rackware.wav

Rackware, economically-packaged shareware and low-cost retail software that is generally hung on display racks, was pioneered by SoftKey and other companies a decade ago. But the marketing practice has become ubiquitous only in the last year or so. Now just about every airport, department store, and computer retailer carries at least one rack. Most rackware falls into entertainment and educational categories, but that too is changing as major apps begin to appear.

1993, PC Mag, volume 12, number 15, page 30:

Contact database features hundreds of addresses for bulletin boards and rackware

1994, Steve Hudgik, Make Money Selling Your Shareware:

Another advantage of rackware publishing is ownership.

1994, Game Developer, volume 1, page 53:

(computing) Low-cost software sold in shops, generally hung on display racks.


APNS

Alternative form: APNs

On the device side, APNS must validate the connection is with a genuine device.

2015, Lauren Collins, Scott R. Ellis, Mobile Devices: Tools and Technologies, CRC Press, →ISBN, page 87:

Apple Push Notification service
w:Apple Push Notification service

(computing) Initialism of Apple Push Notification service.


transput

From trans- + put, modeled on input and output.

Another basic goal was to separate the responsibility for uniform and correct synchronization and protection from that for efficient representation and transput.

1978 May 22, Guy Almes, George Robertson, “An extensible file system for hydra”, in ICSE '78: Proceedings of the 3rd international conference on Software engineering, IEEE Press, →DOI:

(computing, obsolete) Synonym of input/output


boat anchor

Suggesting that it would only be useful as a weight to be thrown overboard to moor a vessel.

(slang, radio, computing) A cumbersome, useless piece of equipment.


gRPC

remote procedure call
remote procedure call

(computing) a cross-platform open-source high-performance remote procedure call framework.


Dhrystone

Coordinate term: Whetstone

(computing) A microprocessor benchmark measuring primarily fixed-point arithmetic performance.


Dhrystone

While the average Dhrystones per task decline rapidly after five, the total number of Dhrystones increases until the number of tasks […]

Because a VAX 11/70 could execute 1,757 loops through the Dhrystone benchmark in 1 second, 1,757 loops became 1 Dhrystone.

2001, Arnold S. Berger, Embedded Systems Design: An Introduction to Processes, Tools, and Techniques, CRC Press, →ISBN, page 27:

(computing) A measure of the Dhrystone benchmark, calibrated to some reference architecture.


HEIC

High Efficiency Image Codec
w:High Efficiency Image File Format

(computer graphics, file format) Initialism of High Efficiency Image Codec, HEVC contained in HEIF.


book type

(computing) A field of four bits at the beginning of a DVD indicating the physical format of the disc.


Zig

programming language
programming language

(computer languages) A general-purpose imperative, statically typed, compiled programming language intended as a modern successor to the C language.


entity alignment

(information science) The process of identifying entities that refer to the same real-world object in different knowledge bases.


zombie client

(computing, networking) Computer software that takes directions from a remote computer and uses the infected computer to perform malicious tasks as directed.


version number

(computing) A unique number or set of numbers assigned to a specific version of software, firmware, file, etc.


zombie path

(computing) A path that is no longer valid or accessible because the target has been moved or deleted.


zombie user

(computing) A logged in or registered user that should no longer exist but has not been fully deleted from the system.


zombie system

Once a trojan acquires control of a remote system, the malicious user can act through the "zombie" system and the source of his or her mischief will be identified as coming from the compromised system, as opposed to his or her own.

2003, Jason Albanese, Wes Sonnenreich, Network Security Illustrated, page 393:

It is a free, open source tool that can tell a zombie system flooding packets to stop flooding.

2007, Pranav Pareek, Hacking-- the Untold Story -, page 115:

Sure, the hacker will lose a useful resource (probably in the form of a remote bot or zombie system that he took over previously) , but he will be one step closer to his ultimate goal.

2008, Richard Miniter, Leah Wilson, Jack Bauer for President: Terrorism and Politics in 24, page 63:

Performance issues could be security incidents—for example, if you notice that a system is running very slowly, it could be infected by a virus, or a hacker could be using it as a zombie system to do other processing.

2021, Glen E. Clarke, Daniel Lachance, CompTIA Security+ Certification Bundle, page 766:


full-stacker

(software engineering, informal) A full-stack software developer.


TOCTOU

time-of-check to time-of-use
time-of-check to time-of-use#English

(software engineering) Abbreviation of time-of-check to time-of-use.


USB key

(computer hardware) A USB drive used to identify and authenticate a user.


SCD

slowly changing dimension
w:slowly changing dimension

(databases) Initialism of slowly changing dimension.


predictive texting

(computing) The composition of messages using predictive text.


automoderator

LL-Q1860 (eng)-Flame, not lame-automoderator.wav

Purely utilitarian considerations determined whether Usenet’s equivalent to IRC’s channel protection bots – the robo-moderators and automoderators and modbots – succeeded or failed.

1997, Andrew Leonard, Bots: The Origin of New Species, San Francisco, Calif.: HardWired, →ISBN, page 175:

These codes determine which newsgroups the automoderator places your message in.

1999, Matthew L. Helm, April Leigh Helm, Genealogy Online For Dummies®, 2nd edition, Foster City, Calif.: IDG Books Worldwide, Inc., →ISBN, page 56:

Digital agents, 10% of the references, were non-human agents, typically a bot, that undermined/challenged the work of the conspiracy theorists and/or the conspiracy theory itself. The discussion about non-human agents appeared mostly in the Reddit dataset. This conversation referred to automoderators or bots designed to automate various moderation tasks for which no human judgment is needed – such as deleting comments – and whose decisions can be overridden by human mods.

2022, Pilar Garcés-Conejos Blitvich, Nuria Lorenzo-Dus, “‘Go ahead and “debunk” truth by calling it a conspiracy theory’: The discursive construction of conspiracy theoryness in online affinity spaces”, in Massimiliano Demata, Virginia Zorzi, Angela Zottola, editors, Conspiracy Theory Discourses (Discourse Approaches to Politics, Society and Culture; 98), Amsterdam: John Benjamins Publishing Company, →ISBN, page 92:

(computing) A bot that automatically moderates (a discussion forum, etc.).


C--

From the name of the C language (on which it was based) and --, the decrement operator in both languages, coined as an inside joke, indicating that C-- is a reduced form of C.

(computer languages) A C-like programming language, designed to be generated mainly by compilers for high-level languages rather than written by human programmers.


off-prem

Companies and organizations are increasingly shifting their computer infrastructure resources from on-premises (on-prem) to off-premises (off-prem) cloud service models.

2017, “Private Cloud Security”, in John R. Vacca, editor, Computer and Information Security Handbook, Morgan Kaufmann, →ISBN, page 931:

(computing) Located outside the premises of an organization, typically in the cloud.


audio mining

(computing, linguistics) A technique that involves automatically analyzing and searching the content of an audio signal, often for speech recognition.


audio-visual speech recognition

audio-visual speech recognition (uncountable)

computational linguistics
computational linguistics

(computational linguistics) A technique that uses lip reading through image processing to enhance speech recognition systems.