linkware

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

(computing) Software components that can be used for free on the condition that the user links back to the creator's web site.


multiforest

(computing) Of or relating to more than one forest.


red forest

* (ecology): Due to the colouration found in forest that has been killed.

(computing, Microsoft Windows) A forest (group of domains) having high security and limited access, used for administrative purposes.


unsuppress

en-verb

unsuppress (third-person singular simple present unsuppresses, present participle unsuppressing, simple past and past participle unsuppressed)

unsuppresses (present singular third-person)
unsuppressing (participle present)
unsuppressed (participle past)
unsuppressed (past)

to unsuppress a compiler warning

(transitive, computing) To cause no longer to be suppressed; to undo the suppression of.


BDFL

Originally applied to Guido van Rossum, creator of the Python programming language.

BDFL can be a type of governance that is part of a project from the onset, or it can emerge from the do-acracy form described earlier. We most often see the former: Rasmus Lerdorf with PHP, Linus Torvalds with the Linux kernel, and Guido van Rossum with Python.

2023, John Mertic, Open Source Projects—Beyond Code: A blueprint for scalable and sustainable open source projects, Packt Publishing Ltd, →ISBN, page 69:

(software, humorous) Initialism of benevolent dictator for life (leader of an open-source software project who retains the final say in disputes or arguments within the community)


Chomsky hierarchy

en-noun

Chomsky hierarchy (plural Chomsky hierarchies)

recursively enumerable
recursively enumerable

(computer science, linguistics) A containment hierarchy of classes of formal grammars. From least to most specialized, the classes are: recursively enumerable, context-sensitive, context-free, and regular.

hierarquia de Chomsky

a containment hierarchy of classes of formal grammars


infoset

(computing) An abstract data model of an XML document in terms of a set of information items.


superadmin

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


inliner

[…] an inliner was run on the program which inlined all static methods.

2004, Jong In Lim, Dong Hoon Lee, ICISC 2003 (volume 6, page 286)

(software compilation) A program or algorithm that optimizes code using in-line expansion.


unassign

en-verb

unassign (third-person singular simple present unassigns, present participle unassigning, simple past and past participle unassigned)

unassigns (present singular third-person)
unassigning (participle present)
unassigned (participle past)
unassigned (past)

(chiefly computing) To remove or undo the assignment of.


requeue

requeue (third-person singular simple present requeues, present participle requeuing, simple past and past participle requeued)

requeues (present singular third-person)
requeuing (participle present)
requeued (participle past)
requeued (past)

(transitive, computing) To add to a queue again.


superoptimizer

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

(computing) An algorithm that carries out superoptimization.


superoptimization

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

Coined by American computer scientist and programmer Alexia Massalin in 1987, from super- + optimization.

coin

As such, we implemented a state-of-the-art stochastic superoptimization approach, adapted it to the sort setting and used it as the learning algorithm in AlphaDev.

2023 June 21, Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, “Faster sorting algorithms discovered using deep reinforcement learning”, in Nature, volume 618, number 7964, →DOI, →ISSN, pages 257–263:

peephole optimization
peephole optimization

(software compilation) A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions.


multirequest

(computing) A single request for more than one item of data.


nodeset

(computing, graph theory) A set of nodes.


shimeji

Shimejis are little characters (desktop buddies or mascots) who play around in your windows of Google Chrome (web browser) or Chrome OS, while you are browsing the internet. Pick up a shimeji with the mouse pointer, drag them around, and drop them where you want. They walk, crawl, and climb all over your screen and interact with elements on web pages.

2017 August 21, Jarno Le Conté, Shimeji Browser Extension, archived from the original on 2017-08-26:

HoloCouncil Shimejis are your desktop companions […] that moves^([sic – meaning move]) around your screen. Aside from walking and running around, they do all sorts of things that aren't too distracting for you. They're mostly just there to chill and vibe with you!

2023 September 13 (last accessed), Akkanen, “HoloCouncil Shimejis”, in itch.io, archived from the original on 2023-04-03:

i want that one zombie max shimeji so bad but im embarrassed to ask the artist for it after 4 damn years

2023 September 13, @ambrpricefield, “Archived copy”, in Twitter, archived from the original on 2023-09-13:

(software) An animated figure created by a computer program which walks around the screen and performs animations like waving or sitting on windows.


doskpop

Said to be from Swedish disco och synth-kombinerad pop (disco and synth combined pop). http://www.pouet.net/topic.php?which=5058

look for the doskpop collection, it's a chiptune doskpop collection with tracks by Lizardking (naturally) and others. Look on aminet, it's there somewhere, probably named "doskpop" something or other.. (try looking in /pub/aminet/mods/INDEX).

1995, Andrew Fort, “Chiptunes...”, in comp.sys.ibm.pc.demos (Usenet):

No, I still like doskpop lots, don't get me wrong. :) I'm just saying that I think perhaps there's too many synth-pop wannabees who are getting highly rated.

1996, S M Carless, “DemoNews 124”, in comp.sys.ibm.pc.demos (Usenet):

The studio-oriented music would typically sound like jazz funk or techno, a unique style of the demoscene that became known as 'doskpop'. Swedish artist Lizardking was the father of doskpop, which can be described as soft digital disco music, somewhere in between 1980s electronic disco music such as Laserdance and Vangelis.

2013, Karen Collins, From Pac-Man to Pop Music: Interactive Audio in Games and New Media:

(demoscene, rare) A style of tracker music influenced by disco and associated with the demoscene.


NFV

network function virtualization
w:network function virtualization

(computing) Initialism of network function virtualization.


file format

(computing) A standard structure according to which data is encoded in a file.


file manager

(computing) A computer program that provides a user interface to manage files and folders.


app wrapper

Some features like encryption, VPN configuration, authentication features, and copy/paste control are hard-coded directly into the app wrapper when an app is deployed.

2014, Jack Madden, “Why you need to know about vendors like Apperian, even if you’re not building custom mobile apps yet”, in Brian Madden:

The Reddit app will look familiar to anyone that has been asked to try out the mobile website, but it does feel like a native app, rather than a simple app wrapper.

2016, Tom Dawson, “At Long Last, Reddit’s Official App Hits Android”, in Android Headlines:

Newspapers and magazines realised that an 'app wrapper' for content simply creates another barrier to entry – for readers and search engines alike.

2016, Molly Flatt, “The Memo’s year: 2016 in review”, in The Memo:

(computing) An application for mobile devices made wholly from an existing website or platform, with few or no changes made to the original version.


DRI

en-noun

DRI (countable and uncountable, plural DRIs)

declarative referential integrity
w:declarative referential integrity

(databases) Initialism of declarative referential integrity.


minidriver

The minidriver architecture first used for Windows 3.1 printer drivers and more recently for Windows NT disk drivers has found its way into the display and disk driver designs for Windows 95.

1994, Adrian King, Inside Windows 95, page 91:

Microsoft provides device class drivers, which work with the device minidriver. The minidriver is written for a specific piece of hardware, most often by the hardware manufacturer.

2001, Erik Eckel, Brian Alderman, Windows 2000 Professional on Site, →ISBN, page 316:

Cameras that use PTP require no vendor-provided driver components though a vendor can provide a minidriver to support vendor-specific features and capabilities.

2015, Jan Axelson, USB Complete: The Developer's Guide, →ISBN, page 196:

(computing) A device-specific plug-in that connects to a generic utility that is supplied with the operating system to form a device driver.


miniport

Attempts to access the SCSI port directly are actually blocked by the operating system. However, the same operating system provides you with the ability to control the device via an SCSI miniport.

2004, Kris Kaspersky, CD Cracking Uncovered: Protection against Unsactioned CD Copying, →ISBN:

Miniport drivers use a port driver interface instead of the device driver interface, and the port driver simply implements a collection of device driver support routines that interface miniport drivers to Windows.

2012, Mark E. Russinovich, David A. Solomon, Alex Ionescu, Windows Internals - Part 2, →ISBN, page 132:

(computing) A port that uses a lightweight driver that relies on built-in support from the operating system.


confused deputy

confused deputy (plural confused deputies)

(computing) A computer program that is innocently fooled by some other party into misusing its authority.


kibibit

(computing) Strictly, 2¹⁰ (1,024) bits, as opposed to a kilobit.


mebibit

(computing) Strictly, 2²⁰ (1024², or 1,048,576) bits or 2¹⁰ (1024) kibibits, as opposed to a megabit.


pseudo-localization

software engineering
software engineering

(software engineering) The practice of using fake localization strings during development, intended to test the software's capability of handling multilingual text.


fat comma

(programming, Perl) The operator =>, used in declaring hashes.


lawbot

(computing, law) A piece of software designed to complete minor but repetitive legal tasks automatically or on command.

(computing, law) A piece of software designed to retrieve legal information automatically or on command.


reverse integration

(computing) The process of merging different team branches into the main trunk of a versioning system.


astrobot

1988, IEEE Systems, Man and Cybernetics Society, IEEE ... Cybernetics and Society
The Kader Astrobot was conceived as a state-of- the-art telerobot and is now in final design stages. Like Project HOST, the Astrobot concept seeks to minimize human extra-vehicular activity (EVA) […]

An expendable rocket will launch a robotic vehicle, Astrobot, equipped with manipulators and the experimental equipment. Astrobot will link the tanks, pad the tanks' interiors with insulation and install the apparatus.

Figure 4 EEU + Astrobot Concept Also shown in Figure 4 is an astrobot which attaches to and interfaces with the EEU. The astrobot provides a data/communications link, television, and a set of dexterous manipulators to permit its operation […]

1990, International Astronautical Congresses, Space safety and rescue, 1988-1989 : proceedings of symposia of the International Academy of Astronautics held in conjunction with the 39th and 40th International Astronautical Congresses:

Astrobot! NASA scientists are regular participants in the DARPA challenge.

2016, The Editors of TIME for Kids, TIME for Kids Explorers: Robots:

(robotics, rare) Robot designed to work in space.


hyperindex

hyperindex (plural hyperindexes or hyperindices)

hyperindexes (plural)
hyperindices (plural)


hyperbase

(databases) A kind of database that structures the data by means of hyperlinks.


VAXherd

Modelled on cowherd, shepherd, etc., as though the computers were animals, probably from the similarity of VAXen to oxen through oxherd.

(computing, humorous, slang) A sysadmin who works with VAX computers.


Kube

(computing) An individual container of the Kubernetes orchestration system.


capture card

(computer hardware) A circuit board allowing a computer to record video from an external source.


cold boot attack

