macroblocking

(computer graphics) A visual artifact in compressed video etc. where similar adjacent pixels appear as a contiguous block of colour.


GGEV

(computing) A routine in LAPACK for computing eigenvalues.


exabit

(computing) One quintillion (10¹⁸, or 1,000,000,000,000,000,000) bits or 1,000 petabits.


linear algebraic group

en-noun

linear algebraic group (plural linear algebraic groups)

Geometric invariant theory arises in an attempt to construct a quotient of an algebraic variety X by an algebraic action of a linear algebraic group G.

2003, Igor Dolgachev, Lectures on Invariant Theory, Cambridge University Press, page xiii:

The differential Galois group of a homogeneous linear differential equation has a structure of linear algebraic group; hence it is endowed, in particular, with the Zariski topology.[…]Kolchin used the differential algebra developed by Ritt and also built the foundations of the theory of linear algebraic groups.

2011, Teresa Crespo, Zbigniew Hajto, Algebraic Groups and Differential Galois Theory, American Mathematical Society, page xi:

2015, Willem A. de Graaf, Orbit Closures of Linear Algebraic Groups, Jaime Gutierrez, Josef Schicho, Martin Weimann (editors), Computer Algebra and Polynomials: Applications of Algebra and Number Theory, Springer, LNCS: 8942, page 76,
Actions of linear algebraic groups appear in many contexts. […] Throughout we assume that the base field is algebraically closed and of characteristic 0, as many constructions that we use (e.g., the correspondence between a linear algebraic group and its Lie algebra) only work well in characteristic 0.

general linear group
general linear group

(algebraic geometry, category theory) An algebraic group that is isomorphic to a subgroup of some general linear group.


return-oriented programming

(programming) A computer security exploit technique by which the attacker gains control of the call stack to hijack program control flow and then executes prepared instruction sequences ("gadgets") that are already present in the machine's memory.


code cave

Once a code cave is created, you can execute it using either thread injection or thread hijacking.

2016, Nick Cano, Game Hacking: Developing Autonomous Bots for Online Games:

In ELF executables, there aren't a whole lot of code caves (such as in the PE format), so you are not likely to be able to shove more than just a meager amount of shellcode into existing code slots […]

2016, Ryan "elfmaster" O'Neill, Learning Linux Binary Analysis (page 97)

(programming) A sequence of null bytes in a process's memory, offering the capacity for the injection of custom instructions by a hacker.


text hooker

A text hooker allows English-speaking people to read Japanese visual novels.

A text hooker, or at least what I'm calling a text hooker, is a program or function that hijacks the text output of a game (in realtime) and outputs somewhere else so that you can copy/paste or whatever you want with it.

2005, User Ugly Joe, Zophar's Message Domain:

AGTH (Anime Game Text Hooker) is a tool for capturing text from running programs.

(computing) Software that reads text from other software that is being executed, often for the purpose of replacing the text with its translation in another language.


non-realtime

(computing) Alternative form of nonrealtime


bootscan

(computing) An antivirus scan that takes place before the operating system has loaded.


hub-and-spoke

We had no NATO counterpart in the Pacific, only a series of "hub and spoke" bilateral alliances, so we always worked for greater South Korean–Japanese cooperation[…]

2020 June 23, John Bolton, The Room Where It Happened: A White House Memoir, New York, N.Y.: Simon & Schuster, →ISBN, page 357:

(transport, networking) Being or relating to a topology, whether for the physical distribution of goods or for telecommunications, that has a central "hub" connecting a number of outlying "spokes".


most vexing parse

The phrase was introduced by Scott Meyers in Effective STL (2001).

programming language
programming language

(programming) A specific form of syntactic ambiguity resolution in the C++ programming language, whereby attempts to declare a variable may be undesirably interpreted as attempts to declare a function.


microcomputerized

(computing) Containing or using a microcomputer


zero-based

Zero-based budgeting
Zero-based numbering

(programming) Of an array or list: such the first element of the array or list is called the zeroth.


yo-yo mode

(computing, slang) The condition of having repeated intermittent failures, such that the system alternates between being up and down.


(video games, computer graphics) Halfway between two-dimensional and three-dimensional; typically limited to a two-dimensional plane with only limited access to the third dimension.


skeleton screen

skeleton screen (plural skeleton screens)

graphical user interface
graphical user interface

(graphical user interface) A simplified display with empty placeholders for content that has not yet loaded.


WinPE

(computing, Windows) Abbreviation of Microsoft Windows Preinstallation Environment.


parsimonization

(mathematics, computing) Conversion to a parsimonious form


KERNAL

From an accidental misspelling of kernel, sometimes backronymed as Keyboard Entry Read, Network, And Link.

The KERNAL is an 8K ROM located at $E000 to $FFFF, which contains the operating system for the C-64.

1986, John Gordon, Ian McLean, Commodore 64 Advanced User Guide, Prentice Hall, →ISBN:

(computing, historical) The operating system used by early Commodore International home computers.


trashbox

Liam shook his head, and clicked on inbox. Wasn't much in it, or in the outbox, or in the trashbox.

1999, Dana Stabenow, So Sure of Death, page 52:

(computing) An electronic folder for deleted electronic mail.


VCL

(Delphi, programming) Initialism of Visual Component Library.


FMX

(Delphi, programming) Initialism of FireMonkey.


(computing) A programming language descended from Pascal, developed between 1977 and 1985 at the ETH in Zurich.


mousepress

(computing) The act of pressing one of the buttons on a mouse


siloization

(management, informatics) The splitting of personnel, data, etc. into isolated units with poor communication.


underactuate

en-verb

underactuate (third-person singular simple present underactuates, present participle underactuating, simple past and past participle underactuated)

underactuates (present singular third-person)
underactuating (participle present)
underactuated (participle past)
underactuated (past)

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

The basic idea is to temporarily underactuate the robot system by releasing one of the actuators and to use some additional driving force to guide the parallel kinematic structure through the singularity of type 2.

2010, Daniel Schütz, Friedrich M. Wahl, Robotic Systems for Handling and Assembly, →ISBN, page 101:

Figure 10 refers to a first design for underactuating the LARM finger mechanism by using a linear spring within the body of phalanx 2, [17].

2015, Shaoping Bai, Marco Ceccarelli, Recent Advances in Mechanism Design for Robotics, →ISBN:

A four-bar mechanism (Fig.2) is used to underactuate the fingers so that they can automatically adapt to the shape and size of the object and be less sensitive to positioning errors of the robot relative to the object to grasp.

2018, Vigen Arakelian, Philippe Wenger, ROMANSY 22 – Robot Design, Dynamics and Control, →ISBN:

(robotics) To make less easily actuated or responsive.


wordfilter

Facebook does not allow for pre-moderation of comments on pages and comments cannot be turned off, however NSW supreme court justice Stephen Rothman had argued that the media companies could have used a word filter using extremely common words to pre-filter the majority of comments to only be visible to the page owner and that user and their friends.

2020 June 1, Josh Taylor, “Australian media companies face defamation liability for comments on Facebook after court dismisses appeal”, in The Guardian:

(computing) Software that monitors text input to chatrooms etc., deleting or modifying offensive language.


MUA

A “mail user agent” (MUA or UA) that lets users read and compose mail[.]

2011, Evi Nemeth et al., UNIX and Linux System Administration Handbook, Pearson Education, →ISBN, page 744:

(computing) Initialism of mail user agent.


VMCI

(programming) Initialism of Virtual Machine Communication Interface.


iterative deepening search

en-noun

iterative deepening search (countable and uncountable, plural iterative deepening searches)

breadth-first search
breadth-first search

(computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage.


virtual machine monitor

virtual machine monitor (plural virtual machine monitors)


VMM

(computing) Abbreviation of virtual machine manager (of RedHat)

virtual machine monitor
virtual machine monitor#English

(computing) Abbreviation of virtual machine monitor (a hypervisor)

(computing) Abbreviation of virtual memory manager.


demostyle

Yea, it's got some good GDM's... The music is basically a cross between House, Demostyle, and Classical (don't ask). It's got some killer music in it, like Click.gdm, and Bounce.gdm (take a guess what that is :) )

1999, Luke Drelick, “ZZT”, in alt.games.final-fantasy (Usenet):

download modules in the same style as your ideas [if you don't know where to get that particular style, ask in this group :), especially with danceable music like trance, house, drum'n'bass, techno, etc, and with demostyle music, there are lots of tracks with very good samples available, if you know where to find them. And we know that.], and extract the samples. that is by far the best way to get suitable samples. Archives very often contain bad or useless samples except for this very one single particular style/setup/idea/emotion/etc.

2000, eggbird, “Need sound files for tracking”, in alt.music.mods (Usenet):

(demoscene) Of a musical style popular in the demoscene, involving tracker modules usually assembled from samples played at various pitches.


cofilament

(category theory) A diagram in a category that is indexed by a directed set.


dark pattern

Coined by user-experience consultant Harry Brignull in 2010.

coin

It was really easy to register an account on the app, but the option to delete my account seemed almost impossible, which made me feel like a victim of a dark pattern.

The Impersonation dark pattern occurs when these broadcasts communicate actions users never performed, thus misleading others.

2014, Chris Lewis, Irresistible Apps: Motivational Design Patterns for Apps, Games, and Web-based Communities:

Brignull's specific goal in identifying dark patterns was to recognize and name companies, and describe their dark practices so that people would be aware of dark patterns in an interface, and to shame the companies using them.

2015, Nicolai Marquardt, Proxemic Interactions: From Theory to Practice, page 140:

Consumers are faced with dark patterns on a daily basis; whether they want to use an online retailer, unsubscribe from a service, protect their privacy, and in many other situations.

2021 January 14, Norwegian Consumer Council, You can log out, but you can never leave:

(graphical user interface) A user interface that is intentionally designed to trick users into doing things that are not in their own best interest, such as giving up more information, or agreeing to unfavourable terms.


sequence assembly

en-noun

sequence assembly (plural sequence assemblies)

(bioinformatics) The aligning and merging of fragments from a longer DNA sequence in order to reconstruct the original sequence.


genome assembly

genome assembly (plural genome assemblies)

(bioinformatics) The process of taking a large number of short DNA sequences and putting them back together to create a representation of the original chromosomes from which the DNA originated.


continuous delivery

continuous delivery (plural continuous deliveries)

Coordinate term: continuous deployment

software engineering
software engineering

(software engineering) An approach where teams produce software in short cycles, ensuring that the software can be reliably released at any time.


Linuxism

(computing, informal) Any feature specific to the Linux operating system (usually in comparison to other UNIX-like systems like BSD).


arraylet

(programming) Any of the subarrays that make up a larger array-like data structure whose elements do not have to be stored contiguously.


self-interpreter

(programming) A metacircular interpreter where the host programming language is also the language being interpreted.


ungolfed

the original, ungolfed code

(programming) Not having been written in short form according to the challenge of code golf.


Gabor transform

Gabor transform (plural Gabor transforms)

(signal processing) A special case of the short-time Fourier transform, used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time.


Gabor filter

(signal processing) A linear filter used for image texture analysis.


Gabor wavelet

(signal processing) A form of wavelet designed so as to minimize the product of its standard deviations in the time and frequency domain.


Gabor atom

(signal processing) A kind of function used in the analysis proposed by Dennis Gabor in 1946 in which a family of functions is built from translations and modulations of a generating function.


untunneled

(computing, networking) Not using a tunnel (wrapper for insecure or unsupported protocol).


autonumber

Any autonumber has three parts: a fixed prefix, an incremental number, and a changing suffix. Prefixes have a maximum length of three and are used for all system-generated numbers for the selected record type.

2013, Dipankar Bhattacharya, Microsoft Dynamics CRM 2011 Cookbook:

(computing) An automatically generated number.


autonumber

en-verb

autonumber (third-person singular simple present autonumbers, present participle autonumbering, simple past and past participle autonumbered)

autonumbers (present singular third-person)
autonumbering (participle present)
autonumbered (participle past)
autonumbered (past)

Will it still autonumber the lines for me […] ?

2007, Andre Ben-Hamou, Practical Ruby for System Administration, page 102:

(computing, transitive) To number automatically.


microinteraction

(graphical user interface) Any very small-scale interaction between a user and the system they are using.


skyline operator

en-noun

skyline operator (plural skyline operators)

From the concept of selecting buildings on the Manhattan skyline by visibility, based on height and distance.

(databases) A proposed operator, for use in database queries, that filters out results that are worse than others according to multiple criteria.


clickworthy

en-adj

clickworthy (comparative more clickworthy, superlative most clickworthy)

more clickworthy (comparative)
most clickworthy (superlative)

From click + -worthy, in reference to clicking a hyperlink etc. with a computer mouse.

(computing, informal) Of a website or similar: worth reading or visiting.


TPU

en-noun

TPU (countable and uncountable, plural TPUs)

The GPU and TPU computing resources were used to investigate the influence of hardware-supported quantization on performance of the DNNs.

2019, “Scaling Analysis of Specialized Tensor Processing Architectures for Deep Learning Models”, in Witold Pedrycz, Shyi-Ming Chen, editors, Deep Learning: Concepts and Architectures, Springer Nature, →ISBN, page 73:

Tensor Processing Unit
w:Tensor Processing Unit

(countable, computer hardware) Initialism of Tensor Processing Unit, a circuit optimized for neural network machine learning.


piece table

(computing theory) A data structure consisting of an original document and a series of insertions and deletions referring back to parts of the original or modified document, typically used to represent a series of edit operations on text.


page table

(computing) A data structure used by a virtual memory implementation to store the mappings between physical and virtual addresses.


run ahead

en-verb

run ahead (third-person singular simple present runs ahead, present participle running ahead, simple past ran ahead, past participle run ahead)

runs ahead (present singular third-person)
running ahead (participle present)
ran ahead (past)
run ahead (participle past)

(software, transitive) To execute (code) in advance, anticipating a likely upcoming need for the result.


tab out

tab out (third-person singular simple present tabs out, present participle tabbing out, simple past and past participle tabbed out)

tabs out (present singular third-person)
tabbing out (participle present)
tabbed out (participle past)
tabbed out (past)

Let me tab out and check on that for you.

(computing, graphical user interface) To press the Tab key and a modifier key to move between tabs or windows.


IASP

(computing) Initialism of independent auxiliary storage pool.


function pointer

en-noun

function pointer (plural function pointers)

(computing) a pointer that points to a function


geolocked

As Amazon UK is a geolocked store, there is no problem with offering your ebook at a lower price compared to the US Kindle Store, as only UK buyers can purchase ebooks from Kindle UK.

2016, Derek Haines, How To Self-Publish a Book:

(computing) restricted to a specific geographical region


disjoint set

(computer science) A data structure used to store such sets and perform operations on them efficiently.


toolstack

information technology
information technology

(computing) A collection of software tools to work on different parts of a related system, often used on information technology infrastructure management.


paravirtualize

en-verb

paravirtualize (third-person singular simple present paravirtualizes, present participle paravirtualizing, simple past and past participle paravirtualized)

paravirtualizes (present singular third-person)
paravirtualizing (participle present)
paravirtualized (participle past)
paravirtualized (past)

(computing) To modify an operating system or software driver to allow paravirtualization.


hillshade

(computer graphics) A graphical representation of a surface as if illuminated from one side


hillshade

hillshade (third-person singular simple present hillshades, present participle hillshading, simple past and past participle hillshaded)

hillshades (present singular third-person)
hillshading (participle present)
hillshaded (participle past)
hillshaded (past)

(computer graphics, transitive) To illuminate a surface in this manner.


checksummer

(computing) An algorithm that computes a checksum.


gap buffer

(programming) A dynamic array that allows efficient insertion and deletion operations clustered near the same location.


comb filter

So called because its frequency response consists of a series of regularly spaced notches, giving the appearance of a comb.

(signal processing) A filter that adds a delayed version of a signal to itself, causing constructive and destructive interference.


runlength

(computing) The length of a sequence of repeated characters in a string


tab order

(graphical user interface) The sequence in which a user can navigate from one control to the next by pressing the Tab key.


metadataset

(computing) A data set composed of metadata.


monorepo

From mono- + repo or a blend of monolithic + repo.

As with central deployments, we can look into two different scenarios here too: either using a monorepo as a code base or starting with individual repositories to have dedicated pipelines.

2021, Florian Rappl, The Art of Micro Frontends, Packt Publishing Ltd, →ISBN, page 40:

(software engineering) A monolithic repository, where core code and its dependencies are included in the same repository.


electronic data interchange

en-noun

electronic data interchange (uncountable)

(computing) The electronic exchange of structured information, by agreed message standards, from one application to another with a minimum of human intervention.


profinite group

profinite group (plural profinite groups)

This proposition shows that to have a representation with big image of a profinite group, for example, a Galois group, we need to take a profinite topological ring A as a coefficient ring, like the p-adic integer ring #92;Z#95;p.

2000, Haruzo Hida, Modular Forms and Galois Cohomology, Cambridge University Press, page 28:

We have already pointed out that a profinite group G of an infinite rank m is free of rank m if (and only if) G is projective and every finite split embedding problem for G with a nontrivial kernel has m solutions (Proposition 9.4.7). Dropping the condition on G to be projective leads to the notion of a "quasi-free profinite group" (Section 10.6).

2011, Moshe Jarden, Algebraic Patching, Springer, page 207:

2014, David Barnes, Constanze Roitzheim, Rational equivariant rigidity, Christian Ausoni, Kathryn Hess, Brenda Johnson, Wolfgang Lück, Jérôme Scherer, An Alpine Expedition through Algebraic Topology, American Mathematical Society, page 14,
Recall that a profinite group is an inverse limit of an inverse system of finite groups, with the p-adic numbers being the canonical example. Any finite group is, of course, profinite, but when we talk of a profinite group we assume that the group is infinite.

(topology, category theory) A topological group that is isomorphic to the inverse limit of some inverse system of discrete finite groups; equivalently, a topological group that is also a Stone space.

groupe profini

topological group isomorphic to the inverse limit of an inverse system of discrete finite groups


ODR

One Definition Rule
w:One Definition Rule

(programming, C++) Initialism of One Definition Rule.


optimize out

en-verb

optimize out (third-person singular simple present optimizes out, present participle optimizing out, simple past and past participle optimized out)

optimizes out (present singular third-person)
optimizing out (participle present)
optimized out (participle past)
optimized out (past)

The loop that counts from 1 to 1,000,000 is optimized out by the compiler, because nothing happens inside the loop and the value is not used afterwards.

(transitive, programming) To omit (some portion of program logic) through optimization, when it is found to be unused or unnecessary.


pessimization

en-noun

pessimization (countable and uncountable, plural pessimizations)

(programming) A change to program code that makes it less efficient, the opposite of an optimization.


cofunctionality

(mathematics, computing) The condition of being a cofunction


directed acyclic graph

directed acyclic graph (plural directed acyclic graphs)

1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, LNCS 903, page 121,
A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. […] Directed acyclic graphs are widely used in different areas of computer science.

In studying these properties, a distinction is made between directed acyclic graphs with directed edges and simple acyclic graphs with undirected edges.[…]A directed acyclic graph G#61;(V#59;R) is asymmetric and does not contain cycles.

2001, Peter J. Pahl, Rudolf Damrath, Mathematical Foundations of Computational Engineering: A Handbook, Springer, page 574:

2011, Michael Donders, Sara Miner More, Pavel Naumov, Information Flow on Directed Acyclic Graphs, Lev D. Beklemishev, Ruy de Queiroz (editors), Logic, Language, Information, and Computation: 18th International Workshop, Proceedings, Springer, LNAI 6642, page 95,
A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.

(graph theory, computer science) A finite directed graph that contains no directed cycles.


acyclic digraph

acyclic digraph (plural acyclic digraphs)

1993, Suh-Ryung-Kim, The Competition Number and Its Variants, J. Gimbel, J.W. Kennedy, L.V. Quintas (editors), Quo Vadis, Graph Theory?: A Source Book for Challenges and Directions, Elsevier (North-Holland), page 313,
In the study of the competition graph of an acyclic digraph, there are two fundamental questions which were proposed by Roberts in 1978: One is to characterize the acyclic digraphs that have interval competition graphs and the other is to characterize the graphs which are competition graphs of acyclic digraphs.

2009, Tamara Mchedlidze, Antonios Symvonis, Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs, Hung Q. Ngo (editor), Computing and Combinatorics: 15th Annual International Conference, Proceedings, Springer, LNCS 5609, page 76,
Determining whether a graph has a hamiltonian path or circuit is NP-complete [3]. The problem remains NP-complete for cubic planar graphs [3], for maximal planar graphs [9], and for planar digraphs [3]. It can be trivially solved in polynomial time for planar acyclic digraphs.

2018, Gregory Gutin, 3. Acyclic Digraphs, Jørgen Bang-Jensen, Gregory Gutin, Classes of Directed Graphs, Springer, page 125,
Acyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications.

directed acyclic graph
directed acyclic graph

(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.


distributed hash table

distributed hash table (plural distributed hash tables)

1992, Nobuyuki Ichiyoshi, Konighi Komura, Asymptotic Load Balance of Distributed Hash Tables, Institute for New Generation Computer Technology staff (editors), FGCS '92: Fifth Generation Computer Systems 1992, Volume 2, IOS Press, page 869,
The distributed hash table is a parallelization of the hash table obtained by dividing the table into subtables of equal size and allocating them to the processors. […] We also discuss communication overheads, and find that, in the case of mesh multicomputers, unless the network channel bandwidth grows sufficiently as p grows, the network will eventually become a performance bottleneck for distributed hash tables.

2006, Theoni Pitoura, Nikos Ntarmos, Peter Triantafillou, Replication, Load Balancing and Efficient Range Query Processing in DHTs, Yannis Ioannidis, Marc H. Scholl, et al. (editors), Advances in Database Technology - EDBT 2006: 10th International Conference, Proceedings, Springer, LNCS 3896, page 131,
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash Tables (DHTs).

2008, Zoi Kaoudi, Iris Miliarski, Manolis Koubarakis, RDFS Reasoning and Query Answering on Top of DHTs, Amit Sheth, Steffen Staab, Mike Dean, Massimo Paolucci, Diana Maynard, Timothy Finin, Krishnaprasad Thirunarayan (editors), The Semantic Web - ISWC 2008: 7th International Semantic Web Conference, Proceedings, Springer, LNCS 5318, page 499,
We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. […] Our goal in this paper is to compare and evaluate two well-known approaches to RFDS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness.

(computer science) A decentralised distributed system that performs the functions of a hash table.


sysape

(computing, slang, derogatory) An incompetent sysop.


helplessdesk

(computing, slang, derogatory) An incompetent helpdesk.


georeplication

(computing) georemote replication of data


ROMable

Let's C does support ROMable code and can be linked with PL/M and compatible languages via an "alien" function type.

It produces ROMable code which can be loaded directly into target systems via Intel ICE emulators.

1990, 16-/32-bit embedded processor handbook, pages 2–19:

(programming) Able to execute from read-only memory.


demofreak

(demoscene slang) A demoscene enthusiast.


navigation bar

(graphical user interface) A bar at the top of a graphical user interface containing links that allow users to move around the page and/or program


sequence point

(programming) Any point during a computer program's execution at which it is guaranteed that all side effects of previous evaluations will have been performed, and no side effects from subsequent evaluations have yet been performed.


Rustacean

/ɹʌsˈteɪʃən/

New Rustaceans commonly get stuck on strings for a combination of three reasons: […]

2019, Steve Klabnik, Carol Nichols, The Rust Programming Language, page 137:

We covered a whole lot of ground here in a subject that's probably the heaviest to grasp for a new Rustacean.

2019, Rahul Sharma, Vesa Kaihlavirta, Mastering Rust, page 210:

You'll find that the Rust community loves to track the progress of a certain area using their “Are We X Yet” sites. This is a tradition from the Mozilla community, which many Rustaceans are also involved in.

2020, Shing Lyu, Practical Rust Projects, page 154:

(programming, informal) A user of the Rust programming language.


retpoline

(programming, neologism) A code construct that uses return operations to prevent speculative execution.


LCG

linear congruential generator
linear congruential generator#English

(computing theory) Initialism of linear congruential generator.


Savitch's theorem

(computing theory) A theorem giving a relationship between deterministic and non-deterministic space complexity.


BDUF

Big Design Up Front
w:Big Design Up Front

(software engineering) Initialism of Big Design Up Front.


PPD

PPD (countable and uncountable, plural PPDs)

pixels per degree
pixels per degree#English

(computing) Initialism of pixels per degree (“a measurement of the visual fidelity of a virtual reality headset”).


tree shaking

(programming) In JavaScript, automatic dead code elimination during the build.


Kleisli category

Kleisli category (plural Kleisli categories)

Named after the Swiss mathematician Heinrich Kleisli (1930–2011).

(category theory) A category naturally associated to any monad T, and equivalent to the category of free T-algebras.


peepholing

peephole optimization
peephole optimization

(programming) The use of peephole optimization.


unarchiver

(computing) A program or algorithm that unarchives.


pub-sub

publish–subscribe pattern
w:publish–subscribe pattern

(software engineering) Abbreviation of publish–subscribe pattern.


cyberprodigy

(computing, rare) Person who has an extraordinary talent for using computers.


cybertaxonomy

cybertaxonomy (countable and uncountable, plural cybertaxonomies)

(computing, taxonomy) computerised taxonomy


SBCS

single-byte character set
w:single-byte character set

(computing) Initialism of single-byte character set.


SCSU

w:Standard Compression Scheme for Unicode

(computing) Initialism of Standard Compression Scheme for Unicode.


break the Internet

en-verb

break the Internet (third-person singular simple present breaks the Internet, present participle breaking the Internet, simple past broke the Internet, past participle broken the Internet)

breaks the Internet (present singular third-person)
breaking the Internet (participle present)
broke the Internet (past)
broken the Internet (participle past)

Early use of the phrase (circa the mid-1990s) refers to literally breaking the Internet connection of a single device. It also refers to breaking the World Wide Web or the Internet itself, with the implication that it would be impossible or implausible to do so in most ordinary contexts.
A figurative usage of the phrase emerged in the early 2000s. Rather than the Internet or an Internet connection literally breaking, the figurative meaning describes a web server becoming overwhelmed by a surge in organic, non-malicious web traffic. It can also describe a deliberate, malicious attempt to overwhelm a web server, as in a denial-of-service attack or other cyberattack.
In the early 2010s, "break the internet" developed a secondary figurative usage in Internet slang. Similar to "going viral", the slang usage refers to behavior that causes a dramatic increase in web traffic or social media commentary, especially when the behavior was ostentatious or controversial. The phrase was famously used on the November 2014 issue of Paper magazine, titled "Break the Internet" and featuring American celebrity Kim Kardashian on the cover. The magazine was not the first to use the phrase in this sense, but it did popularize it.

“Well furnished Dahlings, don't all rush on at once as you might break the internet, but The Conran Shop has a new website!”

2001 Time Out (cited in 2016 Merriam-Webster.com, "Words We're Watching: Break the Internet")

(computing, idiomatic, figuratively, humorous) To overwhelm a web server through organic user-driven demand, such that the server goes offline or is in danger of doing so.

(computing, idiomatic, figuratively) To deliberately overwhelm a web server through a cyberattack such as a DDOS, such that the server goes offline or is in danger of doing so.


filemark

(computing) A special value used on computer tape to separate individual files.


setmark

(computing) A special value used on computer tape to separate sets of files.


technical debt

en-noun

technical debt (countable and uncountable, plural technical debts)

An important attribute of technical debt is that it grows in an unpredictable, nonlinear fashion. Each bit of technical debt, when added to the pool of existing technical debt, might do significantly more harm than the size of that new debt might imply.

2012, Kenneth S. Rubin, Essential Scrum, Addison-Wesley, →ISBN, page 142:

(software engineering) The implied cost of additional future work caused by choosing an easy but inferior solution originally.


dollar auction

Among the most terrifying of all dollar auctions followed World War II, when the United States and the Soviet Union entered into an arms race to produce more sophisticated and destructive weapons.

2012, Robert Dodge, Schelling's Game Theory: How to Make Decisions, page 117:

(game theory) A non-zero-sum sequential game designed to illustrate a paradox brought about by traditional rational-choice theory in which players are compelled to make an ultimately irrational decision based entirely on a sequence of apparently rational choices made throughout the game. It involves an auction for a dollar bill where the second-highest bidder loses the amount that they bid, making them the biggest loser in the auction.


post-PC

[Tim] Cook devoted the beginning of the event to talking about Apple's vision of a "post-PC" world, one in which your primary computer doesn't have a mouse or a keyboard. This chart shows the success of that vision. And this is just the beginning.

2012 March 7, Alexis C. Madrigal, “The Single Chart That Proves Tim Cook Is Right About the Post-PC World”, in The Atlantic:

(computing) After the decline of the personal computer in favour of mobile devices.


unlisten

en-verb

unlisten (third-person singular simple present unlistens, present participle unlistening, simple past and past participle unlistened)

unlistens (present singular third-person)
unlistening (participle present)
unlistened (participle past)
unlistened (past)

(computing) To cease to listen for incoming signals.


untalk

untalk (third-person singular simple present untalks, present participle untalking, simple past and past participle untalked)

untalks (present singular third-person)
untalking (participle present)
untalked (participle past)
untalked (past)

(computing) To cease to transmit signals.


unedit

unedit (third-person singular simple present unedits, present participle unediting, simple past and past participle unedited)

unedits (present singular third-person)
unediting (participle present)
unedited (participle past)
unedited (past)

(computing, transitive) To release a file that was being edited, without saving any changes that were made.


eigenSNP

(bioinformatics) A mathematical abstraction of a single-nucleotide polymorphism that is associated with an eigenvector


IDEF

Initialisms. The software-engineering term originally stood for ICAM definition but was given the new expansion integration definition in 1999.

(software engineering) A family of modelling languages in the field of systems and software engineering.


unmigrate

unmigrate (third-person singular simple present unmigrates, present participle unmigrating, simple past and past participle unmigrated)

unmigrates (present singular third-person)
unmigrating (participle present)
unmigrated (participle past)
unmigrated (past)

I could “unmigrate” the tapes, and that would take a while, but it wasn't that much of a nuisance and it helped keep the mainframe's disks free.

2011, Mark Minasi, Rhonda Layfield, John Paul Mueller, Mastering Windows Server 2008 Networking Foundations, page 6-168:

(computing, rare) To reverse the process of migration; to switch back to an older system.


subvariable

(computing) A variable that controls an inner loop


UPGMA

(phylogenetics, bioinformatics) Initialism of Unweighted Pair Group Method with Arithmetic Mean.


WPGMA

(phylogenetics, bioinformatics) Initialism of Weighted Pair Group Method with Arithmetic Mean.


metric-compatible

en-adj

metric-compatible (comparative more metric-compatible, superlative most metric-compatible)

more metric-compatible (comparative)
most metric-compatible (superlative)

(typography, computing) Of a font, having identical metrics as another font, enabling it to serve as a substitute for another font without affecting document layout.


greedy property

It has the greedy property (difficult to prove in time-critical contest environment!). If we make a choice that seems like the best at the moment and proceed to solve the remaining subproblem, we reach the optimal solution. We will never have to reconsider our previous choices.

2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89:

Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure, making techniques like dynamic programming inapplicable.

2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 25:

(computer science) The property of being globally solvable optimally by making optimal decisions locally.


dynamic programming

Coined by American mathematician Richard E. Bellman in the 1940s.

coinage

The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.

1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, →ISBN, page 73:

Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.

2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press, →ISBN:

optimal substructure
optimal substructure

(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.


BTS

(software) Initialism of bug tracking system.


hash buster

(computing) A program or algorithm that randomly adds characters to data in order to change its hash sum, typically to get around spam filters.


succ

You can follow the pointer to see that we got it right, so that each succ and prev points to the right god.

2014, Bjarne Stroustrup, Programming: Principles and Practice Using C++, page 614:

(chiefly programming) Abbreviation of successor.


viewlet

content management system
content management system

(computing) In certain content management systems, a region of a page where customizable content can be rendered.


portal rendering

(computer graphics) An algorithm for determining the visibility of objects in a three-dimensional world, based on partitioning the space into polygonal, generally convex regions that can be used to form generalizations about the visibility of objects within those regions.


thenable

(programming) An object or function that exposes a then method returning a promise.


polynomial basis

en-noun

polynomial basis (plural polynomial bases)

When using polynomial bases, the first stage in computing the product of two elements of #92;mathbbF#95;#123;2ⁿ#125; is the multiplication of two polynomials of degree at most n-1 in #92;mathbbF#95;2#91;x#93;.

1999, I. Blake, G. Seroussi, N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, page 20:

2010, Vladimir Tujillo-Olaya, Jaime Velasco-Medina, Hardware Architectures for Elliptic Curve Cryptoprocessors Using Polynomial and Gaussian Normal Basis Over GF(2²³³), Marina L. Gravrilova, C. J. Kenneth Tan, Edward David Moreno (editors), Transactions on Computational Science XI: Special Issue on Security in Computing, Part 2, Springer, LNCS 6480, page 79,
In this case, the GF(2ᵐ) multiplication is implemented in hardware using three algorithms for polynomial basis (PB) and three for gaussian normal basis (GNB).

In contrast to the case of normal bases considered in Theorem 5.1.9, the dual basis of a polynomial basis is usually not a polynomial basis.
[…]
5.1.13 Theorem [1265, 1298] Let #92;theta be a root of a monic irreducible polynomial f of degree m over K#61;#92;mathbbF#95;q, and let B#61;#92;#123;1,#92;theta,#92;theta²,#92;dots#92;theta#123;m-1#125;#92;#125; be the corresponding polynomial basis of F#61;#92;mathbbF#95;#123;qᵐ#125; over K. Then the dual basis B#42; of B is a polynomial basis if and only if f is a binomial and m#92;equiv 1#92;#33;#92;#33;#92;#33;#92;#33;#92;pmodp, where q is a power of the prime p.
5.1.14 Corollary There exists a dual pair of polynomial bases of #92;mathbbF#95;#123;qᵐ#125; over #92;mathbbF#95;q if and only if the following three conditions are satisfied:[…].

2013, Gary L. Mullen, Daniel Panario, Handbook of Finite Fields, Taylor & Francis (Chapman & Hall / CRC Press), page 103:

primitive polynomial
primitive polynomial

(algebra, field theory, cryptography, of a finite field) Specifically, a basis, of the form {1, α, ..., αⁿ⁻¹}, of a finite extension F_(qⁿ) of a Galois field F_q, where α is a primitive element of F_(qⁿ) (i.e., a root of a degree-n primitive polynomial over F_q).


unapprove

en-verb

unapprove (third-person singular simple present unapproves, present participle unapproving, simple past and past participle unapproved)

unapproves (present singular third-person)
unapproving (participle present)
unapproved (participle past)
unapproved (past)

With WordPress.com you can approve, mark as spam, unapprove, or delete comments.

2009, Mark William Bell, Build a Website for Free:

(computing, transitive) To rescind the approval of something; to mark as no longer approved; reject.


DSDD

(computing, of a diskette) Initialism of double-sided, double density.


chameleon schema

en-noun

chameleon schema (plural chameleon schemas)

(computing) An XML schema with no target namespace.


free list

(programming) A data structure, used in dynamic memory allocation, that connects free (unallocated) regions of memory together in a linked list.


vendorspeak

(computing, slang) The jargon used by vendors.


PAPR

(signal processing) Initialism of peak-to-average power ratio.


ones and zeroes

/ˈwʌnz n̩ ˈzɪəɹəʊz/

From the fact that the numerals 1 (one) and 0 (zero) are used to indicate binary numbers.

The incoming signals were broken down into digital code—ones and zeroes—by a relatively simple computer and downlinked to Fort Huachuca, where another computer of vastly greater power examined the bits of raw information and tried to make sense of them.

1989 August 17, Tom Clancy, Clear and Present Danger, New York, N.Y.: G[eorge] P[almer] Putnam’s Sons, →ISBN; Berkley premium tie-in edition, New York, N.Y.: Berkley Books, November 2018, →ISBN, page 360:

The so-called higher level programming languages, like the various dialects of BASIC and PASCAL familiar to students in the 1980s, greatly simplified the business of programming, since it is no longer necessary—at least for certain purposes—to do what is now called "machine language programming," or what in earlier days was programming, i.e., employing the ones and zeroes now frequently viewed as rather tedious and theoretical [...]

1990, G. E. Scott, “Malleable Persons”, in Moral Personhood: An Essay in the Philosophy of Moral Psychology (SUNY Series in Ethical Theory), Albany, N.Y.: State University of New York Press, →ISBN, page 40:

Hiro Protagonist [in Snow Crash (1992) by Neal Stephenson] must win, one might say, on both Surf and Turf against the wonderfully evil Evangelist Minister R. Bob Riff and his allies, both in the world of violence, swordplay, and aircraft carriers and in the world of ones and zeros.

1996, R[obert] James Woolsey [Jr.], “Resilience and Vulnerability in the Digital Age”, in Stuart J. D. Schwartzstein, editor, The Information Revolution and National Security: Dimensions and Directions (Significant Issues Series; vol. XVIII, no. 3), Washington, D.C.: Center for Strategic and International Studies, →ISBN, →ISSN, page 79:

Now one must also: [...] be able to discern or possess a device that is able to discern the ones and zeroes on the storage medium, [...]

1998, Doug Carlston, “Storing Knowledge”, in Margaret MacLean, Ben H. Davis, editors, Time & Bits: Managing Digital Continuity, Los Angeles, Calif.: Getty Conservation Institute, →ISBN, page 24:

But suppose there is a special and universal and innate language for thinking. Suppose, in particular, that just as computers have a language of ones and zeroes that underlies all of their programs and applications, there is an equally fundamental language shared by all humans: a language of thought (lot) [...].

2001, Andrew Brook, Robert J. Stainton, “Knowledge of Language”, in Knowledge and Mind: A Philosophical Introduction (A Bradford Book), 1st paperback edition, Cambridge, Mass.: MIT Press, →ISBN, pages 54–55:

You once said that the "ones and zeros" in the world's computers were demons that could trick the human race into losing all its history.

2007, Henning Mankell, chapter 8, in Laurie Thompson, transl., Kennedy’s Brain: Translated from the Swedish, New York, N.Y.: The New Press, →ISBN, part 1 (Christ’s Cul-de-sac), page 83:

If you are a developer or an architect, you are one for a good reason: Your magic and craft is turning ones and zeros into a solution that makes life and work better.

2008, Steven C. Seow, “Preface”, in Karen Gettman, editor, Designing and Engineering Time: The Psychology of Time Perception in Software, Upper Saddle River, N.J., Boston, Mass.: Addison-Wesley, →ISBN, page xvii:

Neo has been hacking since he was in elementary school. He is more at ease with ones and zeros than his own language.

2012, Wayne M. Smith, “The Wraith of Frank—Cyber War Style”, in The Sand Castle, [Bloomington, Ind.]: Xlibris, →ISBN, pages 99–100:

If the movie [Ralph Breaks the Internet] never falls into a feedback loop, credit should probably go to [John C.] Reilly and especially [Sarah] Silverman, who bring human vulnerability to little bits of ultra-branded ones and zeroes.

2018 November 14, Jesse Hassenger, “Disney Goes Viral with an Ambitious, Overstuffed Wreck-It Ralph Sequel”, in The A.V. Club, archived from the original on 2019-11-21:

(computing, informal) Binary code; on and off bits.


awaitable

(programming) Able to be executed in an asynchronous manner, with the caller receiving any result at a later stage.


awaitable

(programming) An operation that can be executed in an asynchronous manner, with the caller receiving any result at a later stage.


logpoint

(programming, rare) A point in program code at which a message is logged for debugging.


pseudovalue

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

Each observer's data generates a pseudovalue of perceptual accuracy and the set of pseudovalues are treated as if they are independent and identically distributed.

2013, William Thomson, Peter N. T. Wells, The Perception of Visual Information, page 264:

In traditional databases, missing information is mostly handled by means of a pseudovalue, called a null value […]

2015, Janusz Kacprzyk, Witold Pedrycz, Springer Handbook of Computational Intelligence, page 300:

(mathematics, computing) Something that resembles a value but is not a true value or does not really belong to the set of data being studied.


open sourceror

Rather, just as a cracker can be an open sourceror and vice versa, so many of the identities I am about to outline can be taken up by the same person at the same time, or be passed through over different times.

2008, Tim Jordan, Hacking: Digital Media and Technological Determinism, →ISBN, page 70:

Whereas a free sourceror wouldn't be caught dead using anything other than (GNU) Linux, open sourcerors are happy to use whatever works.

2015 June 3, Mat Asay, “Open source vs. Apple: The holy war that wasn't”, in Tech Republic:

(informal, computing) A programmer who works only on open source programs.


sourcerer

(see title)

2013 October 2, Dan Gillmor, “In praise of Richard Stallman, GNU's open sourcerer”, in The Guardian:

(informal, computing) A programmer, a coder, someone who works with source code.


covert channel

The term was introduced in 1973 by Butler Lampson.

(computing) A means of transferring information objects between processes that are not supposed to be allowed to communicate according to the security policy.


notch filter

(signal processing) A bandstop filter with a narrow stopband.


title bar

graphical user interface
graphical user interface

(graphical user interface) The bar at the top of a window or a dialogue box displaying the name of the application or open document.


bucket rendering

(computer graphics) The rendering of a graphical scene in a number of portions ("buckets") that can be assigned to different processors to take advantage of parallelism.


shadow volume

shadow volume (countable and uncountable, plural shadow volumes)

(computer graphics) The spatial volume resulting from the projection of a ray from a light source through each vertex of a shadow-casting object to some point (generally at infinity); used in adding accurate shadows to a rendered scene.


megaword

(computing) A unit of storage or capacity equal to 10⁶ (or 2²⁰) words


gameport

(computing) A hardware port for communication with a game controller.


freelist

(programming) Alternative form of free list


false sharing

(computing theory) A performance-degrading usage pattern where the size of units in a cache means that the system may reload entire units even when it is not necessary.


readset

(computing) The set of records read from a database, typically by a single transaction


-vac

(obsolete, marketing, science fiction, computing, mid-20th century) Used in the naming of computer systems and computer models, due to the use of vacuum tubes as the functional elements of computers of the time.


JB

(slang, computing) Initialism of jailbreak.

(slang, computing, Android) Initialism of jelly bean.


shatter attack

Coined in a 2002 paper by Chris Paget: "Exploiting design flaws in the Win32 API for privilege escalation".

(computing, Microsoft Windows) A means of bypassing security restrictions between processes in a session by having a less privileged process inject code into the message loop of a more privileged one.


kebab case

In allusion to the appearance of a shish kebab, with various food items assembled on a skewer. Additionally, the coincidence that kebabs and camels are both archetypally Near Eastern was probably not lost on the computer programmers who coined the names kebab case and camel case.

(programming) The practice of writing identifiers using hyphens to separate words.


coachmark

(graphical user interface) A highlight or underline etc. indicating part of the user interface, to aid the user in learning how to use the system.


remotable

(programming) Offering support for remoting.


undersubscribe

en-verb

undersubscribe (third-person singular simple present undersubscribes, present participle undersubscribing, simple past and past participle undersubscribed)

undersubscribes (present singular third-person)
undersubscribing (participle present)
undersubscribed (participle past)
undersubscribed (past)

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

This forces the agent to either oversubscribe itself by submitting jobs to multiple queues at once or undersubscribe itself by submitting jobs to potentially long queues.

2003, Fran Berman, Geoffrey Fox, Tony Hey, Grid Computing: Making the Global Infrastructure a Reality, →ISBN, page 311:

First, the number of available hardware threads varies from platform to platform, so the ideal number of threads on one machine may undersubscribe or oversubscribe the threads on a different machine.

2009, Kaushik Datta, Auto-tuning Stencil Codes for Cache-based Multicore Platforms:

(computing) To have insufficient threads available in a multithreaded application so that all threads become blocked and performance suffers.

In this way, MSPs can have the flexibility to oversubscribe lower-priority classes or even undersubscribe higher-priority traffic to meet tight QoS/SLA requirements.

2004, Nam-Kee Tan, MPLS for Metropolitan Area Networks, →ISBN, page 384:

(computing) To employ more switch ports than necessary so that high-priority traffic is sure to be handled right away.


undersubscription

en-noun

undersubscription (countable and uncountable, plural undersubscriptions)

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

End-to-end QoS along with appropriate bandwidth provisioning specifically for Intra-Cluster Communication Signaling (ICCS) is required. Overprovisioning and undersubscription of bandwidth is recommended.

2014, Akhil Behl, CCIE Collaboration Quick Reference, →ISBN:

(computing) The employment of more ports or bandwidth than necessary to ensure that network communication does not face delays.

When there are not enough running threads to optimally exploit available PEs undersubscription occurs, resulting in a waste of performance.

2012, Victor Pankratius, Michael Philippsen, Multicore Software Engineering, Performance and Tools, →ISBN:

(computing) The failure to provide sufficient threads in a multithreaded application.


SFINAE

substitution failure is not an error
w:substitution failure is not an error

(programming) Initialism of substitution failure is not an error.


Parrondo's paradox

(game theory) The paradox whereby a combination of losing strategies (such as alternating between two games that each, played individually, would result in an overall loss) may give a winning strategy.


Amdahl's law

Named after American computer scientist Gene Amdahl (1922–2015).

named-after

We can use Amdahl's law to estimate performance improvements when we know the time consumed for some function and its potential speedup.

2011, David A. Patterson, John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Elsevier, →ISBN, page 52:

(computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved.


Gustafson's law

Named after computer scientist John L. Gustafson.

(computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed execution time that can be expected of a system whose resources are improved.


card reader

(computing) A data input device that reads data from a card-shaped storage medium.


layer 8

(humorous, networking) OSI layer 8; the users of a computer network.


big bang testing

software engineering
software engineering

(software engineering) A form of integration testing in which the individual modules are linked together and tested as a whole, without first being tested independently.


sandwich testing

(software engineering) A hybrid form of integration testing that combines top-down and bottom-up approaches.


Bondareva-Shapley theorem

Formulated independently by Olga Bondareva and Lloyd Shapley in the 1960s.

characteristic function
characteristic function

(game theory) A theorem that describes a necessary and sufficient condition for the non-emptiness of the core of a cooperative game in characteristic function form. The game's core is non-empty if and only if the game is balanced.


interclick

(computing) A click of one button while another is already being held down.


DSA

Digital Signature Algorithm
w:Digital Signature Algorithm

(cryptography) Initialism of Digital Signature Algorithm.


constant morphism

en-noun

constant morphism (plural constant morphisms)

Any morphism to a zero object must be constant.

(category theory) A morphism which yields the same morphism when post-composed with either one of a parallel pair of morphisms.


coconstant morphism

coconstant morphism (plural coconstant morphisms)

(category theory) A morphism which yields the same morphism when pre-composed with either one of a parallel pair of morphisms.


zero morphism

The composition of a zero morphism with any morphism (that it is composable with) yields another zero morphism.

(category theory) A morphism which is both a constant morphism and a coconstant morphism.


random forest

(computing) A structure composed of a collection of decision trees with controlled variance


subrow

(computing) A secondary or subordinate row; a row belonging to some other parent row.


sandboxer

(computing) A process that sandboxes others.


autoalgorithm

(computing) An algorithm that is invoked automatically


pseudohandle

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

(programming) A special value that can be treated as a handle (e.g. to identify a process) but is not a true handle.


malcode

From mal- + code, presumably modelled on earlier malware.


unjar

en-verb

unjar (third-person singular simple present unjars, present participle unjarring, simple past and past participle unjarred)

unjars (present singular third-person)
unjarring (participle present)
unjarred (participle past)
unjarred (past)

Downloading and unzipping/unjarring the documentation is surprisingly not what you do.

2006, John Zukowski, Java 6 Platform Revealed, page 205:

(computing) To extract data from a JAR (Java archive) file.


PPA

(computing) Initialism of Personal Package Archive (software repository for managing source packages in Ubuntu)


metaserver

(computing) A hardware or software system that uses a group of other servers to obtain results


deorphaned

(mathematics, computing) From which orphans have been removed


subproperty

The Origin property represents a coordinate and has X and Y subproperties.

(chiefly programming) A property of another property.


Elvis operator

The notation ?: humorously reinterpreted as an emoticon representing the eyes and hairstyle of Elvis Presley.

(programming, informal) A binary operator that returns its first operand if that operand evaluates to true, and otherwise evaluates and returns its second operand.


pachinko allocation

(computing theory) In machine learning and natural language processing, a suite of algorithms to determine the thematic structure of a collection of documents by modelling correlations between topics in addition to the word correlations that constitute topics.


British Museum algorithm

the British Museum algorithm (canonical)

Named by Newell, Shaw, and Simon in allusion to the inefficient idea of placing monkeys in front of typewriters in order to reproduce all the books in the British Museum.

(computing) A search procedure which involves generating and checking all possible scenarios.


BPB

en-noun

BPB (countable and uncountable, plural BPBs)

(computing, countable) Initialism of BIOS parameter block.


flicker fixer

(computing) A piece of computer hardware that deinterlaces an output video signal, resulting in a less flickery display on some systems.


bug scrub

(software engineering) A regular meeting to discuss and triage unfixed problems in the software.


Yoda condition

/ˌjəʊdə kənˈdɪʃn̩/

/ˌjəʊdə kənˈdɪʃən/

An allusion to the somewhat grammatically reversed speech style of Yoda, a character in the Star Wars franchise—for example, “Truly wonderful, the mind of a child is.” The term was possibly coined by Félix Cloutier (username “zneak”) in 2010, based on Yoda notation which is claimed to have been coined by Thomas M. Tuerke and published online in 2006.

A great convention to stick to, the Yoda condition requires you to keep the comparison variable on the right side of the conditional statement.

2013, Adam Onishi, “Getting Started”, in Pro WordPress Theme Development, Berkeley, Calif.: Apress, Springer Nature, →ISBN, page 14:

A computer programmer is trying to explain a recent problem to a journalist friend, and she says, "This jimmy had put in Yoda conditions and had been refactoring my previous work so that in the end it was just hooker code." The journalist friend looks baffled.

2014, Kirk Hazen, “The Winding Paths of Language in Education”, in An Introduction to Language (Linguistics in the World), Malden, Mass.: Wiley-Blackwell, →ISBN, page 331:

// what happens if the debug parameter is removed // from the request and becomes a null? // should really be using a Yoda Condition here ;)

2015, Jim Manico, August Detlefsen, “Access Control”, in Iron-clad Java: Building Secure Web Applications (Oracle Press), New York, N.Y.: McGraw-Hill Education, →ISBN, page 66:

Writing if(isHungry = true) by accident will set isHungry to true every time the if statement is hit! To avoid this possibility, we can just write if(isHungry). Alternatively, some (wise) people use what are called Yoda conditions to check an if statement: if(true == isHungry). The reason we write the if statement in this way is that, if we accidentally write if(true = isHungry), this will generate a compiler error, catching the mistake.

2015 February, William Sherif, “If, Else, and Switch”, in Learning C++ by Creating Games with UE4: Learn C++ Programming with a Fun, Real-world Application that Allows You to Create Your Own Games!, Birmingham, West Midlands: Packt Publishing, →ISBN, page 48:

Leo grimaces at Caleb. "I never asked—how did you figure it out?" / "Yoda conditions. You may as well have signed your name." At my blank look, Caleb says, "Your boyfriend writes his code backwards."

2020, Amy Noelle Parks, “Evie”, in The Quantum Weirdness of the Almost-kiss, New York, N.Y.: Amulet Books, Abrams Books, →ISBN:

Programmers normally write conditions such as x == 7 with the variable name (an lvalue) on the left and the literal (an rvalue) on the right. Placing the literal on the left, as in 7 == x (which is syntactically correct and is sometimes called a "Yoda condition"), enables the compiler to issue an error if you accidentally replace the == operator with =. The compiler treats this as a compilation error because you can't change a literal's value.

2022, Paul Deitel, Harvey Deitel, C++20 for Programmers: An Objects-natural Approach (Deitel Developer Series), Boston, Mass.: Pearson Prentice Hall, →ISBN:

(programming, informal) A logical condition with the usual order of operands reversed for various reasons, such as avoiding accidental misuse of = (assignment) instead of == (equality), a mistake that is harder to spot when using the normal order of operands.

Star Wars: Episode II – Attack of the Clones


Knuth-Morris-Pratt algorithm

the Knuth-Morris-Pratt algorithm (canonical)

The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.

(computing theory) A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked.


linear time

(computing theory) The time complexity, denoted O(n), of an algorithm whose running time increases at most linearly with the size of the input.


literate programming

(programming) A programming paradigm in which a program is given as an explanation of the program logic in a natural language (such as English), interspersed with snippets of macros and traditional source code, from which compilable representation can be generated.


hyperfairness

(game theory) The property of being hyperfair.


metatile

(computer graphics) Synonym of supertile


file carving

(computing) The process of reassembling computer files from fragments in the absence of file system metadata, based on the extrapolation of a file's probable type from its contents.


user story

(software engineering) In software development, a natural language description of how an end user uses a system feature.


metasequence

(computing) A sequence of characters having a similar role to a metacharacter.


WAW

(computing) Initialism of write after write, a kind of data hazard.


gronk

en-verb

gronk (third-person singular simple present gronks, present participle gronking, simple past and past participle gronked)

gronks (present singular third-person)
gronking (participle present)
gronked (participle past)
gronked (past)

They say a good detective always starts at the beginning, so I installed the program on my VGA PC's hard drive. As the computer gronked away, copying six 5¼-inch floppies, I wondered why, if bad detectives start at the end, […]

1990, Compute, volume 12, numbers 1-5, page 62:

[…] a disk drive gronked, her screen bloomed, and suddenly there was an icon in the upper right corner.

1993, Iris Forrest, Computer Tales of Fact and Fantasy:

The next startup event is the computer's attempt to read a disk in drive A. But, there is no disk in drive A, remember? You were supposed to remove any disk in this drive. So, you hear a lot of pathetic gronking and grakking until the computer gives up […]

(computing, slang, intransitive) Of a floppy disk drive: to produce mechanical sounds of operation.

Repeats the last 40 lines of IRC output, in case your terminal gronked.

1992, Charlottesville Computer Users' Group: CCUG:

The other faction centered on […] what went on under the [model railway] layout. This was The System, […] and it was constantly being improved, revamped, perfected, and sometimes "gronked"—in club jargon, screwed up.

2010, Steven Levy, Hackers: Heroes of the Computer Revolution (25th Anniversary Edition)

(computing, slang, intransitive, rare) To fail; to crash or go wrong.


access method

(computing) A method or means, usually a software or hardware component of a mainframe, to access data on an external storage device.


hypernetworked

en-adj

hypernetworked (comparative more hypernetworked, superlative most hypernetworked)

more hypernetworked (comparative)
most hypernetworked (superlative)

As a non-neutral action, the work of capturing also scales differently in different locales. This is exaggerated in the context of a hyper-networked world where elements of data can travel the globe nearly instantaneously.

2014, Roger Lee, Noel Castree, Rob Kitchin, The SAGE Handbook of Human Geography, 2v:

(networking) Making intensive use of computer networks.


superinformation highway

en-noun

superinformation highway (plural superinformation highways)

information superhighway
information superhighway#English

(dated, computing) Synonym of information superhighway


Comba multiplication

(computing theory) An efficient multiplication algorithm for large numbers.


appendable

an appendable file

(computing) That can be extended by appending to it.


EoP

(computing) Initialism of elevation of privilege.


CISSP

information system
information system#English

(computing) Initialism of certified information systems security professional.


bozosity

(slang, chiefly computing) The behaviour of a bozo; idiocy.


RMW

(computing) Initialism of read–modify–write.


user time

(computing) The time required for a user to perform a task using a computer, excluding the time when the computer is busy processing.


pageability

(computing) The quality of being pageable.


(computing) Unicode Transformation Format-7; a variable-length character encoding designed for 7-bit channels.


eigenbrain

(mathematics, computing) One of a set of eigenvectors used in visual recognition systems to represent a person's brain.


unexecution

(computing) The undoing of a command or operation previously executed.


RVO

(programming) Initialism of return value optimization.


idiot tape

(computing, historical, informal) A basic form of computer tape that holds unjustified text, and is later processed automatically by a machine that determines where line breaks should appear in the properly formatted output.


WHP

(mathematics, computer science) Initialism of with high probability.


intelligent terminal

intelligent terminal (plural intelligent terminals)

(computing) A computer terminal capable of doing its own local processing, rather than merely sending input to and receiving output from some other linked system.


quaject

(computing theory) An object-like data structure containing both data and code (or pointers to code), typically used as an abstraction to manage self-modifying code.


coverage analysis

coverage analysis (countable and uncountable, plural coverage analyses)

(computing) A part of computerised stock control that identifies the minimum stock needed to avoid shortage.


stringable

en-adj

stringable (comparative more stringable, superlative most stringable)

more stringable (comparative)
most stringable (superlative)

(programming) Able to be converted to a string of text characters.


microwalk

en-verb

microwalk (third-person singular simple present microwalks, present participle microwalking, simple past and past participle microwalked)

microwalks (present singular third-person)
microwalking (participle present)
microwalked (participle past)
microwalked (past)

(robotics) To walk using very small steps


microwalking

(robotics) walking using very short steps


switchport

(networking) An interface on a network switch.


subsearch

(chiefly computing) A secondary or subsidiary search.


multipolygon

(computer graphics) A collection of polygons treated as a single object.


geoenabled

(computing) Supporting geographic features such as mapping.


uniprogramming

(computing) The execution of a single program at a time.


synonymizer

(computing, rare) A piece of software that replaces words in a provided text with words of a similar meaning.


regular language

en-noun

regular language (plural regular languages)

There is an interesting way to get the negation (complement) of a regular language L defined by a FS automaton, provided the automaton is ε-free.

2007, Dick Grune, Ceriel J.H. Jacobs, Parsing Techniques: A Practical Guide, Springer Science & Business Media, →ISBN, page 152:

A regular language is one that can be generated by a regular grammar or finite-state automaton, the lowest level of the Chomsky hierarchy. It is well known that these grammars are inadequate to represent natural language syntax.

2014, Brian MacWhinney, William O'Grady, The Handbook of Language Emergence, John Wiley & Sons, →ISBN, page 393:

finite-state machine
finite-state machine

(computer science) A formal language that can be expressed using a regular expression or finite-state machine.


finite-state machine

finite-state machine (plural finite-state machines)

(computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another.


noise word

For example, in the COBOL goto statement, written GO TO , the keyword GO is required, but TO is an optional noise word which carries no information and is used only to improve readability.

1975, Terrence W. Pratt, Programming Languages: Design and Implementation, page 381:

(programming) A word that may be included in source code for clarity but does not change the meaning.

(computing) A stop word, one ignored in search queries etc.


shunting-yard algorithm

By analogy to the operations in a railroad shunting yard.

(computing theory) A method for parsing mathematical expressions specified in infix notation.


isopreference

(computing, of an image) Having a constant subjective quality


ERCS

Extended Reference Concrete Syntax
w:Extended Reference Concrete Syntax

(computing) Initialism of Extended Reference Concrete Syntax.


cyberdiversity

Melissa suggests that cyberdiversity akin to biodiversity is a much more sensible strategy, because it was precisely the prevailing monoculture that was affected by Melissa — as had been expected.

1999, US Congress, Committee on Science, Subcommittee on Technology, The Melissa virus: inoculating our information technology from emerging threats:

Formats of activities and closed, inalterable, preserved objects, will give way, either because of their own material condition or because of the protection of regulations, to works that, because of the way they are conceived, will be capable of havingtheir pieces extracted and recombined amongst themselves or with others obtained from the bulk offerings. This recombination will also propel cyberdiversity (when biodiversity on this side of the mirror is in decline).

2014, AC/E Digital Culture Annual Report 2014: Focus 2014: The Use of New:

(computing) Diversity of computerised data or formats.


cybertaxonomic

(computing, taxonomy) Relating to cybertaxonomy


hydroinformatic

(computing) Relating to hydroinformatics


hydroinformatics

(computing) The branch of informatics dealing with water management


Grover's algorithm

Named after Indian-American computer scientist Lov Grover, who devised the algorithm in 1996.

2006, E. Arikan, 22: An Upper Bound on the Rate of Information Transfer by Grover's Algorithm, Rudolf Ahlswede et al. (editors), General Theory of Information Transfer and Combinatorics, Springer, LNCS 4123, page 452,
Thus, Grover's algorithm has optimal order of complexity. Here, we present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up by Grover's algorithm is the best possible by any algorithm using the same quantum oracle.

2018, Joseph F. Fitzsimons, Eleanor G. Rieffel, Valerio Scarani, 11: Quantum Frontier, Justyna Zander, Pieter J. Mosterman (editors), Computation for Humanity, Taylor & Francis (CRC Press), page 286,
The best possible classical algorithm uses O(N) time. This speed up is only polynomial, but, unlike for Shor's algorithm, it has been proven that Grover's algorithm outperforms any possible classical approach.

|Q_A⟩=Gʳ|Ψ(0)⟩≈ sin ((2r+1)ϕ)1/√∑_( mathit )solutions|y⟩ (3.59)
where the probability of finding a nonsolution is presumed to be small and has been neglected in the equation.

2022 [2008 Morgan & Claypool], Marco Lanzagorta, Jeffrey Uhlmann, Quantum Computer Science, Springer Nature, page 49, However, we cannot output the entire solution dataset using a single application of Grover's algorithm. Indeed, the superposition of states for the last iteration of Grover's algorithm, with known k, looks like

(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value.


Suurballe's algorithm

Devised by John W. Suurballe and published in 1974.

(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.


ISE

(computing, countable) Initialism of integrated scripting environment.


submatch

As you examine a specific candidate String, the Matcher can keep track of submatches for that expression.

2008, Mehran Habibi, Java Regular Expressions: Taming the java.util.regex Engine, page 71:

(computing) A match forming part of a larger match, for example in a text string being searched.


rect

(computer graphics) Short for rectangle.


unreservation

(chiefly computing) The undoing or cancellation of a reservation.


dereferencer

(programming) Any operator that dereferences something.


Numeronym presenting Kubernetes as "K" followed by 8 more letters, followed by "s".


treelist

The ILDASM main window displays a treelist of the assembly, like this: […]

2005, Andrew Whitechapel, Microsoft .NET Development for Microsoft Office, page 60:

If you recall, back in Chapter 2, we created a Hero Slider template that had a single field called Hero Images. It was a treelist with a data source pointing directly at the Media Library.

2016, Phil Wicklund, Jason Wilkerson, Professional Sitecore 8 Development:

(graphical user interface) A user interface control that displays a list of items in an expandable hierarchy.

(computing theory) A list of trees (the data structure).


edge computing

2019, Lex Boost, "Understanding the role and opportunities of edge computing" (Opinion), Information Management.
Enter edge computing, the practice of processing data at or near the source of the data, as opposed to relaying it to a centralized location, as is done with cloud computing.

Remember that edge computing refers to data that is processed on edge devices before the result goes to its destination, which could be on a public or private cloud.

2022, Sergio Mendez, Edge Computing Systems with Kubernetes, Packt Publishing Ltd, →ISBN, page 5:

(computing) The practice of processing or analyzing data at or near the point of data production rather than in a central processing facility requiring data transport to the central facility.


as-if rule

(programming) A rule by which compilers are allowed to apply any optimizing transformation to a program provided that it makes no change to the observable behavior of the program.


NOP sled

(programming) A series of identical values in memory that instruct the CPU to take no action and proceed to the next instruction, used in shellcode etc. to increase the chances of any random instruction access executing the sequence that follows.


rahmonic

From harmonic with the first syllable reversed, like cepstrum from spectrum.

(signal processing) A harmonic of a cepstrum.


gamnitude

From magnitude with the first syllable reversed, like cepstrum from spectrum.

(signal processing) A magnitude of a cepstrum.


Blum's speedup theorem

(computing theory) A fundamental theorem about the complexity of computable functions, stating that for any complexity measure there are computable functions that are not optimal with respect to that measure.


tasklet

(computing) A kind of simple task in some operating systems.


developer experience

developer experience (countable and uncountable, plural developer experiences)

In this paper, we discuss developer experience in terms of user experience (UX) and as a distinct concept and developers' needs as IDE users.

2015, Pekka Abrahamsson, Luis Corral, Markku Oivo, Barbara Russo, Product-Focused Software Process Improvement: 16th International Conference, PROFES 2015, Bolzano, Italy, December 2-4, 2015, Proceedings, Springer, →ISBN, page 547:

Yet another facet of your developer experience is this ability to deploy your application in a multitude of different environments.

2015, Zachariah Moreno, AngularJS Deployment Essentials, Packt Publishing Ltd, →ISBN, page 125:

(computing) A developer's feeling about their tools, processes, constrains etc, and how it impacts productivity.


geo-block

en-verb

geo-block (third-person singular simple present geo-blocks, present participle geo-blocking, simple past and past participle geo-blocked)

geo-blocks (present singular third-person)
geo-blocking (participle present)
geo-blocked (participle past)
geo-blocked (past)

(computing, Internet) To deny access to content to users from certain regions or countries using of geolocation software.


multitapered

(signal processing) Employing the multitaper technique.


trifan

(computer graphics) A set of triangles connected at a single point.


tristrip

(computer graphics) A strip formed by joining triangles.


CODASYL

(computing, historical) Acronym of Conference/Committee on Data Systems Languages.


shared-nothing

(computing) Of a distributed system or architecture: fulfilling each update request by a single node, so as to eliminate contention among nodes.


Barnsley fern

Named after the British mathematician Michael Barnsley, who first described it in his book Fractals Everywhere.

(computer graphics) A fern-like fractal involving four affine transformations.


epsilon-machine

From epsilon + machine. Coined by James Crutchfield and Karl Young in their 1989 paper “Inferring Statistical Complexity”.

With a direct measure of an ε'''-machine’s complexity, the theory gives a computation-theoretic foundation to the notions of model optimality and, most importantly, a measure of the computational complexity of estimated models.

1989, James Crutchfield, Karl Young, Inferring Statistical Complexity:

The ϵ'''-machine is the organization of the process, or at least of the part of it which is relevant to our measurements. It leads to a natural measure of the statistical complexity of processes, namely the amount of information needed to specify the state of the ϵ'''-machine. […] Using the ϵ'''-machine, we see that the causal states always form a Markov process. This is satisfying ideologically, and has interesting information-theoretic and ergodic consequences.

2001, Cosma Rohilla Shalizi, Causal Architecture, Complexity and Self-Organization in Time Series and Cellular Automata:

These predictors, called ε-machines, are a subset of a well known statistical model class called the Hidden Markov Model (HMM). Despite being a subset, ε-machines have several important advantages over traditional HMMs. This dissertation illustrates these advantages by applying ε-machines to several problems in computer security: anomaly-based intrusion detection in High Performance Computing (HPC) environments, automated protocol reverse engineering, and structural drift.

2010, Sean Harrison Whalen, Security applications of the epsilon-machine, abstract:

This article introduces both a new algorithm for reconstructing epsilon-machines from data, as well as the decisional states. These are defined as the internal states of a system that lead to the same decision, based on a user-provided utility or pay-off function. […] The intrinsic underlying structure of the system is modeled by an epsilon-machine and its causal states.

2011, Nicolas Brodu, “Reconstruction of epsilon-machines in predictive frameworks and decisional states”, in Advances in Complex Systems, volume 14, number 05:

(computational mechanics) A deterministic automaton consisting of a system of causal states and the transitions between them, functioning as the smallest possible maximally predictive model of a stochastic process


CRL

(computing) Initialism of certificate revocation list.


hookable

(computing) Able to be extended or modified by means of a software hook.


gigaop

(computing) One billion (10⁹) operations per second.


DVCS

(software) Initialism of data validation and certification server.

(software) Initialism of distributed version control system.


creepware

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

(computing, informal) Software covertly installed on a computer or device to allow its operation to be monitored and thus spy on the user's activity.


stalkerware

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

(computing, informal) Synonym of creepware


spouseware

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

From spouse + -ware, since it might be used to monitor a spouse suspected of unfaithfulness or similar.


aspect-oriented programming

(programming) A programming paradigm that aims to increase modularity by allowing the separation of cross-cutting concerns.


fusker

From Danish fusker (“a person covertly doing work outside official guilds”).

bor

(computing) A program or algorithm that downloads images or media from a web site that have not been publicly linked, based on guessing at similar URLs.


refetch

en-verb

refetch (third-person singular simple present refetches, present participle refetching, simple past and past participle refetched)

refetches (present singular third-person)
refetching (participle present)
refetched (participle past)
refetched (past)

(transitive, computing) To retrieve data previously stored in memory.


pocket computer

en-noun

pocket computer (plural pocket computers)

(computing, historical) A small portable computer with a screen capable of displaying only a few lines of text.


touchframe

(computing) A hardware overlay that adds touchscreen functionality to a monitor screen


clockable

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

Then if I completes its computational task in exactly α steps we say that the ordinal α is clockable. By the previous definition, any natural number is clockable. In addition, there are many other ordinals that are clockable.

2008, Apostolos Syropoulos, Hypercomputation: Computing Beyond the Church-Turing Barrier, →ISBN:

(computer science) Of an ordinal such that an infinite-time Turing machine can complete in so many steps of computation.


postfiller

(computing) In text processing systems, a pattern of text that is expected to occur after the portion of interest.


prefiller

(computing) In text processing systems, a pattern of text that is expected to occur before the portion of interest.


Rule 30

So named because 30 is the smallest Wolfram code that describes its rule set.

(cellular automata) A one-dimensional binary cellular automaton rule displaying aperiodic, chaotic behaviour.


Rule 184

So named because 184 is the rule's Wolfram code.

(cellular automata) A one-dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems.


Rule 90

So named because 90 is the rule's Wolfram code.

(cellular automata) An elementary cellular automaton based on the exclusive-or function.


write blocker

(computing) A hardware device that allows a computer to read a peripheral such as a hard disk without making any changes to its contents, useful in cyberforensics etc.


ALSA

Advanced Linux Sound Architecture
w:Advanced Linux Sound Architecture

(computing) Acronym of Advanced Linux Sound Architecture.


overfilter

It is clear that overfilters and underfilters are dual in the sense of the duality principle.

1999, Edward R. Dougherty, Jaakko Astola, Nonlinear Filters for Image Processing, page 180:

(signal processing) A morphological filter (idempotent operator) whose image is a superset of the domain.


(computing) A display device or item of content with approximately 5,000 pixels in the horizontal axis.


TLV

(computing) Initialism of type-length-value, a class of file formats that store a data type, the length of the data, and then the data itself.


underfilter

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

(signal processing) A morphological filter (idempotent operator) whose image is a subset of the domain.


Winchester disk

Winchester disk (plural Winchester disks)

Code name for the IBM 3340 Direct Access Storage Facility, named after the Winchester thirty-thirty rifle, a reference to its initial 2 × 30 MB storage capacity.


monoplatform

en-adj

monoplatform (comparative more monoplatform, superlative most monoplatform)

more monoplatform (comparative)
most monoplatform (superlative)


data race

(programming) A problematic situation where one thread could potentially read or write a memory location while another thread is writing to it.


Kotlin

Named after Kotlin Island (Russian Ко́тлин (Kótlin)), near St. Petersburg, by analogy to the related language Java, whose name ultimately comes from an Indonesian island.

programming language
programming language

(programming) A cross-platform, statically typed, general-purpose object-oriented programming language with type inference, designed to interoperate with Java.


deauth

(computing) A deauthentication frame in IEEE 802.11 Wi-Fi.


deauthentication

(computing) The invalidation of an existing authentication.


reverse shell

(computing) An interactive command shell initiated from a remote computer.


kWIPS

A machine which executes 5,000 KWIPS is often called a 5 MIPS machine in the performance jargon, which represents millions of Whetstones, not thousands.

1994, John R. Newport, Avionic Systems Design, CRC Press, →ISBN, page 192:

(computing) Initialism of kilo Whetstone instructions per second.


MWIPS

(computing) Initialism of million Whetstone instructions per second.


unpatch

en-verb

unpatch (third-person singular simple present unpatches, present participle unpatching, simple past and past participle unpatched)

unpatches (present singular third-person)
unpatching (participle present)
unpatched (participle past)
unpatched (past)

[…] to use these three commands, you have two options: change the defaults in Footnote, or use Debug to unpatch WordStar.

1983, PC Mag, volume 1, number 10, page 417:

If you can patch pointers, you can unpatch them as well. This affords you the ability to defragment memory, among other things […]

2011, Eric Lengyel, Game Engine Gems 2, page 347:

(computing, transitive, rare) To undo the process of patching; to remove a patch from.


payment terminal

en-noun

payment terminal (plural payment terminals)

(computer hardware) An electronic device which interfaces with payment cards to make electronic funds transfers.


self-executing

Downloadable software can be provided in several different formats. Some automatically install themselves, but others require manual procedures. A downloadable file typically is set up as a self-installing executable file, self-executing zip file, […]

2005, June Jamrich Parsons, Dan Oja, New Perspectives on Computer Concepts: Comprehensive, page 156:

The other commonly used method is a self-executing package where the installer and the update are bundled into a single executable.

2007, Bill Stackpole, Patrick Hanrion, Software Deployment, Updating, and Patching, page 310:

(computing) Consisting of a complete executable package that takes some action with the included data, rather than a pure data file requiring some additional tool to read it.


shell shoveling

(computing) The redirection of the shell to a remote service so that input can be entered and output received without being physically present.


GAFAM

(computing) Acronym of Google, Apple, Facebook, Amazon, Microsoft, a group of major computing companies.


SAML

(computing) Acronym of Security Assertion Markup Language.


geocomputing

(geography, computing) The use of computing in the geographic sciences


autocompile

en-verb

autocompile (third-person singular simple present autocompiles, present participle autocompiling, simple past and past participle autocompiled)

autocompiles (present singular third-person)
autocompiling (participle present)
autocompiled (participle past)
autocompiled (past)

The two routines created in this tutorial can be set up to autocompile for future ENVI sessions. To autocompile, place the two .pro files in the saveadd directory of the ENVI installation and restart ENVI.

One of the benefits of JSP technology is that you aren't required to create complex deployment descriptors to deploy, autocompile, and run a JSP document in a J2EE server.

2002, Lennart Jörelid, J2EE frontend technologies: a programmer's guide to servlets, JavaServer pages, and Enterprise JavaBeans:

By default, Remix is set to autocompile as you are typing.

2018, Joseph J. Bambara, Paul R. Allen, Kedar Iyer, Rene Madsen, Solomon Lederer, Michael Wuehler, Blockchain: A Practical Guide to Developing Business, Law, and Technology Solutions, McGraw Hill Professional, →ISBN, page 141:


subflow

(computing) An element of a flow (on a flowchart)


SWAR

(computing) Initialism of SIMD within a register.


code morphing

(programming) The obfuscation of intermediate-level code (such as compiled Java or .NET languages) by breaking it up into smaller sequences and replacing them by equivalent constructs.


Xenix

(computing, historical) A version of the Unix operating system for various microcomputer platforms, licensed by Microsoft from AT&T Corporation in the late 1970s.


subkernel

(mathematics, computing) A subsidiary kernel


link/cut tree

Invented by Daniel Dominic Sleator and Robert Endre Tarjan in 1982.

(computer science) A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time.

Daniel Dominic Sleator
Robert Endre Tarjan


Fenwick tree

Named for Peter Fenwick who described the concept in 1994.

(computer science) A data structure that maintains prefix sums over a list of numbers while allowing dynamic updates and queries in logarithmic time.


binary indexed tree

en-noun

binary indexed tree (plural binary indexed trees)

(computer science) Synonym of Fenwick tree


sparse table

(computer science) A data structure that can answer range maximum or range minimum queries on an immutable list of values in constant time, and other range queries in logarithmic time.


square root decomposition

square root decomposition (plural square root decompositions)

(computer science) A technique that can reduce the runtime of an algorithm by a factor of √ (where n is the size of the input) by dividing the input into √ chunks and performing operations on whole chunks when possible.


segment tree

(computer science) A data structure that is used to store information about intervals (segments) and perform range queries, or queries on a set of intervals, in logarithmic time.


topological sort

topological sort (plural topological sorts)

(graph theory, computer science) An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering.


ninety-ninety rule

(software engineering) A humorous aphorism stating that the first 90% of the code accounts for the first 90% of the development time, and the remaining 10% of the code accounts for the other 90% of the development time.


SMOP

Now that we know how to deal with events, the code to cycle through the stock is a SMOP (Simple Matter Of Programming).

2003, Jon Orwant, Games, Diversions & Perl Culture: Best of the Perl Journal:

(software engineering, humorous) Acronym of small/simple matter of programming: a piece of programming work that will require more time or effort than the person requesting it might realise.


tub file

(computing, historical) A technique used to speed the generation of data files on punch card, involving multiple copies of frequently used cards that were prepunched and stored in trays arranged by index.


Las Vegas effect

An allusion to the bright lights of the buildings and casinos in Las Vegas.

This helps make a user interface seem somehow friendlier and easier to use. However, this "Las Vegas" effect, as I discussed in Chapter 1, can actually distract users from their tasks.

1994, Theo Mandel, Windows vs. OS/2, the GUI-OOUI War, Van Nostrand Reinhold, →ISBN, page 109:

(graphical user interface) The distracting overuse of colour in a user interface.


EDID

Extended Display Identification Data
w:Extended Display Identification Data

(computer graphics) Acronym of Extended Display Identification Data.


dumb quotes

(computing, typography, informal) straight quotes


dataframe

Coordinate term: data cube

(computing) A two-dimensional array of data items, rather like a spreadsheet.


business key

Named from its relevance to the business domain being modelled.


natural key

(databases) A unique key formed from attributes that relate to the external world being modelled, rather than being an internally generated surrogate key.


rolling backup

(computing) A form of backup where newer data periodically overwrites older data.


paraunitary

(signal processing) Of or relating to a kind of matrix that occurs in the construction of filter banks used in multirate digital systems.


type hint

(programming) An instance of type hinting: the specification of a data type in an otherwise untyped language.


trackpoint

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

(computing) An individual record within a GPS of a visited location.


ATDD

(software engineering) Initialism of acceptance-test-driven development.


homescreen

→ German: Homescreen

Coordinate term: splash screen

Gary Bettman pulls his iPhone, with its homescreen picture of his grandchildren, from his pocket and dials up Colin Campbell, the league's director of hockey operations...

2012, Jonathon Gatehouse, The Instigator: How Gary Bettman Remade the NHL and Changed the Game Forever, page 154:

(graphical user interface) The main or first interface shown in a graphical user interface.


Buchberger's algorithm

Invented by Austrian mathematician Bruno Buchberger.

(computing theory) An algorithm for transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order.


Gröbner basis

Introduced in 1965 by Austrian mathematician Bruno Buchberger, who named them after his academic advisor Wolfgang Gröbner.

(computing theory) A particular kind of generating set of an ideal in a polynomial ring K[x1, ..,xn] over a field K. It allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite.

Bruno Buchberger
Gröbner basis
Wolfgang Gröbner


supersampler

(computer graphics) A program or algorithm that supersamples.


logic error

(programming) a case in which a programmer writes viable code that however produces undesired results


immunochip

(immunology, computing) Any of several chips used in computational immunology


keyswitch

(computing) A mechanical switch associated with a key on a keyboard.


stacklessness

(programming) The property of being stackless.