automated essay scoring

natural language processing
natural language processing

(computational linguistics) The use of specialized computer programs and natural language processing to evaluate and assign grades to essays in educational settings.


automatic summarization

computational linguistics
computational linguistics

(computational linguistics) The process of using AI algorithms to computationally condense a set of data.


Bradford's law

Named after Samuel C. Bradford (1878–1948).

named-after

(computational linguistics) A pattern that observes the diminishing returns in the search for references within science journals.


Brown clustering

Named after Peter Fitzhugh Brown (1955–).

(computational linguistics) An approach in natural language processing that involves grouping words into clusters based on distributional information and shared contexts within bigram language models.


cache language model

en-noun

cache language model (plural cache language models)

(computational linguistics) A type of statistical language model that assigns probabilities to word sequences based on a probability distribution.


stubbify

en-verb

stubbify (third-person singular simple present stubbifies, present participle stubbifying, simple past and past participle stubbified)

stubbifies (present singular third-person)
stubbifying (participle present)
stubbified (participle past)
stubbified (past)

(transitive, computing) To make (something) use stubs (placeholder procedures).


dynamic inconsistency

(economics, game theory) A situation in which a decision maker's preferences change over time in such a way that a preference can become inconsistent at another point in time.


co-occurrence network

en-noun

co-occurrence network (plural co-occurrence networks)

(computational linguistics) A text analysis method that visually represents relationships among entities based on their co-occurrence in electronic text.


collocation extraction

(computational linguistics) The automated process of identifying and extracting word combinations that frequently appear together in a given corpus.


computational humor

artificial intelligence
artificial intelligence

(computational linguistics) A field within computational linguistics and artificial intelligence that leverages computers for research on humor.


computational lexicology

(computational linguistics) The use of computers to analyze lexicons, especially machine-readable dictionaries.


computational semantics

(computational linguistics) The study of automating the creation and interpretation of meaning representations in natural language expressions.


content determination

(computational linguistics) The process of selecting and organizing information within a generated text.


LAA

LAA (countable and uncountable, plural LAAs)

(networking, countable) Initialism of locally administered address.

(computing, uncountable) Initialism of large address awareness.


deep learning speech synthesis

deep learning speech synthesis (uncountable)

(computational linguistics) The use of sophisticated neural networks to generate lifelike human speech from written text or spectrum data.


distributional semantics

(computational linguistics) A field of research focused on quantifying and categorizing the semantic similarities between linguistic items.


distributional–relational database

distributional–relational database (plural distributional–relational databases)

database management system
database management system

(computational linguistics) A type of database management system that enhances the semantics of structured data by using distributional word-vector representations.


word time

(computing) The amount of time required to transfer a machine word between different memory units.

(computing) The amount of time that passes between the reading of the first bits of consecutive words.


memory unit

(computing) A component of a computer system used to store data, instructions and information.


machine word

(computing) A unit of information of a standard number of characters, appropriate for a fixed wordlength computer.


filtered-popping recursive transition network (plural filtered-popping recursive transition networks)

(computational linguistics) An extension of recursive transition networks.


foundation model

foundation model (plural foundation models)

(computational linguistics) An AI model trained on comprehensive data, enabling its application across various use cases such as chatbots and generative AI.


task-specific

domain-specific language
domain-specific language

(computing) Referring to domain-specific languages that are designed around supporting specific user tasks.


man-in-the-middle attack

man-in-the-middle attack (plural man-in-the-middle attacks)

Man-in-the-middle attacks clandestinely place something (such as a piece of software or a rouge router) between a server and the user about which neither the server's administrators nor the user is aware.

2014, Emmett Dulaney, Security, page 324:

In the general man-in-the-middle attack, the role of E in a tag access operation is to fake and forward data.

2016, Ho-won Kim, Dooho Choi, Information Security Applications, page 70:

It had taken Robert Lemoine barely twenty minutes to execute the man-in-the-middle attack.

2023, Eleanor Catton, Birnam Wood, page 76:

(computing, security) A security attack in which someone intercepts the communication between a device and the server it is connected to, simulating the device to the server and simulating the server to the device.


referenceness

Coordinate term: valueness

(programming, rare) The quality of being a reference or a reference type.


bit time

network interface card
network interface card

(computing, networking) The amount of time it takes for one bit to be ejected from a network interface card operating at a predefined standard speed.


Gale–Church algorithm

Named after William A. Gale and Kenneth W. Church.

(computational linguistics) A method that aligns corresponding sentences in a parallel corpus.


generative lexicon

(computational linguistics) A linguistic semantics theory that challenges purely verb-centric approaches to compositionality.


grammar induction

(computational linguistics) The process of constructing a model that captures the characteristics of observed objects by learning a formal grammar.


inside–outside–beginning

(computational linguistics) A tagging scheme commonly employed in tasks such as named-entity recognition within computational linguistics.


intelligent character recognition

intelligent character recognition (uncountable)

(computational linguistics) An advanced technology specialized in extracting handwritten text from images.


interlingual machine translation

interlingual machine translation (uncountable)

(computational linguistics) A classic method where the source language is converted into an abstract, language-independent representation called interlingua.


near real-time

(computing) Referring to a data-processing system that is somewhat slower than real-time.


quiesce time

(computing) The amount of time required to render a computer system inactive, or the amount of time between periods of inactivity.


randomized polynomial time

randomized polynomial time (countable and uncountable, plural randomized polynomial times)

(mathematics, computer science) The complexity class of problems for which a probabilistic Turing machine exists with certain properties.


de-archive

en-verb

de-archive (third-person singular simple present de-archives, present participle de-archiving, simple past and past participle de-archived)

de-archives (present singular third-person)
de-archiving (participle present)
de-archived (participle past)
de-archived (past)

(transitive, computing) To render a file that has been archived available for editing.


language resource

en-noun

language resource (plural language resources)

(computational linguistics) Linguistic material used for developing, enhancing, or assessing language processing applications.


Lesk algorithm

Named after American computer scientist Mike Lesk (1945–).

named-after

(computational linguistics) A classical algorithm that disambiguates word senses by comparing dictionary definitions of an ambiguous word with its surrounding context.


document structuring

(computational linguistics) The systematic arrangement and grouping of sentences within a generated text.


lexical choice

(computational linguistics) The selection of content words in a generated text.


lexical resource

en-noun

lexical resource (plural lexical resources)

(computational linguistics) A linguistic asset comprising information about the words and their meanings within one or more languages.


lexical simplification

(computational linguistics) A subtask of text simplification that swaps words or phrases in a text to make it simpler and easier to understand, reducing its complexity.


lexical substitution

(computational linguistics) The task of replacing a word with another word while maintaining the meaning and context of the original sentence or phrase.


logic form

(computational linguistics) The representation of natural language sentences in first-order logic, where concept predicates are combined through shared arguments.


time hierarchy theorem

(mathematics, computer science) A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide.


flamegraph

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

We spent many hours running benchmarks, poring over flamegraphs, and digging through internal Node.js code.

2021, I. I. Thomas Hunter, Bryan English, “Preface”, in Multithreaded JavaScript, O'Reilly, →ISBN, page xi:

(computing) A visual representation of hierarchical data used to analyze system and application performance metrics.


return key

First known use appears c. 1965 in the publication Programming IBM 1620 by E.A. Weiss.

(computing, computer hardware) A key on a computer keyboard commonly used to execute a command or confirm the input of keyed text.


enter key

First known use appears c. 1955, in the publication Applied Electronics: Proceedings.

(computing, computer hardware) A type of return key generally present on extended keyboards with a numeric keypad.


forty weepy weepy

From a message whose plaintext began fortyweepyyweepy: German fort (“forth”), short for Fortsetzung (“continuation”) + weep, typewriter code for 23:30, the time of the previous message. Enigma machines had no number keys, so the letter y marked the letters to be interpreted as numbers.

(cryptography, historical) Cryptanalysis of an Enigma message which was a continuation of a previous message sent at a known time.


database key

(computing, databases) A unique identifier in the database management system IDMS, which indicates the record occurrence's physical location in the database.


unique key

(computing, databases) A set of one or more than one columns or fields of a table that uniquely identifies a record in a database table.


passive attack

(cryptography) An attack in which the cryptanalyst cannot interact with any of the parties involved, attempting to break the system solely based upon observed data such as ciphertext.


outscriber

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

(computing, historical) A magnetic recording device that serves as a buffer for data being transmitted from computer to printer, to reduce delays in printing.


minimal recursion semantics

minimal recursion semantics (uncountable)

(computational linguistics) A computational semantic framework employed in typed feature structure formalisms.


mobile translation

(computational linguistics) Electronic devices or software applications that provide audio translation.


morphological dictionary

morphological dictionary (plural morphological dictionaries)

(computational linguistics) A resource that documents the relationship between surface forms and their corresponding lexical forms.


morphological pattern

morphological pattern (plural morphological patterns)

(computational linguistics) A systematic set of associations or operations used to construct the different forms of a lexeme.


multilingual notation

multilingual notation (plural multilingual notations)

(computational linguistics) A system used in lexical resources to denote words or phrases in multiple languages.


timewheel

timewheel (countable and uncountable, plural timewheels)

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

The three atomicity semantics of an update broadcast using the timewheel group communication service are affected by the group membership protocol.

1998, Shivakant Mishra, Christof Fetzer, Flaviu Cristian, “The Timewheel Group Membership Protocol”, in Jose Rolim, editor, Parallel and Distributed Processing, page 678:

The event-driven simulator uses a timewheel to manage the relationships between components.

2004, Wayne Wolf, FPGA-Based System Design, pages 3-61:

Then, a pointer into the timewheel table indicates the current time slot and the owner of the resource during that time slot.

2004, William James Dally, Brian Patrick Towles, Principles and Practices of Interconnection Networks, page 294:

Timewheels are used in event-driven simulators to control the order in which simulated events are processed.

2016, Marilyn Wolf, Computers as Components, page 443:

(computing) A circular array of items sorted by time.


autoescape

en-verb

autoescape (third-person singular simple present autoescapes, present participle autoescaping, simple past and past participle autoescaped)

autoescapes (present singular third-person)
autoescaping (participle present)
autoescaped (participle past)
autoescaped (past)

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

(transitive, computing) To escape (cause a text character to be interpreted literally) automatically.


circulation time

en-noun

circulation time (countable and uncountable, plural circulation times)

The circulation time of a slot in front of an access window has been chosen as the basic unit of time.

1982, Cees J. van Spronsen, Lutz Richter, Microsystems: Architecture, Integration, and Use, page 24:

The first record for the day gives a base time, while subsequent records for the day each have a circulation time associated with them; the circulation time is thus calculated by subtracting from the current log-on time the log-on time of the previous run by the same user.

2001, Per Brinch Hansen, Classic Operating Systems, page 94:

This mechanism provides latency hiding by decoupling the micro-threaded processor from the token circulation time.

2006, Nabil Hasasneh, Ian Bell, Chris Jesshope, “Scalable and Paritionable Asynchronous Arbiter for Micro-threaded Chip Multiprocessors”, in Werner Grass, Bernhard Sick, Klaus Waldschmidt, editor, Architecture of Computing Systems - ARCS 2006, page 266:

(computing, computer science) The amount of time that elapses in a multiprocess system from the time when a process is loaded for execution until the time when the same process is next loaded for more processing.


binding time

binding time (countable and uncountable, plural binding times)

(programming) The point in time when symbolic references to data are converted into physical machine addresses.

programming language
programming language

(programming) The point in time when a variable is assigned its type in a programming language.


assembly time

assembly time (countable and uncountable, plural assembly times)

(programming) The amount of time required for a computer to translate symbolic computer language into instructions of a machine language.


average access time

(computing, computer hardware) The average amount of time required for a storage device to transfer data to the CPU.


seek time

seek time (countable and uncountable, plural seek times)

(computing, computer hardware) The measurement of time required for the head assembly on the actuator arm of a hard drive to travel to the track of the disk where the data will be read or written.


time-of-check to time-of-use

software engineering
software engineering

(software engineering) A class of software bugs caused by a race condition involving the checking of the state of a part of a system, such as a security credential, and the use of the results of that check.


hopscotch hashing

(computer science) A scheme for resolving hash collisions, having an insertion algorithm that involves a series of hops.


Robin Hood hashing

An allusion to the folkloric Robin Hood's practice of stealing from the rich to give to the poor.

(computer science) A scheme for resolving hash collisions that favors the displacement of the element that is farthest from its home location.


bit bashing

(computing, slang) Synonym of bit banging


backup copy

(computing, software) A duplicate instance of an application, datafile, server or system created as a means to restore the original data in case it is deleted, corrupted or lost.


Turing equivalent

(computing theory, of a computing system) Capable of computing precisely the same set of functions as a Turing machine can compute.


transactional memory

Since mutating state exposes those components to all the problems of concurrency, it is common practice to use some kind of transactional memory to protect the mutable variables from concurrent updates […]

2017, Robert C. Martin, Clean Architecture: A Craftsman's Guide to Software Structure and Design, Prentice Hall, →ISBN:

(computing) A concurrency control mechanism analogous to database transactions for controlling access to shared memory.


wakelock

(programming) A lock that can be acquired by software for the purpose of preventing the mobile device from going into a locked standby state during a particular operation.


reservoir computer

reservoir computer (plural reservoir computers)

(computing) A reservoir computing system.


echo state network

echo state network (plural echo state networks)

recurrent neural network
recurrent neural network

(computing) A type of reservoir computer that uses a recurrent neural network with a sparsely connected hidden layer. The weights of output neurons can be learned so that the network can produce or reproduce specific temporal patterns.


liquid state machine

liquid state machine (plural liquid state machines)

spiking neural network
spiking neural network

(computing) A kind of reservoir computer that uses a spiking neural network with nodes randomly connected to each other.


NEXPTIME

computational complexity theory
computational complexity theory

nondeterministic Turing machine
nondeterministic Turing machine

(computer science) In computational complexity theory, a complexity class in which the set of decision problems can be solved by a nondeterministic Turing machine using time 2^(nᴼ⁽¹⁾).


computational complexity theory

computational complexity theory (countable and uncountable, plural computational complexity theories)

computational complexity theories (plural)

(mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other.


nondeterministic Turing machine

nondeterministic Turing machine (plural nondeterministic Turing machines)

nondeterministic Turing machines (plural)

Coordinate term: deterministic Turing machine

(computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read.


deoptimizer

(programming) A process or algorithm that deoptimizes.


Church-Rosser property

Church-Rosser property (plural Church-Rosser properties)

Alonzo Church and J. Barkley Rosser proved in 1936 that lambda calculus has this property.

(logic, computer science) The property of a rewriting system for which x stackrel *↔y implies x mathbin ↓y for all objects x, y.


disk access time

disk access time (countable and uncountable, plural disk access times)

(computing, computer hardware) The total amount of time required for an operating system to process a read-write request involving disk storage.


Atwood's Law

Coined by American software developer, author, blogger and entrepreneur Jeff Atwood in 2007 (see quotation below).

coinage

This was later codified in a more formal W3C document, The Rule of Least Power. I propose a corollary to this rule, which in the spirit of recent memes, I'll call Atwood's Law: any application that can be written in JavaScript, will eventually be written in JavaScript.

2007 July 17, Jeff Atwood, “The Principle of Least Power”, in Coding Horror, archived from the original on 2024-02-07:

Since that time, web developers have produced nearly every type of application, including full-blown, cloud-based office suites (see Zoho.com), social APIs like Facebook's JavaScript SDK, and even graphically intensive video games. ¶ All of this is serving to prove Atwood's Law (http://bit.ly/1pFCjtR): "Any application that can be written in JavaScript, will eventually be written in JavaScript."

2014, Eric Elliott, Programming JavaScript Applications, Sebastopol, C.A.: O'Reilly, →ISBN, page 2:

(programming, humorous) A tongue-in-cheek "law" of software development stating that "any application that can be written in JavaScript, will eventually be written in JavaScript."


NTIME

(computer science) In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided).


time to live

(Internet, networking) A mechanism which limits the lifespan or lifetime of data in a computer or network.


desktop calendar

en-noun

desktop calendar (plural desktop calendars)

(computing) A small calendar and event reminder positioned on the desktop of an operating system.


GMAC

Galois Message Authentication Code
w:Galois Message Authentication Code

(cryptography) Acronym of Galois Message Authentication Code.


average seek time

average seek time (countable and uncountable, plural average seek times)

(computing, computer hardware) Of a hard drive, the average of all possible seek times equivalent to the time of all possible seeks divided by the number of all possible seeks.


minimum seek time

minimum seek time (countable and uncountable, plural minimum seek times)

Coordinate term: maximum seek time

(computing, computer hardware) The amount of time required to move the head of a disk drive from one track to the next.


maximum seek time

maximum seek time (countable and uncountable, plural maximum seek times)

Coordinate term: minimum seek time

(computing, computer hardware) The amount of time required for a disk drive to seek through all possible tracks, from the innermost to the outermost or vice versa.


nondeterministic polynomial time

nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)

nondeterministic polynomial times (plural)

deterministic Turing machine
deterministic Turing machine

(computer science) A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine.


breadcrumb navigation

(Internet, computing) A webbased trail allowing a user to follow forwards or backwards to in order to assist navigating through a website.


slot time

slot time (countable and uncountable, plural slot times)

(computing, networking) The amount of time required for an electronic pulse to travel the length of the maximum theoretical distance between two nodes.


virtual 8086 mode

(computing, computer hardware) A mode allowing the execution of real mode applications that are incapable of running directly in protected mode while the processor is running a protected mode operating system.


virtual 8086 mode
virtual 8086 mode#English

(computing) Abbreviation of virtual 8086 mode.


Kleenex testing

Named from the Kleenex brand of disposable tissues, since the testers can only be employed once.

(software engineering, informal) Software testing carried out with people who have never before seen or used the software.


deterministic Turing machine

deterministic Turing machine (plural deterministic Turing machines)

Coordinate term: nondeterministic Turing machine

(computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read.


tearout

tearout (countable and uncountable, plural tearouts)

graphical user interface
graphical user interface

(graphical user interface, uncountable) A feature allowing a tab or other entity to be dragged out of a window and to create its own new window.


ClickOps

Blend of click + op(eration)s, after DevOps.

The security and sysadmin status quo of “ClickOps” is, through this lens, frankly dangerous. It increases tight coupling and complexity, without the efficiency blessings we'd expect from this Faustian bargain—akin to trading our soul for a life of tedium.

2023, Kelly Shortridge, Aaron Rinehart, Security Chaos Engineering, O'Reilly, →ISBN:

(computing, humorous) Manual (point-and-click) configuration of a system, as opposed to an automated one.


downage

downage (countable and uncountable, plural downages)

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

[…] downages, and other anomalies in operation.

1969, Howard Jacques Greenbaum, A Simulator of Multiple Interactive Users to Drive a Time-shared Computer System, page 30:

During trials by early adopters, each problem is identified and rated for severity, from system downage (most severe) to misalignment of a report column (minor).

2002, Charles V. Breakfield, Roxanne E. Burkey, Managing Systems Migrations and Upgrades, page 109:

(computing) An instance or period when the system is down, or unavailable for use.


unreal mode

Coordinate term: real mode

(computing, computer hardware) A variant of real mode, in which one or more segment descriptors have been loaded with nonstandard values, like 32-bit limits allowing access to the entire memory.


subtick

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

In this example the control word is broken in three eight-bit blocks, corresponding to three subticks that occur between two regular clock ticks.

2015, Peter J[ames] Denning, Craig H. Martell, Great Principles of Computing, Cambridge, M.A., London: The MIT Press, →ISBN, page 68:

The update will also include an update to tick rate, in addition to visual changes. The game will now use a 'subtick' system.

2023 March 22, Calum Patterson, “Counter-Strike 2 revealed: Source 2 update overhauls CS:GO maps, graphics, smokes, more”, in Dexerto, archived from the original on 2024-02-14:

(computing, video games) A secondary tick that occurs between regular ticks.


Hindenbug

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

(computing, software) A catastrophic bug that destroys data, and may potentially shut down a system or cause a major malfunction.


rest operator

From rest (“that which remains”), as it is often used to provide the last few arguments to a function call.

Coordinate term: spread operator

(programming) An operator that collapses a number of individual values into an array.


spread operator

spread operator (plural spread operators)

Coordinate term: rest operator

The spread operator causes the elements of a collection to be treated as individual parameters to functions that accept a variable number of arguments.

2021, David Greenhalgh, Josh Skeen, Andrew Bailey, Kotlin Programming: The Big Nerd Ranch Guide:

(programming) An operator that expands an array or similar data structure into its individual elements.


rest parameter

(programming) A final parameter to a function, allowing it to accept an indefinite number of arguments as an array.


spread syntax

(programming) The use of the spread operator in source code.


unpaywall

en-verb

unpaywall (third-person singular simple present unpaywalls, present participle unpaywalling, simple past and past participle unpaywalled)

unpaywalls (present singular third-person)
unpaywalling (participle present)
unpaywalled (participle past)
unpaywalled (past)

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

I will, over the next few weeks, start unpaywalling the articles I’ve got up.

2019 January 22, Yasmin Nair, “Changes”, in Yasmin Nair:

While I like publishing free posts once in a while and am in the habit of unpaywalling older ones, my overall goal is to increase my ranks of paid subscribers, so I’ve prioritized paid content.

2021 November 20, Jesse Singal, “"Let's Make Unreasonable Rhetorical Demands Of The People Who We Want On Our Side"”, in Singal-Minded:

(informal, computing, transitive) To remove a paywall from.


servermate

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

You, Sir, are a dink. Thank you for posting your character name so your servermates may all avoid you and petition you at the first possible oppportunity.^([sic])

2000 February 3, The Shortest Barbarian On the Block, “Justice! - GM Approved”, in alt.games.everquest (Usenet), archived from the original on 2024-03-07:

> I'm using the same / > server and the same account I used to post here with. […] > Your old / > servermate thought I was SK in that post!

2003 November 3, -=Be4U=-, “OT: The keylogger”, in alt.hackers.malicious (Usenet), archived from the original on 2024-03-07:

Returning to the convention area later we find EQ and its players have reclaimed the PCs, presenting a row of T-shirt prints ranging from gangsta rap to Ghost In The Shell. Some play side by side, some frantically text distant servermates; others are powerlevelling with near-catatonic detachment.

2004 June, “Lost in convention: What happens when thousands of EverQuest fans meet in Las Vegas? We find out…”, in Edge, number 137, Bath, Somerset: Future Publishing Ltd, →ISSN, page 092, column 1:

My servermates turn out to be incredibly nice people and, for those of us who have never met before (in-game or offline), we begin to exchange information.

2006, T. L. Taylor, “Finding New Worlds”, in Play Between Worlds: Exploring Online Game Culture, Cambridge, Mass.: The MIT Press, →ISBN, page 4:

Patch days are usually wild, crazy things, full of massive world PvP and competing for quest kills and standing on top of mailboxes on a new mount. Which is why it's somewhat disturbing to see a screenshot of a brand-new area looking like The Birds. Jilira, of Perenolde's Black Dragon Clan, suggests that her servermates are waiting for 100% completion of the Sunwell opening.

2008 March 28, Elizabeth Wachowski, “Around Azeroth: The long wait”, in Yahoo! News, archived from the original on 2024-03-07:

You can connect your Spotify account to Discord, in order to show your friends and servermates what music you’re streaming.

2020 February 4, Taylor Lyles, “How to connect your Spotify account to Discord, so everyone can see what music you’re listening to”, in Business Insider, New York, N.Y.:

If you’re in a server that already has apps, usually there are already tons of people already interacting with it — ask your servermates what the Slash Commands do, or watch a friend use them if you’re too shy to try ‘em yourself.

2022 October 18, Clyde, “A Beginner’s Guide to using Discord Apps”, in Discord Blog, archived from the original on 2022-10-18:

(computing) One who is in the same server.


untrigger

untrigger (third-person singular simple present untriggers, present participle untriggering, simple past and past participle untriggered)

untriggers (present singular third-person)
untriggering (participle present)
untriggered (participle past)
untriggered (past)

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

(transitive, computing) To undo the triggering of (a rule or action).


PC-compatible

(computing, computer hardware) Of a computer, functionally identical to the original IBM personal computer and able to accept all software and hardware designed or intended for it.


PCI Express

(computing) A high-speed serial computer expansion bus standard, designed to replace the older PCI, PCI-X and AGP bus standards.


mixed alphabet

(cryptography) The mapping from plaintext to ciphertext characters in a substitution cipher, when it is not merely a shift or reversal but an arbitrary reordering.


polymorphic iteration

en-noun

polymorphic iteration (countable and uncountable, plural polymorphic iterations)

When we write methods that take iterators as parameters, we are using polymorphic iteration.

2004, Eric Freeman, Elisabeth Robson, Bert Bates, Head First Design Patterns: A Brain-Friendly Guide, page 347:

The results described here provide the foundations for a series of results, including the definition of a linear version of Gödel's system Τ with a decidable typing system for polymorphic iteration.

2007, Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie, “Linear Recursive Functions”, in Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner, editor, Rewriting, Computation and Proof, page 184:

Use the Iterator pattern to provide a uniform interface for traversing different aggregate structures (that is, to support polymorphic iteration).

2011, Amnon H. Eden, Codecharts: Roadmaps and blueprints for object-oriented programs, page 145:

(computing, programming) The use of an iterator class or interface to enable traversal over the members of any type of collection for which there is a corresponding descendant of that iterator by code which need not know the type of the collection.


varint

This is the case with the number of inputs in a normal transaction, so using varints helps to save space.

2019, Jimmy Song, Programming Bitcoin: Learn How to Program Bitcoin from Scratch, O'Reilly, →ISBN, page 91:

(programming) Clipping of variable-length integer.


slugify

en-verb

slugify (third-person singular simple present slugifies, present participle slugifying, simple past and past participle slugified)

slugifies (present singular third-person)
slugifying (participle present)
slugified (participle past)
slugified (past)

The slugify filter will slugify the given string: […]

2020, Nigel George, Mastering Django, GNW Independent Publishing, page 68:

(programming, uncommon) To transform (a string) into a slug.


search space

(mathematics, computing) The set of all possible points of an optimization problem that satisfy the problem's targets or goals.


Joda-Time

Derives from a four letter name, beginning with the letter j whose domain name was available at the time. It is not an acronym.

Several alternative Date replacement packages emerged, including the simple and sensible Date4J and the more comprehensive Joda-Time package.

2001, Ian F. Darwin, Java Cookbook, page 617:

Joda time is a complete alternative to the JDK date and time classes and seeks to replace them.

Joda-Time is a powerful open source library well known and used in the market that works with time, dates, and chronology:

2014, Rodrigo Turini, Practical Java 8 - Lambdas, Streams and New Resources:

Later the decision was made to integrate Joda-Time or something similar to it into Java's core libraries

2015, Terrill Brett Spell, Pro Java 8 Programming, page 94:

The design of these classes was inspired by the Joda-Time library, which is a popular open-source date and time library for Java.

2023, Cybellium Ltd, Mastering Java, page 156:

(computing, software, programming) A widely used date and time processing library.


spinup time

en-noun

spinup time (countable and uncountable, plural spinup times)

Coordinate term: spindown time

(computing, computer hardware) The period of time required by a hard drive or optical disc to accelerate from a stopped state to an operational speed.


spindown time

spindown time (countable and uncountable, plural spindown times)

Coordinate term: spinup time

(computing, computer hardware) The period of time required by a hard drive or optical disc to decelerate from an operational speed to stopped state.


referand

(programming, rare) A referent; that which is referred to.


write over

en-verb

write over (third-person singular simple present writes over, present participle writing over, simple past wrote over, past participle written over)

writes over (present singular third-person)
writing over (participle present)
wrote over (past)
written over (participle past)

(transitive, computing) To save a piece of data in place of other data; to overwrite.


error correct

error correct (third-person singular simple present error corrects, present participle error correcting, simple past and past participle error corrected)

error corrects (present singular third-person)
error correcting (participle present)
error corrected (participle past)
error corrected (past)


save over

save over (third-person singular simple present saves over, present participle saving over, simple past and past participle saved over)

saves over (present singular third-person)
saving over (participle present)
saved over (participle past)
saved over (past)


black-hat hacking

(computing, computer security) The action or practice of a black hat hacker.


unpirateable

en-adj

unpirateable (comparative more unpirateable, superlative most unpirateable)

more unpirateable (comparative)
most unpirateable (superlative)

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

In addition to being completely unnecessary for a single-player game and a blatant attempt to make the game unpirateable at the cost of consumers, "Always-Online" also completely screwed up Simcity's launch when the servers malfunctioned for weeks, leaving customers unable to play their own game.

2014 January 16, Tom McKay, “This Company Could Be Named the Worst in the U.S. 3 Years in a Row. But Why Do They Suck?”, in MIC:

2016 January 12, Chad Sapieha, “Just Cause 3 is proving nearly unpirateable, and that's great”, in Financial Post:

One of the reasons many companies decided to switch to online and live service games is exactly that they are unpirateable.

2023 August 24, Switch_Pro, “Denuvo's 'Switch Emulator Protection' Is Now Available Via Nintendo's Official Dev Portal”, in Nintendo Life:

(software, computing) Not able to be pirated by third parties.


ancilla bit

(computing) An extra bit (binary digit) used to implement irreversible logical operations.


boot time

en-noun

boot time (countable and uncountable, plural boot times)

Coordinate term: startup time

(computing, computer hardware) The amount of time required to load the kernel of an operating system, its device drivers, and the initialization of the hardware.


startup time

startup time (countable and uncountable, plural startup times)

(computing, computer hardware) The boot time of a system in addition to the amount of time required for the operating system to load and initialize all its services and programs.


chinkware

From Chink (“contemptuous term for a Chinese person”) + -ware.

suf

That will mean lots more chinkware for you to hype.

2011 April 17, Gordon Darling, “PC's have peaked”, in alt.comp.freeware (Usenet):

The Windows firewall built into Vista, and Windows 7 is class. Why would I want to use Chinkware with Geekbuddy support , or indeed insert any third party code into the very fine network stack developed by Microsoft, with a little help from BSD.

2011 May 30, Pooh the Cat, “Privatefirewall Questions”, in alt.comp.freeware (Usenet):

You always defend chinkware, which Bear Bottoms did at the behest of the PLA. Chinkware, when made in the PRC, not Taiwan, is always spyware, unconditionally, no variations on that. The PRC is the major industrial spy in the world. […]

2015 March 15, The Haberdasher Genl., “Pooh: Caver is Bear, you already know that.”, in alt.comp.freeware (Usenet):

The xposed module itself is closed source and the link on the github page is very suspicious. I'm not running any unknown chinkware on something higher than user level.

2022 September 15, u/Mitko0111, “Archived copy”, in Reddit, archived from the original on 2022-09-16:

[…] if you're a company that could in any case ever compete with a chinese company, or a government infrastructure builder, stay away […] chinkware will be weaponized in the upcoming war

2023 November 30, anonymous author, 4chan:

(Internet slang, computing, derogatory, ethnic slur) Software created in China, regarded as being likely to maliciously surveil the user; Chinese spyware.


leap smearing

(computing) The handling of a leap second by gradually distorting hours of surrounding time, rather than changing the system clock by a whole second at once.


Boehm collector

en-noun

Boehm collector (plural Boehm collectors)

(programming) A kind of mark-and-sweep garbage collector .


OPFS

(computing) Initialism of Origin Private File System.


IPD

IPD (countable and uncountable, plural IPDs)

iterated prisoner's dilemma
iterated prisoner's dilemma#English

(game theory) Initialism of iterated prisoner's dilemma.


unprovision

en-verb

unprovision (third-person singular simple present unprovisions, present participle unprovisioning, simple past and past participle unprovisioned)

unprovisions (present singular third-person)
unprovisioning (participle present)
unprovisioned (participle past)
unprovisioned (past)

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

(transitive, computing) Synonym of deprovision


finitely generated

From the study of generators. The motivation for calling topologies satisfying sense 1.5 "finitely generated" is that any topology satisfies sense 1.5 if and only if it is coherent with its finite subspaces. Thus, metaphorically, it is "generated" by them. The category-theoretic senses were created to generalize those of abstract algebra, and so were named identically.

(algebra) In any of several specific senses, such that all its elements can be created using (or described by reference to) a finite set of elements, usually called generators:

(most generally, category theory, of an object X in a locally small category 𝒞 that admits filtered colimits of monomorphism) Such that the functor operatorname Hom_( mathcal )C(X,·) preserves those filtered colimits of monomorphisms.


locally small

(category theory, of a category) Such that the hom class between any two objects is a set (and not a proper class).


hom class

(category theory) A (possibly empty) class composed of the morphisms from A to B, where A and B are objects in some category, denoted operatorname Hom(A,B).


Prim's algorithm

Named after computer scientist Robert C. Prim, who rediscovered and published it in 1957.

minimum spanning tree
minimum spanning tree

(computing theory) A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.


absolute path

(computing) A path or address that identifies a file or web page which includes all the information necessary to find the file or web page with no assumptions based on local context.


adaptive tile refresh

(computer graphics, historical) A sidescrolling technique for video games, making unusual use of the EGA graphics hardware to minimize redrawing.


Prim-Jarník algorithm

Prim's algorithm
Prim's algorithm#English

(computing theory) Synonym of Prim's algorithm


Jarník's algorithm

It was developed in 1930 by Czech mathematician Vojtěch Jarník.


DJP algorithm

Short for Dijkstra, Jarník, Prim; see the other names and explanations at Prim's algorithm.


vertical mouse

(computing) A computer mouse that stands upright, with buttons on the side, designed to reduce strain on the user's wrist.


superword

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

The Winchester drive loads data in chunks of 32 superwords […]

Recognition memory (REM) consists of 32 or more 256-byte superwords, comparison logic and control bits.

1983, Mini-micro Systems, volume 16, page 238:

(computing) A group of words (fixed-sized groups of binary digits) treated as a unit.


empty string

From empty (“containing no elements”) + string (“ordered sequence of text characters”).

com

(programming) A string with a length of zero.


Time-Triggered Protocol

(networking) An open computer network protocol for control systems, designed as a time-triggered fieldbus for vehicles and industrial applications.


fieldbus

(computer hardware, networking) A member of a family of industrial digital communication networks used for real-time distributed control.


default gateway

en-noun

default gateway (plural default gateways)

(computing, networking) The node in a computer network using the Internet Protocol suite serving as the forwarding host to other networks when no other route specification matches the destination IP address of a packet.


linear congruential generator

linear congruential generator (plural linear congruential generators)

(computing theory) An algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation.


intrinsify

en-verb

intrinsify (third-person singular simple present intrinsifies, present participle intrinsifying, simple past and past participle intrinsified)

intrinsifies (present singular third-person)
intrinsifying (participle present)
intrinsified (participle past)
intrinsified (past)

The instruction which we are going to intrinsify is the CRC32 calculation, which is implemented by java.util.zip.CRC32.

2015, Alex Kasko, Stanislav Kobylyanskiy, Alexey Mironchenko, OpenJDK Cookbook, Packt, →ISBN, page 139:

(software compilation, transitive) To turn (instructions) into an intrinsic.


password wallet

en-noun

password wallet (plural password wallets)

I believe Mozilla 5 (to be released as Netscape 6) also has a password "wallet" feature. Not sure about other vendors.

2000 March 16, Peter W, “allowing directory access for authorized users”, in comp.infosystems.www.servers.unix (Usenet):

Instead, the individual passwords are generated algorithmically from the master password and the sites’ names. As an advantage compared with a password wallet, nothing at all needs to be stored on the client machines. As a disadvantage, there is no easy way to change the master password.

2007, Max Hailperin, Operating Systems and Middleware: Supporting Controlled Interaction, Thomson Course Technology, page 405:

The two main things to remember with a password wallet is to have a very secure unique password or passphrase to access the wallet, and keep a secure record of the password or passphrase,[…]

2017, Graham Day, Security in the Digital World: For the home user, parent, consumer and home office, Walter de Gruyter GmbH, page 111:

He showed Gemma the files to read and unlocked his password wallet. "The password wallet isn't very secure." "More secure than my physical diary which I'm sure has been checked.[…]"

2017, Ray McCarthy, The Solar Alliance, Corvids Press, page 154:

The user must have access to the password wallet whenever she needs a password.

2018, Matt Bishop, Computer Security: Art and Science, Pearson Education, page 523:

In this section, we adapt our OTP wallet construction to the proof-of-stake setting (the password wallet can also be adapted likewise).

2023, Shin'ichiro Matsuo, Lewis Gudgeon, Ariah Klages-Mundt, Daniel Perez Hernandez, Sam Werner, Thomas Haines, Aleksander Essex, Andrea Bracciali, Massimiliano Sala, editors, Financial Cryptography and Data Security. FC 2022 International Workshops: CoDecFin, DeFi, Voting, WTSC, Grenada, May 6, 2022, Revised Selected Papers, Springer International Publishing, page 632:

(computing, cryptography) An application or mechanism which stores someone's passwords by encryption.


fade time

fade time (countable and uncountable, plural fade times)

The annual fade time is three times that occurring in a heavy fading month when the climate is average.

2006, Roger L. Freeman, Radio System Design for Telecommunications, page 31:

The fractional fade time (also called the probability of fade) describes the percentage of time the irradiance of the received wave is below some given threshold value.

2014, Arun K. Majumdar, Advanced Free Space Optics (FSO): A Systems Approach:

The mean fade time decreases with increasing elevation and fade threshold.

2016, Murat Uysal, Carlo Capsoni, Zabih Ghassemlooy, Optical Wireless Communications: An Emerging Technology, page 95:

Figure 4.12 of [8] shows that on the same path from which the data in Fig. 4.11 of [8] was derived, for fade depth deeper than about 20 dB, the fade time decreases by a factor of about 10 for a 10 dB increase in fade depth.

2021, Douglas H Morais, 5G and Beyond Wireless Transport Technologies, page 62:

(signal processing) The time during which a wireless signal is too faint to be accurately received.


time-tracking software

(computing, software, business, human resources) A program or application allowing a user to record the amount of time spent on tasks or projects.


connect time

connect time (countable and uncountable, plural connect times)

(computing, networking) The total amount of time spent by a user of a computer connected to a network.

(computing, networking) The amount of time during which a user of a remote terminal is connected with a time-sharing system.


Network Time Protocol

(networking) A networking protocol for clock synchronization between computer systems over packet-switched, variable-latency data networks.


canary release

canary release (countable and uncountable, plural canary releases)

(computing, software) A deployment strategy performed in order to reduce the risk of introducing a new software version in production by slowly rolling out the change to a small subset of users.


queap

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

Devised by John Iacono and Stefan Langerman.

(computer science) a priority queue data structure


constant time

constant time (countable and uncountable, plural constant times)

Coordinate term: amortized constant time

(computer science) An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input.


amortized constant time

Coordinate term: constant time

(computer science) A class of algorithms in which the amortized time (the time per operation averaged over many operations) is constant, although for some operations the time may be dependent on the size of the input.


time-loop logic

Novikov self-consistency principle
Novikov self-consistency principle

(computer science) A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines.


time of origin

time of origin (countable and uncountable, plural times of origin)

(telecommunications, networking) The point in time in which a message is released for transmission.


quantum bogosort

Implementing quantum bogosort increased my script's performance by 50%, but I still feel a little bit guilty about my computer killing quadrillions of sentient beings a second.

And from that we can conclude that in some parallel worlds, a machine to implement the Quantum Bogosort (theoretically the fastest possible sorting algorithm) has been invented.

2007 January 22, Logan Kearsley, “How the mind plays tricks.”, in rec.arts.sf.composition (Usenet):

Even quantum-bogosort can't keep up with Intelligent Design Sort. ¶ (IDS makes no changes to its input, on the theory that "they are already sorted according to a higher purpose.")

2009 October 2, Tim Rentsch, “Selection-Sort in C”, in comp.lang.c (Usenet):

ECMA 5 lacks support for the speedy Quantum Bogosort.

2011 November 4, Dr J R Stockton, “sorting columns”, in comp.lang.javascript (Usenet):

many-worlds interpretation
many-worlds interpretation#Noun

quantum mechanics
quantum mechanics#Noun

(computing, humorous) A hypothetical sorting algorithm which generates a random permutation of its input (like in bogosort) using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Assuming that the many-worlds interpretation of quantum mechanics is true, this algorithm will result in at least one surviving universe where the input was successfully sorted in O(n) time (thus making it faster than quicksort).


space-time trade-off

space-time trade-off (plural space-time trade-offs)

(computer science) A case where an algorithm or program trades increased space usage with decreased time, in which space refers to the data storage consumed in performing a given task and time refers to the time consumed in performing a given task.


hard real-time

(computing) Being or relating to a system in which no latency is tolerated, one that has absolute deadlines, and if those allotted time spans are missed, a system failure will occur.


Time Simulator

(computing, programming) A stack-based simulation language.


Time Complex Simulator

(computing, programming) A complex and arithmetic version of the Time Simulator language.


time factor

(computer science) Synonym of time scale


aspectualize

en-verb

aspectualize (third-person singular simple present aspectualizes, present participle aspectualizing, simple past and past participle aspectualized)

aspectualizes (present singular third-person)
aspectualizing (participle present)
aspectualized (participle past)
aspectualized (past)

The mixin and aspect code generators in JULIA provide a lightweight, flexible yet efficient means to aspectualize components.

2004, Eric Bruneton, Thierry Coupaye, Matthieu Leclercq, Vivien Quema, Jean-Bernard Stefani, Ivica Crnkovic, “An Open Component Model and Its Support in Java”, in Component-Based Software Engineering:

Many works are dedicated to aspectualize component models.

2010, Abdelhakim Hannousse, Gilles Ardourel, Re/mi Douence, “Views for Aspectualizing Component Models”, in Bram Adams, Michael Haupt, Daniel Lohmann, editor, Proceedings of the 9th Workshop on Aspects, Components, and Patterns for Infrastructure Software, page 25:

(programming) To use as an implementation for aspects.


stack-based

(computing, programming) Of data, utilizing one piece of data from atop the stack, and returning data back atop the stack.


time elapsed counter

en-noun

time elapsed counter (countable and uncountable, plural time elapsed counters)

(computing, software) A type of stopwatch or timer in a computer system that tracks the passage of time of a compiling, download, or other task.


time-frequency analysis

electrical engineering
electrical engineering

time-frequency representation
time-frequency representation

(electrical engineering, signal processing) A technique that studies a signal in both the time and frequency domains simultaneously, using various time-frequency representations.


time-frequency representation

time-frequency representation (countable and uncountable, plural time-frequency representations)

(electrical engineering, signal processing) A view of a signal, taken to be a function of time, represented over both time and frequency.


time-space complexity

time-space complexity (usually uncountable, plural time-space complexities)

(computer science) The combination of the measure of the amount of time and space in which an algorithm requires to run or solve a given decision problem.


time parameter

(computing, software) A function used to specify the maximum CPU utilization time permitted for the job to execute.

(programming) A parameter that represents time.


HNSW

w:Hierarchical Navigable Small World graphs

(computer science) Initialism of Hierarchical Navigable Small Worlds.


before image journal

before image journal (plural before image journals)

Coordinate term: after image journal

The before image journal is used for undoing the effects of aborted transactions, and for recovery from system crashes.

1990, Sayyed M. Deen (editor), Practical Database Techniques, page 58:

The location of the before image journal. An AI journal records changes to a file so that the journal can be used to roll a backup copy of the file forward.

1990, Kirby McCoy, VMS file system internals, page 49:

The process of recording all operations applied to a database. The type of information recorded depends on whether an after-image or a before-image journal file is created.

1991, Lilian Hobbs, Ken England, Comprehensive Guide to RDB-VMS, page 334:

This capability is based on a transaction log used with a before-image journal and after-image journal.

2006, David L. Cannon, Timothy S. Bergmann, Brady Pamplin, CISA Certified Information Systems Auditor Study Guide, page 236:

(computing, databases) A transaction log acting as a version of a database entry before an update is recorded.


after image journal

after image journal (plural after image journals)

Coordinate term: before image journal

The -RESTORE attribute can only be set if the system's after image journal is open.

1990, Operator's Manual Automated Data Processing System AN/MYQ-4A, (NSN 7010-01-158-5397), page 117:

There may be one or multiple AIJ files, but whichever method is used there will only be one after-image journal file open at any time for an individual database.

1999, Lilian Hobbs, Ian Smith, Ken England, Rdb, A Comprehensive Guide, page 260:

'After' image journaling - taking an image (copy) of the record after a transaction and storing in 'after image' journal table.

2005, Nicholas Sherwood, Enterprise Security Architecture, A Business-Driven Approach, page 335:

(computing, databases) A transaction log acting as a version of a database entry after an update is recorded.


system time

system time (countable and uncountable, plural system times)

(computing, programming) The passage of time of a computer system, including the passing of days on the calendar.


turnaround time

turnaround time (countable and uncountable, plural turnaround times)

(business, marketing, computing, software) The amount of time required to complete a process or fulfill a request.


exit time

exit time (countable and uncountable, plural exit times)

(computing, software) The point in time in which a process completes its execution and exits from the system.


Hollerith machine

Hollerith machine (plural Hollerith machines)

Named after American inventor Herman Hollerith (1860–1929).

named-after

(computing, historical) A kind of tabulating machine using punch cards.


time algorithm

(computer science) An algorithm which specifies the amount of time required to solve a problem as a function of its input size.


facepile

(graphical user interface, Internet) A stack of images (photographs, initials, etc.) each representing a person.


execution time

en-noun

execution time (countable and uncountable, plural execution times)

(computing, software) The amount of time required for a program or task to complete a single instruction on a computer system.


instruction time

instruction time (countable and uncountable, plural instruction times)

(computing, software) The total amount of time required for an instruction to be fetched from memory and stored in the instruction register.


transaction time

transaction time (countable and uncountable, plural transaction times)

(computing, databases) The time during which a fact stored in the database, represented by all the information in a row, is considered to be true and in effect.


transmission time

transmission time (countable and uncountable, plural transmission times)

(networking, telecommunications) The amount of time from the beginning until the end of a message transmission.


APTIME

alternating Turing machine
alternating Turing machine

(computer science, computational complexity theory) The set of problems decidable by an alternating Turing machine in polynomial time.


alternating Turing machine

alternating Turing machine (countable and uncountable, plural alternating Turing machines)

(computer science, computational complexity theory) A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP.


EXPTIME

(computer science, computational complexity theory) The set of all decision problems that are solvable by a deterministic Turing machine in exponential time.


valid time

valid time (countable and uncountable, plural valid times)

(computing, databases) The time period during which a database fact is valid in the modeled reality.


coding time

coding time (countable and uncountable, plural coding times)

(programming) The amount of time required from the first commit, to a branch, eventually the submission of a pull request.


command processing overhead time

command processing overhead time (countable and uncountable, plural command processing overhead times)

command processing overhead times (plural)

(computing, software) The amount of processing time which a device requires, prior to the execution of a command.


think time

think time (countable and uncountable, plural think times)

(computing, software) The amount of time for which a script pauses during test execution to simulate a real-world delay.


exponential time

exponential time (countable and uncountable, plural exponential times)

exponential function
exponential function

(computer science) An algorithm whose running time increases as an exponential function of the size of its input.


cubic time

cubic time (countable and uncountable, plural cubic times)

computational complexity theory
computational complexity theory

(computer science, computational complexity theory) An algorithm whose running time consists of three loops proportional to the cube of n.


waiting time

waiting time (countable and uncountable, plural waiting times)

(computing, computer hardware) The total amount of time in which a process spends in a ready queue before it reaches the CPU.


computation time

computation time (countable and uncountable, plural computation times)

(computing, software) The total amount of time required by a computer to perform a computational process.


latency time

latency time (countable and uncountable, plural latency times)

(networking) The amount of time required for data to pass from one point on a network to another.


lag time

lag time (countable and uncountable, plural lag times)

(computing, networking, video games) The time delay (latency) between the action of the user and the reaction of the server supporting the task, which requires resending to the client.


lookahead time

lookahead time (countable and uncountable, plural lookahead times)

The risk of preemption can be varied by changing the lookahead time when making immediate admission control.

2013, Olov Schelén, Stephen Pink, “Sharing Resources through Advance Reservation Agents”, in Andrew T. Campbell, Klara Nahrstedt, editor, Building QoS into Distributed Systems, page 265:

If the lookahead time is too short, then delays to the scheduling code could mean that the scheduled time is already in the past by the time the library is ready to schedule the notes .

2024, Nick Morgan, JavaScript Crash Course, page 221:

(computing, software) The amount of time from the point when an upcoming process is scheduled and resources are allocated for it, to the moment when it executes.


ready queue

(computing, computer hardware) A data structure that holds a process that is ready to run, but is unable to do so because the CPU is already occupied.


pseudo-polynomial time

pseudo-polynomial time (countable and uncountable, plural pseudo-polynomial times)

LL-Q1860 (eng)-Flame, not lame-pseudo-polynomial time.wav

(computer science, computational complexity theory) A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input.


reference time

reference time (countable and uncountable, plural reference times)

(computing, software) The moment in time near the beginning of switching that is chosen as a reference for the measurement of time in a digital computer.


quadratic time

quadratic time (countable and uncountable, plural quadratic times)

(computer science) A time algorithm in which given an input of size n, the number of steps required to complete a task is the square of n.


push time

push time (countable and uncountable, plural push times)

(networking, telecommunications) The time when a remote server sends an unsolicited update.


nondeterministic polynomial time
nondeterministic polynomial time

(computer science) The set, or property, of a problem with a yes/no answer in which the complementary yes/no problem calls for nondeterministic polynomial time.


logject

(computing, software, technology) An object with embedded software capable of monitoring and recording, in some manner, its own activity and operation.


Hypertext Transfer Protocol

(Internet, networking) An application layer protocol in the Internet protocol suite model for distributed, collaborative, and hypermedia information systems.


nonuniform polynomial time

nonuniform polynomial time (countable and uncountable, plural nonuniform polynomial times)

(computer science, computational complexity theory) The class of decision problems solvable by a family of polynomial-sized Boolean circuits.


Boolean circuit

Boolean circuit (plural Boolean circuits)

(computer science, computational complexity theory) A directed acyclic graph whose internal nodes are Boolean functions.


wikitime

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

(computing, Internet, time) A time standard or timestamp used in Wikipedia and its affiliates, set to Greenwich Mean Time, and encoded as 24-hour time-day-month-year.


deferred time

deferred time (countable and uncountable, plural deferred times)

computer engineering
computer engineering

(computer engineering) The time when a deferred operation eventually takes place.


subquadratic time

subquadratic time (plural subquadratic times)

(computer science) A time algorithm that runs in greater than linear, but less than quadratic time.


inlinee

Coordinate term: inliner

(software compilation) A portion of code that is optimized by means of in-line expansion.


data feed

data feed (countable and uncountable, plural data feeds)

(computing, Internet) A mechanism for a user to receive updated data from data sources.


date-time

(programming) Of or pertaining to the datetime variable or data type.


A numeronym representation of canonicalization as c followed by 14 more letters, followed by n.

software engineering
software engineering

(software engineering) Abbreviation of canonicalization.


Proteus effect

(psychology, video games, computing) A phenomenon in which the behavior of an individual, within virtual worlds, is changed by the characteristics of their avatar.


LRU

(computing) Initialism of least recently used.


patristocrat

Coordinate term: aristocrat

(cryptography) A cipher in which punctuation and word spacing are not retained.


overcomment

en-verb

overcomment (third-person singular simple present overcomments, present participle overcommenting, simple past and past participle overcommented)

overcomments (present singular third-person)
overcommenting (participle present)
overcommented (participle past)
overcommented (past)

(transitive, programming) To annotate (code) with too many comments.


undercomment

undercomment (third-person singular simple present undercomments, present participle undercommenting, simple past and past participle undercommented)

undercomments (present singular third-person)
undercommenting (participle present)
undercommented (participle past)
undercommented (past)

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

(transitive, programming) To annotate (code) with too few comments.


power button

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

A button that switches an electrical device on or off.

(computing) A button that switches the computer on or off (or, on more recent models, often enables sleep mode).


superalgorithm

(programming) An algorithm made up of lesser algorithms (subalgorithms).


serviceware

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

A component is simply a reusable software executable. Our serviceware clearly includes the software itself, but in addition has many nonfunctional attributes, such as a cost and payment, trust, brand allegiance, legal status and redress, and security.

2002, Marvin Zelkowitz, Advances in Computers, page 46:

(computing, rare) Products and services taken collectively.


vararg

(programming) Any of the arguments to a variadic function.


tilemapping

(computer graphics) The use of a tilemap.


tilemapped

(computer graphics) Employing, or arranged in, a tilemap.


neural processing unit

en-noun

neural processing unit (plural neural processing units)

In addition, the large weight size inevitably causes latency, power, and energy overhead when transferring the weight data between the storage/memory and the processing units, such as central processing units (CPUs), graphic processing units (GPUs), neural processing units (NPUs), or accelerators, which are not desirable for resource-constrained edge devices.

2023, Arslan Munir, Joonho Kong, Mahmood Azhar Qureshi, Accelerators for Convolutional Neural Networks, John Wiley & Sons, →ISBN, page 43:

(computer hardware, machine learning) A specialized hardware circuit designed to accelerate machine learning applications.


CalVer

Coordinate term: SemVer

calendar versioning
calendar versioning#English

(software) Abbreviation of calendar versioning.


AprilTag

In this paper, we presented the results of an extensive comparison of four common detection libraries for AprilTags. The performance of the examined libraries varies strongly in terms of computing time and accuracy of the results.

2020, Jan Kallwies, Bianca Forkel, Hans-Joachim Wuensche, “Determining and Improving the Localization Accuracy of AprilTag Detection”, in 2020 IEEE International Conference on Robotics and Automation, Paris: IEEE, →DOI, page 8293, column 2:

(robotics) A type of tag consisting of a grid of black and white squares, used in robotics and computer vision applications.


window up

en-verb

window up (third-person singular simple present windows up, present participle windowing up, simple past and past participle windowed up)

windows up (present singular third-person)
windowing up (participle present)
windowed up (participle past)
windowed up (past)

(transitive, intransitive, informal, computing) To create a window to access (a file, website, etc); to put (a file, website, etc.) in a window.


window down

window down (third-person singular simple present windows down, present participle windowing down, simple past and past participle windowed down)

windows down (present singular third-person)
windowing down (participle present)
windowed down (participle past)
windowed down (past)

(transitive, computing) To reduce in scope, resolution, capacity, bandwidth, etc. so as to enable or focus on a target.


gigaword

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

(computing) A unit of storage or capacity equal to 10⁹ (or 2³⁰) words


clean URL

(Internet, computing) A web address or URL intended to improve the usability and accessibility of a website, web application, or Web service by being immediately and intuitively meaningful to nonexpert users.


identity broker

en-noun

identity broker (plural identity brokers)

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

(computing, networking) An intermediary proxy service connecting multiple service providers with multiple identity providers.


identity provider

identity provider (plural identity providers)

(computing, networking) A system entity that creates, maintains, and manages identity information for principals and also provides authentication services to relying applications within a federation or distributed network.


strictly full

(category theory) A subcategory that is isomorphism-closed and full.


fully faithful

(category theory) Of a functor, injective and surjective on hom-sets.


service-oriented

(software engineering) Of an architectural style focusing on discrete services instead of a monolithic design.


subject-oriented

(computing, programming) Of or pertaining to a software paradigm in which the state (fields) and behavior (methods) of objects are not seen as intrinsic to the objects themselves, but are provided by various subjective perceptions ("subjects") of the objects.


script out

en-verb

script out (third-person singular simple present scripts out, present participle scripting out, simple past and past participle scripted out)

scripts out (present singular third-person)
scripting out (participle present)
scripted out (participle past)
scripted out (past)

You could finish this quicker by scripting it out.

(computing, transitive) To simplify or automate a process using scripts (a file containing a list of user commands, allowing them to be invoked once to execute in sequence).


drill up

drill up (third-person singular simple present drills up, present participle drilling up, simple past and past participle drilled up)

drills up (present singular third-person)
drilling up (participle present)
drilled up (participle past)
drilled up (past)

I've got product sales data, but I want to drill up to product-category sales data.

(intransitive, software) To replace data with data from one level higher or less specific.


drill through

drill through (third-person singular simple present drills through, present participle drilling through, simple past and past participle drilled through)

drills through (present singular third-person)
drilling through (participle present)
drilled through (participle past)
drilled through (past)

The icon under each entry lets you drill through to see which analyst added it.

(transitive, software) To display or cause a computer to display more specific, relevant data.


drill out

drill out (third-person singular simple present drills out, present participle drilling out, simple past and past participle drilled out)

drills out (present singular third-person)
drilling out (participle present)
drilled out (participle past)
drilled out (past)

You're looking at recent data, but you can drill out to the archives too.

(intransitive, software) To switch from a database or other data source to another.


drill in

drill in (third-person singular simple present drills in, present participle drilling in, simple past and past participle drilled in)

drills in (present singular third-person)
drilling in (participle present)
drilled in (participle past)
drilled in (past)

(intransitive, software) Synonym of drill down


usercentricity

(computing) The condition of being usercentric


bugdoor

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

a novel, minimalist approach to constructing deniable bugdoors for microcontroller firmware

2014 December 8, Samuel Junjie Tan, Sergey Bratus, Travis Goodspeed, “Interrupt-oriented bugdoor programming: a minimalist approach to bugdooring embedded systems firmware”, in Proceedings of the 30th Annual Computer Security Applications Conference (ACSAC '14), New York, NY, USA: Association for Computing Machinery, →DOI, →ISBN, pages 116–125:

provide the cover of plausible deniability for attackers in the form of exploitable “bugdoor” attacks

2024 April 13, Mario Lins, René Mayrhofer, Michael Roland, Daniel Hofer, Martin Schwaighofer, “On the critical path to implant backdoors and the effectiveness of potential mitigation techniques: Early learnings from XZ”, in arXiv, →DOI:

(computing) A security vulnerability caused by a bug that was intentionally added by the vendor.


replacement character

en-noun

replacement character (plural replacement characters)

(computing, Unicode) A symbol, often displayed as a black rhombus with a white question mark, used to indicate problems when a system is unable to render a stream of data to the correct symbols.


transposition cipher

transposition cipher (plural transposition ciphers)

(cryptography) An encryption method that rearranges the order of the plaintext letters.


unbookmark

en-verb

unbookmark (third-person singular simple present unbookmarks, present participle unbookmarking, simple past and past participle unbookmarked)

unbookmarks (present singular third-person)
unbookmarking (participle present)
unbookmarked (participle past)
unbookmarked (past)

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

I should probably unbookmark that page, it's out of date.

(computing, transitive) To remove a bookmark.


batch up

batch up (third-person singular simple present batches up, present participle batching up, simple past and past participle batched up)

batches up (present singular third-person)
batching up (participle present)
batched up (participle past)
batched up (past)

(transitive, computing, manufacturing) To line up multiple tasks to be executed at once in order to improve efficiency.


control bus

en-noun

control bus (plural control buses or control busses)

control buses (plural)
control busses (plural)

(computer hardware) A part of the system bus that is used by CPUs for communicating with other devices within the computer.


system bus

system bus (plural system buses or system busses)

system buses (plural)
system busses (plural)

(computer hardware) A single computer bus that connects the major components of a computer system, combining the functions of a data bus, an address bus, and a control bus.


address bus

address bus (plural address buses or address busses)

address buses (plural)
address busses (plural)

(computer hardware) A bus that is used to specify a physical address.


time-domain averaging

(sciences, signal processing) A method for processing and analyzing signals, particularly when there is a requirement to reduce the impact of short-term fluctuations or noise.


conk off

en-verb

conk off (third-person singular simple present conks off, present participle conking off, simple past and past participle conked off)

conks off (present singular third-person)
conking off (participle present)
conked off (participle past)
conked off (past)

(slang, intransitive, of a machine, engine, computer, etc.) To stop functioning.


spiking neural network

en-noun

spiking neural network (plural spiking neural networks)

(computing) An artificial neural network that more closely mimics a natural neural networks.


dial out

en-verb

dial out (third-person singular simple present dials out, present participle dialing out or dialling out, simple past and past participle dialed out or dialled out)

dials out (present singular third-person)
dialing out (participle present)
dialling out (participle present)
dialed out (participle past)
dialed out (past)
dialled out (participle past)
dialled out (past)

(computing) To start an online meeting or conference call by calling or otherwise alerting the participants.


AirDrop

By the analogy of an airdrop, in which items are delivered by dropping them from an aircraft in flight.

(networking) A wireless service of Apple Inc. which can transfer files among supported Macintosh computers and iOS devices by means of close-range wireless communication.


AirDrop

AirDrop (third-person singular simple present AirDrops, present participle AirDropping, simple past and past participle AirDropped)

AirDrops (present singular third-person)
AirDropping (participle present)
AirDropped (participle past)
AirDropped (past)

Alternative form: airdrop

“Another day another group of french^([sic]) teens trying to AirDrop me memes on the subway,” one woman tweeted. “In a crowd of teens and they keep trying to AirDrop me memes!!!” said another. One young Twitter user joked that she was going to a music festival last weekend “just to AirDrop.”

2019 June 5, Taylor Lorenz, “When Grown-Ups Get Caught in Teens’ AirDrop Crossfire”, in The Atlantic:

Cyber-flashing is not experienced as a less harmful or less damaging behaviour just because it happens digitally rather than on the street. […] For those who have been AirDropped in a public place, there is not even the comfort of knowing for certain who is guilty.

2023 April 19, Sophie Gallagher, “Cyber-flashing is just as damaging as the ‘real world’ equivalent. When will the law catch up?”, in The Guardian:

(intransitive, ditransitive, networking) To transfer a file using AirDrop.


googolbyte

Where does the enterprise store its gigabytes, terabytes and googolbytes?

1999 March 1, InfoWorld, volume 21, number 9:

My system has one Googolbyte of RAM and
2 Googolplexbytes of disk space.

2006, Andreas Zeller, Why Programs Fail: A Guide to Systematic Debugging, page 98:

Their home addresses were any number of condominiums on the back forty googolbytes of the infosphere.

2010, Howard V. Hendrix, Standing Wave: A Science Fiction Novel, page 28:

(computing, informal) A unit of digital storage equal to a googol (10¹⁰⁰) bytes.


the Internet never forgets

(computing, Internet) A widely held belief that everything that is posted online will remain there forever.


snowflake schema

en-noun

snowflake schema (plural snowflake schemas)

(computing) A logical arrangement of tables in a multidimensional database such that the entity relationship diagram resembles a snowflake shape.


BIM

(informatics) Abbreviation of Beginning of Information Mark.


hack up

en-verb

hack up (third-person singular simple present hacks up, present participle hacking up, simple past and past participle hacked up)

hacks up (present singular third-person)
hacking up (participle present)
hacked up (participle past)
hacked up (past)

(transitive, programming) To quickly and simply create (a piece of code).


unauthenticate

unauthenticate (third-person singular simple present unauthenticates, present participle unauthenticating, simple past and past participle unauthenticated)

unauthenticates (present singular third-person)
unauthenticating (participle present)
unauthenticated (participle past)
unauthenticated (past)

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

One advantage to using this approach is that you can “unauthenticate” a user at any time by sending the HTTP 401 header again. You may want to do this to force users to log in again after a certain timeout period or to provide different authentication requirements for the different areas of your application.

2001, Blake Schwendiman, “Authentication” (chapter 8), in PHP4 Developer’s Guide, New York, N. Y.: McGraw-Hill, →ISBN, page 148:

You can set up the client not to authenticate, but if you do so, be warned that man-in-the-middle attacks will be easy to perform. Unauthenticating client proxies only buys you security against the most naïve eavesdropping attacks, but is still better than no protection at all.

2002 June, John Viega, Matt Messier, Pravir Chandra, “Introduction” (chapter 1), in Network Security with OpenSSL, Sebastopol, Calif.: O'Reilly Media, Inc., →ISBN, page 26:

This is important stuff, as anyone with an online bank account or remote corporate network knows. But a lot less thought and work have gone into the other end of the problem: how do you tell the system on the other end of the line that you’re no longer there? How do you unauthenticate yourself?

2014, Bruce Schneier, “The Difficulty of Un-Authentication”, in Carry On: Sound Advice from Schneier on Security, Indianapolis, Ind.: John Wiley & Sons, Inc., →ISBN, page 237:

(transitive, computing) To withdraw the authentication of.


mailaddr

a message is sent back to the mailaddr in the request

1993 October 22, Michael Richmond, Richard R. Treffers, Alexei V. Filippenko, “THE BERKELEY AUTOMATIC IMAGING TELESCOPE”, in Publications of the Astronomical Society of the Pacific, volume 105, number 692, The Astronomical Society of the Pacific, →DOI, page 1164:

recipient whose address is in the ‘mailaddr’ file

2001 August 1, Amnart Pohthong, David Budgen, “Reuse strategies in software development: an empirical study”, in Information and Software Technology, volume 43, number 9, →DOI, →ISSN, pages 561–575:

Now you should input your mailaddr and password again

2005 December 15, “Is earthlink's webmail free?”, in (Please provide the book title or journal name):

you configured your MAILADDR in /etc/mdadm/mdadm.conf

2007 July 13, “Software RAID Failure?”, in (Please provide the book title or journal name):

(computing) Abbreviation of e-mail address.


Pherecr.

πολύτῡρος, ον, with much cheese, Pherecr. Περσ. 1. 7.

1883, Henry George Liddell, Robert Scott, edited by Henry Drisler, A Greek–English Lexicon, seventh edition, New York: Harper & Brothers, page 1251/1, s.v. πολύτῡρος:

(bibliography and lexicography) Abbreviation of Pherecrates.

Phérécr.

abbreviation of (the equivalent of) Pherecrates


write once, read many

LL-Q1860 (eng)-Flame, not lame-write once, read many.wav

(computing, computer hardware) A data storage device in which information, once written, cannot be modified.


NVMe

Coined by an industry working group in 2009 on the pattern of PCIe.

coin

non-volatile random access memory#English

(computing, initialism) Initialism of non-volatile memory express; a protocol for efficiently accessing (typically solid-state) NVRAM over a PCIe bus.


autorespond

en-verb

autorespond (third-person singular simple present autoresponds, present participle autoresponding, simple past and past participle autoresponded)

autoresponds (present singular third-person)
autoresponding (participle present)
autoresponded (participle past)
autoresponded (past)

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

Whenever a new user joins, a bot will autorespond with a welcome message.

(intransitive, computing) To respond automatically.


data acquisition

(signal processing) The process of sampling signals that measure real-world physical conditions and converting the resulting samples into digital numeric values that can be manipulated by a computer.


event sink

(software engineering) A class or function that receives events from another object or function.


data sink

(software engineering) A device or computer program that collects and stores data from other devices or programs.


data recovery

en-noun

data recovery (countable and uncountable, plural data recoveries)

(computing, software) The process of retrieving deleted, inaccessible, lost, corrupted, damaged, or formatted data from secondary storage, removable media or files, when the data stored in them cannot be accessed in the usual way.


stegotext

(cryptography) A text that contains a secret subtext encoded via steganography.


covertext

(cryptography) A seemingly innocuous text that contains a secret text encoded within it.


polyrepo

In situation where there is 2 components, polyrepos are sufficient. In situation where there is 50 components, monorepos shine. And the switch is somewhere in between.

2024 May 8, u/Haspe, “Mono repo or not?”, in Reddit, r/golang, archived from the original on 2024-07-22:

(software engineering) A software project in which different components are located in separate code repositories which can be versioned individually (as opposed to a monorepo in which all the code exists within a single repository).


OpenType

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

(computing, typography) A file format, developed jointly by Microsoft Corporation and Adobe Inc., for storing computer fonts.


TrueType

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

(computing, typography) a file format for storing computer fonts developed by Apple Inc.


(computing) Abbreviation of Windows 2000.


WinMe

From Win (clipping of Windows) + Me (Millennium Edition).


language-oriented

programming language
programming language

(programming) Of or pertaining to a software development technique that involves creating a new programming language to solve problems, in which the programmer treats a language as a software building block.


data-oriented

(programming) Of or pertaining to a software engineering approach that focuses on data as the central point of an application.


component-oriented

(programming, software engineering) Of or pertaining to a software development approach that focuses on building components that are loosely-coupled and reusable.


attribute-oriented

(programming, software engineering) Of or pertaining to a technique that adds metadata, or attributes, to program code, which affect the system's semantics.


agent-oriented

(programming, software engineering) Of or pertaining to a programming paradigm where the construction of the software is centered on the concept of externally specified software agents.


process-oriented

(programming, software engineering) Of or pertaining to a programming paradigm that separates the concerns of data structures and the concurrent processes that act upon them.


prototype-oriented

object-oriented programming
object-oriented programming

(programming, software engineering) Of or pertaining to a style of object-oriented programming that uses existing objects as prototypes to reuse behavior.


role-oriented

computer programming
computer programming

(programming, software engineering) Of or pertaining to a form of computer programming which aims at expressing objects in terms that are analogous to a human conceptual understanding of the world.


byte order

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

Under this order the first bit to be sent is the LEAST significant bit (B0) of the MOST significant byte (C0) of the first word, followed by the rest of the bits of this byte, then the same right-to-left bit order inside the left-to-right byte order.

1980 April 1, Danny Cohen, On Holy Wars and a Plea for Peace, IETF, archived from the original on 2014-07-224:

(computing) Order in which bytes are written or read, in memory or through a transmission; choices being big-endian or little-endian.


tweak freak

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

From tweak + freak. Chosen for the rhyme.

(slang, derogatory, computing) A person who modifies software or hardware in order to enhance its performance beyond their normal and acceptable standards.


C family

C family (usually uncountable, plural C families)

(programming) Any one of the several programming languages which share significant features of the C programming language.


calloc

dynamic memory allocation
dynamic memory allocation

(computing) A subroutine in the C programming language's standard library for performing dynamic memory allocation.


calloc

en-verb

calloc (third-person singular simple present callocs, present participle callocing, simple past and past participle calloced)

callocs (present singular third-person)
callocing (participle present)
calloced (participle past)
calloced (past)

(computing) To allocate memory using the C programming language calloc subroutine.


oblique spaceship

en-noun

oblique spaceship (plural oblique spaceships)

(cellular automata) A particular spaceship in Conway's Game of Life, which moves neither orthogonally nor diagonally.


master boot record

master boot record (plural master boot records)

LL-Q1860 (eng)-Flame, not lame-master boot record.wav

(computing, software) A type of boot sector in the first few blocks of partitioned computer mass storage devices.


LLL

low-level language
low-level language#English

(programming) Initialism of low-level language.


Knuthian

The purpose of this paper is to present an algebraic treatment of Knuth's approach to the specification of the semantics of context-free languages. Knuthian systems, hereinafter called K-systems, have been called declarative semantics, K-grammars and attributed grammars.

1976, Laurian M. Chirica, David F. Martin, “An algebraic formulation of Knuthian semantics”, in 17th Annual Symposium on Foundations of Computer Science (SFCS), →DOI, internal citations omitted:

This page lists bugs in the original (Knuthian) TeX distribution which have been received since the last tune-up[.]

2024 October 26 (last accessed), “Pending bugs for original TeX”, in tug.org:

(computer science, mathematics) Of or relating to the work, or theory developed from the work, of American computer scientist and mathematician Donald Knuth.


child category

child category (plural child categories)

(category theory) Synonym of subcategory


evidence-gathering

(computing, criminology) The collection of potential evidence, which may be present in computer or network logs, on deprecated websites, or the collection of data that is forensically extracted from a computer hard drive.


NMP

(computing) A solution stack consisting of the Nginx web server, MySQL or MariaDB database, and PHP programming language.


time reversal signal processing

time reversal signal processing (uncountable)

(signal processing) A technique that either creates an optimal carrier signal for communication, reconstructs a source event, or focuses on high-energy waves to a point in space.


god ray

(computer graphics) A visible shaft of light.


-lang

From lang, itself a shortened form of language.

"One of the biggest ones to point out is that async runtimes are still a bit unclear," noted Thomas. He also said the learning curve was difficult, which chimes with top obstacles to Rust adoption revealed in Rustlang's most recent survey of developers.

2020 April 30, Liam Tung, “Microsoft: Why we used programming language Rust over Go for WebAssembly on Kubernetes app”, in ZDNET, archived from the original on 2024-06-30:

Threat actors are increasingly shifting to "exotic" programming languages such as Go, Rust, Nim, and Dlang that can better circumvent conventional security protections, evade analysis, and hamper reverse engineering efforts.

2021 July 27, Ravie Lakshmanan, “Hackers Turning to 'Exotic' Programming Languages for Malware Development”, in The Hacker News, archived from the original on 2024-05-20:

I don't mind people saying Golang. Once. In a title or a tag or something. So search engines can find it. Once. Once. Fucking once.

[2021 October 8, u/theclapp, “What's up with people not liking the term "golang"?”, in Reddit, r/golang, archived from the original on 2024-08-11:

For the Golang community, it didn't help that the language came out of Google, an advertising platform with accessories.

2023 May 17, Thomas Claburn, “Google Go language goes with opt-in telemetry”, in The Register, archived from the original on 2024-08-02:

Vlang's simplicity and performance are promising, but its novelty results in a lack of comprehensive libraries and the small community. The language is also under constant changes which may cause instability and compatibility issues.

2023 July 26, Alex Lashkov, “The New Wave of Programming Languages: Pony, Zig, Crystal, Vlang, and Julia”, in Hackaday, archived from the original on 2024-07-08:

The researchers noted that DLang is an uncommon choice for writing malware, but a shift towards newer languages and frameworks is one that's been accelerating over the last few years – in malware coding as in the larger programming world.

2023 December 11, Connor Jones, “Memory-safe languages so hot right now, agrees Lazarus Group as it slings DLang malware”, in The Register, archived from the original on 2024-08-02:

programming languages
programming language#Noun

(programming, informal) Combining with the names of programming languages, especially those which may be confused with common English words.


tritemporal

(databases) Keeping track of three timelines


HKT

higher-kinded type
higher-kinded type#English

(programming) Initialism of higher-kinded type.


truststore

certificate authority
certificate authority

(cryptography) A storage area for trusted cryptographic certificates issued by a certificate authority.


Lubarsky's law of cybernetic entomology

The origin of the name Lubarsky in this connection is unknown.

(programming) The humorous observation that any given program always contains at least one more bug.


copartition

(programming) A partition of data streams such that the data in each of the streams has the same partition configuration.


copartition

en-verb

copartition (third-person singular simple present copartitions, present participle copartitioning, simple past and past participle copartitioned)

copartitions (present singular third-person)
copartitioning (participle present)
copartitioned (participle past)
copartitioned (past)

(programming, of partitioned data streams) To ensure that two streams of partitioned data have matching partition configurations.


knowledge mining

artificial intelligence
artificial intelligence

(computing, artificial intelligence) An emerging discipline in artificial intelligence that uses a combination of intelligent services to quickly learn from large amounts of information.


copy-pasto

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

From copy-paste + -o, on the model of typo (“typographical error”).

Sorry, copy-pasto. This line was moved few lines up to here by my evil mouse. :-(

2010 May 27, Jung-uk Kim, “Re: Timezone behavior of Java”, in mailing.freebsd.java (Usenet):

Haven't tested your latest diff, but I think you have a copy-pasto here (", cnt").

2014 January 6, Kent R. Spillner, “Re: new login style: yubikey-and-pwd”, in fa.openbsd.tech (Usenet):

(computing, slang) An error caused by incorrect copy-pasting, often resulting in unintended text (or other content) being inserted.


monocase

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

Coordinate term: duocase

The program prompts for the old password (if any) and then for the new one (twice). The caller must supply these. New passwords should be at least four characters long if they use a sufficiently rich alphabet and at least six characters long if monocase. Only the first eight characters of the password are significant.

1985, Rebecca Thomas, Jean Yates, “Text Processing” (chapter 5), in A User Guide to the UNIX System, 2nd edition, Berkeley, Calif.: Osborne McGraw-Hill, →ISBN, page 281:

The Standard chose to stay with the old restrictions on these external names: they are not guaranteed to be different unless they differ from each other in the first six characters. Worse than that, upper and lower case letters may be treated the same! […] There is nothing to prevent any specific implementation from giving better limits than these, but for maximum portability the six monocase characters must be all that you expect.

1988, Mike Banahan, “Variables and Arithmetic” (chapter 2), in The C Book: Featuring the Draft ANSI C Standard, Wokingham: Addison-Wesley Publishing Company, →ISBN, page 23:

(computing, typography) Supporting or consisting of only one case of letters; either all uppercase or all lowercase; (also), case insensitive, treating upper and lower case as being the same.