cold boot attack (plural cold boot attacks)

(cryptography) A type of sidechannel attack in which somebody with physical access to a computer is able to retrieve encryption keys from a running operating system after a reboot. It relies on the fact that the contents of memory can still be read for a short period after power is cut off.


compressed sensing

(statistics, signal processing) A signal processing technique for efficiently acquiring and reconstructing a signal, by finding solutions to underdetermined linear systems.


CPOL

(software) Initialism of code project open license.


typechecker

The catch is that to get the full benefits of the type checker, the programmers have to add complex annotations to their code.

2015 April 2, James Somers, “Toolkits for the Mind”, in MIT Technology Review:

(programming) A system or algorithm that verifies values against their required data types, according to the type system of the language.


PMC

project management
project management#English

(software) Initialism of project management committee (a committee of the Apache Software Foundation)


self-signed

(computing, cryptography) Of a security certificate: signed by the same entity whose identity it certifies; signed with its own private key.


self-signing

(computing, cryptography) The use of self-signed security certificates.


partial function application

partial function application (plural partial function applications)

partial application
partial application#English

(computer science) Alternative form of partial application


partial application

partial application (countable and uncountable, plural partial applications)

(computer science) The process of fixing a number of arguments to a function, producing another function of smaller arity.


resequencer

(computing) A program or algorithm that arranges items in a different sequence.


Seeds

Life-like cellular automaton
Life-like cellular automaton

(cellular automata) A Life-like cellular automaton with the rule B2/S.


skinable

Flex controls are visually consistent, and easily skinable.

2007, EffectiveUI Inc, Anthony Franco, The EffectiveUI Team, Flex Early Evaluation: Assessing Flex and Your Project Needs:

(computing, of software with user interface) Alternative spelling of skinnable


cryptoworm

(cryptography, computer security) A form of malware that spreads in the form of a worm and encrypts victims' data.


beige box

Beige box (phreaking)
gray-box testing
white box (software engineering)

(computing) A desktop computer in the style typical of personal computers of the 1980s and 1990s, having a boxy off-white case and CRT monitor.


autoreceive

(computing) A feature (of telecommunication software etc.) that receives automatically.


autosend

(computing) A feature (of telecommunication software etc.) that sends automatically.


EER

(computing) Initialism of Enhanced/Extended Entity-Relationship.


subnavigation

(computing) A level of navigation below the primary level, such as that offered by a submenu.


FFI

FFI (countable and uncountable, plural FFIs)

foreign function interface
w:foreign function interface

(countable, computing) Initialism of foreign function interface.


paamayim nekudotayim

From Hebrew פעמיים נקודתיים (“double colon”); introduced in the Israeli-developed Zend Engine 0.5 used in PHP 3. The correct word should be nekudatayim, but Israelis commonly say the word with this mistake.

uder

פעמיים נקודתיים

programming language
programming language

(programming) The scope resolution operator :: in the PHP programming language.


bytestring

However, the underlying file model of these approaches is that of Unix files (i.e., bytestrings), whereas we assume record-structured files with key-based access.

1994, Richard T. Snodgrass, Marianne Southall Winslett, Association for Computing Machinery. Special Interest Group on Management of Data, Proceedings (page 255)

Standard Python strings are really bytestrings, and a Python character, being such a string of length 1, is really a byte.

2005, Alex Martelli, Anna Ravenscroft, David Ascher, Python Cookbook:

(programming) A text string treated as a series of single bytes rather than a series of characters of possibly varying storage size.


help vampire

From help + vampire (“person who drains one’s energy, money, time, etc.”).

compound

Help Vampires are found in every public online community, from those nearest to our hearts to those furthest from our principles. Instead of consuming of ill-gotten hemoglobin, these vampires suck the very life and energy out of people. By nature they feed on generous individuals who tend towards helping others, and leave their victims exhausted, bitter and dispirited.

2006 December 22, Amy Hoy, “Help Vampires: A Spotter’s Guide”, in Slash7:

Personally, I see this ratings/feedback thing only useful for mentors to know if a student is abusive and/or a help vampire, if he is willing to learn and put some effort on the process or not, etc, to be able to dedicate mentoring time to someone who will really appreciate it and will benefit from this.

2009 May 21, Matías Flores, “Rails Mentors”, in Bridgefoundry Google Group:

All kinds of people hop onto the list. In addition to genuine ones there are spammers, trolls, dicks, nuts, philosophers, help-vampires etc etc.

2013 November 29, rusto…@gmail.com, “Managing Google Groups Headaches”, in comp.lang.python (Usenet):

Mark, I sympathize with your feelings. jmf is certainly a troll, and it doesn't feel like anything has been, or is being, done about that situation (or for that matter, the help vampire situation … although I haven't seen any threads from that one lately – did he give up, or has he been moderated away?). […] And, to be clear, the coddling of trolls and help-vampires also makes the list an unfriendly place to be. Terry, would it be appropriate to share some of what the moderators do do for us on this list and the others? And what does the Code of Conduct have to say about trolls and help-vampires?

2013 December 3, Ethan Furman, “Python Unicode Handling Wins Again – Mostly”, in comp.lang.python (Usenet):

(chiefly computing, derogatory, informal) A person who requests answers and solutions from a community while giving nothing in return.


unshorten

en-verb

unshorten (third-person singular simple present unshortens, present participle unshortening, simple past and past participle unshortened)

unshortens (present singular third-person)
unshortening (participle present)
unshortened (participle past)
unshortened (past)

The following is a snippet from the UnShortEmAll Greasemonkey script, which unshortens the shortened URLs in Twitter […]

2010, Shelley Powers, JavaScript Cookbook, page 488:

(rare, transitive, chiefly computing) To expand from an abbreviated form; to restore to its original length.


linestring

geographic information systems
geographic information systems

(computing) A curve with linear interpolation between points, used in geographic information systems e.g. to represent streets and rivers.


Ramer-Douglas-Peucker algorithm

the Douglas-Peucker algorithm (canonical)

Named after Urs Ramer, David Douglas and Thomas Peucker.

(computing theory) An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points.


style sheet language

en-noun

style sheet language (plural style sheet languages)

(programming) A computer language that expresses the presentation of structured documents.

Stylesheet-Sprache

a computer language that expresses the presentation of structured documents


watering hole attack

watering hole attack (plural watering hole attacks)

The name is derived from predators in the natural world, who wait for an opportunity to attack their prey near watering holes.

(computing) A computer attack strategy, in which the victim is a particular group (organization, industry, or region), and the attacker guesses or observes which websites the group often uses and infects one or more of them with malware.


k-d tree

(computing) A space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc.


skip-level

(databases) Having the form of a hierarchy, but with some of the intermediate levels omitted.


regression testing

During manual test execution, a newly introduced defect to previously working functionality might not be found until hours into the regression testing cycle.

1999, Elfriede Dustin, Jeff Rashka, John Paul, Automated Software Testing, →ISBN:

Without regression testing, unseen bugs will accumulate, until suddenly nothing works in what was once thought to be a stable system.

2000, Robert V. Binder, Testing Object-oriented Systems: Models, Patterns, and Tools, →ISBN, page 32:

Regression testing can account for as much as one-half of the cost of software maintenance.

2004, Mark Last, Abraham Kandel, Horst Bunke, Artificial Intelligence Methods in Software Testing, →ISBN, page 52:

(software engineering) Testing a program after a modification to ensure that areas that should not be affected by the update behave as they did in previous versions.


unparser

(computing) A program or algorithm that unparses.


switch engine

2. Is it possible to make the switch engine leave debris other than the normal 8 blocks/288 generations?

1990 May 17, David Moews, “Life questions”, in comp.theory.cell-automata (Usenet):

He did this by placing a large number of switch engines together so as to eliminate all debris. His original ship required 13 switch engines, but his smaller one given here only uses 10 of them.

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

The average random Life pattern settles down instead of exploding (if you ignore output gliders and spaceships). There are exceptional quadratic-growth cases, mostly involving switch engines, but most random patterns affect only their immediate area.

2007 May 12, Dave Greene, “Wanted: 2D CA, "as complex" but "denser" than Life”, in comp.theory.cell-automata (Usenet):

(cellular automata) A particular methuselah in Conway's Game of Life that temporarily exhibits glide reflection symmetry while leaving debris behind, allowing for the construction of spaceships, puffers, and rakes.


conditional comment

conditional comment (plural conditional comments)

(programming) A comment in source code that can be interpreted as a directive by some systems, but is ignored by those others that are not aware of the convention; formerly used to overcome compatibility issues between web browsers.


predeclaration

(programming) A declaration made in advance; forward declaration.


bareword

(programming, chiefly Perl) A sequence of text characters in source code that do not form a keyword nor part of a quoted string, and may potentially be interpreted in various ways.


forward-declare

en-verb

forward-declare (third-person singular simple present forward-declares, present participle forward-declaring, simple past and past participle forward-declared)

forward-declares (present singular third-person)
forward-declaring (participle present)
forward-declared (participle past)
forward-declared (past)

(transitive, programming) Synonym of predeclare


IMT

en-noun

IMT (countable and uncountable, plural IMTs)

(computing) Initialism of interactive machine translation


behavioral subtyping

(programming, language theory) A subtype relation of the form that each subtype object satisfies the specification of the supertype.


weak typing

(computing, programming) A system that does not place any restriction on the interactions between objects of different data types.


reference counting

(computing) The technique of storing the number of handles, pointers, or references to a resource such as a block of memory, disk space, or an object, so that the system can determine when the resource is no longer in use.


premature optimisation

premature optimisation (countable and uncountable, plural premature optimisations)

premature optimization
premature optimization#English

(programming) Alternative form of premature optimization


off-by-one error

off-by-one error (plural off-by-one errors)

Using an incorrect relational operator or an incorrect final value of a loop counter in the loop-continuation condition of a repetition statement causes an off-by-one error.

2005, Harvey M. Deitel, Paul J. Deitel, C# for Programmers, second edition, Prentice Hall Professional, →ISBN, page 164:

(programming) A logic error where a value, typically the number of iterations of a loop, is specified incorrectly, being either 1 less or 1 more than it should be.


infix operator

The plus sign in "2 + 2" is placed as an infix operator in arithmetic.

(computing) an operator that is placed in between the operands like it is commonly used in arithmetical and logical formulae and statements.


IDLE

(programming, Python) Initialism of Integrated DeveLopment Environment.

(programming, Python) Initialism of Integrated Development and Learning Environment.


LLVM

(programming) Initialism of Low Level Virtual Machine. (collection of modular and reusable compiler and toolchain technologies that are used to develop compiler front ends and back ends)


GTK

(computing, graphics) Initialism of GIMP Toolkit.


augmented assignment

augmented assignment (countable and uncountable, plural augmented assignments)

(programming) An assignment by which an operator takes a variable as one of its arguments and then assigns the result back to this variable.


assignment operator

assignment operator (plural assignment operators)

(computing) An operator that sets the value stored in the storage location(s) denoted by a variable name.


madware

This finding is inline with Symantec's recent report, which mentions the “madware” phenomenon, the practice of creating ad-aggressive mobile applications to obtain revenue.

2014, Sven Dietrich, editor, Detection of Intrusions and Malware, and Vulnerability Assessment:

As mentioned, madware is a form of very aggressive adware that is prevalent on mobile devices. Due to the way the “free application” business model works on the Internet, developers consider madware to be not only harmless, but a legitimate aspect of application behavior.

2015, Jim Doherty, Wireless and Mobile Device Security, page 333:


startword

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

In fact, a set of metarules and a set of hyperrules is given whose power exceeds by far this example and only the choice of a specific hyperrule for the startword restricts it to this example.

1981, Mathematisch Centrum (Amsterdam, Netherlands) Afdeling Informatica, Report IW - Issues 181-190:

A variation on this type of normalization consists of using a combination of startword lists and exclusion classes, e.g. remove all comparative adjectives except those in a domain list.

1992, Anne Morris -, The Application of Expert Systems in Libraries and Information Centres, →ISBN:

Suppose that the colony starts its work from startword AA and let its terminal set be {a,b,c}

1999, Andras Kornai, Extended Finite State Models of Language - Volume 1, →ISBN, page 222:

(computer science) A string of letters that identifies the beginning of a valid sequence in a specified language.


TeX

The letters of the name are meant to represent the capital Greek letters Τ (tau), Ε (epsilon), and Χ (chi), as TeX is an abbreviation of Ancient Greek τέχνη (tékhnē), which is also the root word of technical.

TFFI-mode makes it possible for BibTeX to work on plain TeX documents as well.

1986, Jacques Desarmenien, TEX for Scientific Documentation: Second European Conference, Strasbourg, France, June 19-21, 1986. Proceedings, Springer Science & Business Media, →ISBN, page 41:

(computer languages) A digital typesetting system used primarily for the formatting of mathematical formulae.


omnibox

From omni- + box. Introduced by the Google Chrome browser and later adopted for use in Opera Neon.

graphical user interface
graphical user interface

(Internet, graphical user interface) An enhanced address bar in a web browser that can also accept certain text commands.


greyware

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

(computing) Software that is not outright malicious but is generally undesirable or annoying, such as adware.


Butterworth filter

Butterworth filter (plural Butterworth filters)

First described in 1930 by the British engineer and physicist Stephen Butterworth.

(signal processing) A kind of filter designed to have as flat a frequency response as possible in the passband.


zip bomb

(computing) A malicious zip file designed to produce a very large output, and consume a great deal of processing resources, during decompression.


deskbar

You can download Google's deskbar for free […] It automatically installs itself as a toolbar on the Windows XP taskbar, but you have to turn it on by right-clicking the taskbar and choosing Toolbars → Google Deskbar.

2005, Preston Gralla, Windows XP Power Hound: Teach Yourself New Tricks, page 179:

(graphical user interface) Synonym of deskband


code completion

code completion (countable and uncountable, plural code completions)

(programming, uncountable) Autocompletion of source code.

(programming) A token predicted by means of autocompletion.


metapackage

(computing) A software package that contains no software itself, but serves to install a particular set of other packages.


dwimmery

From DWIM + -ery, influenced by dwimmer.

This dwimmery causes the model to show that polar melting rates have absolutely no connection to world climate in general, and to rising ocean levels in particular.

2005, Damian Conway, Perl Best Practices:

I think that, as with various other parts of Perl 6, we can try to sweep all the dwimmery into one spot so that it can be easily recognized and/or avoided.

2005 May 6, Larry Wall, “stdio”, in perl.perl6.language (Usenet):

The big challenge of Perl 6 is to achieve a high degree of dwimmery

2007 November 11, Michele Dondi, “Why can't you slice an array @a[3..-1]?”, in comp.lang.perl.misc (Usenet):

(computing, humorous) A computer program's ability to sense the user's intentions rather than work according to a well-defined specification.


Threefish

From three + fish, modelled on the earlier Twofish.

(cryptography) A symmetric-key tweakable block cipher involving the Skein hash function.


ATR

adaptive tile refresh
adaptive tile refresh#English

(computer graphics) Initialism of adaptive tile refresh.


antiblocker

(computing) software that disrupts the activity of viruses etc. that try to block the activity of a computer.


bitrange

Finally, we show that our descriptors are able to compare favourably to other state-of-the-art compact descriptors in similar bitranges, exceeding the highest retrieval results reported in the literature on some datasets.

2016, Olivier Morère, Antoine Veillard, Jie Lin, Julie Petta, Vijay Chandrasekhar, Tomaso Poggio, “Group Invariant Deep Representations for Image Instance Retrieval”, in arXiv:

(computer graphics) A range defined in terms of bits (binary digits).


subshot

We propose a novel supervised learning technique for summarizing videos by automatically selecting keyframes or key subshots.

2016, Ke Zhang, Wei-Lun Chao, Fei Sha, Kristen Grauman, “Video Summarization with Long Short-term Memory”, in arXiv:

(signal processing) A portion of a shot, in video material.


sequentialization

sequentialization (countable and uncountable, plural sequentializations)

(computing theory) The conversion of a parallel algorithm into sequential form.


SuperDisk

(computing) An early form of high-capacity floppy disk


rebalancer

(chiefly computing) That which rebalances.


autoconcurrency

(computing theory) The situation where two instances of the same actions occur simultaneously and in parallel.


Hadamard transform

Hadamard transform (plural Hadamard transforms)

Named for the French mathematician Jacques Hadamard.

(signal processing) A generalized Fourier transform that performs an orthogonal, symmetric, involutive, linear operation on 2ᵐ real numbers (or complex numbers, although the Hadamard matrices themselves are purely real).


headtracking

(computer graphics) A technique that tracks the movements of the user's head and adjusts the view of a three-dimensional model accordingly, allowing them to look at it from different angles like a solid object.


juice jacking

Coined by cybersecurity reporter Brian Krebs in 2011.

In the Blackhat community, one type of charging attacks is called juice jacking attacks, which can access to a significant amount of personal data without the user's permission and can install hidden malicious software on the device, as long as the device is unlocked.

2016, Zheng Yan, Refik Molva, Wojciech Mazurczyk, Raimo Kantola, Network and System Security, page 201:

Through juice jacking, hackers have found an innovative way to compromise smart technology and potentially steal data or infect devices.

2021 June 24, Dr Thaddeus Eze, ECCWS 2021 20th European Conference on Cyber Warfare and Security, Academic Conferences Inter Ltd, →ISBN, page 453:

(computing, technology) The act of stealing information from mobile devices by placing a data-stealing device that appears to be a charging station in a place where passers-by are likely to plug their devices into it.


CPP

(computer science, rare, nonstandard) The C++ programming language.


diffable

en-adj

diffable (comparative more diffable, superlative most diffable)

more diffable (comparative)
most diffable (superlative)

Should you adopt a diffable data source for your table view? Or should you stick with the old-style Three Big Questions data source?

2019, Matt Neuburg, Programming iOS 13: Dive Deep into Views, View Controllers, and Frameworks, O'Reilly, →ISBN, page 509:

(computing) Suitable for processing by a diff program in order to show differences.


match moving

(cinematography, computer graphics) A technique that allows the insertion of computer graphics into live-action footage with correct position, scale, orientation, and motion relative to the photographed objects in the shot.


error diffusion

(computer graphics) A form of halftoning in which the quantization residual is distributed to neighbouring pixels that have not yet been processed.


two seconds to black

(computing, informal) The situation where a computer monitor displays a correct screen image when first switched on, but then quickly blanks out, typically associated with capacitor problems.


MML

man-machine language
w:MML (programming language)

(computing) Initialism of man-machine language.


MML

minimum message length
w:minimum message length

(information theory) Initialism of minimum message length.


leaky abstraction

en-noun

leaky abstraction (plural leaky abstractions)

Popularised in 2002 by software engineer Joel Spolsky.

This is a classic case of leaky abstraction. Repository is supposed to abstract away any concerns around querying the database, but now what we are doing here is returning an IQueryable<T> to the consuming code and asking it to build the queries, thus leaking the abstraction that is supposed to be hidden into repository.

2015, Suhas Chatekar, Learning NHibernate 4, Packt Publishing Ltd, →ISBN, page 291:

(software engineering) An abstraction that undesirably exposes details and limitations of its underlying implementation.


DBU

(graphical user interface) Abbreviation of dialog base unit.


GPT

/ˈd͡ʒiːˈpiːˈtiː/

GPT is part of Intel's EFI specification, but GPT can be used on computers that don't use EFI, and GPT is the preferred partitioning system for disks bigger than 2TiB.

2015, Christine Bresnahan, Richard Blum, LPIC-1 Linux Professional Institute Certification Study Guide, John Wiley & Sons, →ISBN, page 135:

(computing) Initialism of GUID partition table.


Modula

(computing) A programming language descended from Pascal, developed in the 1970s and having a module system for grouping sets of related declarations into program units.


HTTP/2 enables a more efficient use of network resources and a reduced perception of latency by introducing header field compression and allowing multiple concurrent exchanges on the same connection.

2015 May, M. Belshe, R. Peon, “Hypertext Transfer Protocol Version 2 (HTTP/2)”, in M. Thomson, editor, RFC Editor, →DOI, →ISSN, RFC 7540:

(Internet, networking) Initialism of Hypertext Transfer Protocol/2 (a major revision of the HTTP network protocol used by the World Wide Web and approved in 2015.)


bivariance

(mathematics, computing) The state of being bivariant.


singlecast

(programming, of a delegate) Having a single target; not multicast.


Cupertinian

en-adj

Cupertinian (comparative more Cupertinian, superlative most Cupertinian)

more Cupertinian (comparative)
most Cupertinian (superlative)

From Cupertino + -ian, after the location of the corporate headquarters of Apple Inc. in California. Compare Redmondian used to refer to Microsoft.

(informal, computing) Of or relating to the technology company Apple Inc.


costatement

(programming) A list of statements that effectively execute together (though not simultaneously), such that each can yield execution to the others to avoid delaying the program. They are used to implement cooperative multitasking.


FIR

finite impulse response
w:finite impulse response

(signal processing, of a filter) Initialism of finite impulse response; that has impulse response (or response to any finite length input) of finite duration.


HPF

(signal processing) Initialism of high-pass filter.


BPF

(signal processing) Initialism of band-pass filter.


running time

en-noun

running time (countable and uncountable, plural running times)

(computer science) Of an algorithm, the length of time required for it to run as a function, depending on the number of operations executed.


fuzzy controller

fuzzy controller (plural fuzzy controllers)

(computing, electronics) A controller that uses a fuzzy logic ruleset.


duospace

(computing, typography) Of a typeface, having characters of only two widths, where the narrower width is typically half that of the wider width.


requery

en-verb

requery (third-person singular simple present requeries, present participle requerying, simple past and past participle requeried)

requeries (present singular third-person)
requerying (participle present)
requeried (participle past)
requeried (past)


deduplicator

(computing) A process or system that deduplicates.


machoflops

(computing, slang) A deceptively inflated measure of the speed of a computer, as used in marketing materials.


unwipe

unwipe (third-person singular simple present unwipes, present participle unwiping, simple past and past participle unwiped)

unwipes (present singular third-person)
unwiping (participle present)
unwiped (participle past)
unwiped (past)

Of course, before that, he had put the photo files he'd made on disk and had erased them from the hard drive. While a good troubleshooter could unwipe them, he'd first have to crack the security barriers Tim had installed.

2010, James Robert Smith, The Flock, page 148:

So the computer wipe had been cursory, and it had taken Bingwen only a few minutes to unwipe everything.

(transitive, computing) To undelete; to restore (data, files, etc.) previously wiped.


WOCA

(computing) Acronym of write once, compile anywhere.


HMAC

hash-based message authentication code
w:HMAC

(cryptography) Initialism of hash-based message authentication code (a specific type of the message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key)


YUI

(computing) Initialism of Yahoo! User Interface.


Mactel

(computing, informal) Apple–Intel architecture.


Mersenne twister

en-noun

Mersenne twister (plural Mersenne twisters)

pseudorandom number generator
pseudorandom number generator

(computing) A kind of pseudorandom number generator whose period length is chosen to be a Mersenne prime.


barcode reader

(computing) An electronic device that can read and output printed barcodes to a computer.


Floyd-Warshall algorithm

the Floyd-Warshall algorithm (canonical)

Named after Robert W. Floyd and Stephen Warshall.

(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).


pixelize

en-verb

pixelize (third-person singular simple present pixelizes, present participle pixelizing, simple past and past participle pixelized)

pixelizes (present singular third-person)
pixelizing (participle present)
pixelized (participle past)
pixelized (past)

Vector graphics are resolution-independent and can be scaled to any size without losing detail, whereas a bitmap image is resolution-dependent and can pixelize when printed beyond its resolution parameters.

2006, Eddie Tapp, Photoshop Workflow Setups, O'Reilly, →ISBN, page 169:

Aftenposten’s editor-in-chief, Espen Egil Hansen, said the newspaper had received a message from Facebook asking it to “either remove or pixelize” the photograph.

2016 September 9, Alice Ross, Julia Carrie Wong, “Facebook deletes Norwegian PM's post as ‘napalm girl’ row escalates”, in The Guardian:

(transitive, intransitive, computer graphics) To pixelate; to convert into pixels.


(computing, of a word size, or an integer) Represented using 7 bits (ASCII).


overlicensed

en-adj

overlicensed (comparative more overlicensed, superlative most overlicensed)

more overlicensed (comparative)
most overlicensed (superlative)

(computing) Having purchased more licences than are legally required.


underlicensed

underlicensed (comparative more underlicensed, superlative most underlicensed)

more underlicensed (comparative)
most underlicensed (superlative)

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

If you are in the situation where the shortfall or deficit is too large, clearly you will need to establish if the installed software that is underlicensed is actually in use and/or required in the business.

2011, Martyn Hobbs, IT Asset Management: A Pocket Survival Guide, page 31:

(computing) Having purchased fewer licences than are legally required.


VBR

Coordinate term: CBR

(computing) Initialism of variable bitrate.


hotword

Google recently killed an extension in the open source Chromium browser that enabled “OK, Google” hotword detection. The move follows developer concern that the proprietary functionality was included in Chromium to begin with.

2015 June 25, Ian Paul, “'OK Google' hotword detection yanked from Chromium after user revolt”, in PCWorld:

Smartphones make a lot of compromises to be compact and low power though, so the hotword performance was never as good as it could be thanks to tiny microphones and low-power modes that could kill hotword detection.

2016 November 3, Ron Amadeo, “The mesh hotword system is straight out of Star Trek”, in Ars Technica:

Home assistants all work in a similar way: you say a hotword — "Alexa" for Amazon Echo, "Hey Google" for Google Homes — and they switch on, ready to record your question/order, send it to the cloud, and then answer/execute your order.

2017 October 11, Gianluca Mezziofiore, “Google is forced to shut down Home Mini feature that quietly records everything”, in Mashable:


semireliable

(chiefly computing) Partly or somewhat reliable; having a fair degree of reliability.


special case

en-verb

special case (third-person singular simple present special cases, present participle special casing, simple past and past participle special cased)

special cases (present singular third-person)
special casing (participle present)
special cased (participle past)
special cased (past)

Special-casing the 100 most common words in English might speed things up.

1988, Jon Louis Bentley, More Programming Pearls: Confessions of a Coder, page 10:

If these programs work as well as they can even without going through QuickDraw, what's the penalty for going around the system and special casing?

1992, Scott Knaster, Keith Rollin, Macintosh Programming Secrets, page 46:

Other languages have since special-cased that kind of computation with, for example, generators in Python or something where you can yield values.

2009, Peter Seibel, Coders at Work: Reflections on the Craft of Programming, page 258:

(transitive, intransitive, chiefly programming) To treat something as a special case; to handle in an explicitly different way.


fail-soft

(computing) Able to proceed even after an error condition by selectively skipping parts of the processing.


CMIS

w:Content Management Interoperability Services

(computing) Initialism of Content Management Interoperability Services.

Common Management Information Service
w:Common Management Information Service

(computing) Initialism of Common Management Information Service.


portsweep

(computing) A portscan that connects to numerous host computers in search of a specific open port rather than scanning a single computer for any open port.


wake word

(computing) A word or phrase that activates a dormant device when spoken by the user.


data scrubbing

(computing) An error-correction technique that periodically inspects main memory or storage for errors, then correct detected errors using redundant data in the form of different checksums or copies of data.


destructive backspace

en-noun

destructive backspace (plural destructive backspaces)

(computing) A backspace that erases the character at the previous position, in addition to moving the cursor.


TOAST

(databases) Initialism of The Oversized-Attribute Storage Technique: a mechanism in PostgreSQL that allows rows of data to exceed the normal maximum size by splitting off part of the data into an auxiliary table.


fastloader

I'm still waiting for the entire fastloader problem to be solved on the emulators. Could somebody give me an update on whether an up-and-coming emulator will solve this.

1996, W. and S. Young, “C64 Fastloader prob solved?”, in comp.emulators.cbm (Usenet):

The tape system could basically be told to work in any manner you wanted it to, fastloaders like Cyberload read the data in backwards and encrypted, run considerably faster than the stock loader and still only take about a tenth of the processors^([sic]) time so other jobs can execute simultaneously.

1999, Jason, “Target: Renegade - was Knight Lore & Alien 8”, in comp.sys.sinclair (Usenet):

Upon booting on the PC version, the game recreated the Commodore 64 loading screen and 'fastloader' coloured stripes. This knowing reference filled twenty-something gamers with a warm glow […]

2007, James Newman, Iain Simons, 100 Videogames, page 63:

(computing, historical) Synonym of turboload


magic packet

Originally trademarked by AMD, but is now in common usage.

(networking) A specially crafted packet that will turn on a computer with wake-on-LAN support if it is received by the computer's network card in standby mode.


deep learning

Coined by Israeli-American computer scientist Rina Dechter in 1986.

coin

Deep learning was given a particularly audacious display at a conference last month in Tianjin, China, when Richard F. Rashid, Microsoft’s top scientist, gave a lecture in a cavernous auditorium while a computer program recognized his words and simultaneously displayed them in English on a large screen above his head.

2012 November 23, John Markoff, “Scientists See Promise in Deep-Learning Programs”, in New York Times:

(computing) A form of machine learning based on the interpretation of the structure of data.


concat

en-verb

concat (third-person singular simple present concats, present participle concatting, simple past and past participle concatted)

concats (present singular third-person)
concatting (participle present)
concatted (participle past)
concatted (past)

Abbreviation; also used as a keyword or function name in some programming environments.


OOM

If you write infinitely recursive code, you might generate an OOM error.

(programming) Initialism of out of memory.


desknote

With its eye-popping 17-inch display, superfast Intel Hyper-Threading CPU, and versatile DVD/CD burner, the HP Pavilion zd7001 is one of the best desknotes you can buy.

(computing) A notebook computer equipped with the greater power and features of a desktop computer.


tasktray

(graphical user interface) The notification area or tray, part of the taskbar.


rangeable

en-adj

rangeable (comparative more rangeable, superlative most rangeable)

more rangeable (comparative)
most rangeable (superlative)

Obviously, the more searchable fields that are available (as opposed to those which are limitable or rangeable), the more bibliometric studies are possible.

The form VALUE- (where VALUE means a rangeable search term) specifies a range of values from and including VALUE, and all higher values.

1994, Common Command Language for Online Interactive Information Retrieval, →ISBN:

For example, for Fixnum, succ returns the current number plus one. This method is necessary if you want to make your class to work with ranges. To have a “rangeable class,” you must also provide an implementation to the <=> operator (which is what the range uses internally to know when it should stop).

2010, Shay Friedman, IronRuby Unleashed, e-Pub, →ISBN:

(computing) Supporting the use of ranges.


auto-tiering

(computing) The automatic movement of data between storage locations based on how often it has been accessed, in order to optimize performance.


subdeployment

Here are some rules of thumb to help you use modules and subdeployments in their recommended way.

2010, Robert Patrick, Gregory Nyberg, Philip Aston, Professional Oracle WebLogic Server:

(computing, JMS) a mechanism by which JMS module resources are grouped and targeted to a server resource.


HAIFA

(cryptography) Abbreviation of hash iterative framework: a cryptographic structure used in the design of hash functions.


crossover cable

en-noun

crossover cable (plural crossover cables)

(networking) A cable, especially an Ethernet cable, that allows two devices of the same kind, such as two computers, to be connected directly.


double free

(programming) The situation where a program attempts to free a previously allocated resource more than once, potentially resulting in undefined behaviour that may be exploited by an attacker.


Pournelle's law

After Jerry Pournelle (1933–2017), American writer of science fiction.

(computing) The rule of thumb that there should be at least one CPU for each user of a system.


tailable

(databases) Of a cursor: not closed when the end of the resultset is reached, but able to be used as further documents are added to the collection.


autoconfig

(computing) Abbreviation of autoconfiguration.


unsave

en-verb

unsave (third-person singular simple present unsaves, present participle unsaving, simple past and past participle unsaved)

unsaves (present singular third-person)
unsaving (participle present)
unsaved (participle past)
unsaved (past)

to unsave a Snapchat message

It is an error to try to unsave a file which doesn't exist.

1986, Larry Joel Goldstein, Structured Programming with True BASIC, page 267:

(computing, transitive) To undo an act of saving; to erase.


Rice's theorem

Named after Henry Gordon Rice, who proved it in 1951.

(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.


worklet

(computing) A small piece of functionality encapsulating a single task.


graceful degradation

Since we built the website with graceful degradation in mind, it will replace animations with textual cues if JavaScript is not available.

(chiefly computing) The ability of a system to maintain at least some of its functionality when portions are not working, or when certain features are not available.


devirtualize

devirtualize (third-person singular simple present devirtualizes, present participle devirtualizing, simple past and past participle devirtualized)

devirtualizes (present singular third-person)
devirtualizing (participle present)
devirtualized (participle past)
devirtualized (past)

Because functions that contain references to this cannot be inlined, the Compiler's ability to devirtualize prototype methods is even more important in terms of reducing the size of compiled code. By devirtualizing methods and removing references to this, more methods become functions that are candidates for inlining.

2010, Michael Bolin, Closure: The Definitive Guide:

(computing, transitive) To make no longer virtual.


clickably

en-adv

clickably (comparative more clickably, superlative most clickably)

more clickably (comparative)
most clickably (superlative)

(computing) Such that it can be clicked, or activated by clicking a link.


nodelist

bulletin board system
bulletin board system

(computer networking) A list of bulletin board systems and their connection details.


suballocator

From sub- + allocator or suballocate + -or.

As a result, many compilers automatically allocate blocks of memory and then parcel chunks out to programs with a suballocator when needed. That is, the compiler allocates a chunk of some 4,000 bytes and then parcels this memory out to you in bits and pieces when you need it.

1995, Charles Calvert, Teach Yourself Windows 95 Programming in 21 Days, page 1170:

(chiefly computing) One who or that which suballocates.


live CD

(computing) A storage medium, often a compact disc, that contains a complete operating system that can be booted off the medium without having to install it.


color depth

en-noun

color depth (countable and uncountable, plural color depths)

(computer graphics) The number of bits per pixel used to store color information in an image.

kolorozo

computer graphics: the number of bits (binary digits) used to represent the colour of a single pixel


test suite

(computing) A container that has a set of tests with similar test cases to show that it has some specified set of behaviours.


validation suite

validation suite (plural validation suites)


grey-box testing

black-box testing
black-box testing#English

white-box testing
white-box testing#English

(software, testing) A combination of black-box testing and white-box testing, where knowledge about the internal data structures and algorithms is used to design tests while executing those tests at the user, or black-box, level.


gray-box testing

grey-box testing
grey-box testing#English

(software, testing) Alternative form of grey-box testing.


golden record

(databases) A single authoritative record on an individual customer etc. that draws from various other data sources.


SLAM

SLAM (countable and uncountable, plural SLAMs)

simultaneous localization and mapping#English

(computer science, uncountable) Initialism of simultaneous localization and mapping.


artefacting

(computer graphics) Alternative form of artifacting


artifacting

(computer graphics) The formation of artifacts in a digital image.


RLDRAM

RLDRAM (countable and uncountable, plural RLDRAMs)

A single 32 MByte RLDRAM and its controller has enough throughput to support many PEs possibly up to 20 if some wait states are accepted. Bank collisions are mostly avoided by the MMU hashing policy. There are several Virtex-II-Pro boards with RLDRAM on board which can clock the RLDRAM at 300 MHz with DDR I/O, well below the 400 MHz specification, but the access latency is still 20 ns or 8 clocks.

2005, J.F. Broenink, H.W. Roebbers, J.P.E. Sunter, Communicating Process Architectures 2005: WoTUG-28, IOS Press, →ISBN, page 344:

An example of this is evident in reduced latency DRAMs (RLDRAMs). Figure 8.11 shows a typical Read operation for an RLDRAM. A row activation cycle with Read and Precharge takes less than 15 ns from start to finish, as shown. These devices are built to serve applications that previously resorted to using SRAM. RLDRAMs have a traditional SRAM broadside address interface but are otherwise DRAMs built for low cycle times and low Read latency.

2008, Brent Keeth, DRAM Circuit Design: Fundamental and High-Speed Topics, John Wiley & Sons, →ISBN, page 188:

The first-generation RLDRAM device was designed by Infineon to meet the demands of the market for networking equipment. Subsequently, Micron was brought in as a partner to co-develop RLDRAM and provide a second source. However, Infineon has since abandoned RLDRAM development, and Micron proceeded ahead to develop the second-generation RLDRAM II. RLDRAM and RLDRAM II were designed for use in embedded applications.

2010, Bruce Jacob, Spencer Ng, David Wang, Memory Systems: Cache, DRAM, Disk, Morgan Kaufmann, →ISBN, page 494:

dynamic random access memory
dynamic random access memory#English

(computing) Initialism of reduced latency dynamic random access memory.


curse of dimensionality

Coined by American mathematician Richard E. Bellman.

coinage

Coordinate term: blessing of dimensionality

The curse of dimensionality is that vectors will get exponentially farther and farther away from one another, in Euclidean distance, as the dimensionality increases. A lot of simple operations become impractical above 10 or 20 dimensions, like sorting a large list of vectors based on their distance[…]

2019, Hannes Hapke, Cole Howard, Hobson Lane, Natural Language Processing in Action, Simon and Schuster, →ISBN:

(mathematics, computing) A problem in the analysis of multidimensional systems caused by the sparse nature of the available data.


dumb pipe

(networking) In the context of mobile network operators, a simple network that, with a high enough bandwidth to transfer bytes between a customer's device and the Internet without the need to prioritize content, can afford to be completely neutral with regard to the services and applications the customer accesses.


safe navigation operator

en-noun

safe navigation operator (plural safe navigation operators)

One operator I haven't talked about yet is the safe navigation operator (?.). By preceding a dot with a question mark, you can safely navigate to methods or properties of an object even if that object is null.

2009, Bashar Jawad, Groovy and Grails Recipes, page 57:

The safe navigation operator (?.) provides navigation on the nested properties without getting any exception when a null value is evaluated from any of the properties iterated.

2015, Mert Caliskan, Kenan Sevindik, Beginning Spring, page 278:

C# 6 introduced a cascading nulls operator, also called the null-conditional operator and the safe navigation operator.

2017, Gary McLean Hall, Adaptive Code: Agile coding with design patterns and SOLID principles:

(programming) A binary operator that returns its second argument, unless the first argument is null, in which case it returns null; used to simplify code that would otherwise need multiple explicit checks for nullity.


uniquification

As shown in Figure 1, flex-cell based optimization process can invoke a uniquification process to minimize the number of functionally unique flexcells created during optimization of a given design. In the context of flexcell synthesis, uniquification focuses on identifying the minimum number of unique flex-cells required for optimization, and it is different from the “uniquify” command found in synthesis tools.

2007, David Chinnery, Kurt Keutzer, Closing the Gap Between ASIC & Custom: Tools and Techniques for High-Performance ASIC Design:

(computing) The state of being uniquified.


Mode X

(computer graphics, historical) A non-standard display mode of VGA graphics hardware, having a resolution of 320 × 240 square pixels.


artifacted

(computer graphics, signal processing) Having artifacts.


retval

(programming) Abbreviation of return value.


drive letter

(computing) An alphabetical identifier assigned to a drive or volume on MS-DOS or Windows.


SSDL

The SOAP Service Description Language (SSDL) [20] describes a message exchange from the point of view of a single service...

2008, Nitzsche J. et al.: WSDL 2.0 message exchange patterns: limitations and opportunities, page 1:

In [13], Parastatidis and Webber propose SSDL (SOAP Service Description Language) as a language to describe Web services...

2008, Rosenberg et al.: Integrated metadata support for web service runtimes, page 1:

2005, Parastatidis et al.: The SOAP Service Description Language (SSDL) is a SOAP-centric contract definition language for Web Services, abstract:

SOAP Service Description Language
w:SOAP Service Description Language

(computer languages, databases) Initialism of SOAP Service Description Language.

2007, Oh & Won: Designing an architecture for social semantic digital libraries (SSDL), title:

2010, Alotaibi: Semantic web technologies for digital libraries: from libraries to social semantic digital libraries (SSDL), over semantic digital libraries (SDL), title:

Oh and Won (2007) defined the Social Semantic Digital Library (SSDL) as consisting of an ontology system and supporting user participation and collaboration

2017, Noh: A study on next-generation digital library using context-awareness technology, page 1:

social semantic digital library
social semantic digital library#English

(computer science) Initialism of social semantic digital library.


compspec

The complete command allows you provide a completion specification, or compspec, for individual commands.

2006, Arnold Robbins, Bash Quick Reference:

(computing, shell) Abbreviation of completion specification, the file read by a shell that allows to tab-complete arguments for specific commands.


leaning toothpick syndrome

leaning toothpick syndrome (uncountable)

Introduced in the official Perl documentation, in reference to the shape of the backslash character.

(programming) The situation in which a quoted string expression becomes difficult to read because it contains a large number of escape characters, usually backslashes, to avoid delimiter collision.


HHVM

(computing) Initialism of HipHop Virtual Machine.


server farm

(networking) A collection of computer servers that is usually maintained by an organization to supply server functionality far beyond the capability of a single machine.


hex edit

en-verb

hex edit (third-person singular simple present hex edits, present participle hex editing, simple past and past participle hex edited)

hex edits (present singular third-person)
hex editing (participle present)
hex edited (participle past)
hex edited (past)

(computing) To manipulate the fundamental binary data that constitutes a computer file using a hex editor, which displays the data in hexadecimal format.


clean coder

(programming) A programmer who writes generally clean code.


memory cell

(computing) A fundamental block of computer memory.


pseudolocalization

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

software engineering
software engineering

(software engineering) The testing of software for internationalization compliance using modified versions of the original text (with the use of foreign script etc.) rather than genuine translations.


thunker

And 32-bit Windows applications require the bundled MetaWare Applications Development Kit (ADK), a 32-to-16 bit Windows thunker similar to but predating the Microsoft Win32s system.

1995, Personal Computer Magazine, volume 14, numbers 7-8, page 222:

There were no 32-bit scanner drivers or TWAIN modules, none were forthcoming from Microsoft […] Then along came the TWAIN_32 standard of the universal thunker.

1996, Deke McClelland, Robert Phillips, Photoshop 3 for Windows 95 Bible, page 721:

(programming) A software mechanism that thunks.


subapplication

(computing) An application making up part of a larger application.


ESOP

European Symposium on Programming
w:European Symposium on Programming

(computer science) Initialism of European Symposium on Programming.


nothing-up-my-sleeve number

en-noun

nothing-up-my-sleeve number (plural nothing-up-my-sleeve numbers)

In reference to magic tricks in which the performer may have something concealed in a sleeve (or may demonstrate to the audience that they do not).

The key schedule, however, expanding the key using an essentially one-way method, is more complex, with the binary expansions of both e and the golden ratio of "nothing up my sleeve numbers".

2014 May 21, Mr. Ajay Bhaisare, “Data Protection Outsourcing of Cloud Data to Maintain Trust between Cloud Service and Data Owner Using RC5 Algorithm”, in IJCSMC, volume 3, number 5, page 608:

Anyway, they make the same point: “The BADA55-VPR curves illustrate the fact that 'verifiably pseudorandom' curves with 'systematic' seeds generated from 'nothing-up-my-sleeve numbers' also do not stop the attacker from generating a curve with a one-in-a-million weakness.”

(cryptography) A number which, by its construction, is above suspicion of having hidden properties; used in creating cryptographic functions such as hashes and ciphers.


Han unification

(computing) The assignment of single codepoints to various variant forms of Han characters in Unicode.


UCS

Universal Coded Character Set
w:Universal Coded Character Set

(computing) Initialism of Universal Coded Character Set, a set of characters standardized in ISO 10646.


bang path

(computing) An early form of e-mail address with the components separated by exclamation marks, naming the sequence of networked computers that the mail should be routed through.


readtable

(programming) In Lisp and related languages, a data structure specifying how text characters are to be interpreted syntactically.


Haskeller

Relatively advanced Haskellers might find the exports of default Prelude lacking or even devastating: encouraging the use of String, asynchronous exceptions (error), and partial functions.

2016, Samuli Thomasson, Haskell High Performance Programming, Packt Publishing Ltd, →ISBN, page 363:

(programming) A person who programs in Haskell.


OOCSS

Where OOCSS and SMACSS can be seen as a more of frameworks for thinking about structured CSS combined with some handy rules of thumb, BEM is a much more rigid system for how to author and name your styles.

2016, Andy Budd, Emil Björklund, CSS Mastery, Apress, →ISBN, page 387:

(web design) Initialism of Object-oriented CSS.


mailstorm

(computing, informal) A large influx of email.


soundiness

Soundiness is in fact what is meant in many papers that claim to describe a sound analysis.

2015 February, Benjamin Livshits, Manu Sridharan, Yannis Smaragdakis, Ondřej Lhotȧk, J. Nelson Amaral, Bor-Yuh Evan Chang, Samuel Z. Guyer, Uday P. Khedker, Anders Møller, Dimitrios Vardoulakis, “In defense of soundiness: a manifesto”, in Communications of the ACM, volume 58, number 2:

While this lack of soundness and precision can be viewed as a deficiency, we argue that instead – in the spirit of “soundiness” [23] – it is a strength.

2016 February, Ahmet Salih Buyukkayhan, Kaan Onarlioglu, William K Robertson, Engin Kirda, “CrossFire: An Analysis of Firefox Extension-Reuse Vulnerabilities”, in Proceedings of the ISOC Network and Distributed System Security Symposium (NDSS):

JayHorn is implemented in the spirit of soundiness [14].

2016, Swarat Chaudhuri, Azadeh Farzan, Computer Aided Verification: 28th International Conference, CAV 2016, →ISBN:

(software engineering) A state of being mostly sound; the condition of being rigorously sound in all but some well-defined areas; a best approximation of soundness in an environment where absolute soundness or proof of soundness is not feasible.


soundy

en-adj

soundy (comparative more soundy, superlative most soundy)

more soundy (comparative)
most soundy (superlative)

We draw a distinction between analyses that are soundy—mostly sound, with specific, well-identified unsound choices—and analyses that do not concern themselves with soundness.

There is a recent community initiative [23] calling for the development of soundy analysis to handle “hard” language features (such as reflection).

2015 September, Yue Li, Tian Tan, Jingling Xue, “Effective soundness-guided reflection analysis”, in International On Static Analysis:

In this context, perhaps one can only hope for a soundy static analysis [21]: common features should be handled soundly and more esoteric ones should be under-approximated.

2016, Yan Wang, Hailong Zhang, Atanas Rountev, “On the unsoundness of static analysis for android guis”, in Proceedings of the 5th ACM SIGPLAN International Workshop on State of the Art in Program Analysis:

(software engineering) Mostly sound; sound in all but a few well-defined areas.


integration testing

/ɪntəˈɡɹeɪʃən tɛstɪŋ/

(software) the phase in software testing that occurs after unit testing and before validation testing, where individual software modules are combined and tested as a group.


prototype-oriented programming

(programming) A programming paradigm that encapsulates states and operations inside "prototypes" to design applications and computer programs.

prototyporientierte Programmierung

programming paradigm that uses prototypes to design application and computer programs


joyport

With Bracy's, especially if you're using the Apple system, getting the joyports to work and the initial data entered correctly can be difficult.

1987, Cognitive Rehabilitation, volume 5, page 14:

One or more joyports actually exist as an extra option on many floppy controller cards and I/O cards.

1994, André LaMothe, Teach Yourself Game Programming in 21 Days, page 386:

(computing) A port for connecting a joystick.


multiwindowing

graphical user interface
graphical user interface

(graphical user interface) The ability to switch between multiple open windows.


return value

(computing) The output of a program or subroutine, passed back to the context where it was called; a retval.


fuzzable

Strings are by far the most common primitive that you will use. Strings are everywhere; usernames, IP addresses, directories, and many more things can be represented by strings. Sulley uses the s_string() directive to denote that the data contained within the primitive is a fuzzable string.

2009, Justin Seitz, Gray Hat Python: Python Programming for Hackers and Reverse Engineers:

Sulley works by fuzzing the first fuzzable field to be fuzzed. While it is iterating through all the values it wants to try for that field, all the other fields are untouched and remain at their default value.

2012, Charlie Miller, Dion Blazakis, Dino DaiZovi, iOS Hacker's Handbook, page 172:

(computing) Able to be fuzzed, i.e. tested with randomly generated input.


GOE

About a year and a half ago, Schroeppel and Hickerson found a bunch of patterns with very small predecessor counts. These are used as modules in existence proofs for GOE's within various rectangles, some quite cozy.

1991 March 28, Bill Gosper, “on Life (and Death)”, in comp.theory.cell-automata (Usenet):

This describes briefly the discovery of the first GOL GOE by Roger Banks, saying: "[he] used sophisticated mathematical techniques to prove that a certain 9-by-33 rectangular pattern is itself a Garden-of-Eden pattern."

1999 April 1, Tim Tyler, “proof for garden of eden in GOL ?”, in comp.theory.cell-automata (Usenet):

As far as I know, even a definite result for the 6x6 case would be progress. The most recent investigation of GoEs that I know about was some interesting work that Donald Knuth recently did in passing for his upcoming Volume 4 of _The Art of Computer Programming_, using binary decision diagrams.

2008 October 22, Dave Greene, “State wrt "Garden of Eden"in Conway's "Game of Life"”, in comp.theory.cell-automata (Usenet):

(cellular automata) Initialism of Garden of Eden.


right join

right outer join
right outer join#English


left outer join

en-noun

left outer join (plural left outer joins)

(databases) A join yielding a set of records for two tables, where all rows of the "left" table are enlisted with all rows of the "right" table, even if the join condition does not find any matching row on the "right".


right outer join

right outer join (plural right outer joins)

(databases) A join yielding a set of records for two tables, where all rows of the "right" table are enlisted with all rows of the "left" table, even if the join condition does not find any matching row on the "left".


full outer join

full outer join (plural full outer joins)

(databases) A join yielding a set of records for two tables, where all rows of the "left" table are enlisted with all rows of the "right" table, even if the join condition does not find any matching row on the "left" or on the "right" table.


IIFE

You’ve already seen it mentioned a few times, but in case it wasn’t clear, I’m proposing the term “Immediately-Invoked Function Expression”, and “IIFE” if you like acronyms. The pronunciation “iffy” was suggested to me, and I like it, so let’s go with that. What is an Immediately-Invoked Function Expression? It’s a function expression that gets invoked immediately. Just like the name would lead you to believe.

2010 November 15, Ben Alman, “Immediately-Invoked Function Expression (IIFE)”, in (Please provide the book title or journal name):

(programming) Initialism of immediately-invoked function expression.


unlinker

(computing) A program or process that unlinks.


bit banging

(computing, slang) A technique for serial communications using software instead of dedicated hardware. The software directly sets and samples the state of pins on the microcontroller.


shadow memory

(programming) The use of one part of computer memory to store information about other parts of memory, used for example to keep track of which parts have been allocated by the program.


microdocument

(computing) A short subsection of a document.


mechanical mouse

mechanical mouse (plural mechanical mice)

Retronym for mouse, coined after the invention of the optical mouse to refer specifically to the type of mouse existing before then.

(computing) A pointing device which uses a ball to detect movement.


optical mouse

(computing) A mouse (pointing device) that uses a light source and a light detector (for example, an LED and an array of photodiodes) to detect movement, as opposed to the earlier mechanical mouse.


SPA

SPA (countable and uncountable, plural SPAs)

(networking) Initialism of single-packet authorization.


asynch

(computing) Abbreviation of asynchronous.


Kubernetes

Borrowed from Ancient Greek κυβερνήτης (kubernḗtēs, “captain, steersman”). Doublet of governor and cybernetics.

bor+

(computing) An open-source orchestrator system of containerized applications, originally designed by Google.


lift and shift

(computing) The practice of deploying existing on-premises software to the cloud, with minimal changes to its architecture.


golden image

(computing) The master disk image used in the initialization of VMs, hard disks, etc.


VDI

(computing) Initialism of virtual desktop infrastructure.

(computing) Initialism of virtual disk image.


Timsort

From Tim + sort, named after Tim Peters, who implemented it in 2002 for the Python programming language.

(computing theory) A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data.


commify

en-verb

commify (third-person singular simple present commifies, present participle commifying, simple past and past participle commified)

commifies (present singular third-person)
commifying (participle present)
commified (participle past)
commified (past)

(informal, chiefly software) To insert commas into (a piece of code).


secure by design

(software engineering, of software) designed from the ground up to be secure


Byzantine fault tolerance

en-noun

Byzantine fault tolerance (usually uncountable, plural Byzantine fault tolerances)

Byzantine fault tolerance (BFT) came about since it represents a valid solution to the Byzantine Generals Problem. BFT is a crucial part of an effective blockchain platform, and there are multiple ways in which tolerance can be implemented.

2020, Joseph Holbrook, Architecting Enterprise Blockchain Solutions, John Wiley & Sons, →ISBN, page 121:

(computing) The dependability of a fault-tolerant (distributed) computer system, where components may fail without perfect information about the state of the components.

拜占庭容錯

dependability of a fault-tolerant computer system


faithful functor

faithful functor (plural faithful functors)

(category theory) A functor which maps morphisms from its source to its target category in such a way that the restriction of that mapping to any source hom-set is injective into the corresponding target hom-set.


full functor

(category theory) A functor which maps morphisms from its source to its target category in such a way that the restriction of that mapping to any source hom-set is surjective into the corresponding target hom-set.


mob programming

(software engineering) A software development approach where the whole team works on a single project at a single computer at the same time.


superpeer

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

(networking) A node in a peer-to-peer system that acts as a local server for other peers.


AYT

(networking) Initialism of are you there?: a telnet command sequence sent from client to server to verify that the connection is still active.


Hann function

Named after the Austrian meteorologist Julius von Hann.

(signal processing) A discrete window function, w(n)=1/2;(1- cos ((2πn)/(N-1))), typically used to select a subset of a series of samples in order to perform a Fourier transform or other calculation.


reshade

en-verb

reshade (third-person singular simple present reshades, present participle reshading, simple past and past participle reshaded)

reshades (present singular third-person)
reshading (participle present)
reshaded (participle past)
reshaded (past)

In addition, we can feed the output image back into the shader to reshade selected objects, without disturbing the color in other objects that share pixels with the one we are reshading.

1988, ACM SIGGRAPH 88: Course Notes 15th Annual Conference on Computer Graphics and Interactive Techniques, Atlanta, Georgia:

(transitive, computer graphics) To render again with different shading.


Postel's law

Named after Internet pioneer Jon Postel (1943–1998).

named-after

Contravariance is consistent with Postel's Law: “Be liberal in what you accept, and conservative in what you send.”

2005, Jesse Liberty, Visual C# 2005: A Developer's Notebook, O'Reilly Media, →ISBN, page 47:

(software engineering) The design principle that software should be conservative as to its own behaviour (i.e. strictly compliant with specifications) but liberal in the behaviour it tolerates from other systems.


linel

(computer graphics) A unit segment between surfels.


monoidal category

en-noun

monoidal category (plural monoidal categories)

(category theory) A category 𝒞 with a bifunctor ⊗:𝒞×𝒞→𝒞 which may be called tensor product, an associativity isomorphism α_(A,B,C):(A⊗B)⊗C≃A⊗(B⊗C), an object I which may be called tensor unit, a left unit natural isomorphism λ_A:I⊗A≃A, a right unit natural isomorphism ρ_A:A⊗I≃A, and some "coherence conditions" (pentagon and triangle commutative diagrams for those isomorphisms).


call site

(programming) The section of code from which another section is called.


Galois connection

Galois connection (plural Galois connections)

From Galois (attributive form of Galois theory) + connection; ultimately after French mathematician Évariste Galois. Coined by Norwegian mathematician Øystein Ore in 1944, Galois connexions, Transactions of the American Mathematical Society, 55, pages 493-513.

1986, Horst Herrlich, Miroslav Hušek, Galois Connections, Austin Melton, Mathematical Foundation of Programming Semantics: International Conference, Proceedings, Springer, Lecture Notes in Computer Science: 239, page 122,
Define maps G:A→B and F:B→A by G(a)=y!∈!Y|∀x!∈!axρy and F(b)=x!∈!X|∀y!∈!bxρy. Then (F,G) is called a Galois connection of the first kind.

Finally, we discuss Galois connections. It is interesting to note that these definitions can be found in Birkhoff (1940, 1948, 1967) under the heading of "polarities," and Everett (1944) showed that all Galois connections defined on power sets can be obtained from polarities.

2001, J. Michael Dunn, Gary M. Hardegree, Algebraic Methods in Philosophical Logic, Oxford University Press, page 398:

Galois connections appear in several areas of mathematics and computer science, and their applications. A Galois connection between sets X and Y is a pair #92;left#92;langle#92;uparrow,#92;downarrow#92;right#92;rangle of mappings #92;uparrow assigning subcollections of Y to subcollections of X, and #92;downarrow assigning subcollections of X to subcollections of Y.

2006, Radim Bělohlávek, Taťána Funioková, Vilém Vychodil, “Galois connections with Truth Stressers: Foundations for Formal Concept Analysis of Object-Attribute Data with Fuzzy Attributes”, in Bernd Reusch, editor, Computational Intelligence, Theory and Applications: International Conference, Proceedings, Springer,, page 205:

partially ordered set
partially ordered set

(category theory, order theory) A type of correspondence between partially ordered sets (posets), also applicable to preordered sets.


outhack

en-verb

outhack (third-person singular simple present outhacks, present participle outhacking, simple past and past participle outhacked)

outhacks (present singular third-person)
outhacking (participle present)
outhacked (participle past)
outhacked (past)

(transitive, computing) To surpass in hacking.


wedtro

There is no point in demos, they are made for fun. They don't show anything which would have a special point... unlike wedtro, xmastro, etc. 99% of demos are whole bunch of routines thrown together... some others don't and have kind of a story line, Angel IMO was one of them.

1995, Houman Ghahremanlou, “Stupid remarks !”, in comp.sys.ibm.pc.demos (Usenet):

Hi Trixter! Long time no speak! How's life for you these days? If everything goes well, I'll have to make a wedtro too in a few months ;).

2002, JAL / Nostalgia, “Old demos”, in comp.sys.ibm.pc.demos (Usenet):

(demoscene) An intro created to announce and celebrate a wedding.


quasitrivial

(mathematics, computing theory) Trivial in a restricted sense or to some limited extent.


NRE

(networking) Initialism of network reliability engineering.


toplevel

(programming) Alternative form of top-level


ISMS

Information Security
information security#English

Management System
management system#English

(computing, Internet) Initialism of Information Security Management System.


EWS

(Microsoft, software) Initialism of Exchange Web Services. (an API for the Microsoft Exchange e-mail server)


TAA

temporal anti-aliasing
w:temporal anti-aliasing

(computing) Initialism of temporal anti-aliasing.


AA tree

From the initials of its inventor Arne Andersson. Coined by Mark Allen Weiss in 1994.

(computing) A form of balanced tree used for storing and retrieving ordered data efficiently, a variation of the red-black tree.


autoconcurrent

(computing theory) Exhibiting or relating to autoconcurrency; occurring simultaneously and in parallel.


softirq

The second strategy consists of continuously rechecking for pending softirqs.

2005, Daniel P. Bovet, Marco Cesati, Understanding the Linux Kernel:

(computing) A software interrupt request.


graphics adapter

en-noun

graphics adapter (plural graphics adapters)


born digital

(information science) Created in an electronic format; never having existed in a physical edition.


UNIVAC

Universal Automatic Computer
w:Universal Automatic Computer

(historical, computing) Acronym of Universal Automatic Computer.


AVL tree

Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.

(computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.


MDAC

Microsoft Data Access Components
w:Microsoft Data Access Components

(computing) Initialism of Microsoft Data Access Components.


VLSM

(computing) Initialism of variable-length subnet masking.


compile-time

(computing) Operations performed by a compiler (the “compile-time operations”).

Programming language
programming language

(computing) Programming language requirements that must be met by source code for it to be successfully compiled (the “compile-time requirements”).

(programming) Properties of the program that can be reasoned about during compilation.


agilist

(software engineering) A practitioner of agile software development.


Kleene closure

Named in honor of Stephen Cole Kleene (1909–1994), an American mathematician. The “closure” part comes from the fact that a Kleene closure is closed with respect to concatenation; cf. free monoid.

(mathematics, computer science) The set of all strings of finite length made up of elements of a given set. (Then the Kleene closure is said to be of that given set. For a given set S, its Kleene closure may be denoted as S^*. The Kleene closure includes a string of zero length. Strings are equivalent to ordered tuples but written without the parentheses and commas.)


group object

If H is another group object in C, a morphism f#58;G#92;rightarrowH is a morphism of group objects if it commutes with the three structure morphisms; as is standard for sets and true generally (again by Lemma 7.7), it is enough to check #92;mu. Thus we form the category #92;textit#123;Gp#125;(C) of all group objects in C; one important example is #92;textit#123;Gp#125;(#92;textit#123;Ho#125;).

1995, J. Michael Boardman, “Chapter 14: Stable Operations in Generalized Cohomology”, in I.M. James, editor, Handbook of Algebraic Topology, Elsevier (North-Holland), page 617:

2005, Angelo Vistoli, Part 1: Grothendieck typologies, fibered categories, and descent theory, Barbara Fantechi, Lothar Göttsche, Luc Illusie, Steven L. Kleiman, Nitin Nitsure, Angelo Vistoli, Fundamental Algebraic Geometry: Grothendieck's FGA Explained, American Mathematical Society, page 20,
The identity is obviously a homomorphism from a group object to itself. Furthermore, the composite of homomorphisms of group objects is still a homomorphism; thus, group objects in a fixed category form a category, which we denote by Grp(C).

(category theory) Given a category C, any object X ∈ C on which morphisms are defined corresponding to the group theoretic concepts of a binary operation (called multiplication), identity and inverse, such that multiplication is associative and properties are satisfied that correspond to the existence of inverse elements and the identity element.


geopbyte

The term was in use on English-language websites by 2009 (see quotation below). Before that, it had begun to appear on Spanish-language sites by 2007. The earliest known use is in a February 2006 edit to Spanish Wikipedia's "Byte" article by an anonymous contributor, whose immediately preceding edits to another article make it clear that the term was inspired by Korean 겁 (劫, geop), presumably in the sense "kalpa" (an extremely long span of time in Hindu and Buddhist chronology).

I don't remember where I found this:[…]1000 Brontobytes = 1 Geopbyte[…]Geopbyte: Not sure why this term was created. It's doubtful that anyone alive today will ever see a Geopbyte hard drive.

2009 June 27, NightFire [comment author], “WinXP Overhaul Guide: How to Make It Look Like Vista, Run Like Lightning, and Stay Productive, Fast & Smooth”, in Instructables, comment:

Geopbyte: a geopbyte is 1,024 brontobytes, which is too much data to even comprehend.

2014, John G. Iannarelli, Michael O'Shaughnessy, Information Governance and Security Protecting and Managing Your Company's Proprietary Information, page 35:

Any substantial company that doesn't take advantage of its own geopbytes of available data is in danger of eventual extinction.

2015, Jenny Dearborn, Data Driven, page 41:

Chapter 16, “Healthcare Analytics”: Covering data analytics/big data/population management; effectively managing the geopbytes of data out there lurking in our electronic records […]

2015, Patricia Sengstack, Charles Boicey, Mastering Informatics: A Healthcare Handbook for Success, page 18:

You cannot wrap your head around how big a geopbyte is.

(computing, nonstandard) Roughly 10³⁰ bytes; 1024 brontobytes.


SQS

Spatial Query Server
w:Spatial Query Server

(databases) Initialism of Spatial Query Server (Boeing's spatial database)


deauthenticate

en-verb

deauthenticate (third-person singular simple present deauthenticates, present participle deauthenticating, simple past and past participle deauthenticated)

deauthenticates (present singular third-person)
deauthenticating (participle present)
deauthenticated (participle past)
deauthenticated (past)

(transitive, computing) To revoke the authentication of; to cause no longer to be authenticated.


Flajolet-Martin algorithm

Introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article "Probabilistic Counting Algorithms for Data Base Applications".

(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.


off-side rule

The computer-programming sense was coined by British computer scientist Peter Landin in 1966 and named after the rule in football.

coin

Blocks in Pythons are delimited by white space indentation: the increase in indentation delimited the start of statements while the decrease signifies the end of the current block (off-side rule).

2018, Encyclopedia of Bioinformatics and Computational Biology, Elsevier, →ISBN, page 195:

programming language
programming language

(programming) In some programming languages, the convention by which the indentation of a line of source code affects its meaning.


group scheme

It is instructive to give a few explicit examples of such^([affine]) group schemes:

1973, Jean A. Dieudonné, Introduction to the Theory of Formal Groups, Marcel Dekker, page 6:

We will tend to use boldface characters, such as #92;mathbf#123;G#125;, for algebraic groups over k, as also for group schemes over #92;mathfrak#123;X#125; that are obtained from groups over k. A quintessential example is #92;mathbf#123;G#125;#95;#92;mathfrak#123;X#125;#61;#92;mathbf#123;G#125;#92;times#95;#123;k#125;#92;mathfrak#123;X#125;. For arbitrary group schemes, or more generally group functors, over #92;mathfrak#123;X#125; we shall tend to use german characters, such as #92;mathfrak#123;G#125;.

2013, Philippe Gille, Arturo Pianzola, Torsors, Reductive Group Schemes and Extended Affine Lie Algebras, American Mathematical Society, page 11:

Every finite flat group scheme of order p over S is of the form Gᴸ#95;#123;a,b#125; for some triple (L,a,b), and G#123;L#125;#95;#123;a,b#125; is isomorphic to G#123;L#95;1#125;#95;#123;a#95;1,b#95;1#125; if and only if there exists an isomorphism from L to L#95;1 carrying a to a#95;1 and b to b#95;1.

2014, J. S. Milne, “The Work of John Tate”, in Helge Holden, Ragni Piene, editors, The Abel Prize 2008-2012, Springer,, page 303:

(category theory, scheme theory) A group object that is an object in a category of schemes; a scheme that has certain properties that generalise the concept of group.


group functor

In order to be able to efficiently state the main results of this chapter (in §4) we formulate here a group-functor version of the R-nilpotent tower lemma (Ch.III, 6.4).

1972, A. K. Bousfield, D. M. Kan, Homotopy Limits, Completions and Localizations, Springer, page 106:

A direct product of k–group functors is again a k–group functor; so is a fibre product if the morphisms used in its construction are homomorphisms of k–group functors.

2003, Jens Carsten Jantzen, Representations of Algebraic Groups, 2nd edition, American Mathematical Society, page 20:

By a group functor we mean a functor from small k-algebras to groups. A homomorphism of group functors is a natural transformation. A subgroup functor of a group functor G is a subfunctor H such that H(R) is a subgroup of G(R) for all R; it is normal if H(R) is normal in G(R) for all R.

2017, J. S. Milne, Algebraic Groups: The Theory of Group Schemes of Finite Type over a Field, Cambridge University Press, page 118:

(category theory, algebraic geometry) A group object that is an object in a category of functors; a functor with certain properties that generalise the concept of group.


interserver

An interserver communications server can support and communication facility: connection-based, connectionless, urgent messages, communication via shared memory, and other paradigms.

1987, Y. Artsy, A Study of Fully Open Computing Systems, page 58:


decompactor

(computing) A program or algorithm for decompressing data.


Hopcroft's algorithm

finite-state automaton
finite-state automaton

(computing theory) An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.


skip list

Skip list follows a linked list alike structure. However, the worst case time complexity for a search operation in linked list in O(n) as the list is linearly traversed while searching whereas for a skip list it is O(#92;logn).

2021, Neeraj Kumar, Arzoo Miglani, Probabilistic Data Structures for Blockchain-Based Internet of Things Applications, CRC Press, →ISBN, page 187:

(computing theory) A probabilistic data structure that allows fast search within an ordered sequence of elements by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one.


subtrie

(computer science) A trie data structure making up part of a larger trie.


wordsize

(computing) The size of a word, normally 32 or 64 bits (binary digits).


finger-friendly

en-adj

finger-friendly (comparative more finger-friendly, superlative most finger-friendly)

more finger-friendly (comparative)
most finger-friendly (superlative)

(computing) Designed to work well with touch-screen input, as well as or instead of mouse, trackball, etc.


cubesort

From cube + sort, in reference to the multidimensional data structure.

(computing theory) A parallel sorting algorithm that builds a self-balancing multidimensional array from the keys to be sorted.


self-balancing

a self-balancing binary search tree

(computing theory) Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions.


Church-Rosser theorem

Introduced by Alonzo Church and J. Barkley-Rosser in a 1936 paper.

(mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result.


video board

(computing) A board that outputs video to a screen; a graphics card.


subiteration

(mathematics, computing) A subsidiary iteration


vector bundle

Let E and F be two vector bundles on a compact algebraic set X.

1995, Mauro Beltrametti, Andrew John Sommese, The Adjunction Theory of Complex Projective Varieties, Walter de Gruyter, page 8:

2012, Igor Burban, Bernd Kreussler, Vector Bundles on Degenerations of Elliptic Curves and Yang-Baxter Equations, American Mathematical Society, page 5,
This solutions actually depend on the choice of a trivialisation ξ of the universal family 𝒫(n,d) of stable vector bundles of rank n and degree d.

Definition 6.1.5 A non-zero vector bundle #92;mathcal#123;F#125; on X is said to be decomposable if it can be written as #92;mathcal#123;F#125;#95;1#92;oplus#92;mathcal#123;F#125;#95;2 with #92;mathcal#123;F#125;#95;1 and #92;mathcal#123;F#125;#95;2 non-zero vector bundles. Otherwise it is said to be indecomposable.

2017, David J. Benson, Representations of Elementary Abelian p-Groups and Vector Bundles, Cambridge University Press, page 130:

(topology, category theory) A fiber bundle for which the fiber is a vector space.


remote hands

(computing) Technicians who perform tasks on demand at a remote site, typically a data centre.


fraggle attack

The original proof-of-concept code, in the C programming language, was called fraggle.c.

(computing, security) A particular variation of the smurf attack, using UDP traffic bearing the victim's spoofed IP address sent to certain standard ports.


nuke and pave

en-verb

nuke and pave (third-person singular simple present nukes and paves, present participle nuking and paving, simple past and past participle nuked and paved)

nukes and paves (present singular third-person)
nuking and paving (participle present)
nuked and paved (participle past)
nuked and paved (past)

I'm so sorry, I was hoping that we could see each other . . . there is a solution to this, when you are here, before you go back, I can take my computer in and get it nuked and paved.

2009, T. G. Diamond, My Darling Davis, how real is your love?, page 290:

(computing, slang) To wipe a computer's hard disk and reinstall everything, as a drastic fix for problems.


top-hat transform

en-noun

top-hat transform (plural top-hat transforms)

So called because a graph of the function has a shape resembling a top hat.

(mathematics, signal processing) A particular operation that extracts small elements and details from images.


bottom-hat transform

bottom-hat transform (plural bottom-hat transforms)

black top-hat transform
black top-hat transform#English

(mathematics, signal processing) Synonym of black top-hat transform


black top-hat transform

black top-hat transform (plural black top-hat transforms)

(mathematics, signal processing) A form of the top-hat transform that finds the elements in the input image that are darker than their surroundings.


white top-hat transform

white top-hat transform (plural white top-hat transforms)

(mathematics, signal processing) A form of the top-hat transform that finds the elements in the input image that are brighter than their surroundings.


freedomware

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

[…] And last of the “open software”, a rarer implementation is sourceware. A variation of freedomware, sourceware offers “open source” code with “closed (proprietary) standards”.

2005, Sys Admin: The Journal for UNIX System Administrators, page 48:

(software, rare) free software (with source code available), distinguished from freeware


overindex

en-verb

overindex (third-person singular simple present overindexes, present participle overindexing, simple past and past participle overindexed)

overindexes (present singular third-person)
overindexing (participle present)
overindexed (participle past)
overindexed (past)

(programming, transitive) To attempt to access an element beyond the bounds of (an array).


routability

(chiefly computing) Ability to be routed.